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.
Principal opens form a basis for the Zariski topology on an affine variety
Statement
Let be a classical affine variety over an algebraically closed field . Then the principal opens form a basis for the Zariski topology on . In particular, for all .
Facts & Assumptions
Given: A classical affine variety over an algebraically closed field .
For , the principal open is (A principal open subset of a classical affine variety).
Closed subsets of affine space are zero loci of sets of polynomials (Zero loci in affine space are the closed sets of the classical Zariski topology).
Proof
For any , the set is open because it is the complement in of the closed subset where vanishes. Also a point lies in exactly when both and are nonzero there, equivalently when is nonzero there. Thus .
Let be Zariski-open and . Then is closed in , so there is a set of polynomials on the ambient affine space with by [L2]. Since , choose with . Then . Hence every open set is a union of principal opens.
Steps 1.1 and 1.2 are exactly the basis criterion.
Depends on
Used by
- The rational map (x,y) mapsto y / x on the affine plane is undefined along x = 0 Counterexample
- The rational-map equivalence relation is transitive Lemma
- Regular functions on a principal open are the principal localization of the coordinate ring Theorem
- The local ring at a point of an affine variety is the localization at its maximal ideal Theorem
Dependency tree · two levels
6 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, Chapter 3c (standard reference, not scraped)
- Donu Arapura, Notes on Basic Algebraic Geometry, §1.3 and localization discussion (standard reference, not scraped)