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

The support is the union of the closures of the associated primes

Statement

Let R be a Noetherian commutative ring and let M be a finitely generated left R-module. Then

SuppR(M)=pAssR(M)V(p).

Facts & Assumptions

Given: A Noetherian commutative ring R and a finitely generated left R-module M.

[L1]

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

[L2]

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

[L3]

The module M admits a prime filtration, and support is the union of the supports of its prime-filtration quotients (Finite modules over Noetherian rings admit prime filtrations, Support in a short exact sequence is the union of the outer supports, The support of a cyclic quotient is its vanishing set).

[L4]

Every associated prime lies in the support (Associated primes lie in the support).

Proof

technique · direct
1.1

By [L3], write SuppR(M)=V(p1)V(pn) for the prime ideals pi occurring in a prime filtration of M. Let qSuppR(M). Then piq for some i. Choose such an index i with pi minimal under inclusion among the filtration primes contained in q. If rSuppR(M) and rpi, then [L3] gives some pjrpi, so the minimal choice of pi forces pj=pi and hence r=pi. Therefore pi is minimal in the support, so [L1] gives piAssR(M) and qV(pi). This proves SuppR(M)pAssR(M)V(p).

L1L3choosealgebra
1.2

Conversely, let pAssR(M) and let qp. By [L4], the prime p lies in the support; then [L2] gives AnnR(M)pq, so qSuppR(M). Thus V(p)SuppR(M) for every pAssR(M).

L2L4algebra
2.1

Steps 1.1 and 1.2 prove the support decomposition.

step 1.1step 1.2

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