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 be an independent sequence of random elements, and let be its tail sigma-algebra. Then every event satisfies
Facts & Assumptions
Given: An independent sequence and a tail event .
Every tail event is independent of every finite initial sigma-algebra. (Tail events are independent of every finite initial sigma-algebra)
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)
Probability measures are continuous from below and from above on monotone event sequences, and probabilities lie in . (Basic identities for a probability measure)
The tail sigma-algebra is so every tail event in particular lies in . (Tail sigma-algebra of a sequence)
Proof
For , let and put . Since the family is increasing, is an algebra of events. Define Using the continuity statements from [L3], the class is closed under increasing unions and decreasing intersections, so it is a monotone class.
For each , [L1] gives . Hence the algebra is contained in .
Because is a monotone class containing the algebra , [L2] yields . But , and [L4] puts every tail event in this full-coordinate sigma-algebra. Therefore , so
Step 2.1 and [L3] show that the probability satisfies and , so .
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
- S. R. S. Varadhan, Probability Theory, Theorem 3.15 (standard reference, not scraped)
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 2.3 (standard reference, not scraped)