Alphabeta Math
DefinitionDefinition: 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 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.

The successor cardinal κ+\kappa^{+}, the alephs α\aleph_\alpha, the beths α\beth_\alpha, successor and limit cardinals, and the identifications 0=ω\aleph_0 = \omega and 1=ω1\aleph_1 = \omega_1

Definition

The successor cardinal. For a cardinal κ\kappa (Cardinal (initial ordinal) and cardinality) write

κ+  :=  (κ),\kappa^{+} \;:=\; \aleph(\kappa),

the Hartogs number of κ\kappa (Hartogs: an ordinal that does not inject into a given set). By For every set AA the Hartogs number (A)\aleph(A) is a cardinal, and for every cardinal κ\kappa it is the least cardinal strictly above κ\kappa; this is a theorem of ZF this is the least cardinal strictly above κ\kappa, and its existence is a theorem of ZF.

Notation rule, in force on this page and its companion. The superscript ++ means the successor cardinal only on a cardinal letter κ,λ,μ\kappa, \lambda, \mu or an aleph. On an ordinal letter α,β,γ,ξ,η\alpha, \beta, \gamma, \xi, \eta the superscript ++ keeps its published meaning, the ordinal successor α+=α{α}\alpha^{+} = \alpha \cup \{\alpha\} of Ordinal (von Neumann). The two never agree on an infinite cardinal: κ{κ}\kappa \cup \{\kappa\} is a successor ordinal and therefore not a cardinal at all, while κ+\kappa^{+} is much larger. To keep the reader out of the collision, everything below writes α+1\alpha + 1 for the ordinal successor and reserves κ+\kappa^{+} for the cardinal one.

The alephs. By The clauses at 00, at a successor and at a limit determine exactly one operation αα\alpha \mapsto \aleph_\alpha, in ZF, and — assuming the Axiom of Choice — exactly one operation αα\alpha \mapsto \beth_\alpha; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and αα\alpha \le \aleph_\alpha there is exactly one operation αα\alpha \mapsto \aleph_\alpha, defined at every ordinal (Ordinal (von Neumann)), with

0=ω,α+1=α+,λ=sup{α:αλ}  (λ a limit ordinal),\aleph_0 = \omega, \qquad \aleph_{\alpha+1} = \aleph_\alpha^{+}, \qquad \aleph_\lambda = \sup\{\, \aleph_\alpha : \alpha \in \lambda \,\} \ \ (\lambda \text{ a limit ordinal}),

the limit clause being taken over limit ordinals in the sense of Successor and limit ordinals, and sup\sup being \bigcup applied to a set of ordinals. Every α\aleph_\alpha is an infinite cardinal, the operation is strictly increasing, and αα\alpha \le \aleph_\alpha; all of this is that corollary, and all of it is ZF.

The beths, assuming the Axiom of Choice, are the parallel operation

0=ω,α+1=2α,λ=sup{α:αλ}  (λ a limit ordinal),\beth_0 = \omega, \qquad \beth_{\alpha+1} = 2^{\beth_\alpha}, \qquad \beth_\lambda = \sup\{\, \beth_\alpha : \alpha \in \lambda \,\} \ \ (\lambda \text{ a limit ordinal}),

with 2κ2^{\kappa} the cardinal power of Cardinal sum κλ\kappa \oplus \lambda, product κλ\kappa \otimes \lambda and exponentiation κλ\kappa^{\lambda}, and why they are written apart from the ordinal operations.

Successor and limit cardinals. An infinite cardinal κ\kappa is a successor cardinal when κ=λ+\kappa = \lambda^{+} for some infinite cardinal λ\lambda, and a limit cardinal otherwise. So α+1\aleph_{\alpha+1} is a successor cardinal for every α\alpha, and 0=ω\aleph_0 = \omega is a limit cardinal, there being no infinite cardinal below it.

The two identifications.

0=ω,1=ω1.\aleph_0 = \omega, \qquad \aleph_1 = \omega_1 .

The first is the base clause. The second holds because 1=0+=(ω)\aleph_1 = \aleph_0^{+} = \aleph(\omega), and (ω)\aleph(\omega) is by definition the first uncountable ordinal ω1\omega_1 (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)); ω1\omega_1 is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF independently confirms that ω1\omega_1 is a cardinal, is uncountable (Finite, countably infinite, countable, uncountable), and has every ordinal below it at most countable, which is the same thing said in the language of the ordinal development.

Remarks

Why the aleph notation is introduced at all, when ω\omega and ω1\omega_1 already exist. The subscript is an ordinal index into the cardinals: it makes "the α\alpha-th infinite cardinal" a term of the language, so that statements such as "α+1\aleph_{\alpha+1} is regular" and "ω\aleph_\omega is singular" can be quantified over α\alpha. The published ordinal development deliberately avoids the notation, writing ω\omega and ω1\omega_1 throughout, precisely so that an ordinal computation there is never silently read as a cardinal one; that convention is recorded in Ordinal αβ\alpha^{\beta} and cardinal κλ\kappa^{\lambda} are different operations that share one notation and is not disturbed here. On this page the reverse convention is in force: an aleph is always a cardinal, and an exponential is always the cardinal one.

\aleph with an argument and \aleph with a subscript are different things. (A)\aleph(A) is the Hartogs number of a set AA, defined for every set in ZF (Hartogs: an ordinal that does not inject into a given set); α\aleph_\alpha is the α\alpha-th infinite cardinal. They agree in the one case that matters, (α)=α+1\aleph(\aleph_\alpha) = \aleph_{\alpha+1}, which is the successor clause, and the same symbol is used because the notation is Hartogs' own.

Where the beths sit. 0=0\beth_0 = \aleph_0, by the two base clauses. The two hierarchies then climb by different rules: the aleph step takes the least cardinal strictly above, and the beth step takes the power. Whether they nevertheless agree at every index is the generalised continuum hypothesis, which is not decided by the axioms in use here and is asserted nowhere on this page or its companion.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 98 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