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

Assuming the Axiom of Choice: κ<κcf⁡(κ) for every infinite cardinal κ, and cf⁡(2κ)>κ; in particular cf⁡(2ℵ0)>ℵ0

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let κ be an infinite cardinal (Cardinal (initial ordinal) and cardinality). Then:

(a) κ<κcf⁡(κ) (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations, Cofinality cf⁡(α), and regular and singular cardinals);

(b) cf⁡(2κ)>κ;

(c) in particular cf⁡(2ℵ0)>ℵ0 (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1).

Clause (c) is a genuine restriction on the continuum, and it is proved in ZFC rather than quoted. It rules out every value of 2ℵ0 whose cofinality is ℵ0, and it selects none.

Facts & Assumptions

Given: The Axiom of Choice and an infinite cardinal κ.

[L1]

If κi<λi for every i∈I then ∑i∈Iκi<∏i∈Iλi (König's theorem: assuming the Axiom of Choice, if κi<λi for every i∈I then ∑i∈Iκi<∏i∈Iλi).

[L2]

For a constant family, ∏i∈Iκ=κ∣I∣; and ∑i∈Iκi=∣⋃i∈I({i}×κi)∣ (The sum ∑i∈Iκi and the product ∏i∈Iκi of an indexed family of cardinals, defined under the Axiom of Choice).

[L4]

For cardinals κ≤λ iff κ⪯λ; A⪯B with both well-orderable gives ∣A∣≤∣B∣; μν≤μρ for ν≤ρ and μ≠0; and (μν)ρ=μν⊗ρ (Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ).

[L8]

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

[L9]

Assuming the Axiom of Choice every set is well-orderable, and a product of nonempty sets is nonempty (The well-ordering theorem, The Axiom of Choice, Choice function).

[L10]

Ordinals satisfy trichotomy, α⊆β iff α∈β or α=β, the union of a set of ordinals is its least upper bound, and every nonempty set of ordinals has an ∈-least element; a function is injective when equality of two values forces equality of the corresponding inputs (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Well-order and well-ordered set, Injection, surjection, bijection).

Proof

technique · direct
1.1

Put β=cf⁡(κ); since κ is a limit ordinal by [L7], [L3] makes β an infinite cardinal with β≤κ and supplies a strictly increasing cofinal g:β→κ; set κξ=∣g(ξ)∣ for ξ∈β, so each κξ is a cardinal with κξ≤g(ξ)<κ by [L8], and κ=⋃{g(ξ):ξ∈β}, because ζ∈κ gives ζ∪{ζ}∈κ and hence ζ∪{ζ}≤g(ξ) for some ξ, putting ζ∈g(ξ).

L3L7L8L10
2.1

κ≤∑ξ∈βκξ: for each ξ the set of bijections g(ξ)→κξ is nonempty by [L8], so [L9] supplies such a bξ for all ξ at once, and ζ↦(ξζ,bξζ(ζ)), with ξζ the ∈-least ξ having ζ∈g(ξ), is an injection of κ into ⋃ξ∈β({ξ}×κξ); [L2] and [L4] then give the inequality.

step 1.1L2L4L8L9L10
3.1

Claim (a): applying [L1] to the families (κξ)ξ∈β and the constant family λξ=κ, which satisfy κξ<κ by step 1.1, gives ∑ξ∈βκξ<∏ξ∈βκ=κ∣β∣ by [L2], and ∣β∣=β=cf⁡(κ) by [L8], since β is a cardinal; with step 2.1 this is κ<κcf⁡(κ).

step 1.1step 2.1L1L2L8
4.1

Claim (b): put μ=2κ, an infinite cardinal by [L6] and [L7] since ω≤κ<μ; were cf⁡(μ)≤κ, then step 3.1 applied to μ together with [L4] and [L5] would give μ<μcf⁡(μ)≤μκ=(2κ)κ=2κ⊗κ=2κ=μ, which [L10] forbids; so trichotomy leaves κ<cf⁡(2κ).

step 3.1L4L5L6L7L10
5.1

Claim (c) is step 4.1 at κ=ℵ0=ω, which is an infinite cardinal by [L7].

step 3.1step 4.1L7∎

Remarks

What clause (b) rules out, concretely. If 2ℵ0 were ℵω then its cofinality would be ℵ0 by ℵ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, contradicting clause (c); that refutation is carried out in FALSE: 2ℵ0=ℵω. The same test applies to any proposed value whose cofinality can be computed. Clause (c) is a restriction and not a determination: it excludes values and selects none.

Why the cofinality, and not the size, is the obstruction. Clause (a) says a cardinal is strictly smaller than itself raised to its own cofinality. Read contrapositively, a cardinal μ that is a power 2κ cannot have its cofinality drop to or below κ, because raising μ to that exponent would not increase it. The whole argument is the interaction of two facts, König's inequality and the second exponent law, and the second is where Hessenberg: κ⊗κ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ enters.

Where the Axiom of Choice is spent here. Three times: in the definitions of ∑, ∏ and 2κ; in step 2.1, to select a bijection g(ξ)→∣g(ξ)∣ for every ξ at once; and inside König's theorem: assuming the Axiom of Choice, if κi<λi for every i∈I then ∑i∈Iκi<∏i∈Iλi itself. None of the three is removable by a canonical construction, which is why the whole corollary carries the hypothesis in its statement.

Depends on

Used by

Dependency tree · two levels

68 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