Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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, local criteria for zero modules and for injective, surjective, and bijective maps

Statement

Assume the Axiom of Choice.

Let M be a left R-module.

  1. M=0 if and only if Mp=0 for every prime ideal p, and this is equivalent to Mm=0 for every maximal ideal m.
  2. For an R-module homomorphism f:MN, the map f is injective, surjective, or bijective if and only if every prime localisation fp has the same property, and this is equivalent to checking every maximal localisation.

Facts & Assumptions

Given: A commutative ring R, left R-modules M,N, and an R-module homomorphism f:MN.

[L1]

Localisation identifies kernels and cokernels: S1(kerf)ker(S1f) and S1(cokerf)coker(S1f) (Localisation commutes with kernels images and cokernels).

[L2]

Every proper ideal of a nonzero commutative ring is contained in a maximal ideal (In a nonzero commutative ring, every proper ideal is contained in a maximal ideal).

[L3]

Every maximal ideal of a commutative ring is prime (Every maximal ideal of a commutative ring is prime).

[L4]

The annihilator of mM is AnnR(m)={rR:rm=0} (Annihilators, torsion elements and the torsion subset of a module).

[L5]

A localised fraction is zero exactly when one denominator kills its numerator (A localised module fraction is zero exactly when one denominator kills its numerator).

[L6]

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

Proof

technique · direct
1.1

If M=0, then every localisation of M is 0.

given
1.2

Suppose Mm=0 for every maximal ideal m and mM is nonzero. Then AnnR(m) is a proper ideal by [L4], so [L2] gives a maximal ideal m containing it. If m/1=0 in Mm, [L5] gives tm with tm=0, so tAnnR(m)m, a contradiction. Hence Mm0, contradicting the hypothesis. Therefore M=0 iff all maximal localisations vanish.

L2L4L5choose
2.1

If all prime localisations vanish then all maximal localisations vanish by [L3], so step 1.2 gives M=0. Conversely, suppose Mp0 for some prime ideal p and choose m/s0 in Mp. Then no element outside p annihilates m, or else [L5] would give m/s=0; hence AnnR(m)p. By [L2] choose a maximal ideal m containing AnnR(m). The same zero-criterion argument as in step 1.2 gives m/10 in Mm, so maximal-local vanishing would fail. Thus prime-local vanishing and maximal-local vanishing are equivalent.

L2L3L4L5step 1.2choose
3.1

The map f is injective iff kerf=0. By [L1], this is equivalent to ker(fp)=0 for every prime p, and then by step 2.1 to ker(fm)=0 for every maximal m. So f is injective iff all prime localisations, equivalently all maximal localisations, are injective.

L1L6step 2.1
3.2

The map f is surjective iff cokerf=0. By [L1], this is equivalent to coker(fp)=0 for every prime p, and then by step 2.1 to coker(fm)=0 for every maximal m. So f is surjective iff all prime localisations, equivalently all maximal localisations, are surjective.

L1L6step 2.1
4.1

A map is bijective exactly when it is both injective and surjective, so step 3.1 and step 3.2 give the bijective criterion.

step 3.1step 3.2
5.1

Steps 1.2, 2.1, 3.1, 3.2, and 4.1 prove both claims.

step 1.2step 2.1step 3.1step 3.2step 4.1

Depends on

Used by

Dependency tree · two levels

23 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