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.
The cumulative hierarchy
Definition
In ZF without Foundation define the cumulative hierarchy by
For each ordinal , use the set well-order recursion schema on . On histories of domain return ; on domain return the power set of the last value; on nonzero limit domains return the union of the range. Each is a unique set. Recursions on different ordinal intervals agree on overlaps by the uniqueness clause applied to the smaller interval. Hence the definition of as the value at is uniform and independent of the chosen interval. Power Set is used at successors and Replacement and Union at limits. The notation denotes a definable class function, not a set sequence.
Conventions and prerequisites: Transfinite recursion, Basic closure properties of ordinals, Successor and limit ordinals.
Depends on
Used by
- A bounded hierarchy for the multiple-choice argument Lemma
- Hₒmega equals Vₒmega Proposition
- Transitivity and growth of hierarchy stages Proposition
Dependency tree · two levels
9 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
- Marks, Set Theory, Berkeley edition — 7.1 p.34. (standard reference, not scraped)