Free abelian groups
Free abelian groups are obtained by stating the universal property for free groups in the category .
Definition 103.1.
7b7f4aGiven a non-empty set and a map into an abelian group , the pair is said to be a free abelian group on the set if, for any function to any abelian group , there is a unique homomorphism such that . When is an inclusion, we call the unique extension of to .
Let’s first tackle the finite case. Denote by the direct sum
Recall that this group is the same as the product (however, it will be playing the role of a coproduct in what follows).
Proposition 103.2.
ae5ef6For , is a free abelian group on , where (the is in the th coordinate).
Proof.
Let be given. For , let be defined by . Let be the coproduct injections. Then, by the universal property of coproducts, there exists a unique map such that for all .
□
Now, let be any set. Recall that has a natural abelian group structure if is an abelian group; elements of are arbitrary set-functions . Recall that in the general (non-finite) case, the coproduct is the subgroup of the product consisting of tuples with finite support.
Thus, the coproduct , which we will denote by , is given by
For the coproduct injections are obtained by mapping to the function defined by
Proposition 103.3.
4898a7For every set , is free abelian on .
Proof.
Same as that of Prp 2; just use the universal property of coproducts.□
Proposition 103.4.
b623d8
- If , then .
- If , then .
Thus, is free abelian of rank iff it is isomorphic to . We can now call as the free abelian group of rank .
Proof.
The Invariant Factor Theorem
The key theorem is that a subgroup of a free abelian group is free abelian of rank not exceeding that of the bigger group.
Theorem 103.5.
4973deIf is a subgroup of a free abelian group of rank , then is free abelian of rank . Further, there exist bases of and of respectively where divides for . The integers are uniquely determined up to sign and are called the invariant factors of .
Proof.
The proof is carried out by induction on using the division algorithm as follows. It is clear for . Assume and that the theorem holds for . Corresponding to any basis for , there is a positive integer with the property that it is the smallest positive integer that occurs as a coefficient in the expression of elements of in terms of this basis. Let be the smallest such integer with respect to all bases of . Let be a corresponding basis for and be the element such that
Writing with , we get
Let . Observe that is a basis of . By the minimality of , we must have for all , and we have .
Consider the subset of whose elements have coefficient of to be zero when written in terms of the basis . Clearly, is a subgroup of and . Also, if , we can write . If with , we have
Since , by the minimality of . Thus, every can be expressed in the from
It follows that .
Now, is contained in the subgroup . By the induction hypothesis, has a basis and there exists such that has a basis of the form with . Clearly, therefore, itself has rank and is a basis for . We only have to show that .
Once again, write with and notice that . Since is a basis for , is forced to be zero by the minimality of , i.e, .□
Corollary 103.6(Structure theorem for finitely generated abelian groups).
A finitely generated abelian group is isomorphic to for some and dividing . The integer as well as all the ‘s (up to sign) are uniquely determined.
Proof.