Reducible and Irreducible Representations

A representation turns an abstract group into concrete matrices: to each element gg it assigns an invertible operator D(g)D(g) on a vector space VV, faithfully trading the group's multiplication law for the composition of operators. The moment you have such matrices, one question dominates everything that follows — can the action be simplified? Does VV break into smaller pieces, each closed under the whole group and carrying its own self-contained representation? The answer is the organizing principle of the entire subject, sorting every representation into two families with sharply different behaviour. The pivot is a single idea, invariance. A subspace W⊆VW\subseteq V is invariant if the group never pushes a vector of WW out of WW, that is D(g)W⊆WD(g)W\subseteq W for every gg. If some proper nonzero WW is invariant, the representation is reducible, and in a basis adapted to WW the matrices go block upper-triangular — the information has partly separated. The stronger, cleaner situation is full reducibility: if the leftover directions also form an invariant subspace, the matrices become block-diagonal and the representation is literally a direct sum of two smaller ones. These two notions genuinely differ in general — reducible-but-indecomposable representations exist — yet for the groups physics cares about they always coincide, thanks to one mechanism: averaging over the group builds an invariant inner product, and unitarity does the rest (Maschke's theorem for finite groups, Weyl's unitary trick for compact ones). Grant it, and every representation dissolves into irreducible atoms with definite multiplicities, ready for Schur's lemmas and characters to finish the accounting.

Key takeaways
  • A representation D:G→GL(V)D:G\to GL(V) is reducible if VV has a proper nonzero subspace invariant under every D(g)D(g); with none it is irreducible — an indivisible atom.
  • One invariant subspace forces block upper-triangular matrices; a complementary invariant subspace forces block-diagonal ones, so D=D1⊕D2D=D_1\oplus D_2 (full reducibility).
  • Averaging any inner product over a finite or compact group makes it GG-invariant and DD unitary, so every invariant subspace gains an invariant complement — Maschke's theorem and Weyl's unitary trick.
  • Iterating gives the canonical decomposition D≅⨁μmμD(μ)D\cong\bigoplus_\mu m_\mu D^{(\mu)}, with multiplicities mμ=1∣G∣∑gχ(μ)(g)∗χ(g)m_\mu=\tfrac1{|G|}\sum_g \chi^{(\mu)}(g)^\ast\chi(g) read off from characters.
  • DD is irreducible exactly when its character has unit norm, 1∣G∣∑g∣χ(g)∣2=1\tfrac1{|G|}\sum_g|\chi(g)|^2=1 — the S3S_3 permutation representation has norm 22 and splits as trivial ⊕\oplus standard.
  • Reducibility depends on field and group: it need not imply decomposability for non-compact groups or in modular characteristic.
  • Key idea: invariance of a subspace under the whole group is the only thing that matters — a single invariant subspace makes the matrices block-triangular (reducible), a pair of complementary invariant subspaces makes them block-diagonal (fully reducible), and averaging guarantees the second whenever the group is finite or compact, so every such representation is a direct sum of irreducible atoms.
The core insight

Invariance of a subspace under the whole group is the only thing that matters: a single invariant subspace makes the matrices block-triangular (reducible); a pair of complementary invariant subspaces makes them block-diagonal (fully reducible). Averaging guarantees the second whenever the group is finite or compact, so every such representation is a direct sum of irreducible atoms.

Where this lives today

Reducing a representation into irreducibles is the daily arithmetic of symmetry. In molecular spectroscopy the 3N3N Cartesian displacements of an NN-atom molecule form a reducible representation of the point group; decomposing it by formula (7) classifies the vibrational normal modes, predicts infrared and Raman activity, and block-diagonalizes the dynamical matrix into small blocks. In coordination chemistry the crystal-field splittings of Worked Example 3 underlie the colours and magnetism of transition-metal compounds. In particle physics the same logic organizes the hadron spectrum: tensor products of SU(3)SU(3) representations are reducible, and their decomposition is the "Eightfold Way" that sorted mesons and baryons into multiplets and predicted the Ω−\Omega^-. Wherever a numerical eigenvalue problem carries a symmetry, the averaging projector Pμ=dμ∣G∣∑gχ(μ)(g)∗D(g)P_\mu=\tfrac{d_\mu}{|G|}\sum_g\chi^{(\mu)}(g)^\ast D(g) pre-block-diagonalizes it, turning symmetry into computational speed. The open frontier is modular representation theory — the characteristic-pp world where Maschke fails — now central to number theory and the classification of finite simple groups.

The physical picture

Watch the matrices D(g)D(g) act on VV. Suppose one subspace WW is a trap the group can never escape — every D(g)D(g) sends WW back into WW. Then the action restricted to WW is a smaller, self-contained representation, and in a basis whose first vectors span WW each matrix takes a definite shape: a top-left block that is the action on WW, and a lower-left block forced to be zero, since a basis vector of WW can only map into WW. That vanishing corner is block upper-triangular form — the whole visual content of "reducible", a representation partly but not fully come apart.

Figure
From one invariant subspace to a direct sum: an invariant W forces the lower-left block to vanish (reducible, block upper-triangular), and averaging over a finite or compact group makes the upper-right block vanish too (fully reducible, block-diagonal), splitting V of dimension 4 into W ⊕ W′ of dimensions 2 + 2
Invariance zeroes the lower-left block; averaging zeroes the upper-right block too reducible — block upper-triangular D₁(g) B(g) 0 D₂(g) D₁ = action on invariant W lower-left 0 ⇔ D(g)W ⊆ W average over G Maschke / Weyl invariant complement W′ fully reducible — block-diagonal D₁(g) 0 0 D₂(g) D(g) = D₁(g) ⊕ D₂(g) V = W ⊕ W′, dim 4 = 2 + 2 Reducible guarantees only the left form; finite or compact G guarantees the right.

Full reducibility is the tidier world one block to the right: the leftover directions are themselves invariant, so the coupling block dies too and the matrix is block-diagonal — two independent representations with no cross-talk. The complement is invariant because for a finite or compact group you can smear any inner product over GG to make it GG-invariant; with respect to it every D(g)D(g) is unitary, and the orthogonal complement of an invariant subspace can never leak into it. That averaging is the engine behind Maschke's theorem and Weyl's unitary trick. With full reducibility in hand, irreducibles behave like prime numbers and the direct sum like multiplication: every representation factors uniquely into irreducible pieces, the multiplicities mμm_\mu playing the role of prime exponents. The character χ(g)=tr⁡D(g)\chi(g)=\operatorname{tr}D(g) performs that factorization by inspection — the second figure shows it at work on S3S_3.

Figure
Decomposing the natural permutation representation of S₃ by characters: its character is χ = (3, 1, 0) on the classes {e}, transpositions, 3-cycles, and the projection formula gives m of the trivial irrep = 1, m of the sign irrep = 0, m of the 2-dimensional standard irrep = 1, so the representation is trivial ⊕ standard with dimensions 3 = 1 + 2
Characters factor a representation: the S₃ permutation rep splits as trivial ⊕ standard character table of S₃ (class sizes 1, 3, 2) irrep e 3 transp. 2 cyc. A₁ triv 111 A₂ sign 1−11 E std 20−1 χ perm 310 χ perm(g) = number of points fixed by g mᵤ = (1/6) Σ χᵤ(g)* χ(g) m(A₁) = (1/6)(1·3 + 3·1 + 2·0) = 1 m(A₂) = (1/6)(1·3 − 3·1 + 2·0) = 0 m(E) = (1/6)(2·3 + 0 − 2·0) = 1 D perm ≅ A₁ ⊕ E dimensions: 3 = 1 + 2 norm ‖χ‖² = 2 = 1² + 1² A norm-squared character of 2 means two irreducible pieces; unit norm would mean irreducible.

The core equations

Every statement in this article follows from one definition — the invariant subspace. W⊆VW\subseteq V is invariant when the group action, applied to any vector of WW, stays inside WW; that is what lets WW carry a representation of its own.

D(g) W⊆Wfor all g∈G(1)D(g)\,W \subseteq W \quad \text{for all } g\in G \qquad (1)

where: D(g)D(g) — the operator assigned to gg; WW — a subspace of VV; GG — the group. Reading: no group element maps a vector of WW outside WW, so D(g)∣WD(g)|_W is a self-contained representation. Reducibility is nothing more than the existence of such a subspace, provided it is neither everything nor nothing. The trivial subspaces {0}\{0\} and VV always count as invariant and are excluded; a proper, nonzero invariant subspace is what makes a representation decomposable in principle.

D reducible  ⟺  ∃ W with {0}≠W⊊V, D(g)W⊆W ∀g(2)D \text{ reducible} \iff \exists\, W \text{ with } \{0\}\neq W \subsetneq V,\ D(g)W\subseteq W\ \forall g \qquad (2)

where: {0}≠W⊊V\{0\}\neq W \subsetneq V — WW is proper and nonzero; ⊊\subsetneq — proper subset. Reading: if no such WW exists, DD is irreducible — an atom with no internal invariant structure. Choosing a basis whose first kk vectors span the invariant WW turns invariance into a matrix shape: the action of WW on itself fills the top-left block, and the lower-left block must vanish because a basis vector of WW cannot acquire components outside WW.

D(g)=(D1(g)B(g)0D2(g))(3)D(g) = \begin{pmatrix} D_1(g) & B(g) \\ 0 & D_2(g) \end{pmatrix} \qquad (3)

where: D1(g)D_1(g) — the action on WW, a kk-dimensional representation; D2(g)D_2(g) — the induced action on the quotient V/WV/W; B(g)B(g) — the coupling block, in general nonzero. Reading: reducible means block upper-triangular, and the surviving B(g)B(g) still blocks a clean split. Full reducibility kills that coupling block. It happens precisely when the complement W′W' can also be chosen invariant, so the two blocks evolve independently and the representation is a direct sum.

D(g)=(D1(g)00D2(g))≡D1(g)⊕D2(g)(4)D(g) = \begin{pmatrix} D_1(g) & 0 \\ 0 & D_2(g) \end{pmatrix} \equiv D_1(g)\oplus D_2(g) \qquad (4)

where: ⊕\oplus — direct sum on V=W⊕W′V = W\oplus W'; W′W' — an invariant complement, D(g)W′⊆W′D(g)W'\subseteq W'. Reading: block-diagonal is the honest statement that DD has come apart into two smaller representations with nothing left over. The mechanism that supplies an invariant complement, for a finite group, is averaging: take any Hermitian inner product on VV and average it over the whole group.

⟨u,v⟩G=1∣G∣∑g∈G⟨D(g)u, D(g)v⟩(5)\langle u,v\rangle_G = \frac{1}{|G|}\sum_{g\in G} \langle D(g)u,\, D(g)v\rangle \qquad (5)

where: ∣G∣|G| — order of the group; ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle — any Hermitian inner product; ⟨⋅,⋅⟩G\langle\cdot,\cdot\rangle_G — the GG-invariant one, obeying ⟨D(h)u,D(h)v⟩G=⟨u,v⟩G\langle D(h)u,D(h)v\rangle_G=\langle u,v\rangle_G. Reading: with respect to ⟨⋅,⋅⟩G\langle\cdot,\cdot\rangle_G every D(g)D(g) is unitary, so orthogonal complements of invariant subspaces stay invariant — the content of Maschke's theorem. With full reducibility guaranteed, iterating the split expresses any representation as a direct sum of irreducibles with integer multiplicities.

D≅⨁μmμ D(μ),mμ∈{0,1,2,… }(6)D \cong \bigoplus_{\mu} m_\mu\, D^{(\mu)}, \qquad m_\mu \in \{0,1,2,\dots\} \qquad (6)

where: D(μ)D^{(\mu)} — the μ\mu-th irreducible representation; mμm_\mu — its multiplicity; ≅\cong — equivalence of representations. Reading: the unique factorization of a representation into atoms. The multiplicities are computed, not guessed, by pairing the character of DD against each irreducible character — the projection formula owned by the companion article on character orthogonality, recalled here as the working tool.

mμ=1∣G∣∑g∈Gχ(μ)(g)∗ χ(g)(7)m_\mu = \frac{1}{|G|}\sum_{g\in G} \chi^{(\mu)}(g)^{*}\,\chi(g) \qquad (7)

where: χ(g)=tr⁡D(g)\chi(g)=\operatorname{tr}D(g) — character of DD; χ(μ)(g)\chi^{(\mu)}(g) — character of D(μ)D^{(\mu)}; ∗\ast — complex conjugation. Reading: characters are class functions, so the sum runs effectively over conjugacy classes and returns a non-negative integer. Pairing a character with itself gives a decisive irreducibility test: the norm-squared of the character equals the sum of squared multiplicities, which is 11 exactly when a single irreducible is present.

1∣G∣∑g∈G∣χ(g)∣2=∑μmμ2=1  ⟺  D irreducible(8)\frac{1}{|G|}\sum_{g\in G}|\chi(g)|^{2} = \sum_\mu m_\mu^{2} = 1 \iff D \text{ irreducible} \qquad (8)

where: the middle sum runs over the multiplicities in (6). Reading: unit character-norm certifies an atom; the integer ∑μmμ2\sum_\mu m_\mu^2 counts the pieces with weight, so a norm of 22 signals two irreducible components.

Derivation AMaschke's theorem: full reducibility for finite groups

The goal is to prove that for a finite group every reducible representation is in fact a direct sum, by manufacturing a GG-invariant inner product through averaging and then showing the orthogonal complement of any invariant subspace is automatically invariant. This is the most important structural theorem of the subject for physics — why finite-group representations always decompose completely into irreducibles — with Weyl's unitary trick as its compact-group twin. Let D:G→GL(V)D:G\to GL(V) act on a complex space and let W⊂VW\subset V be a nontrivial invariant subspace.

Step 1. From any positive-definite Hermitian form ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle, define the average

⟨u,v⟩G=1∣G∣∑h∈G⟨D(h)u,D(h)v⟩.\langle u,v\rangle_G = \frac{1}{|G|}\sum_{h\in G}\langle D(h)u, D(h)v\rangle.

The sum is finite and stays positive-definite (each term ≥0\ge 0, the h=eh=e term >0>0 for u≠0u\neq0). Why: we need a genuine inner product to talk about orthogonality, and averaging is the construction that also builds in group symmetry.

Step 2. Check invariance by relabelling. For fixed gg,

⟨D(g)u,D(g)v⟩G=1∣G∣∑h⟨D(hg)u,D(hg)v⟩=⟨u,v⟩G,\langle D(g)u, D(g)v\rangle_G = \frac{1}{|G|}\sum_{h}\langle D(hg)u, D(hg)v\rangle = \langle u,v\rangle_G,

since as hh runs over GG so does h′=hgh'=hg. Why: right-multiplication by gg is a bijection of GG, so summing over hh or hghg gives the same terms — invariance is closure in disguise.

Step 3. Invariance makes DD unitary, D(g)†D(g)=1D(g)^\dagger D(g)=\mathbb{1} with respect to ⟨⋅,⋅⟩G\langle\cdot,\cdot\rangle_G. Form the orthogonal complement

W⊥={ v∈V:⟨w,v⟩G=0  ∀w∈W },V=W⊕W⊥.W^\perp = \{\, v\in V : \langle w,v\rangle_G = 0 \ \ \forall w\in W \,\}, \qquad V = W\oplus W^\perp.

Why: unitarity is the hinge — it lets us move D(g)D(g) between the two slots of the inner product at only an inverse's cost.

Step 4. Show W⊥W^\perp is invariant. For v∈W⊥v\in W^\perp and any w∈Ww\in W,

⟨w,D(g)v⟩G=⟨D(g−1)w,v⟩G=0,\langle w, D(g)v\rangle_G = \langle D(g^{-1})w, v\rangle_G = 0,

since D(g−1)w∈WD(g^{-1})w\in W and v⊥Wv\perp W. Thus D(g)v∈W⊥D(g)v\in W^\perp. Why: invariance of WW feeds back to force invariance of its complement, closing the loop.

Step 5. So WW and W⊥W^\perp are complementary invariant subspaces, D=D∣W⊕D∣W⊥D = D|_W \oplus D|_{W^\perp}. Iterating until no summand is reducible yields a direct sum of irreducibles. Why: complete reducibility is the ability to keep splitting, and finite dim⁡V\dim V guarantees termination. Verification: Step 2 uses the bijectivity of right multiplication; the construction fails for non-compact groups (divergent integral) and in characteristic p∣∣G∣p\mid|G| (undefined factor) — exactly where full reducibility breaks. Consistent with Stone and Goldbart, Tinkham, and Hamermesh.

Go deeper · Derivation B · 1 minThe dimension sum rule from the regular representation
Derivation BThe dimension sum rule from the regular representation

The goal is to show how complete reducibility, applied to one canonical representation, pins down a global constraint on all irreducibles at once: the sum of the squares of their dimensions equals the order of the group. This Burnside identity is why a finite group has only finitely many irreducibles, tightly rationed in dimension — for S3S_3 it forces exactly 1,1,21,1,2. The regular representation DregD^{\mathrm{reg}} acts on the group algebra C[G]\mathbb{C}[G], basis {∣g⟩}g∈G\{|g\rangle\}_{g\in G}, by left multiplication Dreg(a)∣g⟩=∣ag⟩D^{\mathrm{reg}}(a)|g\rangle=|ag\rangle.

Step 1. Compute its character. Left multiplication by aa permutes the basis and fixes a basis vector only when ag=gag=g, i.e. a=ea=e:

χreg(a)={∣G∣,a=e0,a≠e.\chi^{\mathrm{reg}}(a) = \begin{cases} |G|, & a=e \\ 0, & a\neq e. \end{cases}

Why: the trace of a permutation matrix counts fixed basis vectors, and left multiplication fixes none unless the element is the identity.

Step 2. Feed this into (7); only the a=ea=e term survives:

mμ=1∣G∣∑aχ(μ)(a)∗ χreg(a)=1∣G∣ χ(μ)(e)∗ ∣G∣=dμ,m_\mu = \frac{1}{|G|}\sum_{a}\chi^{(\mu)}(a)^{*}\,\chi^{\mathrm{reg}}(a) = \frac{1}{|G|}\,\chi^{(\mu)}(e)^{*}\,|G| = d_\mu,

with dμ=χ(μ)(e)=dim⁡D(μ)d_\mu=\chi^{(\mu)}(e)=\dim D^{(\mu)}. Why: the regular representation contains each irreducible exactly as many times as its own dimension — a remarkable self-referential fact.

Step 3. Match total dimensions. The regular representation has dimension ∣G∣|G|, the direct sum ⨁μdμD(μ)\bigoplus_\mu d_\mu D^{(\mu)} has dimension ∑μdμ2\sum_\mu d_\mu^2:

∣G∣=dim⁡C[G]=∑μmμ dμ=∑μdμ 2.|G| = \dim\mathbb{C}[G] = \sum_\mu m_\mu\, d_\mu = \sum_\mu d_\mu^{\,2}.

Why: dimension is additive over direct sums, so counting the same space two ways produces the sum rule. Verification: for S3S_3 the irrep dimensions 1,1,21,1,2 give 12+12+22=6=∣S3∣1^2+1^2+2^2=6=|S_3|. For any abelian group all dμ=1d_\mu=1, so the number of irreducibles equals ∣G∣|G|. Standard (Arfken and Weber, Hamermesh).

Limiting cases

Whether reducibility actually delivers a direct sum depends on the group and the field. The table collects the four regimes that matter.

CaseResultMeaning
Finite group, characteristic 0D≅⨁μmμD(μ)D\cong\bigoplus_\mu m_\mu D^{(\mu)}Maschke's theorem: every representation is fully reducible, so reducible ⇒\Rightarrow decomposable.
Compact Lie group⟨u,v⟩G=∫G⟨D(g)u,D(g)v⟩ dμ(g)\langle u,v\rangle_G=\int_G\langle D(g)u,D(g)v\rangle\,\mathrm{d}\mu(g)Weyl's unitary trick with Haar measure: again fully reducible — covers SU(2)SU(2), SO(3)SO(3), U(n)U(n).
Non-compact groupD(a)=(1a01)D(a)=\begin{pmatrix}1 & a\\ 0 & 1\end{pmatrix}Reducible but indecomposable: span⁡{e1}\operatorname{span}\{e_1\} is invariant, yet no invariant complement exists.
Characteristic p∣∣G∣p\mid|G|Maschke failsModular representation theory: the factor 1/∣G∣1/|G| is undefined, invariant complements need not exist.

Worked examples

1 · Decomposing the permutation representation of S₃ (fully worked)

Let S3S_3 act on C3\mathbb{C}^3 by permuting coordinates, so D(g)D(g) is the 3×33\times3 permutation matrix of gg. Decompose it into irreducibles using characters alone. The irreducible characters of S3S_3 on the classes {e}\{e\}, transpositions, 33-cycles (sizes 1,3,21,3,2) are A1=(1,1,1)A_1=(1,1,1), A2=(1,−1,1)A_2=(1,-1,1), E=(2,0,−1)E=(2,0,-1).

Step 1. Find the character of the permutation representation. The trace of a permutation matrix is the number of fixed points, so on the identity χ(e)=3\chi(e)=3; a transposition such as (12)(12) fixes the single point 33, giving χ=1\chi=1; a 33-cycle fixes nothing, giving χ=0\chi=0. Hence χperm=(3,1,0)\chi_{\mathrm{perm}}=(3,1,0).

Step 2. Test whether it is already irreducible with the character-norm criterion (8):

1∣G∣∑g∣χ(g)∣2=16(1⋅32+3⋅12+2⋅02)=9+3+06=2.\frac{1}{|G|}\sum_g|\chi(g)|^2 = \frac{1}{6}\big(1\cdot3^2 + 3\cdot1^2 + 2\cdot0^2\big) = \frac{9+3+0}{6} = 2.

The norm is 22, not 11, so the representation is reducible and made of pieces with ∑μmμ2=2\sum_\mu m_\mu^2=2 — either two distinct irreducibles each once, or one irreducible twice.

Step 3. Extract the multiplicities with the projection formula (7), remembering to weight each class by its size:

mA1=16(1⋅1⋅3+3⋅1⋅1+2⋅1⋅0)=66=1,m_{A_1}=\tfrac16\big(1\cdot1\cdot3 + 3\cdot1\cdot1 + 2\cdot1\cdot0\big)=\tfrac{6}{6}=\mathbf{1},
mA2=16(1⋅1⋅3+3⋅(−1)⋅1+2⋅1⋅0)=06=0,m_{A_2}=\tfrac16\big(1\cdot1\cdot3 + 3\cdot(-1)\cdot1 + 2\cdot1\cdot0\big)=\tfrac{0}{6}=\mathbf{0},
mE=16(1⋅2⋅3+3⋅0⋅1+2⋅(−1)⋅0)=66=1.m_{E}=\tfrac16\big(1\cdot2\cdot3 + 3\cdot0\cdot1 + 2\cdot(-1)\cdot0\big)=\tfrac{6}{6}=\mathbf{1}.

Step 4. Assemble and check. The decomposition is Dperm≅A1⊕ED_{\mathrm{perm}}\cong A_1\oplus E: dimensions add, 1+2=31+2=3, and the multiplicity check matches Step 2, 12+02+12=21^2+0^2+1^2=2. The reading is the familiar one — the permutation representation always contains the trivial direction (1,1,1)(1,1,1) where all coordinates are equal, and the leftover plane x1+x2+x3=0x_1+x_2+x_3=0 carries the irreducible standard representation. Result: Dperm≅A1⊕ED_{\mathrm{perm}}\cong A_1\oplus E, trivial ⊕\oplus standard, 3=1+23=1+2.

2 · Certifying an irreducible and reading off a projector

Confirm the standard representation E=(2,0,−1)E=(2,0,-1) of S3S_3 is irreducible, and find the dimension of the subspace of C3\mathbb{C}^3 fixed by all permutations directly from a character.

Step 1. Apply the norm test to EE:

16(1⋅22+3⋅02+2⋅(−1)2)=4+0+26=1.\frac{1}{6}\big(1\cdot2^2 + 3\cdot0^2 + 2\cdot(-1)^2\big) = \frac{4+0+2}{6} = 1.

Unit norm certifies EE is irreducible — over C\mathbb{C}, no basis makes its 2×22\times2 matrices block-triangular.

Step 2. Count the invariants of the permutation representation. The multiplicity of the trivial representation equals the dimension of the subspace fixed by every D(g)D(g), and by (7) with χ(triv)≡1\chi^{(\mathrm{triv})}\equiv1,

dim⁡VG=mA1=1∣G∣∑gχperm(g)=16(3+3⋅1+2⋅0)=1.\dim V^{G} = m_{A_1} = \frac{1}{|G|}\sum_g\chi_{\mathrm{perm}}(g) = \frac{1}{6}\big(3 + 3\cdot1 + 2\cdot0\big) = 1.

Step 3. Interpret. Exactly one dimension of C3\mathbb{C}^3 is left untouched by all of S3S_3 — the symmetric direction 13(1,1,1)\tfrac1{\sqrt3}(1,1,1) — and P=1∣G∣∑gD(g)P=\tfrac1{|G|}\sum_g D(g) is the projector onto it, with tr⁡P=mA1=1\operatorname{tr}P=m_{A_1}=1 confirming its rank. This is the averaging that powers Maschke's theorem, reused as a computational projector. Result: EE is irreducible (norm 11); the symmetric subspace has dimension 11.

3 · Crystal-field splitting of a d-level (symmetry-lowering)

A free atom's dd-level transforms under the 55-dimensional irreducible representation D(2)D^{(2)} of SO(3)SO(3) (ℓ=2\ell=2). In an octahedral crystal field the symmetry drops to the point group OO. What happens to the level?

Step 1. Restricted to the finite subgroup O⊂SO(3)O\subset SO(3), the once-irreducible 55-dimensional representation becomes reducible — the coarser OO cannot keep the 55-plane irreducible. Computing the character of D(2)D^{(2)} on the classes of OO and applying (7) gives the ligand-field splitting

D(2)∣O≅Eg⊕T2g,5=2+3.D^{(2)}\big|_{O} \cong E_g \oplus T_{2g}, \qquad 5 = 2 + 3.

Step 2. Interpret. Lowering the symmetry group reduces the representation: one irreducible atom of SO(3)SO(3) resolves into a doubly degenerate ege_g pair (dz2,dx2−y2d_{z^2},d_{x^2-y^2}) and a triply degenerate t2gt_{2g} triplet (dxy,dyz,dzxd_{xy},d_{yz},d_{zx}), split by the crystal-field gap Δoct\Delta_{\mathrm{oct}} of transition-metal spectra. Result: the 55-fold dd-level splits as eg (2)⊕t2g (3)e_g\,(2)\oplus t_{2g}\,(3).

Physics of the portrait

The vocabulary of this article — representation, character, irreducible — was invented essentially from nothing in a five-year burst at the close of the nineteenth century, with one man at its centre.

Origins · 1 minFerdinand Georg Frobenius and how this was discovered
FG
Ferdinand Georg Frobenius
1849–1917 · Berlin and Zürich · founder of the representation theory of finite groups

Ferdinand Georg Frobenius created the representation theory of finite groups almost single-handedly between 1896 and 1900, and with it the notions this article rests on. Prompted by a remark of Dedekind about factoring the "group determinant", he introduced the character of a finite group in 1896 — first as numbers making that determinant factor, then, with astonishing speed, as the trace of a matrix representation — and proved the orthogonality relations that still let physicists decompose a representation by inspection. Within a year he had defined irreducible representations as the indecomposable factors, shown their number equals the number of conjugacy classes, and established the dimension sum rule ∑μdμ2=∣G∣\sum_\mu d_\mu^2=|G|. Heinrich Maschke supplied in 1899 the theorem that guarantees the edifice for physics: over a field whose characteristic does not divide ∣G∣|G|, every representation is completely reducible. Issai Schur, Frobenius's student, added in 1905 the lemma that makes the atoms rigid, and a generation later Hermann Weyl extended complete reducibility to compact Lie groups by the unitary trick while Eugene Wigner turned the apparatus into the language of quantum mechanics — selection rules, term splittings, spectra. What began as a curiosity about a determinant became the grammar of symmetry in physics.

History
1896
— Frobenius introduces group characters, the key that factors a representation
1897
— Frobenius defines irreducible representations and proves the dimension sum rule
1899
— Maschke proves complete reducibility when the characteristic does not divide the group order
1905
— Schur proves his lemma, characterizing irreducibility through commuting operators
1927
— Peter and Weyl extend complete reducibility to compact Lie groups via Haar averaging

Going further

Texts. Stone and Goldbart, Mathematics for Physics, group representation theory · Arfken and Weber, Mathematical Methods for Physicists, group theory · Hassani, Mathematical Physics, group representations · Tinkham, Group Theory and Quantum Mechanics · Hamermesh, Group Theory and Its Application to Physical Problems.

Provenance. The invariant-subspace and block-form arguments follow Stone and Goldbart, Arfken and Weber, and Hassani; Maschke's proof and the Burnside sum rule are cross-checked against Tinkham and Hamermesh. A verifier should confirm: (1) the regular-representation character χreg(g)=∣G∣ δg,e\chi^{\mathrm{reg}}(g)=|G|\,\delta_{g,e} and the Burnside sum ∑μdμ2=∣G∣\sum_\mu d_\mu^2=|G| for S3S_3, where 12+12+22=61^2+1^2+2^2=6; (2) the permutation-representation decomposition χperm=(3,1,0)→A1⊕E\chi_{\mathrm{perm}}=(3,1,0)\to A_1\oplus E, multiplicities 1,0,11,0,1, character-norm 22; (3) the irreducibility of EE (norm 11). All numbers are standard textbook values.

Prerequisites. Group Representations · Groups, Subgroups, and Cosets · Homomorphisms and Quotient Groups. Leads to. Schur's Lemmas · Characters and Orthogonality Theorems · Character Tables and Decomposition of Representations · Tensor Products and Clebsch–Gordan Decomposition.

Ask the tutor: Ask me to decompose any representation you like — hand me a character or a set of matrices and I will walk you through the norm test, the projection formula, and the atoms it breaks into.

What is the difference between "reducible" and "decomposable"?

Reducible means the representation has at least one proper nonzero invariant subspace WW — in a suitable basis its matrices are block upper-triangular. Decomposable (fully reducible) is stronger: VV actually splits as a direct sum W⊕W′W\oplus W' of two invariant subspaces, so the matrices are block-diagonal and the representation is D1⊕D2D_1\oplus D_2. Reducible gives you the lower-left zero block; decomposable additionally kills the upper-right coupling block. The two coincide for finite and compact groups (Maschke and Weyl), but for non-compact groups they differ — there exist reducible representations with no invariant complement, reducible yet indecomposable.

How do I actually find the irreducible content of a representation?

Compute the character χ(g)=tr⁡D(g)\chi(g)=\operatorname{tr}D(g) — one value per conjugacy class suffices — then pair it against each irreducible character with mμ=1∣G∣∑gχ(μ)(g)∗χ(g)m_\mu=\tfrac1{|G|}\sum_g\chi^{(\mu)}(g)^\ast\chi(g), weighting each class by its size. Each mμm_\mu is a non-negative integer counting copies of the μ\mu-th irreducible. Two checks: dimensions must add up, ∑μmμdμ=dim⁡V\sum_\mu m_\mu d_\mu=\dim V, and the character-norm 1∣G∣∑g∣χ(g)∣2\tfrac1{|G|}\sum_g|\chi(g)|^2 must equal ∑μmμ2\sum_\mu m_\mu^2. If that norm comes out 11 the representation is already irreducible and you can stop.

Why does averaging over the group make everything work?

Averaging is the finite-group substitute for symmetrization. The average ⟨u,v⟩G=1∣G∣∑g⟨D(g)u,D(g)v⟩\langle u,v\rangle_G=\tfrac1{|G|}\sum_g\langle D(g)u,D(g)v\rangle is unchanged if you first act by any group element, because acting merely permutes the terms of the sum. That GG-invariance makes every D(g)D(g) unitary, and unitary operators map orthogonal complements of invariant subspaces to themselves — exactly the invariant complement full reducibility needs. The catch: the sum must converge and 1/∣G∣1/|G| must make sense, both of which fail for non-compact groups (a divergent integral) and in characteristic p∣∣G∣p\mid|G| (an undefined factor) — precisely where Maschke's theorem stops holding.

Can a representation be irreducible over the reals but reducible over the complexes?

Yes, and commonly. Complexifying the field creates new invariant subspaces spanned by complex eigenvectors that had no real counterpart. The textbook case is the 22-dimensional representation of SO(2)SO(2) by real rotation matrices: over R\mathbb{R} there is no invariant line (a rotation tilts every real vector), so it is irreducible; but over C\mathbb{C} it diagonalizes with eigenvalues e±iθe^{\pm i\theta}, splitting the plane into two one-dimensional invariant subspaces. This is why one must always specify the field — "irreducible" is never absolute.

What actually goes wrong in positive characteristic?

Maschke's averaging divides by ∣G∣|G|, so if the field has characteristic pp dividing ∣G∣|G|, that division is illegal and the construction of an invariant complement collapses. Concretely, the cyclic group of order pp over a field of characteristic pp acting by (1101)\big(\begin{smallmatrix}1&1\\0&1\end{smallmatrix}\big) has an invariant first-coordinate line but no complementary invariant line, so it is reducible yet indecomposable. This modular regime is not a pathology but a rich subject — Brauer's modular representation theory, central to the classification of finite simple groups — that simply lies outside the characteristic-zero world where physics usually operates.

How does this connect to Schur's lemma and characters, coming next?

Complete reducibility is the foundation those build on. Once every representation is a direct sum of irreducibles, Schur's lemma says the maps between irreducibles are maximally rigid: an operator intertwining two inequivalent irreducibles is zero, and one commuting with a single irreducible is a scalar. That rigidity forces the character orthogonality relations, which in turn make the multiplicity formula (7) exact. The chain is: complete reducibility (this article) →\to Schur's lemma →\to character orthogonality →\to the decomposition arithmetic used here, each companion article owning one link.

Before this

Where this leads