Results 1 to 2 of 2

Math Help - Permutations and cycles

  1. #1
    Member
    Joined
    Dec 2010
    Posts
    107

    Permutations and cycles

    Let \rho \in Sym(n) and let p be a prime number. Show that \rho^p = \iota if and only if the cycles of \rho have lengths 1 or p.

    I realise that this is an if and only if question, so it will need to be shown in the two directions.
    For showing that if the cycles all have lengths 1 or p, then \rho^p = \iota I have have shown it for length 1 but can't see how to show it for p. I can't think of where to start for the proof in the other direction. Help anyone?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member roninpro's Avatar
    Joined
    Nov 2009
    Posts
    485
    Suppose we have a permutation \rho. It can be broken up into a product of disjoint cycles: \rho=\sigma_1 \sigma_2\cdots \sigma_k. If n_1, n_2,\ldots, n_k are the lengths of each cycle, it can be shown that the order of \rho is \text{lcm}(n_1,n_2,\ldots n_k).

    So, if the order of \rho is a prime p, then p=\text{lcm}(n_1,n_2,\ldots n_k).

    I will leave it to you to conclude.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Permutations, cycles
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: October 12th 2010, 04:41 PM
  2. Permutations & Cycles
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: March 12th 2010, 03:19 PM
  3. Cycles
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: December 8th 2009, 07:14 PM
  4. cycles
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: November 22nd 2008, 09:01 PM
  5. Permutations cycles
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 4th 2008, 03:59 PM

Search Tags


/mathhelpforum @mathhelpforum