Past exam of the mathematics course of the University of Cambridge 2022 ii Paper 2 19H Solution Created 2026-09-23 Updated 2026-09-25
Irreducible degrees divide the order of a finite -group and satisfyThe number of linear characters is . For a nontrivial finite -group this is at least unless the group is abelian, and every nonlinear degree is at least . A degree constituent is therefore impossible in the nonabelian case. If there are linear and degree-two characters, thenThus the only degree collections arewith respectively .
For , take , where
and
. On the five classesthe four linear characters of , indexed by
, and its degree-two character areThe ten classes of are and . Its full table consists ofwhere runs over the above five rows and
runs over the two characters of . This explicitly gives eight linear and two degree-two rows.
and
. On the five classesthe four linear characters of , indexed by
, and its degree-two character areThe ten classes of are and . Its full table consists ofwhere runs over the above five rows and
runs over the two characters of . This explicitly gives eight linear and two degree-two rows.
For , take the dihedral groupOrder its seven classes asThe four linear rows areThe three degree-two rows, for , areThe row norms and mutual inner products, weighted by the displayed class sizes, verify irreducibility and completeness.
Thompson's character-degree normal complement theorem Created 2026-10-14 Updated 2026-11-05
If a prime divides the degree of every nonlinear irreducible character of a finite group, the group has a normal p-complement. Indeed, the p-prime-degree characters are exactly the linear characters. Their squared-degree sum is , whose p-part is ; Isaacs' character-degree criterion for p-nilpotency applies.