Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Affineness from a finite principal cover

Statement

Let X be a scheme, R=Γ(X,OX), and f1,,fnR. Write Xf for the open locus where the germ of f is a unit. If (f1,,fn)=R and each Ui=Xfi is affine, then X is affine. In fact the canonical morphism XSpecR is an isomorphism. Empty X and n=0 are allowed.

Facts & Assumptions

Given: The objects, hypotheses and conventions in the statement above.

[F1]

For a scheme X and a ring A, taking global sections induces a natural bijection Hom(X,SpecA)HomCRing(A,Γ(X,OX)). (Morphisms to an affine scheme and global sections)

[F2]

For fA, Γ(D(f),O)=Af. If D(g)D(f), the restriction is the canonical localization map AfAg. (Sections and restrictions on distinguished opens of an affine scheme)

[F3]

If 0MfMgM0 is a short exact sequence of R-modules, then 0S1MS1fS1MS1gS1M0 is a short exact sequence of S1R-modules. (Localisation of modules is exact)

[F4]

Let F be a presheaf of sets on a topological space X. Then F is a sheaf if and only if, for every open set UX and every open cover U=iIUi, the restriction map e:F(U)iIF(Ui),e(s)=(sUi)iI, is an equalizer of the two maps d0,d1:iIF(Ui)(i,j)I×IF(UiUj), defined by d0((si))=(siUiUj)i,j,d1((si))=(sjUiUj)i,j. (The sheaf axiom is the equalizer condition on a cover)

Proof

1.1

Write 1=igifi. At every point some fi is a unit, so the Ui cover X. Set Bi=Γ(Ui,OX). The intersection UiUj is the principal open defined by fjUi in Ui, hence affine, and F2 gives its ring by localization.

givenF2
2.1

F4 identifies R as the kernel of the difference of restriction maps iBii,jΓ(UiUj,OX), a homomorphism of R-modules. Fix k and localize this kernel at fk. Localization preserves kernels by F3: apply exactness to the kernel-image short exact sequence and to the inclusion of the image in the target. It commutes with these finite products, because a common denominator exists for every finite tuple.

F3F4step 1.1
3.1

By F2 each localized factor is the ring of sections on its intersection with Uk. By F4 their kernel is Γ(Uk,OX), since the opens UiUk cover Uk. Thus restriction induces RfkBk as rings; multiplicativity follows from restriction and fraction multiplication, not merely module exactness.

F2F4step 2.1
4.1

F1 supplies the canonical map j:XSpecR induced by the identity of R. Its inverse image of D(fk) is Xfk, and on this open it is the isomorphism from step 3.1. The D(fk) cover SpecR because the fk generate 1; local inverse maps agree and glue to the inverse of j. If n=0 then R=0, which forces X= since each point has a nonzero local ring. For n=1, f1 is a unit and U1=X. Zero sections merely contribute empty charts.

F1step 1.1step 3.1

Depends on

Used by

Dependency tree · two levels

18 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