Is every Subgroup of a Cyclic Group itself Cyclic?

Click For Summary
SUMMARY

All subgroups of a cyclic group are indeed cyclic. A cyclic group G is defined by the existence of an element g such that the entire group can be generated by powers of g. The discussion demonstrates that for any subgroup H of G, every element can be expressed as g raised to some integer power. By identifying the element of H with the smallest positive exponent, it can be shown that this element generates the entire subgroup H, confirming its cyclic nature.

PREREQUISITES
  • Cyclic group theory
  • Understanding of subgroup properties
  • Knowledge of group generators
  • Familiarity with the pigeonhole principle
NEXT STEPS
  • Study the properties of cyclic groups in abstract algebra
  • Learn about group generators and their significance
  • Explore the relationship between subgroup orders and group orders
  • Investigate the implications of the pigeonhole principle in group theory
USEFUL FOR

Mathematics students, particularly those studying abstract algebra, and educators looking to deepen their understanding of group theory concepts.

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!
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
3
Views
2K
Replies
5
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K