Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)
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.

ℵ0 is regular in ZF; assuming the Axiom of Choice every successor aleph ℵα+1 is regular; cf⁡(ℵω)=ℵ0, so ℵω is singular, and under choice it is the least singular infinite cardinal

Statement

Let cf⁡, regular and singular be as in Cofinality cf⁡(α), and regular and singular cardinals, and let ℵα be as in The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1. Then:

(a) In ZF. cf⁡(ℵ0)=ℵ0, so ℵ0 is regular.

(b) Assuming the Axiom of Choice (The Axiom of Choice). ℵα+1 is regular for every ordinal α.

(c) In ZF. cf⁡(ℵω)=ℵ0, and ℵ0<ℵω, so ℵω is singular.

(d) Assuming the Axiom of Choice. Every infinite cardinal below ℵω is regular, so ℵω 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(ξ)→ℵα for each ξ below the cofinality, and there is no canonical such family to fall back on: the sets g(ξ) 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 κ≤λ iff κ⪯λ; A⪯B with both well-orderable gives ∣A∣≤∣B∣; ⊗ is monotone (Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ).

[L7]

For a well-orderable set X, ∣X∣ is the least ordinal equinumerous with X, satisfies X≈∣X∣ and ∣α∣≤α, and equals α exactly when α 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, A≈B and A⪯B).

[L8]

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

[L9]

Ordinals satisfy trichotomy, α⊆β iff α∈β or α=β, the union of a set of ordinals is its least upper bound, every nonempty set of ordinals has an ∈-least element, ω 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, ω is the least limit ordinal, Injection, surjection, bijection).

Proof

technique · direct
1.1

Claim (a): ω is a limit ordinal by [L9], so cf⁡(ω) is an infinite cardinal by [L1], hence ω≤cf⁡(ω) by [L4]; and cf⁡(ω)≤ω by [L1], so cf⁡(ℵ0)=ℵ0.

L1L3L4L9
1.2

The set C={ℵn:n∈ω} exists by Replacement, is contained in ℵω and is cofinal in it, since ℵω=⋃C by [L3] means every ζ∈ℵω lies in some ℵn and hence satisfies ζ≤ℵn; moreover n↦ℵn is injective by the strict increase in [L3], so C≈ω and ∣C∣=ℵ0 by [L7].

L3L7L9
1.3

Setting up claim (b): let λ=ℵα, κ=ℵα+1, and suppose β=cf⁡(κ)<κ, with g:β→κ strictly increasing and cofinal by [L2]; then κ is a limit ordinal by [L4], so β is an infinite cardinal by [L1], and β≤λ because β is a cardinal below the least cardinal strictly above λ ([L3]); moreover κ=⋃{g(ξ):ξ∈β}, since for ζ∈κ the ordinal ζ∪{ζ} also lies in κ and is ≤g(ξ) for some ξ, putting ζ∈g(ξ).

L1L2L3L4L9
2.1

Claim (c): step 1.2 and [L1] give cf⁡(ℵω)≤ℵ0; and ℵω is an infinite cardinal, hence a limit ordinal by [L4], so cf⁡(ℵω) is an infinite cardinal and ℵ0≤cf⁡(ℵω) by [L1] and [L4]; therefore cf⁡(ℵω)=ℵ0<ℵω by the strict increase in [L3], and ℵω is singular.

step 1.2L1L3L4
2.2

Claim (b): each g(ξ) of step 1.3 lies in κ, so ∣g(ξ)∣ is a cardinal below κ and hence ∣g(ξ)∣≤λ by [L3] and [L7], and the set Iξ of injections g(ξ)→λ is nonempty; a choice function from [L8] on {Iξ:ξ∈β} supplies injections eξ:g(ξ)→λ for all ξ at once, and ζ↦(ξζ,eξζ(ζ)), with ξζ the ∈-least ξ having ζ∈g(ξ), is then an injection κ→β×λ; so κ≤β⊗λ=λ by [L6] and [L5], contradicting λ<κ, and therefore cf⁡(κ)=κ.

step 1.3L5L6L7L8L9
3.1

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

step 1.1step 2.1step 2.2L3L9L10∎

Remarks

Why regularity of ℵ1 is not a theorem of ZF. The proof of clause (b) selects one injection for each ξ 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. The choice ledger at the end of this page records how far this can fail.

Why ℵω is singular for a completely different reason. Nothing is chosen in clause (c): the map n↦ℵn is definable, and it is short and cofinal simply because the index ω is a limit ordinal reached from below in ω steps. Singularity of ℵω 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 ℵω among the alephs: everything below it is regular, under choice. It says nothing about which cardinals above ℵω are singular, and it says nothing about 2ℵ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⁡(κ) for every infinite cardinal κ, and cf⁡(2κ)>κ; in particular cf⁡(2ℵ0)>ℵ0.

Depends on

Used by

Dependency tree · two levels

70 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