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.
Grothendieck universe closure convention
Definition
A Grothendieck universe, in the closure convention used here, is a nonempty transitive set such that: if then ; if then ; and if and is any set function on with for every , then . The indexing function need not itself belong to .
The additional condition is imposed only when explicitly stated. This is a definition by closure conditions, not an assertion that a universe containing any prescribed set exists. Transitivity means that every member of a member of is itself a member of .
Conventions and prerequisites: Minimality and closure laws of TC.
Depends on
Used by
Dependency tree · two levels
2 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 p.102; Shulman p.16. (standard reference, not scraped)