Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

ℵ0⊕ℵ0=ℵ0⊗ℵ0=ℵ0, ℵ1⊕ℵ0=ℵ1 and 5⊕ℵ0=ℵ0, computed from absorption and, in the countable cases, independently from the published bijection ω×ω≈ω

Example

Work in ZF; no choice principle is used anywhere below. With ⊕ and ⊗ as in Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations and the alephs as in The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1:

ℵ0⊕ℵ0=ℵ0,ℵ0⊗ℵ0=ℵ0,ℵ1⊕ℵ0=ℵ1,5⊕ℵ0=ℵ0.

Each is an instance of absorption (Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0). The countable ones are also obtained a second way, from a bijection that was available before cardinal arithmetic existed: ω×ω≈ω (N×N≈N), together with two inclusions and no further input.

Facts & Assumptions

Given: ZF, with no choice principle. Write κ⊔λ=({0}×κ)∪({1}×λ) as in Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations.

[L2]

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

[L6]

For a well-orderable set X, ∣X∣ is the least ordinal equinumerous with X, X≈∣X∣, and equinumerous sets receive the same one (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).

[L7]

Ordinals: trichotomy; α⊆β iff α∈β or α=β; α⊆β⊆α forces α=β; a subset inclusion is an injection (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Injection, surjection, bijection).

Verification

technique · direct
1.1

ℵ0=ω and ℵ1 are infinite cardinals with ℵ0≤ℵ1, and 5∈ω is a cardinal with 0≠5≤ℵ0, all by [L3], [L4] and [L7].

L3L4L7
1.2

ℵ0⊗ℵ0=∣ω×ω∣=∣ω∣=ω, by the definition of ⊗ together with [L5] and [L6].

L5L6
1.3

The map (i,ξ)↦(ξ,i) is an injection ω⊔ω→ω×ω, because its image lies in ω×2 with 2∈ω by [L4] and both coordinates are recovered from the image; and ξ↦(0,ξ) is an injection ω→ω⊔ω.

L4L7
1.4

The inclusion 5⊔ω⊆ω⊔ω holds because 5⊆ω by [L7], and n↦(1,n) is an injection ω→5⊔ω.

L4L7
2.1

By [L1] and [L2]: ℵ0⊕ℵ0=ℵ0 and ℵ0⊗ℵ0=ℵ0 with ν=ρ=ℵ0; ℵ1⊕ℵ0=ℵ1 with ν=ℵ1 and ρ=ℵ0; and 5⊕ℵ0=ℵ0⊕5=ℵ0 with ν=ℵ0 and ρ=5.

step 1.1L1L2
2.2

The countable values a second way: step 1.2 gives ℵ0⊗ℵ0=ℵ0 outright; step 1.3 with [L2] and [L6] gives ℵ0≤ℵ0⊕ℵ0≤ℵ0⊗ℵ0=ℵ0, hence ℵ0⊕ℵ0=ℵ0 by [L7]; and step 1.4 with step 1.3 gives ℵ0≤5⊕ℵ0≤ℵ0⊕ℵ0=ℵ0, hence 5⊕ℵ0=ℵ0.

step 1.2step 1.3step 1.4L2L6L7
3.1

All four values are as displayed, and the three countable ones agree by both routes.

step 2.1step 2.2∎

Remarks

What absorption replaces. Step 2.2 is what a reader would have had to do before Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0 existed: produce a bijection or a pair of injections for each computation separately. Step 2.1 does all four in one line, and the content of the corollary is exactly that the bookkeeping is unnecessary.

Why ℵ1⊕ℵ0=ℵ1 has no second computation here. The countable cases are witnessed by explicit maps because ω is concrete. At ℵ1 no comparable explicit bijection is written down here; the computation goes through Hessenberg: κ⊗κ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ, which Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0 packages. That is not a gap in this example but the reason the general theorem is worth proving.

The finite summand does not vanish for a trivial reason. 5⊔ω does have more elements than ω in the naive sense: it carries a tagged copy of ω and five further points. The equality 5⊕ℵ0=ℵ0 says only that the two sets are equinumerous, and what makes that true is that an infinite well-ordered set absorbs finitely many extra points, the same shift that makes an infinite cardinal a limit ordinal in Every natural number and ω are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with ∣A∣ in the finite sense equal to ∣A∣ in the cardinal sense.

Order does not matter here, and that is not automatic. ⊕ is commutative, so 5⊕ℵ0 and ℵ0⊕5 are the same cardinal. The ordinal + on the very same objects is not commutative, which is precisely why Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations gives the cardinal operation its own symbol rather than reusing +.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

79 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