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.
Regular functions on a classical affine variety form a sheaf
Statement
Let be a classical affine variety. The assignment from Zariski-open subsets of to rings of regular functions is a sheaf of -algebras on .
Facts & Assumptions
Given: A classical affine variety , an open subset , and an open cover .
A function on an open subset is regular exactly when each point has a neighbourhood on which the function is a quotient of elements of with nowhere zero there (Regular functions on open subsets of a classical affine variety).
Proof
If and is open, then every point of has an open neighbourhood on which [L1] gives a quotient formula . Then is an open neighbourhood of that point inside , the denominator is still nowhere zero there, and on . Hence restriction maps are well defined.
If and for every , then for each some contains , so . Therefore on . This is the uniqueness clause.
Suppose for each we are given , and suppose on for all . Define by whenever . This is well defined by the overlap hypothesis.
Fix . Choose with . Since is regular on , [L1] gives an open neighbourhood of and elements with nowhere zero on and on . On that same neighbourhood, the glued function equals , so on . By [L1], is regular at .
Step 1.1 gives restriction, step 1.2 gives uniqueness of gluing, and steps 1.3 and 2.1 give existence of gluing. Therefore is a sheaf of -algebras on .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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, Proposition 3.9 (standard reference, not scraped)
- Michael Artin, Notes for a Course in Algebraic Geometry, 2.5 (standard reference, not scraped)