Representation Theory of Finite Groups
Representation Theory of Finite Groups
Section titled “Representation Theory of Finite Groups”Tier: A (Advanced), reaching R. Builds on group theory and linear algebra. The subject turns abstract group structure into concrete linear algebra, and the payoff is that questions about groups become questions about matrices — where the tools are much sharper.
Recall prompts
Section titled “Recall prompts”Attempt these from memory before reading.
- Define a representation of a group on a vector space .
- What does it mean for a representation to be irreducible?
- State Schur’s lemma.
- What is the character of a representation?
- How many irreducible representations does a finite group have?
Motivation: why turn groups into matrices
Section titled “Motivation: why turn groups into matrices”An abstract group is a set with a multiplication table. That table is complete and it is unusable: from the table alone, answering “is this group isomorphic to that one?” or “does this group have a subgroup of order 12?” is genuinely hard.
A representation is a homomorphism — every group element becomes an invertible matrix, and the multiplication table becomes matrix multiplication. The point is not that matrices are familiar. The point is that a representation decomposes, and the pieces into which it decomposes are the irreducible representations. Group theory becomes a classification problem about building blocks.
The two results that make the subject work, both due to Frobenius and Schur around 1896–1901:
- There are finitely many irreducible representations, as many as there are conjugacy classes.
- Every representation is a direct sum of irreducibles.
So the irreducibles are atoms, and every representation has a unique decomposition into them. That is the same shape as the spectral theorem — a decomposition into indecomposable pieces — and the parallel is exact: for a compact group, the Peter–Weyl theorem is the spectral theorem applied to the regular representation.
Definitions
Section titled “Definitions”Definition (F). A representation of on a complex vector space is a homomorphism . It is irreducible if the only -invariant subspaces are and .
Definition (F). The character of is .
The character is a class function: it is constant on conjugacy classes, because trace is invariant under conjugation. That is why characters are recorded in tables indexed by conjugacy classes — and why the number of irreducibles equals the number of conjugacy classes.
Schur’s lemma, and why everything follows
Section titled “Schur’s lemma, and why everything follows”Theorem (U, Schur’s Lemma). Let be irreducible representations of and a -linear map.
- If then .
- If then is a scalar multiple of the identity.
Proof idea. and are -invariant, so by irreducibility each is or everything. For (1), cannot be injective and surjective at once or it would be an isomorphism. For (2), is finite-dimensional over so has an eigenvalue ; then is -linear with non-trivial kernel, so by irreducibility it is zero.
Why this lemma carries the subject. Every major theorem — orthogonality of characters, the uniqueness of decomposition, the sum-of-squares formula — is proved by constructing a -linear map and applying Schur’s lemma. The proof technique is: build the averaging operator
which is -linear for any linear , then read off what Schur’s lemma says about it.
Worked example (U). For an irreducible and any , apply the averaged rank-one operator . Schur’s lemma gives , and taking traces computes . Rearranged:
which is the first orthogonality relation for matrix coefficients. Every orthogonality relation in the subject comes from this one computation.
Characters and the orthogonality relations
Section titled “Characters and the orthogonality relations”Definition. .
Theorem (U, orthogonality). The irreducible characters are orthonormal: . Every character is a non-negative integer combination of irreducible characters, and the multiplicity of in is .
Worked example (U, the character table of ). has three conjugacy classes: , transpositions (3 of them), 3-cycles (2 of them). So there are three irreducibles. The trivial and sign representations give two; the third is found from , so :
| (12) | (123) | ||
|---|---|---|---|
| trivial | 1 | 1 | 1 |
| sign | 1 | 1 | |
| standard | 2 | 0 |
The standard representation is the action on modulo the diagonal, and it is where the symmetry of the three roots of a cubic lives — which is exactly how Galois theory connects to representation theory.
Exercise. Verify the orthogonality relations hold for this table, and compute for each irreducible, where is the character of the regular representation.
The regular representation and the sum-of-squares theorem
Section titled “The regular representation and the sum-of-squares theorem”Theorem (U). The regular representation of decomposes as
with . Taking dimensions:
Worked example (U). For : ✓. For the quaternion group : four one-dimensional irreducibles and one two-dimensional, giving ✓.
The sum-of-squares theorem is a hard constraint. It immediately rules out candidate character tables before any representation is constructed, and it is the first thing to check whenever a table is being built.
Proofs
Section titled “Proofs”Two proofs. The first derives character orthogonality from the matrix-coefficient relation computed above; the second derives both the regular-representation decomposition and the sum-of-squares formula from it. Neither needs a new idea — both are Schur’s lemma applied to a different averaged operator, which is the point the page has been making.
Theorem (character orthogonality). For irreducible ,
Proof. Sum the matrix-coefficient relation over the diagonal indices and . The left side becomes , since a character is the trace and the trace is the sum of diagonal entries. The right side becomes .
One line, and it is worth being clear about why: a character is a sum of matrix coefficients, and the matrix-coefficient relation is an orthogonality statement for each coefficient separately, so summing the relation over diagonal indices is exactly the operation “take the inner product of the traces”. The converse direction also holds and is useful: any relation among characters gives a relation among representations, because is the multiplicity of in .
Theorem (regular representation). , and consequently .
Proof. The character of the regular representation is
because left multiplication by permutes with no fixed points unless . Decompose , so . Taking the inner product with :
Every multiplicity equals the dimension. Taking dimensions of both sides, .
The computation is again one line, and again it is Schur’s lemma doing the work — character orthogonality is Schur’s lemma summed over the group. What makes the result striking is that a statement with no visible input from analysis, the arithmetic identity , comes out of an orthogonality relation. The number of conjugacy classes equals the number of irreducible representations, and summing the squares of the dimensions exhausts the group.
Counterexamples
Section titled “Counterexamples”| Claim | True? | Counterexample |
|---|---|---|
| Characters determine the representation | yes, over | false over : the two complex conjugate 2-dimensional irreducibles of have the same real character |
| Irreducible implies one-dimensional | no | the standard representation of is 2-dimensional and irreducible |
| determines | no | in : characters are class functions |
| Subrepresentations always split | no, over or | over they do (complete reducibility); over fields of characteristic dividing $ |
The last row is the research frontier. Modular representation theory studies representations over fields whose characteristic divides , where Maschke’s theorem fails, representations need not be semisimple, and the classification becomes vastly harder. The decomposition matrix relating ordinary and modular irreducibles is the central object, and Brauer theory is its framework.
Where the research frontier is
Section titled “Where the research frontier is”- Modular representation theory. Over a field of characteristic dividing , complete reducibility fails. The subject becomes the study of indecomposable modules, Brauer characters, and decomposition matrices. The McKay correspondence connects the irreducible representations of a finite subgroup of to the affine Dynkin diagrams; a bridge from representation theory to algebraic geometry that is still generating work.
- Character degrees. The set of irreducible character degrees strongly constrains the group: is solvable iff every character degree is coprime to its prime factors… the precise statement is the Itô–Michler theorem, and the converse directions of several such results are recent.
- Categorification. Khovanov homology categorifies the Jones polynomial; geometric representation theory categorifies the entire character theory. This is where representation theory meets topology.
More counterexamples
Section titled “More counterexamples”| Object | Looks like | Is actually |
|---|---|---|
| implies | true over | false over |
| $d_i \mid | G | $ |
| Every group of order is abelian | yes | and hence has only 1-dimensional irreducibles |
| Irreducible characters are linearly independent | yes | that is why the character table has no repeated rows |
Recall prompts: attempt after reading
Section titled “Recall prompts: attempt after reading”- State Schur’s lemma in both parts.
- Why are characters class functions?
- State the sum-of-squares theorem and apply it to .
- What does Maschke’s theorem say, and where does it fail?
- What is the McKay correspondence?
Interleaving problems
Section titled “Interleaving problems”Mix these with material from Abstract Algebra, Linear Algebra, Spectral Theory and Measure Theory.
- (Group theory.) Show that every group of order is abelian, and deduce that all its irreducibles are 1-dimensional.
- (Linear algebra.) Prove that a finite group of unitary matrices is diagonalisable, using averaging over the group.
- (Spectral theory.) Show that the left-regular representation of a compact group extends to a decomposition of , and connect to the Peter–Weyl theorem.
- (Measure theory.) For a compact group with Haar measure, show the matrix coefficients of inequivalent irreducibles are orthogonal in .
- (Research.) Show that the number of irreducible representations of a finite abelian group equals its order, and reconcile this with the sum-of-squares theorem.
See Also
Section titled “See Also”- Groups and Subgroups; the group theory background
- Field Theory; where the characteristic comes from
- Galois Theory Fundamentals: the standard representation of and the cubic
- Spectral Theory of Self-Adjoint Operators: the parallel decomposition theorem
- How to Use These Notes; the method