Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (claude-sonnet-5 + deepseek-v4-pro)verified 2026-08-05 (claude-sonnet-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.

Cofinality cf(α)\operatorname{cf}(\alpha), and regular and singular cardinals

Definition

Let α\alpha be an ordinal (Ordinal (von Neumann)). The cofinality of α\alpha is

cf(α)  :=  the least ordinal β for which some f:βα has cofinal range,\operatorname{cf}(\alpha) \;:=\; \text{the least ordinal } \beta \text{ for which some } f : \beta \to \alpha \text{ has cofinal range},

cofinal range meaning that f[β]f[\beta] is a cofinal subset of α\alpha (Cofinal subset of an ordinal): every ζα\zeta \in \alpha satisfies ζf(ξ)\zeta \le f(\xi) for some ξβ\xi \in \beta. That such a least ordinal exists, and that a witnessing map of that length may be taken strictly increasing, is For every ordinal α\alpha there is a least ordinal β\beta admitting a map βα\beta \to \alpha with cofinal range, and that map may always be taken strictly increasing, and both are theorems of ZF. So cf\operatorname{cf} is defined at every ordinal, without any choice principle.

Regular and singular. An infinite cardinal κ\kappa — a cardinal (Cardinal (initial ordinal) and cardinality) with ωκ\omega \subseteq \kappa (Cardinal sum κλ\kappa \oplus \lambda, product κλ\kappa \otimes \lambda and exponentiation κλ\kappa^{\lambda}, and why they are written apart from the ordinal operations), for instance any α\aleph_\alpha (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) — is

  • regular when cf(κ)=κ\operatorname{cf}(\kappa) = \kappa;
  • singular when cf(κ)κ\operatorname{cf}(\kappa) \ne \kappa.

The two cases are exhaustive by definition, and by cf(α)α\operatorname{cf}(\alpha) \le \alpha; cf(0)=0\operatorname{cf}(0) = 0 and cf(α+1)=1\operatorname{cf}(\alpha + 1) = 1; for a limit ordinal λ\lambda the value cf(λ)\operatorname{cf}(\lambda) is an infinite cardinal with cf(cf(λ))=cf(λ)\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda), so it is regular; and every cofinal subset of λ\lambda has cardinality at least cf(λ)\operatorname{cf}(\lambda), a value that is attained singular means exactly cf(κ)<κ\operatorname{cf}(\kappa) < \kappa, since cf(α)α\operatorname{cf}(\alpha) \le \alpha always holds.

Remarks

Why regularity is defined for cardinals and not for ordinals. The definition of cf\operatorname{cf} applies to every ordinal, and it must, because the construction quantifies over maps into α\alpha of every length. But cf(α)=α\operatorname{cf}(\alpha) = \alpha is an uninteresting condition on a general ordinal: it fails at ω+1\omega + 1 and at ω2\omega \cdot 2 for reasons that have nothing to do with size, and it holds only at 00, at 11, and at infinite cardinals, where it is exactly the regularity defined above and so fails at every singular one. Calling an ordinal regular would therefore say nothing new, which is why the words are attached to cardinals here.

What a singular cardinal is, in one sentence. A cardinal that is reachable from below by fewer than κ\kappa steps: there is a strictly increasing family of ordinals below κ\kappa, indexed by an ordinal strictly shorter than κ\kappa, whose supremum is κ\kappa. That is exactly the failure of regularity, and 0\aleph_0 is regular in ZF; assuming the Axiom of Choice every successor aleph α+1\aleph_{\alpha+1} is regular; cf(ω)=0\operatorname{cf}(\aleph_\omega) = \aleph_0, so ω\aleph_\omega is singular, and under choice it is the least singular infinite cardinal exhibits a cardinal for which it happens.

Why cf(κ)\operatorname{cf}(\kappa) being a regular cardinal is a theorem and not part of the definition. Regularity is defined through cf\operatorname{cf}, so building "cf(κ)\operatorname{cf}(\kappa) is regular" into the definition would make the definition refer to itself. The statement is true, and it is cf(α)α\operatorname{cf}(\alpha) \le \alpha; cf(0)=0\operatorname{cf}(0) = 0 and cf(α+1)=1\operatorname{cf}(\alpha + 1) = 1; for a limit ordinal λ\lambda the value cf(λ)\operatorname{cf}(\lambda) is an infinite cardinal with cf(cf(λ))=cf(λ)\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda), so it is regular; and every cofinal subset of λ\lambda has cardinality at least cf(λ)\operatorname{cf}(\lambda), a value that is attained ; it is recorded here as the item that discharges the naming obligation of this definition, and nothing above depends on it.

Only one notion of "cofinal" exists in this library. Cofinal subset of an ordinal introduces cofinal subsets, because the boundedness theorem for ω1\omega_1 needs them, and deliberately introduces neither the cofinality function nor the regular/singular vocabulary. Both are introduced here, and the definition above is written in exactly that item's terms, so no second notion is created.

Depends on

Used by

Dependency tree · next 3 levels

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