Motivation
A permutation written as a long product of transpositions can conceal its structure. Disjoint cycles reveal its orbits, order and parity, and cycle type organizes every conjugacy class of the symmetric group. Counting a class then reduces to understanding which relabelings commute with a chosen permutation.
Passing to the alternating group creates a subtler question. Two even permutations can be conjugate by some permutation while failing to be conjugate by an even one. A symmetric-group class can therefore divide into two alternating-group classes. We will prove the exact splitting criterion and use it to explain the two classes of five-cycles in , rather than assuming that all identical cycle types remain one class after restricting the conjugators.
Let act on . Products act from right to left. Use orbit–stabilizer, centralizers, and the sign homomorphism proved in the solvability unit. Its kernel is , of index two for . Fixed points count as cycles of length one throughout, including in the splitting criterion.
Definitions
Definition 11.1.1
(Cycle type and its multiplicities)
The cycle sends each entry to the next and the final entry to the first, fixing every other point. For a permutation , let be the number of length- cycles in its disjoint-cycle decomposition. Its cycle type is the partition specified by these multiplicities, with
The support of a cycle or permutation is the set of points it moves. The centralizer consists of permutations with . The conjugacy class consists of the permutations , and its size is the centralizer index by orbit–stabilizer for conjugation.
The support does not record fixed points, but the cycle type does: there are fixed-point cycles. Omitting these cycles in written notation is harmless only if the ambient is still known. In particular two unused points can provide an odd centralizing transposition.
Theorems
Theorem 11.1.2
(Cycle decomposition classifies symmetric-group conjugacy)
Every permutation has a disjoint-cycle decomposition, unique up to ordering the cycles and rotating the entries within each cycle. Its order is the least common multiple of its cycle lengths. Its sign is
Two permutations are conjugate in exactly when their cycle types agree. For a type with multiplicities ,
Theorem 11.1.3
(Exactly the distinct odd cycle types split)
Assume and . Its -class is either one -class or the disjoint union of two -classes of equal size. It splits into two exactly when every cycle length is odd and no length is repeated, including length one.
Equivalently, splitting occurs exactly when . In the split case each alternating class has half the symmetric class size; otherwise its size is unchanged.
Proof sketch or proof idea
Follow one point until its orbit closes
Proof
(Orbits of give the cycles)
Start at a point and repeatedly apply . Because the underlying set is finite, some value repeats. Bijectivity implies that the first repeated value is itself: if with , apply the inverse times to get . Choose the least positive return time . The distinct points form one cycle, and acts on them exactly as that cycle.
Remove those points and repeat on the remaining invariant set. This produces disjoint cycles covering all points. Their underlying sets are precisely the orbits of the cyclic subgroup generated by , so they are uniquely determined. Within an orbit the next entry is forced by ; changing the starting point merely rotates the list. Disjoint cycles commute, so their displayed order does not matter.
On a length- orbit, is identity exactly when divides , including . It is identity on all orbits exactly when every cycle length divides , proving the least-common-multiple formula. A length- cycle has a transposition decomposition
There are transpositions; applying the known sign homomorphism proves the parity formula. This use of sign does not assume that all transposition decompositions have visibly equal lengths.
Conjugation relabels every cycle
Proof
(Relabeling and matching cycles of equal length)
For a bijection ,
To check it, apply both sides to and to points outside those listed. Thus conjugation preserves all cycle lengths. Conversely, when two permutations have the same type, pair their equal-length cycles and map the successive entries of each source cycle to those of its paired target. This defines a bijection of all points, including the fixed points, and the displayed identity shows it conjugates the first permutation to the second. This proves both directions of the classification.
Count a centralizer by its forced choices
Proof
(Permuting equal cycles and choosing rotations)
Suppose commutes with . If has orbit length , then , and applying the same argument to shows its image orbit has exactly length . Hence permutes the set of length- cycles. There are choices of this permutation of cycles.
After choosing the target cycle of one source cycle, choose the image of one marked starting point. There are choices in that target cycle. Commutation then forces all other images, since . Each source cycle contributes one independent -fold choice. Consequently this part has possibilities.
Conversely, every family of such cycle permutations and starting-point choices defines a bijection that commutes with on every orbit. The choices are independent for different lengths, so multiplying gives the centralizer formula. Dividing by it gives the class size. This argument explains both factors: the power of comes from rotations, while the factorial comes from permuting equal-length cycles. Replacing one by the other loses different symmetries.
Concept lensStructural
The centralizer as a product of wreath products
The count also identifies the centralizer as a group. For each length , the rotations of the cycles of that length form . The relabelings that send marked starting points to marked starting points form a copy of , which permutes those coordinates. Hence
a product of wreath products . For it is , of order .
An index-two subgroup gives at most two classes
Proof
(Repairing the parity of a conjugator)
Fix any odd permutation . Every element of lies either in or in . Thus every conjugate of belongs either to its -class or to the -class of ; normality of ensures this description of the second family. Conjugation by gives a bijection between these two classes, so if they are distinct their sizes agree.
Let be the symmetric centralizer. If contains an odd element , every odd conjugator can be replaced by the even conjugator : commutes with , so . Every symmetric conjugate is then already an alternating conjugate, and there is no split.
If , the alternating centralizer is all of . Its alternating class size is , half the symmetric class size. The symmetric class therefore consists of two distinct equal classes. Conversely an odd centralizer element gave no split, proving the equivalence. One can also detect disjointness directly: an even and an odd conjugator giving the same conjugate would have an odd quotient in , contradicting the assumption.
Proof X-ray
A commuting odd relabeling repairs the parity of any conjugator
Conjugators are only determined up to multiplication by a centralizer element. If an odd centralizer element exists, multiply by it to turn an odd conjugator into an even one without changing its target. When every centralizer element is even, that repair is impossible and the symmetric class separates into two parity families.
Determine precisely when the centralizer is entirely even
Proof
(Odd centralizer elements from even or repeated cycles)
If has an even-length cycle, that cycle alone is an odd permutation and commutes with all the other disjoint cycles. Thus the centralizer has an odd element. If it has two cycles of the same odd length , label them and . The swap
commutes with and is odd, since it contains an odd number of disjoint transpositions. This includes : two fixed points can be swapped. Repeated even lengths are already covered by the even-cycle argument.
Finally suppose all lengths are odd and distinct. Every centralizer element must send each cycle to itself, since no other cycle has its length. Its restriction to that cycle is a rotation, by the forced-image argument. An odd-length cycle is an even permutation, and so are all its powers. The full centralizer element is a product of these even rotations and is even. This proves the exact criterion, including the often-missed fixed-point condition.
Worked examples
Worked example 11.1.4
(Compute powers before multiplying a long word)
Take . Its type is , its order is twelve, and its sign is minus one. Its sixth power is , because six is two modulo four and zero modulo three. Its fourth power is . These computations take place independently on each orbit. The centralizer has size , so its symmetric conjugacy class has size . The fixed point still contributes its factor one; it was not deleted from the ambient group.
Worked example 11.1.5
(Repeated three-cycles contribute a factorial)
For , there are two three-cycles and two fixed points. Thus the centralizer order is and the symmetric class size is 1120. The permutation is even. Its class does not split in : the centralizer contains the fixed-point transposition , and also the odd cycle swap . The rotations of the two three-cycles account for only nine centralizer elements; stopping there would miss both independent two-fold choices.
Worked example 11.1.6
(Recover the complete class-size list)
The even types in are the identity, , and (5). Their symmetric class sizes are respectively 1, 20, 15, 24 from the centralizer formula. The three-cycle type does not split because its two fixed points can be exchanged; the double-transposition type has an even-length cycle and also does not split. The five-cycle type has one odd length with no repetition, so it splits into two alternating classes of size twelve. Hence the class sizes are 1, 20, 15, 12, 12, summing to sixty. This supplies the structural explanation for the class list used in the earlier simplicity proof; it does not silently extend that proof to every alternating group.
Counterexample mode
Odd cycle lengths alone do not guarantee splitting
A three-cycle in has only odd cycle lengths, but its full type is . The two fixed-point cycles repeat, and swapping their points gives an odd centralizer element. Its class is therefore one class of size twenty, rather than two classes of size ten. In contrast a three-cycle in has type , with distinct odd lengths, and its eight symmetric conjugates split into two alternating classes of four. The ambient set matters.
The explorer below lists every cycle type of for up to 7 with its order, sign, centralizer order and class sizes, and can check each prediction, including the splitting in , by brute force for up to 6.
Common mistakes
Common mistake
(Commuting, rotating and the order of a permutation)
Disjoint cycles commute; overlapping cycles generally do not. A cycle can be rotated in notation without changing its value, but reversing it generally gives its inverse. Order is the least common multiple of lengths, not their sum or their product without a coprimality check.
Common mistake
(Splitting needs every fixed point in the type)
Centralizer elements may permute entire equal-length cycles as well as rotate within them. Fixed-point permutations belong to the centralizer too. Symmetric conjugacy preserves cycle type, but alternating conjugacy may distinguish two classes within one type. Apply the splitting criterion only to even permutations, and include every fixed point in the list of lengths.
Summary
Orbit decomposition makes cycle lengths intrinsic and gives order and parity formulas. A commuting permutation must permute equal-length cycles and choose a rotation in each, yielding the complete centralizer count. In an index-two alternating subgroup, odd commuting relabelings determine whether conjugator parity can be repaired. Exactly the distinct odd cycle types split into two equal classes.
Exercises
Quick check
(For type in , compute order, sign, centralizer size and symmetric class size. If appropriate, decide whether it splits in .)
Solution · Answer
The order is four and the sign is . The centralizer size is , so the symmetric class size is 2520. An even-length cycle already supplies an odd centralizer element, as does the repeated fixed-point type. Thus there is one alternating class of the same size 2520.
Quick check
(Determine the complete list of split types in and the two alternating class sizes for each type. Justify that your list is exhaustive.)
Solution · Answer
A split type is a partition of seven into distinct odd positive parts. The only possibilities are (7): with three distinct positive odd parts the least sum is , and a sum of two odd parts is even. The centralizer of a seven-cycle has order seven, so its symmetric class has size 720 and its two alternating classes have size 360 each. The identity type has repeated ones and does not split.
Quick check
(Let be an -cycle. Prove directly that its centralizer in is its own cyclic subgroup. For odd at least three, deduce the two alternating class sizes.)
Solution · Answer
The image of one chosen point determines a commuting permutation on its whole orbit, which is all points. That image is for exactly one residue modulo , and commutation forces equal to . Thus the centralizer is the -element cyclic subgroup. If is odd and at least three, the sole length is odd and distinct; the symmetric class size is and the two alternating class sizes are .
Quick check
(If commutes with , prove preserves the fixed-point set of every power . Explain why preserving only the fixed-point set of is insufficient to imply commutation, giving a concrete example.)
Solution · Answer
If , then , so maps that fixed-point set into itself. Applying gives equality. For insufficiency take and in : has no fixed point, so preserves its empty fixed-point set, yet conjugation by reverses the cycle and is not . Set preservation contains less information than commuting with the entire action.