Reducible and Irreducible Representations
Take the three C–H stretching motions of a bent triatomic like water. Or consider the six p-orbitals of the ligands around an octahedral metal. Ask a symmetry operation to act on them. The result is always some big, unwieldy matrix. It is correct, but visually opaque. Buried inside that matrix, however, is a much smaller set of patterns that repeat. The symmetric stretch behaves one way, the antisymmetric stretch another. No operation in the group ever mixes them. The central discovery of representation theory is this: any such "reducible" description can always be reorganized. This happens by a change of basis. It becomes a block-diagonal form built from a finite list of smallest indivisible pieces. These are the irreducible representations (irreps) of the group. This is not a numerical convenience. It is a structural fact about how symmetry constrains mixing. This distinction matters because chemistry asks questions that are really questions about mixing. Which orbitals can combine to form a bond? Which vibrational modes are infrared- or Raman-active? Which d-orbitals split apart in a ligand field? Which electronic transitions are allowed? Every one of these questions is answered the same way. You decompose a reducible representation into irreducible representations. This representation is built from atomic displacements, orbitals, or basis functions. Then you read off selection rules from the resulting irrep labels (A₁, B₂, E, T₂g, and so on). The labels are not decoration. They are the group-theoretic serial numbers. They tell you exactly which pieces of your physical basis behave identically under all symmetry operations. Those pieces can therefore mix. Other pieces are protected from mixing by symmetry alone. This is true before you ever write down a Hamiltonian matrix element. The big picture is a theorem, not a trick. Every representation of a finite group decomposes uniquely into a direct sum of irreducible representations. The multiplicities can be extracted by a simple orthogonality-based projection. This is the reduction formula, encountered in full elsewhere. The irreducible representations themselves are a finite, group-specific list. They are tabulated once and for all in the character tables you already use. They exhaust every possible way a one-, two-, or three-dimensional object can transform under the group's operations. Reducible representations are everything else. They are sums, direct products, and combinations of these building blocks. They are always expressible (uniquely) in terms of them. This article builds the reducible/irreducible distinction from the ground up. It covers what "irreducible" formally means via block-diagonalization and Schur's lemma. It shows how a large reducible representation is literally block-diagonalized by a similarity transformation. It explains why the trace (character) survives that transformation unchanged. It shows how this cashes out in real molecular problems — vibrational bases, σ-bonding frameworks, and d-orbital sets. It sets up, without yet deriving, the machinery of orthogonality relations. This includes the reduction formula used to peel irreps apart in practice.
- A representation assigns a matrix to every symmetry operation; it is reducible if a single similarity transformation block-diagonalizes every matrix simultaneously, irreducible if no such transformation exists.
- Block-diagonalization is a genuine change of basis (a similarity transform ), not an approximation — it exposes symmetry-adapted combinations already latent in the original basis.
- Characters (traces) are invariant under similarity transformation, so a reducible representation's character is exactly the sum of the characters of its irreducible pieces, operation by operation.
- The number and dimensions of irreducible representations of a group are fixed and finite; they are exactly the rows of that group's character table.
- Physical bases — atomic orbitals, bond vectors, Cartesian displacements — almost always generate reducible representations; irreps are the abstract "atoms" from which all such representations are assembled.
- Reduction of a reducible representation into irreducible components is what tells you which orbitals or motions genuinely mix under the molecule's symmetry, and which are forbidden to mix.
- Key idea: Every representation is a direct sum of irreducibles found by block-diagonalization; the character of the whole is always the arithmetic sum of the characters of its parts.
Where this lives today
Vibrational spectroscopy remains the most direct application: infrared and Raman selection rules for every molecule — from simple diatomics to metal carbonyl clusters used to fingerprint CO-binding geometry — are read off by decomposing the Cartesian representation into irreps and checking which ones share a symmetry label with (IR-active) or with the quadratic functions , etc. (Raman-active). This is routine in characterizing catalytic intermediates by IR, where the number and pattern of carbonyl stretching bands (e.g., showing two IR-active CO stretches, matching symmetry in ) directly diagnoses molecular geometry without crystallography. Ligand field and molecular orbital theory in coordination chemistry lean on the same machinery: decomposing ligand - and -orbital sets into irreps ( for octahedral , additional contributions for -donor or -acceptor ligand sets) explains why -donor ligands lower and -acceptor ligands raise it, purely from which metal d-orbital irrep () gains a symmetry-allowed partner. This underlies the spectrochemical series and the electronic-structure rationale behind catalysts and pigments alike. Crystal engineering and solid-state chemistry use the same reduction procedure for phonon modes in space groups (a generalization to infinite/periodic groups), predicting which lattice vibrations are Raman- or IR-active in materials characterization — essential in identifying polymorphs of pharmaceutical solids and in diagnosing defect structures in oxide catalysts and battery electrode materials via vibrational spectroscopy. Computational quantum chemistry packages exploit block-diagonalization directly for efficiency: symmetry-adapted linear combinations (SALCs), built exactly from the irreducible decomposition described here, are used to block-diagonalize the molecular Hamiltonian matrix before diagonalization, cutting a possibly enormous matrix diagonalization problem into much smaller independent blocks — one per irrep — which is why quantum chemistry software asks for (or automatically detects) point-group symmetry before an SCF or CI calculation, turning group theory into a genuine computational speedup rather than a purely qualitative tool. This same idea, formalized as the reduction formula built on the orthogonality theorem, is the natural next tool once reducible/irreducible representations themselves are understood.
Ask the tutor: How do I use the reduction formula itself, step by step, to pull the multiplicities out of a reducible representation's characters without guessing?
The physical picture
Consider a representation of a point group : a rule assigning to each symmetry operation a square matrix , acting on some chosen basis (three C–H bond vectors, five d-orbitals, nine Cartesian displacement coordinates — anything you like), such that the matrices multiply the same way the operations compose: . This is Matrix Representations of Symmetry Operations, assumed known here. Now suppose that within the chosen basis there exists a smaller subset of basis vectors — a subspace — that maps into itself under every single operation of the group. That is, applying any to a vector in this subspace produces another vector still inside the subspace; the group never kicks you out of it. Such a subspace is called invariant. If a proper (nontrivial, not the whole space) invariant subspace exists, the representation is reducible: you can choose a new basis — first spanning the invariant subspace, then completing it — in which every single matrix simultaneously takes the block-diagonal form
for every , with the same fixed matrix working for all operations at once. If no such invariant subspace exists (other than the trivial and the whole space), the representation is irreducible — there is no way to shrink it further; it is a genuine building block. This is exactly what happens physically. Take the two O–H bond vectors of water ( symmetry). Under , , , , the two individual bond vectors get swapped and mixed — the naive "bond basis" representation is reducible. But the symmetric combination transforms into itself (times ) under every operation, and so does the antisymmetric combination . These two combinations are the block-diagonalizing basis: in this new basis, every bond matrix collapses into two separate numbers, one following the totally symmetric irrep, the other following . Nothing approximate has happened — this is an exact change of coordinates that was always available, hiding inside the original bond-vector description.
Notice the check built into the figure: the trace of the original block under is (pure off-diagonal swap matrix), and the trace of the block-diagonal form is . These must agree — traces are basis-independent — and they do. This is the character-additivity property that makes the whole machinery usable without ever explicitly constructing . The same idea scales up enormously. In an octahedral complex, the six ligand -orbitals generate a six-dimensional reducible representation, . It decomposes as (dimensions , matching). The five metal d-orbitals generate a five-dimensional representation that is already irreducible-adjacent: it splits as (). Symmetry alone, before any energetics, tells you the d-orbitals split into two sets and that only the metal d-orbitals share a symmetry label with (and hence can bond to) the ligand combinations — the set is symmetry-forbidden from -bonding and remains nonbonding (or engages only in -bonding with ligand orbitals of symmetry). The reducible/irreducible split is the qualitative molecular orbital diagram, extracted purely from geometry.
The core ideas
The formal statement, sometimes called the complete reducibility theorem (a consequence of Maschke's theorem for finite groups over the complex or real numbers, with unitary representations), is:
where:
- is any (finite-dimensional) representation of the group,
- are all the group's inequivalent irreducible representations (a finite, fixed list — the rows of the character table),
- is an integer, the multiplicity — how many times occurs inside ,
- denotes direct sum: after an appropriate similarity transformation, every matrix becomes block-diagonal with copies of -sized blocks, then copies of -sized blocks, and so on.
Reading it: any representation, however large or ugly, is entirely built from these standard irreducible pieces, each appearing some whole number of times, and once you know the multiplicities you know the representation completely (up to choice of basis). Because similarity transformations leave traces unchanged ( for any invertible ), and the trace of a block-diagonal matrix is the sum of the traces of its blocks, character additivity follows immediately:
where:
- is the character (trace) of the reducible representation at operation ,
- is the tabulated character of irrep at operation (found directly in the character table),
- are the same non-negative integer multiplicities as above, now to be determined from the characters alone — you never need to construct the matrices or the transformation explicitly.
Reading it: to decompose any reducible representation, all you actually need is its character (one number per class of operations), not its full matrix representation. This is what makes group theory tractable in practice; it is also the seed of the reduction formula introduced separately. A second core relationship pins down why the list of irreps is finite and fixed, via the dimensionality theorem:
where:
- is the dimension of irrep (its character under the identity operation),
- is the order of the group (total number of symmetry operations),
- the sum runs over all inequivalent irreducible representations of the group.
Reading it: the "sizes" of the group's irreducible building blocks are not arbitrary — their squares must exactly tile the order of the group, which is why (order 4) has four 1-dimensional irreps () while (order 24) needs , giving two 1-D, one 2-D, and two 3-D irreps ().
Goal. Show that if a representation has any proper invariant subspace, a similarity transformation exists that block-diagonalizes every simultaneously — and locate the obstruction that defines "irreducible."
Step 1 — Invariant subspace exists by hypothesis. Suppose the representation acts on vector space , and there is a proper subspace (not , not all of ) such that for every and every . This is the definition of reducibility: the group's action never carries a vector out of .
Step 2 — Construct a complementary invariant subspace. For representations that are unitary (always achievable for finite groups by choosing an appropriate inner product, since one can average any inner product over the group to make it invariant), the orthogonal complement of in is automatically also invariant. This is because unitarity means preserves inner products, so if for all vectors in , then is also orthogonal to (using that maps onto itself, being invertible on the invariant subspace). Hence too.
Step 3 — Choose the adapted basis. Pick a basis spanning and spanning ; together they form a basis of the full -dimensional space . Let be the matrix whose columns are these basis vectors expressed in the original coordinates. Because both and are separately invariant, acting with on any basis vector produces a vector that stays entirely within its own subspace — no invariant-basis vector's image ever needs a component from the other subspace to be expressed. Hence in this basis, every matrix has the block form
for all simultaneously (the same works for every group element, because was built purely from the invariant-subspace decomposition of the vector space, not from any single operation).
Step 4 — Recurse or stop: the definition of irreducible. If or is itself reducible (has its own proper invariant subspace), repeat Steps 1–3 on that block. Because dimension strictly decreases at each split and must stay a positive integer, this process terminates after finitely many steps. The process ends exactly when every remaining block is a representation with no proper invariant subspace at all — by definition, an irreducible representation. This is why Schur's lemma matters: it is precisely the statement (in its operator form) that an irreducible representation admits no nontrivial matrix commuting with all except scalar multiples of the identity, which is the algebraic fingerprint of "cannot be split further." The end result of the recursion is exactly the block-diagonal direct sum stated above.
Consistency check. At every step, because trace is similarity-invariant; summing block traces at the final stage reproduces exactly as asserted, with no information lost or invented in the process.
Go deeper · Derivation B · 1 minCharacter additivity from block-diagonal trace, applied to a concrete asymmetric example
Goal. Derive explicitly for a small but non-symmetric worked case, so the bookkeeping is visible in full rather than asserted abstractly.
Step 1 — Set the stage. Take a hypothetical 4-dimensional reducible representation of a group whose irreps include a 1-D irrep with characters , and a 3-D irrep with characters , at some particular class-representative operation (not the identity). Suppose decomposes with multiplicities and : that is, .
Step 2 — Write the block-diagonal matrix explicitly at operation . After the similarity transform from the previous derivation, the matrix becomes
where the top-left block is and the bottom-right block is with diagonal entries summing to its trace, i.e. (the specific off-diagonal values depend on which irreducible 3-D representation this is and are irrelevant to the trace).
Step 3 — Take the trace directly. The trace of the full block-diagonal matrix is, by definition, the sum of its diagonal entries:
Step 4 — Confirm via the additivity formula. Using with :
The two computations agree exactly, as they must, because trace is similarity-invariant — Step 3 computed it from the explicit matrix, Step 4 from the multiplicity formula, and there is no room for the two to disagree since they describe the same number viewed two ways.
Step 5 — Do the same at the identity, as the built-in dimension check. At : , so , matching the stated dimension of (a representation must have , since is always the identity matrix of that dimension, with trace equal to the dimension). This dimension check — multiplicities times irrep dimensions summing to the total dimension of — is the fastest sanity check available whenever a reduction is proposed.
Worked examples
Example 1 (foundational): the two O–H stretches of water under , done by hand. has operations and four 1-D irreps: , , , (using the convention that is the molecular plane). Take the basis , the two O–H bond-stretch coordinates. Under , both bonds map to themselves: matrix is the identity, trace . Under , the two H atoms swap, so : the matrix is the swap matrix with zero diagonal, trace . Under (the molecular plane containing both H's), both bonds map to themselves (this mirror plane doesn't move the H atoms since they lie in it), trace . Under (perpendicular plane, swapping the two H's), trace . So : . Reduce by inspection (this is literally , checking against the additivity formula):
Matching the entry: . Matching the entry: , so . Check : — this fails, so try instead matched against 's actual character evaluated at gives , and gives , summing to , still not . The resolution: the correct combination is ( has character , symmetric under , antisymmetric under — the assignment depends on whether is chosen as the molecular plane or the perpendicular plane; with as the H₂O plane, the totally symmetric stretch combination and its partner transform as under the standard Mulliken convention used in most texts, where is symmetric under , antisymmetric under and ). Using that standard convention consistently: under . Then . Setting equal to gives and , so , and every entry now matches: exactly.
Dimension check: , matching . Physically: (symmetric stretch, , IR- and Raman-active) and (antisymmetric stretch, , also IR-active) — exactly water's two observed O–H stretching bands ( cm⁻¹ symmetric, cm⁻¹ antisymmetric), with no bending mode included here since only stretch coordinates were chosen as the basis.
Example 2 (applied): the σ-framework of a square planar (). Four ligand σ-orbitals, one per Cl, sit at the corners of a square around Pt. Build by counting how many ligand orbitals are left unmoved (with weight , since a -orbital pointing at the metal transforms into itself under operations that fix its ligand in place) by each class of operation in .
- : all 4 ligands fixed → .
- (90° rotation): no ligand stays in place (each moves to the next corner) → .
- (180°, same axis as ): opposite ligands swap, none fixed → .
- (through two ligands): those two ligands fixed, other two swap → .
- (through edge midpoints, between ligands): no ligand fixed → .
- : all ligands move to opposite corners, none fixed → .
- : none fixed → .
- (molecular plane, contains all 4 ligands): all 4 fixed → .
- (containing 2 ligands each, and the axis, perpendicular to molecular plane... here taken through opposite ligand pairs): 2 fixed → .
- (through edge midpoints): 0 fixed → .
So over . Comparing against the character table (order ), this reduces to
Dimension check: ✓. This is the textbook result for square-planar σ-bonding: the metal's orbital (which transforms as ) is the only d-orbital that can σ-bond with the ligand set, exactly matching why is pushed to famously high energy in square-planar splitting diagrams, while overlaps with the totally symmetric ligand combination only weakly (mostly through the ligand's radial/axial character), and () have no -symmetry match at all and remain purely -active or nonbonding.
Example 3 (exam/competition level): decomposing the 15-dimensional Cartesian representation of () and extracting the vibrational modes. Ammonia, , order : operations ; irreps , , . Assign 3 Cartesian axes () to each of the 4 atoms (N + 3 H), giving a 12-dimensional... but here we deliberately use the full atom count including all 4 atoms to build , , dimension . Character of at each operation is (number of atoms unmoved) × (contribution per unmoved atom, which is for proper rotation by angle , or for improper /reflection, with giving contribution ):
- : all 4 atoms unmoved, per-atom contribution . .
- (120°): only N unmoved (the 3 H's cycle), per-atom contribution . .
- : N and one H (the one lying in that particular plane) unmoved — 2 atoms unmoved, per-atom reflection contribution (reflection is ). .
So over . Reduce using (the reduction formula, used here as a tool though derived fully elsewhere):
So . Dimension check: ✓. Now remove translations ( transform as in ) and rotations ( transform as ):
Dimension check: ✓, exactly ammonia's six vibrational degrees of freedom: the symmetric stretch and umbrella bend (both , each nondegenerate) plus the doubly degenerate asymmetric stretch and doubly degenerate bend (each , counted once as a 2-D irrep but contributing 2 to the mode count) — matching the four experimentally observed IR bands of NH₃ (ν₁, ν₂ nondegenerate; ν₃, ν₄ doubly degenerate), a classic worked case in vibrational spectroscopy.
Limiting cases, scope & common traps
| Situation | What happens | Why |
|---|---|---|
| Basis already symmetry-adapted (e.g. SALCs) | appears already block-diagonal; trivially readable | No further reduction needed — the invariant subspaces were chosen from the start |
| Totally symmetric basis (e.g. one s-orbital on central atom) | (or equivalent) always, for any group | A single unmoved object under every operation of any group is, trivially, irreducible and totally symmetric |
| Group has only 1-D irreps (all abelian groups, e.g. ) | Every irreducible block is ; "block-diagonal" reduces to fully diagonal | Abelian groups: all matrices in any irrep commute, forcing dimension 1 by Schur's lemma |
| Degenerate irreps present () | Multiplicities can still be integers, but the within-block mixing of degenerate partners is basis-dependent (any orthogonal rotation of the two E-partners is equally valid) | Schur's lemma fixes the block sizes, not the specific choice of basis vectors spanning a degenerate irreducible subspace |
| for some irrep | That irrep is simply absent — cleanly excluded from mixing/bonding/activity, a selection rule | Absence of a symmetry label in the reduction is itself chemical information (e.g. forbidden IR/Raman transitions) |
| Very large reducible representations (e.g. all Cartesian displacements of a large cluster) | Same reduction formula applies verbatim; only bookkeeping grows | The theorem places no upper limit on dimension of , only on the number of distinct irreps (fixed by the group) |
The chemist behind it
The representation-theoretic backbone used throughout chemical symmetry analysis was not invented by chemists at all. Ferdinand Georg Frobenius developed the theory of group characters and representations in the 1890s, building on work connecting group theory to matrix algebra; Issai Schur, his student, supplied the lemma that makes "irreducible" a precise, checkable algebraic condition rather than an intuitive notion. Their mathematics sat largely dormant for chemistry until the 1930s, when spectroscopists needed a rigorous way to predict which vibrational and electronic transitions were allowed by molecular symmetry. The chemist most responsible for translating this apparatus into the character tables used in every inorganic chemistry course today is Robert S. Mulliken, whose 1933 notation for irreducible representations (, and their gerade/ungerade subscripts) became the universal standard. Mulliken, trained as a physical chemist and later a Nobel laureate (1966, for molecular orbital theory), was uniquely positioned at the interface of the new quantum mechanics and the older, more empirical spectroscopy of molecular vibrations and electronic bands — precisely the discipline that needed group representation theory translated into laboratory-usable labels rather than abstract algebra.
Origins · 1 minRobert Sanderson Mulliken and how this was discovered
What exactly makes a representation "reducible" versus just "large"?
Size alone is irrelevant — a representation is reducible only if it contains a proper invariant subspace, meaning some smaller subset of basis vectors maps entirely into itself under every operation of the group. A 12-dimensional representation could in principle be irreducible if no such subspace exists, though in practice for finite point groups the largest irreducible representations are only 3-dimensional (for the highest-symmetry groups like ). Any representation bigger than the largest available irrep dimension for that group is automatically reducible, simply because it cannot be one of the finite irreps on the character table.
Do all representations decompose uniquely into irreducibles?
Yes, and this uniqueness (guaranteed by Maschke's theorem plus the orthogonality of characters) is what makes the whole method predictive rather than a matter of taste. The multiplicities are uniquely fixed by the character of ; you cannot get two different valid decompositions with different multiplicities for the same representation. What is not unique is the specific choice of basis vectors realizing a particular irreducible block when its multiplicity exceeds one, or when choosing a specific orientation for a degenerate irrep's partner functions — but the labels and counts are fixed.
Why does the trace (character) contain enough information to do the reduction, when the full matrices contain much more?
Because the orthogonality relations obeyed by irreducible characters (a consequence of Schur's lemma applied twice, to compare each pair of irreps) make characters an orthogonal "basis" for class functions on the group. Any reducible representation's character is a specific linear combination of irreducible characters, and orthogonality lets you project out each multiplicity by a simple inner-product-like sum — the reduction formula. The extra information in the full matrices (specific matrix elements, choice of basis) is exactly the "gauge freedom" that similarity transformations can change, and is therefore not physically meaningful on its own; only the trace, invariant under that freedom, carries basis-independent content.
Can a reducible representation contain the same irrep more than once?
Absolutely, and this is common. The Cartesian representation of ammonia, worked above, contains the irrep three times () and four times (). Physically this means three independent totally-symmetric motions exist (translation along the axis, the symmetric stretch, and the umbrella bend) that all share the same symmetry label — meaning they are, in principle, all allowed to mix with one another by symmetry (though the actual amount of mixing is then decided by energetics, not symmetry alone). Symmetry only tells you which motions or orbitals are permitted to mix; it does not by itself tell you how strongly they do.
How does this connect to selection rules in spectroscopy?
A transition (vibrational, electronic, or otherwise) is symmetry-allowed only if the relevant transition-moment integral transforms as the totally symmetric irrep of the point group. Practically, this means checking whether the direct product of the irreps of the initial state, the operator (dipole moment components for IR; polarizability components for Raman), and the final state contains the totally symmetric representation. Since direct products of representations are themselves reducible representations that must be decomposed into irreducibles first, the reducible/irreducible distinction is the computational engine underneath every group-theoretic selection rule in the periodic table of spectroscopic techniques.
Is block-diagonalization the same thing as diagonalizing a Hamiltonian matrix?
Related but not identical. Block-diagonalizing a representation uses only the symmetry operations and produces blocks labeled by irrep, with sizes fixed purely by group theory (e.g., a block for each occurrence of a 1-D irrep, a block for each occurrence of a 2-D irrep, and so on for however many times that irrep appears). Diagonalizing the Hamiltonian within one of those symmetry blocks is a separate, energetics-dependent step — symmetry only guarantees that off-diagonal Hamiltonian matrix elements between different irreps vanish exactly (a strict, exact selection rule), while matrix elements within a repeated irrep block still generally require solving a smaller secular equation.
Does this framework apply only to finite point groups, or more broadly?
The complete-reducibility theorem as stated relies on the group being finite (or, more generally, compact, which covers continuous groups like the rotation group relevant to atomic term symbols and free-ion spectroscopy). Space groups used for crystalline solids are infinite but still amenable to essentially the same machinery through their finite point-group quotient and Bloch's theorem, which restricts attention to a finite set of irreducible representations at each point in the Brillouin zone. The core reducible/irreducible distinction generalizes cleanly; only the bookkeeping (infinite translational symmetry handled via wavevectors) becomes more elaborate.