John Moriarty: C C C 1 2 3 K 1 K
John Moriarty: C C C 1 2 3 K 1 K
John Moriarty: C C C 1 2 3 K 1 K
1. probability spaces
Suppose we wish to make a probability model. We should do three
things:
Find a way to represent every possible outcome
Decide which sets of outcomes (events) are interesting
Assign a probability to each event
If we do these things in a mathematically consistent way, we can use
theorems of classical probability to draw conclusions about our model.
Some of these conclusions might be surprising, some might be obvious;
they may be used to save lives (rare event modelling) or used to make
money (financial modelling).
Example Modelling football matches; hedge funds. How might you
model a football match, following the above three steps?
How can we ensure that a probability model is mathematically consistent, so that the theorems of classical probability (eg. law of large
numbers, central limit theorem) apply?
Definition 1.1. (Probability space). A probability space is a triplet
(, F, P ) such that
is a set (referred to as the sample space).
F is a -field on , i.e. a collection of subsets of such that
(i) F
(ii) If A F, then also AC F (here AC is the complement
of A, i.e. AC = { : S6 A}.
(iii) If A1 , A2 , A3 , ... F, then
k=1 Ak F.
Elements of F are referred to as events.
P : F [0, 1] and
(i) P () = 1
(ii) If A1 , A2 , A3 , ... F are disjoint, then
P(
Ak ) =
k=1
X
k=1
P (Ak ).
JOHN MORIARTY
Remark It can be shown that not only the union of a countable family
of events is in F (compare (iii) above), but also the intersection of such
a family has to be in F (compare the Exercise sheet 1).
Example 1. Suppose = {A, B, C, D} and that {{A, B}, {C}} F.
Which other subsets must F contain? 2. Suppose P ({A, B}) = 0.5.
What is P ({C, D})? How much freedom of choice remains in this
probability model?
Example A coin is flipped three times, and the outcome is recorded.
The probability space corresponding to the coin being fair is given
by (, F, P ) where
= {HHH, HHT, HT H, HT T, T HH, T HT, T T H, T T T },
F is the set of all subsets of (thus for example {HHH, HT H, T T T }
is an event), and
|A|
P (A) =
8
for any A F (here |A| = the number of elements in the set A). It is
easily checked that (, F, P ) indeed is a probability space.
Definition 1.2. (Independence). Two events A, B F are independent if
P (A B) = P (A)P (B).
More generally, a collection {Ai : i I} F of events is independent
if
Y
\
P (Ai )
P ( Ai ) =
iJ
iJ
LECTURE NOTES 1
27 if = HHH
9 if {HHT, HT H, T HH}
X() =
3 if {HT T, T HT, T T H}
1 if = T T T.
The distribution function F of X is given by
0
if x < 1
1/8
if 1 x < 3
4/8 if 3 x < 9
F (x) =
7/8 if 9 x < 27
1
if x 27
JOHN MORIARTY
Example (Indicator functions) Let A F be an event.
indicator of A is the random variable 1A defined by
1 if A
1A () :=
0 if
/ A.
The distribution function F
F (x) =
The
of 1A is given by
0
if x < 0
1 P (A) if 0 x < 1
1
if x 1
LECTURE NOTES 1
jJ
A=
An .
m=1 n=m
Result :
n=1
n=1
An
m=1 n=m
An
n=m
P (Am ) 0
n=m
[
m=1 n=m
AC
n.
JOHN MORIARTY
Y
\
\
C
C
P (AC
An ) = lim
P(
An ) = lim P (
n)
r
n=m
=
=
lim
n=m
r
Y
n=m
(1 P (An )) lim
n=m
lim exp{
r
X
r
Y
exp{P (An )}
n=m
P (An )} = 0,
n=m
[
\
C
C
P (A ) = P (
An ) = lim P (
AC
n ) = 0,
m
m=1 n=m
n=m
so
P (A) = 1
which finishes the proof.
X
X
P (An ) =
P (E) = ,
n=1
n=1
but
P (An i.o.) = P (E) < 1.
This example shows that the assumption of independence in the Second
Borel-Cantelli Lemma is crucial.
Question Suppose that I play a sequence of lottery games. In the nth
game there are n lottery tickets, each with an equal chance of winning.
I buy one ticket for each lottery. Am I always guaranteed another win
if I continue playing long enough?