Representations of Groups

⚡ Key Takeaways

A representation of a group GG is a homomorphism ρ:G→GL(V)\rho: G \to GL(V) that realizes abstract group elements as invertible linear transformations of a vector space VV. This turns group theory into linear algebra, letting matrices carry the symmetry. Representations appear everywhere symmetry acts: quantum mechanics, crystallography, number theory, and Fourier analysis. The theory was forged by Frobenius, Schur, and Burnside around 1896–1905.

💡 The Core Insight

Instead of studying a group GG in the abstract, let it act linearly. Every group element becomes a matrix, multiplication becomes matrix multiplication, and the entire representation can be broken into indecomposable pieces (irreducibles). The miracle — Maschke's theorem plus Schur's lemma — is that for finite groups over C\mathbb{C}, this decomposition is complete and rigid, and the bookkeeping reduces to characters, columns of complex numbers obeying beautiful orthogonality relations.

Formal Statement

DefinitionLinear Representation

Let GG be a group and VV a vector space over a field kk. A representation of GG on VV is a group homomorphism

1
ρ:G→GL(V),ρ(gh)=ρ(g) ρ(h),ρ(e)=idV.\quad \rho: G \to GL(V), \qquad \rho(gh) = \rho(g)\,\rho(h),\quad \rho(e) = \mathrm{id}_V.

Derivation hint: The homomorphism condition is the defining axiom; that ρ(e)=id\rho(e)=\mathrm{id} and ρ(g−1)=ρ(g)−1\rho(g^{-1})=\rho(g)^{-1} follow automatically from it. The dimension (or degree) of ρ\rho is dim⁡kV\dim_k V. Choosing a basis of an nn-dimensional VV identifies GL(V)GL(V) with GLn(k)GL_n(k), so ρ\rho becomes a homomorphism G→GLn(k)G \to GL_n(k), a matrix representation. Here:

  • GG is the group (often finite);
  • VV is the representation space, kk the ground field (usually C\mathbb{C});
  • GL(V)GL(V) is the group of invertible linear maps V→VV \to V;
  • ρ(g)\rho(g) is the linear operator assigned to gg.

An equivalent formulation: a GG-module is a kk-vector space VV with a map G×V→VG \times V \to V, (g,v)↦g⋅v(g,v)\mapsto g\cdot v, satisfying e⋅v=ve\cdot v = v, (gh)⋅v=g⋅(h⋅v)(gh)\cdot v = g\cdot(h\cdot v), and linearity in vv.

DefinitionSubrepresentation, Irreducibility, Equivalence

A subspace W⊆VW \subseteq V is a subrepresentation (or GG-invariant subspace) if ρ(g)W⊆W\rho(g)W \subseteq W for all g∈Gg\in G. A nonzero representation VV is irreducible if its only subrepresentations are 00 and VV; otherwise it is reducible. Two representations ρ:G→GL(V)\rho: G\to GL(V) and σ:G→GL(W)\sigma: G\to GL(W) are equivalent (isomorphic) if there is an invertible linear T:V→WT: V\to W with

2
T ρ(g)=σ(g) Tfor all g∈G.\quad T\,\rho(g) = \sigma(g)\,T \quad\text{for all } g\in G.

Derivation hint: Equivalence is conjugation by a fixed basis-change TT; in matrix terms σ(g)=Tρ(g)T−1\sigma(g) = T\rho(g)T^{-1}, which is exactly "same representation, different coordinates."

DefinitionCharacter

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

3
χρ:G→k,χρ(g)=tr⁡(ρ(g)).\quad \chi_\rho: G \to k, \qquad \chi_\rho(g) = \operatorname{tr}\bigl(\rho(g)\bigr).

Derivation hint: The trace is basis-independent because tr⁡(TAT−1)=tr⁡(A)\operatorname{tr}(TAT^{-1})=\operatorname{tr}(A); hence equivalent representations share a character, and χ\chi is a class function — constant on conjugacy classes since χ(hgh−1)=tr⁡(ρ(h)ρ(g)ρ(h)−1)=χ(g)\chi(hgh^{-1}) = \operatorname{tr}(\rho(h)\rho(g)\rho(h)^{-1}) = \chi(g). Note χρ(e)=dim⁡V\chi_\rho(e) = \dim V, the degree.

TheoremMaschke's Theorem

Let GG be a finite group and kk a field whose characteristic does not divide ∣G∣|G| (e.g. k=Ck=\mathbb{C}). Then every representation of GG is completely reducible: every subrepresentation W⊆VW\subseteq V has a GG-invariant complement W′W' with V=W⊕W′V = W \oplus W'. Consequently every finite-dimensional representation is a direct sum of irreducibles.

TheoremSchur's Lemma

Let V,WV, W be irreducible representations of GG over an algebraically closed field kk, and let T:V→WT: V \to W be a GG-equivariant linear map (i.e. TρV(g)=ρW(g)TT\rho_V(g) = \rho_W(g)T). Then: 1. TT is either 00 or an isomorphism. 2. If V=WV = W, then T=λ idVT = \lambda\,\mathrm{id}_V for some scalar λ∈k\lambda \in k.

TheoremOrthogonality and Completeness for Finite Groups over C\mathbb{C}

Let GG be finite. Define the Hermitian inner product on class functions

4
⟨χ,ψ⟩=1∣G∣∑g∈Gχ(g) ψ(g)‾.\quad \langle \chi, \psi\rangle = \frac{1}{|G|}\sum_{g\in G} \chi(g)\,\overline{\psi(g)}.

Derivation hint: This is the averaged L2L^2 inner product over the group; the normalizing 1/∣G∣1/|G| makes the trivial character have norm 1. Then the irreducible characters {χ1,…,χr}\{\chi_1,\dots,\chi_r\} form an orthonormal basis of the space of class functions:

5
⟨χi,χj⟩=δij,r=#{conjugacy classes of G}.\quad \langle \chi_i, \chi_j\rangle = \delta_{ij}, \qquad r = \#\{\text{conjugacy classes of }G\}.

Derivation hint: Orthonormality comes from Schur's lemma applied to the averaging projector; the count rr follows because both sides have dimension equal to the number of classes. Moreover, if d1,…,drd_1,\dots,d_r are the degrees of the irreducibles,

6
∑i=1rdi 2=∣G∣.\quad \sum_{i=1}^{r} d_i^{\,2} = |G|.

Derivation hint: Decompose the regular representation C[G]\mathbb{C}[G] into irreducibles; each irreducible of degree did_i appears exactly did_i times, and the total dimension is ∣G∣|G|.

Why It Holds / Derivation

ProofMaschke's Theorem via Averaging

We construct a GG-invariant complement to a subrepresentation W⊆VW \subseteq V.

Step 1. Choose any linear projection π0:V→W\pi_0: V \to W with π0∣W=idW\pi_0|_W = \mathrm{id}_W (exists by picking a vector-space complement, ignoring GG).

Step 2. Average π0\pi_0 over the group to make it GG-equivariant:

7
π=1∣G∣∑g∈Gρ(g) π0 ρ(g)−1.\quad \pi = \frac{1}{|G|}\sum_{g\in G} \rho(g)\,\pi_0\,\rho(g)^{-1}.

Derivation hint: The factor 1/∣G∣1/|G| requires char⁡k∤∣G∣\operatorname{char} k \nmid |G| so ∣G∣|G| is invertible in kk; this averaging trick is the workhorse of finite-group representation theory.

Step 3. Check π\pi maps into WW: since each ρ(g)\rho(g) preserves WW and π0\pi_0 lands in WW, every summand lands in WW, so im⁡π⊆W\operatorname{im}\pi \subseteq W.

Step 4. Check π∣W=idW\pi|_W = \mathrm{id}_W: for w∈Ww\in W, ρ(g)−1w∈W\rho(g)^{-1}w \in W, so π0ρ(g)−1w=ρ(g)−1w\pi_0\rho(g)^{-1}w = \rho(g)^{-1}w, hence ρ(g)π0ρ(g)−1w=w\rho(g)\pi_0\rho(g)^{-1}w = w, and averaging gives πw=w\pi w = w.

Step 5. Check π\pi is GG-equivariant: for any h∈Gh\in G,

ρ(h)πρ(h)−1=1∣G∣∑gρ(hg)π0ρ(hg)−1=π,\rho(h)\pi\rho(h)^{-1} = \frac{1}{|G|}\sum_g \rho(hg)\pi_0\rho(hg)^{-1} = \pi,

by re-indexing g↦hgg \mapsto hg.

Step 6. Then W′=ker⁡πW' = \ker\pi is GG-invariant (kernel of an equivariant map) and V=W⊕W′V = W \oplus W'. Iterating gives the full decomposition into irreducibles. ■\blacksquare

∎
ProofSchur's Lemma

Part 1. Let T:V→WT: V \to W be equivariant with V,WV,W irreducible. Then ker⁡T\ker T is a subrepresentation of VV: if v∈ker⁡Tv\in\ker T, then T(ρV(g)v)=ρW(g)Tv=0T(\rho_V(g)v) = \rho_W(g)Tv = 0. By irreducibility ker⁡T=0\ker T = 0 or VV. Likewise im⁡T\operatorname{im} T is a subrepresentation of WW, so it is 00 or WW. If T≠0T\neq 0, then ker⁡T=0\ker T = 0 and im⁡T=W\operatorname{im}T = W, so TT is an isomorphism.

Part 2. Now V=WV = W and kk algebraically closed. Since VV is finite-dimensional, TT has an eigenvalue λ∈k\lambda\in k. The map T−λ idT - \lambda\,\mathrm{id} is equivariant and has nonzero kernel (the λ\lambda-eigenspace). By Part 1, T−λ id=0T - \lambda\,\mathrm{id} = 0, so T=λ idT = \lambda\,\mathrm{id}. ■\blacksquare Why algebraic closure is needed: the eigenvalue must exist in kk; over R\mathbb{R}, rotation matrices are irreducible 2×22\times 2 representations whose commutant is C\mathbb{C}, not just scalars.

∎
mathematician · Ferdinand Georg Frobenius | 1849–1917

Frobenius, working in Berlin, single-handedly created the character theory of finite groups in a burst of papers from 1896 to 1903, prompted by a letter from Dedekind about factoring the "group determinant." He discovered the orthogonality relations, the link between characters and conjugacy classes, and induced representations — all before the matrix interpretation was standard, working instead with the abstract characters directly. His student Issai Schur and contemporary William Burnside rapidly extended the theory; Burnside's paqbp^a q^b theorem (every group of such order is solvable), proved using character theory, was an early triumph showing representations could settle questions pure group theory could not.

Building Intuition

🧠 Intuition

Think of a group as a collection of abstract symmetries — rotations of a molecule, shufflings of a deck, the structure of integers mod nn. A representation is a way of seeing those symmetries as honest matrices acting on space. The point of irreducibility is to find the smallest invariant "screens" on which the group acts indecomposably: every other action is just a stack of these. Characters are the radically efficient shortcut. Rather than carry around whole matrices, you keep only their traces — one number per conjugacy class. Astonishingly, this lossy-looking compression loses nothing: two representations with the same character are isomorphic. The orthogonality relations [5] then say the irreducible characters are orthonormal unit vectors, so decomposing any representation into irreducibles is just computing inner products — projecting onto an orthonormal basis, exactly like a Fourier expansion. Indeed, representation theory of finite groups is the generalization of Fourier analysis from the circle to arbitrary symmetry groups.

Figure
Decomposition of a representation into irreducible components, projected via character inner products
V = a₁·V₁ ⊕ a₂·V₂ ⊕ a₃·V₃ (complete reducibility) representation V project ⟨χ_V,χ_i⟩ a₁ copies of V₁ (irreducible) a₂ copies of V₂ a₃ copies of V₃ multiplicities aᵢ = ⟨χ_V , χ_i⟩ — read off by character orthogonality

Worked Examples

ExampleIrreducible Representations of S3S_3

Given: the symmetric group S3S_3 (order 6) with 3 conjugacy classes: {e}\{e\}, the transpositions {(12),(13),(23)}\{(12),(13),(23)\}, and the 3-cycles {(123),(132)}\{(123),(132)\}.

Step 1 — count and constrain. Number of irreducibles r=3r = 3 (one per conjugacy class). Degrees did_i satisfy ∑di2=∣G∣=6\sum d_i^2 = |G| = 6. The only solution in positive integers with one di=1d_i=1 (trivial rep always exists) is 12+12+22=61^2 + 1^2 + 2^2 = 6.

Step 2 — name them.

  • Trivial χtriv\chi_{\mathrm{triv}}: every g↦1g \mapsto 1.
  • Sign χsgn\chi_{\mathrm{sgn}}: g↦sgn⁡(g)=±1g \mapsto \operatorname{sgn}(g) = \pm 1.
  • Standard χstd\chi_{\mathrm{std}}: the 2-dimensional rep on {(x1,x2,x3):∑xi=0}\{(x_1,x_2,x_3): \sum x_i = 0\} inside the permutation action on C3\mathbb{C}^3.

Step 3 — character table (columns indexed by classes, with class sizes):

ee (1)transp. (3)3-cycle (2)
χtriv\chi_{\mathrm{triv}}111
χsgn\chi_{\mathrm{sgn}}1−1-11
χstd\chi_{\mathrm{std}}20−1-1

Step 4 — verify orthonormality of χstd\chi_{\mathrm{std}}:

⟨χstd,χstd⟩=16(1⋅22+3⋅02+2⋅(−1)2)=16(4+0+2)=1. ✓\langle\chi_{\mathrm{std}},\chi_{\mathrm{std}}\rangle = \tfrac{1}{6}\bigl(1\cdot 2^2 + 3\cdot 0^2 + 2\cdot(-1)^2\bigr) = \tfrac{1}{6}(4+0+2) = 1.\ \checkmark
S3 has irreducibles of degrees 1, 1, 2; character table above.\boxed{S_3 \text{ has irreducibles of degrees } 1,\,1,\,2;\ \text{character table above.}}
ExampleDecomposing the Permutation Representation of S3S_3

Given: S3S_3 acts on C3\mathbb{C}^3 by permuting coordinates; this is the permutation representation ρperm\rho_{\mathrm{perm}}.

Step 1 — compute its character. χperm(g)=#{fixed points of g}\chi_{\mathrm{perm}}(g) = \#\{\text{fixed points of }g\}.

  • χperm(e)=3\chi_{\mathrm{perm}}(e) = 3 (all fixed)
  • χperm(transposition)=1\chi_{\mathrm{perm}}(\text{transposition}) = 1 (one fixed point)
  • χperm(3-cycle)=0\chi_{\mathrm{perm}}(\text{3-cycle}) = 0 (no fixed points)

Step 2 — find multiplicities ai=⟨χperm,χi⟩a_i = \langle\chi_{\mathrm{perm}}, \chi_i\rangle using class sizes (1,3,2)(1,3,2):

atriv=16(1⋅3⋅1+3⋅1⋅1+2⋅0⋅1)=16(3+3+0)=1.a_{\mathrm{triv}} = \tfrac{1}{6}(1\cdot 3\cdot 1 + 3\cdot 1\cdot 1 + 2\cdot 0\cdot 1) = \tfrac{1}{6}(3+3+0) = 1.
asgn=16(1⋅3⋅1+3⋅1⋅(−1)+2⋅0⋅1)=16(3−3+0)=0.a_{\mathrm{sgn}} = \tfrac{1}{6}(1\cdot 3\cdot 1 + 3\cdot 1\cdot(-1) + 2\cdot 0\cdot 1) = \tfrac{1}{6}(3-3+0) = 0.
astd=16(1⋅3⋅2+3⋅1⋅0+2⋅0⋅(−1))=16(6+0+0)=1.a_{\mathrm{std}} = \tfrac{1}{6}(1\cdot 3\cdot 2 + 3\cdot 1\cdot 0 + 2\cdot 0\cdot(-1)) = \tfrac{1}{6}(6+0+0) = 1.

Step 3 — check dimensions: 1⋅1+0⋅1+1⋅2=3=dim⁡C3. ✓1\cdot 1 + 0\cdot 1 + 1\cdot 2 = 3 = \dim\mathbb{C}^3.\ \checkmark

ρperm≅χtriv⊕χstd\boxed{\rho_{\mathrm{perm}} \cong \chi_{\mathrm{triv}} \oplus \chi_{\mathrm{std}}}

The trivial part is the diagonal line C(1,1,1)\mathbb{C}(1,1,1); the standard 2-dim part is the sum-zero plane.

Common Misconceptions

⚠️ Common mistake

"Reducible" does not mean "decomposes as a direct sum." Over fields where Maschke fails (e.g. char⁡k∣∣G∣\operatorname{char} k \mid |G|, called the modular case), a representation can have a proper invariant subspace with no invariant complement — it is reducible but indecomposable. Complete reducibility is a special feature of the non-modular setting, not a general law. Also beware: an irreducible complex representation need not stay irreducible over R\mathbb{R}, and vice versa.

CounterexampleMaschke Fails in Characteristic pp

Let G=Z/pG = \mathbb{Z}/p act on V=k2V = k^2 over k=Fpk = \mathbb{F}_p via

ρ(1)=(1101).\rho(1) = \begin{pmatrix} 1 & 1 \\ 0 & 1\end{pmatrix}.

The line W=span⁡{(1,0)}W = \operatorname{span}\{(1,0)\} is invariant. But the only invariant line is WW itself (the matrix is a single Jordan block), so there is no invariant complement. Thus VV is reducible yet indecomposable, and Maschke's theorem genuinely requires char⁡k∤∣G∣=p\operatorname{char} k \nmid |G| = p. The averaging proof breaks because 1/∣G∣=1/p1/|G| = 1/p does not exist in Fp\mathbb{F}_p.

⚠️ Common mistake

The character does not determine the representation over arbitrary fields, only over C\mathbb{C} (or fields where Maschke holds and that are large enough). Moreover, the character is a class function, so it sees only conjugacy-class data — it cannot distinguish ρ(g)\rho(g) as an operator beyond its trace. Two genuinely different elements can have equal character values without that meaning anything is wrong.

Connections

connection

Representation theory sits at a busy crossroads. It is the linear shadow of Group Theory: abstract groups studied through matrices. The whole apparatus of characters is literally Fourier Analysis generalized — for G=Z/nG = \mathbb{Z}/n the irreducible characters are the discrete exponentials e2πikm/ne^{2\pi i k m/n}, and Fourier transform = decomposition into irreducibles. The decomposition theory is governed by Linear Algebra (eigenvalues, traces, inner products) and is cleanly packaged by the Group Algebra C[G]\mathbb{C}[G], where Maschke's theorem becomes the statement that C[G]\mathbb{C}[G] is semisimple, a special case of Wedderburn's Theorem. Continuous symmetries push the same ideas into Lie Groups and Lie Algebras, and arithmetic ones into Galois Representations.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1837 — Cauchy and others study substitution (permutation) groups concretely, an implicit precursor to matrix actions.
- 1872–1880s — Klein's Erlangen program elevates symmetry/transformation groups to the central organizing principle of geometry.
- 1896 — Frobenius, prompted by Dedekind's group-determinant problem, defines group characters and proves the orthogonality relations, founding the subject.
- 1897 — Frobenius introduces induced representations and the reciprocity (Frobenius reciprocity) governing induction and restriction.
- 1897–1900 — Burnside develops representation theory in parallel; his textbook (1897, 2nd ed. 1911) becomes the standard reference.
- 1904 — Burnside proves the paqbp^a q^b theorem (such groups are solvable) using character theory — a landmark application.
- 1905 — Schur proves Schur's lemma and clarifies the matrix-theoretic foundations; introduces the Schur orthogonality relations and projective representations.
- 1929 — Emmy Noether recasts the whole theory in terms of modules over the group algebra, making Maschke and Wedderburn structural statements about semisimple algebras.
- 1939–1962 — Weyl, Wigner, and Mackey extend the theory to Lie groups and infinite groups, cementing its role in physics and harmonic analysis.

Subtleties & Limits

open-problem

Modular representation theory — the study of representations over fields whose characteristic divides ∣G∣|G| — abandons complete reducibility and replaces clean orthogonality with the subtle machinery of blocks, defect groups, and Brauer characters. Deep conjectures remain open here: Brauer's k(B)k(B) conjecture, the Alperin weight conjecture, and Broué's abelian defect group conjecture all probe how local subgroup structure controls global representation theory and are unproven in general. Even in characteristic zero, classifying all irreducible representations of an arbitrary infinite or profinite group is wide open, and the representation theory underlying the Langlands program connects these questions to some of the hardest problems in number theory.

See Also

Character Theory · Group Theory · Group Algebra · Schur's Lemma · Maschke's Theorem · Fourier Analysis · Lie Groups and Lie Algebras · Wedderburn's Theorem · Galois Representations