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.

A nonzero module over a Noetherian ring has an associated prime

Statement

Assume Dependent Choice.

Let R be a Noetherian commutative ring and let M be a nonzero left R-module. Then Ass⁡R(M) is nonempty.

Facts & Assumptions

Given: Dependent Choice, a Noetherian commutative ring R and a nonzero left R-module M (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[L1]

A prime ideal belongs to Ass⁡R(M) exactly when it is the annihilator of some element of M (Associated primes of a module).

[L2]

Under Dependent Choice, some nonzero element of M has annihilator maximal among annihilators of nonzero elements (A nonzero module over a Noetherian ring has a maximal element annihilator).

[L3]

An annihilator maximal among annihilators of nonzero elements is prime (A maximal element annihilator is prime).

Proof

technique · direct
1.1L2L3choose

By [L2], choose m∈M with m≠0 such that Ann⁡R(m) is maximal among the annihilators of nonzero elements of M. Then [L3] shows that Ann⁡R(m) is prime.

2.1L1step 1.1

By [L1], the prime ideal Ann⁡R(m) belongs to Ass⁡R(M).

3.1step 2.1∎

Therefore Ass⁡R(M) is nonempty.

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