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 be a Noetherian commutative ring and let be a finitely generated left -module. Every submodule has a finite primary decomposition. After deleting redundant components and combining equal radicals, one obtains a minimal primary decomposition. When , the decomposition is the empty intersection, interpreted as . In particular, every ideal of a Noetherian ring has a minimal primary decomposition.
Facts & Assumptions
Given: Dependent Choice, a Noetherian commutative ring , a finitely generated left -module , and a submodule .
A finitely generated module over a Noetherian ring is Noetherian (Finitely generated modules over a left Noetherian ring are Noetherian).
Assuming Dependent Choice, a Noetherian module has the maximal condition on submodules (Finite generation, ACC, and maximal-condition characterizations of Noetherian modules).
An irreducible submodule of a Noetherian module is primary (An irreducible submodule of a Noetherian module is primary).
Finite primary decompositions can be made irredundant by deleting redundant components (A finite primary decomposition can be stripped of redundant components).
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
The submodule has the empty primary decomposition, whose intersection is interpreted as .
By [L1], the module is Noetherian. Suppose, toward contradiction, that some submodule of has no finite primary decomposition. Let be the set of such submodules. By step 1.1, . By [L2], choose a maximal element of ; then .
The submodule is irreducible. Indeed, if with and , then the maximality of in step 2.1 forces finite primary decompositions of and . Intersecting those two finite decompositions gives a finite primary decomposition of , contrary to .
Because is irreducible and proper and is Noetherian, [L3] shows that is primary. But a primary submodule is already a one-term finite primary decomposition, again contradicting . Therefore is empty: every submodule of has a finite primary decomposition.
If , the empty decomposition from step 1.1 is irredundant and has pairwise distinct radicals vacuously, so it is minimal. If , 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.
Taking recovers the ideal case, because ideals are precisely the submodules of the regular module over a commutative ring.
Depends on
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Finitely generated modules over a left Noetherian ring are Noetherian
- Finite generation, ACC, and maximal-condition characterizations of Noetherian modules
- An irreducible submodule of a Noetherian module is primary
- A finite primary decomposition can be stripped of redundant components
- Equal-radical primary components can be combined
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
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Theorem (18.21) (standard reference, not scraped)
- J. S. Milne, A Primer of Commutative Algebra, v4.03, Theorem 19.11 (standard reference, not scraped)