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.
Compatible classical morphisms to an affine target glue over an open cover
Statement
For an open of an affine variety X and an open cover , compatible morphisms to a fixed affine target glue uniquely to a morphism .
Facts & Assumptions
Given: An affine variety over algebraically closed , an open cover of an open , an affine target , and morphisms agreeing on every overlap.
Compatible regular functions on a cover glue uniquely (Classical regular functions satisfy locality and unique gluing).
A set map to an affine target is a morphism when global regular functions pull back regularly (A morphism from an open subset of a classical affine variety to an affine variety).
Proof
Compatibility means for every point of each overlap. Thus the union of their graphs is a function restricting to each . Every value is in Y because it is the value of a local map into Y. For empty U and the empty cover this is the empty graph.
If , the functions are regular by F2 and agree on overlaps. F1 makes their glued function regular, and pointwise it is . Hence F2 makes a morphism. Any map with the required restrictions equals the same graph union, proving uniqueness.
Sources
Source comparison: Milne, Algebraic Geometry, v6.10, Proposition 3.9 p. 61 and §5d pp. 103–104. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.
Depends on
Used by
Dependency tree · two levels
5 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 3.9 p. 61 and §5d pp. 103–104 (standard reference, not scraped)