Professional Documents
Culture Documents
P( A B )
P( A | B) = , P ( B ) 0.
P( B)
FX ( x ) = P X ( ) x ,
P ( X ( ) x ) B
FX ( x | B ) = P X ( ) x | B = .
P( B)
P ( X ( ) + ) B P( B)
FX ( + | B ) = = = 1,
P( B ) P( B)
P ( X ( ) − ) B P ( )
FX ( − | B ) = = = 0.
P( B ) P( B)
Conditional Probability Density Function
▪ Further, P ( x1 X ( ) x2 ) B
P ( x1 X ( ) x2 | B ) =
P( B )
= FX ( x2 | B ) − FX ( x1 | B ),
▪ Since for x2 x1 ,
( X ( ) x2 ) = ( X ( ) x1 ) ( x1 X ( ) x2 ) .
dFX ( x | B )
f X ( x | B) = ,
dx
x
FX ( x | B ) = −
f X (u | B )du.
P ( x1 X ( ) x2 | B ) =
x2
x1
f X ( x | B ) dx.
Example
Solution
FX (x ) FX ( x | B )
1 1
q
x x
1 1
(a) (b)
Example - continued
▪ For 0 x 1, X ( ) x = T , so that
( X ( ) x ) B = T H = and FX ( x | B ) = 0.
▪ For x 1, X ( ) x = , and
( X ( ) x ) B = B = {B} and FX ( x | B ) =
P( B)
=1
P( B)
FX ( x | B )
1
x
1
Example
Solution
P ( X x ) ( X a )
FX ( x | B ) = .
P( X a )
▪ For x a , (X x ) ( X a ) = ( X x ) so that
P(X x ) F ( x)
FX ( x | B ) = = X .
P(X a ) FX ( a )
▪ For x a , (X x) (X a ) = ( X a) so that FX ( x | B ) = 1.
Example - continued
▪ Thus
FX ( x )
, x a,
FX ( x | B ) = FX ( a )
1, x a,
▪ and hence
f X ( x)
d , x a,
f X ( x | B) = FX ( x | B ) = FX ( a )
dx
0, otherwise.
FX ( x | B )
f X ( x | B)
1
f X (x )
FX (x )
a x a x
(a) (b)
Example
Solution
FX ( x | B ) = P X ( ) x | B
P ( X ( ) x ) (a X ( ) b )
=
P (a X ( ) b )
P( X ( ) x ) (a X ( ) b )
= .
FX (b) − FX ( a )
Example - continued
f X ( x | B)
▪ Thus, f X ( x)
, a x b,
f X ( x | B ) = FX (b) − FX ( a ) f X ( x)
0, otherwise.
a x
b
Conditional p.d.f & Bayes’ Theorem
▪ First, we extend the conditional probability results to random variables:
▪ We know that If U = [ A1 , A2 , , An )] is a partition of S and B is an arbitrary event,
then:
P ( B ) = P ( B | A1 ) P ( A1 ) + + P ( B | An ) P ( An )
▪ By setting B = { X x} we obtain:
P ( X x) = P ( X x | A1 ) P ( A1 ) + + P ( X x | An ) P ( An )
Hence
F ( x) = F ( x | A1 ) P ( A1 ) + + F ( x | An ) P ( An )
f ( x) = f ( x | A1 ) P ( A1 ) + + f ( x | An ) P ( An )
A1 , An form a partition on S
Conditional p.d.f & Bayes’ Theorem
▪ Using: P ( B | A) P ( A)
P( A | B) = .
P( B)
▪ We obtain: P (X x | A) F (x | A )
PA | X x ) = P ( A) =
P (X x ) F (x ) P ( A)
▪ For B = x1 X ( ) x2 ,
P ( x1 X x 2 | A)
PA | x1 X x 2 = P ( A)
P ( x1 X x 2 )
x2
F ( x | A) − FX ( x1 | A)
= X 2 P ( A) =
x1
f X ( x | A) dx
P ( A).
FX ( x 2 ) − FX ( x1 ) x2
x1
f X ( x ) dx
Conditional p.d.f & Bayes’ Theorem
f X ( x | A)
lim PA | ( x X x + ) = P ( A | X = x ) = P ( A).
→0 f X ( x)
▪ or
P( A | X = x ) f X ( x)
f X | A ( x | A) = .
P ( A)
▪ we also get
+ +
P ( A) f X ( x | A)dx = P ( A | X = x ) f X ( x )dx ,
− −
1
+
▪ or P ( A) = −
P ( A | X = x ) f X ( x )dx (Total Probability Theorem)
Bayes’ Theorem (continuous version)
P( A | X = x ) f X ( x )
f X | A ( x | A) = +
.
−
P ( A | X = x ) f X ( x )dx
Excersise: Coin Tossing Problem
Solution
▪ Let B= “head occurring in the (n+1)th toss, given that k heads have occurred in n
previous tosses”.
▪ Clearly P ( B | P = p ) = p, 1
▪ From Total Probability Theorem, P ( B ) = P ( B | P = p ) f P ( p | A)dp.
0
1 ( n + 1)! k +1
▪ Using (1) in (2), we get: P (B ) = p . k n −k
p q dp =
0 ( n − k )!k ! n +2
▪ Thus, if n =10, and k = 6, then
7
P( B) = = 0.58,
12
17