3 questions to test your understanding
Burnside's theorem states that groups of order pᵃqᵇ are solvable. Why can't this be proved by purely group-theoretic methods (without representation theory)?
The key lemma in Burnside's proof states: if χ is an irreducible character of degree d and g is an element whose conjugacy class has size coprime to d, then |χ(g)| = d or χ(g) = 0. This uses the fact that χ(g)/d is an algebraic integer.
A group of order 12 = 2² · 3 is solvable by Burnside's theorem. Name one group of order 12 and verify it is solvable.