Two permutations are conjugate iff they have the same cycle type
ProvedFamousTheorems.perm_conj_iff_cycle_type_7bPermutations are conjugate if and only if they have the same cycle type. Let be a finite set and permutations of . Then for some permutation if and only if and have the same multiset of cycle lengths.
So the conjugacy classes of correspond to partitions of . This correspondence is the starting point of the representation theory of symmetric groups, where the irreducible representations are also indexed by partitions. Conjugating a cycle by gives , which proves one direction; for the other, one maps the cycles of onto those of .
Formalization note. Mathlib's Equiv.Perm.isConj_iff_cycleType_eq. σ.cycleType is the multiset of lengths of the cycles of of length at least . Fixed points are omitted, but their number is determined by the size of .
import Mathlib
namespace FamousTheorems
theorem perm_conj_iff_cycle_type_7b {α : Type*} [Fintype α] [DecidableEq α] (σ τ : Equiv.Perm α) : IsConj σ τ ↔ σ.cycleType = τ.cycleType := by sorry
end FamousTheorems