Homomorphisms Between Finitely Generated Abelian Groups (Pt. II)
Point of Post: This is a continuation of this post.
The next step is to figure out how Hom works between finite and infinite cyclic groups. In particular we have the following two little theorems:
Theorem: Let be a finite abelian group then , in particular for all .
Proof: We merely note that if is a -map then has finite order for each , but the only elements of of finite order are and so for all . The conclusion follows.
Now, for the other direction we just recall the more general result that for commutative untial left -modules one has that . From this we get the following:
Theorem: For any one has that .
Thus, with all these results we are finally able to state the following theorem quite unequivocally:
Theorem: Let and . Then if
Proof: By the functorality of Hom it suffices to prove this for when equal the groups they’re isomorphic to. So, from there it’s just pure computation using the three theorems we’ve developed to take into account all the permutations we get. So, expanding we get
from where the conclusion follows.
So, what allows us to make the jump from this theorem to finding the homomorphism group between any two finitely generated abelian groups? Well, it all is a matter of perspective. Realistically, this doesn’t quite give us a algorithmic way to find the homomorphism group–it isn’t a formula that we can just take two finitely generated abelian groups and spit this out. No. But, theoretically this does answer the pertinent question. Indeed, the structure theorem tells us that every finitely generated abelian group fits into the hypothesis criteria of this past theorem–being isomorphic to a finite product of cyclic groups.
 Dummit, David Steven., and Richard M. Foote. Abstract Algebra. Hoboken, NJ: Wiley, 2004. Print.
 Rotman, Joseph J. Advanced Modern Algebra. Providence, RI: American Mathematical Society, 2010. Print.
 Blyth, T. S. Module Theory. Clarendon, 1990. Print
No comments yet.