TheoremBase

Proof of Dynkin's Pi-Lambda Theorem

lemmalem:dynkin-pi-lambda-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Initial published proof of Dynkin's pi-lambda theorem; approved by Aaron.

Proof

Let L0\mathcal{L}_0 be the intersection of all Ξ»\lambda-systems on XX containing P\mathcal{P}; the collection is nonempty (the family of all subsets of XX is a Ξ»\lambda-system), and the intersection of Ξ»\lambda-systems is a Ξ»\lambda-system, since each of the three defining properties is preserved under intersections of families. Thus L0\mathcal{L}_0 is the smallest Ξ»\lambda-system containing P\mathcal{P}, and L0βŠ†L\mathcal{L}_0\subseteq\mathcal{L}. It suffices to show Οƒ(P)βŠ†L0\sigma(\mathcal{P})\subseteq\mathcal{L}_0.

Step 1 (L0\mathcal{L}_0 is a Ο€\pi-system). First let

L1={A∈L0:A∩C∈L0 for every C∈P}.\mathcal{L}_1=\{A\in\mathcal{L}_0: A\cap C\in\mathcal{L}_0\text{ for every }C\in\mathcal{P}\}.

L1\mathcal{L}_1 contains P\mathcal{P} (as P\mathcal{P} is a Ο€\pi-system and PβŠ†L0\mathcal{P}\subseteq\mathcal{L}_0), and L1\mathcal{L}_1 is a Ξ»\lambda-system: X∩C=C∈L0X\cap C=C\in\mathcal{L}_0; if AβŠ†BA\subseteq B both lie in L1\mathcal{L}_1 then (Bβˆ–A)∩C=(B∩C)βˆ–(A∩C)(B\setminus A)\cap C=(B\cap C)\setminus(A\cap C) with A∩CβŠ†B∩CA\cap C\subseteq B\cap C both in L0\mathcal{L}_0, so the relative complement lies in L0\mathcal{L}_0 by property 2; and for a nondecreasing sequence (Am)(A_m) in L1\mathcal{L}_1, (⋃mAm)∩C=⋃m(Am∩C)\bigl(\bigcup_m A_m\bigr)\cap C=\bigcup_m(A_m\cap C) is a nondecreasing union of members of L0\mathcal{L}_0, hence in L0\mathcal{L}_0 by property 3. By minimality of L0\mathcal{L}_0, L0βŠ†L1\mathcal{L}_0\subseteq\mathcal{L}_1.

Next let

L2={A∈L0:A∩B∈L0 for every B∈L0}.\mathcal{L}_2=\{A\in\mathcal{L}_0: A\cap B\in\mathcal{L}_0\text{ for every }B\in\mathcal{L}_0\}.

By the previous paragraph, PβŠ†L2\mathcal{P}\subseteq\mathcal{L}_2: for C∈PC\in\mathcal{P} and B∈L0βŠ†L1B\in\mathcal{L}_0\subseteq\mathcal{L}_1 we have C∩B=B∩C∈L0C\cap B=B\cap C\in\mathcal{L}_0. The same set identities as above show L2\mathcal{L}_2 is a Ξ»\lambda-system, so L0βŠ†L2\mathcal{L}_0\subseteq\mathcal{L}_2 by minimality; that is, L0\mathcal{L}_0 is closed under finite intersections, hence a Ο€\pi-system (it is nonempty, containing XX).

Step 2 (a family that is both a Ο€\pi-system and a Ξ»\lambda-system is a Οƒ\sigma-algebra). X∈L0X\in\mathcal{L}_0 by Ξ»\lambda-property 1; complements: Xβˆ–AX\setminus A is the relative complement of AβŠ†XA\subseteq X in XX, in L0\mathcal{L}_0 by Ξ»\lambda-property 2; finite unions: AβˆͺB=Xβˆ–((Xβˆ–A)∩(Xβˆ–B))A\cup B=X\setminus\bigl((X\setminus A)\cap(X\setminus B)\bigr), using complements and the Ο€\pi-property; countable unions: for a sequence (Am)(A_m) in L0\mathcal{L}_0, the finite unions Fk=A1βˆͺβ‹―βˆͺAkF_k=A_1\cup\cdots\cup A_k lie in L0\mathcal{L}_0 and form a nondecreasing sequence with ⋃kFk=⋃mAm\bigcup_k F_k=\bigcup_m A_m, which lies in L0\mathcal{L}_0 by Ξ»\lambda-property 3. Hence L0\mathcal{L}_0 satisfies the three properties of a Οƒ\sigma-algebra.

Conclusion. L0\mathcal{L}_0 is a Οƒ\sigma-algebra containing P\mathcal{P}, so the generated Οƒ\sigma-algebra satisfies Οƒ(P)βŠ†L0βŠ†L\sigma(\mathcal{P})\subseteq\mathcal{L}_0\subseteq\mathcal{L}. β– \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…