Abelian groups of order 70 are cyclic

  • Thread starter Thread starter redone632
  • Start date Start date
  • Tags Tags
    Cyclic Groups
redone632
Messages
14
Reaction score
0

Homework Statement


Show that every abelian group of order 70 is cyclic.

Homework Equations


Cannot use the Fundamental Theorem of Finite Abelian Groups.

The Attempt at a Solution


I've tried to prove the contrapositive and suppose that it is not cyclic then it cannot be abelian. But that has lead no where quickly.

Something tells me that I need to use the fact that 2*5*7 = 70 and 2 5 7 are all primes. But nothing is clicking. We haven't done the Fundamental Theorem of Finite Abelian Groups so there must be a way to prove this without it. If someone can point me in the right direction that would help a lot!
 
Last edited:
Physics news on Phys.org
Use Cauchy's theorem with your three primes.
 
Dick said:
Use Cauchy's theorem with your three primes.

Hmmm I think I got it. I just want to make sure it's right.

Since 2, 5, 7 are primes that divide 70. Then by Cauchy's Theorem there must be an elements of order 2, 5, 7 say, a, b, c respectively. Since G is abelian, then every subgroup must be normal. Therefore, the subgroups generated a, b, c are distinct and normal. G is then the internal direct product <a> \times <b> \times <c>. Then by a theorem, G is isomorphic to <a> \oplus <b> \oplus <c>. As |a|, |b|, |c| are relatively prime, <a> \oplus <b> \oplus <c> is cyclic. Therefore G is cyclic.
 
Last edited:
redone632 said:
Hmmm I think I got it. I just want to make sure it's right.

Since 2, 5, 7 are primes that divide 70. Then by Cauchy's Theorem there must be an elements of order 2, 5, 7 say, a, b, c respectively. Since G is abelian, then every subgroup must be normal. Therefore, the subgroups generated a, b, c are distinct and normal. G is then the internal direct product <a> \times <b> \times <c>. Then by a theorem, G is isomorphic to <a> \oplus <b> \oplus <c>. As |a|, |b|, |c| are relatively prime, <a> \oplus <b> \oplus <c> is cyclic. Therefore G is cyclic.

Sure. Or you could just take the direct approach and argue that the element abc must have order 70.
 
Dick said:
Sure. Or you could just take the direct approach and argue that the element abc must have order 70.

Awesome. Thanks!
 
There are two groups of order 21, even though it's isomorphic to the direct product of the Cyclic Group of Order 3 and the Cyclic Group of order 7. 3 and 7 are co-prime.

EDIT: Nevermind, didn't read the "abelian" in the problem. Your proof is good.
 
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