Is every Subgroup of a Cyclic Group itself Cyclic?

robertjordan
Messages
71
Reaction score
0

Homework Statement



Are all subgroups of a cyclic group cyclic themselves?

Homework Equations



G being cyclic means there exists an element g in G such that <g>=G, meaning we can obtain the whole group G by raising g to powers.

The Attempt at a Solution



Let's look at an arbitrary subgroup H= {e, gk_1, gk_2, ... , gk_n}

We know since subgroups are closed that (gk_i)t is in H for all integers t, and for all i between 1 and n.

So unless gk_1, gk_2,... all have order 1 (which would mean H ={e}), then by the pidgeonhole principle, we have (gk_i)x = (gk_j)y
for some i,j and some 0<x<ord(gk_i), 0<y<ord(gk_2).

WLOG let's say y<x. Then x=yq+r. This implies (gk_i)r=(gk_j).







... I'm stuck :frown:
 
Physics news on Phys.org
Hint: if ##H## is a subgroup of ##G##, then of course all of its elements are of the form ##g^k##. Consider the element of ##H## with the smallest positive exponent. Can you show that it generates ##H##?
 
jbunniii said:
Hint: if ##H## is a subgroup of ##G##, then of course all of its elements are of the form ##g^k##. Consider the element of ##H## with the smallest positive exponent. Can you show that it generates ##H##?

Assume BWOC that g^k doesn't generate H. Then there is an element g^t in H such that k doesn't divide t. But that means t=kq+r where r<k. Which means g^r is in the H but that contradicts k being the smallest power of g in H.



Thanks!
 
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