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.
Constructible subsets of a scheme
Definition
Let be a topological space, for instance the underlying space of a scheme (Quasi-compact and quasi-separated schemes). An open subset is retrocompact if for every quasi-compact open subset the intersection is quasi-compact as a topological space. A subset is constructible if it is a finite union of subsets of the form with retrocompact open. By convention the empty union is allowed, so is constructible, and every retrocompact open is constructible, by taking .
A subset of a scheme is called constructible when it is constructible in the underlying topological space. Since a morphism of schemes is continuous, the preimage of a constructible subset is constructible whenever the preimages of retrocompact opens are retrocompact; this is checked where it is used and is not part of the definition.
For an affine scheme (The underlying space of an affine spectrum) the notation for a basic open and for a vanishing set is available, and there the retrocompact opens are exactly the quasi-compact opens: the space is quasi-compact, so a retrocompact open is quasi-compact; conversely a quasi-compact open is a finite union of basic opens, and basic opens are spectra of rings and hence quasi-compact, so intersections of quasi-compact opens are finite unions of basic opens and quasi-compact. A subset of is therefore constructible exactly when it is a finite union of sets ; the description by finitely many is the one used in the constructibility results on this page.
Depends on
Used by
Dependency tree · two levels
8 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
- The Stacks Project, Topology, Section 5.15 (tags 0059, 04ZC) and Morphisms of Schemes, Section 29.23 (standard reference, not scraped)
- The Stacks Project, Commutative Algebra, Section 10.29 (standard reference, not scraped)