# Cycle type determines conjugacy class

This article describes a basic fact about permutations, or about the symmetric group or alternating group.

View a complete list of basic facts about permutations

## Contents

## Definition

### For a finite set

For two permutations on a finite set, the following are equivalent:

- The two permutations have the same cycle type.
- The two permutations are conjugate in the symmetric group; in other words, they are in the same conjugacy class.

A cycle type on a set of size is described by an unordered integer partition of , where the parts are the sizes of the individual cycles. Thus, the set of conjugacy classes in the symmetric group on letters is in bijection with the set of unordered integer partitions of .

### For an arbitrary set

Consider two finitary permutations on a set. By *finitary* permutation, we mean that the permutation fixes all but finitely many elements. Then the following are equivalent:

- The two permutations have the same cycle type
- The two permutations are conjugate in the finitary symmetric group; in other words, they are in the same conjugacy class in this group

## Definitions used

### Cycle type

`Further information: Cycle type of a permutation`

The cycle type of a permutation gives numerical information coded in its cycle decomposition. More precisely, it specifies how many cycles there are of each size. The cycle type is typically described as a sequence , where denotes the number of cycles of size in the cycle decomposition. Note that for a permutation on an infinite set, this also includes , the number of cycles of infinite length.

When we're working with finitary permutations on an infinite set, then is infinite, but all the other s are finite, and there are only finitely many of them that are nonzero.

### Conjugacy class

`Further information: Conjugacy class, Conjugate elements`

## Related facts

## Comprehensive treatment of small degrees

In the right column links in the table below, you can see tabulated information on the conjugacy classes. The cases are embedded below.

`Further information: element structure of symmetric group:S3#Interpretation as symmetric group`

Partition | Partition in grouped form | Verbal description of cycle type | Elements with the cycle type in cycle decomposition notation | Elements with the cycle type in one-line notation | Size of conjugacy class | Formula for size | Even or odd? If even, splits? If splits, real in alternating group? | Element order | Formula calculating element order |
---|---|---|---|---|---|---|---|---|---|

1 + 1 + 1 | 1 (3 times) | three fixed points | -- the identity element | 123 | 1 | even; no | 1 | ||

2 + 1 | 2 (1 time), 1 (1 time) | transposition in symmetric group:S3: one 2-cycle, one fixed point | , , | 213, 321, 132 | 3 | odd | 2 | ||

3 | 3 (1 time) | 3-cycle in symmetric group:S3: one 3-cycle | , | 231, 312 | 2 | even; yes; no | 3 | ||

Total (3 rows -- 3 being the number of unordered integer partitions of 3) | -- | -- | -- | -- | 6 (equals 3!, the size of the symmetric group) | -- | odd: 3 even;no: 1 even; yes; no: 2 |
order 1: 1, order 2: 3, order 3: 2 | -- |

`Further information: element structure of symmetric group:S4#Interpretation as symmetric group`

Partition | Partition in grouped form | Verbal description of cycle type | Elements with the cycle type | Size of conjugacy class | Formula for size | Even or odd? If even, splits? If splits, real in alternating group? | Element order | Formula calculating element order |
---|---|---|---|---|---|---|---|---|

1 + 1 + 1 + 1 | 1 (4 times) | four cycles of size one each, i.e., four fixed points | -- the identity element | 1 | even; no | 1 | ||

2 + 1 + 1 | 2 (1 time), 1 (2 times) | one transposition (cycle of size two), two fixed points | , , , , , | 6 | , also | odd | 2 | |

2 + 2 | 2 (2 times) | double transposition: two cycles of size two | , , | 3 | even; no | 2 | ||

3 + 1 | 3 (1 time), 1 (1 time) | one 3-cycle, one fixed point | , , , , , , , | 8 | or | even; yes; no | 3 | |

4 | 4 (1 time) | one 4-cycle, no fixed points | , , , , , | 6 | or | odd | 4 | |

Total (5 rows, 5 being the number of unordered integer partitions of 4) | -- | -- | -- | 24 (equals 4!, the order of the whole group) | -- | odd: 12 (2 classes) even; no: 4 (2 classes) even; yes; no: 8 (1 class) |
order 1: 1 (1 class) order 2: 9 (2 classes) order 3: 8 (1 class) order 4: 6 (1 class) |
-- |

`Further information: element structure of symmetric group:S5#Interpretation as symmetric group`

Partition | Partition in grouped form | Verbal description of cycle type | Representative element with the cycle type | Size of conjugacy class | Formula calculating size | Even or odd? If even, splits? If splits, real in alternating group? | Element order | Formula calcuating element order |
---|---|---|---|---|---|---|---|---|

1 + 1 + 1 + 1 + 1 | 1 (5 times) | five fixed points | -- the identity element | 1 | even; no | 1 | ||

2 + 1 + 1 + 1 | 2 (1 time), 1 (3 times) | transposition: one 2-cycle, three fixed point | 10 | or , also in this case | odd | 2 | ||

3 + 1 + 1 | 3 (1 time), 1 (2 times) | one 3-cycle, two fixed points | 20 | or | even; no | 3 | ||

2 + 2 + 1 | 2 (2 times), 1 (1 time) | double transposition: two 2-cycles, one fixed point | 15 | or | even; no | 2 | ||

4 + 1 | 4 (1 time), 1 (1 time) | one 4-cycle, one fixed point | 30 | or | odd | 4 | ||

3 + 2 | 3 (1 time), 2 (1 time) | one 3-cycle, one 2-cycle | 20 | or | odd | 6 | ||

5 | 5 (1 time) | one 5-cycle | 24 | or | even; yes; yes | 5 | ||

Total (7 rows, 7 being the number of unordered integer partitions of 5) | -- | -- | -- | 120 (equals order of the group) | -- | odd: 60 (3 classes) even;no: 36 (3 classes) even;yes;yes: 24 (1 class) |
[SHOW MORE] |

## Proof

The key idea here is that conjugation by an element of the symmetric group is tantamount to a relabeling of the elements that are being permuted. Thus, if a permutation sends to , then conjugating by gives a permutation that sends to . That's because:

### Conjugate implies same cycle type

Conjugation by sends each constituent cycle of the permutation to an equivalent cycle, where all the elements of the cycle are replaced by their images under . In other words:

Thus, the lengths of the cycles in the cycle decomposition remain unaffected, so the number of cycles of each length remains unaffected.

### Same cycle type implies conjugate

The outline for the case of a finite set:

- Construct a bijection between cycles in the first permutation and cycles in the second, such that the bijection matches cycles of the same size. Note that such a bijection is not necessarily unique.
- For a pair of cycles and , define . Note that since we can write a cycle to begin with any element, the choice of is not necessarily unique.

Then, a chosen in this way conjugates the first permutation to the second permutation.

For the case of an infinite set, we can restrict our attention to the union of the finite subsets of elements moved by the two permutations, and construct as above, on those two subsets. Such a is clearly finitary, and conjugates the first permutation to the second.