Equivalence of prime power decompositions

ehrenfest
Messages
2,001
Reaction score
1

Homework Statement


Let G be a finitely generated abelian group and let T_p be the subgroup of all elements having order some power of a prime p. Suppose



T_p \simeq \mathbb{Z}_{p^{r_1}} \times \mathbb{Z}_{p^{r_2}} \times \cdots \times \mathbb{Z}_{p^{r_m }} \simeq \mathbb{Z}_{p^{s_1}} \times \mathbb{Z}_{p^{s_2}} \times \cdots \times \mathbb{Z}_{p^{s_m }

where 1 \leq r_1 \leq \cdots \leq r_m and similarly for the s_i.

Prove that n = m and s_i = r_i for all i. Hint: first prove r_1 = s_1 and then use induction.



Homework Equations





The Attempt at a Solution


I can prove that n = m.

Let phi be the isomorphism from the middle group to the right hand group in the line above. Under phi, the generator of \mathbb{Z}_{p^{r_1}} needs to generate a copy of \mathbb{Z}_{p^{r_1}} in the group on the RHS and similarly the generator of \mathbb{Z}_{p^{s_1}} needs to generate a copy of that group under phi^{-1}, but that doesn't really prove that r_1 = s_1. How can you really use the fact that r_i and s_i are minimal? How can you say anything about the factorization just knowing that e.g the right hand group contains a copy of \mathbb{Z}_{p^{r_1}}?
 
Physics news on Phys.org
anyone?
 
please?
 
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...
Back
Top