Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Assuming countable choice, a generated sigma-algebra is obtained in omega-one stages of complements and countable unions

Statement

Assume the Axiom of Countable Choice ACω. Let X be a set and E⊆P(X). Define families (Eα)α<ω1 by

E0:=E∪{∅},

Eα+1:={X∖A:A∈Eα}∪{⋃n∈NAn:(An)n∈N is a sequence in Eα},

and Eλ:=⋃α<λEα at every nonzero limit ordinal λ<ω1. Then

σX(E)=⋃α<ω1Eα.

Facts & Assumptions

Given: The Axiom of Countable Choice, a set X, and a family E⊆P(X).

[L1]

Transfinite recursion on a well-order produces a unique function whose value at each stage is prescribed from all earlier values (Transfinite recursion).

[L3]

The Axiom of Countable Choice supplies a choice function for every family of nonempty sets indexed by N (The Axiom of Countable Choice (ACω)).

[L4]

The family σX(E) exists and is the smallest sigma-algebra on X containing E (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal).

Proof

technique · direct
1.1L1construct

The displayed successor and limit prescriptions define a class function of the earlier stages, so [L1] produces the unique family (Eα)α<ω1. Each stage is contained in the next because A is the union of the constant sequence with value A.

2.1step 1.1L4

Transfinite induction gives Eα⊆σX(E) for every α<ω1: at the base, the generated sigma-algebra contains E and ∅; complements and countable unions stay in the sigma-algebra at a successor stage; and a limit stage is a union of earlier subfamilies.

2.2step 1.1L2L3

Put S:=⋃α<ω1Eα. It contains E and ∅ and is closed under complements. Given (An) in S, [L3] may choose stages αn with An∈Eαn; [L2] bounds the set of chosen stages by some β<ω1. Monotonicity from step 1.1 puts every An in Eβ, so ⋃nAn∈Eβ+1⊆S. Thus S is a sigma-algebra.

3.1step 2.1step 2.2L4∎

Minimality in [L4] gives σX(E)⊆S, while step 2.1 gives the reverse inclusion. Hence the two families are equal.

Depends on

Used by

Dependency tree · two levels

23 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