University Mathematics — Year 3 · Bachelor Year 3
5Representations of Finite Groups
To understand an abstract group, make it act on a vector space and use linear algebra — eigenvalues, traces, inner products — on the action. This program, representation theory, is astonishingly effective for finite groups over : every representation splits into irreducible ones (Maschke), the irreducible ones are pinned down by their characters (traces), and the characters satisfy orthogonality relations that make computations mechanical. The chapter builds this calculus and its first masterpieces — character tables of the small groups — and the weekend problem harvests a theorem far beyond the reach of bare group theory: Burnside’s theorem. Throughout, is a finite group and all vector spaces are finite-dimensional over .
5.1 Representations, Maschke, Schur
Definition 5.1
A representation of is a morphism for a -vector space ; is its degree. A subspace is invariant if for all ; restriction makes a subrepresentation. is irreducible if and its only invariant subspaces are and . A morphism between and is a linear with for all (equivariance); bijective are isomorphisms.
Example 5.2
(a) Degree : morphisms . (b) The regular representation: with basis , ; degree . (c) A permutation action of on a finite set gives the permutation representation on : . (d) acts on by permuting coordinates; the hyperplane is invariant: the standard representation, of degree .
Theorem 5.3 (Maschke)
Every invariant subspace of a representation admits an invariant complement. Consequently every representation is a direct sum of irreducible ones (semisimplicity).
Proof. Let be any projection with image (pick any complement). Average it over the group:
Each term maps into ( invariant), and fixes pointwise: for , , fixes it, and brings it back — so is again a projection onto . It is equivariant: for , reindexes the same sum. Hence is an invariant complement of . Iterating on the summands (finite dimension) decomposes into irreducibles. ∎
Theorem 5.4 (Schur’s lemma)
Let be a morphism of irreducible representations. Then or is an isomorphism; and if , then for some . Hence is if , otherwise.
Proof. and are invariant (equivariance), so each is or everything: either , or is injective with full image. If : has an eigenvalue ( algebraically closed); is a non-injective morphism , hence . For the dimension count when : fixing one isomorphism , any morphism gives the endomorphism : . ∎
5.2 Characters and orthogonality
Definition 5.5
The character of is . It satisfies , (traces are conjugation-invariant): characters are class functions — elements of the space of functions constant on conjugacy classes, equipped with the Hermitian inner product
Proposition 5.6
is diagonalizable with eigenvalues roots of unity; , and with equality iff is a scalar. Characters add on direct sums: .
Proof. for (Lagrange): annihilates , split with simple roots, so it is diagonalizable with eigenvalues . Then , and , with equality in the triangle inequality iff all are equal, i.e. . Additivity on direct sums: block traces. ∎
Lemma 5.7
Let , be representations. The averaging operator on ,
is a projection onto , and for the map one has .
Proof. is equivariant (reindex the sum as in Maschke), and fixes equivariant maps (each term equals ): is a projection with image . Trace: in bases, with , ; on the basis of matrices, , so the coefficient of in is : , and . ∎
Theorem 5.8 (First orthogonality relations)
Let be irreducible. Then
the irreducible characters form an orthonormal family in .
Proof. The trace of a projection is the dimension of its image:
and Schur’s lemma evaluates the left side to . ∎
Corollary 5.9
Decompose into distinct irreducibles (). Then : the multiplicities — hence the representation up to isomorphism — are determined by the character. Moreover ; in particular is irreducible iff .
Proof. (Proposition 5.6); take inner products with each and use orthonormality. Two representations with equal characters have equal multiplicities, hence are isomorphic. ∎
Theorem 5.10 (The regular representation)
Let be the distinct irreducible characters, of degrees . The regular representation decomposes with multiplicities ; consequently
Proof. The regular character: , which is for and otherwise. So . Evaluating at and at gives the two displayed identities. ∎
Theorem 5.11
The irreducible characters form an orthonormal basis of : the number of irreducible representations equals the number of conjugacy classes of .
Proof. Only completeness is left: let be orthogonal to every ; we show . For a representation , set . It is equivariant: for ,
( is a class function). If is irreducible of degree , Schur gives with
So on every irreducible, hence (direct sums) on every representation — in particular on the regular one. Apply it to the basis vector : , forcing every . Thus the orthonormal family spans , whose dimension is the number of conjugacy classes. ∎
Corollary 5.12 (Column orthogonality)
For :
Proof. Let represent the classes, the class sizes. The matrix has orthonormal rows (Theorem 5.8 written classwise: ), i.e. ; a square matrix with also has : columns are orthonormal, which unpacks to the displayed identity (, the orbit–stabilizer relation for conjugation). ∎
Proposition 5.13 (One-dimensional characters; lifting)
(a) is abelian iff all its irreducible representations have degree ; the number of degree- characters of any is (they are the characters of the abelianization). (b) If , the irreducible representations of lift (compose with ) to exactly those irreducible representations of whose kernel contains .
Proof. (a) If is abelian, each class is a singleton: , and forces all ; conversely if all , the regular representation is a sum of one-dimensional ones, so is simultaneously diagonalizable, hence commutative, and is faithful: abelian. Degree- representations are morphisms with abelian target: they factor through (Exercise 1.9), and distinct characters of the abelian number (it has that many classes, all degrees ). (b) Composition with the projection preserves irreducibility (invariant subspaces correspond), and a representation trivial on factors through the quotient (Theorem 1.3). ∎
5.3 Character tables
Definition 5.14
The character table of is the matrix : rows indexed by irreducible characters, columns by conjugacy classes (with their sizes displayed). Rows are orthonormal for the weighted product, columns orthogonal (Corollary 5.12): the table is severely overdetermined, which is what makes it computable.
Example 5.15 (The table of )
Classes: (size 1), transpositions (3), -cycles (2); so irreducibles, of degrees with : . Degree : trivial and signature . The last row follows from column orthogonality (or from ):
Check: : irreducible.
Example 5.16 (The table of )
Classes: [1], transpositions [6], double transpositions [3], -cycles [8], -cycles [6]: five irreducibles, with two degree-’s (; ): degrees . The degree- lifts from (Proposition 5.13(b), the Klein group); degree : the standard representation and its twist by :
(; evaluates the -table on the image of each class mod .) All row and column orthogonality checks pass — running two of them is Exercise 5.3’s warmup.
Method 5.17
To build a character table: (1) list conjugacy classes and sizes; (2) count degree- characters via and write them; (3) find the remaining degrees from (small integer combinatorics); (4) obtain cheap irreducibles: lift from quotients, subtract from permutation characters (check ), multiply known characters by degree- ones; (5) finish unknown rows by column orthogonality — each column is orthogonal to the columns already complete, and column carries the degrees. Verify everything with a full orthogonality sweep.
5.4 Exercises
Exercise 5.1 ★
(a) Show that the irreducible characters of are the , , and write the character table of . (b) Verify both orthogonality relations on it — and recognize the matrix: where has this book seen it before?
Solution
Solution of Exercise 5.1.
(a) is abelian: all irreducibles have degree (Proposition 5.13), i.e. are morphisms , determined by with : the characters . For (classes elements ):
(b) Rows: (geometric sum); columns likewise. The matrix is the discrete Fourier transform matrix — the same roots-of-unity filter used in the Year 2 volume’s generating-functions chapter; orthogonality of characters generalizes the inversion formula of the DFT.
Exercise 5.2 ★
Let act on a finite set and be the character of the permutation representation . (a) Show and — Burnside’s counting lemma (Exercise 1.5) is a character computation. (b) Suppose the action is transitive, so . Show that is irreducible iff the action is -transitive (transitive on ordered pairs of distinct points). (Compute as the number of orbits on .) (c) Conclude that the standard representation of () is irreducible.
Solution
Solution of Exercise 5.2.
(a) The matrix of in the basis is a permutation matrix, of trace the number of with . Then
by Burnside’s counting lemma (Exercise 1.5) — equivalently, this computes the multiplicity of the trivial representation, whose isotypic space is the space of -invariant vectors, of dimension the number of orbits (one indicator per orbit).
(b) Since , part (a) applied to gives ( is real). Writing : (transitivity), so . The action on has the diagonal as one orbit; there is exactly one other orbit iff is transitive on distinct pairs: iff -transitive (Corollary 5.9).
(c) is -transitive on (send any distinct pair anywhere): is irreducible.
Exercise 5.3 ★
Rebuild the table of from scratch following Method 5.17, then verify two row and two column orthogonality relations in the table of Example 5.16. Decompose the permutation character of acting on and the character (pointwise square) into irreducibles.
Solution
Solution of Exercise 5.3.
: three classes, ; the two degree- characters are (); the third row follows from column orthogonality with the -column: and : , — the table of Example 5.15.
checks (rows): ; . Columns: against : ; against itself: .
Permutation character on points: (fixed-point counts; subtract the top row). For :
(dimensions: ).
Exercise 5.4 ★★
Compute the character tables of and of . Conclude that two non-isomorphic groups can have identical character tables — what group-theoretic data does the table nevertheless capture in this pair (orders of centers, abelianizations, number of involutions)? Which of these does it fail to capture?
Solution
Solution of Exercise 5.4.
Both groups have five classes and degree pattern (four degree-’s from the abelianization , then ). Ordering the classes , (the central involution: , resp. ), and the three two-element classes:
(the last row from column orthogonality). Identical tables for and , which are not isomorphic (Problem 1.1). The table does capture: , class sizes, the center (: order in both), the abelianization, the whole lattice of normal subgroups (kernels and intersections, Exercise 5.6). It fails to capture element orders: has five involutions, has one — so the isomorphism type is genuinely finer than the character table.
Exercise 5.5 ★★
Character table of : classes [1], double transpositions [3], and two classes of -cycles [4], [4]. (a) Explain the splitting of the -cycles (compare centralizers in and , as in Exercise 1.11). (b) Find the three degree- characters (via ) and the degree- character (restrict from ), and assemble the table. (c) Read off the normal subgroups of from the table (kernels and their intersections).
Solution
Solution of Exercise 5.5.
(a) In , the centralizer of has order : it is . So has order and the -class has elements: the eight -cycles split into two -classes (represented by and its inverse).
(b) gives three degree- characters (; the -cycle classes map to ); the restriction of stays irreducible ():
(c) Kernels: ; (no other entry has modulus ). The normal subgroups are the intersections of kernels (Exercise 5.6): , , — in particular has no normal subgroup of order or index .
Exercise 5.6 ★★
(a) Show that is the kernel of the underlying representation (Proposition 5.6, equality case). (b) Show that every normal subgroup of is an intersection of kernels of irreducible characters. (Represent faithfully: its regular representation.) (c) Deduce: is simple iff for every nontrivial irreducible — simplicity is readable from the character table.
Solution
Solution of Exercise 5.6.
(a) If : equality in forces (Proposition 5.6) with : . The converse is clear.
(b) Let . The regular representation of is faithful; decompose it into irreducibles of and lift them to (Proposition 5.13(b)): irreducible characters of whose kernels contain and whose common kernel is exactly the preimage of , i.e. (faithfulness on the quotient). So .
(c) If is simple: for a nontrivial irreducible , is not (an irreducible representation trivial on all of is the trivial character), so . Conversely, suppose all nontrivial kernels are trivial, and let with . In (b)’s expression of as an intersection of kernels, some character involved is nontrivial (if all were trivial, the intersection would be ), and its kernel is : . So the only normal subgroups are and .
Exercise 5.7 ★★
Degrees of : show that a nonabelian group of order has degree pattern , and that its degree- representation is faithful. More generally show that a nonabelian group of order has pattern with ones and characters of degree . (Use and ; here has order .)
Solution
Solution of Exercise 5.7.
Order nonabelian: the number of degree- characters is , a proper divisor of (nonabelian: ), and . With ones and the remaining degrees : with squares , and , . : one degree — consistent. : left, not a sum of squares . : impossible, since — is a nontrivial abelian -group, as is a -group with by solvability of -groups (Example 1.30). So the pattern is . Faithfulness of : the four degree- characters all contain in their kernels; if for some minimal normal ( or not — take nontrivial), then would lie in all five kernels, whose intersection is trivial (the regular representation is faithful): contradiction. Order nonabelian: has order (order would make cyclic, abelian), of order is abelian, so , and : , giving characters of degree . The remaining degrees satisfy with each dividing (Problem 5.1, question 8) hence ( would exceed: ): exactly characters of degree .
Exercise 5.8 ★★★
For finite groups : show that the class functions on , for irreducible characters of , are exactly the irreducible characters of . (Orthonormality is a direct computation; completeness by counting classes.) Deduce the character table of and re-derive Proposition 5.13(a) for finite abelian groups via the structure theorem.
Solution
Solution of Exercise 5.8.
Define, for representations of in , the representation of on — concretely, on matrices: is the Kronecker product , whose trace is (the Kronecker product of matrices has trace : its diagonal is ). So is a character, and
In particular : each is irreducible (Corollary 5.9). These are distinct irreducible characters; the classes of are the products of classes ( componentwise), so there are of them: the list is complete (Theorem 5.11). For : the four sign characters — the table of Exercise 5.4’s top-left block. A finite abelian group is a product of cyclic groups (Corollary 3.13); its irreducible characters are products of the cyclic ones (Exercise 5.1): all of degree .
Exercise 5.9 ★★★
The character table of (classes of sizes from Exercise 1.11): (a) Show the degrees are (the only solution of with and, using Exercise 5.6(c) with simplicity, no other ). (b) Construct the degree- character (permutation action on points) and the degree- character (action on the six -Sylow subgroups gives degree ; check irreducibility), and complete the two degree- rows by column orthogonality: golden-ratio entries appear on the -cycle classes. (c) Verify from the finished table that is simple (Exercise 5.6(c)).
Solution
Solution of Exercise 5.9.
(a) (simple nonabelian), so the only degree- character is (Proposition 5.13). We need with each ; testing the squares : the only multiset that works is : with largest square , the remainder is not a sum of three squares ; with , the remainder is not either (, ); with largest , one checks works and , , variants fail; with largest : . Degrees: .
(b) Permutation on points: fixed points , so with : irreducible. Action on the six Sylow -subgroups: an involution fixes exactly (the normalizers are dihedral of order , each containing involutions: incidences for involutions), a -element fixes (no order in ), a -element fixes exactly (it lies in a unique Sylow): permutation character , and with norm : irreducible. Two rows , remain. Column norms (Corollary 5.12): on the class of , : ; column against : : , : . On the -cycles, : : . On each -class, : the column against reads , so ; and : — the golden ratio and its conjugate; the second -class carries the swapped values (the two rows must be orthogonal).
(c) In the finished table, no entry of a nontrivial row equals its degree outside the first column: every kernel is trivial. By Exercise 5.6(c), is simple.
Exercise 5.10 ★★
Let be an irreducible representation of degree and . Show with a morphism (the central character), and deduce for central . Application: if has a faithful irreducible representation, then is cyclic.
Solution
Solution of Exercise 5.10.
commutes with every ( is central), i.e. (Schur): , and is multiplicative: a morphism . Then with (root of unity): . If is faithful, is injective on (), so embeds in ; a finite subgroup of the multiplicative group of a field is cyclic (Theorem 4.12).
Exercise 5.11 ★★
(Isotypic projections) Let be a representation of and an irreducible character of degree . Define
(a) Show that is -equivariant, and compute its restriction to an irreducible subrepresentation of character : it is (Schur; take traces to identify the scalar). (b) Deduce that is a projection onto the sum of all irreducible subrepresentations of character (the isotypic component), that , and that the decomposition is canonical — unlike the finer splitting of each into irreducibles. (c) For the regular representation of and the sign character , write out explicitly as an element of the group algebra and check by hand.
Solution
Solution of Exercise 5.11.
(a) Equivariance: reindexes the sum (, and is a class function): commutes with the action. On an irreducible of character , Schur makes the restriction a scalar ; taking traces,
(first orthogonality): .
(b) Decompose into irreducibles (Maschke): acts as identity on the summands of character and as on all others, so is the projection onto their sum along the sum of the rest; the image does not depend on the chosen decomposition (it is the set of vectors fixed by , defined without choices). acts as identity on every irreducible summand: it is . The finer splitting of involves choosing a basis of : canonical it is not.
(c) For (degree ): , i.e. in the group algebra
Squaring: the coefficient of in is : . (Its image in the regular representation is the line spanned by : the sign representation appears with multiplicity , as the general theory demands.)
Exercise 5.12 ★★
(Reading a table) The character table of a certain group of order is partially known: it has classes, of sizes , and degrees . (a) Recover the full table: the two linear characters (one trivial; the other takes value exactly on the classes of sizes and ), then the degree- character via column orthogonality with the identity column, then the two degree- characters likewise (one is ). (b) Identify (: compare classes with cycle types), and extract from the table the normal subgroups via Exercise 5.6: kernels of (index : ) and of (the Klein ), and nothing else but . (c) Explain how the table shows (which characters factor through the quotient?).
Solution
Solution of Exercise 5.12.
(a) Order the classes [1], transpositions [6], -cycles [8], -cycles [6], double transpositions [3]. The second linear character is with values . For the degree- character , column orthogonality of each column with the identity column ( for ) gives, on transpositions: ; the sign trick (a degree- character times a linear one is again irreducible — same norm) makes vanish on odd classes: there. On -cycles: with on even classes; the column of with itself gives data; solving the small system (use also row orthogonality of with and ): , then and . The full table:
(All rows have norm ; all columns are orthogonal: checks pass.)
(b) The class data with these degrees is that of (cycle types , , , , ). Kernels: (classes : , index ); = classes : the Klein group , of order , normal. are faithful ( only at ). Intersections of kernels: , , , — by Exercise 5.6(b) these are all the normal subgroups of .
(c) The characters with are : they factor through , a group of order possessing irreducible degrees — the table of . Since the quotient’s table is a complete invariant among the two groups of order ( would have six linear characters), : the quotient is visible inside the table as the block of rows containing in their kernel.
5.5 Problem: Burnside’s theorem
Problem 5.1
Weekend problem — solvability of groups of order
Burnside proved in 1904 that every group whose order has at most two prime factors is solvable — a statement about abstract groups whose only known proofs for half a century went through character theory. This problem builds the proof in full, assembling Chapter 1 (solvability), Chapter 3 (finitely generated -modules) and this chapter. Throughout, are the irreducible characters of , .
Part I — Algebraic integers. An algebraic integer is a root of a monic polynomial of .
- Show that is an algebraic integer iff the ring is a finitely generated -module.
- Deduce that the algebraic integers form a subring of . (If are finitely generated, so is , and submodules of finitely generated -modules are finitely generated, by Theorem 3.5 and a presentation argument — or directly: a submodule of is free of rank .)
- Show that a rational algebraic integer is an integer. (Rational root theorem.)
- Show that every character value is an algebraic integer.
Part II — The class-sum relations. Fix an irreducible of degree and character . For a conjugacy class , let .
Show that is equivariant, hence with
- Show that where counts, for a fixed , the pairs with . Deduce that the satisfy .
- Conclude that each is an algebraic integer. (The -module generated by and the is a finitely generated ring; apply question 1’s criterion — more precisely show satisfies and use a determinant/Cayley–Hamilton trick, or question 2’s subring argument.)
- Deduce Frobenius divisibility: divides for every irreducible degree. (Compute : an algebraic integer that is rational.)
Part III — Burnside’s simplicity criterion.
- Let be irreducible of degree and a class with . Using Bézout and questions 4–7, show that is an algebraic integer.
- Suppose moreover . Show this is impossible: the algebraic integer has all its conjugates — the numbers for , each an average of roots of unity — of modulus , so the product is a rational algebraic integer with — justify each assertion, quoting Theorem 4.23 for the Galois group and the fact that permutes roots of unity. Conclude: either or is scalar (Proposition 5.6).
- (Burnside’s criterion) Let be a conjugacy class of prime power size , and suppose is simple nonabelian. Column orthogonality on the column of against the column of gives . Show that some nontrivial with has (otherwise would be an algebraic integer); by question 10, is scalar; derive a contradiction with simplicity (the set of with scalar is a normal subgroup; use faithfulness from Exercise 5.6). Conclude: no simple nonabelian group has a conjugacy class of prime power size .
Part IV — The theorem.
- Let with . If is simple, show it is abelian: pick in the center of a Sylow -subgroup (Theorem 1.12) and consider the size of its conjugacy class , a power of (why?); apply question 11.
- Conclude by induction on : every group of order is solvable (Burnside). Why does the argument break for three primes — and must it, given ?
Part V — The character table of . The smallest group Burnside’s theorem cannot touch deserves its full portrait; everything below uses only this chapter plus Exercise 1.11.
- Recall from Exercise 1.11 the five conjugacy classes of : , the double transpositions, the three-cycles, and two classes of five-cycles each, represented by and . Explain why the five-cycles split into two -classes although they form a single -class.
- Show that the irreducible degrees of are exactly : use with classes, and the fact that is perfect (), so the trivial character is its only linear one; then eliminate every other multiset (write as a sum of four squares of integers : check it happens in only one way with all summands plausible degrees).
- Let be the permutation character of on : , with values on the five classes. Compute and , and deduce that is irreducible of degree , with values .
- Same game on the unordered pairs : the fixed-point counts are . Compute , and , deduce the decomposition , and obtain the irreducible of degree with values .
- The two remaining irreducibles have degree . Column orthogonality (each nonidentity column against the identity column, and each column with itself) determines their values off the five-cycles: show on double transpositions and on three-cycles.
On the five-cycle classes, set and ; symmetry lets one take , . From the column of paired with the identity column and with the column of , derive and (and check the value given by the column of with itself), hence
the golden ratio and its conjugate. Assemble the complete character table of .
- Run the checks: the row norm of is (use ), , and Frobenius divisibility (question 8) for all five degrees. Where in the table do you see a difference with , all of whose character values are rational integers?
- Deduce from the table alone that is simple: a normal subgroup is a union of conjugacy classes containing whose cardinality divides — check that no proper sub-sum of containing the term divides . Cross-check with question 11’s criterion: verify that no class of has prime-power size .
- (Icosahedral coda) is the rotation group of the icosahedron, and the degree- representations are the two geometric actions on . Verify the trace identity: a rotation by angle has trace , and . Explain without any computation why the other degree- character must carry the conjugate value: the Galois group of acts on the whole character table (entrywise), permuting the irreducible characters.
Part VI — Complements: a central bound and the tensor square.
(Sharper than a divisibility) Let be irreducible of degree . Show that for every (Schur’s lemma: is a scalar, of finite order), and deduce from the bound
Show that the nonabelian groups of order have irreducible degrees (five conjugacy classes; write as a sum of five squares) and attain equality ; check the bound on , whose center is trivial.
(Tensor square of ) For of finite order, is diagonalizable with root-of-unity eigenvalues; deduce the character formulas
Apply them to of (note runs through the class of when runs through that of , and conversely): show and , hence
Interpret geometrically via the cross product on .
- (Final audit of the table) Verify numerically: column orthogonality between the two five-cycle columns (), the value for the column of against itself, and the vanishing of the regular character on each of the four nonidentity columns of the table.
Solution
Solution of Problem 5.1.
1. If (), then , and inductively every power is: is generated by . Conversely let . Write with : the vector satisfies ; multiplying by the adjugate matrix, for every , and since is a -combination of the , : is a root of the monic .
2. If is spanned by ’s powers up to and by ’s up to , then is spanned by the products (reduce any monomial). The subrings and are -submodules of the finitely generated -module , hence finitely generated (, generated by elements, is an image of ; a submodule pulls back to a submodule of , free of rank by Theorem 3.5, and its image generates). By question 1, and are algebraic integers.
3. If (lowest terms) is a root of a monic integer polynomial of degree , the rational root theorem (clear denominators: ) gives , so .
4. is a sum of roots of unity (Proposition 5.6), each an algebraic integer (root of ); conclude by question 2.
5. For : ( is a class). By Schur, ; taking traces, .
6. with . Conjugation by bijects the solutions for with those for : is a class function with values in , so . Substituting throughout and identifying the scalars: .
7. Let be the -module spanned by and all products ; by question 6 every such product reduces to a -combination of and the : is finitely generated, and for each . In particular is finitely generated (submodule, as in question 2), and question 1 makes an algebraic integer.
8. For an irreducible of degree :
Each is an algebraic integer (question 4), so the right side is one (questions 2, 7); it is rational, hence an integer (question 3): .
9. Bézout: with . Then
an algebraic integer.
10. Suppose and let . All values lie in , (sums of -th roots of unity). For : maps roots of unity to roots of unity (, Theorem 4.23), so is again a sum of roots of unity: ; also is an algebraic integer (it has the same minimal polynomial as ). The product is fixed by the whole Galois group, hence rational (Theorem 4.21(1)), and it is an algebraic integer with
(no factor vanishes: would force ). This contradicts question 3. Hence or , and in the latter case is scalar (Proposition 5.6).
11. Column orthogonality (): , i.e. . If every nontrivial with vanished at , then grouping the rest by their factor :
an algebraic integer — contradicting question 3. So some nontrivial has and ; since , , and question 10 makes a scalar. Now simple nonabelian: is faithful (Exercise 5.6(c)), and is a normal subgroup (the preimage under of the scalars, which form a normal — indeed central — subgroup of the image) containing : . Then is abelian and faithful, making abelian: contradiction. No simple nonabelian group has a conjugacy class of prime-power size .
12. Let be simple of order . If ( a -group): (Theorem 1.12) is normal, so : abelian. Otherwise take a Sylow -subgroup and (Theorem 1.12 again). Then , so the class of has size dividing : a power of . If the size is , : the center is a nontrivial normal subgroup, so , abelian. If the size is : question 11 forbids it for simple nonabelian . Either way a simple group of order is abelian ().
13. Induction on (: solvable). If is simple, question 12 makes it abelian, hence solvable. Otherwise pick a nontrivial proper normal subgroup: and are again of the form and smaller, so and are solvable by induction, and is solvable (Proposition 1.29). — With three primes, the key step fails: the index of a Sylow subgroup is no longer a prime power, so the class of a central element of a Sylow need not have prime-power size. And some failure is inevitable: , of order , is simple and not solvable.
14. The classes and sizes are Exercise 1.11(a). The -class of has size ; if it stayed one -class, the orbit–stabilizer count would give , not an integer — concretely, has order and sits inside , so the -class of has size : the -class splits in two ( and are conjugate in by an odd permutation only).
15. One linear character: a degree- representation factors through , and ( is simple nonabelian, and is normal, nontrivial — is not abelian). So and with each . Squares available: . A sum of four of them equal to : the largest must be ( fails to adjust: , , — no combination with or works), and (the only way: , , ): degrees .
16. (one orbit — Burnside’s count), and : contains the trivial character once, and its other constituent is a single irreducible. Hence is irreducible, of degree , with values .
17. On pairs, an element fixes iff it fixes or swaps : the counts are (), ( fixes ), ( fixes ), . Then : three irreducible constituents, each once. And , : so with irreducible of degree and values .
18. Write for the values of at , and at ; all four are real ( and are conjugate to their inverses). Column against column : , so ; column with itself: , so ; hence gives and . Column against : gives ; column with itself: gives .
19. Column against column : , so . Column against column (distinct classes, orthogonal): , so . Thus solve : with . Consistency: — matching the self-column identity . The table:
20. , using . Similarly . Frobenius divisibility: all divide . The irrational values are the visible difference with : in every element is conjugate to all generators of its cyclic group with the same cycle type — in particular — forcing rational (indeed integer) character values; in the splitting of the five-cycles opens the door to .
21. A normal subgroup is a union of classes, contains , and . The candidate sums: , , , , , , , , , , , listing all proper sub-sums containing : none of divides except itself: or . Simplicity, read off five numbers. And question 11’s criterion is visible too: the class sizes , , are all composite of two primes — no prime-power class, exactly as Burnside’s criterion demands of a simple group.
22. A rotation of by angle has eigenvalues : trace . For : , so the trace is . The nontrivial element of applied entrywise to a character table sends characters to characters (it commutes with the defining algebra: is the character of the representation obtained by transporting matrices through on the entries, or abstractly: orthogonality relations are -rational, so permutes their solutions); fixes (rational values) and must therefore exchange and : the second degree- character carries the conjugated values, no matrix computed. Geometrically, the two representations are the icosahedral action and its composite with an outer automorphism of (conjugation by a transposition), which swaps the two classes of five-cycles.
23. For , commutes with every , so by Schur’s lemma ; since has finite order, is a root of unity, and . Then
i.e. . A nonabelian group of order ( or ) has five conjugacy classes, so five irreducible degrees with ; the only way to write as a sum of five squares is : degrees . Both groups have center of order , and the degree- character attains equality: — the bound is sharp. For , and the bound reads : satisfied by with room to spare (), as it must be since equality would force (by the same chain) to vanish off the center.
24. for the order of , so is annihilated by , split with simple roots over : diagonalizable, with eigenvalues roots of unity, in an eigenbasis . The products () form an eigenbasis of with eigenvalues , and () one of ; since
and the symmetric sum adds instead of subtracting it, both formulas follow. For on the classes : squaring sends the double transpositions to , the three-cycles to three-cycles, the class of onto that of and conversely ( in , so ). Hence reads , and, using , :
Decomposing the latter, with the class sizes : ; ; ; , and likewise for . So (dimensions ) and (dimensions ). Geometry: the equivariant isomorphism , , is exactly for a rotation group; the summand of the symmetric square is the invariant quadratic form , and lives on the five-dimensional space of traceless symmetric tensors (harmonic quadratics).
25. Column of against column of :
as orthogonality demands for distinct classes (). Column of against itself: . Regular character on the four nonidentity columns:
on double transpositions and three-cycles, and on the class of (that of is its Galois conjugate):
using . The table passes every audit: it is the character table of .