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

Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0

Statement

Let κ be an infinite cardinal and λ a cardinal with λ≤κ (Cardinal (initial ordinal) and cardinality). Then

κ⊕λ=κ,andκ⊗λ=κ  whenever λ≠0

(Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations). The exception at λ=0 is not an artefact: κ⊗0=0.

This is a theorem of ZF, inherited from Hessenberg: κ⊗κ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ, which is choice free. In particular the ordinary arithmetic of infinite cardinals collapses completely for ⊕ and ⊗: below the level of exponentiation, the larger argument simply swallows the smaller one.

Facts & Assumptions

Given: An infinite cardinal κ and a cardinal λ≤κ, in ZF.

[L2]

κ⊕λ=∣κ⊔λ∣ and κ⊗λ=∣κ×λ∣, with κ⊔λ=({0}×κ)∪({1}×λ) (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations).

[L3]

For cardinals, κ≤λ iff κ⪯λ; A⪯B with both well-orderable gives ∣A∣≤∣B∣; the unit laws κ⊗1=κ and κ⊗0=0 hold; and ⊕, ⊗ are monotone in each argument (claims (a), (d), (e) of Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ).

[L4]

For a well-orderable set X, ∣X∣ is the least ordinal equinumerous with 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).

[L6]

Ordinals are comparable, α⊆β iff α∈β or α=β, trichotomy holds, and α⊆β⊆α forces α=β (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals).

[L7]

A subset inclusion is an injection and a bijection witnesses ≈ (Injection, surjection, bijection, Equinumerous sets, A≈B and A⪯B).

Proof

technique · direct
1.1

The map ξ↦(0,ξ) is an injection κ→κ⊔λ, so κ≤κ⊕λ by [L2], [L3] and [L4].

L2L3L4L7
1.2

The map (i,ξ)↦(ξ,i) is an injection κ⊔κ→κ×κ, since its image lies in κ×2 and 2∈ω⊆κ by [L5], and it is injective because both coordinates are recovered from the image.

L5L7
1.3

From λ≤κ and monotonicity, κ⊕λ≤κ⊕κ and κ⊗λ≤κ⊗κ.

L3
1.4

If λ≠0 then 1≤λ by [L6] and [L5], so κ=κ⊗1≤κ⊗λ by the unit law and monotonicity in [L3].

L3L5L6
2.1

κ⊕κ≤κ: step 1.2 with [L3] gives ∣κ⊔κ∣≤∣κ×κ∣, which by [L2] and [L1] is κ⊗κ=κ.

step 1.2L1L2L3
3.1

Combining: κ≤κ⊕λ≤κ⊕κ≤κ gives κ⊕λ=κ by [L6]; and for λ≠0, κ≤κ⊗λ≤κ⊗κ=κ gives κ⊗λ=κ, while κ⊗0=0 by [L3].

step 1.1step 1.3step 1.4step 2.1L1L3L6∎

Remarks

What absorption costs. Nothing beyond Hessenberg: κ⊗κ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ: the only extra input is the injection of step 1.2, which folds two copies of κ into a rectangle of width 2. So absorption is choice free wherever Hessenberg's theorem is, that is, for cardinals.

Why the hypothesis is λ≤κ and not λ<κ. The case λ=κ is the interesting one and is used constantly: κ⊕κ=κ and κ⊗κ=κ. Stating the corollary with ≤ avoids a separate appeal to Hessenberg's theorem at every later use.

Absorption destroys cancellation. From κ⊕λ=κ for every λ≤κ it follows at once that ⊕ cannot be cancellative on infinite cardinals, and the companion false statement FALSE: κ⊕μ=λ⊕μ implies κ=λ records exactly that. The same collapse does not reach exponentiation: assuming the Axiom of Choice, Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ gives a strict increase at every cardinal.

Depends on

Used by

…and 8 more results.

Dependency tree · two levels

52 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