Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)
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

Assume the Axiom of Choice. Let R be a Noetherian commutative ring and let M be a finitely generated left R-module. If p is minimal in Supp⁡R(M), then p∈Ass⁡R(M).

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R, a finitely generated left R-module M, and a prime ideal p minimal in Supp⁡R(M).

[L1]

Under AC the module M admits a prime filtration 0=M0⊂M1⊂⋯⊂Mn=M with Mi/Mi−1≅R/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.1givenL1L2L3algebra

The stated AC discharges [L1]'s premise. Choose a prime filtration as in [L1]. Repeatedly applying [L2] to the short exact sequences 0⟶Mi−1⟶Mi⟶Mi/Mi−1⟶0 and then using [L3] for Mi/Mi−1≅R/pi gives Supp⁡R(M)=V(p1)∪⋯∪V(pn).

2.1L1step 1.1choosealgebra

By step 1.1, the prime p contains some pi. Since pi∈V(pi)⊆Supp⁡R(M), the minimality of p in the support forces pi=p. Choose the smallest such index i, and choose m∈Mi whose image in Mi/Mi−1≅R/p is nonzero. Then Ann⁡R(m)⊆p, because any scalar killing m kills its nonzero class in R/p. Also pjMj⊆Mj−1 for every j, so (p1⋯pi)m=0.

3.1step 2.1choosealgebra

For each j<i, the minimal choice of i gives pj≠p and hence pj⊈p. Choose aj∈pj∖p, and put f=a1⋯ai−1. Because p is prime and no factor aj lies in p, one has f∉p. Since Ann⁡R(m)⊆p, this implies fm≠0. Moreover pfm=0 because p=pi and (p1⋯pi)m=0. If bfm=0, then bf∈Ann⁡R(m)⊆p; as f∉p and p is prime, this forces b∈p. Therefore Ann⁡R(fm)=p, so p∈Ass⁡R(M).

4.1step 3.1∎

Thus every support-prime minimal by inclusion is associated.

Depends on

Used by

Dependency tree · two levels

16 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