Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Kolmogorov zero-one law

Statement

Let (Xn)n∈N be an independent sequence of random elements, and let T(Xn:n∈N) be its tail sigma-algebra. Then every event A∈T(Xn:n∈N) satisfies P(A)∈{0,1}.

Facts & Assumptions

Given: An independent sequence (Xn)n∈N and a tail event A∈T(Xn:n∈N).

[L1]

Every tail event is independent of every finite initial sigma-algebra. (Tail events are independent of every finite initial sigma-algebra)

[L2]

A monotone class containing an algebra contains the sigma-algebra generated by that algebra. (The monotone class generated by an algebra equals the sigma-algebra it generates)

[L3]

Probability measures are continuous from below and from above on monotone event sequences, and probabilities lie in [0,1]. (Basic identities for a probability measure)

[L4]

The tail sigma-algebra is T(Xn:n∈N)=⋂m∈Nσ(Xn:n≥m), so every tail event in particular lies in σ(Xn:n≥0). (Tail sigma-algebra of a sequence)

Proof

technique · direct
1.1givenL3

For m∈N, let Hm:=σ(X0,…,Xm) and put A:=⋃m∈NHm. Since the family (Hm) is increasing, A is an algebra of events. Define D:={B∈σ(A):P(A∩B)=P(A)P(B)}. Using the continuity statements from [L3], the class D is closed under increasing unions and decreasing intersections, so it is a monotone class.

1.2L1

For each m, [L1] gives Hm⊆D. Hence the algebra A=⋃mHm is contained in D.

2.1step 1.1step 1.2L2L4algebra

Because D is a monotone class containing the algebra A, [L2] yields σ(A)⊆D. But σ(A)=σ(Xn:n≥0), and [L4] puts every tail event in this full-coordinate sigma-algebra. Therefore A∈D, so P(A)=P(A∩A)=P(A)2.

3.1step 2.1L3algebra∎

Step 2.1 and [L3] show that the probability p=P(A) satisfies 0≤p≤1 and p=p2, so p∈{0,1}.

Depends on

Used by

Dependency tree · two levels

21 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources