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.
Noetherian and Artinian conditions are each exact in short exact sequences
Statement
In a short exact sequence , the module is Noetherian if and only if and are Noetherian; the same equivalence holds with “Artinian” in place of “Noetherian”. See Noetherian modules: every submodule is finitely generated.
Facts & Assumptions
Given: A short exact sequence of left -modules.
Noetherian means that every submodule is finitely generated (Noetherian modules: every submodule is finitely generated). Artinian means that every descending sequence of submodules stabilizes (Artinian modules by the descending chain condition).
The submodule generated by a set is the smallest submodule containing it; finitely generated means generated by a finite set (Generated submodule, cyclic and finitely generated modules, module basis and free module).
Exactness gives injective , surjective , and (Exact sequences and short exact sequences of modules).
Finitely many nonempty fibres admit a choice of representatives in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
Proof
Identify with using the injective homomorphism in [F3]. The generated submodule of a finite set is precisely its finite linear combinations: these combinations form a submodule containing the set, and every submodule containing it contains all such combinations. This follows from [F2] and the module laws. Thus homomorphisms carry finite generating sets to generating sets of their images.
Suppose is Noetherian. Every submodule of is a submodule of , hence finitely generated. If , its preimage is a submodule of and has finite generators; their images generate because is surjective. Consequently and are Noetherian.
Conversely suppose and are Noetherian, and let . Choose finite generators of and of . By [L1], lift the finitely many to . For , write . Then belongs to , so is a linear combination of the . Thus the and generate . Empty generating lists cause no change to this argument. Since was arbitrary, is Noetherian, without any countable or dependent choice.
Suppose is Artinian. A descending chain of submodules of is one in , hence stabilizes. A descending chain in lifts to the descending chain in ; after it stabilizes, its images stabilize by surjectivity. Thus and are Artinian.
Conversely suppose and are Artinian and is a descending chain in . The chains and stabilize. Take an index beyond both stabilization indices. For and , equality of images gives with . Then , so . Hence for all , and is Artinian.
Steps 2.1 and 2.2 prove the Noetherian equivalence, and steps 2.3 and 2.4 prove the Artinian equivalence.
Depends on
- Noetherian modules: every submodule is finitely generated
- Artinian modules by the descending chain condition
- Generated submodule, cyclic and finitely generated modules, module basis and free module
- Exact sequences and short exact sequences of modules
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
Used by
- Finite direct sums preserve and reflect Noetherian and Artinian conditions Corollary
- An irreducible submodule of a Noetherian module is primary Lemma
- A module has a composition series if and only if it is Noetherian and Artinian, the converse using dependent choice Theorem
- Every commutative Artinian ring is Noetherian Theorem
- Finitely generated modules over a left Noetherian ring are Noetherian Theorem
Dependency tree · two levels
15 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
- The Stacks Project, Lemma 10.5.3, finite-generation extension argument (standard reference, not scraped)
- William Crawley-Boevey, Noncommutative Algebra, Chapter 1 Sections 1.1-1.9 (standard reference, not scraped)