Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

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

Definition

Let κ and λ be cardinals (Cardinal (initial ordinal) and cardinality), and recall the notation 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:

κ⊔λ=({0}×κ)∪({1}×λ),λκ={ h:h is a function λ→κ }.

Sum and product.

κ⊕λ  :=  ∣κ⊔λ∣,κ⊗λ  :=  ∣κ×λ∣.

Both values exist in ZF and are cardinals: claim (c) 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 well-orders each of the two sets explicitly, and 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 then supplies the least equinumerous ordinal. No choice principle is used.

Exponentiation.

κλ  :=  ∣λκ∣,

the number of functions from a set of size λ to a set of size κ. The right-hand side is defined exactly when λκ is well-orderable. Assuming the Axiom of Choice (The Axiom of Choice) every set is well-orderable (The well-ordering theorem) and κλ is defined for all cardinals; every statement on this page that writes κλ for an infinite exponent says so in its own hypotheses.

Transport to arbitrary sets. If A and B are well-orderable with ∣A∣=κ and ∣B∣=λ, then

∣A⊔B∣=κ⊕λ,∣A×B∣=κ⊗λ,∣BA∣=κλ

whenever the sets on the left have cardinalities at all, because A≈κ and B≈λ (Equinumerous sets, A≈B and A⪯B) and the three constructions respect ≈ (claim (a) 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, Injection, surjection, bijection). So the operations may be computed from any representatives.

Finite and infinite cardinals. A cardinal κ is finite when κ∈ω and infinite when ω⊆κ, that is ω≤κ; by trichotomy (Trichotomy and well-ordering of the ordinals) and ω is the least limit ordinal every cardinal is exactly one of the two.

Remarks

The symbols ⊕ and ⊗ are not decoration. Ordinal addition and ordinal multiplication (Ordinal addition α+β, Ordinal multiplication α⋅β) are defined on the same objects — cardinals are ordinals — and give different values. With ω read as a cardinal, ω⊕ω=ω, whereas the ordinal sum ω+ω is strictly larger than ω; and ω⊗ω=ω, whereas the ordinal product ω⋅ω is larger still. Writing both operations with + and ⋅ would make every equation on this page ambiguous, so the cardinal operations get their own symbols and the plain + and ⋅ on this page always mean the ordinal ones.

Exponentiation keeps the symbol, under a hard rule. There is no comparably readable alternative to κλ, and Ordinal αβ and cardinal κλ are different operations that share one notation already records that αβ is used for two different operations: as ordinals 2ω=ω, while the cardinal 2ω counts the functions ω→{0,1} and is uncountable. The rule adopted here, and followed on this page and its companion, is:

In an exponential, the base and the exponent are always alephs, letters or expressions denoting cardinals — κ, λ, μ, c, cf⁡(κ), ∣A∣ — or a natural number read as a cardinal; never ω, never ω1, and never a letter denoting an ordinal, such as α,β,γ,ξ,η.

So 2ℵ0, κλ and ℵ1ℵ0 are cardinal exponentials, and an expression such as ωω or αβ is never written here at all. Where a value has to be named in both readings, the two are given different letters.

What is being counted, in each case. κ⊕λ is the size of two disjoint blocks laid side by side; the tagging in ⊔ is what makes "disjoint" true even though one of κ and λ is always a subset of the other, so their intersection is the smaller of the two. κ⊗λ is the size of a rectangle. κλ is the number of ways to choose a value in κ for each of λ positions, independently. None of the three is sensitive to the order in which the elements are arranged, which is exactly what distinguishes them from the ordinal operations (Ordinal exponentiation αβ, with the conventions α0=1 and 00=1 included), whose values depend on the arrangement.

The zero and one cases are not special. 0=∅ and 1={0} are cardinals (Ordinal (von Neumann)), and the definitions apply to them unchanged: κ⊔0={0}×κ, κ×0=∅, and 0κ={∅} has exactly one element, the empty function. The resulting unit laws are proved rather than stipulated, in Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ.

Depends on

Used by

…and 3 more results.

Dependency tree · two levels

51 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