Chapter 1 Set Theory Flashcards
S
outcome space
outcome space is:
set of all possible events
disjoint
A intersect B = empty set
event
set of possible outcomes in a sample space
A={x imo S: x imo A} (imo=is a member of)
S is partitioned by B
If AiAj are pairwise disjoint AND U over all Ai = S, the collection Ai form a partition of S
Properties of Probability
Kolmogorov Axioms (for A imo B (Borel))
- P(B)>=0 for all A in B
- P(S)=1
- If Ai are imo B and pairwise disjoint, P(UAi)=sum P(Ai)
Probability of A^c=
P(A^c) = 1-P(A) (remember A and A^c partition S)
P(B and not A)=
P(BA^c) = P(B int A^c) = P(B)-P(B int A)
P(A U B) =
P(A OR B) = P(A) + P(B) - P(AB)
Probability of equally likely outcomes
P(A)=#A/#S
A U B (set notation)
{x: x is a member of A OR x is a member of B}
A intersect B (set notation)
{x: x is a member of A AND x is a member of B}
A^c (set notation)
{x: x is NOT a member of A}
associative prop of sets
AU(BUC)=(AUB)UC works for intersect as well, but NOT mixed
commutativity
AUB=BUA works for intersect as well
Distributive Laws
AU(BintC)=(AUB)int(AUC)
DeMorgans Laws
(AUB)^c = A^c int B^c
UAi (set notation)
{x is a member of S; x is a member of Ai for some i}
INT Ai (set notation)
{x is a member of S; x is a member of Ai for all i}
Sigma Algebra
A collection of subsets S is called a SA (B) IF:
a) 0 is a member of B
b) If A is a member of B, then A^c is an element of B
c) If Ai is a member of B, then U Ai is a member of B (closed)
Relation between Sigma Algebra and probability
Let S={s1,s2,..sn}. Let B be any SA of subsets of S. Let p1, p2, p3, … pn be nonnegative numbers that sum to 1. For any A in B, define P(A) = sum pi {i:si is a member of A)