Proving H is Cyclic: Finite Abelian Group

curiousmuch
Messages
7
Reaction score
0

Homework Statement


Let H be a finite abelian group that has one subgroup of order d for every positive divisor d of the order of H. Prove that H is cyclic

Homework Equations


We want to show H={a^n|n is an integer}
 
Last edited:
Physics news on Phys.org
I haven't done this stuff in a while but since no one is helping I'll give it a shot.

Assume not. Then by Fundamental theorem of finitely generated abelian groups, H is isomorphic to Z_a x Z_b. Since, by assumption, H is not cyclic, it follows that Z_a x Z_b is not cyclic. This implies that a and b are not relatively prime. Which implies that there exists some prime p that divides both a and b. Perhaps apply Cauchy's theorem here.
 
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