Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-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.

Hessenberg: κ⊗κ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ

Statement

Let κ be an infinite cardinal, that is a cardinal (Cardinal (initial ordinal) and cardinality) with ω≤κ. Then

κ⊗κ=κ,equivalently∣κ×κ∣=κ

(Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations).

This is a theorem of ZF and uses no choice principle. The well-order that carries the proof is written down from the ordinal order on κ; nothing is selected anywhere. That matters for this page: Hessenberg's theorem is exactly the part of "an infinite set is the same size as its square" that survives without choice.

Facts & Assumptions

Given: An infinite cardinal κ, in ZF. No choice principle is assumed. For ordinals ξ,η write max⁡(ξ,η) for the ⊆-larger of the two, which exists by comparability.

[L1]

For a well-orderable X: X≈∣X∣, the value is a cardinal, 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).

[L3]

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

[L5]

N×N≈N, that is ω×ω≈ω (N×N≈N, Finite, countably infinite, countable, uncountable).

[L6]

Every well-order is order isomorphic to exactly one ordinal, its order type; an order isomorphism is a bijection and carries the initial segment below a point onto the initial segment below its image (Every well-order has a unique order type, Order embedding and order isomorphism, Initial segment of a well-order).

[L7]

If S⊆W for a well-order (W,<) satisfies "W<a⊆S implies a∈S" for every a∈W, then S=W (Transfinite induction).

[L8]

Ordinals: elements of ordinals are ordinals, α∉α, α⊆β iff α∈β or α=β, trichotomy holds, every nonempty set of ordinals has an ∈-least element, and every set of ordinals is well ordered by ∈ (Basic closure properties of ordinals, Trichotomy and well-ordering of the ordinals, Ordinal (von Neumann), Well-order and well-ordered set).

[L9]

ω is the least limit ordinal and is an ordinal (ω is the least limit ordinal); a bijection witnesses ≈ and a subset inclusion is an injection (Equinumerous sets, A≈B and A⪯B, Injection, surjection, bijection).

Proof

technique · direct
1.1

For an ordinal α define (ξ,η)⊲(ξ′,η′) on α×α to hold when max⁡(ξ,η)∈max⁡(ξ′,η′), or the two maxima are equal and ξ∈ξ′, or the two maxima are equal, ξ=ξ′ and η∈η′; this is the lexicographic order on the triple (max⁡(ξ,η),ξ,η) of ordinals, hence irreflexive, transitive and trichotomous by [L8], and a nonempty S⊆α×α has a ⊲-least element obtained by taking in turn the ∈-least maximum occurring in S, then the ∈-least admissible ξ, then the ∈-least admissible η, each of which is the least element of a nonempty set of ordinals and so is determined rather than chosen; therefore ⊲ well-orders α×α.

L8
1.2

For (ξ,η)∈α×α put γ=max⁡(ξ,η)∪{max⁡(ξ,η)}, the successor of the maximum; then every (ξ′,η′)⊲(ξ,η) has max⁡(ξ′,η′)⊆max⁡(ξ,η)∈γ, so ξ′,η′∈γ, and the ⊲-initial segment of α×α below (ξ,η) is contained in γ×γ.

L8
1.3

Base value: ω×ω≈ω by [L5], so ∣ω×ω∣=∣ω∣=ω by [L1] and [L4].

L1L4L5
1.4

Lower bound: for any ordinal μ with 0∈μ the map ξ↦(ξ,0) is an injection μ→μ×μ, so ∣μ∣≤∣μ×μ∣ by [L3], and ∣μ∣=μ when μ is a cardinal.

L1L3L9
2.1

Now let μ be an infinite cardinal with ω∈μ, and assume the induction hypothesis that ∣ν×ν∣=ν for every infinite cardinal ν∈μ; for (ξ,η)∈μ×μ and γ as in step 1.2 we have γ∈μ, because μ is a limit ordinal by [L4] and max⁡(ξ,η)∈μ, and moreover ∣γ×γ∣∈μ: if γ∈ω then ∣γ×γ∣=γ⊗γ∈ω⊆μ by [L4], while if ω⊆γ then ν=∣γ∣ satisfies ω≤ν≤γ∈μ by [L1] and [L3], so ν is an infinite cardinal in μ and γ×γ≈ν×ν by [L1] and [L2], whence ∣γ×γ∣=∣ν×ν∣=ν∈μ.

step 1.2L1L2L3L4
3.1

Under the same hypothesis, the ⊲-initial segment I of μ×μ below any (ξ,η) has order type in μ: I⊆γ×γ by step 1.2 and I is well ordered by the restriction of ⊲ by step 1.1, so ∣I∣≤∣γ×γ∣∈μ by [L3] and step 2.1; and if the order type θ of I satisfied μ⊆θ then μ⪯θ≈I by [L6] and [L9], giving μ≤∣I∣ by [L3], which contradicts ∣I∣∈μ.

step 1.1step 1.2step 2.1L3L6L9
4.1

Under the same hypothesis, ∣μ×μ∣=μ: let δ be the order type of (μ×μ,⊲) and g:δ→μ×μ the inverse of the collapsing isomorphism ([L6]); if μ∈δ then g carries the initial segment of δ below μ, which is μ itself, onto the ⊲-initial segment below g(μ), whose order type would then be μ, contradicting step 3.1; so δ⊆μ and ∣μ×μ∣=∣δ∣≤δ≤μ by [L1], while step 1.4 gives μ≤∣μ×μ∣.

step 3.1step 1.4L1L6L8
5.1

Apply [L7] to the well-order (κ∪{κ},∈) of [L8] and to S={μ∈κ∪{κ}:μ is not an infinite cardinal, or ∣μ×μ∣=μ}: a μ below which everything lies in S is in S, trivially if μ is not an infinite cardinal, by step 1.3 if μ=ω, and by step 4.1 otherwise; hence S=κ∪{κ}, so κ∈S and κ⊗κ=∣κ×κ∣=κ.

step 1.3step 4.1L7L8∎

Remarks

Why the maximum comes first. Under the plain lexicographic order of Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals α,β the sets α⊔β and α×β carry explicit well-orders, so their cardinalities exist in ZF, the initial segment below (1,0) in ω×ω is the whole of {0}×ω, which is already infinite; the order type of ω×ω is then ω⋅ω, far above ω. Ordering by the maximum first bounds every initial segment inside a square γ×γ with γ<κ, and the induction hypothesis then says that square is small. The whole proof is that one change of order.

No choice, and it is worth saying why. Every place that invites a selection avoids it: the ⊲-least element of a nonempty set is found by three successive minimisations, the order type of a well-order is unique, and the bijection γ≈∣γ∣ is used only through Disjoint union, cartesian product, function space and power set respect equinumerosity, and for ordinals α,β the sets α⊔β and α×β carry explicit well-orders, so their cardinalities exist in ZF, which quantifies over existing bijections rather than picking one for each γ at once.

What the theorem does not say. It is about cardinals, that is about well-orderable sets. "Every infinite set A satisfies A×A≈A" is a strictly stronger statement, and 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 shows it is equivalent to the Axiom of Choice. So Hessenberg's theorem is not a weaker version of Tarski's with a cheaper proof; it is the exact fragment that ZF proves.

Depends on

Used by

Dependency tree · two levels

71 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