Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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.

Primary submodules of finite modules are characterized by a singleton associated-prime set

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring, let M be a finitely generated left R-module, let QM be a proper submodule, and let p be a prime ideal. Put N=M/Q. Then the following are equivalent:

  1. Q is p-primary.
  2. AssR(N)={p}.
  3. Every ap acts injectively on N, and there exists n1 with pnN=0.

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R, a finitely generated left R-module M, a proper submodule QM, a prime ideal p, and the quotient N=M/Q.

[L1]

Zero divisors on a module over a Noetherian ring are exactly the elements lying in its associated primes (Zero divisors on a module over a Noetherian ring are the union of its associated primes).

[L2]

For a finitely generated module, support is V of the annihilator (For a finite module, support is the set of primes containing the annihilator).

[L3]

Minimal primes in the support of a finite module are associated (Minimal support primes of a finite module are associated).

[L4]

A proper submodule is p-primary exactly when it is primary and AnnR(N)=p (Primary submodules and primary ideals).

[L5]

A localization or quotient of a Noetherian ring is Noetherian (Every quotient and every localisation of a Noetherian ring is Noetherian).

[L6]

The nilradical of a Noetherian ring is nilpotent (The nilradical of a Noetherian ring is nilpotent).

[L7]

The support of a finite module is the union of the V(q) over its associated primes q (The support is the union of the closures of the associated primes).

[L8]

Assuming the Axiom of Choice, the radical of an ideal is the intersection of the primes containing it (The radical of an ideal is the intersection of the prime ideals containing it).

Proof

technique · direct
1.1

Assume Q is p-primary. Then [L4] gives AnnR(N)=p, so every prime in SuppR(N)=V(AnnR(N)) contains p by [L2] and [L8]. Let qAssR(N). Every aq is a zero divisor on N, so primaryity makes a act nilpotently on N and hence some power of a lies in AnnR(N). Thus aAnnR(N)=p, which proves qp. Since p is minimal in V(AnnR(N)), fact [L3] gives pAssR(N). Now every associated prime contains p and is contained in p, so AssR(N)={p}.

L2L3L4L8givenalgebra
1.2

Assume AssR(N)={p}. By [L1], the zero divisors on N are exactly the elements of p, so every ap acts injectively on N. Also [L7] gives SuppR(N)=V(p). Combining this with [L2] shows V(AnnR(N))=V(p), and then [L8] yields AnnR(N)=p. Since R/AnnR(N) is Noetherian by [L5], fact [L6] applied to that quotient ring shows that its nilradical p/AnnR(N) is nilpotent. Hence pnAnnR(N) for some n1, that is, pnN=0.

L1L2L5L6L7L8givenalgebra
1.3

Assume condition 3. If a is a zero divisor on N and ap, then multiplication by a would be both noninjective and injective, impossible. So every zero divisor lies in p. Since pnN=0, each ap acts nilpotently on N, namely anN=0. Therefore Q is primary. Also pnN=0 gives pAnnR(N). Conversely, if aAnnR(N), then some power of a kills N. If ap, multiplication by a is injective, hence every power of a is injective, so a nonzero power cannot annihilate the nonzero module N. Thus ap. Therefore AnnR(N)=p, and [L4] shows that Q is p-primary.

L4givenalgebra
2.1

Steps 1.1, 1.2, and 1.3 prove the equivalence of the three conditions.

step 1.1step 1.2step 1.3

Depends on

Used by

Dependency tree · two levels

34 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