6301 Math3course1
6301 Math3course1
Definition
The set of all possible outcomes of a random experiment is called a
sample space and is denoted by Ω
Example
An experiment consists of tossing one coin. The sample space is
Ω = {T , H}
Example
An experiment consists of tossing two coins. The sample space is
Ω = {HH, TH, HT , TT }
Definition
Let Ω be a sample space (nonempty set). A collection F of subsets of Ω is
called field or algebra of Ω if:
1 F is nonempty collection
if (Ei )ni=1 ∈ F then ni=1 Ei ∈ F ( F closed under finite union )
S
2
Remark
1 Ω∈F
2 ∅∈F
3 The algebra F is closed under finite intersection
Example
F = {∅, Ω} is an algebra in Ω, because:
1 F is nonempty?, yes, F contains two elements
2 F closed under finite union ? yes, Ω ∪ ∅ = ∅ ∪ Ω = Ω ∈ F
3 F closed under complement ? yes, Ωc = ∅ ∈ F and ∅c = Ω ∈ F
Therefore, all the conditions are satisfied.
Definition
Let Ω be a nonempty set. A collection F of subset of Ω is called σ-field
or σ-algebra of Ω if:
1 F is nonempty collection
S∞
2 if (Ei )∞
i=1 ∈ F then i=1 Ei ∈ F ( F closed under countable union)
3 if E ∈ F then E c ∈ F ( F closed under complement )
The pair (Ω, F) is called measurable space and the elements of F are
called measurable sets
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Department
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science, 7King
/ 44 Kh
General probability spaces
Example
Let (Ω, F) a given measurable space, check that
Ω is measurable set
∅ is measurable set
If A and B measurable sets, then, A ∩ B measurable set
If A and B measurable sets, then, A/B measurable set ?
If A and B measurable sets, then, A∆B measurable set ?
Theorem
Suppose that (Fi )i∈I is a non-empty collection (indexed by I ) of σ-algebras
Fi on Ω. Then the intersection F = ∩i Fi is also σ-algebra on Ω.
Theorem
Let C be a class of subsets of Ω, there exist a unique smallest σ-algebra,
denoted σ(C), contains C.
Definition
The σ-algebra σ(C) is called σ- algebra generated by C.
Remark
σ(C)= The intersection of all σ- algebra containing C
Example
σ(C) = {A, Ω, ∅, Ac }
Definition
Let F be a topology in Ω, the σ- algebra generated by the collection of the
open sets in F is called Borel σ- algebra in Ω
Theorem
If Ω = R, the Borel σ-algebra is generated by any of the following
collections of subsets of R:
(i) C1 = {] − ∞, x], x ∈ R}
(ii) C2 = {]x, y ], x < y ∈ R}
(iii) C3 = {[x, y ], x < y ∈ R}
Definition
Let (Ω, F) be a measurable space. A measure µ is a function
µ : F 7→ [0, +∞]
A 7→ µ(A)
such that
1 ∀A ∈ F µ(A) ≥ µ(∅) = 0
2 σ-additivity: For all disjoint countable sets
(Ai )∞
i=1 (Ai ∩ Aj = ∅, if i ̸= j)
we have
∞ ∞
!
[ X
µ Ai = Ai .
i=1
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Departmenti=1
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science,14King
/ 44 Kh
General probability spaces
Definition
Definition
If µ(Ω) = 1, µ is called probability measure, and the triple (Ω, F, µ) is
called probability space.
Example
Suppose that Ω is a finite set and consider the trivial σ-algebra
check that
µ(·) = #(·) is probability measure ?
#(·)
P(·) = is probability measure?
#(Ω)
Theorem
2 If A ⊂ B then
3 For all A, B ∈ F
Theorem
Theorem
1 If (An )n a sequence of subsets in F such that ∀ n, An+1 ⊂ An then
!
\
P An = inf (P(An )) = lim P(An )
n≥1 n→∞
n=1
Definition
A collection M of subsets of Ω is called monotone class if
1 Ω∈M
2 If A and B are in M with B ⊂ A then A/B is also ∈ M
3 If (An )n a sequence of subsets in F such that ∀ n, An ⊂ An+1 then
S
n=1 An ∈ M.
Definition
Let C be a class of subsets of Ω, there exist a unique smallest monotone
class, denoted M(C), contains C and is called monotone class generated by
C.
Remark
M(C)= The intersection of all monotone class containing C
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Department
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science,20King
/ 44 Kh
General probability spaces
Definition
Let C be a class of subsets of Ω. If C, is closed under finite intersection, is
called π-system of Ω.
Theorem
Uniqueness of probability measure
Let P1 and P2 be two probability measures on (Ω, F). If, for all subset A
in a π-system C, we have P1 (A) = P2 (A), then P1 = P2 in σ(C) the
σ-algebra generated by C.
and !
[
P2 An = sup(P2 (An )) = lim P2 (An ).
n≥1 n→∞
n=1
As for all n the subset An is ∈ M, then
∀n P1 (An ) = P2 (An )
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Department
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science,24King
/ 44 Kh
General probability spaces
It follows that
lim P1 (An ) = lim P2 (An ).
n→∞ n→∞
We deduce that ! !
[ [
P1 An = P2 An .
n=1 n=1
Definition
Let P be a probability measure defined on (IR, BIR ). The distribution
function (f.d.) of P is defined by
F (x) = P (] − ∞, x]) .
Proposition
P1 = P2 if and only if the distribution function F1 of P1 EQUAL the
distribution function F2 of P2
(II) F1 = F2 ⇒ P1 = P2
(] − ∞, x1 ]∩] − ∞, x2 ] =] − ∞, x1 ] ∈ C.
Moreover, let a1 ≤ a2 ≤ a3 . . . an then
(] − ∞, a1 ]∩] − ∞, a2 ] . . . ∩] − ∞, an ] =] − ∞, a1 ] ∈ C.
the σ(C) contains al the interval of IR. Finally, σ(C) contains the
σ-algebra generated by the intervals which is Borel σ- algebra in IR.
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Department
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science,28King
/ 44 Kh
General probability spaces
Proposition
Let P be a probability measure in (IR, BIR ) and if F its distribution
function. This function has the following properties:
1 F is increasing function
2 F is a right continuous function
3 limx→−∞ F (x) = 0 and limx→+∞ F (x) = 1
4 For all a, b such that a < b we have P(]a, b]) = F (b) − F (a)
5 P(] − ∞, a[) = F (a− ) and P(a) = F (a) − F (a− )
6 F is continuous only and only if P(a) = 0
have ] − ∞, x] ⊂] − ∞, y ]. Then
P (] − ∞, x]) ≤ P (] − ∞, y ]) .
Thus
F (x) ≤ F (y ).
2 For the second claimed result: It suffices to prove that
lim F (x) = F (a).
x→a+
1
To do that, we define a sequence of a subsets An = −∞, a + . It
n
is clear that, for all n ≥ 1 An+1 ⊂ An then from Theorem (20), we
have !
\
P An = inf P(An )) = lim P(An ). (2)
n≥1 n→∞
n=1
Since
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Department
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science,30King
/ 44 Kh
General probability spaces
1 For the first part of the third claimed result: Similarly to the
previous case we define another sequences An =] − ∞, −n] ; n ≥ 1. ,
this sequence such that An+1 ⊂ An then from Theorem (20), we have
!
\
P An = inf P(An )) = lim P(An ). (3)
n≥1 n→∞
n=1
T
Observe that n=1 An = ∅ and P(An ) = F (−n) then, equation (3)
implies that
F (−∞) = lim F (−n) = P(∅) = 0.
n→∞
2 For the second part of the third claimed result: Once again we
define another sequences An =] − ∞, +n] ; n ≥ 1. , this sequence
such that An ⊂ An+1 then from Theorem (20), we have
!
[
P An = sup P(An )) = lim P(An ). (4)
n≥1 n→∞
n=1
1 Now, we prove, the fourth claimed result: For this aim, we use
the fact that
]a, b] =] − ∞, b]/] − ∞, a],
therefore, as
] − ∞, a] ⊂] − ∞, b]
then
P (]a, b]) = P (] − ∞, b]/] − ∞, a])
= P (] − ∞, b]) − P (] − ∞, a]) = F (b) − F (a)
In conclusion, we can write P ]a, b] = F (b) − F (a)
By: Ali Laksaci ( Program: Master of Science inProbability
Mathematics,
Theories:
Department
6301Math3
of Mathematical Science,
JanuaryCollege
20, 2024
of Science,32King
/ 44 Kh
General probability spaces
1 For the first part of the fifth claimed result Using, the same
arguments as the previous case and consider a sequences
1
An =] − ∞, a − ] n ≥ 1,
n
this sequence such that An ⊂ An+1 then from Theorem (20), we have
!
[
P An = sup P(An )) = lim P(An ). (5)
n≥1 n→∞
n=1
1 For the second part of the fifth claimed result Similarly to the
fourth case, we use the fact that
therefore, as
] − ∞, a[⊂] − ∞, a]
then
P ({a}) = P (] − ∞, a]/] − ∞, a[)
= P (] − ∞, a]) − P (] − ∞, a[) = F (a) − F (a− )
In consequence, we have
1 For the last claimed result, Evidently, F is continuous only and only
if
F (a+ ) = F (a) = F (a− )
which is equivalent to write
P{a} = 0.
Definition
Let A be a measurable set in probability space (Ω, F, P) such that
P(A) > 0. The conditional probability , given A, is the function denoted
by P(|A) defined by
P(A ∩ B)
∀B ∈ F P(B|A) = .
P(A)
Exercise
Is P(·|A) probability measure?
Theorem
Multiplicative Theorem
Let A1 , A2 , . . . An be a n measurable sets such that
!
\
P nAi > 0.
i=1
Then
!
\
P nAi = P (An |A1 ∩ A2 ∩ . . . ∩ An−1 )×P (An−1 |A1 ∩ A2 ∩ . . . ∩ An−2 )×
i=1
Theorem
Total Probability Theorem
Let A1 , A2 , . . . An . . . be a measurable sets such that
[
∀ i ̸= j Ai ∩ Aj ≠ ∅ ∞Ai = Ω and P(Ai ) > 0.
i=1
Then
∞
X
∀B ∈ F P(B) = P(B|Ai )P(Ai ).
i=1
Theorem
Bayes Formula
Let A1 , A2 , . . . An . . . be a measurable sets such that
[
∀ i ̸= j Ai ∩ Aj ≠ ∅ ∞Ai = Ω and P(Ai ) > 0.
i=1
Then
P(B|Ai )P(Ai )
∀B ∈ F such that P(B) > 0 P(Ai |B) = P∞ .
i=1 P(B|Ai )P(Ai )
Definition
Suppose that (Ω1 , F1 ) and (Ω2 , F2 ) are measurable spaces. The
σ-algebra, denoted F1 ⊗ F2 on Ω1 × Ω2 generated by
Definition
Two measurable sets A and B in a probability space (Ω, F, P) are said to
be independent if
P(A ∩ B) = P(A)P(B).
Definition
The n measurable sets A1 , A2 , . . . An . . . are said to be completely
independent if
∀ collection Ai1 , Ai2 , . . . Aik
such that P(Ai1 ∩ Ai2 ∩ . . . ∩ Aik ) = P(Ai1 ).P(Ai2 ). . . . P(Aik )).
These measurable sets are said to be pairwise independent if
Exercise
If A and B are independent then
A and B c are independent
Ac and B are independent
Ac and B c are independent
Definition
Suppose that (Ω1 , F1 , P1 ) and (Ω2 , F2 , P2 ) are probability space. The
σ-algebra, denoted F1 ⊗ F2 on Ω1 × Ω2 generated by the collection
C = {A1 × A2 A1 ∈ F1 and A2 ∈ F2 }
Definition
In the the product space (Ω1 × Ω2 , F1 ⊗ F2 ) we define a probability
measure P = P1 × P2 such that