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.
Scheme-theoretic image of a quasi-compact morphism
Statement
Let be a quasi-compact morphism of schemes and put . Then is a quasi-coherent ideal sheaf, and the closed subscheme is the scheme-theoretic image of . For every open , its restriction is the scheme-theoretic image of .
Facts & Assumptions
Given: A quasi-compact morphism .
A morphism is quasi-compact when inverse images of quasi-compact opens are quasi-compact Quasi-compact and quasi-separated morphisms.
For a scheme, quasi-coherent ideal sheaves and closed subschemes are in mutually inverse correspondence Quasi-coherent ideals and closed subschemes.
Proof
Let be an affine open of . By [F1], is quasi-compact, so its affine-open cover has a finite subcover ; when is empty, take the finite empty cover.
Write . The sheaf condition makes inject into , so the kernel of equals the kernel of . The latter is an ideal of , and its localizations give the corresponding kernels on principal opens of .
Thus is the ideal sheaf associated to on every affine , so is quasi-coherent.
By [F2], defines a closed subscheme . On each affine , the map factors through , so factors through it. If a closed subscheme defined on by also receives , then ; hence factors through that competing closed subscheme. This proves minimality.
Repeating the kernel computation on an open gives the restriction of to . The correspondence in [F2] therefore identifies with the scheme-theoretic image of .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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, Morphisms of Schemes, Lemma 29.6.3 (standard reference, not scraped)