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.
Hereditary size and H_kappa
Definition
Let be an infinite initial ordinal. In ZF set
This initially defines a class. Its root-inclusive transitive closure contains as an element. When is well-orderable its hereditary cardinality means the least ordinal equinumerous with it; under Choice this exists for every set. The injection formulation above is used without Choice.
For infinite , replacing by gives the same class. Indeed by the finite-stage formula. Adding one point to a set injecting into finite gives an injection into ; for infinite , keep indices at least , shift natural indices by one, and use index zero for the added point, obtaining an injection into . Restriction gives the converse. We retain the root-inclusive convention throughout.
Conventions and prerequisites: Minimality and closure laws of TC, Cardinal (initial ordinal) and cardinality.
Depends on
Used by
Dependency tree · two levels
13 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
- Weiss, An Introduction to Set Theory (2014) — chapter 10 pp.100–101 (explicit choice-free adaptation). (standard reference, not scraped)