Alphabeta Math
False statementConstruction: 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.

FALSE: ℵα is regular for every ordinal α

Statement

FALSE. Every aleph is regular: cf⁡(ℵα)=ℵα for every ordinal α (Cofinality cf⁡(α), and regular and singular cardinals, The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1).

The claim is plausible because the alephs a reader meets first are regular: ℵ0 is regular in ZF, and assuming the Axiom of Choice every successor aleph is regular (ℵ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). It fails at the first aleph whose index is a limit ordinal, and the failure is a theorem of ZF requiring no choice principle at all.

Facts & Assumptions

Refutation

technique · contradiction
1.1

Suppose, for contradiction, that cf⁡(ℵα)=ℵα for every ordinal α.

assume-contra
1.2

By [L1] and [L3], cf⁡(ℵω)=ℵ0 and ℵ0<ℵω.

L1L3
2.1

Instantiating the assumption at α=ω gives cf⁡(ℵω)=ℵω, hence ℵ0=ℵω by step 1.2, which [L4] forbids; so not every aleph is regular, and ℵω is singular by [L2].

step 1.1step 1.2L2L4discharge-contradiction∎

Remarks

Which alephs the theorem does certify. ℵ0, in ZF; and every ℵα+1, assuming the Axiom of Choice (ℵ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). So the false claim is not wrong everywhere — it is wrong exactly where the index is a limit ordinal reached from below by a short family, and ω is the smallest such index.

Singularity here is about the index, not about the size. The cofinal family that witnesses cf⁡(ℵω)=ℵ0 is n↦ℵn, indexed by ω because the subscript ω is a limit of an ω-sequence. Nothing about how large ℵω is enters the argument, and nothing is chosen, which is why clause (c) of ℵ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 is choice free while clause (b) is not.

The claim is not repaired by assuming choice. Adding the Axiom of Choice certifies more alephs as regular, but it does not touch the witness above: the refutation is a theorem of ZF and remains one in ZFC.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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