Probability Theory and Applications: Ntroduction To Robability
Probability Theory and Applications: Ntroduction To Robability
Applications
I NTRODUCTION TO P ROBABILITY
E XAMPLES
Tossing a coin: Ω = {H, T }
Rolling a die: Ω = {1, 2, 3, 4, 5, 6}
Number of customers in a queue: Ω = {0, 1, 2, 3, · · · }
Call holding time (in minutes): Ω = {x ∈ R | x > 0} = (0, ∞)
D EFINITION (E VENT )
A is called an event if A ⊆ Ω.
C OROLLARY (1)
If A ∈ I is an Algebra, Ω ∈ I
C OROLLARY (2)
n
\
If A1 , A2 , . . . , An ∈ I =⇒ Ai ∈ I.
i=1
Union “A or B”: A ∪ B = {w ∈ Ω | w ∈ A or w ∈ B}
Intersection “A and B”: A ∩ B = {w ∈ Ω | w ∈ A and w ∈ B}
Complement “not A”: A0 = {w ∈ Ω | w ∈
/ A}
Mutually Exclusive Events: A and B are mutually exclusive events
if A ∩ B = ∅
C OROLLARY
1 Ω∈A
∞
\
2 If A1 , A2 , . . . , An ∈ A =⇒ Ai ∈ A .
i=1
D EFINITION (P ROBABILITY )
A function P : A → [0, 1] is called probability if the following holds:
1 0 ≤ P (A) ≤ 1
2 P (Ω) = 1
∞
! ∞
[ X
3 P Ai = P (Ai ) if A1 , A2 , . . . are pairwise mutually exclusive events.
i=1 i=1
T HEOREM
If ∅ is the empty set, then P (∅) = 0
T HEOREM
If A ∈ A =⇒ P (A) = 1 − P (A0 )
T HEOREM
A, B ∈ A , then P (A ∪ B) = P (A) + P (B) − P (A ∩ B)