Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-14
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 from martingale convergence

Statement

Assume AC. For an independent sequence of random elements and its tail σ-algebra T, every AT has probability zero or one.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

Tail sigma-algebra of a sequence places every tail event in the full sequence σ-algebra.

[F2]

Tail events are independent of every finite initial sigma-algebra makes a tail event independent of each finite initial σ-algebra Hn.

[F3]

Conditioning a known variable and an independent variable identifies the corresponding conditional expectation with a constant, and with the variable itself when it is measurable.

[F4]

Levy upward convergence of conditional expectations gives the limiting conditional expectation along Hn.

[F5]

The Axiom of Choice is inherited from conditional-expectation existence and the convergence theorem.

Proof

1.1

Fix AT and let Hn be generated by the first n random elements. F2, F3 give E[1AHn]=P(A)a.s. for every n.

F2F3
2.1

The increasing union of the Hn generates the σ-algebra of the entire sequence. By F1, A belongs to that σ-algebra. F4 therefore says the constants in step 1.1 converge almost surely to E[1Aσ(nHn)]=1A, where the last identity is F3's known-variable clause. Hence 1A=P(A) almost surely.

F1F3F4
3.1

An indicator that is almost surely the constant p=P(A) can take only 0 or 1 on a nonnull set, so p{0,1}. This proof does not consume the already-published zero-one theorem that it recovers. AC has only the dependence in F5.

F5step 2.1

Depends on

Used by

Dependency tree · two levels

19 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