Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Gluing affine schemes along compatible open isomorphisms

Statement

Affine schemes equipped with open subschemes and isomorphisms on overlaps satisfying the identity and cocycle conditions glue to a scheme, uniquely up to unique isomorphism; the given affine schemes become an open affine cover.

Facts & Assumptions

Given: Affine schemes, open overlap subschemes, and compatible cocycle isomorphisms.

Proof

technique · direct
1.1givenconstruct

The data are gluing data for locally ringed spaces, so the gluing theorem produces a locally ringed space X covered by open subspaces identified with the given affine schemes.

2.1step 1.1

Since every point of X lies in one of those affine open subspaces, X is a scheme by definition.

3.1step 1.1step 2.1∎

Let X′ be another gluing with the same chart identifications. On every affine chart, compose the identification into X with the inverse of the corresponding identification into X′. The cocycle condition says these chartwise locally ringed-space isomorphisms agree on overlaps, so their underlying maps and sheaf maps glue to an isomorphism X→X′. The inverse is obtained by reversing the chart maps. Any isomorphism respecting all chart identifications has these restrictions and is therefore equal to this one. Thus the gluing is unique up to a unique chart-compatible isomorphism.

Depends on

Used by

Dependency tree · two levels

11 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