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.
Zero loci and vanishing ideals form a Galois connection
Statement
For and an ideal , iff . Both and reverse inclusion. Moreover in the Zariski topology, and .
Facts & Assumptions
Given: An algebraically closed field , a subset , and an ideal .
Zero loci use a universal condition on equations (Classical affine algebraic sets, including the empty boundaries).
Vanishing ideals use a universal condition on points (The classical vanishing ideal).
Every closed zero locus can be defined by an ideal (A classical zero locus depends only on the generated ideal and its radical).
Zero loci are exactly the Zariski closed sets (Classical affine zero loci form the Zariski closed sets).
Proof
says that for every and every , . Interchanging these two universal quantifiers says precisely . Enlarging imposes more conditions on ; enlarging imposes more equations on . This proves both reversals.
Every point of lies in . If a closed set contains , step 1.1 gives and therefore . Thus is the smallest closed set containing . Applying this to the already closed set gives the last identity.
Sources
Source comparison: Milne, Algebraic Geometry, v6.10, Proposition 2.10 pp. 38–39, Proposition 2.14 p. 41, and Remark 2.23 p. 44. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.
Depends on
Used by
Dependency tree · two levels
11 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
- J. S. Milne, Algebraic Geometry v6.10, Proposition 2.10 pp. 38–39, Proposition 2.14 p. 41, and Remark 2.23 p. 44 (standard reference, not scraped)