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.
, and , 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 and :
Each is an instance of absorption (Absorption: for cardinals with infinite and , , and when ). The countable ones are also obtained a second way, from a bijection that was available before cardinal arithmetic existed: (), together with two inclusions and no further input.
Facts & Assumptions
Given: ZF, with no choice principle. Write as in Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations.
For an infinite cardinal and a cardinal : , and when (Absorption: for cardinals with infinite and , , and when , Hessenberg: for every infinite cardinal , proved in ZF from the canonical well-order of ).
and are commutative and monotone; for cardinals iff ; and with both well-orderable gives (Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into ).
; is the least cardinal strictly above ; every aleph is an infinite cardinal and (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , For every set the Hartogs number is a cardinal, and for every cardinal it is the least cardinal strictly above ; this is a theorem of ZF, The clauses at , at a successor and at a limit determine exactly one operation , in ZF, and — assuming the Axiom of Choice — exactly one operation ; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and ).
Every natural number is a cardinal, is a cardinal, and a cardinal is infinite exactly when (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 in the finite sense equal to in the cardinal sense, Cardinal (initial ordinal) and cardinality, The natural numbers (von Neumann), is the least limit ordinal).
For a well-orderable set , is the least ordinal equinumerous with , , 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).
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
and are infinite cardinals with , and is a cardinal with , all by [L3], [L4] and [L7].
, by the definition of together with [L5] and [L6].
The map is an injection , because its image lies in with by [L4] and both coordinates are recovered from the image; and is an injection .
The inclusion holds because by [L7], and is an injection .
By [L1] and [L2]: and with ; with and ; and with and .
The countable values a second way: step 1.2 gives outright; step 1.3 with [L2] and [L6] gives , hence by [L7]; and step 1.4 with step 1.3 gives , hence .
All four values are as displayed, and the three countable ones agree by both routes.
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 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 has no second computation here. The countable cases are witnessed by explicit maps because is concrete. At 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 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. does have more elements than in the naive sense: it carries a tagged copy of and five further points. The equality 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 in the finite sense equal to in the cardinal sense.
Order does not matter here, and that is not automatic. is commutative, so and 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
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- Hessenberg: $\kappa \otimes \kappa = \kappa$ for every infinite cardinal $\kappa$, proved in ZF from the canonical well-order of $\kappa \times \kappa$
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- 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$
- The successor cardinal $\kappa^{+}$, the alephs $\aleph_\alpha$, the beths $\beth_\alpha$, successor and limit cardinals, and the identifications $\aleph_0 = \omega$ and $\aleph_1 = \omega_1$
- The clauses at $0$, at a successor and at a limit determine exactly one operation $\alpha \mapsto \aleph_\alpha$, in ZF, and — assuming the Axiom of Choice — exactly one operation $\alpha \mapsto \beth_\alpha$; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and $\alpha \le \aleph_\alpha$
- For every set $A$ the Hartogs number $\aleph(A)$ is a cardinal, and for every cardinal $\kappa$ it is the least cardinal strictly above $\kappa$; this is a theorem of ZF
- 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 $\lvert A \rvert$ in the finite sense equal to $\lvert A \rvert$ in the cardinal sense
- 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
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- Cardinal (initial ordinal) and cardinality
- Finite, countably infinite, countable, uncountable
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
- The natural numbers $\mathbb{N}$ (von Neumann)
- $\omega$ is the least limit ordinal
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
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
- Cardinal number — cardinal arithmetic (Wikipedia) (standard reference, not scraped)
- Aleph number (Wikipedia) (standard reference, not scraped)