Matrix Representations of Symmetry Operations

Take an ammonia molecule and rotate it 120° about its threefold axis. Every nucleus lands on a position previously occupied by an identical nucleus. But the three N–H bond vectors themselves have been permuted. They are re-expressed in a new orientation relative to a fixed laboratory frame. To track exactly how the numbers change, chemists write the symmetry operation as a matrix. This applies to bond vectors, orbitals, or displacement coordinates. The matrix acts on a column vector of basis functions. This turns the abstract rules of Symmetry Operations as a Mathematical Group into concrete linear algebra. Rotations, reflections, and improper rotations all become square matrices. Composing two operations becomes matrix multiplication. This matters because nearly everything group theory does for chemistry rests on one fact. That includes building Reducible and Irreducible Representations, predicting which vibrations are IR- or Raman-active, and constructing symmetry-adapted linear combinations for molecular orbital theory. The key fact: symmetry operations can be represented faithfully by matrices acting on a chosen basis. The trace of a matrix, its character, will turn out to be basis-independent. It is the single number that survives into the character tables every chemist memorizes. But before characters can mean anything, some groundwork is needed. One must understand where the matrices come from. One must see how their entries are read off geometrically. And one must know why the set of matrices for a point group reproduces the same multiplication table as the operations themselves. The big picture is this: a point group is an abstract algebraic object. It is a set of operations closed under composition. A representation is a homomorphism from that abstract group into a group of invertible matrices. The homomorphism property — D(R)D(S)=D(RS)D(R)D(S) = D(RS) — is what makes matrix representations useful rather than merely decorative. Once a basis is chosen, each symmetry operation acts on that basis. The basis could be Cartesian x,y,zx,y,z axes, the three N–H bonds, a set of p-orbitals, or the 3N3N Cartesian displacements of every atom. Each operation can then be written down explicitly as a matrix. This uses nothing more than rotation geometry and reflection geometry. This article builds those matrices from first principles for rotations, reflections, inversion, and improper rotations. It shows how to construct a representation on a chosen atomic or vector basis. It works through C2vC_{2v} and C3vC_{3v} in full explicit detail. Every matrix entry can be checked by hand. It closes with the transformation law for basis changes, known as similarity transformations. This explains why characters — not individual matrix elements — are the physically meaningful, basis-independent quantities used later.

Key takeaways
  • A symmetry operation acting on a basis of functions or vectors is represented by a square matrix D(R)D(R) satisfying D(R)v=v′D(R)\mathbf{v} = \mathbf{v}'.
  • Proper rotations by angle θ\theta about zz have matrix (cos⁡θ−sin⁡θ0sin⁡θcos⁡θ0001)\begin{pmatrix}\cos\theta & -\sin\theta & 0\\ \sin\theta & \cos\theta & 0\\ 0&0&1\end{pmatrix}; reflections and inversion are diagonal matrices with ±1\pm1 entries in the right frame.
  • Improper rotations SnS_n are rotation matrices followed by a reflection in the plane perpendicular to the axis: Sn=σhCnS_n = \sigma_h C_n.
  • Representations are homomorphisms: D(R)D(S)=D(RS)D(R)D(S)=D(RS), so matrix multiplication must reproduce the group multiplication table exactly.
  • Changing basis conjugates every matrix by the same similarity transformation, D′(R)=P−1D(R)PD'(R)=P^{-1}D(R)P, which changes matrix entries but preserves the trace.
  • Key idea: a symmetry operation becomes numerically usable only once you fix a basis; the matrix that results depends on that basis, but its trace (character) does not, and that invariance is what makes group theory predictive in chemistry.
The core insight

Every symmetry operation of a point group can be written as an invertible matrix acting on a chosen basis, and the map R↦D(R)R \mapsto D(R) preserves the group's multiplication table; this matrix, built purely from rotation/reflection geometry, is the bridge between abstract symmetry operations and the numerical machinery (characters, reducible/irreducible representations) used throughout molecular symmetry.

Where this lives today

Matrix representations are the computational backbone of every symmetry-based prediction made in modern chemistry, even when a working chemist never writes the matrices explicitly. Quantum chemistry software (Gaussian, ORCA, Psi4) uses point-group matrix representations internally to symmetrize molecular orbitals, block-diagonalize the Fock or Kohn–Sham matrix by irreducible representation, and dramatically cut computational cost — a calculation on benzene (D6hD_{6h}) can be blocked into several much smaller symmetry sectors rather than diagonalized as one large matrix, because the Hamiltonian commutes with every D(R)D(R) of the molecular point group. Vibrational spectroscopy software builds the 3N3N-dimensional Cartesian representation exactly as sketched in this article (tracking which atoms are unmoved by each operation and how their displacement vectors transform) to predict which normal modes are IR- or Raman-active before any experiment is run, a technique used routinely in identifying isomers of coordination complexes and in interpreting the vibrational fingerprint region of organic and inorganic unknowns. Crystallographers use the matrix representations of space-group operations (an extension including translations) to generate the full set of atomic positions in a unit cell from a crystallographic asymmetric unit, a step performed automatically by every structure-refinement package (SHELX, Olex2) each time a `.cif` file is processed. In ligand field and molecular orbital theory, the matrices built on ligand σ\sigma- or π\pi-orbital bases (as in the XeF4\mathrm{XeF_4} and NH3\mathrm{NH_3} examples above) are the direct precursors to symmetry-adapted linear combinations that predict the splitting pattern of d-orbitals in octahedral and tetrahedral complexes, underlying the interpretation of UV-vis spectra, magnetism, and catalytic activity across transition-metal chemistry.

Ask the tutor: How do I turn a big reducible representation like Γ3N\Gamma_{3N} into the small set of irreducible representations that tell me which vibrations are IR-active?

The physical picture

A symmetry operation RR (rotation, reflection, inversion, improper rotation, or the identity) moves points in space. To do arithmetic with it, pick a basis — a set of vectors or functions {f1,f2,…,fn}\{f_1, f_2, \dots, f_n\} that spans some space of interest (Cartesian axes, bond vectors, atomic orbitals, atomic Cartesian displacements). The operation RR sends each basis function to some linear combination of the basis functions:

R fj=∑i=1nD(R)ij fiR\, f_j = \sum_{i=1}^{n} D(R)_{ij}\, f_i

The array of coefficients D(R)ijD(R)_{ij} is the matrix representative of RR in that basis. Column jj of the matrix tells you where basis vector fjf_j ends up, expressed in terms of the original basis. This convention — reading transformed basis vectors down columns — is the one used throughout; it is exactly analogous to how a rotation matrix's columns are the images of the standard unit vectors. For proper rotations Cn(θ)C_n(\theta) about the zz-axis (with θ=2π/n\theta = 2\pi/n or an integer multiple thereof), elementary trigonometry gives the images of x^,y^,z^\hat x, \hat y, \hat z:

Cn(θ)=(cos⁡θ−sin⁡θ0sin⁡θcos⁡θ0001)C_n(\theta) = \begin{pmatrix} \cos\theta & -\sin\theta & 0 \\ \sin\theta & \cos\theta & 0 \\ 0 & 0 & 1 \end{pmatrix}

The zz-axis is left invariant (it is the rotation axis), so the third row/column is trivially (0,0,1)(0,0,1). For a reflection σ\sigma through a plane containing two of the basis axes, the matrix is diagonal with a −1-1 in the position of the axis perpendicular to the mirror. A reflection in the xzxz-plane (so y→−yy \to -y) is

σxz=(1000−10001)\sigma_{xz} = \begin{pmatrix} 1&0&0\\0&-1&0\\0&0&1\end{pmatrix}

Inversion through the origin sends every coordinate to its negative:

i=(−1000−1000−1)i = \begin{pmatrix} -1&0&0\\0&-1&0\\0&0&-1\end{pmatrix}

An improper rotation SnS_n is a rotation by 2π/n2\pi/n followed by reflection in the plane perpendicular to the rotation axis (σh\sigma_h):

Sn(θ)=σh Cn(θ)=(cos⁡θ−sin⁡θ0sin⁡θcos⁡θ000−1)S_n(\theta) = \sigma_h\, C_n(\theta) = \begin{pmatrix} \cos\theta & -\sin\theta & 0\\ \sin\theta & \cos\theta & 0 \\ 0&0&-1 \end{pmatrix}

These four matrix forms — proper rotation, mirror reflection, inversion, improper rotation — are the entire toolkit; every point-group operation is one of them, expressed in whatever coordinate frame is natural for the molecule. Crucially, representations do not have to act on (x,y,z)(x,y,z). They can act on any basis that the point group permutes or mixes: the set of ligand σ\sigma-bond vectors in an octahedral complex, the 2p2p orbitals on a central atom, the three N–H bonds of ammonia, or all 3N3N Cartesian atomic displacement coordinates used in vibrational analysis. Choosing the basis is the modeler's decision; building the matrix is then pure geometry.

Figure
Rotation matrix acting on a 2-D basis: C3C_3 rotates (x,y)(x,y) by 120°
x y v = (1,0) C₃v = (−0.5, 0.866) 120° D(C₃) = [ cos120° −sin120° ] [ −0.500 −0.866 ] [ sin120° cos120° ] = [ 0.866 −0.500 ] Column 1 of D(C₃) is exactly the image of (1,0): (−0.5, 0.866) ✓ matches red vector
Figure
C2vC_{2v} acting on the three atomic positions of H₂O: a permutation-like representation
O Ha Hb C₂ axis σᵥ(xz) swaps Ha ↔ Hb, fixes O On basis (O, Ha, Hb): D(σᵥ) = [[1,0,0],[0,0,1],[0,1,0]] — trace = 1

The core ideas

The defining algebraic property of a representation is that it turns group multiplication into matrix multiplication:

D(R) D(S)=D(RS)for all R,S in the groupD(R)\,D(S) = D(RS) \qquad \text{for all } R, S \text{ in the group}

where: D(R)D(R) and D(S)D(S) are the matrices assigned to operations RR and SS in a fixed basis, and RSRS denotes the group product (apply SS first, then RR, matching the Symmetry Operations as a Mathematical Group convention). This equation says the matrices are not arbitrary — their multiplication table must mirror the operation table exactly, so DD is a genuine homomorphism, not just a bookkeeping device. Reading: if you know the matrices for the generating operations of a group, every other matrix is fixed by matrix multiplication; you never need to re-derive a matrix from geometry once enough generators are known. Every representation matrix must also be invertible, with inverse equal to the matrix of the inverse operation:

D(R)−1=D(R−1)D(R)^{-1} = D(R^{-1})

where: R−1R^{-1} is the inverse symmetry operation guaranteed to exist by the group axioms. For orthogonal transformations (rotations, reflections — all point-group operations preserve lengths and angles), D(R)−1=D(R)TD(R)^{-1} = D(R)^{T}, so representation matrices for point groups are always orthogonal matrices: D(R)TD(R)=1D(R)^T D(R) = \mathbb{1}. Reading: this orthogonality is not an extra assumption — it follows because every point-group operation is a rigid motion (isometry) of 3-D space, hence its matrix (in an orthonormal Cartesian basis) automatically satisfies DTD=1D^TD=\mathbb 1. Finally, if the basis is changed by an invertible matrix PP (new basis vectors are linear combinations of old ones, fi′=∑kPkifkf_i' = \sum_k P_{ki} f_k), every representation matrix transforms by a similarity transformation:

D′(R)=P−1D(R) PD'(R) = P^{-1} D(R)\, P

where: D(R)D(R) is the matrix in the old basis, D′(R)D'(R) the matrix in the new basis, and PP the (fixed, RR-independent) change-of-basis matrix. The homomorphism property survives this transformation automatically, since P−1D(R)P⋅P−1D(S)P=P−1D(R)D(S)P=P−1D(RS)PP^{-1}D(R)P \cdot P^{-1}D(S)P = P^{-1}D(R)D(S)P = P^{-1}D(RS)P. Reading: individual matrix entries are basis-dependent and hence not physically special, but the trace of D(R)D(R) is invariant under similarity transformations (tr(P−1AP)=tr(A)\mathrm{tr}(P^{-1}AP) = \mathrm{tr}(A)), so the character χ(R)=tr D(R)\chi(R) = \mathrm{tr}\,D(R) is the basis-independent fingerprint of an operation — the quantity that survives into character tables.

Derivation ABuilding the C2vC_{2v} representation on Cartesian axes (x,y,zx,y,z)

Goal. Construct explicit 3×33\times3 matrices for the four operations of C2vC_{2v} (EE, C2C_2, σv(xz)\sigma_v(xz), σv′(yz)\sigma_v'(yz)) acting on the standard Cartesian basis, and verify the homomorphism property on one nontrivial product, using the water molecule as the geometric model (the C2C_2 axis is zz; the molecular plane is xzxz).

Step 1 — Identity. By definition EE moves nothing, so D(E)D(E) is the 3×33\times3 identity matrix:

D(E)=(100010001)D(E) = \begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}

Its trace is χ(E)=3\chi(E) = 3, the dimension of the basis — a fact that generalizes to any basis and any group.

Step 2 — C2C_2 about zz. Using the rotation formula with θ=π\theta = \pi: cos⁡π=−1\cos\pi = -1, sin⁡π=0\sin\pi = 0. The image of x^\hat x is −x^-\hat x, the image of y^\hat y is −y^-\hat y, and z^\hat z is fixed:

D(C2)=(−1000−10001),χ(C2)=−1−1+1=−1D(C_2) = \begin{pmatrix}-1&0&0\\0&-1&0\\0&0&1\end{pmatrix}, \qquad \chi(C_2) = -1-1+1 = -1

Geometrically this matches intuition: a 180° rotation about zz flips both in-plane axes and leaves the rotation axis alone.

Step 3 — σv(xz)\sigma_v(xz). This mirror contains xx and zz, so it leaves them fixed and flips yy:

D(σv)=(1000−10001),χ(σv)=1−1+1=1D(\sigma_v) = \begin{pmatrix}1&0&0\\0&-1&0\\0&0&1\end{pmatrix}, \qquad \chi(\sigma_v) = 1-1+1 = 1

Step 4 — σv′(yz)\sigma_v'(yz). This mirror contains yy and zz, so it flips xx and fixes y,zy,z:

D(σv′)=(−100010001),χ(σv′)=−1+1+1=1D(\sigma_v') = \begin{pmatrix}-1&0&0\\0&1&0\\0&0&1\end{pmatrix}, \qquad \chi(\sigma_v') = -1+1+1 = 1

Step 5 — Verify the homomorphism. In the group table for C2vC_{2v}, C2⋅σv(xz)=σv′(yz)C_2 \cdot \sigma_v(xz) = \sigma_v'(yz) (rotating 180° and then reflecting in xzxz is equivalent to reflecting in yzyz). Multiply the matrices, applying σv\sigma_v first then C2C_2 (rightmost matrix acts first):

D(C2) D(σv)=(−1000−10001)(1000−10001)=(−100010001)D(C_2)\,D(\sigma_v) = \begin{pmatrix}-1&0&0\\0&-1&0\\0&0&1\end{pmatrix}\begin{pmatrix}1&0&0\\0&-1&0\\0&0&1\end{pmatrix} = \begin{pmatrix}-1&0&0\\0&1&0\\0&0&1\end{pmatrix}

This equals D(σv′)D(\sigma_v') exactly — confirming the representation is a genuine homomorphism on this basis, entry by entry, not merely in trace.

Step 6 — Read off the reducible representation. Collecting characters, the representation of C2vC_{2v} on (x,y,z)(x,y,z) has the character set χ(E)=3, χ(C2)=−1, χ(σv)=1, χ(σv′)=1\chi(E)=3,\ \chi(C_2)=-1,\ \chi(\sigma_v)=1,\ \chi(\sigma_v')=1. This row of numbers is exactly what appears under the x,y,zx,y,z column of the standard C2vC_{2v} character table, and later decomposes into A1(z)⊕B1(x)⊕B2(y)A_1(z) \oplus B_1(x) \oplus B_2(y) — the decomposition itself belongs to Reducible and Irreducible Representations, but the matrices built here are the raw material for it.

Go deeper · Derivation B · 2 minConstructing the C3vC_{3v} representation on the three N–H bond vectors of ammonia
Derivation BConstructing the C3vC_{3v} representation on the three N–H bond vectors of ammonia

Goal. Ammonia has C3vC_{3v} symmetry: EE, two rotations C3,C32C_3, C_3^2, and three vertical mirrors σv,σv′,σv′′\sigma_v, \sigma_v', \sigma_v''. Represent these six operations not on Cartesian axes but on the three-dimensional basis of unit vectors along the three N–H bonds, {r1,r2,r3}\{r_1, r_2, r_3\}, and show how the matrices are built from tracking which bond each operation sends each bond to.

Step 1 — Geometry setup. Place the three N–H bonds so that C3C_3 rotates r1→r2→r3→r1r_1 \to r_2 \to r_3 \to r_1 (a 120° rotation cycles the three bonds), viewed down the C3C_3 axis from N toward the centroid of the three H atoms. Label the mirror σv\sigma_v as the plane containing r1r_1 (and the C3C_3 axis); it therefore fixes r1r_1 and swaps r2↔r3r_2 \leftrightarrow r_3.

Step 2 — Matrix for EE. Trivially,

D(E)=(100010001),χ(E)=3D(E) = \begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}, \qquad \chi(E) = 3

Step 3 — Matrix for C3C_3. Since C3C_3 sends r1→r2r_1 \to r_2, r2→r3r_2 \to r_3, r3→r1r_3 \to r_1, each basis vector is replaced entirely by another one (coefficient 1), so the matrix is a cyclic permutation matrix. Column jj records the image of rjr_j:

D(C3)=(001100010),χ(C3)=0+0+0=0D(C_3) = \begin{pmatrix}0&0&1\\1&0&0\\0&1&0\end{pmatrix}, \qquad \chi(C_3) = 0+0+0 = 0

Reading the matrix: column 1 is (0,1,0)T(0,1,0)^T, meaning r1→r2r_1 \to r_2 (a 1 in row 2); column 2 is (0,0,1)T(0,0,1)^T, meaning r2→r3r_2 \to r_3; column 3 is (1,0,0)T(1,0,0)^T, meaning r3→r1r_3\to r_1 — consistent with Step 1.

Step 4 — Matrix for C32C_3^2. This is C3C_3 applied twice, r1→r3→r2→r1r_1\to r_3\to r_2\to r_1 read forward as r1→r3r_1 \to r_3, r2→r1r_2\to r_1, r3→r2r_3\to r_2:

D(C32)=D(C3)2=(010001100),χ(C32)=0D(C_3^2) = D(C_3)^2 = \begin{pmatrix}0&1&0\\0&0&1\\1&0&0\end{pmatrix}, \qquad \chi(C_3^2) = 0

Direct matrix multiplication of D(C3)D(C_3) by itself confirms this without needing new geometric reasoning — the homomorphism property does the work.

Step 5 — Matrix for σv\sigma_v (containing r1r_1). This mirror fixes r1r_1 and swaps r2↔r3r_2 \leftrightarrow r_3:

D(σv)=(100001010),χ(σv)=1+0+0=1D(\sigma_v) = \begin{pmatrix}1&0&0\\0&0&1\\0&1&0\end{pmatrix}, \qquad \chi(\sigma_v) = 1+0+0 = 1

Step 6 — The other two mirrors by conjugation. Rather than re-deriving geometrically, use σv′=C3σvC3−1\sigma_v' = C_3 \sigma_v C_3^{-1} (conjugating the mirror by the rotation moves which bond is fixed). Matrix multiplication gives

D(σv′)=D(C3) D(σv) D(C3)−1=(010100001),χ(σv′)=0+0+1=1D(\sigma_v') = D(C_3)\,D(\sigma_v)\,D(C_3)^{-1} = \begin{pmatrix}0&1&0\\1&0&0\\0&0&1\end{pmatrix}, \qquad \chi(\sigma_v') = 0+0+1=1

This fixes r2r_2 and swaps r1↔r3r_1 \leftrightarrow r_3, exactly the expected geometric action of the mirror through bond 2. The pattern D(σv′′)D(\sigma_v'') (fixing r3r_3, swapping r1↔r2r_1\leftrightarrow r_2) follows the same way.

Step 7 — Collect characters. The six matrices give χ(E)=3, χ(C3)=χ(C32)=0, χ(σv)=χ(σv′)=χ(σv′′)=1\chi(E)=3,\ \chi(C_3)=\chi(C_3^2)=0,\ \chi(\sigma_v)=\chi(\sigma_v')=\chi(\sigma_v'')=1. This character set is exactly the reducible representation Γbonds\Gamma_{\text{bonds}} used to build symmetry-adapted N–H bonding combinations in ammonia's MO diagram; it decomposes as A1⊕EA_1 \oplus E, a result whose machinery belongs to Reducible and Irreducible Representations but whose raw numbers come directly from these permutation matrices.

Worked examples

Example 1 — Foundational: the S4S_4 matrix and confirming S42=C2S_4^2 = C_2. Take an S4S_4 improper rotation about zz: θ=90°\theta = 90°, so cos⁡θ=0\cos\theta = 0, sin⁡θ=1\sin\theta = 1. Using Sn=σhCnS_n = \sigma_h C_n:

D(S4)=(0−1010000−1)D(S_4) = \begin{pmatrix}0&-1&0\\1&0&0\\0&0&-1\end{pmatrix}

Check this against the definitional identity S42=C2S_4^2 = C_2 (two successive S4S_4 operations must equal a C2C_2 rotation, since two reflections in the same plane cancel while the rotations add to 180°). Multiply the matrix by itself:

D(S4)2=(0−1010000−1)(0−1010000−1)=(−1000−10001)D(S_4)^2 = \begin{pmatrix}0&-1&0\\1&0&0\\0&0&-1\end{pmatrix}\begin{pmatrix}0&-1&0\\1&0&0\\0&0&-1\end{pmatrix} = \begin{pmatrix}-1&0&0\\0&-1&0\\0&0&1\end{pmatrix}

This is exactly D(C2)D(C_2) derived earlier (Step 2 of the first derivation). The trace check: χ(S4)=0+0−1=−1\chi(S_4) = 0+0-1 = -1, and χ(S42)=−1−1+1=−1=χ(C2)\chi(S_4^2) = -1-1+1=-1 = \chi(C_2), consistent. This example is deliberately asymmetric in structure (mixing rotation and reflection) precisely so that a sign error in either the rotation block or the σh\sigma_h block would be caught — a purely diagonal example (like inversion alone) would not expose an error in the off-diagonal rotation terms.

Example 2 — Applied: representation of C4vC_{4v} acting on the four F ligand σ\sigma-orbitals of square-planar XeF4\mathrm{XeF_4} under a non-principal operation. XeF4\mathrm{XeF_4} belongs to D4hD_{4h}, but restricting attention to its C4vC_{4v} subgroup of operations acting in the molecular plane is a common step when building the σ\sigma-only ligand representation for MO analysis. Label the four F σ\sigma orbitals f1,f2,f3,f4f_1, f_2, f_3, f_4 going anticlockwise, with f1f_1 along +x+x, f2f_2 along +y+y, f3f_3 along −x-x, f4f_4 along −y-y. Consider the operation σv(xz)\sigma_v(xz): this mirror plane contains the xx-axis and reflects y→−yy \to -y, so it fixes the ligands lying on the mirror (f1f_1 and f3f_3, both on the xx-axis) and swaps the two off-axis ligands (f2↔f4f_2 \leftrightarrow f_4).

D(σv)=(1000000100100100)D(\sigma_v) = \begin{pmatrix}1&0&0&0\\0&0&0&1\\0&0&1&0\\0&1&0&0\end{pmatrix}

Read column by column: column 1 (image of f1f_1) is (1,0,0,0)T(1,0,0,0)^T — f1f_1 is unchanged; column 2 (image of f2f_2) is (0,0,0,1)T(0,0,0,1)^T — f2→f4f_2 \to f_4; column 3 (image of f3f_3) is (0,0,1,0)T(0,0,1,0)^T — unchanged; column 4 (image of f4f_4) is (0,1,0,0)T(0,1,0,0)^T — f4→f2f_4 \to f_2. Trace: χ(σv)=1+0+1+0=2\chi(\sigma_v) = 1+0+1+0 = 2. Compare with C4C_4 (90° rotation, f1→f2→f3→f4→f1f_1\to f_2\to f_3\to f_4\to f_1): every basis vector moves to a different one, so all diagonal entries are zero and χ(C4)=0\chi(C_4) = 0. This asymmetry between a mirror through two ligands (character 2, from the two fixed ligands) and a rotation through none (character 0) illustrates the general shortcut used later: the character of a permutation-type representation equals the number of basis objects left unmoved by the operation — a fact that follows immediately from the matrix construction (only unmoved basis vectors contribute a nonzero diagonal entry) and is exploited constantly when building Γligand\Gamma_{\text{ligand}} or Γ3N\Gamma_{3N} representations in vibrational analysis.

Example 3 — Exam/competition level: verifying a similarity transformation changes matrix entries but not the trace, using a rotated basis in C3vC_{3v}. Take the D(C3)D(C_3) matrix from the ammonia bond-vector derivation,

D(C3)=(001100010),χ(C3)=0D(C_3) = \begin{pmatrix}0&0&1\\1&0&0\\0&1&0\end{pmatrix}, \qquad \chi(C_3) = 0

Now change to a new, non-orthonormal basis defined by

g1=r1+r2+r3,g2=r1−r2,g3=r2−r3g_1 = r_1 + r_2 + r_3,\qquad g_2 = r_1 - r_2,\qquad g_3 = r_2 - r_3

(these are exactly the symmetry-adapted-type combinations that will reappear when this representation is reduced). The change-of-basis matrix, whose columns express gig_i in terms of r1,r2,r3r_1,r_2,r_3, is

P=(1101−1110−1)P = \begin{pmatrix}1&1&0\\1&-1&1\\1&0&-1\end{pmatrix}

Its inverse (computed by cofactor expansion; det⁡P=1(1−0)−1(−1−1)+0=1+2=3\det P = 1(1-0) -1(-1-1)+0 = 1+2 = 3) is

P−1=13(1112−1−111−2)P^{-1} = \frac{1}{3}\begin{pmatrix}1&1&1\\2&-1&-1\\1&1&-2\end{pmatrix}

Now compute D′(C3)=P−1D(C3)PD'(C_3) = P^{-1} D(C_3) P. First, D(C3)PD(C_3) P:

D(C3)P=(001100010)(1101−1110−1)=(10−11101−11)D(C_3)P = \begin{pmatrix}0&0&1\\1&0&0\\0&1&0\end{pmatrix}\begin{pmatrix}1&1&0\\1&-1&1\\1&0&-1\end{pmatrix} = \begin{pmatrix}1&0&-1\\1&1&0\\1&-1&1\end{pmatrix}

Then multiply by P−1P^{-1}:

P−1(D(C3)P)=13(1112−1−111−2)(10−11101−11)=13(30003−3030)=(10001−1010)P^{-1}(D(C_3)P) = \frac{1}{3}\begin{pmatrix}1&1&1\\2&-1&-1\\1&1&-2\end{pmatrix}\begin{pmatrix}1&0&-1\\1&1&0\\1&-1&1\end{pmatrix} = \frac{1}{3}\begin{pmatrix}3&0&0\\0&3&-3\\0&3&0\end{pmatrix} = \begin{pmatrix}1&0&0\\0&1&-1\\0&1&0\end{pmatrix}

The entries have completely changed — D′(C3)D'(C_3) is no longer a simple permutation matrix; the g1g_1 row/column has decoupled (g1g_1 transforms into itself alone, coefficient 1, since g1g_1 is the totally symmetric sum invariant under any relabeling of the bonds). But check the trace:

χ′(C3)=1+1+0=0\chi'(C_3) = 1 + 1 + 0 = 0

which exactly equals χ(C3)=0\chi(C_3) = 0 computed in the original bond basis. The similarity transformation scrambled every matrix entry yet left the character untouched, exactly as the invariance tr(P−1AP)=tr(A)\mathrm{tr}(P^{-1}AP)=\mathrm{tr}(A) guarantees — and it also reveals, as a bonus, that g1g_1 already sits in its own invariant 1-D block, an early hint of how Reducible and Irreducible Representations extracts the A1A_1 block from a larger reducible representation.

Limiting cases, scope & common traps

SituationWhat happens to D(R)D(R)Check
Basis is just {z}\{z\} (1-D, along principal axis)D(R)D(R) is a 1×11\times1 matrix, D(Cn)=1D(C_n)=1, D(σv)=1D(\sigma_v)=1, D(i)=−1D(i)=-1Matches character of AA vs BB irreducible representations later
Basis is unmoved entirely by RRD(R)=1nD(R) = \mathbb{1}_n (identity), regardless of basis choiceSanity check: D(E)D(E) is always the identity, trace =n=n
Change of basis PP = identityD′(R)=D(R)D'(R) = D(R) exactlyTrivial limiting case of the similarity transformation
Non-orthonormal basis (e.g. bond vectors not mutually perpendicular)D(R)D(R) need not be an orthogonal matrix, even though RR itself is an isometry of spaceOrthogonality of D(R)D(R) is a property of the orthonormal Cartesian representation, not guaranteed in arbitrary bases
Operation permutes basis objects with none fixed (e.g. C3C_3 on 3 bonds)Diagonal entries all zero, χ(R)=0\chi(R)=0Confirms the "number of unmoved objects" shortcut
Reducible representation on a large basis (e.g. 3N3N Cartesian displacements)D(R)D(R) is large and mostly zero (block structure by atom); only atoms unmoved by RR contribute nonzero blocksSets up the Γ3N\Gamma_{3N} construction used in vibrational analysis

The chemist behind it

The matrix formalism used here draws on nineteenth-century group representation theory developed by mathematicians — most centrally Ferdinand Georg Frobenius and later Issai Schur, who built the theory of group representations and characters in the 1890s–1900s, decades before it was applied to molecules. The bridge into chemistry and spectroscopy was built by Hans Bethe (crystal field theory, 1929) and especially by Eugene Wigner, whose 1931 book Gruppentheorie und ihre Anwendung auf die Quantenmechanik der Atomspektren systematically applied representation theory to atomic and molecular quantum mechanics. Wigner showed that the matrices representing symmetry operations on a quantum-mechanical basis of wavefunctions dictate selection rules, degeneracies, and the block structure of the Hamiltonian — ideas absorbed directly into chemical group theory by the mid-twentieth century through workers like Robert Mulliken (who standardized much of the notation for irreducible representations used in character tables) and the widespread textbook synthesis of Cotton's Chemical Applications of Group Theory.

Origins · 1 minEugene Paul Wigner and how this was discovered
EP
Eugene Paul Wigner
1902–1995 · Hungarian-American theoretical physicist, Princeton, and pioneer of applying group representation theory to quantum mechanics

Wigner trained as a chemical engineer in Berlin before turning to theoretical physics, a background that arguably made him unusually attentive to how abstract symmetry mathematics could be turned into concrete, checkable predictions for real physical systems. His 1931 treatise systematized how symmetry operations act as matrices on quantum states, laying the representation-theoretic foundation later adopted wholesale by chemists for molecular orbital theory, ligand field theory, and vibrational spectroscopy. He shared the 1963 Nobel Prize in Physics for contributions to the theory of the atomic nucleus and elementary particles, work deeply rooted in the same symmetry-and-representation methods.

History
- 1854 — Arthur Cayley formalizes abstract group theory and group multiplication tables.
- 1896–1905 — Frobenius and Schur develop the theory of group representations and characters for finite groups.
- 1929 — Hans Bethe applies group-theoretic ideas to crystal field splitting of atomic levels in crystalline environments.
- 1931 — Eugene Wigner publishes the foundational text applying representation theory systematically to quantum mechanics.
- 1950s–1960s — F. Albert Cotton and others codify matrix representations and character tables into standard chemistry curricula.
Why does the choice of basis change the matrix but not the physics?

The matrix D(R)D(R) is a numerical encoding of how a chosen set of basis vectors gets mixed by an operation; different bases describe the same physical rotation/reflection using different bookkeeping. The underlying geometric operation — rotate the molecule 120°, say — is unchanged, but the coordinates you use to describe "before" and "after" differ, so the coefficients differ too. What must stay fixed across all valid bases is the algebraic relationship between operations (the homomorphism property) and basis-independent invariants like the trace, which is exactly why characters, not raw matrix entries, are tabulated in character tables and used for chemical predictions.

Is the matrix for SnS_n always literally σh\sigma_h times CnC_n as separate physical steps?

Mathematically yes — SnS_n is defined as the composition of a rotation by 2π/n2\pi/n followed by reflection through the plane perpendicular to that axis, and the matrix D(Sn)=D(σh)D(Cn)D(S_n) = D(\sigma_h)D(C_n) reproduces this exactly. Physically, for many molecules (like staggered ethane's S6S_6-related symmetry or the alternating tetrahedral arrangement in methane's S4S_4 axes) neither the intermediate rotated structure nor the intermediate reflected structure is itself a symmetry operation of the molecule — only the combined SnS_n operation maps the molecule onto itself. The matrix multiplication is still valid because it operates on coordinates, independent of whether the intermediate step is itself a molecular symmetry.

How do I know which basis to choose when building a representation for a chemistry problem?

Choose the basis that spans exactly the physical quantity you care about: Cartesian x,y,zx,y,z for translations and rotations (relevant to selection rules and the "trivial" translational/rotational modes to be subtracted off in vibrational analysis), ligand σ\sigma- or π\pi-orbitals for constructing molecular orbital diagrams, d-orbitals for ligand field splitting, or full 3N3N atomic Cartesian displacements for vibrational spectroscopy. The representation built on that basis, once reduced into irreducible pieces, tells you directly which symmetry-adapted combinations are relevant (bonding/antibonding patterns, IR/Raman activity, orbital degeneracies).

Why is χ(E)\chi(E) always equal to the dimension of the basis, no matter what basis is chosen?

The identity operation leaves every point in space fixed, so D(E)D(E) is always the identity matrix in any basis — this is true before any similarity transformation is even considered, because EE literally does nothing to any vector. The identity matrix's trace is simply the number of basis functions (its dimension nn), so χ(E)=n\chi(E)=n always. This is a useful sanity check: if your computed χ(E)\chi(E) does not equal the size of your chosen basis, an error has been made in setting up the matrices.

Do representation matrices have to be square?

Yes, always. A representation matrix maps an nn-dimensional basis to linear combinations of the same nn-dimensional basis (the operation cannot create or destroy basis functions, only mix them), so D(R)D(R) is always n×nn\times n for a basis of size nn. This squareness is also required for the matrices to be invertible (a necessity, since every symmetry operation has an inverse) and for matrix multiplication D(R)D(S)D(R)D(S) to be well-defined for all pairs of operations in the group.

What is the difference between a representation and an irreducible representation?

A representation is any assignment of matrices D(R)D(R) to group operations satisfying the homomorphism property, built on any chosen basis, of any dimension. Often such a representation is "reducible" — it can be block-diagonalized by a suitable basis change (similarity transformation) into smaller matrices that are themselves valid, smaller representations. An irreducible representation is one that cannot be block-diagonalized any further; these smallest indivisible building blocks are cataloged in character tables and are the subject of Reducible and Irreducible Representations, which builds directly on the matrix constructions given here.

Can two completely different-looking matrices represent the same symmetry operation validly at the same time?

Yes, provided they act on different bases — for example, D(C3)D(C_3) on Cartesian axes is a rotation matrix with cosine/sine entries, while D(C3)D(C_3) on the three N–H bond vectors of ammonia is a 0/1 cyclic permutation matrix. Both are entirely valid representations of the same abstract operation C3C_3; they simply describe its action on different vector spaces. What must match across all valid representations of the same abstract group is the multiplication table (homomorphism), never the literal matrix entries themselves.

Before this

Where this leads