Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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 U of an affine variety X and an open cover U=⋃iUi, compatible morphisms ϕi:Ui→Y to a fixed affine target glue uniquely to a morphism ϕ:U→Y.

Facts & Assumptions

Given: An affine variety X over algebraically closed k, an open cover U=⋃iUi of an open U⊆X, an affine target Y, and morphisms ϕi:Ui→Y agreeing on every overlap.

[F1]

Compatible regular functions on a cover glue uniquely (Classical regular functions satisfy locality and unique gluing).

[F2]

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

technique · direct
1.1given

Compatibility means ϕi(x)=ϕj(x) for every point of each overlap. Thus the union of their graphs is a function ϕ:U→Y restricting to each ϕi. 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.

2.1F1F2step 1.1∎

If s∈OY(Y), the functions s∘ϕi are regular by F2 and agree on overlaps. F1 makes their glued function regular, and pointwise it is s∘ϕ. 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