Alphabeta Math
LemmaStatement: 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.

Geometric Nakayama for finite-type sheaves

Statement

Assume the Axiom of Choice, inherited from the construction of associated sheaves. Let X be a scheme, let F be a quasi-coherent OX-module of finite type (Finite type and finitely presented module sheaves) and let x∈X, with fibre F(x)=Fx⊗OX,xκ(x) (Fibre of a module sheaf at a point).

  1. F(x)=0 if and only if F vanishes on some open neighbourhood of x.
  2. If W is a neighbourhood of x and s1,…,sn∈F(W) are sections whose images in F(x) span F(x) over κ(x), then there is an affine open U⊆W containing x such that s1∣U,…,sn∣U generate F∣U, that is, the induced morphism OU n→F∣U is an epimorphism.

No new arbitrary-index choice is made: the argument uses only finitely many generators and finitely many denominators.

Facts & Assumptions

Given: The Axiom of Choice; a scheme X; a finite-type quasi-coherent OX-module F; a point x∈X; a neighbourhood W of x and sections s1,…,sn∈F(W).

[F1]

F(x)=Fx/mxFx is a vector space over κ(x)=OX,x/mx, restriction to an open U∋x gives (F∣U)(x)=F(x), and F(x)=0 if F vanishes near x (Fibre of a module sheaf at a point, The residue field at a point of an affine scheme).

[F2]

For an affine scheme Spec⁡A with associated sheaf M~ and a prime p, the stalk is (M~)p≅Mp over Ap≅OSpec⁡A,p (The stalk of an associated sheaf is the localisation).

[F3]

F is of finite type: at each point there is an affine open U=Spec⁡A with F∣U≅M~ for a finitely generated A-module M, and equivalently F∣U is generated by finitely many sections over U; on an affine open, global sections are Γ(U,M~)≅M (Finite type and finitely presented module sheaves, The associated module sheaf exists, Generated submodule, cyclic and finitely generated modules, module basis and free module).

[F4]

Determinant trick: if R is a commutative ring, I⊴R an ideal and N a finitely generated R-module with IN=N, then there is a∈I with (1−a)N=0 (Determinant trick for Nakayama).

[F5]

Localisation is exact and commutes with kernels, images and cokernels: for an R-linear map ψ, S−1(coker⁡ψ)≅coker⁡(S−1ψ) (Localisation of modules is exact, Localisation commutes with kernels images and cokernels).

[F6]

A fraction vanishes: m/s=0 in S−1M exactly when um=0 for some u∈S (A localised module fraction is zero exactly when one denominator kills its numerator).

[F7]

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

Proof technique: direct; pass to an affine chart, express the fibre as Mp/pMp, apply the determinant trick at the local ring, and spread the vanishing of a finitely generated localised module to a basic open.

Proof

1.1F1F2F3

Let U=Spec⁡A⊆W be an affine open neighbourhood of x, let p⊆A be the prime corresponding to x, and write F∣U≅M~ with M a finitely generated A-module by [F3]; then OX,x≅Ap, κ(x)≅Ap/pAp, and by [F2] the fibre of the Statement is F(x)≅Mp/pMp, while global sections satisfy Γ(U,M~)≅M so the restrictions si∣U correspond to elements gi∈M.

1.2F4

Nakayama at the point: for a finitely generated A-module N and a prime p, one has Np=0 if and only if Np=pNp. The implication from left to right is immediate; conversely, if Np=pNp, apply [F4] over the local ring Ap with I=pAp to the finitely generated Ap-module Np to obtain a∈pAp with (1−a)Np=0, and since 1−a∉pAp is a unit of the local ring, Np=0.

1.3F6F7

Vanishing spreads to a basic open: if N is a finitely generated A-module with Np=0, then Nt=0 for some t∉p. Choose finitely many generators n1,…,nr of N; since ni/1=0 in Np, [F6] gives ti∉p with tini=0, and with t=t1⋯tr∉p one has tni=0 for all i, so t annihilates every element of N and therefore every element of Nt is zero; only finitely many existential instantiations occur, so no arbitrary-index choice is used.

2.1F5step 1.1step 1.2

Let ψ:An→M be the A-linear map with ψ(ei)=gi, and let C=coker⁡ψ=M/ψ(An), a finitely generated A-module; by [F5] its localisation is Cp≅Mp/ψp(Apn), and Cp/pCp≅Mp/(ψp(Apn)+pMp). The images of s1,…,sn span F(x) over κ(x) precisely when Mp=ψp(Apn)+pMp, that is, when Cp=pCp; by step 1.2 applied to the finitely generated module C, this is equivalent to Cp=0.

2.2F1step 1.1step 1.2step 1.3

Proof of claim 1: F(x)=0 if and only if Mp=pMp by step 1.1, if and only if Mp=0 by step 1.2, if and only if Mt=0 for some t∉p by step 1.3 together with the trivial implication; for such t the open D(t) contains x and F∣D(t)≅Mt~=0, so F vanishes on a neighbourhood of x, while conversely vanishing near x gives Fx=0 and hence F(x)=0 by [F1].

3.1step 1.1step 1.3step 2.1

Proof of claim 2: if the images of s1,…,sn span F(x), then Cp=0 by step 2.1, so step 1.3 applied to the finitely generated module C gives t∉p with Ct=0, that is, Mt=ψt(Atn); the restrictions of g1,…,gn to D(t) therefore generate Γ(D(t),M~)≅Mt, so the induced morphism OD(t)n→F∣D(t) is an epimorphism on the affine open D(t)⊆U⊆W containing x.

4.1F2F3F7step 2.2step 3.1∎

The Axiom of Choice is inherited from [F2] and the associated-sheaf construction behind [F3]; the argument itself instantiates finitely many generators and denominators, so it makes no new arbitrary-index choice, and both claims are proved in steps 2.2 and 3.1.

Depends on

Used by

Dependency tree · two levels

38 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