Math 2.0

statement theorem

Conjugacy classes of the symmetric group correspond to cycle types

Statement

Let σ,τ∈Sn\sigma, \tau \in S_n. Then σ\sigma and τ\tau are conjugate in SnS_n if and only if they have the same cycle type.

Remarks

The key formula is π(a1 a2 … ak)π−1=(π(a1) π(a2) … π(ak))\pi (a_1\ a_2\ \dots\ a_k) \pi^{-1} = (\pi(a_1)\ \pi(a_2)\ \dots\ \pi(a_k)) for each π∈Sn\pi \in S_n. So conjugation keeps the cycle type, and a suitable π\pi sends the cycles of σ\sigma onto the cycles of τ\tau. Thus the number of conjugacy classes of SnS_n is the number of partitions of nn. For example, S4S_4 has 55 conjugacy classes.

Explanations

L1 human

Conjugation by π\pi renames the points, but it keeps the shape of each cycle. Conversely, two permutations of the same shape differ only by a renaming of the points. So in SnS_n, conjugate means "same shape".

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 8 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Cycle notation concept
  2. Group concept
  3. Conjugate elements definition
  4. Symmetric group definition
  5. Disjoint cycles commute statement
  6. Decomposition of a permutation into disjoint cycles statement
  7. Cycle type definition
  8. Conjugacy classes of the symmetric group correspond to cycle types statement

Sources

  1. Web https://en.wikipedia.org/wiki/Symmetric_group, Conjugacy classes
  2. Web https://en.wikipedia.org/wiki/Permutation, Conjugating permutations