Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Homework Help: Cosets and cyclic groups

  1. May 1, 2010 #1
    1. The problem statement, all variables and given/known data

    Consider the cyclic group Cn = <g> of order n and let H=<gm> where m|n.

    How many distinct H cosets are there? Describe these cosets explicitly.

    2. Relevant equations

    Lagrange's Theorem: |G| = |H| x number of distinct H cosets

    3. The attempt at a solution

    |G| = n
    I'm unsure if I have interpreted H correctly, I think it is the cyclic group generated by gm so contains gmk for integers k. I don't know how I can work out the order of H from this, or how to describe the cosets.
     
  2. jcsd
  3. May 1, 2010 #2
    Fine so far. When will gmk=gmk' for different integers k, k'?
     
  4. May 1, 2010 #3
    Would it be when k' is a multiple of k?
     
  5. May 1, 2010 #4
    No. If you have a cyclic group (g) of order 20, and H=(g2) then the values g2x0, g2x1, g2x2, ... g2x9 will all be different, then you start again. Here m is 2 and k goes from 0 to 9, but for instance 1 divides each value of k, and 2 divides 4, but g2 is not the same as g4,g 6,g8 etc. and g2x2=g4 is not the same as g2x4=g8.

    How would you get the powers of g in the equation gmk=gmk' to the same side of the equals sign? Then you can use gn=e.
     
  6. May 1, 2010 #5
    Actually if you think about it, if gmk=gmk' were equivalent to k' is a multiple of k, it would also have to be equivalent to k is a multiple of k'.

    This would mean the two values would be the same iff k=±k', but that would imply an infinite set ogf different values and there are only n.
     
  7. May 1, 2010 #6
    Is it when k=n/m?
     
  8. May 1, 2010 #7
    Well I think it's getting closer. Would that work with the example I gave? n/m in that instance would be 10. But where does k' come into it?

    We want to know how many different values (gm)k runs through as k runs through all the integers. It can be at most n, but will it be all n? Would (g2)k give all 20 values in the example. Would you get g5 for some k for instance?

    The idea of trying to find when two different k give the same result is that you would probably then see how many different groups of k give the same result. The size of H is then the number of groups. But if you look at the example carefully the result will probably become pretty obvious.

    What for instance would be the next value of k in the example such that (g2)k=(g2)3?
     
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook