Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription) 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.

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

Statement

Let cf\operatorname{cf}, regular and singular be as in Cofinality cf(α)\operatorname{cf}(\alpha), and regular and singular cardinals, and let α\aleph_\alpha be as in 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. Then:

(a) In ZF. cf(0)=0\operatorname{cf}(\aleph_0) = \aleph_0, so 0\aleph_0 is regular.

(b) Assuming the Axiom of Choice (The Axiom of Choice). α+1\aleph_{\alpha+1} is regular for every ordinal α\alpha.

(c) In ZF. cf(ω)=0\operatorname{cf}(\aleph_\omega) = \aleph_0, and 0<ω\aleph_0 < \aleph_\omega, so ω\aleph_\omega is singular.

(d) Assuming the Axiom of Choice. Every infinite cardinal below ω\aleph_\omega is regular, so ω\aleph_\omega is the least singular infinite cardinal.

Clause (b) is where the Axiom of Choice becomes indispensable, and the hypothesis is not decoration. The proof spends it once, to select an injection g(ξ)αg(\xi) \to \aleph_\alpha for each ξ\xi below the cofinality, and there is no canonical such family to fall back on: the sets g(ξ)g(\xi) are ordinals, but the injections are not determined by them. Clauses (a), (c) and the classification half of (d) are choice free.

Facts & Assumptions

Given: ZF, with the Axiom of Choice assumed only in clauses (b) and (d). Throughout, a map is called cofinal when its range is a cofinal subset of the target (Cofinal subset of an ordinal).

[L6]

For cardinals κλ\kappa \le \lambda iff κλ\kappa \preceq \lambda; ABA \preceq B with both well-orderable gives AB\lvert A\rvert \le \lvert B\rvert; \otimes is monotone (Commutativity, associativity, distributivity and monotonicity of \oplus and \otimes, the unit laws, the two exponent laws, and κλ\kappa \le \lambda if and only if κ\kappa injects into λ\lambda).

[L7]

For a well-orderable set XX, X\lvert X\rvert is the least ordinal equinumerous with XX, satisfies XXX \approx \lvert X\rvert and αα\lvert \alpha\rvert \le \alpha, and equals α\alpha exactly when α\alpha is a cardinal (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Equinumerous sets, ABA \approx B and ABA \preceq B).

[L8]

Every family of nonempty sets has a choice function (The Axiom of Choice, Choice function).

[L9]

Ordinals satisfy trichotomy, αβ\alpha \subseteq \beta iff αβ\alpha \in \beta or α=β\alpha = \beta, the union of a set of ordinals is its least upper bound, every nonempty set of ordinals has an \in-least element, ω\omega is the least limit ordinal, and every strictly increasing map of ordinals is injective (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, ω\omega is the least limit ordinal, Injection, surjection, bijection).

Proof

technique · direct
1.1

Claim (a): ω\omega is a limit ordinal by [L9], so cf(ω)\operatorname{cf}(\omega) is an infinite cardinal by [L1], hence ωcf(ω)\omega \le \operatorname{cf}(\omega) by [L4]; and cf(ω)ω\operatorname{cf}(\omega) \le \omega by [L1], so cf(0)=0\operatorname{cf}(\aleph_0) = \aleph_0.

L1L3L4L9
1.2

The set C={n:nω}C = \{\aleph_n : n \in \omega\} exists by Replacement, is contained in ω\aleph_\omega and is cofinal in it, since ω=C\aleph_\omega = \bigcup C by [L3] means every ζω\zeta \in \aleph_\omega lies in some n\aleph_n and hence satisfies ζn\zeta \le \aleph_n; moreover nnn \mapsto \aleph_n is injective by the strict increase in [L3], so CωC \approx \omega and C=0\lvert C\rvert = \aleph_0 by [L7].

L3L7L9
1.3

Setting up claim (b): let λ=α\lambda = \aleph_\alpha, κ=α+1\kappa = \aleph_{\alpha+1}, and suppose β=cf(κ)<κ\beta = \operatorname{cf}(\kappa) < \kappa, with g:βκg : \beta \to \kappa strictly increasing and cofinal by [L2]; then κ\kappa is a limit ordinal by [L4], so β\beta is an infinite cardinal by [L1], and βλ\beta \le \lambda because β\beta is a cardinal below the least cardinal strictly above λ\lambda ([L3]); moreover κ={g(ξ):ξβ}\kappa = \bigcup\{g(\xi) : \xi \in \beta\}, since for ζκ\zeta \in \kappa the ordinal ζ{ζ}\zeta \cup \{\zeta\} also lies in κ\kappa and is g(ξ)\le g(\xi) for some ξ\xi, putting ζg(ξ)\zeta \in g(\xi).

L1L2L3L4L9
2.1

Claim (c): step 1.2 and [L1] give cf(ω)0\operatorname{cf}(\aleph_\omega) \le \aleph_0; and ω\aleph_\omega is an infinite cardinal, hence a limit ordinal by [L4], so cf(ω)\operatorname{cf}(\aleph_\omega) is an infinite cardinal and 0cf(ω)\aleph_0 \le \operatorname{cf}(\aleph_\omega) by [L1] and [L4]; therefore cf(ω)=0<ω\operatorname{cf}(\aleph_\omega) = \aleph_0 < \aleph_\omega by the strict increase in [L3], and ω\aleph_\omega is singular.

step 1.2L1L3L4
2.2

Claim (b): each g(ξ)g(\xi) of step 1.3 lies in κ\kappa, so g(ξ)\lvert g(\xi)\rvert is a cardinal below κ\kappa and hence g(ξ)λ\lvert g(\xi)\rvert \le \lambda by [L3] and [L7], and the set IξI_\xi of injections g(ξ)λg(\xi) \to \lambda is nonempty; a choice function from [L8] on {Iξ:ξβ}\{I_\xi : \xi \in \beta\} supplies injections eξ:g(ξ)λe_\xi : g(\xi) \to \lambda for all ξ\xi at once, and ζ(ξζ,eξζ(ζ))\zeta \mapsto (\xi_\zeta, e_{\xi_\zeta}(\zeta)), with ξζ\xi_\zeta the \in-least ξ\xi having ζg(ξ)\zeta \in g(\xi), is then an injection κβ×λ\kappa \to \beta \times \lambda; so κβλ=λ\kappa \le \beta \otimes \lambda = \lambda by [L6] and [L5], contradicting λ<κ\lambda < \kappa, and therefore cf(κ)=κ\operatorname{cf}(\kappa) = \kappa.

step 1.3L5L6L7L8L9
3.1

Claim (d) and the conclusion: an infinite cardinal κ<ω\kappa < \aleph_\omega is α\aleph_\alpha for exactly one α\alpha by [L10], and αω\alpha \in \omega, since ωα\omega \le \alpha would give ωα\aleph_\omega \le \aleph_\alpha by the strict increase in [L3]; so κ\kappa is 0\aleph_0, regular by step 1.1, or n+1\aleph_{n+1} for some nωn \in \omega, regular by step 2.2; with step 2.1 this makes ω\aleph_\omega the least singular infinite cardinal.

step 1.1step 2.1step 2.2L3L9L10

Remarks

Why regularity of 1\aleph_1 is not a theorem of ZF. The proof of clause (b) selects one injection for each ξ\xi below the cofinality, and that selection is the entire content of the choice hypothesis: a union of countably many countable sets is not provably countable in ZF, and the same phenomenon is what would otherwise force cf(1)=1\operatorname{cf}(\aleph_1) = \aleph_1. The choice ledger at the end of this page records how far this can fail.

Why ω\aleph_\omega is singular for a completely different reason. Nothing is chosen in clause (c): the map nnn \mapsto \aleph_n is definable, and it is short and cofinal simply because the index ω\omega is a limit ordinal reached from below in ω\omega steps. Singularity of ω\aleph_\omega is therefore a fact about the index, not about the size, and clause (c) holds in ZF.

What "least singular" means and what it does not. Clause (d) locates ω\aleph_\omega among the alephs: everything below it is regular, under choice. It says nothing about which cardinals above ω\aleph_\omega are singular, and it says nothing about 202^{\aleph_0}, whose position in the aleph hierarchy is not determined by anything on this page. What is determined is a constraint on that position, and it is 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.

Depends on

Used by

Dependency tree · next 3 levels

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