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.
The graph of a polynomial map as a closed subscheme
Example
Let be a field, let , and let be given by polynomials . Then the graph is a closed immersion, and after identifying its ideal is Moreover the first projection restricts to an isomorphism with inverse , so the graph is a closed subscheme isomorphic to the source through .
Facts & Assumptions
Given: A field , integers , the affine spaces and over , and the morphism with coordinate polynomials .
For an -morphism the graph morphism is the -morphism ; its composites with the two projections are and , and the definition alone does not assert that its image is closed. (The graph morphism over a base)
If is separated and is an -morphism, then is a closed immersion. (Closed graphs over separated targets)
Every affine morphism is separated. (Affine morphisms are separated)
For ring maps , one has , with projections and . (Affine fibre products are spectra of tensor products)
For a ring , closed immersions are, up to unique isomorphism over , precisely the morphisms for ideals . (Closed immersions into affine schemes are quotient spectra)
Verification
The structure morphism is affine, hence separated by [F3], so [F2] applies to the -morphism and the graph is a closed immersion. By [F4] the product is , with acting as and as .
Under the identification of step 1.1 the morphism corresponds to the -algebra map with and .
The map is surjective and its kernel is the ideal : clearly , and conversely if then writing as a polynomial in the variables with coefficients in gives modulo , so .
By [F5] the closed subscheme with ideal is, up to unique isomorphism over the product, the image of , so the graph is the closed subscheme of with the displayed ideal.
By [F1] the composite is the identity of , so the first projection restricts to a morphism with inverse ; hence is an isomorphism. In coordinate rings this is the isomorphism inverse to .
The degenerate cases are included: for the list of equations is empty, , and the graph is the identity of ; for the source is a single -rational point and the graph is the closed point cut out by .
Steps 1.1, 4.1 and 4.2 show that is a closed subscheme of with ideal whose first projection is an isomorphism onto , which is the assertion.
Remarks
The fibre-product page already records the calculation of this ideal, with the roles of the two factors exchanged, as The ideal of a polynomial graph. The present item adds the identification of the abstract graph morphism of The graph morphism over a base with that closed subscheme and the statement that the first projection restricts to an isomorphism; no separate computation is needed for the ideal itself.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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.42 (standard reference, not scraped)
- Ravi Vakil, The Rising Sea, Proposition 11.3.6, printed p.309 (standard reference, not scraped)