Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

The associated module sheaf exists

Statement

Assume the Axiom of Choice. Let A be a commutative ring with 1, let M be an A-module and put X=Spec⁡A with structure sheaf OX. Let B denote the distinguished-open data of M (Module sheaf on an affine scheme): B(D(f))=Mf for every f∈A, with restriction maps ρfg:Mf→Mg for D(g)⊆D(f).

Then:

  1. B satisfies the sheaf conditions on the basis of distinguished opens: for every cover D(f)=⋃i∈ID(fi) and every family si∈Mfi with ρ(si)=ρ(sj) in Mfifj for all i,j∈I, there is a unique s∈Mf with ρffi(s)=si for all i∈I.
  2. The data extend to a sheaf M~ of OX-modules on X with M~(D(f))=Mf for every f∈A and with restriction maps the given ρ; the extension is unique up to unique isomorphism compatible with these identifications on distinguished opens.
  3. In particular M~(D(0))=M~(∅)=0 and M~(X)=M.

The Axiom of Choice is inherited from the published sheaf-theoretic suppliers used below; the construction of B and of the extension is choice-free apart from finitely many existential witnesses, and no selection of points, primes or of an infinite reindexing is made.

Facts & Assumptions

Given: The Axiom of Choice; a commutative ring A; an A-module M; the distinguished-open data B(D(f))=Mf with restriction maps ρfg for D(g)⊆D(f).

[F1]

Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

[F2]

The distinguished opens form a basis of the topology of X closed under finite intersections, D(f)∩D(g)=D(fg), and D(g)⊆D(f) holds exactly when g∈(f) (The underlying space of an affine spectrum).

[F3]

Localisation: for a multiplicative subset S⊆R and an R-module N, the canonical map λS:N→S−1N has kernel { n:sn=0 for some s∈S }; localisation is exact (Localisation of a module at a multiplicative subset, Localisation of modules is exact).

[F4]

OX is a sheaf of rings with OX(D(f))=Af for every f∈A, restriction maps the canonical localisations, and restriction maps of OX between arbitrary opens; this is stated under the Axiom of Choice (The localization construction extends to the structure sheaf on Spec A, Sections and restrictions on distinguished opens of an affine scheme).

[F5]

D(f) is quasi-compact for every f∈A, under the Axiom of Choice (Every distinguished open of an affine spectrum is quasi-compact).

[F6]

The maps ρfg are the unique Af-linear maps compatible with the canonical maps from M; they are functorial, ρff=id⁡ and ρfh=ρgh∘ρfg for D(h)⊆D(g)⊆D(f), and on D(f) the data are modules over Af=OX(D(f)) with the ring restriction Af→Ag acting compatibly (Module sheaf on an affine scheme).

[F7]

A sheaf on X is a presheaf with locality (a section vanishing on a cover vanishes) and unique gluing of compatible families on every open cover (A sheaf on a topological space).

Proof technique: direct; a finitely supported partition of unity proves the exactness of the finite cover complex, and quasi-compactness reduces basis covers to finite ones.

Proof

1.1F3givenalgebra

Let B be a commutative ring, N a B-module and g1,…,gr∈B with ∑i=1rbigi=1 for some bi∈B. If n∈N is such that giein=0 for some ei≥0 and every i, then n=0: choose E≥max⁡iei and expand n=1rEn=(∑i=1rbigi)rEn=∑ν1+⋯+νr=rEcν b1ν1⋯brνr g1ν1⋯grνr n, where every multi-index ν of total degree rE has some νi≥E≥ei, so each summand vanishes.

1.2F2F6given

Define a presheaf F on X by letting F(U), for an open U⊆X, be the set of all families (sD) indexed by the distinguished opens D=D(g) with D⊆U, with sD∈Mg, such that ρgg′(sD(g))=sD(g′) whenever D(g′)⊆D(g)⊆U; restrictions are (sD)↦(sD∣D′⊆U′). This is a presheaf of abelian groups, and for every f the map Mf→F(D(f)), s↦(ρfg(s))D(g)⊆D(f), is a bijection with inverse (sD)↦sD(f): the family is compatible by [F6], the composite (sD)↦sD(f)↦(ρfg(sD(f))) is the identity by the defining compatibility, and s=0 is forced by the component D(f).

2.1F3step 1.1givenalgebra

With B,N,gi as in step 1.1, ∑ibigi=1 and r≥1, let elements ni∈Ngi satisfy ni=nj in Ngigj for all i,j. Then there is n∈N with n/1=ni in Ngi for every i. Indeed, ni=xi′/giki for some xi′∈N and ki≥0; set k:=max⁡iki and xi:=gik−kixi′, so that ni=xi/gik for all i. Compatibility of ni and nj in Ngigj provides, for each pair (i,j), an exponent mij≥0 with (gigj)mij(gjkxi−gikxj)=0 by [F3]; put m:=max⁡i,jmij and K:=k+m. Choose ai∈B with ∑iaigiK=1: if K=0, take a1=1 and ai=0 for i>1; if K≥1, then (g1K,…,grK)=B, since in the expansion of 1=(∑ibigi)rK every monomial of total degree rK is divisible by some giK. Set Xi:=giK−kxi, so that ni=Xi/giK; multiplying each witness relation by (gigj)m−mij gives the normalised relations giKXj=gjKXi in N for all i,j. Then n:=∑iaiXi satisfies giKn=∑jajgiKXj=∑jajgjKXi=Xi, hence n/1=Xi/giK=ni in Ngi for every i.

2.2F4F6step 1.2

On each F(U) define a⋅(sD):=(a∣D⋅sD) for a∈OX(U), using OX(U)→OX(D(g))=Ag from [F4] and the Ag-module structure of Mg from [F6]. This is a well-defined OX(U)-module structure: each a∣D⋅sD lies in Mg, the families are again compatible because ring restriction and module restriction commute, the componentwise module axioms hold, and the restriction maps of F are OX(U)-linear after scalar restriction. Thus F is a presheaf of OX-modules whose sections over distinguished opens are the modules Mf.

3.1F2F3F6step 1.1step 2.1

If D(f)=∅, then Af=0 and Mf=0, so locality and gluing hold uniquely, including for any finite family of empty opens. Assume now that D(f)=⋃i=1rD(fi) is a finite cover of a nonempty distinguished open, so r≥1. Then the cover condition is ∑icifi=f m for some ci∈A, m≥0, equivalently ∑ibifi=1 in Af; set B:=Af, N:=Mf and gi:=fi. (a) If s∈Mf has ρffi(s)=0 in every Mfi, then s=0: by [F3] some fieis=0 in N, so step 1.1 applies. (b) If si∈Mfi=Ngi satisfy si=sj in Mfifj=Ngigj for all i,j, then there is s∈Mf with ρffi(s)=si for all i: step 2.1 applied to N and gi produces such an s, and the identifications Ngi=Mfi and Ngigj=Mfifj are the canonical ones because D(fi)⊆D(f) forces fi∈(f).

4.1F2F5F6step 3.1

Now let D(f)=⋃i∈ID(fi) be an arbitrary cover by distinguished opens. Choose a finite subcover indexed by J⊆I using [F5]. If J=∅, then D(f)=∅, so Mf=0 and every Mfi=0; locality and gluing hold uniquely. Assume J≠∅. (a) If s∈Mf has ρffi(s)=0 for all i∈I, then in particular it vanishes on the finite subcover indexed by J, so step 3.1(a) gives s=0. (b) If si∈Mfi satisfy si=sj in Mfifj for all i,j∈I, then step 3.1(b) glues the family on the finite subcover to s∈Mf with ρffij(s)=sij for j∈J. For any i∈I with D(fi)≠∅, the distinguished opens D(fifij), j∈J, cover D(fi) because D(fi)⊆D(f)=⋃j∈JD(fij). On each such overlap, compatibility gives the same image for si and sij, while the restriction of s there equals the restriction of sij by construction. Thus si−ρffi(s) restricts to zero on the finite cover D(fi)=⋃j∈JD(fifij), and step 3.1(a) gives si=ρffi(s). If D(fi)=∅, then Mfi=0 and the equality also holds. Uniqueness of s follows from part (a); so the distinguished-open data satisfy the sheaf conditions on the basis, proving claim 1.

5.1F2step 4.1step 1.2

F satisfies locality on every open cover. Let U=⋃αUα and let s=(sD)∈F(U) restrict to 0 in every F(Uα). Fix a distinguished open D⊆U; the D∩Uα that are nonempty cover D and each contains a distinguished open D′⊆D∩Uα⊆D by [F2]. The restriction of sD to D′ is the D′-component of s∣Uα, hence 0; therefore sD vanishes in Mg′ for every such D′, and these D′ form a cover of D by distinguished opens, so step 4.1(a) gives sD=0; as D was arbitrary, s=0.

6.1F7step 4.1step 2.2step 5.1

F satisfies gluing. Let U=⋃αUα and let sα∈F(Uα) be compatible on overlaps Uα∩Uβ. For a distinguished open D⊆U and indices α,β with D∩Uα, D∩Uβ nonempty, any two distinguished opens D′,D′′⊆D∩Uα∩Uβ satisfy sα,D′=sβ,D′′ in the common module Mg for D(g)⊆D′∩D′′, by compatibility of sα,sβ on Uα∩Uβ; hence the elements sα,D′∈Mg′ glue over the basis cover of D formed by all distinguished D′⊆D∩Uα, α varying, to a unique sD∈MD by step 4.1(b), and this sD is independent of the choices by step 4.1(a). The resulting family (sD)D⊆U is compatible: for D′′⊆D′⊆U and a common refinement D′′′⊆D′′ of the relevant covers, both restrictions agree with sγ,D′′′ for suitable γ, so step 4.1(a) applied on D′′ gives compatibility. It restricts to each sα componentwise, so with step 5.1 and [F7], F is a sheaf; it is a sheaf of OX-modules by step 2.2 and the argument of step 5.1 applied to a⋅s−s′ for the componentwise action.

7.1step 4.1step 1.2step 6.1given

The sheaf F of steps 1.2–5.1 has F(D(f))=Mf for every f by step 1.2, so it is the required extension M~ and proves claim 2, including M~(D(0))=M0=0 because f=0 is nilpotent and M0=0; the empty open ∅=D(0) carries the empty family, so M~(∅)=0, while M~(X)=M1=M; this is claim 3.

8.1F1F3F4F5F7step 4.1step 2.2step 6.1∎

Uniqueness: let G be a sheaf of OX-modules with isomorphisms ψf:G(D(f))→Mf compatible with the restrictions ρ, and let F be as above. For an open U and t∈G(U) the family (ψg(t∣D(g)))D(g)⊆U is an element ΦU(t)∈F(U); the maps ΦU are compatible with restrictions, hence form a morphism Φ:G→F of sheaves of OX-modules, and on D(f) the map ΦD(f) is the given isomorphism ψf by step 1.2. The map ΦU is injective: if ΦU(t)=0 then t∣D(g)=0 for all distinguished D(g)⊆U, and these cover U, so t=0 by locality of the sheaf G. It is surjective: given a family (sD), the components sD∈MD=ψD(G(D)) come from unique sections tD∈G(D) which are compatible on overlaps because the ψ are compatible with restrictions, so they glue by the sheaf property of G to t∈G(U), and ΦU(t) and (sD) have the same components. Thus each ΦU is a bijection, the extension is unique up to unique isomorphism, and the theorem is proved; the Axiom of Choice [F1] enters only through the published suppliers [F4] and [F5], which are stated under it, and every selection made in the proof is the extraction of finitely many witnesses (a finite subcover, finitely many exponents and coefficients) rather than an arbitrary-index choice.

Depends on

Used by

Dependency tree · two levels

27 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