Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

Every submodule of a finite module over a Noetherian ring has a minimal primary decomposition

Statement

Assume Dependent Choice.

Let R be a Noetherian commutative ring and let M be a finitely generated left R-module. Every submodule NM has a finite primary decomposition. After deleting redundant components and combining equal radicals, one obtains a minimal primary decomposition. When N=M, the decomposition is the empty intersection, interpreted as M. In particular, every ideal of a Noetherian ring has a minimal primary decomposition.

Facts & Assumptions

Given: Dependent Choice, a Noetherian commutative ring R, a finitely generated left R-module M, and a submodule NM.

[L1]

A finitely generated module over a Noetherian ring is Noetherian (Finitely generated modules over a left Noetherian ring are Noetherian).

[L2]

Assuming Dependent Choice, a Noetherian module has the maximal condition on submodules (Finite generation, ACC, and maximal-condition characterizations of Noetherian modules).

[L3]

An irreducible submodule of a Noetherian module is primary (An irreducible submodule of a Noetherian module is primary).

[L4]

Finite primary decompositions can be made irredundant by deleting redundant components (A finite primary decomposition can be stripped of redundant components).

[L5]

In a finite primary decomposition of a submodule of a finitely generated module over a Noetherian commutative ring, equal-radical primary components can be combined into one primary component (Equal-radical primary components can be combined).

Proof

technique · direct
1.1

The submodule M has the empty primary decomposition, whose intersection is interpreted as M.

given
2.1

By [L1], the module M is Noetherian. Suppose, toward contradiction, that some submodule of M has no finite primary decomposition. Let Σ be the set of such submodules. By step 1.1, MΣ. By [L2], choose a maximal element Q of Σ; then QM.

L1L2step 1.1givenconstruct
3.1

The submodule Q is irreducible. Indeed, if Q=AB with QA and QB, then the maximality of Q in step 2.1 forces finite primary decompositions of A and B. Intersecting those two finite decompositions gives a finite primary decomposition of Q, contrary to QΣ.

step 2.1algebra
4.1

Because Q is irreducible and proper and M is Noetherian, [L3] shows that Q is primary. But a primary submodule is already a one-term finite primary decomposition, again contradicting QΣ. Therefore Σ is empty: every submodule of M has a finite primary decomposition.

L3step 2.1step 3.1
5.1

If N=M, the empty decomposition from step 1.1 is irredundant and has pairwise distinct radicals vacuously, so it is minimal. If NM, start from a finite primary decomposition supplied by step 4.1, apply [L4] to remove redundant components, and then apply [L5] to merge equal-radical blocks. The resulting decomposition is finite, has the same intersection, has no redundant component, and has pairwise distinct radicals; hence it is minimal.

L4L5step 1.1step 4.1
6.1

Taking M=R recovers the ideal case, because ideals are precisely the submodules of the regular module over a commutative ring.

step 5.1algebra

Depends on

Used by

Dependency tree · two levels

21 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