Work with the usual commutative unital Noetherian ring convention. First prove that every submodule of is a finitely generated module. For , a submodule is an ideal, hence finitely generated by Noetherianity. For the induction step, project a submodule onto its last coordinate. Its image is a finitely generated ideal; choose lifts in of its generators. The projection kernel lies in and is finitely generated by induction. The kernel generators together with the chosen lifts generate , since subtracting a combination of the lifts leaves an element of the kernel.
Now choose a surjection from a finite generating set of the module . For any submodule , its inverse image in is finitely generated by the result just proved. The images of those generators generate .
Every submodule of is finitely generated. In particular is a Noetherian module: the union of an ascending chain is a submodule, and its finite generators all belong to a single member of the chain, forcing eventual stabilization.
Let be maximal among annihilators of nonzero elements of . It is a proper ideal, since . Suppose and . Then andThe inclusion holds because every satisfies . Maximality in the stated set forces , so . This proves the defining implication for a prime ideal:This is a maximal annihilator of a module element is prime argument. Maximality among element annihilators is sufficient; need not be a maximal ideal of .
If , take the empty filtration. Otherwise a nonzero quotient is a finitely generated module. Because has the ascending chain condition on ideals, the nonempty collection of annihilators of nonzero elements of has a maximal element. Part (b), applied to , supplies with a prime ideal .
The map , , is surjective with kernel . The first isomorphism theorem gives . Let be the inverse image of under . ThenRepeat whenever the quotient remains nonzero. An infinite repetition would give a strictly ascending chain of submodules of the Noetherian module , contradicting part (a). Thus the process stops after finitely many steps, necessarily at .
Articles by others on the same topic
There are currently no matching articles.