Throughout, G-measurability of a real-valued function on Ω means measurability with respect to G and the Borel σ-algebra of the real line, and tuples are multiplied by 1G componentwise.
Step 1: pulling the indicator inside the conditional expectation. The indicator 1G is G-measurable by claim 1 of the arithmetic lemma for measurable functions applied on (Ω,G), and ∣1G∣≤1 everywhere. By claim 4 of the basic properties of conditional expectation (taking out what is known), for each γ∈{1,…,k} the random variables 1GXγ and 1GMγ are square-integrable and 1GMγ is a conditional expectation of 1GXγ given G. Set X′=1GX and M′=1GM; then M′ is a tuple of conditional expectations of the components of X′ given G, and its error tuple is ε′=X′−M′=1Gε.
Step 2: the tuple Y′=1GY is admissible. Fix γ. By admissibility of Y there is a G-measurable square-integrable random variable Y~γ and an event Aγ with P(Aγ)=1 such that Yγ=Y~γ on Aγ (almost sure equality). Then 1GYγ is square-integrable, since (1GYγ)2≤(Yγ)2 pointwise and expectation is monotone by monotonicity of the integral; it coincides with 1GY~γ on Aγ; and 1GY~γ is G-measurable (claim 3 of the arithmetic lemma on (Ω,G)) and square-integrable by the same comparison. Hence Y′ is admissible in the sense of the conditional mean-square optimality lemma.
Step 3: claims 1 and 2. Apply the cited lemma to the data X′, M′, ε′, R, and the admissible tuple Y′. Pointwise, Y′−X′=1G(Y−X), Y′−M′=1G(Y−M), and for any tuple U of square-integrable random variables
(1GU)⋅(R(1GU))=γ,δ=1∑kRγδ1G2UγUδ=1GU⋅(RU),
because 1G2=1G. Therefore claim 1 (orthogonal decomposition) and claim 2 (optimality) of the cited lemma for the primed data read exactly as claims 1 and 2 of the present lemma, and the integrability of all products involved is part of the setting of that lemma (each is a finite linear combination of products of two square-integrable random variables, integrable by the closure properties of the square-integrability definition; see also Step 4).
Step 4: trace form. Pointwise 1Gε⋅(Rε)=∑γ,δRγδ(1Gεγ)εδ, each product being integrable as the product of the square-integrable random variables 1Gεγ and εδ; the displayed trace formula follows from linearity of the integral applied finitely many times.
Step 5: independence of the choice. Let M~γ be any other conditional expectation of Xγ given G, and set ε~γ=Xγ−M~γ. By the uniqueness assertion of the existence and uniqueness theorem for conditional expectation, P(M~γ=Mγ)=1; the set Aγ′={M~γ=Mγ} is an event, being the set where the random variable M~γ−Mγ (claim 2 of the arithmetic lemma) is nonzero, it has P(Aγ′)=0, and off it ε~γ=εγ. The event A′=A1′∪⋯∪Ak′ satisfies P(A′)≤P(A1′)+⋯+P(Ak′)=0, by writing A′ as the disjoint union of the sets Aγ′∖(A1′∪⋯∪Aγ−1′) and using additivity and monotonicity of the measure P. Off A′ all the ε~γ agree with the εγ. Now fix γ,δ and use the polarization identity, valid pointwise because 1G2=1G:
1Gεγεδ=41((1G(εγ+εδ))2−(1G(εγ−εδ))2),
and the same identity with ε~ in place of ε. The random variables 1G(εγ±εδ) and 1G(ε~γ±ε~δ) are square-integrable and agree off the null event A′, so by the lemma on almost sure equality and second moments their second moments coincide. Taking expectations in the two polarization identities and using linearity of the integral gives E[1Gε~γε~δ]=E[1Gεγεδ], which is claim 3. ■