Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5) 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 8 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, Cohen 1963: ZF does not prove the Axiom of Choice, Feferman 1965: ZF does not prove that a free ultrafilter on the naturals exists, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice, Gödel 1938: ZF does not refute the Axiom of Choice, Halpern and Lévy 1971: the Boolean prime ideal theorem does not imply the Axiom of Choice, The continuum hypothesis and its generalisation are independent of ZFC and Schechter 2006: Kelley's cofinite proof yields BPI, not the Axiom of Choice. 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.

What each result on this page costs in choice, and where the continuum escapes what ZFC can decide

Remark

This item is bookkeeping, in the manner of The choice ledger: what costs the Axiom of Choice and what does not: it records what each result stated here actually costs, so that anything quoting a result from this page knows whether it is quoting a theorem of ZF or a consequence of the Axiom of Choice (The Axiom of Choice).

Theorems of ZF, using no choice principle at all.

Costing the Axiom of Choice, and named as such in their own statements.

Equivalent to the Axiom of Choice over ZF, so neither weaker nor stronger: comparability of arbitrary sets (Comparability of arbitrary sets, that any two sets admit an injection one way or the other, is equivalent to the Axiom of Choice) and Tarski's square law (Tarski: the Axiom of Choice is equivalent to the statement that A×AAA \times A \approx A for every infinite set AA, so extending Hessenberg's theorem from the alephs to arbitrary sets is exactly as strong as choice). The first is recorded in The choice ledger: what costs the Axiom of Choice and what does not as Hartogs' result, quoted there and proved here.

Countable choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)) is not used anywhere on this page. Where an argument might have needed it, the ordinal structure supplied a canonical least element instead.

How far regularity can fail without choice. That clause (b) above cannot be proved in ZF is recorded rather than proved here, and it is conditional: Gitik 1980: consistently, every uncountable cardinal is singular states that, relative to a large-cardinal consistency hypothesis, there is a model of ZF in which every uncountable cardinal is singular. Granting that hypothesis, "successor cardinals are regular" is a consequence of choice and not a structural fact about cardinals, which is why clause (b) is stated with its hypothesis.

Where the continuum escapes ZFC. The constraint proved here is cf(20)>0\operatorname{cf}(2^{\aleph_0}) > \aleph_0 (Assuming the Axiom of Choice: κ<κcf(κ)\kappa < \kappa^{\operatorname{cf}(\kappa)} for every infinite cardinal κ\kappa, and cf(2κ)>κ\operatorname{cf}(2^{\kappa}) > \kappa; in particular cf(20)>0\operatorname{cf}(2^{\aleph_0}) > \aleph_0), which excludes some candidate values for 202^{\aleph_0} and selects none. Whether 20=12^{\aleph_0} = \aleph_1 is the continuum hypothesis, stated in The continuum hypothesis, and what this page does not prove; that ZFC proves neither it nor its negation, granted the consistency of ZFC, is recorded in The continuum hypothesis and its generalisation are independent of ZFC and is proved neither on this page nor on any page this one rests on. The generalised form is stronger than it looks: over ZF it implies the Axiom of Choice, a result of Sierpiński recorded in Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice , and proved neither here nor on any page this one rests on.

What this page therefore does and does not settle about 202^{\aleph_0}. It settles that 202^{\aleph_0} is an aleph, granted choice; that it is strictly above 0\aleph_0; and that its cofinality is uncountable. It settles nothing about which aleph it is, and no statement on this page or its companion asserts a value.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 164 results over 34 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