Reducible and Irreducible Representations
A representation turns an abstract group into concrete matrices: to each element it assigns an invertible operator on a vector space , 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 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 is invariant if the group never pushes a vector of out of , that is for every . If some proper nonzero is invariant, the representation is reducible, and in a basis adapted to 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.
- A representation is reducible if has a proper nonzero subspace invariant under every ; 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 (full reducibility).
- Averaging any inner product over a finite or compact group makes it -invariant and unitary, so every invariant subspace gains an invariant complement — Maschke's theorem and Weyl's unitary trick.
- Iterating gives the canonical decomposition , with multiplicities read off from characters.
- is irreducible exactly when its character has unit norm, — the permutation representation has norm and splits as trivial 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.
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 Cartesian displacements of an -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 representations are reducible, and their decomposition is the "Eightfold Way" that sorted mesons and baryons into multiplets and predicted the . Wherever a numerical eigenvalue problem carries a symmetry, the averaging projector pre-block-diagonalizes it, turning symmetry into computational speed. The open frontier is modular representation theory — the characteristic- world where Maschke fails — now central to number theory and the classification of finite simple groups.
The physical picture
Watch the matrices act on . Suppose one subspace is a trap the group can never escape — every sends back into . Then the action restricted to is a smaller, self-contained representation, and in a basis whose first vectors span each matrix takes a definite shape: a top-left block that is the action on , and a lower-left block forced to be zero, since a basis vector of can only map into . That vanishing corner is block upper-triangular form — the whole visual content of "reducible", a representation partly but not fully come apart.
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 to make it -invariant; with respect to it every 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 playing the role of prime exponents. The character performs that factorization by inspection — the second figure shows it at work on .
The core equations
Every statement in this article follows from one definition — the invariant subspace. is invariant when the group action, applied to any vector of , stays inside ; that is what lets carry a representation of its own.
where: — the operator assigned to ; — a subspace of ; — the group. Reading: no group element maps a vector of outside , so 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 and always count as invariant and are excluded; a proper, nonzero invariant subspace is what makes a representation decomposable in principle.
where: — is proper and nonzero; — proper subset. Reading: if no such exists, is irreducible — an atom with no internal invariant structure. Choosing a basis whose first vectors span the invariant turns invariance into a matrix shape: the action of on itself fills the top-left block, and the lower-left block must vanish because a basis vector of cannot acquire components outside .
where: — the action on , a -dimensional representation; — the induced action on the quotient ; — the coupling block, in general nonzero. Reading: reducible means block upper-triangular, and the surviving still blocks a clean split. Full reducibility kills that coupling block. It happens precisely when the complement can also be chosen invariant, so the two blocks evolve independently and the representation is a direct sum.
where: — direct sum on ; — an invariant complement, . Reading: block-diagonal is the honest statement that 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 and average it over the whole group.
where: — order of the group; — any Hermitian inner product; — the -invariant one, obeying . Reading: with respect to every 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.
where: — the -th irreducible representation; — its multiplicity; — equivalence of representations. Reading: the unique factorization of a representation into atoms. The multiplicities are computed, not guessed, by pairing the character of against each irreducible character — the projection formula owned by the companion article on character orthogonality, recalled here as the working tool.
where: — character of ; — character of ; — 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 exactly when a single irreducible is present.
where: the middle sum runs over the multiplicities in (6). Reading: unit character-norm certifies an atom; the integer counts the pieces with weight, so a norm of signals two irreducible components.
The goal is to prove that for a finite group every reducible representation is in fact a direct sum, by manufacturing a -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 act on a complex space and let be a nontrivial invariant subspace.
Step 1. From any positive-definite Hermitian form , define the average
The sum is finite and stays positive-definite (each term , the term for ). 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 ,
since as runs over so does . Why: right-multiplication by is a bijection of , so summing over or gives the same terms — invariance is closure in disguise.
Step 3. Invariance makes unitary, with respect to . Form the orthogonal complement
Why: unitarity is the hinge — it lets us move between the two slots of the inner product at only an inverse's cost.
Step 4. Show is invariant. For and any ,
since and . Thus . Why: invariance of feeds back to force invariance of its complement, closing the loop.
Step 5. So and are complementary invariant subspaces, . Iterating until no summand is reducible yields a direct sum of irreducibles. Why: complete reducibility is the ability to keep splitting, and finite guarantees termination. Verification: Step 2 uses the bijectivity of right multiplication; the construction fails for non-compact groups (divergent integral) and in characteristic (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
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 it forces exactly . The regular representation acts on the group algebra , basis , by left multiplication .
Step 1. Compute its character. Left multiplication by permutes the basis and fixes a basis vector only when , i.e. :
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 term survives:
with . 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 , the direct sum has dimension :
Why: dimension is additive over direct sums, so counting the same space two ways produces the sum rule. Verification: for the irrep dimensions give . For any abelian group all , so the number of irreducibles equals . 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.
| Case | Result | Meaning |
|---|---|---|
| Finite group, characteristic 0 | Maschke's theorem: every representation is fully reducible, so reducible decomposable. | |
| Compact Lie group | Weyl's unitary trick with Haar measure: again fully reducible — covers , , . | |
| Non-compact group | Reducible but indecomposable: is invariant, yet no invariant complement exists. | |
| Characteristic | Maschke fails | Modular representation theory: the factor is undefined, invariant complements need not exist. |
Worked examples
1 · Decomposing the permutation representation of S₃ (fully worked)
Let act on by permuting coordinates, so is the permutation matrix of . Decompose it into irreducibles using characters alone. The irreducible characters of on the classes , transpositions, -cycles (sizes ) are , , .
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 ; a transposition such as fixes the single point , giving ; a -cycle fixes nothing, giving . Hence .
Step 2. Test whether it is already irreducible with the character-norm criterion (8):
The norm is , not , so the representation is reducible and made of pieces with — 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:
Step 4. Assemble and check. The decomposition is : dimensions add, , and the multiplicity check matches Step 2, . The reading is the familiar one — the permutation representation always contains the trivial direction where all coordinates are equal, and the leftover plane carries the irreducible standard representation. Result: , trivial standard, .
2 · Certifying an irreducible and reading off a projector
Confirm the standard representation of is irreducible, and find the dimension of the subspace of fixed by all permutations directly from a character.
Step 1. Apply the norm test to :
Unit norm certifies is irreducible — over , no basis makes its 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 , and by (7) with ,
Step 3. Interpret. Exactly one dimension of is left untouched by all of — the symmetric direction — and is the projector onto it, with confirming its rank. This is the averaging that powers Maschke's theorem, reused as a computational projector. Result: is irreducible (norm ); the symmetric subspace has dimension .
3 · Crystal-field splitting of a d-level (symmetry-lowering)
A free atom's -level transforms under the -dimensional irreducible representation of (). In an octahedral crystal field the symmetry drops to the point group . What happens to the level?
Step 1. Restricted to the finite subgroup , the once-irreducible -dimensional representation becomes reducible — the coarser cannot keep the -plane irreducible. Computing the character of on the classes of and applying (7) gives the ligand-field splitting
Step 2. Interpret. Lowering the symmetry group reduces the representation: one irreducible atom of resolves into a doubly degenerate pair () and a triply degenerate triplet (), split by the crystal-field gap of transition-metal spectra. Result: the -fold -level splits as .
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
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 . Heinrich Maschke supplied in 1899 the theorem that guarantees the edifice for physics: over a field whose characteristic does not divide , 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.
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 and the Burnside sum for , where ; (2) the permutation-representation decomposition , multiplicities , character-norm ; (3) the irreducibility of (norm ). 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 — in a suitable basis its matrices are block upper-triangular. Decomposable (fully reducible) is stronger: actually splits as a direct sum of two invariant subspaces, so the matrices are block-diagonal and the representation is . 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 — one value per conjugacy class suffices — then pair it against each irreducible character with , weighting each class by its size. Each is a non-negative integer counting copies of the -th irreducible. Two checks: dimensions must add up, , and the character-norm must equal . If that norm comes out 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 is unchanged if you first act by any group element, because acting merely permutes the terms of the sum. That -invariance makes every 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 must make sense, both of which fail for non-compact groups (a divergent integral) and in characteristic (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 -dimensional representation of by real rotation matrices: over there is no invariant line (a rotation tilts every real vector), so it is irreducible; but over it diagonalizes with eigenvalues , 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 , so if the field has characteristic dividing , that division is illegal and the construction of an invariant complement collapses. Concretely, the cyclic group of order over a field of characteristic acting by 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) Schur's lemma character orthogonality the decomposition arithmetic used here, each companion article owning one link.