A permutation cycle sends to , each successive listed point to the next, and to , fixing every unlisted point. Its length is . For any permutation ,Thus conjugate group elements in the symmetric group have the same cycle length. Conversely, two cycles of the same length are conjugate: send their entries, in cyclic order, to one another and extend this bijection arbitrarily to the unused points. Length-one cycles represent the identity and cause no exception to this conclusion.
An odd-length permutation cycle is an even permutation, since its sign is . Let be such cycles on points and choose with . If is odd, let be the transposition of the two points unused by the listed cycle . Then , and is even withHence all the -cycles are conjugate within . The two spare letters supply the parity correction; they are the reason the same argument need not work with only one spare letter.
In the answer is no. For example, and are conjugated by the odd transposition in . The centralizer of in is exactly its order-three cyclic subgroup: a commuting permutation fixes the unique fixed point and acts as a power of the cycle on the other three points. All these centralizing elements are even. Every other conjugating element differs from by a centralizing element, so it is also odd. There is no conjugator in . Equivalently, the eight three-cycles split into two conjugacy classes of size , illustrating the alternating conjugacy class splitting criterion.
Articles by others on the same topic
There are currently no matching articles.