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.

cf⁡(ℵω)=ℵ0, computed from the cofinal map n↦ℵn

Example

Work in ZF; no choice principle is used. The set

C  =  { ℵn:n∈ω }  ⊆  ℵω

(The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1) is cofinal in ℵω (Cofinal subset of an ordinal) and satisfies ∣C∣=ℵ0, so

cf⁡(ℵω)  =  ℵ0  <  ℵω

(Cofinality cf⁡(α), and regular and singular cardinals) and ℵω is singular.

Two things make the computation work, and both are visible in the display. The upper bound is the cofinal family itself: ℵω is by definition the supremum of the ℵn, so a family indexed by ω already reaches it. The lower bound is structural: ℵω is an infinite cardinal, hence a limit ordinal, so its cofinality is an infinite cardinal (cf⁡(α)≤α; cf⁡(0)=0 and cf⁡(α+1)=1; for a limit ordinal λ the value cf⁡(λ) is an infinite cardinal with cf⁡(cf⁡(λ))=cf⁡(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf⁡(λ), a value that is attained) and cannot be smaller than ℵ0.

Facts & Assumptions

Given: ZF, with no choice principle.

[L3]

C⊆α is cofinal when every ζ∈α has some η∈C with ζ≤η (Cofinal subset of an ordinal).

[L5]

For a well-orderable set X, ∣X∣ is the least ordinal equinumerous with X, and equinumerous sets receive the same one (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).

[L6]

Ordinals satisfy trichotomy, α⊆β iff α∈β or α=β, and α⊆β⊆α forces α=β (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals).

Verification

technique · direct
1.1

The set C={ℵn:n∈ω} exists by Replacement, and C⊆ℵω because n∈ω gives ℵn∈ℵω by the strict increase in [L1] and [L2].

L1L2L6
1.2

C is cofinal in ℵω: by [L1] and [L2], ℵω=⋃C, so each ζ∈ℵω lies in some ℵn and hence satisfies ζ≤ℵn with ℵn∈C, which is [L3].

L1L2L3L6
1.3

∣C∣=ℵ0: the map n↦ℵn is injective by the strict increase in [L1], so C≈ω and [L5] applies.

L1L5
2.1

By [L4] with λ=ℵω, which is a limit ordinal by [L1] and [L2], steps 1.2 and 1.3 give cf⁡(ℵω)≤ℵ0; and cf⁡(ℵω) is an infinite cardinal by [L4], so ℵ0≤cf⁡(ℵω) by [L2].

step 1.2step 1.3L1L2L4
3.1

Hence cf⁡(ℵω)=ℵ0 by [L6], and ℵ0<ℵω by the strict increase in [L1], so ℵω is singular.

step 2.1L1L6∎

Remarks

Nothing is chosen, and that is the point. The cofinal family is the definable map n↦ℵn, and Replacement makes its range a set. So singularity of ℵω is a theorem of ZF, in contrast with the regularity of successor alephs, which is not (ℵ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).

The size of ℵω plays no role. Only the index ω is used: it is a limit ordinal reached from below by an ω-indexed family, and the aleph operation is continuous at limits, so the same computation gives cf⁡(ℵλ)≤∣λ∣ for any limit λ by exactly the argument of steps 1.2 and 1.3. What that bound is worth depends on λ, and Assuming countable choice, cf⁡(ℵω1)=ℵ1, so singular does not mean of countable cofinality computes a case where it is uncountable.

Why this is not a counterexample to anything about 2ℵ0. It is the input to one: cf⁡(2ℵ0)>ℵ0 (Assuming the Axiom of Choice: κ<κcf⁡(κ) for every infinite cardinal κ, and cf⁡(2κ)>κ; in particular cf⁡(2ℵ0)>ℵ0) together with the value computed here is what refutes 2ℵ0=ℵω (FALSE: 2ℵ0=ℵω).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

60 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