]> Group Theory - Finitely Generated Abelian Groups

Finitely Generated Abelian Groups

Consider an abelian group A generated by m elements

A=a 1 ,...,a m

Then the free abelian group of rank m

F=u 1 ,...,u m

maps homomorphically onto A via the map that sends u i to a i. By the first isomorphism theorem we have AF/R for some subgroup R of F. Pick a basis v 1 ,...,v m of F such that R=h 1 v 1 ,...,h qv q where h ih i+1 , h i1 , qm.

Consider the case where m=1 . There are three possibilities. (1) R=v, so F/R is the trivial group, (2) R=hv, in which case F/R= h, and (3) R={0 } and we have F/R=F.

More generally, we have:

Theorem: Every finitely generated abelian group can be expressed as the direct sum of cyclic groups

A= n h 1 ... h n

where h ih i+1 .

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 r is called the rank of A. The orders of the cyclic groups h 1 ,...,h n are called the invariants of A. Note A is finite if and only if its rank is zero.

Theorem: Suppose A is a finitely generated abelian group with decompositions

A= r e 1 ... e n A= s d 1 ... d m

satifying e ie i+1 ,d id i+1 . Then r=s,n=m,e i=d i.

Proof: Let T be the set of elements of A of finite order. Clearly if g,h have finite order then ord(g)ord(h)(hk)=0 hence hk also has finite order hence T is a subgroup of A. It is called the torsion group of A.

A little thought shows that we must have

T= e 1 ... e n T= d 1 ... d m

Consider the map that projects A onto r. By the first isomorphism theorem we have that A/T r. Similarly we have A/T s hence r=s.

Now conisder T. Let p be a prime, and let P be the set of elements whose order is a power of P. Then P is a group. We first need the following:

Theorem: Let G be a finite abelian group of order p 1 a 1 p 2 a 2 ... where the p i's are distinct primes. Then G=P 1 P 2 ... where P i is the subgroup of elements whose orders are powers of p i.

Proof: Let xG be an element of order p 1 αf 1 where f 1 ,p 1 are coprime. Then we may write x=a 1 +x 1 where a 1 has order p 1 α and x 1 has order f 1 . (Simply take a 1 =uf 1 x,x 1 =vp 1 αx where uf 1 +vp 1 α=1 .)

Iterating this procedure gives a decomposition x=a 1 +a 2 +... with a iP i. We claim this decomposition is unique. Suppose 0 =b 1 +b 2 +... where b iP i. Then for all i, subtracting b i from both sides shows that the order of b i is coprime to p i. But it must also be a power of p i which is only possible if b i=0 .

It is clear that the groups P i are uniquely determined. In fact, they are the Sylow groups since G is abelian.

In particular, if x is an element of order n=p 1 a 1 p 2 a 2 ... then we have

x=(n/p 1 a 1 )x(n/p 2 a 2 )x...

Now let

e 1 =p 1 a 1 p 2 a 2 ...,e 2 =p 1 b 1 p 2 b 2 ...,...

where a ib i... for all i since e ie i+1 . Then we have

T=P 1 P 2 ...Q 1 Q 2 ...

where P 1 ,P 2 ,...,Q 1 ,Q 2 ,... are cyclic groups of order p 1 a 1 ,p 1 b 1 ,...,p 2 a 2 ,p 2 b 2 ,.... We see that the Sylow groups of T are P=P 1 P 2 ...,Q=Q 1 Q 2 .... Now we need the following:

Lemma: Let G be any group. Suppose x,yG commute and have relatively prime orders m,n. Then

x,y=xy

is cyclic of order mn.

Proof: We know the order is at most mn since each element must be of the form x ay b for a=0 ,...,m1 ,b=0 ,...,n1 . Now suppose (xy) t=1 . Then 1 =(xy) tm=y tm implying that ntm. Since m,n is coprime we have nt. Similarly mt, thus the group order must be exactly mn.

Thus given

T=P 1 P 2 ...Q 1 Q 2 ...

we deduce that

T= e 1 ... e n

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 A be an abelian group of order p a where p is prime. Suppose

A = u 1 ...u k A = v 1 ...v l

where u 1 ,...,u k have orders p f 1 ...p f k>1 , and v 1 ,...,v v have orders p g 1 ...p g l>1 . Then k=l and f i=g i for i=1 ,...,k.

Proof: Note we must have a=f 1 +...+f k=g 1 +...+g l. The theorem is trivial when a=1 , which we use to start an induction.

Let A p be the set of elements xA with px=0 . Then A p is a subgroup. We have

A p = p f 1 1 u 1 ...p f k1 u k A p = p g 1 1 v 1 ...p g l1 v l

Hence A p= p k= p l implying that k=l.

Now consider the set A p of elements px for all xA (the multiples of p). Then A p is a subgroup, and is generated by pu 1 ,...,pu k and also by pv 1 ,...,pv k. But in general these are not bases for A p since we might have pu i=0 for example. So find κ such that f 1 ,...,f κ2 and f κ+1 =...=f k=1 , and similarly find λ with g 1 ,...,g λ2 and g λ+1 =...=g k=1 .

This yields the decompositions

A p=pu 1 +...+pu κ=pv 1 +...+pv λ

By inductive hypothesis we have κ=λ and f i1 =g i1 for all i=1 ,...,κ.

We have now proved the main theorem.

In the last proof, the numbers p f 1 ,...,p f k are called the elementary divisors of A corresponding to p. A is said to be of type (f 1 ,...,f k).

Example: Suppose an abelian group A is generated by a,b subject to the relations 30 a=12 b=0 . Then define the free abelian groups F=x,y and R=30 x,12 y. Note we have AF/R= 30 12 . Then we have

A 2 3 5 4 3 ( 4 2 )( 3 3 ) 5

Thus the elementary divisors for 2,3,5 are (4,2 ),(3,3 ),5 . Rearranging gives A 60 6 , so the invariants are 60 ,6 .

Example: Suppose an abelian group A is generated by a,b,c,d and the relations 3 a+9 b3 c=0 ,4 a+2 b2 d=0 . Then define the free abelian groups F=x,y,z,t and R=3 u,2 v where u=x+3 yz,v=2 x+yt. Note x,y,u,v is also a basis of F. Thus

AF/R 3 2 6