Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

An ordinal α with ℵα=α, built as the supremum of the tower ℵ0,ℵℵ0,ℵℵℵ0,…, and its cofinality is ℵ0

Example

Work in ZF; no choice principle is used. There is a tower of ordinals with

T(0)=ℵ0,T(n+1)=ℵT(n)(n∈ω),

so that T(1)=ℵℵ0=ℵω and T(2)=ℵℵω (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). Put

α  =  sup⁡{ T(n):n∈ω }  =  ⋃{ T(n):n∈ω }.

Then

ℵα  =  α,cf⁡(α)=ℵ0,

so α is an infinite cardinal (Cardinal (initial ordinal) and cardinality) fixed by the aleph operation, and it is singular (Cofinality cf⁡(α), and regular and singular cardinals).

So the aleph operation has fixed points, even though it is strictly increasing and satisfies β≤ℵβ at every ordinal (The clauses at 0, at a successor and at a limit determine exactly one operation α↦ℵα, in ZF, and — assuming the Axiom of Choice — exactly one operation α↦ℶα; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and α≤ℵα). The power operation behaves differently: assuming the Axiom of Choice, so that 2κ is a cardinal at all, κ<2κ at every cardinal (Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ), so there are no fixed points there at all. That comparison is an aside; nothing below uses it, and the example itself stays in ZF.

Facts & Assumptions

Given: ZF, with no choice principle. Write n+1=n∪{n} for the successor of n∈ω (The natural numbers N (von Neumann)).

[L2]

A class rule G on functions whose domain is an ordinal determines exactly one class function T defined at every ordinal with T(β)=G(T↾β) (Transfinite recursion along the ordinals: a class rule determines exactly one operation defined at every ordinal).

[L3]

Transfinite induction is valid on any well-order, in particular on (ω,∈) (Transfinite induction, Trichotomy and well-ordering of the ordinals).

[L4]

ω is the least limit ordinal, is closed under successor, and its elements are exactly the ordinals below it, with n+1={0,…,n} (ω is the least limit ordinal, Successor and limit ordinals, Ordinal (von Neumann), The natural numbers N (von Neumann)).

[L5]

For a set D of ordinals, ⋃D is an ordinal and the least upper bound of D; ordinals satisfy trichotomy; α⊆β iff α∈β or α=β; α∉α (Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals).

[L7]

An injective map onto its range is a bijection to that range; for a well-orderable set X, ∣X∣ is the least ordinal equinumerous with X, and equinumerous sets receive the same cardinal (Injection, surjection, bijection, 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).

Verification

technique · direct
1.1

Apply [L2] to the rule sending a function h whose domain is an ordinal to ℵ⋃ran⁡(h), which is given by a formula; this yields exactly one class function T, defined at every ordinal, with T(β)=ℵ⋃ran⁡(T↾β), and in particular T(0)=ℵ⋃∅=ℵ0.

L1L2L5
2.1

By induction along [L3] on n∈ω, the statement "T(k)∈T(k+1) for every k≤n, and T(n+1)=ℵT(n)" holds for every n. At n=0: ran⁡(T↾1)={T(0)} by [L4], so T(1)=ℵT(0)=ℵℵ0, and 0∈ℵ0 gives ℵ0∈ℵℵ0 by the strict increase in [L1], that is T(0)∈T(1). At n+1: the statement at n makes T(0)⊆⋯⊆T(n+1) by [L5], so ⋃ran⁡(T↾(n+2))=T(n+1) and T(n+2)=ℵT(n+1); and T(n)∈T(n+1) together with strict increase gives ℵT(n)∈ℵT(n+1), that is T(n+1)∈T(n+2).

step 1.1L1L3L4L5
3.1

Replacement makes C={T(n):n∈ω} a set of ordinals, so α=⋃C is an ordinal and the least upper bound of C by [L5]; and α is a limit ordinal, since α≠0 because ℵ0=T(0)⊆α, and α is not a successor because step 2.1 gives T(n)∈T(n+1)⊆α for every n, so no member of C is largest and no ordinal below α is an upper bound of C.

step 2.1L1L4L5
4.1

ℵα=α: continuity in [L1] at the limit ordinal α gives ℵα=⋃{ℵβ:β∈α}; each β∈α lies in some T(n) by [L5], so strict increase gives ℵβ∈ℵT(n)=T(n+1)⊆α using step 2.1, whence ℵα⊆α; and α⊆ℵα is the inequality β≤ℵβ of [L1] at β=α.

step 2.1step 3.1L1L5
4.2

cf⁡(α)=ℵ0: the set C is cofinal in α, since α=⋃C makes every ζ∈α a member of some T(n) and hence ζ≤T(n); and ∣C∣=ℵ0, because n↦T(n) is injective by step 2.1 and [L5], so C≈ω and [L7] applies; therefore cf⁡(α)≤ℵ0 by [L6], while cf⁡(α) is an infinite cardinal by [L6] and step 3.1, hence ℵ0≤cf⁡(α) by [L8].

step 2.1step 3.1L5L6L7L8
5.1

So α=ℵα is an infinite cardinal by [L1] and step 4.1, it is fixed by the aleph operation, and cf⁡(α)=ℵ0<α by step 4.2 and [L5], so it is singular.

step 4.1step 4.2L1L5∎

Remarks

Why a fixed point is not a contradiction. β≤ℵβ holds everywhere and the operation is strictly increasing, but neither forces β<ℵβ: strict increase compares the values at two different indices and says nothing about the value at one index. The tower converges exactly because at a limit the value is the supremum of the earlier ones, and the supremum of the tower is what the tower was climbing towards.

Nothing is chosen, and nothing beyond Replacement is used. The tower is a definable ω-indexed family, Replacement makes its range a set, and every step of the verification is a computation. So the whole example is a theorem of ZF, like the aleph hierarchy it is built from.

Its cofinality is the smallest an infinite cardinal can have. cf⁡(α)=ℵ0 says α is reached by an ω-indexed family, which is exactly how it was built. So this fixed point is singular, and, assuming the Axiom of Choice, by Assuming the Axiom of Choice: κ<κcf⁡(κ) for every infinite cardinal κ, and cf⁡(2κ)>κ; in particular cf⁡(2ℵ0)>ℵ0 it is therefore not a possible value of 2ℵ0. Nothing above claims it is the least fixed point.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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