Representations of Finite Groups

A representation of a finite group $G$ is a homomorphism $\rho :G\to GL(V)$ that realizes abstract group elements as invertible linear transformations of a vector space $V$. The central result is that every representation of a finite group over $\mathbb{C}$ decomposes uniquely into irreducible pieces, and these irreducibles are completely captured by their characters. Applies wherever symmetry acts linearly: quantum mechanics, crystallography, number theory, error-correcting codes. Developed by Frobenius, Schur, and Burnside around 1896–1905.

A representation turns the multiplication of a finite group into the multiplication of matrices, converting algebra into linear algebra — the most computable branch of mathematics. Given a group $G$ and a field $k$, a representation is a $k$-vector space $V$ together with an action of $G$ by linear automorphisms, equivalently a homomorphism $\rho :G\to GL(V)$. Its importance is that linear algebra is fully understood, so studying how a group can act linearly reveals deep structural information about the group itself. The surprising fact, due to Maschke and Schur, is that over $\mathbb{C}$ the entire theory collapses to a finite table of complex numbers — the character table — from which one can read off nearly everything: number of irreducibles, their dimensions, normal subgroups, and even whether the group is abelian or simple.

The Core Insight

The group algebra $\mathbb{C}[G]$ of a finite group is semisimple: it splits as a product of matrix algebras, one for each irreducible representation. This single algebraic fact (Maschke + Wedderburn) forces complete reducibility, orthogonality of characters, and the dimension formula $|G|=\sum d_i^2$. The whole subject is the systematic exploitation of this decomposition.

Formal Statement

Representation

Let $G$ be a finite group and $k$ a field. A representation of $G$ over $k$ is a finite-dimensional $k$-vector space $V$ together with a group homomorphism

The integer ${\dim }_{k}V=n$ is the degree (or dimension) of the representation. Choosing a basis of $V$ identifies $GL(V)\cong G{L}_n(k)$, so $\rho$ becomes a homomorphism into invertible $n\times n$ matrices. We often write $g\cdot v$ for $\rho (g)v$ and call $V$ a $G$-module.

Subrepresentation, Irreducibility, Equivalence

A subrepresentation is a subspace $W\subseteq V$ with $\rho (g)W\subseteq W$ for all $g$. A nonzero representation $V$ is irreducible (or simple) if its only subrepresentations are $0$ and $V$. Two representations $\rho :G\to GL(V)$ and $\sigma :G\to GL(W)$ are equivalent (isomorphic) if there is a linear isomorphism $T:V\to W$ with

Character

The character of a representation $\rho :G\to GL(V)$ is the function

Because $\mathrm{tr}(\rho (hg{h}^{-1}))=\mathrm{tr}(\rho (g))$, characters are constant on conjugacy classes; they are class functions. Note ${\chi }_{\rho }(e)=\dim V$.

Maschke's Theorem

Let $G$ be a finite group and $k$ a field whose characteristic does not divide $|G|$ (in particular $k=\mathbb{C}$). Then every representation of $G$ over $k$ is completely reducible: it decomposes as a direct sum of irreducible subrepresentations,

Schur's Lemma

Let $V,W$ be irreducible complex representations and $T:V\to W$ a $G$-equivariant linear map ($T\rho (g)=\sigma (g)T$). Then:

1. If $V\ncong W$, then $T=0$.
2. If $V=W$, then $T=\lambda \mathrm{id}$ for some scalar $\lambda \in \mathbb{C}$.

Orthogonality and the Character Table

Define the inner product on class functions

Then the irreducible characters ${\chi }_1,\dots ,{\chi }_r$ form an orthonormal basis of the space of class functions:

Consequently the number $r$ of irreducible representations equals the number of conjugacy classes, and

Why It Holds

Maschke's Theorem via Averaging

We show every subrepresentation has a $G$-invariant complement.

Schur's Lemma

Let $T:V\to W$ be equivariant, $V,W$ irreducible over $\mathbb{C}$.

Ferdinand Georg Frobenius | 1849–1917

Frobenius single-handedly founded the character theory of finite groups in a burst of papers from 1896 to 1900, motivated by a question Dedekind posed about factoring the "group determinant." Without yet having matrices in mind, he discovered orthogonality relations, the dimension formula $|G|=\sum d_i^2$, and the induced character. Issai Schur, his student, recast everything in the cleaner language of matrices and modules, proving Schur's Lemma and the orthogonality relations in the form used today. Burnside, working in parallel in England, wrote the first influential textbook and proved his celebrated $p^a{q}^b$ theorem — that no nonabelian simple group has order divisible by only two primes — using characters in a way no purely group-theoretic argument matched for decades.

Building Intuition

Think of a group $G$ as a set of abstract symmetries and a representation as a way of seeing those symmetries acting on space. The trivial representation sees nothing (everything maps to $1$); a faithful representation sees everything. Irreducible representations are the "atoms" — the smallest pieces of space that $G$ can shuffle without breaking into smaller invariant chunks, and Maschke says every action is a clean stack of these atoms with no entanglement (no nontrivial extensions).

The character is a brilliant compression: instead of recording entire matrices, you record only their traces. Astonishingly, this loses no information for distinguishing irreducibles — two complex representations are equivalent iff they have equal characters. The character table is a finite square grid ($r$ irreducibles $\times$ $r$ conjugacy classes), and orthogonality makes its rows and columns orthonormal vectors. Computing a representation's "irreducible content" becomes computing inner products — projecting a vector onto an orthonormal basis, exactly like Fourier analysis. Indeed representation theory is the nonabelian generalization of Fourier series.

Decomposition of a representation into irreducible components, analogous to projecting onto an orthonormal basis

Worked Examples

Character Table of $S_3$

From $⟨{\chi }_3,{\chi }_2⟩=0$: $\frac{1}{6}(2-3b+2c)=0$. Subtracting gives $6b=0\Rightarrow b=0$, then $2+2c=0\Rightarrow c=-1$.

Decomposing the Permutation Representation of $S_3$

• $e$: fixes $3$ points $\Rightarrow \chi =3$.
• transposition: fixes $1$ point $\Rightarrow \chi =1$.
• $3$-cycle: fixes $0$ points $\Rightarrow \chi =0$.

So ${\chi }_{\text{perm}}=(3,1,0)$.

• $m_1=\frac{1}{6}(1\cdot 3\cdot 1+3\cdot 1\cdot 1+2\cdot 0\cdot 1)=\frac{1}{6}(6)=1$.
• $m_2=\frac{1}{6}(1\cdot 3\cdot 1+3\cdot 1\cdot (-1)+2\cdot 0\cdot 1)=\frac{1}{6}(0)=0$.
• $m_3=\frac{1}{6}(1\cdot 3\cdot 2+3\cdot 1\cdot 0+2\cdot 0\cdot (-1))=\frac{1}{6}(6)=1$.

This is the familiar fact: ${\mathbb{C}}^3$ splits into the line $⟨e_1+e_2+e_3⟩$ (fixed by all permutations = trivial) and its $2$-dimensional complement $\{x:\sum x_i=0\}$ (the standard representation). Verify: $1\cdot 1+1\cdot 2=3=\dim {\mathbb{C}}^3$. ✓

Common Misconceptions

The line $W=⟨e_1⟩$ is invariant, but it has no invariant complement: any $G$-stable line must be an eigenspace, and $\rho (1)$ has only the single eigenvalue $1$ with one-dimensional eigenspace $W$. So $V={\mathbb{F}}_p^2$ is reducible but not completely reducible — Maschke genuinely requires $p\nmid |G|$.

Connections

Representation theory sits at a crossroads of algebra and analysis. The decomposition $\mathbb{C}[G]\cong {\prod }_i{M}_{d_i}(\mathbb{C})$ is an instance of the Wedderburn–Artin Theorem for semisimple algebras, and Maschke's theorem is precisely the statement that $\mathbb{C}[G]$ is semisimple. Characters generalize the Discrete Fourier Transform: for abelian $G$, the irreducible characters are exactly the group homomorphisms $G\to {\mathbb{C}}^{\times }$ and form the Pontryagin Dual, recovering ordinary Fourier analysis on $\mathbb{Z}/n$. The orthogonality relations are an instance of the Peter–Weyl Theorem for the finite (compact) group $G$. The induced representation construction connects to Frobenius Reciprocity and underlies Galois Representations in number theory.

Real-World Applications

1. Quantum mechanics & spectroscopy — Molecular vibration modes and atomic orbitals decompose into irreducibles of the molecule's symmetry group; selection rules for spectral transitions are character-table computations (group theory in chemistry, the "$C_{3v}$, $T_d$, $O_h$ point groups").
2. Crystallography — The $230$ space groups classify crystal symmetries; band structures in solids (electrons in a periodic potential) are labeled by irreducible representations at points of the Brillouin zone.
3. Particle physics — The classification of fundamental particles uses irreducible representations of $SU(2)$, $SU(3)$ (the "eightfold way" predicting the ${\Omega }^{-}$), and the Lorentz group; the finite-group ideas here are the conceptual seed.
4. Error-correcting codes — Many good codes (e.g. quadratic residue and Reed–Muller codes) are ideals in group algebras; their parameters are controlled by representation theory.
5. The Fast Fourier Transform — The FFT is the abelian case of a general algorithmic theory of computing in $\mathbb{C}[G]$ using the matrix-block decomposition.
6. Random walks and card shuffling — Mixing times of random walks on groups (e.g. Diaconis's analysis of riffle shuffles) are governed by eigenvalues read off from characters.
7. Number theory — Artin $L$-functions attach to representations of Galois groups; the Langlands program is built on understanding such representations.

Historical Development

• 1837 — Gauss and Dirichlet implicitly use characters of abelian groups in studying quadratic reciprocity and primes in arithmetic progressions (Dirichlet characters).
• 1896 — Frobenius, prompted by Dedekind's letters about the "group determinant," defines characters of nonabelian finite groups and proves the orthogonality relations and dimension formula.
• 1897 — Frobenius introduces induced representations and proves Frobenius reciprocity.
• 1898 — Heinrich Maschke proves complete reducibility for representations over fields of suitable characteristic.
• 1905 — Issai Schur recasts the theory in matrix language, proves Schur's Lemma, and gives the clean modern derivation of orthogonality.
• 1904 — William Burnside proves the $p^a{q}^b$ theorem via character theory, a result with no elementary proof for over 60 years.
• 1911 — Burnside's second edition of Theory of Groups of Finite Order makes representation theory a standard tool.
• 1935 — Richard Brauer founds modular representation theory (characteristic $p\mid |G|$), where Maschke fails.
• 1955–63 — Brauer's and others' character-theoretic methods become indispensable in the classification of finite simple groups.

Subtleties & Limits

Over $\mathbb{C}$ the theory is essentially complete, but several frontiers remain. Modular representation theory (characteristic $p\mid |G|$) is far subtler: decomposition matrices and the structure of indecomposable (not irreducible) modules are governed by deep conjectures, including Broué's abelian defect conjecture and Donovan's conjecture, still open in general. For infinite families of groups, computing character tables explicitly is hard; the character tables of the finite groups of Lie type were determined by Deligne–Lusztig theory (1976), a profound achievement, yet "Lusztig's conjecture" on modular characters resisted full proof for decades. Even rationality questions — whether a representation can be realized over $\mathbb{Q}$ or $\mathbb{R}$ rather than $\mathbb{C}$, controlled by the Frobenius–Schur indicator — connect to subtle arithmetic (the Brauer–Witt and Schur index theory). Finally, the precise relationship between a group's character table and the group itself is incomplete: nonisomorphic groups can share a character table (e.g. the order-$8$ groups $D_4$ and $Q_8$), so the table does not determine $G$.

See Also