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.
Classical affine algebraic sets, including the empty boundaries
Definition
Fix an algebraically closed field and . Write for the iterated polynomial ring of Polynomial rings in finitely many commuting indeterminates by iteration. Algebraic closure has the meaning of An algebraically closed field: every nonconstant polynomial has a root in the field. For any , define An affine algebraic set is any such subset, including the empty set. Here and when . With the abbreviations and , one has and : an empty list of equations imposes no condition, whereas . Evaluation, as in Evaluation and roots of a polynomial in a commutative target ring, is performed successively in the finitely many variables.
Sources
Source comparison: Milne, Algebraic Geometry, v6.10, §2a, pp. 36–37. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.
Depends on
Used by
- The associated graded variety of a two-sided ideal Definition
- The classical vanishing ideal Definition
- A classical zero locus depends only on the generated ideal and its radical Lemma
- Zero loci and vanishing ideals form a Galois connection Lemma
- The associated variety is a closed conical coadjoint-invariant cone Proposition
- Classical affine zero loci form the Zariski closed sets Theorem
Dependency tree · two levels
8 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, §2a, pp. 36–37 (standard reference, not scraped)