5 questions to test your understanding
S₃ acts on {1, 2, 3} by permutation. The resulting permutation representation has dimension 3. What is its decomposition into irreducible representations of S₃?
The character of a permutation representation counts fixed points: χ(g) = |Fix(g)| = |{x ∈ X : g·x = x}|.
Every permutation representation on a set with |X| ≥ 2 contains the trivial representation as a subrepresentation.
Burnside's lemma states that the number of orbits of G acting on X equals:
If G acts transitively on X with stabilizer H = Stab(x₀), the permutation representation on X is isomorphic to: