Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

For a finite module, support is the set of primes containing the annihilator

Statement

If M is a finitely generated left R-module, then Supp⁡R(M)={p:Ann⁡R(M)⊆p}.

Facts & Assumptions

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

[L1]

A prime ideal lies in Supp⁡R(M) exactly when some element of M has annihilator inside it (A prime lies in the support exactly when some element has annihilator inside it).

[L2]

If m1,…,mr generate M, then Supp⁡R(M)=⋃iSupp⁡R(R/Ann⁡R(mi)) (A finite module has the union of its generator-cyclic supports).

[L3]

The annihilator of M is Ann⁡R(M)={r∈R:rm=0 for every m∈M} (Annihilators, torsion elements and the torsion subset of a module).

Proof

technique · direct
1.1L1L3

If p∈Supp⁡R(M), [L1] gives m∈M with Ann⁡R(m)⊆p. Since every element of Ann⁡R(M) kills every element of M, one has Ann⁡R(M)⊆Ann⁡R(m)⊆p.

1.2L2L3choose

Choose generators m1,…,mr of M. If Ann⁡R(M)⊆p and no Ann⁡R(mi) is contained in p, choose ti∈Ann⁡R(mi)∖p for every i. Then t=t1⋯tr∉p, but t annihilates every generator and hence all of M, so t∈Ann⁡R(M)⊆p, a contradiction. Thus Ann⁡R(mi)⊆p for some i, and [L2] gives p∈Supp⁡R(M).

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the support-annihilator formula.

Depends on

Used by

Dependency tree · two levels

11 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