TheoremBase

Proof of Grouping Lemma for Independent Random Variables

lemmalem:grouping-independent-rvs-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Proof of the grouping lemma via Dynkin pi-lambda extension over generating pi-systems of finite rectangles. Approved by Aaron.

Proof

By Sigma-Algebra Generated by Random Variables and Independence of Sigma-Algebras, we must show: for every finite nonempty set of distinct indices b1,…,bp∈Bb_1,\dots,b_p\in B and all events Al∈GblA_l\in\mathcal{G}_{b_l},

P(β‹‚l=1pAl)=∏l=1pP(Al).(βˆ—)P\Bigl(\bigcap_{l=1}^{p}A_l\Bigr)=\prod_{l=1}^{p}P(A_l).\tag{$*$}

Throughout, B(R)\mathcal{B}(\mathbb{R}) is the Borel Οƒ\sigma-algebra and products use the finite product notation.

Step 1 (a generating Ο€\pi-system for each block). For b∈Bb\in B let Pb\mathcal{P}_b be the family of all sets of the form β‹‚m∈EXmβˆ’1(Cm)\bigcap_{m\in E}X_m^{-1}(C_m), where EβŠ†IbE\subseteq I_b is finite and nonempty and Cm∈B(R)C_m\in\mathcal{B}(\mathbb{R}) for each m∈Em\in E. The intersection of two such sets is again of this form (intersect over the union of the two index sets, taking Cm=RC_m=\mathbb{R} for indices missing from one of them, and replacing CmC_m by the intersection of the two Borel sets on shared indices), so Pb\mathcal{P}_b is a Ο€\pi-system. Note Ω∈Pb\Omega\in\mathcal{P}_b: take E={m}E=\{m\} for any m∈Ibm\in I_b and Cm=RC_m=\mathbb{R}, so that Xmβˆ’1(R)=Ξ©X_m^{-1}(\mathbb{R})=\Omega. The family Pb\mathcal{P}_b contains the generating family Cb={Xmβˆ’1(C):m∈Ib,Β C∈B(R)}\mathcal{C}_b=\{X_m^{-1}(C):m\in I_b,\ C\in\mathcal{B}(\mathbb{R})\} of Gb\mathcal{G}_b, and every member of Pb\mathcal{P}_b lies in Gb\mathcal{G}_b because Οƒ\sigma-algebras are closed under finite intersections. By minimality of the generated Οƒ\sigma-algebra, Gb=Οƒ(Cb)βŠ†Οƒ(Pb)βŠ†Gb\mathcal{G}_b=\sigma(\mathcal{C}_b)\subseteq\sigma(\mathcal{P}_b)\subseteq\mathcal{G}_b, so Οƒ(Pb)=Gb\sigma(\mathcal{P}_b)=\mathcal{G}_b.

Step 2 (the product formula on the Ο€\pi-systems). Fix distinct b1,…,bp∈Bb_1,\dots,b_p\in B and sets Al=β‹‚m∈ElXmβˆ’1(Cm)∈PblA_l=\bigcap_{m\in E_l}X_m^{-1}(C_m)\in\mathcal{P}_{b_l}. The index sets E1,…,EpE_1,\dots,E_p are pairwise disjoint because Ib1,…,IbpI_{b_1},\dots,I_{b_p} are. Let E=E1βˆͺβ‹―βˆͺEpE=E_1\cup\dots\cup E_p; this is a finite set of indices, and the subfamily (Xm)m∈E(X_m)_{m\in E} is independent because, by Independence of Events and of Random Variables, every finite subfamily of an independent family is independent. Applying the defining product formula of Independence of Events and of Random Variables to the events Xmβˆ’1(Cm)X_m^{-1}(C_m), m∈Em\in E, and also separately to each subfamily (Xm)m∈El(X_m)_{m\in E_l}, gives

P(β‹‚l=1pAl)=P(β‹‚m∈EXmβˆ’1(Cm))=∏m∈EP(Xmβˆ’1(Cm))=∏l=1p∏m∈ElP(Xmβˆ’1(Cm))=∏l=1pP(Al),P\Bigl(\bigcap_{l=1}^{p}A_l\Bigr)=P\Bigl(\bigcap_{m\in E}X_m^{-1}(C_m)\Bigr)=\prod_{m\in E}P\bigl(X_m^{-1}(C_m)\bigr)=\prod_{l=1}^{p}\prod_{m\in E_l}P\bigl(X_m^{-1}(C_m)\bigr)=\prod_{l=1}^{p}P(A_l),

where the regrouping of the finite product over EE into the iterated product is the associativity and commutativity of finite products of real numbers.

Step 3 (extension from Ο€\pi-systems to the Οƒ\sigma-algebras). We claim: for 0≀k≀p0\le k\le p, the identity (βˆ—*) holds whenever Al∈GblA_l\in\mathcal{G}_{b_l} for l≀kl\le k and Al∈PblA_l\in\mathcal{P}_{b_l} for l>kl>k. The case k=0k=0 is Step 2. Assume the claim for kβˆ’1k-1 and fix Al∈GblA_l\in\mathcal{G}_{b_l} for l<kl<k and Al∈PblA_l\in\mathcal{P}_{b_l} for l>kl>k. Let

L={A∈FΒ :Β P(Aβˆ©β‹‚lβ‰ kAl)=P(A)∏lβ‰ kP(Al)},\mathcal{L}=\Bigl\{A\in\mathcal{F}\ :\ P\Bigl(A\cap\bigcap_{l\ne k}A_l\Bigr)=P(A)\prod_{l\ne k}P(A_l)\Bigr\},

where for p=1p=1 the intersection over the empty index set is read as Ξ©\Omega and the empty product as 11. We check that L\mathcal{L} is a Ξ»\lambda-system. Write D=β‹‚lβ‰ kAlD=\bigcap_{l\ne k}A_l and c=∏lβ‰ kP(Al)c=\prod_{l\ne k}P(A_l). (1) Ω∈L\Omega\in\mathcal{L}: since Ω∈Pbk\Omega\in\mathcal{P}_{b_k} (Step 1), the induction hypothesis for kβˆ’1k-1 applied with the choice Ak=Ξ©A_k=\Omega gives P(Ω∩D)=P(Ξ©) c=cP(\Omega\cap D)=P(\Omega)\,c=c, using P(Ξ©)=1P(\Omega)=1 from the definition of a probability measure; and P(Ξ©) cP(\Omega)\,c is exactly the required right-hand side for A=Ξ©A=\Omega. (2) If AβŠ†Aβ€²A\subseteq A' both lie in L\mathcal{L}, then by finite additivity of the measure PP applied to the disjoint union Aβ€²βˆ©D=(A∩D)βˆͺ((Aβ€²βˆ–A)∩D)A'\cap D=(A\cap D)\cup((A'\setminus A)\cap D),

P((Aβ€²βˆ–A)∩D)=P(Aβ€²βˆ©D)βˆ’P(A∩D)=(P(Aβ€²)βˆ’P(A))c=P(Aβ€²βˆ–A) c,P\bigl((A'\setminus A)\cap D\bigr)=P(A'\cap D)-P(A\cap D)=\bigl(P(A')-P(A)\bigr)c=P(A'\setminus A)\,c,

using P(Aβ€²)=P(A)+P(Aβ€²βˆ–A)P(A')=P(A)+P(A'\setminus A); so Aβ€²βˆ–A∈LA'\setminus A\in\mathcal{L}. (3) If (A(m))m∈N(A^{(m)})_{m\in\mathbb{N}} is a nondecreasing sequence in L\mathcal{L} with union AA, write AA as the disjoint union of the sets A(1)A^{(1)} and A(m+1)βˆ–A(m)A^{(m+1)}\setminus A^{(m)}, mβ‰₯1m\ge1; countable additivity of PP gives P(A∩D)=lim⁑mP(A(m)∩D)P(A\cap D)=\lim_m P(A^{(m)}\cap D) and P(A)=lim⁑mP(A(m))P(A)=\lim_m P(A^{(m)}) (the partial sums of the two series are exactly P(A(m)∩D)P(A^{(m)}\cap D) and P(A(m))P(A^{(m)}) by finite additivity), hence P(A∩D)=lim⁑mP(A(m))c=P(A)cP(A\cap D)=\lim_m P(A^{(m)})c=P(A)c by the algebra of limits; so A∈LA\in\mathcal{L}.

By the induction hypothesis for kβˆ’1k-1 (with AkA_k ranging over Pbk\mathcal{P}_{b_k}), PbkβŠ†L\mathcal{P}_{b_k}\subseteq\mathcal{L}. By Dynkin's Pi-Lambda Theorem and Step 1, Gbk=Οƒ(Pbk)βŠ†L\mathcal{G}_{b_k}=\sigma(\mathcal{P}_{b_k})\subseteq\mathcal{L}, which is precisely the claim for kk. Taking k=pk=p proves (βˆ—*) for all Al∈GblA_l\in\mathcal{G}_{b_l}, so the family (Gb)b∈B(\mathcal{G}_b)_{b\in B} is independent.

Step 4 (independent block-measurable random variables). Let YbY_b be Gb\mathcal{G}_b-measurable for each b∈Bb\in B. By Independence of Events and of Random Variables it suffices to show that every finite subfamily Yb1,…,YbpY_{b_1},\dots,Y_{b_p} (distinct blb_l) is independent, i.e., that for all Borel sets C1,…,CpC_1,\dots,C_p the events Yblβˆ’1(Cl)Y_{b_l}^{-1}(C_l) are independent. For every nonempty SβŠ†{1,…,p}S\subseteq\{1,\dots,p\}, the events Yblβˆ’1(Cl)∈GblY_{b_l}^{-1}(C_l)\in\mathcal{G}_{b_l}, l∈Sl\in S, are chosen from Οƒ\sigma-algebras with distinct indices, so (βˆ—*) gives

P(β‹‚l∈SYblβˆ’1(Cl))=∏l∈SP(Yblβˆ’1(Cl)),P\Bigl(\bigcap_{l\in S}Y_{b_l}^{-1}(C_l)\Bigr)=\prod_{l\in S}P\bigl(Y_{b_l}^{-1}(C_l)\bigr),

which is exactly the required product formula for every subfamily. Hence (Yb)b∈B(Y_b)_{b\in B} is independent. β– \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…