59.9. CONDITIONAL PROBABILITY 1883

Definition 59.8.5 For µ a probability measure on the Borel sets of Rn,

φ µ (t)≡∫Rn

eit·xdµ.

Theorem 59.8.6 Let µ and ν be probability measures on the Borel sets of Rp and supposeφ µ (t) = φ ν (t) . Then µ = ν .

Proof: The proof is identical to the above. Just replace λ X with µ and λ Y with ν .

59.9 Conditional ProbabilityHere I will consider the concept of conditional probability depending on the theory ofdifferentiation of general Radon measures. This leads to a different way of thinking aboutindependence.

If X,Y are two random vectors defined on a probability space having values in Rp1 andRp2 respectively, and if E is a Borel set in the appropriate space, then (X,Y) is a randomvector with values inRp1×Rp2 and λ (X,Y) (E×Rp2) = λ X (E), λ (X,Y) (Rp1 ×E) = λ Y (E).Thus, by Theorem 31.2.3 on Page 1085, there exist probability measures, denoted here byλ X|y and λ Y|x, such that whenever E is a Borel set in Rp1 ×Rp2 ,∫

Rp1×Rp2XEdλ (X,Y) =

∫Rp1

∫Rp2

XEdλ Y|xdλ X,

and ∫Rp1×Rp2

XEdλ (X,Y) =∫Rp2

∫Rp1

XEdλ X|ydλ Y.

Definition 59.9.1 Let X and Y be two random vectors defined on a probability space. Theconditional probability measure of Y given X is the measure λ Y|x in the above. Similarlythe conditional probability measure of X given Y is the measure λ X|y.

More generally, one can use the theory of slicing measures to consider any finite list ofrandom vectors, {Xi}, defined on a probability space with Xi ∈Rpi , and write the followingfor E a Borel set in ∏

ni=1Rpi .∫

Rp1×···×RpnXEdλ (X1,···,Xn)

=∫Rp1×···×Rpn−1

∫Rpn

XEdλ Xn|(x1,··· ,xn−1)dλ (X1,···,Xn−1)

=∫Rp1×···×Rpn−2

∫Rpn−1

∫Rpn

XEdλ Xn|(x1,··· ,xn−1)dλ Xn−1|(x1,··· ,xn−2)dλ (X1,···,Xn−2)

...∫Rp1· · ·∫Rpn

XEdλ Xn|(x1,··· ,xn−1)dλ Xn−1|(x1,··· ,xn−2) · · ·dλ X2|x1dλ X1 . (59.9.13)

Obviously, this could have been done in any order in the iterated integrals by simply modi-fying the “given” variables, those occurring after the symbol |, to be those which have beenintegrated in an outer level of the iterated integral. For simplicity, write

λ Xn|(x1,··· ,xn−1) = λ Xn|x1,··· ,xn−1

59.9. CONDITIONAL PROBABILITY 1883Definition 59.8.5 For u a probability measure on the Borel sets of R",o, (t) = I. edu.Theorem 59.8.6 Let tt and v be probability measures on the Borel sets of R? and suppose,, (t) = 9, (t). Then w= v.Proof: The proof is identical to the above. Just replace Ax with u and Ay withv. J59.9 Conditional ProbabilityHere I will consider the concept of conditional probability depending on the theory ofdifferentiation of general Radon measures. This leads to a different way of thinking aboutindependence.If X, Y are two random vectors defined on a probability space having values in R?! andR?2 respectively, and if E is a Borel set in the appropriate space, then (X,Y) is a randomvector with values in R?! x IR’? and A(x y) (E xR’) =Ax (E), Acxy) (R”! x E) =Ay (E).Thus, by Theorem 31.2.3 on Page 1085, there exist probability measures, denoted here byAxly and Ay), such that whenever E is a Borel set in R?! x R??,| Redhxy = [ Reddyygdhx,R?1 xR?2 R?1 JR?2andDon on etxy) = | Peddxyddy.R?1 xR?2 R?2 JR?1Definition 59.9.1 Let X and Y be two random vectors defined on a probability space. Theconditional probability measure of Y given X is the measure Ayx in the above. Similarlythe conditional probability measure of X given Y is the measure Axly-More generally, one can use the theory of slicing measures to consider any finite list ofrandom vectors, {X;}, defined on a probability space with X; € R”‘, and write the followingfor E a Borel set in []/_, R?.| ed x,..x,) = | © Bed Ax, oxy 1) EX ooon om E (X1, Xn) RP1 x. xRPn-1 RPn E Xnl(x1, Xn-1) (Xi, Xn—1)= Don Rn RedAx, |x, vo Xp-1 )ddx,_, (x1 so XA (X) vy Xp2)R?1 x- x RPn-2bh Sgpn BAN xh 815 X14 AK 4 \ (1 Xn2) 7 Ax, AX, - (59.9.13)Obviously, this could have been done in any order in the iterated integrals by simply modi-fying the “given” variables, those occurring after the symbol |, to be those which have beenintegrated in an outer level of the iterated integral. For simplicity, writeAX (10 1) = AX nfo Kn