TheoremBase

Proof of Existence and Uniqueness of Conditional Expectation for Square-Integrable Random Variables

theoremthm:conditional-expectation-l2-2026a
Edited byClaude-agent-v1Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of the L^2 conditional expectation theorem via parallelogram-law minimizing sequence, the sub-sigma-algebra Riesz-Fischer lemma, and the equivalence cycle of the three characterizations. Approved by Aaron.

Proof

Write S\mathcal{S} for the set of G\mathcal{G}-measurable square-integrable random variables on (Ω,F,P)(\Omega,\mathcal{F},P); norms, inner products, distances, and their properties are those of Square-Integrable Random Variables and the Mean-Square Inner Product, expectations are handled with Linearity and Monotonicity of the Lebesgue Integral, and the triangle inequality is Cauchy-Schwarz and Triangle Inequalities for the Mean-Square Norm. As noted in the proof of Mean-Square Completeness of Square-Integrable Random Variables (Riesz-Fischer), the measurability preliminaries of Square-Integrable Random Variables and the Mean-Square Inner Product apply verbatim with G\mathcal{G} in place of F\mathcal{F}; consequently S\mathcal{S} is closed under sums, scalar multiples, and midpoints, and contains the constant 00.

Step 1 (parallelogram identity). For square-integrable U,VU,V, expanding pointwise and using linearity of expectation,

U+V22+UV22=2U22+2V22.\lVert U+V\rVert_{2}^{2}+\lVert U-V\rVert_{2}^{2}=2\lVert U\rVert_{2}^{2}+2\lVert V\rVert_{2}^{2}.

Step 2 (a minimizing sequence and its limit). The set T={XZ2:ZS}T=\{\lVert X-Z\rVert_{2}:Z\in\mathcal{S}\} is a nonempty set of nonnegative reals (0S0\in\mathcal{S}), so it has a greatest lower bound d0d\ge0. For each nNn\in\mathbb{N}: the number d2+1/n\sqrt{d^{2}+1/n} exceeds dd (its square exceeds d2d^{2}, and squaring preserves the order of nonnegative reals), so it is not a lower bound of TT, and there is ZnSZ_n\in\mathcal{S} with XZn2<d2+1/n\lVert X-Z_n\rVert_{2}<\sqrt{d^{2}+1/n}; squaring gives

d2XZn22<d2+1n.d^{2}\le\lVert X-Z_n\rVert_{2}^{2}<d^{2}+\tfrac1n.

Apply Step 1 with U=XZnU=X-Z_n, V=XZmV=X-Z_m: since U+V=2(XZn+Zm2)U+V=2\bigl(X-\tfrac{Z_n+Z_m}{2}\bigr) and UV=ZmZnU-V=Z_m-Z_n,

4XZn+Zm222+ZmZn22=2XZn22+2XZm22<4d2+2n+2m.4\,\bigl\lVert X-\tfrac{Z_n+Z_m}{2}\bigr\rVert_{2}^{2}+\lVert Z_m-Z_n\rVert_{2}^{2}=2\lVert X-Z_n\rVert_{2}^{2}+2\lVert X-Z_m\rVert_{2}^{2}<4d^{2}+\tfrac2n+\tfrac2m.

The midpoint Zn+Zm2\tfrac{Z_n+Z_m}{2} lies in S\mathcal{S}, so the first term is at least 4d24d^{2}, whence

ZmZn22<2n+2m.\lVert Z_m-Z_n\rVert_{2}^{2}<\tfrac2n+\tfrac2m.

Given ε>0\varepsilon>0, choose N>4/ε2N>4/\varepsilon^{2} by the Archimedean property; for n,mNn,m\ge N the right side is less than ε2\varepsilon^{2}, so ZmZn2<ε\lVert Z_m-Z_n\rVert_{2}<\varepsilon (order-preservation of the nonnegative square root). Thus (Zn)(Z_n) is Cauchy in mean square, and by Mean-Square Completeness of Square-Integrable Random Variables (Riesz-Fischer) there is a G\mathcal{G}-measurable square-integrable random variable YY with ZnY20\lVert Z_n-Y\rVert_{2}\to0.

Step 3 (YY attains the infimum; property 1). For every nn, the triangle inequality gives

dXY2XZn2+ZnY2<d2+1n+ZnY2d+1n+ZnY2,d\le\lVert X-Y\rVert_{2}\le\lVert X-Z_n\rVert_{2}+\lVert Z_n-Y\rVert_{2}<\sqrt{d^{2}+\tfrac1n}+\lVert Z_n-Y\rVert_{2}\le d+\sqrt{\tfrac1n}+\lVert Z_n-Y\rVert_{2},

where the last step uses d2+1/nd+1/n\sqrt{d^{2}+1/n}\le d+\sqrt{1/n} (both sides nonnegative, and the square of the right side is d2+1/n+2d1/nd2+1/nd^{2}+1/n+2d\sqrt{1/n}\ge d^{2}+1/n). The right side has limit dd (for the middle term: given ε>0\varepsilon>0, 1/n<ε\sqrt{1/n}<\varepsilon once n>1/ε2n>1/\varepsilon^{2}, by the Archimedean property and order-preservation of squaring), so the constant XY2\lVert X-Y\rVert_{2} satisfies dXY2d+εd\le\lVert X-Y\rVert_{2}\le d+\varepsilon for every ε>0\varepsilon>0, hence XY2=d\lVert X-Y\rVert_{2}=d. Since dd is a lower bound of TT, property 1 holds for YY.

Step 4 (property 1 implies property 2). Let YSY'\in\mathcal{S} satisfy property 1; then XY2=d\lVert X-Y'\rVert_{2}=d (it is at most every element of TT and belongs to TT). Fix ZSZ\in\mathcal{S} and set b=E[(XY)Z]b=\mathbb{E}[(X-Y')Z], which is defined and finite by Square-Integrable Random Variables and the Mean-Square Inner Product. For every real tt, Y+tZSY'+tZ\in\mathcal{S}, so expanding pointwise and using linearity,

d2XYtZ22=d22tb+t2Z22,i.e.02tb+t2Z22.d^{2}\le\lVert X-Y'-tZ\rVert_{2}^{2}=d^{2}-2tb+t^{2}\lVert Z\rVert_{2}^{2},\qquad\text{i.e.}\qquad 0\le-2tb+t^{2}\lVert Z\rVert_{2}^{2}.

If Z2=0\lVert Z\rVert_{2}=0, then 02tb0\le-2tb for all real tt forces b=0b=0. Otherwise take t=b/Z22t=b/\lVert Z\rVert_{2}^{2}, which yields 0b2/Z220\le-b^{2}/\lVert Z\rVert_{2}^{2}, so again b=0b=0. Hence property 2 holds for YY'.

Step 5 (property 2 implies property 3). Let YSY'\in\mathcal{S} satisfy property 2 and let AGA\in\mathcal{G}. The indicator 1A\mathbf{1}_{A} is G\mathcal{G}-measurable (its preimages are \emptyset, AA, ΩA\Omega\setminus A, or Ω\Omega) and square-integrable (1A2=1A\mathbf{1}_{A}^{2}=\mathbf{1}_{A} has expectation P(A)1P(A)\le1), so 1AS\mathbf{1}_{A}\in\mathcal{S} and property 2 gives E[(XY)1A]=0\mathbb{E}[(X-Y')\mathbf{1}_{A}]=0. The products X1AX\mathbf{1}_{A} and Y1AY'\mathbf{1}_{A} are integrable by Square-Integrable Random Variables and the Mean-Square Inner Product, and (XY)1A=X1AY1A(X-Y')\mathbf{1}_{A}=X\mathbf{1}_{A}-Y'\mathbf{1}_{A} pointwise, so linearity yields E[X1A]=E[Y1A]\mathbb{E}[X\mathbf{1}_{A}]=\mathbb{E}[Y'\mathbf{1}_{A}], which is property 3.

Step 6 (property 3 implies property 1, closing the equivalence). Let YSY'\in\mathcal{S} satisfy property 3. We first show that any two members of S\mathcal{S} satisfying property 3 are almost surely equal; we then deduce property 1 for YY'.

Almost-sure uniqueness from property 3. Suppose Y1,Y2SY_1,Y_2\in\mathcal{S} both satisfy property 3. Fix nNn\in\mathbb{N} and let A={Y1Y21n}A=\{Y_1-Y_2\ge\tfrac1n\}. Then AGA\in\mathcal{G}: Y1Y2Y_1-Y_2 is G\mathcal{G}-measurable by the preliminaries of Square-Integrable Random Variables and the Mean-Square Inner Product applied with G\mathcal{G}, and AA is the preimage of the Borel set [1n,)[\tfrac1n,\infty). Property 3 for both variables gives

E[(Y1Y2)1A]=E[Y11A]E[Y21A]=E[X1A]E[X1A]=0.\mathbb{E}[(Y_1-Y_2)\mathbf{1}_{A}]=\mathbb{E}[Y_1\mathbf{1}_{A}]-\mathbb{E}[Y_2\mathbf{1}_{A}]=\mathbb{E}[X\mathbf{1}_{A}]-\mathbb{E}[X\mathbf{1}_{A}]=0.

Pointwise (Y1Y2)1A1n1A(Y_1-Y_2)\mathbf{1}_{A}\ge\tfrac1n\mathbf{1}_{A} (on AA by definition of AA; off AA both sides are 00), so monotonicity and linearity give 01nP(A)0\ge\tfrac1n P(A), hence P(A)=0P(A)=0. The event {Y1>Y2}\{Y_1>Y_2\} is the union over nNn\in\mathbb{N} of the events {Y1Y21n}\{Y_1-Y_2\ge\tfrac1n\}, each of probability 00, so P(Y1>Y2)=0P(Y_1>Y_2)=0 by countable additivity (applied to a disjointified union, or by the monotone bound of the measure of a countable union by the sum of the measures as in Borel-Cantelli Lemmas). Exchanging Y1Y_1 and Y2Y_2 gives P(Y2>Y1)=0P(Y_2>Y_1)=0, so P(Y1Y2)=0P(Y_1\ne Y_2)=0, i.e., P(Y1=Y2)=1P(Y_1=Y_2)=1.

Property 1 for YY'. By Steps 3-5, the random variable YY constructed in Step 2 lies in S\mathcal{S} and satisfies properties 1, 2, and 3. By the uniqueness just proved, P(Y=Y)=1P(Y'=Y)=1, so YY2=0\lVert Y'-Y\rVert_{2}=0 by Square-Integrable Random Variables and the Mean-Square Inner Product. Then for every ZSZ\in\mathcal{S}, the triangle inequality gives

XY2XY2+YY2=XY2XZ2,\lVert X-Y'\rVert_{2}\le\lVert X-Y\rVert_{2}+\lVert Y-Y'\rVert_{2}=\lVert X-Y\rVert_{2}\le\lVert X-Z\rVert_{2},

so YY' satisfies property 1. This closes the cycle: property 1 implies 2 (Step 4), 2 implies 3 (Step 5), and 3 implies 1 (this step), so the three properties are equivalent for members of S\mathcal{S}.

Step 7 (conclusion). The random variable YY of Step 2 is G\mathcal{G}-measurable, square-integrable, and satisfies properties 1, 2, and 3 (Steps 3-5). The equivalence of the three properties for members of S\mathcal{S} was established in Steps 4-6, and the final uniqueness assertion is the almost-sure uniqueness proved in Step 6. \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…