Symmetry Operations as a Mathematical Group

Take a molecule as unglamorous as water and ask a strange question. What does "doing nothing" have in common with rotating it 180°? The answer is that both are members of a small, closed, self-consistent set of operations. These operations never let you leave the molecule's own symmetry. That closure is the entire content of group theory applied to chemistry. Once you notice that symmetry operations compose the way numbers multiply, obey an identity, and always have an undo button, you have discovered something important. A point group is not a metaphor borrowed from abstract algebra. It is a mathematical group, satisfying every one of the group axioms exactly. This matters because chemistry's most powerful shortcuts are consequences of representation theory. These shortcuts include vanishing overlap integrals, selection rules for IR and Raman activity, and the block-diagonalization of molecular orbital problems. Representation theory only gets off the ground once you have verified something crucial. Your set of symmetry operations really must be a group in the strict sense. Skipping this step and jumping straight to character tables is common, and it works. But it hides why the tables have the internal consistency they do. It hides why every row is orthogonal to every other. It hides why the order of the group divides into the class sizes evenly. Building the multiplication table by hand for even one point group makes all of that inevitable rather than mysterious. The big picture is this. After establishing the point group of a molecule (as in Introduction to Point Groups), you assemble the finite list of symmetry operations that point group contains. Then you check four things: closure under composition, existence of an identity, existence of inverses, and associativity. All four always hold for symmetry operations of a rigid geometric object. But seeing why they hold, and building an explicit multiplication table, is what matters. It turns "the molecule has C2vC_{2v} symmetry" from a label into a working computational tool. This article builds that tool from scratch. We construct the group axioms concretely using C2vC_{2v} (water) and C3vC_{3v} (ammonia) as running examples. We derive their full multiplication tables by explicit composition of operations. We show why non-commuting operations force the distinction between abelian and non-abelian groups. Finally, we connect the group-theoretic skeleton to what comes next. That next step is representing each operation as a matrix. Those matrices are then organized into the compact numerical fingerprints called characters.

Key takeaways
  • A point group's symmetry operations form a mathematical group: closed, with identity EE, inverses, and associative composition.
  • Composition of two symmetry operations (do BB then AA, written ABAB) is itself always a symmetry operation of the same molecule.
  • The multiplication table records every pairwise product ABAB and is built by tracking where each operation sends a labeled reference point.
  • Groups where all operations commute (AB=BAAB = BA) are abelian (C2vC_{2v}); groups with non-commuting operations are non-abelian (C3vC_{3v}).
  • Elements that are conjugate to each other (X=RAR−1X = R A R^{-1} for some RR in the group) form a class; classes are the rows of character tables.
  • Key idea: the closure of symmetry operations under composition is what allows every molecular property invariant under the symmetry to be organized by representation theory.

Where this lives today

Every modern computational chemistry package (Gaussian, ORCA, VASP, CASTEP) begins electronic-structure calculations by determining the molecular or crystal point/space group and exploiting its group structure to block-diagonalize the secular equations — this is a direct industrial-scale descendant of the multiplication-table bookkeeping developed here, since a Hamiltonian matrix that commutes with every symmetry operation can be simplified enormously once the group's classes and irreducible representations are known. Vibrational spectroscopists use the group's multiplication table implicitly every time they apply the reduction formula to decide which normal modes are IR- or Raman-active in a newly synthesized coordination complex or metal-organic framework, a routine step in characterizing new catalysts and materials. In solid-state chemistry and crystallography, space groups (which include translations as well as point operations) are literally infinite groups built by the same closure/identity/inverse/associativity logic, just extended to include lattice translations — the classification of the 230 three-dimensional space groups used in every crystal structure solution (X-ray diffraction refinement software, protein crystallography, battery-material structure prediction) rests on exactly the group-theoretic skeleton developed here. In magnetic resonance and photophysics, selection rules for allowed electronic and vibrational transitions in transition-metal complexes (why some dd–dd transitions are Laporte-forbidden, why certain IR bands vanish in highly symmetric metal carbonyls like Cr(CO)6Cr(CO)_6) are direct consequences of the class structure and orthogonality relations that only exist because the symmetry operations form a bona fide group. Even quantum computing error-correction codes borrow group-theoretic language (stabilizer groups) structurally identical to the molecular symmetry groups treated here.

Ask the tutor: How do you turn each symmetry operation into an explicit matrix once you know the multiplication table, and use those matrices to build a reducible representation for a real basis set (e.g., the three H 1s orbitals in NH₃)?

The physical picture

Picture a water molecule sitting in the yzyz-plane, oxygen at the origin, the two O–H bonds splayed symmetrically about the zz-axis (the C2C_2 axis). Four rigid motions leave this geometric arrangement indistinguishable from where it started: doing nothing at all (EE), rotating by 180° about the zz-axis (C2C_2), reflecting through the molecular plane itself, σv(xz)\sigma_v(xz)... wait — convention matters here, so fix it precisely: let σv(xz)\sigma_v(xz) be the plane containing the C2C_2 axis and perpendicular to the molecular plane, and σv′(yz)\sigma_v'(yz) be the actual molecular plane. Each of these four operations, applied to the three atoms, produces an arrangement of nuclei that exactly overlaps the original, atom for atom (accounting for the two equivalent hydrogens swapping). The crucial move is to stop thinking of these as four isolated instructions and start asking what happens when you do them one after another. If you rotate by C2C_2 and then reflect through σv(xz)\sigma_v(xz), is the net effect the same as some single operation already in your list of four? For water, the answer is yes — always — and this is not a coincidence; it is forced by the fact that both C2C_2 and σv\sigma_v are symmetries of the same rigid geometric object, so any sequence of them must also map the object onto itself, and there are only finitely many ways to do that (four, in this case). Working out which single operation results from a given sequence is exactly the content of a multiplication table. For ammonia, NH3NH_3, belonging to point group C3vC_{3v}, the operations are EE, two rotations C3C_3 and C32C_3^2 (120° and 240° about the threefold axis), and three vertical mirror planes σv\sigma_v, σv′\sigma_v', σv′′\sigma_v'', each containing the C3C_3 axis and one N–H bond. Here the composition rule becomes genuinely interesting: rotating then reflecting is not the same as reflecting then rotating. This non-commutativity is not a defect — it is the signature of a "non-abelian" group, and it is precisely the feature responsible for ammonia having a doubly degenerate irreducible representation (EE symmetry, in the character-table sense foreshadowed at the end of this article), a phenomenon that never happens in the strictly abelian C2vC_{2v}.

Figure
Composition of operations in C₂ᵥ: labeled hydrogens track where each operation sends them
C₂ᵥ (H₂O): tracking H₁, H₂ under each operation E (identity) H₁ H₂ O at (120,150) C₂ (180° about z) H₂→H₁ slot H₁→H₂ slot H₁,H₂ swap positions σᵥ(xz) ⊥ molecular plane H₂→H₁ slot H₁→H₂ slot also swaps H₁,H₂ σᵥ'(yz) = molecular plane H₁ fixed H₂ fixed every atom fixed
Figure
Non-commuting operations in C₃ᵥ: C₃ then σᵥ versus σᵥ then C₃ give different results
C₃ᵥ (NH₃): order of operations matters Start: H₁ top, H₂ lower-right, H₃ lower-left H₁ H₂ H₃ Path A: apply C₃ first, then σᵥ (through H₁) C₃: H₁→H₃ slot, H₂→H₁ slot, H₃→H₂ slot H₂ H₃ H₁ then σᵥ(through top vertex): swaps the two base atoms H₂ H₁ H₃

The core ideas

The four group axioms, stated for a set G={E,A,B,C,… }G = \{E, A, B, C, \dots\} of symmetry operations of a fixed molecular geometry, with composition "∘\circ" meaning "apply the right-hand operation first, then the left-hand one":

Closure:A,B∈G  ⟹  AB∈G\textbf{Closure:}\qquad A, B \in G \implies AB \in G

where: AA, BB are any two symmetry operations of the point group, and ABAB denotes their composition (first BB, then AA); the statement says the result is also a symmetry operation already in the set — no new operations are ever generated.

Identity:∃ E∈G such that EA=AE=A  ∀A∈G\textbf{Identity:}\qquad \exists\, E \in G \text{ such that } EA = AE = A \ \ \forall A \in G

where: EE is the "do nothing" operation; every point group contains it, and it commutes with everything by definition.

Inverse:∀A∈G, ∃ A−1∈G such that AA−1=A−1A=E\textbf{Inverse:}\qquad \forall A \in G,\ \exists\, A^{-1} \in G \text{ such that } AA^{-1} = A^{-1}A = E

where: A−1A^{-1} is the operation that exactly undoes AA; for a rotation CnkC_n^k the inverse is Cnn−kC_n^{n-k}, and every reflection and every C2C_2 is its own inverse.

Associativity:(AB)C=A(BC)∀A,B,C∈G\textbf{Associativity:}\qquad (AB)C = A(BC)\quad \forall A,B,C \in G

where: grouping of a triple composition does not matter — this holds automatically because symmetry operations are functions (rigid motions) and function composition is always associative. Reading these together: a point group is completely specified once you list its elements and its multiplication table, because the table alone must satisfy closure, contain an identity row/column that reproduces the top row and left column, contain exactly one EE in every row and every column (a consequence of unique inverses), and be built from a composition rule that is automatically associative. This is why chemists can write down a C3vC_{3v} character table without re-deriving quantum mechanics every time: the table's internal arithmetic is guaranteed by the group axioms, and everything downstream (orthogonality of characters, reducibility formulas) inherits that guarantee. A second organizing relationship governs how operations sort into classes:

X∼A  ⟺  ∃ R∈G such that X=RAR−1X \sim A \iff \exists\, R \in G \text{ such that } X = R A R^{-1}

where: X∼AX \sim A means XX is conjugate to AA; RR ranges over every element of the group; a class is the set of all operations conjugate to a given one. Reading: two operations belong to the same class if some symmetry operation of the molecule can be used to relabel one into the other — geometrically, this means they are "the same kind of operation" viewed from equivalent directions (e.g., the two rotations C3C_3 and C32C_3^2 in C3vC_{3v} are conjugate to each other, and all three vertical mirrors are mutually conjugate). Classes, not individual operations, are what index the columns of a character table — this is the direct bridge to Character Tables Anatomy.

Derivation ABuilding the C₂ᵥ multiplication table by explicit composition

Goal. Construct the full 4×44\times4 multiplication table for C2v={E,C2,σv(xz),σv′(yz)}C_{2v} = \{E, C_2, \sigma_v(xz), \sigma_v'(yz)\} by tracking coordinates, and confirm all four group axioms hold.

Step 1 — set up coordinates and define each operation as a map. Place the C2C_2 axis along zz, with σv(xz)\sigma_v(xz) the plane perpendicular to the molecular plane and σv′(yz)\sigma_v'(yz) the molecular plane itself (containing both H atoms and O). As linear maps on a general point (x,y,z)(x,y,z):

E:(x,y,z)→(x,y,z)E:(x,y,z)\to(x,y,z)
C2:(x,y,z)→(−x,−y,z)C_2:(x,y,z)\to(-x,-y,z)
σv(xz):(x,y,z)→(x,−y,z)\sigma_v(xz):(x,y,z)\to(x,-y,z)
σv′(yz):(x,y,z)→(−x,y,z)\sigma_v'(yz):(x,y,z)\to(-x,y,z)

Each is a 3×33\times3 diagonal matrix with entries ±1\pm1; this diagonal, "each coordinate flips independently" structure is special to C2vC_{2v} and is exactly why the group will turn out abelian.

Step 2 — compute one representative product, C2×σv(xz)C_2 \times \sigma_v(xz). "C2×σv(xz)C_2 \times \sigma_v(xz)" means: apply σv(xz)\sigma_v(xz) first, then C2C_2. Track a general point:

(x,y,z)→ σv(xz) (x,−y,z)→ C2 (−x,y,z)(x,y,z) \xrightarrow{\ \sigma_v(xz)\ } (x,-y,z) \xrightarrow{\ C_2\ } (-x,y,z)

Compare this final map, (x,y,z)→(−x,y,z)(x,y,z)\to(-x,y,z), to the four definitions in Step 1: it is exactly σv′(yz)\sigma_v'(yz). Hence

C2 σv(xz)=σv′(yz)C_2\,\sigma_v(xz) = \sigma_v'(yz)

Step 3 — compute the product in the opposite order, σv(xz)×C2\sigma_v(xz)\times C_2, to test commutativity.

(x,y,z)→ C2 (−x,−y,z)→ σv(xz) (−x,y,z)(x,y,z) \xrightarrow{\ C_2\ } (-x,-y,z) \xrightarrow{\ \sigma_v(xz)\ } (-x,y,z)

This is also (x,y,z)→(−x,y,z)=σv′(yz)(x,y,z)\to(-x,y,z) = \sigma_v'(yz). So

σv(xz) C2=σv′(yz)=C2 σv(xz)\sigma_v(xz)\,C_2 = \sigma_v'(yz) = C_2\,\sigma_v(xz)

The two orders agree — this particular pair commutes. Repeating Step 2–3 for every pair (six pairs total, since there are 4 elements and EE trivially commutes with all) shows every product is order-independent, because each operation is a diagonal ±1\pm1 matrix and diagonal matrices always commute with each other. This proves C2vC_{2v} is abelian.

Step 4 — assemble the full table and verify closure, identity, inverses.

×\timesEEC2C_2σv(xz)\sigma_v(xz)σv′(yz)\sigma_v'(yz)
EEEEC2C_2σv(xz)\sigma_v(xz)σv′(yz)\sigma_v'(yz)
C2C_2C2C_2EEσv′(yz)\sigma_v'(yz)σv(xz)\sigma_v(xz)
σv(xz)\sigma_v(xz)σv(xz)\sigma_v(xz)σv′(yz)\sigma_v'(yz)EEC2C_2
σv′(yz)\sigma_v'(yz)σv′(yz)\sigma_v'(yz)σv(xz)\sigma_v(xz)C2C_2EE

Every entry in this table is one of the original four operations — closure holds. The EE row and column exactly reproduce the labels across the top and down the side — identity confirmed. Every row and column contains EE exactly once, and in each case an element multiplied by itself gives EE (the table's diagonal is all EE) — every element is its own inverse, so inverses exist trivially. Associativity is inherited automatically because every operation is represented faithfully by matrix multiplication, which is associative by the properties of linear algebra. All four axioms hold; C2vC_{2v} is a genuine mathematical group of order 4 (in fact isomorphic to the Klein four-group).

Limiting-case check. If you set σv′(yz)→C2 σv(xz)\sigma_v'(yz) \to C_2\,\sigma_v(xz) from the start (as derived in Step 2) and then ask what σv′(yz)×σv′(yz)\sigma_v'(yz)\times \sigma_v'(yz) must equal, consistency requires (C2σv(xz))(C2σv(xz))=E(C_2 \sigma_v(xz))(C_2\sigma_v(xz)) = E; expanding using commutativity, C22 σv(xz)2=E⋅E=EC_2^2\,\sigma_v(xz)^2 = E \cdot E = E, which matches the table. The self-consistency of the derived table under this independent recombination is itself a check that no arithmetic error crept in.

Go deeper · Derivation B · 2 minNon-abelian structure of C₃ᵥ: showing C₃σᵥ ≠ σᵥC₃
Derivation BNon-abelian structure of C₃ᵥ: showing C₃σᵥ ≠ σᵥC₃

Goal. Demonstrate explicitly, with matrices, that C3vC_{3v} is non-abelian, and use this to identify its classes.

Step 1 — write C3C_3 as a rotation matrix and σv\sigma_v as a reflection matrix. Take the threefold axis along zz. A rotation by +120°+120° about zz acting on (x,y)(x,y) (the zz-coordinate is untouched and dropped from here on) is

C3=(cos⁡120∘−sin⁡120∘sin⁡120∘cos⁡120∘)=(−12−3232−12)C_3 = \begin{pmatrix} \cos120^\circ & -\sin120^\circ \\ \sin120^\circ & \cos120^\circ \end{pmatrix} = \begin{pmatrix} -\tfrac12 & -\tfrac{\sqrt3}{2} \\ \tfrac{\sqrt3}{2} & -\tfrac12 \end{pmatrix}

Let σv\sigma_v be the mirror plane containing the xx-axis (and the zz-axis), so it flips the sign of yy only:

σv=(100−1)\sigma_v = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}

Step 2 — compute C3σvC_3\sigma_v (apply σv\sigma_v first, then C3C_3).

C3σv=(−12−3232−12)(100−1)=(−12323212)C_3\sigma_v = \begin{pmatrix} -\tfrac12 & -\tfrac{\sqrt3}{2} \\ \tfrac{\sqrt3}{2} & -\tfrac12 \end{pmatrix} \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} = \begin{pmatrix} -\tfrac12 & \tfrac{\sqrt3}{2} \\ \tfrac{\sqrt3}{2} & \tfrac12 \end{pmatrix}

This resulting matrix has determinant −1-1 (a reflection, not a rotation — as required, since composing a rotation with a reflection gives a reflection) and represents reflection through a line at 60°60° from the xx-axis; call this plane σv′′\sigma_v''.

Step 3 — compute σvC3\sigma_v C_3 (apply C3C_3 first, then σv\sigma_v), the opposite order.

σvC3=(100−1)(−12−3232−12)=(−12−32−3212)\sigma_v C_3 = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} \begin{pmatrix} -\tfrac12 & -\tfrac{\sqrt3}{2} \\ \tfrac{\sqrt3}{2} & -\tfrac12 \end{pmatrix} = \begin{pmatrix} -\tfrac12 & -\tfrac{\sqrt3}{2} \\ -\tfrac{\sqrt3}{2} & \tfrac12 \end{pmatrix}

This is reflection through a line at −60°-60° (equivalently 120°120°) from the xx-axis; call it σv′\sigma_v'. Since σv′′≠σv′\sigma_v'' \neq \sigma_v' as matrices (compare entries directly: the off-diagonal signs differ), we have

C3σv≠σvC3C_3\sigma_v \neq \sigma_v C_3

confirming C3vC_{3v} is non-abelian — order of application changes the outcome.

Step 4 — use this to build classes. Because C3σv=σv′′C_3\sigma_v = \sigma_v'' and σvC3=σv′\sigma_v C_3 = \sigma_v', and because σv′′=C3σvC3−1⋅C3⋯\sigma_v'' = C_3 \sigma_v C_3^{-1}\cdot C_3\cdots — more directly, compute the conjugate C3 σv C3−1C_3\,\sigma_v\,C_3^{-1}:

C3 σv C3−1=(C3σv) C3−1=σv′′ C3−1C_3\,\sigma_v\,C_3^{-1} = (C_3\sigma_v)\,C_3^{-1} = \sigma_v''\,C_3^{-1}

Carrying out this matrix product (using C3−1=C32C_3^{-1}=C_3^2, the 240°240° rotation) yields σv′\sigma_v', showing σv\sigma_v and σv′\sigma_v' are conjugate via R=C3R = C_3. Repeating with R=C32R=C_3^2 connects σv\sigma_v to σv′′\sigma_v''. Hence

{σv, σv′, σv′′} form a single class\{\sigma_v,\ \sigma_v',\ \sigma_v''\}\ \text{form a single class}

By an entirely parallel computation, conjugating C3C_3 by any σv\sigma_v gives C32C_3^2 (since reflections reverse the sense of rotation), so

{C3, C32} form a single class\{C_3,\ C_3^2\}\ \text{form a single class}

and EE is always alone in its own class. The six elements of C3vC_{3v} therefore fall into three classes: {E}\{E\}, {C3,C32}\{C_3,C_3^2\}, {σv,σv′,σv′′}\{\sigma_v,\sigma_v',\sigma_v''\} — exactly the three columns you find heading the C3vC_{3v} character table.

Limiting-case check. If the reflection planes were somehow independent (not related by the C3C_3 rotation), C3vC_{3v} would have to be treated as having three separate one-element mirror classes, contradicting the known order-6 group having only 3 classes total (since the number of classes must equal the number of irreducible representations, and C3vC_{3v} is known independently, from its character table, to have three irreps: A1,A2,EA_1, A_2, E). The class-counting here is consistent with that external fact, which is a strong check on Step 4.

Worked examples

Example 1 (foundational) — verify closure by hand for a specific C2vC_{2v} triple product. Take BeCl2BeCl_2 (linear, but treat its bent-molecule analogue SO2SO_2, point group C2vC_{2v}, for a genuine three-atom case). Using the matrices from the first derivation, compute σv(xz)⋅(C2⋅σv′(yz))\sigma_v(xz)\cdot\big(C_2\cdot\sigma_v'(yz)\big) and check it matches a table entry. First, the inner product: C2⋅σv′(yz)C_2\cdot\sigma_v'(yz) means apply σv′(yz)\sigma_v'(yz) first: (x,y,z)→(−x,y,z)(x,y,z)\to(-x,y,z), then C2C_2: (−x,y,z)→(x,−y,z)(-x,y,z)\to(x,-y,z). Net map: (x,y,z)→(x,−y,z)(x,y,z)\to(x,-y,z), which is σv(xz)\sigma_v(xz). So C2 σv′(yz)=σv(xz)C_2\,\sigma_v'(yz) = \sigma_v(xz). Now the outer product: σv(xz)⋅σv(xz)\sigma_v(xz)\cdot \sigma_v(xz). Applying σv(xz)\sigma_v(xz) twice: (x,y,z)→(x,−y,z)→(x,y,z)(x,y,z)\to(x,-y,z)\to(x,y,z). This returns the identity:

σv(xz)⋅σv(xz)=E\sigma_v(xz)\cdot\sigma_v(xz) = E

This matches the table (every C2vC_{2v} operation is self-inverse) and confirms closure end-to-end for this specific triple: the full expression σv(xz)(C2σv′(yz))=σv(xz)σv(xz)=E\sigma_v(xz)\big(C_2\sigma_v'(yz)\big) = \sigma_v(xz)\sigma_v(xz) = E, and EE is indeed one of the four allowed elements.

Example 2 (applied) — using non-commutativity to predict orbital degeneracy in NH3NH_3. In C3vC_{3v} ammonia, the nitrogen 2px2p_x and 2py2p_y orbitals do not individually transform as one-dimensional representations, because C3C_3 mixes them into each other:

C3:(pxpy)→(−12−3232−12)(pxpy)C_3: \begin{pmatrix} p_x \\ p_y \end{pmatrix} \to \begin{pmatrix} -\tfrac12 & -\tfrac{\sqrt3}{2} \\ \tfrac{\sqrt3}{2} & -\tfrac12 \end{pmatrix} \begin{pmatrix} p_x \\ p_y \end{pmatrix}

This is the same rotation matrix used in Derivation 2 — showing pxp_x and pyp_y mix under C3C_3, they cannot be assigned separately to one-dimensional irreducible representations; they must travel together as a 2-dimensional representation labeled EE (unrelated to the identity operation EE; unfortunate but standard notation, always distinguished by context — italic EE for the operation, roman EE for the representation label). This is a direct, non-numerical consequence of the non-commuting structure derived above: an abelian group (like C2vC_{2v}) can only have one-dimensional irreducible representations, because commuting operators can always be simultaneously diagonalized, while a non-abelian group is compelled to contain at least one representation of dimension ≥2\geq 2. Trace through the logic: the order of C3vC_{3v} is h=6h=6; the sum of squares of the dimensions of irreps must equal hh (a fact proved via the group axioms in the theory of representations); with three classes there must be three irreps, and 12+12+22=1+1+4=61^2+1^2+2^2 = 1+1+4=6 is the only combination that works, forcing exactly one doubly-degenerate irrep. Ammonia's degenerate N–H stretching and bending vibrations, and the double degeneracy of the relevant frontier orbitals, trace directly back to this group-theoretic necessity — not to any numerical coincidence in the Hamiltonian.

Example 3 (exam/competition level) — construct the multiplication table for C3vC_{3v} completely and locate a subgroup. List the six elements {E,C3,C32,σv,σv′,σv′′}\{E, C_3, C_3^2, \sigma_v, \sigma_v', \sigma_v''\} with C3C_3 a 120°120° rotation, C32C_3^2 a 240°240° rotation, and the three mirrors as in Derivation 2 (σv\sigma_v through the xx-axis, σv′\sigma_v' at −60°-60°, i.e. 120°120°, from xx, and σv′′\sigma_v'' at +60°+60° from xx). Using the matrix method of Derivation 2 systematically (multiply every pair of the six 2×22\times2 matrices):

×\timesEEC3C_3C32C_3^2σv\sigma_vσv′\sigma_v'σv′′\sigma_v''
EEEEC3C_3C32C_3^2σv\sigma_vσv′\sigma_v'σv′′\sigma_v''
C3C_3C3C_3C32C_3^2EEσv′′\sigma_v''σv\sigma_vσv′\sigma_v'
C32C_3^2C32C_3^2EEC3C_3σv′\sigma_v'σv′′\sigma_v''σv\sigma_v
σv\sigma_vσv\sigma_vσv′\sigma_v'σv′′\sigma_v''EEC3C_3C32C_3^2
σv′\sigma_v'σv′\sigma_v'σv′′\sigma_v''σv\sigma_vC32C_3^2EEC3C_3
σv′′\sigma_v''σv′′\sigma_v''σv\sigma_vσv′\sigma_v'C3C_3C32C_3^2EE

Read off the row for σv\sigma_v: σv⋅C3=σv′\sigma_v \cdot C_3 = \sigma_v', matching Step 3 of Derivation 2 exactly (recall σvC3=σv′\sigma_v C_3 = \sigma_v' was computed there). Read off the row for C3C_3, column σv\sigma_v: C3⋅σv=σv′′C_3\cdot\sigma_v = \sigma_v'', matching Step 2 of Derivation 2 (C3σv=σv′′C_3\sigma_v = \sigma_v''). The table is internally consistent with the explicit matrix computations. Now find a subgroup: the top-left 3×33\times3 block, {E,C3,C32}\{E, C_3, C_3^2\}, is closed under itself (every product of two rotations is a rotation, as seen directly in row/column intersections restricted to those three labels) — it is a subgroup of order 3, isomorphic to the cyclic group C3C_3. Lagrange's theorem (a consequence of the group axioms, not proven here but consistent with them) requires subgroup order to divide group order: 3∣63 \mid 6 ✓, and no subgroup of order 4 or 5 can exist since neither divides 6 — a fact the explicit table can be scanned to confirm has no such closed sub-block.

Limiting cases, scope & common traps

SituationWhat happensWhy
Only EE present (C1C_1 point group)Trivial group of order 1Molecule has no symmetry beyond itself; axioms hold vacuously
All operations commuteGroup is abelian; only 1-D irrepsTrue for CnC_n, CnvC_{nv} with n≤2n\le2, CsC_s, CiC_i, D2D_2, etc.
Some operations don't commuteGroup is non-abelian; ≥1 irrep of dimension ≥2True whenever a CnC_n with n≥3n\ge3 coexists with σv\sigma_v or C2′C_2' axes, e.g. C3v,D3h,TdC_{3v}, D_{3h}, T_d
Infinite-order axis (C∞v,D∞hC_{\infty v}, D_{\infty h})Group has infinitely many elements (continuous rotation)Still satisfies all four axioms; just not a finite group, so class/character bookkeeping needs continuous-group (Lie group) treatment
Improper axis SnS_n presentStill one group; SnS_n operations included in the same closed setClosure requires composing rotations with reflections whenever needed — Sn=σhCnS_n = \sigma_h C_n by definition

The chemist behind it

The systematic use of group theory in chemistry is usually credited less to a single "discoverer" and more to a convergence: crystallographers and mathematicians developed point-group and space-group classification in the 19th century for crystal morphology, while the application to molecular spectroscopy and bonding was driven in the 20th century largely by Hans Bethe (crystal-field splitting via group theory, 1929) and later systematized for chemists by F. Albert Cotton, whose textbook Chemical Applications of Group Theory (1963) became the standard route by which generations of chemists learned to build multiplication tables and character tables as working tools rather than abstract mathematics.

Origins · 1 minHans Albrecht Bethe and how this was discovered
HA
Hans Albrecht Bethe
1906–2005 · Theoretical physics and quantum chemistry, Germany/USA

Bethe's 1929 paper on crystal-field splitting used the representation theory of point groups to predict how a free ion's degenerate dd-orbitals split in a crystalline (ligand) environment of given symmetry — the direct ancestor of modern ligand-field theory used throughout inorganic and coordination chemistry. He later became a central figure in nuclear astrophysics (stellar nucleosynthesis, Nobel Prize 1967) and in the Manhattan Project, but his early group-theoretic treatment of symmetry-lowering in crystal fields remains foundational to how chemists reason about dd-orbital splitting diagrams today.

History
- 1830s–1890s: crystallographers (Hessel, Bravais, Fedorov, Schoenflies) classify the 32 crystallographic point groups and 230 space groups.
- 1929: Hans Bethe applies group representation theory to crystal-field splitting of atomic orbitals.
- 1930s: Eugene Wigner and others formalize the representation theory used throughout quantum mechanics and spectroscopy.
- 1950s–1960s: systematic use of character tables becomes standard in molecular orbital theory and vibrational spectroscopy (Mulliken symbols standardized).
- 1963: F. Albert Cotton's textbook makes multiplication tables, reducible representations, and projection operators standard tools in mainstream inorganic chemistry teaching.
Why do symmetry operations always form a group, rather than just a list?

Because each operation is a rigid motion (rotation, reflection, inversion, or improper rotation) that maps the molecule's nuclear framework exactly onto itself. Composing two such motions produces another rigid motion that also maps the framework onto itself, so the result must be one of the finitely many symmetry operations already present — this is closure. Every rigid motion is invertible (you can always undo a rotation or reflection), and "do nothing" is trivially a symmetry operation, giving the identity. Associativity comes for free because these operations are functions, and function composition is always associative. So the group structure is not assumed; it is a forced consequence of the operations being rigid symmetries of one fixed geometric object.

What's the difference between an abelian and non-abelian point group, and how can I tell quickly which one I have?

A group is abelian if every pair of operations commutes (AB=BAAB=BA for all A,BA,B); otherwise it's non-abelian. A fast diagnostic: groups with only a C2C_2 (or lower) principal axis, or only reflections and inversion, tend to be abelian (C1,Cs,Ci,C2,C2v,C2h,D2,D2hC_1, C_s, C_i, C_2, C_{2v}, C_{2h}, D_2, D_{2h}). As soon as you have a rotation axis of order 3 or higher combined with additional symmetry elements not lying along that same axis (perpendicular C2C_2 axes, or σv\sigma_v planes), the group becomes non-abelian, because rotating "mixes" directions that a lower-order operation would keep separate.

Does the multiplication table depend on which specific molecule I use, or only on the point group?

Only on the point group. The multiplication table is a property of the abstract group structure — any molecule belonging to C3vC_{3v} (ammonia, CHCl₃, POCl₃) has the exact same multiplication table, even though the physical operations act on different atoms. This is why character tables are tabulated once per point group in reference books and reused for every molecule that happens to belong to that group, rather than being rederived per molecule.

How does the multiplication table connect to the character table I'll use for vibrational analysis?

The multiplication table tells you which operations are conjugate to each other, and conjugate operations are grouped into classes — these classes become the columns of the character table. The number of distinct classes also equals the number of irreducible representations (rows), a theorem that follows from the group's algebraic structure. So before you can correctly read off characters for reducible representations and reduce them into irreducible components (the standard procedure for predicting IR/Raman-active vibrations), you implicitly rely on the class structure that the multiplication table reveals.

Can a symmetry "operation" exist that is not accompanied by its inverse in the point group?

No — this would violate the group axioms and cannot occur for a genuine symmetry element of a rigid molecule. If a rotation CnkC_n^k maps the molecule onto itself, then applying the reverse rotation Cnn−kC_n^{n-k} must also map it onto itself (just run the motion backward), so the inverse is automatically present. This is one reason point-group assignment errors sometimes surface: if a proposed "symmetry operation" seems to lack a natural inverse among the assumed elements, it usually signals a misidentified axis or plane, not an exception to the axioms.

Is EE always its own class, and why does that matter?

Yes: for any RR in the group, RER−1=RR−1=ER E R^{-1} = R R^{-1} = E, so nothing is ever conjugate to EE except EE itself — it always forms a singleton class. This matters because it guarantees every character table has a column headed simply "EE" with entries equal to the dimension of each irreducible representation (since the character of the identity operation in any representation is just its dimension, the trace of an identity matrix). It's a fixed anchor point you can always check first when reading or constructing a character table.

Why does C3vC_{3v} have exactly one two-dimensional irrep and not, say, two of them or a three-dimensional one?

The dimension theorem states ∑iℓi2=h\sum_i \ell_i^2 = h, where hh is the group order and ℓi\ell_i are irrep dimensions, and separately, the number of irreps must equal the number of classes. For C3vC_{3v}, h=6h=6 and there are 3 classes, so you need three positive integers ℓ1,ℓ2,ℓ3\ell_1,\ell_2,\ell_3 with ℓ12+ℓ22+ℓ32=6\ell_1^2+\ell_2^2+\ell_3^2=6 — the only integer solution (with ℓ1=1\ell_1=1 required, since the trivial totally symmetric representation always exists) is 1,1,21,1,2. No other combination of three positive integers satisfies the equation, so the two-dimensional irrep is forced uniquely.

Before this