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 the Axiom of Choice, an infinite family E generates at most |E|^aleph-zero sets

Statement

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

∣σX(E)∣≤κℵ0.

Facts & Assumptions

Given: The Axiom of Choice and an infinite family E⊆P(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, 2ℵ0 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.1L2L4L5L6

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

1.2L1L2L3L5L6construct

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=κℵ0⊗ℵ0=μ 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].

2.1step 1.1step 1.2L1L3L5∎

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.

Depends on

Used by

Dependency tree · two levels

44 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