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 generation, ACC, and maximal-condition characterizations of Noetherian modules
Statement
For a left -module , consider:
- Every submodule is finitely generated: is Noetherian (Noetherian modules: every submodule is finitely generated).
- Every ascending sequence of submodules eventually stabilizes (ACC).
- Every nonempty set of submodules has a maximal member under inclusion.
The implications and are choice-free. Assuming Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain), also holds, so all three conditions are equivalent.
Facts & Assumptions
Given: A left -module and conditions 1–3 above. Dependent Choice is assumed only for .
Finite generation means generation by a finite set; the generated submodule is the smallest submodule containing that set (Noetherian modules: every submodule is finitely generated, Generated submodule, cyclic and finitely generated modules, module basis and free module).
A nonempty subset is a submodule if it is closed under for scalars and its elements (The one-step submodule criterion; intersections and sums of submodules are submodules).
Under DC, every entire relation on a nonempty set admits a function from following the relation from a prescribed starting point (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Proof
Assume condition 1 and let be ascending. The union contains zero. Any two of its elements lie in a common stage, so their combination lies there too. Thus is a submodule by [L2]. By condition 1, has a finite generating set . A finite subset of this ascending union lies in one stage: start with stage zero for the empty set, and when adjoining one element take the larger of the previous stage and a stage containing that element. Hence for some , so . For , . This proves condition 2 without countably many choices.
Assume condition 2 and DC. Let be a nonempty set of submodules. If it has no maximal member, the relation defined by is entire on . Fix . By [L3] there is a sequence in with for every , contrary to condition 2. Thus has a maximal member, proving condition 3.
Assume condition 3 and fix a submodule . Its finitely generated submodules form a set containing the zero submodule, generated by the empty set. Condition 3 gives a maximal . Fix a finite generating set of . If , an element makes a finitely generated submodule of strictly containing , a contradiction. Hence , proving condition 1 without DC.
Steps 1.1, 1.2 and 1.3 prove the stated implications. Only step 1.2 uses DC.
Depends on
- Noetherian modules: every submodule is finitely generated
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Generated submodule, cyclic and finitely generated modules, module basis and free module
- The one-step submodule criterion; intersections and sums of submodules are submodules
Used by
- Every principal ideal domain is Noetherian Corollary
- Every surjective endomorphism of a Noetherian module is injective Corollary
- An irreducible submodule of a Noetherian module is primary Lemma
- finite local modules admit minimal free resolutions Lemma
- Conventions for this development and where dependent choice and Zorn's lemma are used Remark
- A commutative ring is Noetherian exactly when every ideal is finitely generated, exactly when its ideals satisfy the ascending chain condition, and exactly when every nonempty set of ideals has a maximal member Theorem
- A module has a composition series if and only if it is Noetherian and Artinian, the converse using dependent choice Theorem
- Every principal ideal domain is a unique factorisation domain Theorem
- Every submodule of a finite module over a Noetherian ring has a minimal primary decomposition Theorem
- Finite modules over Noetherian rings admit prime filtrations Theorem
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
- Keith Conrad, Noetherian Modules, Sections 1-2 (standard reference, not scraped)