finitely generated modules over a principal ideal domain


\PMlinkescapephrase

generated by \PMlinkescapephrasegenerating set

Let R be a principal ideal domainMathworldPlanetmath and let M be a finitely generatedMathworldPlanetmathPlanetmath R- module.

Lemma.

Let M be a submoduleMathworldPlanetmath of the R-module Rn. Then M is free and finitely generated by s≤n elements.

Proof.

For n=1 this is clear, since M is an ideal of R and is generated by some element a∈R. Now suppose that the statement is true for all submodules of Rm,1≤m≤n-1.

For a submodule M of Rn we define f:M→R by (k1,…,kn)↦k1. The image of f is an ideal ℑ in R. If ℑ={0}, then M⊆ker⁡(f)=(0)×Rn-1. Otherwise, ℑ=(g),g≠0. In the first case, elements of ker⁡(f) can be bijectively mapped to Rn-1 by the function ker⁡(f)→Rn-1 given by (0,k1,…,kn-1)↦(k1,…,kn-1); so the image of M under this mapping is a submodule of Rn-1, which by the induction hypothesis is finitely generated and free.

Now let x∈M such that f⁢(x)=g⁢h and y∈M with f⁢(y)=g. Then f⁢(x-h⁢y)=f⁢(x)-f⁢(h⁢y)=0, which is equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath to x-h⁢y∈ker⁡(f)∩Rn:=N which is isomorphicPlanetmathPlanetmathPlanetmath to a submodule of Rn-1. This shows that R⁢x+N=M.

Let {g1,…,gs} be a basis of N. By assumptionPlanetmathPlanetmath, s≤n-1. We’ll show that {x,g1,…,gs} is linearly independentMathworldPlanetmath. So let r⁢x+∑i=1sri⁢gi=0. The first componentMathworldPlanetmathPlanetmath of the gi are 0, so the first component of r⁢x must also be 0. Since f⁢(x) is a multiple of g≠0 and 0=r⋅f⁢(x), then r=0. Since {g1,…,gs} are linearly independent, {x,g1,…,gs} is a generating set of M with s+1≤n elements. ∎

Corollary.

If M is a finitely generated R-module over a PID generated by s elements and N is a submodule of M, then N can be generated by s or fewer elements.

Proof.

Let {g1,…,gs} be a generating set of M and f:Rs→M, (r1,…,rs)↦∑i=1sri⁢gi. Then the inverse imagePlanetmathPlanetmath N′ of N is a submodule of Rs, and according to lemma Lemma. can be generated by s or fewer elements. Let n1,…,nt be a generating set of n′; then t≤s, and since f is surjectivePlanetmathPlanetmath, f⁢(n1),…,f⁢(nt) is a generating set of N. ∎

Theorem.

Let M be a finitely generated module over a principal ideal domain R.

(I)

Note that M/tor⁡(M) is torsion-free, that is, tor⁡(M/tor⁡(M))={0}. In particular, if M is torsion-free, then M is free.

(II)

Let tor⁡(M) be a proper submodule of M. Then there exists a finitely generated free submodule F of M such that M=F⊕tor⁡(M).

Proof of (I): Let T=tor⁡(M). For m∈M, m¯ denotes the coset modulo T generated by m. Let m be a torsion element of M/T, so there exists α∈R∖{0} such that α⋅m¯=0, which means α⋅m¯⊆T. But then α⋅m is a member of T, and this implies that M/T has no non-zero torsion elements (which is obvious if M=tor⁡(M)).

Now let M be a finitely generated torsion-free R-module. Choose a maximal linearly independent subset S of M, and let F be the submodule of M generated by S. Let {m1,…,mn} be a set of generatorsPlanetmathPlanetmathPlanetmath of M. For each i=1,…,n there is a non-zero ri∈R such that ri⋅mi∈F. Put r=∏i=1nri. Then r is non-zero, and we have r⋅mi∈F for each i=1,…,n. As M is torsion-free, the multiplication by r is injectivePlanetmathPlanetmath, so M≅r⋅M⊆F. So M is isomorphic to a submodule of a free moduleMathworldPlanetmathPlanetmath, and is therefore free.

Proof of (II): Let π:M→M/T be defined by a↦a+T. Then π is surjective, so m1,…,mt∈M can be chosen such that π⁢(mi)=ni, where the ni’s are a basis of M/T. If 0M=∑i=1tai⁢mi, then 0n=∑i=1tai⁢ni. Since n1,…,nt are linearly independent in N it follows 0=a1=…=at. So the submodule spanned by m1,…,mt of M is free.

Now let m be some element of M and π⁢(m)=∑i=1tai⁢ni. This is equivalent to m-(∑i=1tai⁢ni)∈ker⁡(π)=T. Hence, any m∈M is a sum of the form f+t, for some f∈F and t∈T. Since F is torsion-free, F∩T={0}, and it follows that M=F⊕T.

Title finitely generated modules over a principal ideal domain
Canonical name FinitelyGeneratedModulesOverAPrincipalIdealDomain
Date of creation 2013-03-22 13:55:22
Last modified on 2013-03-22 13:55:22
Owner yark (2760)
Last modified by yark (2760)
Numerical id 21
Author yark (2760)
Entry type Topic
Classification msc 13E15