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.
Closed graphs over separated targets
Statement
Let be an -morphism of schemes and suppose that is separated. Then the graph is a closed immersion. No separatedness hypothesis on is required.
Facts & Assumptions
Given: An -morphism with separated, and the graph .
The graph morphism is , supplied by Existence of all scheme fibre products; its first projection is the identity and its second projection is . (The graph morphism over a base)
With , the square with top arrow , bottom arrow , left arrow and right arrow is Cartesian; thus is the base change of along . (The graph is a pullback of the diagonal)
A morphism is separated when is a closed immersion. (Separated morphism of schemes)
Closed immersions remain closed immersions after arbitrary base change; this is asserted with no flatness or finiteness hypothesis. (Base change of immersions)
Proof
By [F1] the graph is the morphism , and [F2] exhibits it as the base change of along , the square in [F2] being Cartesian.
Since is separated, [F3] says that is a closed immersion.
The base change of the closed immersion along is a closed immersion by [F4]; by step 1.1 that base change is , so is a closed immersion.
The argument used only the separatedness of and the Cartesian square of [F2]; nothing was assumed about , which may even be nonseparated.
Depends on
Used by
Dependency tree · two levels
17 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, Lemma 26.21.10, printed p.41 (standard reference, not scraped)
- Vakil, The Rising Sea, Section 11.3.6, printed p.309 (standard reference, not scraped)