Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription) rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

00=00=0\aleph_0 \oplus \aleph_0 = \aleph_0 \otimes \aleph_0 = \aleph_0, 10=1\aleph_1 \oplus \aleph_0 = \aleph_1 and 50=05 \oplus \aleph_0 = \aleph_0, computed from absorption and, in the countable cases, independently from the published bijection ω×ωω\omega \times \omega \approx \omega

Example

Work in ZF; no choice principle is used anywhere below. With \oplus and \otimes as in Cardinal sum κλ\kappa \oplus \lambda, product κλ\kappa \otimes \lambda and exponentiation κλ\kappa^{\lambda}, and why they are written apart from the ordinal operations and the alephs as in The successor cardinal κ+\kappa^{+}, the alephs α\aleph_\alpha, the beths α\beth_\alpha, successor and limit cardinals, and the identifications 0=ω\aleph_0 = \omega and 1=ω1\aleph_1 = \omega_1:

00=0,00=0,10=1,50=0.\aleph_0 \oplus \aleph_0 = \aleph_0, \qquad \aleph_0 \otimes \aleph_0 = \aleph_0, \qquad \aleph_1 \oplus \aleph_0 = \aleph_1, \qquad 5 \oplus \aleph_0 = \aleph_0 .

Each is an instance of absorption (Absorption: for cardinals κ,λ\kappa, \lambda with κ\kappa infinite and λκ\lambda \le \kappa, κλ=κ\kappa \oplus \lambda = \kappa, and κλ=κ\kappa \otimes \lambda = \kappa when λ0\lambda \ne 0). The countable ones are also obtained a second way, from a bijection that was available before cardinal arithmetic existed: ω×ωω\omega \times \omega \approx \omega (N×NN\mathbb{N} \times \mathbb{N} \approx \mathbb{N}), together with two inclusions and no further input.

Facts & Assumptions

Given: ZF, with no choice principle. Write κλ=({0}×κ)({1}×λ)\kappa \sqcup \lambda = (\{0\} \times \kappa) \cup (\{1\} \times \lambda) as in Cardinal sum κλ\kappa \oplus \lambda, product κλ\kappa \otimes \lambda and exponentiation κλ\kappa^{\lambda}, and why they are written apart from the ordinal operations.

[L2]

\oplus and \otimes are commutative and monotone; for cardinals κλ\kappa \le \lambda iff κλ\kappa \preceq \lambda; and ABA \preceq B with both well-orderable gives AB\lvert A\rvert \le \lvert B\rvert (Commutativity, associativity, distributivity and monotonicity of \oplus and \otimes, the unit laws, the two exponent laws, and κλ\kappa \le \lambda if and only if κ\kappa injects into λ\lambda).

[L6]

For a well-orderable set XX, X\lvert X\rvert is the least ordinal equinumerous with XX, XXX \approx \lvert X\rvert, 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; αβ\alpha \subseteq \beta iff αβ\alpha \in \beta or α=β\alpha = \beta; αβα\alpha \subseteq \beta \subseteq \alpha forces α=β\alpha = \beta; 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=ω\aleph_0 = \omega and 1\aleph_1 are infinite cardinals with 01\aleph_0 \le \aleph_1, and 5ω5 \in \omega is a cardinal with 0500 \ne 5 \le \aleph_0, all by [L3], [L4] and [L7].

L3L4L7
1.2

00=ω×ω=ω=ω\aleph_0 \otimes \aleph_0 = \lvert \omega \times \omega\rvert = \lvert \omega\rvert = \omega, by the definition of \otimes together with [L5] and [L6].

L5L6
1.3

The map (i,ξ)(ξ,i)(i,\xi) \mapsto (\xi,i) is an injection ωωω×ω\omega \sqcup \omega \to \omega \times \omega, because its image lies in ω×2\omega \times 2 with 2ω2 \in \omega by [L4] and both coordinates are recovered from the image; and ξ(0,ξ)\xi \mapsto (0,\xi) is an injection ωωω\omega \to \omega \sqcup \omega.

L4L7
1.4

The inclusion 5ωωω5 \sqcup \omega \subseteq \omega \sqcup \omega holds because 5ω5 \subseteq \omega by [L7], and n(1,n)n \mapsto (1,n) is an injection ω5ω\omega \to 5 \sqcup \omega.

L4L7
2.1

By [L1] and [L2]: 00=0\aleph_0 \oplus \aleph_0 = \aleph_0 and 00=0\aleph_0 \otimes \aleph_0 = \aleph_0 with ν=ρ=0\nu = \rho = \aleph_0; 10=1\aleph_1 \oplus \aleph_0 = \aleph_1 with ν=1\nu = \aleph_1 and ρ=0\rho = \aleph_0; and 50=05=05 \oplus \aleph_0 = \aleph_0 \oplus 5 = \aleph_0 with ν=0\nu = \aleph_0 and ρ=5\rho = 5.

step 1.1L1L2
2.2

The countable values a second way: step 1.2 gives 00=0\aleph_0 \otimes \aleph_0 = \aleph_0 outright; step 1.3 with [L2] and [L6] gives 00000=0\aleph_0 \le \aleph_0 \oplus \aleph_0 \le \aleph_0 \otimes \aleph_0 = \aleph_0, hence 00=0\aleph_0 \oplus \aleph_0 = \aleph_0 by [L7]; and step 1.4 with step 1.3 gives 05000=0\aleph_0 \le 5 \oplus \aleph_0 \le \aleph_0 \oplus \aleph_0 = \aleph_0, hence 50=05 \oplus \aleph_0 = \aleph_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 κ,λ\kappa, \lambda with κ\kappa infinite and λκ\lambda \le \kappa, κλ=κ\kappa \oplus \lambda = \kappa, and κλ=κ\kappa \otimes \lambda = \kappa when λ0\lambda \ne 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 10=1\aleph_1 \oplus \aleph_0 = \aleph_1 has no second computation here. The countable cases are witnessed by explicit maps because ω\omega is concrete. At 1\aleph_1 no comparable explicit bijection is written down here; the computation goes through Hessenberg: κκ=κ\kappa \otimes \kappa = \kappa for every infinite cardinal κ\kappa, proved in ZF from the canonical well-order of κ×κ\kappa \times \kappa, which Absorption: for cardinals κ,λ\kappa, \lambda with κ\kappa infinite and λκ\lambda \le \kappa, κλ=κ\kappa \oplus \lambda = \kappa, and κλ=κ\kappa \otimes \lambda = \kappa when λ0\lambda \ne 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ω5 \sqcup \omega does have more elements than ω\omega in the naive sense: it carries a tagged copy of ω\omega and five further points. The equality 50=05 \oplus \aleph_0 = \aleph_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 ω\omega 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\lvert A \rvert in the finite sense equal to A\lvert A \rvert in the cardinal sense.

Order does not matter here, and that is not automatic. \oplus is commutative, so 505 \oplus \aleph_0 and 05\aleph_0 \oplus 5 are the same cardinal. The ordinal ++ on the very same objects is not commutative, which is precisely why Cardinal sum κλ\kappa \oplus \lambda, product κλ\kappa \otimes \lambda and exponentiation κλ\kappa^{\lambda}, 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 121 results over 38 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources