Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (claude-sonnet-5 + deepseek-v4-pro)verified 2026-08-05 (claude-sonnet-5)
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.

For every set A the Hartogs number ℵ(A) is a cardinal, and for every cardinal κ it is the least cardinal strictly above κ; this is a theorem of ZF

Statement

Work in ZF; no choice principle is used. For a set A let ℵ(A) be its Hartogs number (Hartogs: an ordinal that does not inject into a given set), the least ordinal (Ordinal (von Neumann)) admitting no injection into A. Then:

(a) ℵ(A) is a cardinal (Cardinal (initial ordinal) and cardinality), for every set A, well-orderable or not.

(b) If κ is a cardinal then κ<ℵ(κ), and every cardinal λ with κ<λ satisfies ℵ(κ)≤λ. So ℵ(κ) is the least cardinal strictly above κ.

(c) If κ is an infinite cardinal then so is ℵ(κ).

What this supplies, and what it does not. It gives a successor operation on cardinals in ZF alone: there is always a next one, and it is definable. It says nothing about how large the next cardinal is compared with 2κ; that comparison is not decided by the axioms in use here.

Facts & Assumptions

Given: A set A and a cardinal κ, in ZF, with no choice principle.

[L1]

ℵ(A) is an ordinal that does not inject into A, and it is the least such; consequently every ordinal β∈ℵ(A) does inject into A (Hartogs: an ordinal that does not inject into a given set).

[L2]

An ordinal κ is a cardinal when no α∈κ satisfies α≈κ (Cardinal (initial ordinal) and cardinality, Equinumerous sets, A≈B and A⪯B).

[L4]

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

[L5]

A composition of an injection with a bijection is an injection, a subset inclusion is an injection, and the identity is a bijection (Injection, surjection, bijection).

Proof

technique · direct
1.1

Every β∈ℵ(A) injects into A, and ℵ(A) itself does not.

L1
1.2

If λ is a cardinal with κ<λ then λ does not inject into κ: an injection λ→κ would give λ≤κ by [L3], contradicting κ∈λ and trichotomy.

L3L4
2.1

Claim (a): if β∈ℵ(A) had β≈ℵ(A), then composing a bijection ℵ(A)→β with an injection β→A supplied by step 1.1 would inject ℵ(A) into A, which step 1.1 forbids; so no element of ℵ(A) is equinumerous with it and ℵ(A) is a cardinal by [L2].

step 1.1L2L5
2.2

First half of claim (b): κ injects into κ by the identity, so κ≠ℵ(κ) by step 1.1; and ℵ(κ)∈κ is impossible, since then ℵ(κ)⊆κ by [L4] and the inclusion would inject it into κ; trichotomy leaves κ∈ℵ(κ), that is κ<ℵ(κ).

step 1.1L4L5
3.1

Second half of claim (b) and claim (c): a cardinal λ with κ<λ does not inject into κ by step 1.2, so ℵ(κ)≤λ by the minimality in [L1]; with step 2.2 and step 2.1 this makes ℵ(κ) the least cardinal strictly above κ; and if ω≤κ then ω≤κ<ℵ(κ) by step 2.2, so ℵ(κ) is infinite.

step 1.2step 2.1step 2.2L1L4L6∎

Remarks

Why claim (a) is stated for an arbitrary set. For a cardinal κ only the special case is needed here, but the general case costs the same two lines and is exactly what Tarski: the Axiom of Choice is equivalent to the statement that A×A≈A for every infinite set A, so extending Hessenberg's theorem from the alephs to arbitrary sets is exactly as strong as choice uses: there, A is an arbitrary infinite set that is not known to be well-orderable, and the argument needs ℵ(A) to be an infinite cardinal before Hessenberg's theorem can be applied to it.

No power set is involved. Hartogs: an ordinal that does not inject into a given set builds ℵ(A) from the well-ordered subsets of A, so the successor cardinal is obtained without ever forming P(A) as a size. That separation is what makes the aleph hierarchy a ZF construction while the beth hierarchy is not.

The notation collides with the ordinal successor, and this page keeps them apart. α+=α∪{α} is the ordinal successor (Ordinal (von Neumann)) and is almost never a cardinal: an infinite cardinal is a limit ordinal, so κ∪{κ} is not one. The cardinal successor is ℵ(κ), which is much larger. Where an item on this page writes the superscript on an ordinal letter, as 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 does with α+, it carries the published ordinal meaning α∪{α}. This item writes the cardinal successor as ℵ(κ) throughout; the abbreviation κ+:=ℵ(κ), on a cardinal letter only, is introduced later on this page, and the superscript on an ordinal letter keeps the ordinal meaning there too.

Depends on

Used by

Dependency tree · two levels

28 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