Finitely Generated Abelian Groups

  • Thread starter Thread starter Combinatorics
  • Start date Start date
  • Tags Tags
    Groups
Combinatorics
Messages
31
Reaction score
5

Homework Statement



Let p be prime and let b_1 ,...,b_k be non-negative integers. Show that if :
G \simeq (\mathbb{Z} / p )^{b_1} \oplus ... \oplus (\mathbb{Z} / p^k ) ^ {b_k}
then the integers b_i are uniquely determined by G . (Hint: consider the kernel of the homomorphism f_i :G \to G that is multiplication by p^i . Show that f_1 , f_2 determine b_1.
Proceed similarly )


Homework Equations


The question, together with the theorem it should help me prove is attached (this question should help me prove the uniqueness part of the theorem)

The Attempt at a Solution


I've tried using the hint, and considering the homomorphism f_1 : G \to G that is defined by f_1 (x ) = px . Its kernel is ker f_1 = (\mathbb{Z}_p ) ^{b_1} \bigoplus (\mathbb{Z}_p) ^ {b_2} ....
But how does it help me? Am I right in my calculation of the kernel? Hope someone will be able to help me

Thanks in advance !
 

Attachments

  • DSC00042.JPG
    DSC00042.JPG
    31 KB · Views: 525
  • DSC00043.JPG
    DSC00043.JPG
    36.4 KB · Views: 533
Physics news on Phys.org


The hint is essentially leading you to consider a proof by induction on k. Notice that $$ \ker f_1 = (\mathbb Z/p)^{b_1} \oplus (\mathbb Z/p)^{b_2} \oplus (\mathbb Z/p^2)^{b_3} \oplus \cdots = (\mathbb Z/p)^{b_1+b_2} \oplus (\mathbb Z/p^2)^{b_3} \oplus \cdots. $$
 


morphism said:
The hint is essentially leading you to consider a proof by induction on k. Notice that $$ \ker f_1 = (\mathbb Z/p)^{b_1} \oplus (\mathbb Z/p)^{b_2} \oplus (\mathbb Z/p^2)^{b_3} \oplus \cdots = (\mathbb Z/p)^{b_1+b_2} \oplus (\mathbb Z/p^2)^{b_3} \oplus \cdots. $$

Can you please explain how did you get that this is the kernel?

Thanks a lot !
 


Well, if px=0 mod p^i, then p^i divides px, hence p^{i-1} divides x, i.e. x=0 mod p^i.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top