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 ideal of a polynomial graph
Example
Let be a field, , and let be given by polynomials . Its graph is the closed subscheme of with ideal
Facts & Assumptions
Given: The objects, hypotheses and conventions in the statement above.
For an -morphism (as in def-scheme-over-base), the graph morphism is , supplied by thm-fibre-products-of-schemes-exist. Its first projection is the identity and its second projection is . The definition alone does not assert that its image is closed. (The graph morphism over a base)
For an -morphism , put . The square with top arrow , bottom arrow , left arrow , and right arrow is Cartesian. (The graph is a pullback of the diagonal)
For a ring , closed immersions are, up to unique isomorphism over , precisely the morphisms for ideals . (Closed immersions into affine schemes are quotient spectra)
Let be a unital ring map. For any set of variables and any ideal , Here the extended ideal is generated by the coefficient images of all elements of . For a multiplicative subset , These are ring isomorphisms; no flatness, finite-generation or nonzero-ring hypothesis is required. (Presentations and localization under base extension)
Verification
By F1 the graph has coordinate map sending to and to . This is a surjection to . In the quotient by the displayed ideal, successive substitution replaces every by , giving inverse ring maps with . Thus the displayed ideal is exactly the kernel; F3 makes the morphism a closed immersion.
The diagonal in has ideal by the same substitution calculation. Pulling it back along sends those generators to . By F2 this pullback is the graph; F4 computes its quotient ideal and gives the identical presentation. If the list is empty and the graph is the identity; if it is the point given by the constants .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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
- Affine specialization of Vakil 11.1.17–18 (standard reference, not scraped)