Questions: Burnside's Theorem

3 questions to test your understanding

Score: 0 / 3
Question 1 Multiple Choice

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)?

AIt has been proved by purely group-theoretic methods — the representation-theoretic proof was just the first one found
BNo purely group-theoretic proof is known; the character-theoretic argument remains essential
CIt can be proved using Sylow theorems alone
DThe theorem is actually false without the representation-theoretic hypothesis
Question 2 True / False

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.

TTrue
FFalse
Question 3 Short Answer

A group of order 12 = 2² · 3 is solvable by Burnside's theorem. Name one group of order 12 and verify it is solvable.

Think about your answer, then reveal below.