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.

Assuming countable choice, cf⁡(ℵω1)=ℵ1, so singular does not mean of countable cofinality

Example

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Then

cf⁡(ℵω1)  =  ℵ1  <  ℵω1,

so ℵω1 is singular (Cofinality cf⁡(α), and regular and singular cardinals) and its cofinality is uncountable (Finite, countably infinite, countable, uncountable).

This separates two conditions that the first singular example runs together. A singular cardinal is one reachable from below by a strictly shorter family; it need not be reachable by a countable one. Here the reaching family has length ω1 and no shorter one will do, and what rules out a shorter one is the boundedness theorem for ω1 (Assuming countable choice: every at most countable subset of ω1 is bounded below ω1, so no at most countable subset of ω1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable), which is where ACω is spent.

Facts & Assumptions

Given: The Axiom of Countable Choice. Write ω1 for the first uncountable ordinal (The first uncountable ordinal ω1:=ℵ(ω)).

[L4]

Assuming ACω, every at most countable A⊆ω1 is bounded below ω1: sup⁡A=⋃A lies in ω1 and dominates every member of A (Assuming countable choice: every at most countable subset of ω1 is bounded below ω1, so no at most countable subset of ω1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable).

[L5]

A nonempty set is at most countable if and only if it is a surjective image of N (A nonempty set is at most countable iff it is a surjective image of N, Finite, countably infinite, countable, uncountable).

[L7]

For a well-orderable set X, ∣X∣ is the least ordinal equinumerous with X, equinumerous sets receive the same one, and ∣α∣=α 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, Cardinal (initial ordinal) and cardinality, Equinumerous sets, A≈B and A⪯B).

[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; and every strictly increasing map of ordinals is injective (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Injection, surjection, bijection).

Verification

technique · direct
1.1

The set C={ℵα:α∈ω1} exists by Replacement and is cofinal in ℵω1: ω1 is a limit ordinal by [L2], so ℵω1=⋃C by [L1] and every ζ∈ℵω1 lies in some ℵα∈C; moreover α↦ℵα is injective by the strict increase in [L1], so C≈ω1 and ∣C∣=∣ω1∣=ω1=ℵ1 by [L7], [L2] and [L1].

L1L2L7L9
1.2

The cofinality is not smaller than ℵ1. Put β=cf⁡(ℵω1); it is an infinite cardinal by [L6] and [L8], since ℵω1 is an infinite cardinal and hence a limit ordinal. If β<ℵ1 then β≤ℵ0 by [L3], so β=ℵ0=ω by [L8], and [L6] supplies a cofinal f:ω→ℵω1. For each n∈ω let αn be the ∈-least α∈ω1 with f(n)∈ℵα, which exists by [L1] and [L9] and is determined rather than chosen. Then A={αn:n∈ω} is a nonempty at most countable subset of ω1 by [L5], so γ=sup⁡A∈ω1 by [L4], and every f(n) lies in ℵαn⊆ℵγ by [L1] and [L9]. But ℵγ∈ℵω1, and cofinality of f would give some n with ℵγ≤f(n)∈ℵγ, which [L9] forbids. So ℵ1≤β.

L1L2L3L4L5L6L8L9
2.1

By [L6] applied to the cofinal set of step 1.1, cf⁡(ℵω1)≤∣C∣=ℵ1.

step 1.1L6
3.1

Steps 2.1 and 1.2 give cf⁡(ℵω1)=ℵ1 by [L9]; and ℵ1<ℵω1 by the strict increase in [L1], since 1∈ω1 by [L2], so ℵω1 is singular with uncountable cofinality by [L2].

step 1.2step 2.1L1L2L9∎

Remarks

Why countable choice appears, and where exactly. It is used once, at [L4]: without it, ω1 can consistently be the supremum of an ω-indexed family of countable ordinals, and then the argument of step 1.2 collapses. That dependence is inherited, not introduced here — the published boundedness theorem carries the same hypothesis, and states so in its own title.

What "singular" does and does not mean. Singular says only cf⁡(κ)≠κ. The singular cardinal computed in cf⁡(ℵω)=ℵ0, computed from the cofinal map n↦ℵn has countable cofinality, and a reader who meets only that example may take the two conditions to be the same. They are not: here the cofinality is ℵ1, uncountable, while the cardinal is still singular because ℵ1 is far below ℵω1.

The pattern behind both computations. For a limit ordinal λ the family α↦ℵα restricted to λ is cofinal in ℵλ, so cf⁡(ℵλ)≤∣λ∣ always. The work is entirely in the lower bound, and it is a statement about λ rather than about ℵλ: it asks how short a family can be and still reach λ.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 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