Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Browsing the web ( I came across this:

The conjugacy class of an element :

  1. splits if the cycle decomposition of comprises cycles of distinct odd length. Note that the fixed points are here treated as cycles of length , so it cannot have more than one fixed point; and
  2. does not split if the cycle decomposition of contains an even cycle or contains two cycles of the same length.

Anybody with a proof?

share|cite|improve this question
up vote 11 down vote accepted

Note the following: (1) The conjugacy class in $S_n$ of an element $\sigma \in A_n$ splits, iff there is no element $\tau \in S_n\setminus A_n$ commuting with $\sigma$. For if there is one, for each $\tau' \in S_n \setminus A_n$ we have $$ \tau'\sigma{\tau'}^{-1} = \tau'\sigma\tau\tau^{-1}\tau'{}^{-1} = (\tau'\tau)\sigma(\tau'\tau)^{-1} $$ and $\tau\tau' \in A_n$.On the other hand, if $\tau\sigma\tau^{-1}$ and $\sigma$ with $\tau \in S_n\setminus A_n$ are conjugated in $A_n$, then for some $\tau' \in A_n$, we have $\tau\sigma\tau^{-1} = \tau'\sigma\tau'^{-1}$, giving $$ \tau'{}^{-1}\tau \sigma = \sigma\tau'{}^{-1}\tau $$ and hence $\tau'{}^{-1}\tau \in S_n\setminus A_n$ commutes with $\sigma$.

Now suppose, $\sigma$ has a cycle $c_i$ of even length. A cycle of even length is an element of $S_n \setminus A_n$, and as $\sigma$ commutes with its cycles, we are done by the above. If $\sigma$ has to cycles $(a_1\ldots a_\ell)$ and $(b_1 \ldots b_\ell)$ of the same odd length $\ell$, then $(a_1b_1) \ldots (a_\ell b_\ell)$ is a product of $\ell$ permutations (hence odd, so an element of $S_n \setminus A_n$) commuting with $\sigma$.

Now suppose $\sigma = c_1 \cdots c_s$ is a product of odd cycles $c_i$ of distinct length $d_i$. Let $\tau \in S_n$ be a permutation commuting with $\sigma$. Then $\tau$ must fix each of the $c_i$, that is, $\tau$ must be of the form $\tau = c_1^{a_1} \cdots c_s^{a_s}$ for some $a_i \in \mathbb Z$. But as the $c_i$ are even permutations (as cycles of odd length), we have $\tau \in A_n$. So no $\tau \in S_n \setminus A_n$ commutes with $\sigma$ and we are done.

share|cite|improve this answer
It is not my question, but could you explain to me what the product $(a_1 b_1)...(a_l b_l)$ means? The two cycles $(a_1...a_l), \ (b_1 ... b_l)$ are supposed to be disjoint, aren't they? – Sandy Jun 1 '13 at 19:18
@Sandy Yes, they are. With $\sigma = (a_1, \ldots, a_\ell)(b_1, \ldots, b_\ell)$ we let $\tau = (a_1, b_1) \cdots (a_\ell b_\ell)$ the product of $\ell$ (disjoint) permutations $(a_i, b_i)$ [the 2-cycle exchanging $a_i$ and $b_i$, their product as permutations]. We have, as computation shows ;-) $\sigma\tau = \tau \sigma$. – martini Jun 1 '13 at 23:07
Ok, thank you a lot :) – Sandy Jun 2 '13 at 6:00

ermutation in Sn. Suppose g has m1 cycles of length l1 m2 cycles of length l2 m3 cycles of length l3 . . . mk cycles of length lk

Then structure of g is given by l1^m1+....+lk^mk Number of elements in Sn having order l1^m1+....+lk^mk is n!/((l1^m1+....+lk^mk).m1!.m2!!) Two elements in Sn are cogugate if and only if they have same structure. The it is easy to find the class equation of Sn.

share|cite|improve this answer
Please format your answer using Mathjax – Surb Dec 1 '15 at 10:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.