Math 2.0

Probability theory and stochastic processes Proof

Proof of Kolmogorov's zero–one law

Builds on Independence of random variablesIndependent sigma-algebrasSigma-algebraPi-systemDynkin systemDynkin's π-λ theoremContinuity of probability measures

Proof

We show that each tail event is independent of itself. The tool is Dynkin's π-λ theorem.

  1. For each ii, let XiX_i take values in a measurable space (Ei,ℰi)(E_i, \mathcal{E}_i). For k≥0k \ge 0, let ℱk=σ(X1,…,Xk)\mathcal{F}_k = \sigma(X_1, \dots, X_k), with ℱ0={∅,Ω}\mathcal{F}_0 = \set{\varnothing, \Omega}, and let 𝒢k=σ(Xk+1,Xk+2,… )\mathcal{G}_k = \sigma(X_{k+1}, X_{k+2}, \dots).
  2. Lemma: let 𝒫,𝒬⊆ℱ\mathcal{P}, \mathcal{Q} \subseteq \mathcal{F} be π-systems with P(A∩B)=P(A)P(B)P(A \cap B) = P(A) P(B) for all A∈𝒫A \in \mathcal{P} and B∈𝒬B \in \mathcal{Q}. Then the same holds for all A∈σ(𝒫)A \in \sigma(\mathcal{P}) and B∈σ(𝒬)B \in \sigma(\mathcal{Q}).
  3. Proof of the lemma: fix B∈𝒬B \in \mathcal{Q} and let 𝒟B={A∈ℱ:P(A∩B)=P(A)P(B)}\mathcal{D}_B = \set{A \in \mathcal{F} : P(A \cap B) = P(A) P(B)}. It contains Ω\Omega, since P(Ω∩B)=P(B)P(\Omega \cap B) = P(B).
  4. If A⊆A′A \subseteq A' are in 𝒟B\mathcal{D}_B, then (A′∖A)∩B=(A′∩B)∖(A∩B)(A' \setminus A) \cap B = (A' \cap B) \setminus (A \cap B). So P((A′∖A)∩B)=(P(A′)−P(A))P(B)=P(A′∖A)P(B)P((A' \setminus A) \cap B) = (P(A') - P(A)) P(B) = P(A' \setminus A) P(B).
  5. If A1⊆A2⊆⋯A_1 \subseteq A_2 \subseteq \cdots are in 𝒟B\mathcal{D}_B with union AA, then Aj∩BA_j \cap B increase to A∩BA \cap B. By the continuity of probability, P(A∩B)=lim⁡jP(Aj)P(B)=P(A)P(B)P(A \cap B) = \lim_j P(A_j) P(B) = P(A) P(B).
  6. By steps 3 to 5, 𝒟B\mathcal{D}_B is a Dynkin system. It contains 𝒫\mathcal{P} by hypothesis. By Dynkin's π-λ theorem, σ(𝒫)⊆𝒟B\sigma(\mathcal{P}) \subseteq \mathcal{D}_B.
  7. Now fix A∈σ(𝒫)A \in \sigma(\mathcal{P}) and let 𝒟A′={B∈ℱ:P(A∩B)=P(A)P(B)}\mathcal{D}'_A = \set{B \in \mathcal{F} : P(A \cap B) = P(A) P(B)}. By step 6, it contains 𝒬\mathcal{Q}. The argument of steps 3 to 5, with the roles exchanged, shows that it is a Dynkin system.
  8. By the π-λ theorem, σ(𝒬)⊆𝒟A′\sigma(\mathcal{Q}) \subseteq \mathcal{D}'_A. This proves the lemma.
  9. Fix k≥0k \ge 0. Let 𝒫k\mathcal{P}_k be the family of sets ⋂i=1k{Xi∈Bi}\bigcap_{i=1}^{k} \set{X_i \in B_i} with Bi∈ℰiB_i \in \mathcal{E}_i, where the empty intersection is Ω\Omega.
  10. 𝒫k\mathcal{P}_k is a π-system, since {Xi∈B}∩{Xi∈B′}={Xi∈B∩B′}\set{X_i \in B} \cap \set{X_i \in B'} = \set{X_i \in B \cap B'}. It lies in ℱk\mathcal{F}_k, and it contains each set {Xi∈B}\set{X_i \in B} with i≤ki \le k, by taking the other Bj=EjB_j = E_j.
  11. So each XiX_i with i≤ki \le k is measurable for σ(𝒫k)\sigma(\mathcal{P}_k). By the minimality of ℱk\mathcal{F}_k, ℱk⊆σ(𝒫k)⊆ℱk\mathcal{F}_k \subseteq \sigma(\mathcal{P}_k) \subseteq \mathcal{F}_k, so σ(𝒫k)=ℱk\sigma(\mathcal{P}_k) = \mathcal{F}_k.
  12. Let 𝒬k\mathcal{Q}_k be the family of sets ⋂i=k+1k+j{Xi∈Bi}\bigcap_{i=k+1}^{k+j} \set{X_i \in B_i} with j≥1j \ge 1 and Bi∈ℰiB_i \in \mathcal{E}_i. Two such sets can be written with the same jj, by adding factors with Bi=EiB_i = E_i.
  13. So, as in steps 10 and 11, 𝒬k\mathcal{Q}_k is a π-system with σ(𝒬k)=𝒢k\sigma(\mathcal{Q}_k) = \mathcal{G}_k.
  14. For A=⋂i≤k{Xi∈Bi}∈𝒫kA = \bigcap_{i \le k} \set{X_i \in B_i} \in \mathcal{P}_k and B=⋂i=k+1k+j{Xi∈Bi}∈𝒬kB = \bigcap_{i = k+1}^{k+j} \set{X_i \in B_i} \in \mathcal{Q}_k, the independence of X1,…,Xk+jX_1, \dots, X_{k+j} gives P(A∩B)=∏i=1k+jP(Xi∈Bi)=P(A)P(B)P(A \cap B) = \prod_{i=1}^{k+j} P(X_i \in B_i) = P(A) P(B).
  15. By steps 14 and 2, P(A∩B)=P(A)P(B)P(A \cap B) = P(A) P(B) for all A∈ℱkA \in \mathcal{F}_k and B∈𝒢kB \in \mathcal{G}_k.
  16. Let 𝒯\mathcal{T} be the tail σ-algebra. By definition, 𝒯⊆𝒢k\mathcal{T} \subseteq \mathcal{G}_k for every kk. So step 15 gives P(A∩B)=P(A)P(B)P(A \cap B) = P(A) P(B) for A∈⋃kℱkA \in \bigcup_k \mathcal{F}_k and B∈𝒯B \in \mathcal{T}.
  17. Let 𝒰=⋃k≥0ℱk\mathcal{U} = \bigcup_{k \ge 0} \mathcal{F}_k. The ℱk\mathcal{F}_k increase, so two sets of 𝒰\mathcal{U} lie in a common ℱk\mathcal{F}_k, and so does their intersection. Thus 𝒰\mathcal{U} is a π-system.
  18. Each {Xm∈B}\set{X_m \in B} lies in ℱm⊆𝒰\mathcal{F}_m \subseteq \mathcal{U}, and 𝒰⊆𝒢0=σ(X1,X2,… )\mathcal{U} \subseteq \mathcal{G}_0 = \sigma(X_1, X_2, \dots). As in step 11, σ(𝒰)=𝒢0\sigma(\mathcal{U}) = \mathcal{G}_0.
  19. 𝒯\mathcal{T} is a σ-algebra, as an intersection of σ-algebras. So it is a π-system with σ(𝒯)=𝒯\sigma(\mathcal{T}) = \mathcal{T}.
  20. By steps 16 to 19 and the lemma, P(A∩B)=P(A)P(B)P(A \cap B) = P(A) P(B) for all A∈𝒢0A \in \mathcal{G}_0 and B∈𝒯B \in \mathcal{T}. So 𝒢0\mathcal{G}_0 and 𝒯\mathcal{T} are independent σ-algebras.
  21. Let A∈𝒯A \in \mathcal{T}. Since 𝒯⊆𝒢0\mathcal{T} \subseteq \mathcal{G}_0, step 20 applies with B=AB = A, and gives P(A)=P(A∩A)=P(A)2P(A) = P(A \cap A) = P(A)^2.
  22. The only real solutions of p=p2p = p^2 are p=0p = 0 and p=1p = 1. Hence P(A)∈{0,1}P(A) \in \set{0, 1}.

Idea

A tail event does not depend on any finite group X1,…,XkX_1, \dots, X_k, so it is independent of all of them. The π-λ theorem upgrades this to independence from the whole σ-algebra σ(X1,X2,… )\sigma(X_1, X_2, \dots). That σ-algebra contains the tail event itself, so the event is independent of itself, and P(A)=P(A)2P(A) = P(A)^2.

Reading path

To understand this page from the ground up, read these 76 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the continuity of probability measures, Proof of the probability of the complement, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the monotonicity of probability, Proof that the reals are Archimedean from the completeness axiom.

  1. Construction of the reals from Cauchy sequences concept
  2. Dynkin system concept
  3. Element definition
  4. Integers object
  5. Ordered field definition
  6. Pi-system concept
  7. Probability measure concept
  8. Proposition concept
  9. Random experiment concept
  10. Rational numbers object
  11. Real numbers object
  12. Set bounded above definition
  13. Sigma-algebra concept
  14. Set definition
  15. Ring of integers statement
  16. Archimedean ordered field definition
  17. Dynkin's π-λ theorem statement
  18. Conjunction definition
  19. Disjunction definition
  20. Implication definition
  21. Predicate definition
  22. The reals form a field statement
  23. Supremum definition
  24. Ordered pair definition
  25. Intersection definition
  26. Union definition
  27. Sample space definition
  28. The rationals form a field statement
  29. Existential quantifier definition
  30. Universal quantifier definition
  31. Completeness axiom statement
  32. Cartesian product definition
  33. Subset definition
  34. The rationals form an ordered field statement
  35. Uniqueness quantifier definition
  36. Binary relation definition
  37. Universal set definition
  38. Order on the reals definition
  39. Power set definition
  40. Antisymmetric relation definition
  41. Reflexive relation definition
  42. Transitive relation definition
  43. Complement definition
  44. Function definition
  45. Interval definition
  46. Preorder definition
  47. Sigma-algebra definition
  48. Preimage of a set definition
  49. Partial order definition
  50. Pi-system definition
  51. Event definition
  52. Dynkin system definition
  53. Borel sigma-algebra definition
  54. Total order definition
  55. Probability axioms concept
  56. Probability measure definition
  57. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  58. Probability space definition
  59. The reals form an ordered field statement
  60. Conditional probability definition
  61. Random variable definition
  62. Proof of the approximation property of the supremum proof
  63. Independence of two events definition
  64. Approximation property of the supremum statement
  65. Mutual independence of events definition
  66. Proof that the reals are Archimedean from the completeness axiom proof
  67. Independent sigma-algebras definition
  68. The reals are Archimedean statement
  69. Independence of random variables definition
  70. Proof of the probability of the complement proof
  71. Probability of the complement statement
  72. Proof of the monotonicity of probability proof
  73. Monotonicity of probability statement
  74. Proof of the continuity of probability measures proof
  75. Continuity of probability measures statement
  76. Proof of Kolmogorov's zero–one law proof

Where this leads

3 pages build on this one.

Further reading

  1. Web https://sites.math.duke.edu/~rtd/PTE/PTE5_011119.pdf, Theorem 2.5.3 and Theorem 2.1.7
About this page
TagW8AH11V0NN
URIm2://W8AH11V0NN
Kindproof
WritingW0 stub
MSC60F20
ProvesKolmogorov's zero–one law
UsesIndependence of random variables, Independent sigma-algebras, Sigma-algebra, Pi-system, Dynkin system, Dynkin's π-λ theorem, Continuity of probability measures
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.