Finitely Generated Abelian Groups
Consider an abelian group generated by elements
Then the free abelian group of rank
maps homomorphically onto via the map that sends to . By the first isomorphism theorem we have for some subgroup of . Pick a basis of such that where , , .
Consider the case where . There are three possibilities. (1) , so is the trivial group, (2) , in which case , and (3) and we have .
More generally, we have:
Theorem: Every finitely generated abelian group can be expressed as the direct sum of cyclic groups
where .
Corollary: A finitely generated abelian group is free if and only if it is torsion-free, that is, it contains no element of finite order other than the identity.
The number is called the rank of . The orders of the cyclic groups are called the invariants of . Note is finite if and only if its rank is zero.
Theorem: Suppose is a finitely generated abelian group with decompositions
satifying . Then .
Proof: Let be the set of elements of of finite order. Clearly if have finite order then hence also has finite order hence is a subgroup of . It is called the torsion group of .
A little thought shows that we must have
Consider the map that projects onto . By the first isomorphism theorem we have that . Similarly we have hence .
Now conisder . Let be a prime, and let be the set of elements whose order is a power of . Then is a group. We first need the following:
Theorem: Let be a finite abelian group of order where the 's are distinct primes. Then where is the subgroup of elements whose orders are powers of .
Proof: Let be an element of order where are coprime. Then we may write where has order and has order . (Simply take where .)
Iterating this procedure gives a decomposition with . We claim this decomposition is unique. Suppose where . Then for all , subtracting from both sides shows that the order of is coprime to . But it must also be a power of which is only possible if .
It is clear that the groups are uniquely determined. In fact, they are the Sylow groups since is abelian.
In particular, if is an element of order then we have
Now let
where for all since . Then we have
where are cyclic groups of order . We see that the Sylow groups of are . Now we need the following:
Lemma: Let be any group. Suppose commute and have relatively prime orders . Then
is cyclic of order .
Proof: We know the order is at most since each element must be of the form for . Now suppose . Then implying that . Since is coprime we have . Similarly , thus the group order must be exactly .
Thus given
we deduce that
so that one decomposition implies the other. We are done as soon as we show that the Sylow groups have a unique decomposition:
Theorem: Let be an abelian group of order where is prime. Suppose
where have orders , and have orders . Then and for .
Proof: Note we must have . The theorem is trivial when , which we use to start an induction.
Let be the set of elements with . Then is a subgroup. We have
Hence implying that .
Now consider the set of elements for all (the multiples of ). Then is a subgroup, and is generated by and also by . But in general these are not bases for since we might have for example. So find such that and , and similarly find with and .
This yields the decompositions
By inductive hypothesis we have and for all .
We have now proved the main theorem.
In the last proof, the numbers are called the elementary divisors of corresponding to . is said to be of type .
Example: Suppose an abelian group is generated by subject to the relations . Then define the free abelian groups and . Note we have . Then we have
Thus the elementary divisors for 2,3,5 are . Rearranging gives , so the invariants are .
Example: Suppose an abelian group is generated by and the relations . Then define the free abelian groups and where . Note is also a basis of . Thus