Proof of Conditional Jensen's Inequality
📂Probability TheoryProof of Conditional Jensen's Inequality
Theorem
Given a probability space (Ω,F,P) and a sub-sigma field G⊂F, let’s assume X is a random variable.
Regarding the convex function ϕ:R→R and ϕ(X)∈L1(Ω),
ϕ(E(X∣G))≤E(ϕ(X)∣G)
- A function is said to be convex if, for all x,y∈R and α∈[0,1], it satisfies the following:
ϕ(αx+(1−α)y)≤αϕ(x)+(1−α)ϕ(y)
- G being a sub-sigma field of F means they are both sigma fields of Ω, but G⊂F.
Description
The conditional Jensen’s inequality guarantees that the expected value form of Jensen’s inequality applies the same way conditionally, as the name implies.
Proof
Properties of conditional expectation:
- If X is F-measurable, then E(X∣F)=X a.s.
- For constants a and b, E(aX+b∣G)=aE(X∣G)+b a.s.
Since ϕ is convex, for all μ∈R,
ϕ(x)≥m(x−μ)+ϕ(μ)
there exists a slope m that satisfies it. Now setting μ:=E(X∣G) and taking the conditional expectation E(⋅∣G) of (1), both μ and ϕ(E(X∣G)) are G-measurable, thus
E(ϕ(X)∣G)≥=====mE(X−μ∣G)+E(ϕ(μ)∣G)mE(X∣G)−mE(E(X∣G)∣G)+E(ϕ(μ)∣G)mE(X∣G)−mE(X∣G)+E(ϕ(μ)∣G)E(ϕ(μ)∣G)E(ϕ(E(X∣G))∣G)ϕ(E(X∣G))
■
See Also