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.
A singleton can have large rank and hereditary size
Example
For every infinite ordinal , the singleton has rank although it has exactly one element. Its root-inclusive closure contains every ordinal below . In particular when is an infinite initial ordinal, .
Facts & Assumptions
Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.
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: prop-transitive-closure-minimality, def-cardinal. (Hereditary size and H_kappa)
In ZF, for every ordinal , and . (Ranks of ordinals and hierarchy stages)
Verification
The ordinal-rank formula and membership-rank equation give . Its only element is , so its cardinality is one.
Starting from , transitive closure contains , then , and then all . If and this closure injected into , restriction would inject into , impossible for an initial ordinal: the image subset of has order type at most and is equinumerous with . Thus the defining witness for cannot exist.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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 cardinality example p.101; Shulman p.16 singleton example. (standard reference, not scraped)