Chapter 1 Set Theory Flashcards

1
Q

S

A

outcome space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

outcome space is:

A

set of all possible events

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

disjoint

A

A intersect B = empty set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

event

A

set of possible outcomes in a sample space

A={x imo S: x imo A} (imo=is a member of)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

S is partitioned by B

A

If AiAj are pairwise disjoint AND U over all Ai = S, the collection Ai form a partition of S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Properties of Probability

A

Kolmogorov Axioms (for A imo B (Borel))

  1. P(B)>=0 for all A in B
  2. P(S)=1
  3. If Ai are imo B and pairwise disjoint, P(UAi)=sum P(Ai)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Probability of A^c=

A

P(A^c) = 1-P(A) (remember A and A^c partition S)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

P(B and not A)=

A

P(BA^c) = P(B int A^c) = P(B)-P(B int A)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

P(A U B) =

A

P(A OR B) = P(A) + P(B) - P(AB)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Probability of equally likely outcomes

A

P(A)=#A/#S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A U B (set notation)

A

{x: x is a member of A OR x is a member of B}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

A intersect B (set notation)

A

{x: x is a member of A AND x is a member of B}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A^c (set notation)

A

{x: x is NOT a member of A}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

associative prop of sets

A

AU(BUC)=(AUB)UC works for intersect as well, but NOT mixed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

commutativity

A

AUB=BUA works for intersect as well

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Distributive Laws

A

AU(BintC)=(AUB)int(AUC)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

DeMorgans Laws

A

(AUB)^c = A^c int B^c

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

UAi (set notation)

A

{x is a member of S; x is a member of Ai for some i}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

INT Ai (set notation)

A

{x is a member of S; x is a member of Ai for all i}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Sigma Algebra

A

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)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Relation between Sigma Algebra and probability

A

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)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Axiom of Finite Additivity

A

IF A and B are disjoint and imo SA, P(AUB)=P(A)+P(B)

23
Q

P(BA^c) =

A

P(B)-P(AB)

24
Q

P(AUB)=

A

P(A)+P(B)-P(AB)

25
Q

If A is contained in B, then

A

P(A) le P(B)

26
Q

Bonferroni’s Inequality

A

P(AB)>=P(A)+P(B)-1

27
Q

P(A)= in terms of a partition set Ci

A

P(A)=sum(P(A int Ci)) if Ci’s partition A

28
Q

A\B

A

part of A NOT in B {x:x imo A AND x !imo B}

29
Q

P(A|B)=

A

P(A int B)/P(B)

30
Q

Bayes’ Rule

A

P(A|B)=P(B|A)*P(A)/P(B)

31
Q

P(A int B) =

A

P(A|B)P(B) OR

P(B|A)P(A)

32
Q

P(A|B) = ? in terms of P(B|A)

A

P(B|A)*P(A) / P(B)

33
Q

General Bayes’ Rule

A

P(Ai|B) = P(B|Ai)*P(Ai) / (sum [ P(B|Aj) * P(Aj) ] )

34
Q

Two events are statistically independent IF

A

P(A int B) = P(A)P(B)

35
Q

Probability is (descriptive words)

A

a real valued function mapping events to [0,1] that measures the randomness of an event

36
Q

union

A

A U B = {x imo S: x imo A OR x imo B}

37
Q

intersection

A

A int B = AB = {x imo S: x imo A AND x imo B}

38
Q

compliment

A

A^c = {x imo S: x ! imo A}

39
Q

{Ai} partitions S IIF

A

Ai int Aj = 0 for all i != j AND UAi=S for all i

40
Q

Probability Space happens when

A

We have specified (S, B, P)

41
Q

P(0) =

A

0

42
Q

P(A^c) =

A

1-P(A)

43
Q

P(AUB)=

A

P(A) + P(B) - P(A int B)

44
Q

P(B int A^c)=

A

P(B) - P(AB)

45
Q

P(A int B) >=

A

P(A) + P(B) -1 (Bonferroni’s inequality)

46
Q

Domain of Probability

A

B (Sigma Algebra associated with P) {S, B, P)

47
Q

Boole’s Inequality

A

P(UAi) le sum(P(Ai))

48
Q

IF A subset B, P(A)

A

P(A) le P(B)

49
Q

P(A|B) when A and B are disjoint

A

P(B|A)*P(A) / P(B) but P(A)=0; so P(A|B)=0

50
Q

IF A and B are independent, so are the following:

A

A and B^c
A^c and B
A^c and B^c

51
Q

Define probability

A

Given a sample space, S, with Sigma Algebra, B, a probability function measure is (any assigned) real-valued function with domain B that satisfies the Kolmogorov Axioms:

  1. Pr(A) ge 0
  2. Pr(S) = 1
  3. P(union Ai) = sum (P(Ai)) for any Ai in B, and Ai are mutually exclusive
52
Q

Bayes P(A|X)=

A

P(X|A)P(A) / ( P(X|A)P(A) + P(X| not A)*P(not A) )

53
Q

Chain rule

A

P(ABCD)=
P(A|BCD)P(BCD)
P(A|BCD)
P(B|CD)P(CD)
P(A|BCD)
P(B|CD)P(C|D)P(D)