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.
An irreducible submodule of a Noetherian module is primary
Statement
Let be a commutative ring, let be a Noetherian left -module, and let be irreducible, meaning that whenever
with submodules , then or . Then is primary.
Facts & Assumptions
Given: A commutative ring , a Noetherian left -module , and an irreducible proper submodule .
In a short exact sequence, a quotient of a Noetherian module is again Noetherian (Noetherian and Artinian conditions are each exact in short exact sequences).
The quotient module is formed from the cosets of (Quotient module with scalar multiplication on additive cosets).
A proper submodule is primary exactly when the classical power condition of the previous lemma holds (Primary submodules are exactly quotients with nilpotent zero divisors).
Proof
Let . By [L1], the quotient module is Noetherian. The submodule is irreducible: if in , then taking inverse images in gives with , so the irreducibility of forces or , hence or .
Let be a zero divisor on . Then . Because is Noetherian, the ascending chain stabilizes; choose with . If , write . Then , so and hence . Therefore , and
Since is nonzero, the irreducibility of and the decomposition in step 2.1 force . Thus every zero divisor on acts nilpotently on . By [L3], this means is primary.
Hence every irreducible submodule of a Noetherian module is primary.
Depends on
Used by
Dependency tree · two levels
14 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
- J. S. Milne, A Primer of Commutative Algebra, v4.03, Theorem 19.18 (standard reference, not scraped)
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., proof of Theorem (18.21) (standard reference, not scraped)