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.

Finite modules over Noetherian rings have finitely many associated primes

Statement

Assume the Axiom of Choice.

Let R be a Noetherian commutative ring and let M be a finitely generated left R-module. Then Ass⁡R(M) is a finite set.

Facts & Assumptions

Given: The Axiom of Choice, a Noetherian commutative ring R and a finitely generated left R-module M (The Axiom of Choice).

[L1]

Under the stated Axiom of Choice, the module M admits a prime filtration 0=M0⊂M1⊂⋯⊂Mn=M with Mi/Mi−1≅R/pi (Finite modules over Noetherian rings admit prime filtrations).

[L2]

In a short exact sequence, associated primes of the middle term are contained in the union of those of the outer terms (Associated primes in a short exact sequence).

Proof

technique · direct
1.1L1given

Choose a prime filtration as in [L1]. If n=0, then M=0 and Ass⁡R(M)=∅, which is finite.

1.2L1L2algebra

Assume n≥1. Applying [L2] to 0⟶Mn−1⟶M⟶M/Mn−1⟶0 gives Ass⁡R(M)⊆Ass⁡R(Mn−1)∪Ass⁡R(M/Mn−1). Since M/Mn−1≅R/pn, the class of 1+pn has annihilator pn, so Ass⁡R(M/Mn−1)={pn}. Repeating this argument down the filtration yields Ass⁡R(M)⊆{p1,…,pn}.

2.1step 1.1step 1.2∎

The right-hand side of step 1.2 is finite, so Ass⁡R(M) is finite.

Depends on

Used by

Dependency tree · two levels

12 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