Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Assuming the Axiom of Choice, an infinite family E generates at most |E|^aleph-zero sets

Statement

Assume the Axiom of Choice. Let EP(X) be infinite and put κ:=E. Then

σX(E)κ0.

Facts & Assumptions

Given: The Axiom of Choice and an infinite family EP(X) of cardinality κ.

[L1]

Generated sigma-algebras are exhausted by the complement and countable-union stages below ω1 (Assuming countable choice, a generated sigma-algebra is obtained in omega-one stages of complements and countable unions).

[L4]

Under the Axiom of Choice, 20 is the cardinality of P(N) and is strictly larger than 0 (Assuming the Axiom of Choice, 2κ=P(κ), and Cantor's theorem in cardinal form: κ<2κ).

[L5]

The Axiom of Choice provides choice functions for arbitrary families of nonempty sets (The Axiom of Choice).

Proof

technique · direct
1.1

Put μ:=κ0. Since 2κ, [L2] and [L4] give 0<20μ under [L5]; the minimality in [L6] therefore gives ω120μ. Also μ is infinite.

L2L4L5L6
1.2

Transfinite induction on the stages in [L1] gives Eαμ. At the base, sending each member of E to its constant sequence injects κ into μ. At a successor, complements contribute at most μ sets and sequences contribute at most μ0=(κ0)0=κ00=μ by [L2] and [L3]. At a limit below ω1, the predecessor set is countable by [L6], and [L5] chooses stagewise injections into μ; hence the union has size at most 0μ=μ by [L3].

L1L2L3L5L6construct
2.1

Using [L5] to choose one injection of each stage into μ, the union of the ω1 stages has cardinal at most ω1μ=μ by step 1.1 and [L3]. By [L1] this union is σX(E), proving the bound.

step 1.1step 1.2L1L3L5

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 104 results over 29 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources