Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

Assuming the Axiom of Choice, a sequence of modules is exact exactly when all prime localisations are exact

Statement

Assume the Axiom of Choice.

Let

MfMgM

be a sequence of R-module homomorphisms with gf=0. Then the sequence is exact at M if and only if, for every prime ideal p, the localised sequence

MpfpMpgpMp

is exact at Mp. Equivalently, it suffices to check exactness at every maximal ideal.

Facts & Assumptions

Given: A commutative ring R and a sequence MfMgM of left R-modules with gf=0.

[L1]

Exactness at M means imf=kerg (Exact sequences and short exact sequences of modules).

[L2]

Localisation identifies kernels and images, and it commutes with quotient modules (Localisation commutes with kernels images and cokernels, Localisation commutes with quotient modules and arbitrary direct sums).

[L3]

A module is zero exactly when all of its prime localisations are zero, equivalently all of its maximal localisations are zero (Assuming the Axiom of Choice, local criteria for zero modules and for injective, surjective, and bijective maps).

[L4]

The image and kernel are the standard submodule constructions attached to a module homomorphism (Module homomorphism and isomorphism, kernel, image and cokernel).

Proof

technique · direct
1.1

Because gf=0, one has imfkerg, so the quotient module H:=kerg/imf is defined. By [L1], the original sequence is exact at M if and only if H=0.

L1L4
2.1

For every prime ideal p, [L2] gives Hp(kerg)p/(imf)pker(gp)/im(fp). Therefore the localised sequence is exact at Mp if and only if Hp=0.

L2step 1.1
3.1

By [L3], H=0 if and only if Hp=0 for every prime ideal p, and this is equivalent to Hm=0 for every maximal ideal m. Combining this with steps 1.1 and 2.1 gives the prime-local and maximal-local exactness criteria.

L3step 1.1step 2.1
4.1

Step 3.1 proves the theorem.

step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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