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.

Minimal support primes of a finite module are associated

Statement

Let R be a Noetherian commutative ring and let M be a finitely generated left R-module. If p is minimal in SuppR(M), then

pAssR(M).

Facts & Assumptions

Given: A Noetherian commutative ring R, a finitely generated left R-module M, and a prime ideal p minimal in SuppR(M).

[L1]

The module M admits a prime filtration 0=M0M1Mn=M with Mi/Mi1R/pi for prime ideals pi (Finite modules over Noetherian rings admit prime filtrations).

[L2]

Support in a short exact sequence is the union of the supports of the outer terms (Support in a short exact sequence is the union of the outer supports).

[L3]

The support of R/I is exactly V(I) (The support of a cyclic quotient is its vanishing set).

Proof

technique · direct
1.1

Choose a prime filtration as in [L1]. Repeatedly applying [L2] to the short exact sequences 0Mi1MiMi/Mi10 and then using [L3] for Mi/Mi1R/pi gives SuppR(M)=V(p1)V(pn).

L1L2L3algebra
2.1

By step 1.1, the prime p contains some pi. Since piV(pi)SuppR(M), the minimality of p in the support forces pi=p. Choose the smallest such index i, and choose mMi whose image in Mi/Mi1R/p is nonzero. Then AnnR(m)p, because any scalar killing m kills its nonzero class in R/p. Also pjMjMj1 for every j, so (p1pi)m=0.

L1step 1.1choosealgebra
3.1

For each j<i, the minimal choice of i gives pjp and hence pjp. Choose ajpjp, and put f=a1ai1. Because p is prime and no factor aj lies in p, one has fp. Since AnnR(m)p, this implies fm0. Moreover pfm=0 because p=pi and (p1pi)m=0. If bfm=0, then bfAnnR(m)p; as fp and p is prime, this forces bp. Therefore AnnR(fm)=p, so pAssR(M).

step 2.1choosealgebra
4.1

Thus every support-prime minimal by inclusion is associated.

step 3.1

Depends on

Used by

Dependency tree · two levels

13 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