Group Actions and Representations
Learning objectives
- Define group homomorphisms and identify their kernels and images
- Define a representation as a linear realisation of a group
- Recognise irreducibility and state Maschke's theorem for finite groups in characteristic zero
- Compute the character of a small representation and use it to test isomorphism
Abstract groups are hard; matrices are easy. A representation is the bridge: a structure-preserving map from an abstract group into the group of invertible matrices, so every theorem of linear algebra becomes a theorem about the group. Once you can write down the matrices for a few generators, you can compute orders, find conjugacy classes, decompose the representation into irreducibles, and read off the character table. Representation theory is how physicists actually use groups, and it is the entry point to most modern algebra.
Homomorphisms first
A group homomorphism is a map between groups that preserves the operation: for all . Two consequences fall out for free: and . The kernel is always a normal subgroup of , and the image is a subgroup of . The First Isomorphism Theorem says : the quotient by the kernel is exactly the image, packaged as an isomorphism.
From homomorphism to representation
A representation of on a vector space over a field is a group homomorphism
where is the group of invertible -linear maps . If we fix a basis , the homomorphism becomes a map : every group element is assigned an invertible matrix in a way compatible with multiplication. The dimension of the representation is .
The mapping-arrows widget above shows a homomorphism as arrows from one set to another. Set the source to a 4-element group and the target to ; the map collapses pairs of elements to a single image, the kernel is the subgroup of even elements. Every representation is this picture in disguise, with as the target set.
Irreducibility and Maschke's theorem
A subspace is -invariant if for every . A representation is irreducible if its only invariant subspaces are and itself, it cannot be cut into smaller pieces compatible with the group action.
Maschke's theorem. If is a finite group and is a field whose characteristic does not divide (typically ), then every representation of decomposes as a direct sum of irreducibles: . This is the foundation of representation theory, understanding irreducibles is enough to understand everything.
Characters
The character of a representation is the function defined by , the trace of the matrix. Characters are constant on conjugacy classes and satisfy strong orthogonality relations. The miracle: two representations of a finite group are isomorphic if and only if they have the same character. So the character, one number per conjugacy class, is a complete invariant. The character table of a finite group is a small matrix that captures all of its representation theory.
- Quantum mechanics: Angular momentum is described by irreducible representations of . The spin quantum number literally indexes the -dimensional irreducibles. Selection rules in atomic spectra come from character-theoretic vanishing.
- Crystallography: Every crystal lattice has a space group of symmetries. Character tables of the space groups are tabulated in the International Tables for Crystallography and used to predict which X-ray diffraction reflections vanish by symmetry.
- Particle physics: The eightfold way that organised hadrons in the 1960s, predicting the particle before it was found, was the decomposition of tensor products of representations.
- Signal processing: The Fourier transform on a finite abelian group is the change of basis to the basis of irreducible (1-dimensional) representations. The fast Fourier transform exploits the regular representation's decomposition.
Pause and think: Let be . What is ? Is surjective? What does the First Isomorphism Theorem say about ?
Try it
- Predict first: define by and . Check that , the homomorphism property is satisfied. Is this representation irreducible? (Hint: are the standard basis vectors each in invariant 1-dimensional subspaces?)
- Define by mapping the generator to rotation by . Write the matrix. Compute its trace: this is the character value .
- True or false: a 1-dimensional representation is always irreducible. (Hint: what are the possible invariant subspaces of a 1-dimensional ?)
- Find where \det : GL_n(\mathbb{R}) \to \mathbb{R}^\times is the determinant homomorphism. Name this subgroup.
A trap to watch for
A common confusion is to think a representation must be faithful, that distinct group elements must map to distinct matrices. They do not. The map sending every to the identity matrix is a perfectly valid representation, called the trivial representation; its kernel is all of . A representation is faithful precisely when , and many useful representations are not. Cayley's theorem guarantees that some faithful representation always exists (the regular representation), but irreducibility, character data, and Maschke's decomposition are interesting even for non-faithful representations.
What you now know
You can recognise a group homomorphism, identify its kernel and image, write down a representation as a homomorphism to a matrix group, and compute characters of low-dimensional examples. The next section moves to richer algebraic structures, rings, where you have two operations, and ideals replace normal subgroups as the right notion of "kernel-like substructure."
Mark section complete →
References
- Garrity, T. (2002). All the Mathematics You Missed: But Need to Know for Graduate School. Cambridge University Press, ch. 11.
- Dummit, D. S., Foote, R. M. (2003). Abstract Algebra (3rd ed.). Wiley, ch. 18-19.
- Artin, M. (2010). Algebra (2nd ed.). Pearson, ch. 9.
- Serre, J.-P. (1977). Linear Representations of Finite Groups. Springer, ch. 1-2.
- Fulton, W., Harris, J. (2004). Representation Theory: A First Course. Springer, ch. 1-2.