aboutsummaryrefslogtreecommitdiff
path: root/houdre
diff options
context:
space:
mode:
authorHolden Rohrer <hr@hrhr.dev>2020-08-28 00:52:42 -0400
committerHolden Rohrer <hr@hrhr.dev>2020-08-28 00:52:42 -0400
commitc77f55c53d1ae62e65e0dd230980c2f41b097584 (patch)
tree9f62c20caf5d1b1e4e316fad4bcfd41ff293ff4b /houdre
parent33e8cefda3fbf89666beff7f6269863e8615a09b (diff)
have notes
Diffstat (limited to 'houdre')
-rw-r--r--houdre/03_foundations26
1 files changed, 26 insertions, 0 deletions
diff --git a/houdre/03_foundations b/houdre/03_foundations
new file mode 100644
index 0000000..03d76da
--- /dev/null
+++ b/houdre/03_foundations
@@ -0,0 +1,26 @@
+A probability space is Omega, an event space, and P: E -> [0,+\infty)
+
+Why do we use infinite sums (A_1...A_\infty) instead of just finite sum?
+
+Ex. relevant question: I have a fair coin and I flip it until I get a
+tails. Are you sure you'll eventually get tails?
+
+Yes.
+
+Lemma: What are the odds that n coin flips result in no tails?
+Complement: What are the odds that n coin flips result in only heads?
+
+Each flip is independent and fair, so:
+
+P(A_1 \cap A_2 \cap \ldots \cap A_n) = 1/2^n
+P("""^C) = 1 - 1/2^n
+
+Using an infinite union A_1...A_\omega = lim_n->\infty P(A_1\cap...A_n)
+
+This axiom defines this relation.
+
+Properties of probabilities (can be derived from original axioms):
+ For all A \in E, P(A^C) = 1-P(A)
+ For all A,B \in E, if A \subset B, P(A) \leq P(B)
+ For all A,B \in E, P(A \cup B) = P(A)+P(B)-P(A\cap B)
+ Can construct Poincare lemma or inclusion/exclusion.