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.

The stalk of an associated sheaf is the localisation

Statement

Assume the Axiom of Choice, inherited from the existence theorem for the associated sheaf. Let A be a commutative ring, M an A-module, X=Spec⁡A and p∈X a prime. Then the canonical map φ:(M~)p⟶Mp,[germ of s∈M~(D(f)), f∉p]⟼s/1, where (M~)p is the stalk of the associated sheaf at p and Mp the localisation of M at the prime p, is an isomorphism of Ap-modules. It is natural in M: an A-linear u:M→N induces a commuting square with u~p on the left and up on the right. No Noetherian or finiteness hypothesis on M is made.

Facts & Assumptions

Given: The Axiom of Choice; a commutative ring A; an A-module M; a prime p⊆A; the associated sheaf M~.

[F1]

M~ is a sheaf of OX-modules with M~(D(f))=Mf and restriction maps ρfg (The associated module sheaf exists).

[F2]

The stalk of a sheaf at a point is the filtered colimit of the section modules over a cofinal system of open neighbourhoods; the distinguished opens containing p are cofinal among the neighbourhoods of p (The stalk of a presheaf at a point, The underlying space of an affine spectrum).

[F3]

In the localisation S−1N of a module, m/s=n/t if and only if u(tm−sn)=0 for some u∈S; the canonical map is m↦m/1, and OX,p≅Ap (Localisation of a module at a multiplicative subset, The stalk of the affine structure sheaf at a prime is A_p).

[F4]

The restriction maps ρfg are canonical localisations and uf:Mf→Nf commutes with them (Module sheaf on an affine scheme).

Proof technique: direct comparison of the cofinal system of distinguished neighborhoods with the localisation.

Proof

1.1F2F3F4

Define φ on germs by choosing a distinguished open D(f)∋p, that is f∉p, and an element s∈Mf representing the germ; send it to the image of s under the canonical localisation Mf→Mp of [F3], the element written s/1. This is well defined: a germ has a representative on some distinguished D(f)∋p by [F2], any two such open sets D(f),D(g) may be compared after passing to D(fg)∋p, and on D(fg) the compatibility law of [F4], s∣D(fg)=ρfg(s), together with the factorisation Mf→Mfg→Mp of localisations, shows that both choices give the same image in Mp.

1.2F1F3F4

The map φ is Ap-linear: the stalk (M~)p is a module over OX,p, which is Ap by [F3], and the localisation maps Mf→Mp are Af-linear, hence Ap-linear on the colimit. Naturality in M holds because u~ has components uf on distinguished opens by [F1] and [F4], and uf is the localisation of u, so it commutes with the maps Mf→Mp and Nf→Np.

1.3F1F2F3

φ is surjective: every element of Mp is of the form m/s with s∉p, hence lies in the image of the canonical map Ms→Mp by the fraction criterion of [F3]; the element m/s∈Ms=M~(D(s)) has a germ at p that φ sends to m/s.

1.4F2F3

φ is injective: let s∈Mf with f∉p have image 0 in Mp. Write s=m/fk by [F3]; its image in Mp is m/fk, so by the fraction criterion there is t∉p with tm=0. In the localization Mft the element t is invertible, so m=0 there and hence s=m/fk=0 there. Since ft∉p, D(ft) is a distinguished neighbourhood of p on which s restricts to zero; therefore its germ is zero.

2.1F1step 1.2step 1.3step 1.4given∎

Thus φ is a bijective Ap-linear map, hence an isomorphism of Ap-modules, and by step 1.2 it is natural in M. The Axiom of Choice is inherited from the existence theorem [F1], which supplies M~; the remaining argument makes only finitely many choices of elements and exponents.

Depends on

Used by

Dependency tree · two levels

25 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