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.
Support of a finite-type quasi-coherent sheaf is closed
Statement
Assume the Axiom of Choice, inherited from the construction of associated sheaves and from the stalk identification used below. Let be a scheme and let be a quasi-coherent -module of finite type (Finite type and finitely presented module sheaves), with support (Support of a module sheaf).
Then is a closed subset of . Moreover, if is an affine open with for a finitely generated -module , then the zero set of the annihilator ideal of ; in particular is closed in , and exactly when .
Facts & Assumptions
Given: The Axiom of Choice; a scheme ; a finite-type quasi-coherent -module .
The support is , and for an open one has (Support of a module sheaf).
For an affine scheme with associated sheaf one has for every prime (The stalk of an associated sheaf is the localisation).
If is a finitely generated -module, then (For a finite module, support is the set of primes containing the annihilator).
is of finite type: every point of has an affine open neighbourhood with for a finitely generated -module (Finite type and finitely presented module sheaves).
A subset is closed exactly when its complement is open, and openness of a subset can be checked on the members of any open cover: if every is open in for a cover by open sets, then is open in (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).
Proof
Proof technique: direct; compute the support on affine charts and use that closedness can be checked on an open cover.
Let be an affine open with for a finitely generated -module ; then by [F1] equals , which by [F2] is , and by [F3] this is , the zero set of an ideal and hence closed in .
Let be the family of all affine open subsets of with for a finitely generated module ; by [F4] every point of lies in such a chart, so this family covers , and it is the family of all such charts, determined without selecting anything.
For every chart of the cover of step 1.2 the intersection is closed in by step 1.1, so its complement is open in , and since the cover the complement is open in by [F5]; hence is closed in , as claimed.
The identification of the affine support with is step 1.1, and the Axiom of Choice is used only through [F2], inherited from the associated-sheaf construction, and through the supplier [F3]; the cover of step 1.2 is the family of all admissible charts, so no selection occurs there.
Depends on
- Support of a module sheaf
- Finite type and finitely presented module sheaves
- The stalk of an associated sheaf is the localisation
- For a finite module, support is the set of primes containing the annihilator
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- The Axiom of Choice
Used by
Dependency tree · two levels
22 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, Schemes, §§26.5, 26.7, 26.24 (standard reference, not scraped)
- Ravi Vakil, The Rising Sea, 29 August 2022, Chapters 6, 14, 17 (standard reference, not scraped)
- The Stacks Project, Cohomology of Schemes §30.9 (standard reference, not scraped)
- The Stacks Project, Properties of Schemes, §§28.20, 28.26 (standard reference, not scraped)