Point Groups as Mathematical Groups

Take a water molecule. List every symmetry operation that leaves it looking unchanged. Multiply them together in pairs. You will find something remarkable. The result of any such multiplication is always another operation already on your list. Nothing escapes. This closure is not a coincidence. It is the signature of a mathematical group. It is the reason chemists can borrow two centuries of abstract algebra. That inheritance lets them predict which vibrations absorb infrared light. It also predicts which orbitals can mix, and which electronic transitions are allowed. This matters because symmetry arguments let you answer physical questions. You can do this without solving the Schrödinger equation. Once you know a molecule's symmetry operations form a group, you can invoke representation theory. You can also use character tables and selection rules. This machinery converts hard integrals into bookkeeping. But that machinery is only trustworthy under one condition. The underlying operation set must genuinely satisfy the four group axioms: closure, associativity, an identity, and inverses. Skip this verification and you risk a problem. You might apply character-table technology to a set of operations. That set may never have been a group to begin with. The big picture is this: a molecule's point group is an abstract algebraic object. It wears a geometric costume. The "elements" are symmetry operations — rotations, reflections, inversions, and improper rotations. These are built on the Improper Rotations and Sn Axes you already have in hand. The "multiplication" is simply "do one operation, then do another." These operations are rigid-body motions. They map the molecule onto an indistinguishable copy of itself. So composing two of them must produce a third such motion. That is closure. It is the seed from which the entire group-theoretic treatment of molecular symmetry grows. This article builds the multiplication table of a real point group from scratch. It proves the four axioms hold for a molecular operation set. It also shows exactly where the reasoning would break. This could happen if you used a careless or incomplete list of operations. It ends by pointing toward Classifying the Point Groups and Matrix Representations of Symmetry Operations. There, this same closure property becomes the engine of character tables and selection rules.

Key takeaways
  • A point group is the complete set of symmetry operations of a molecule that leave at least one point fixed, together with sequential composition as the group "multiplication."
  • Four axioms must hold: closure, associativity, existence of an identity (EE), and existence of an inverse for every operation.
  • Composition of operations is generally non-commutative — order matters, so C^2σ^v≠σ^vC^2\hat{C}_2 \hat{\sigma}_v \neq \hat{\sigma}_v \hat{C}_2 in general (though it does for C2vC_{2v}).
  • A multiplication table (Cayley table) records every pairwise product and is the fingerprint of the group's structure.
  • Point groups are always finite (except for linear molecules with C∞vC_{\infty v} or D∞hD_{\infty h}) because a molecule has finitely many equivalent nuclear positions.
  • Key idea: the symmetry operations of a molecule close under composition because each operation is a distance-preserving map of the molecule onto itself, so any sequence of them is still such a map — and that single geometric fact is what licenses every downstream use of group theory in chemistry.

Where this lives today

Modern vibrational spectroscopy — infrared and Raman analysis used routinely in pharmaceutical quality control, polymer characterization, and mineralogy — depends on the fact that a molecule's normal modes transform as irreducible representations of its point group, a classification that only makes sense because the operation set is a genuine group. Catalysis researchers designing chiral ligands for asymmetric hydrogenation (industrially important for synthesizing single-enantiomer pharmaceuticals) use point-group arguments to predict which ligand symmetries (C2C_2, C1C_1, or higher) are compatible with enantioselective binding pockets. Crystallographers solving structures by X-ray diffraction assign space groups built from the same 32 crystallographic point groups first tabulated by Schoenflies and Fedorov, and every space-group table used by modern crystallographic software silently relies on the closure and inverse axioms holding for the constituent operations. In computational chemistry, quantum chemistry packages (Gaussian, ORCA, Q-Chem) automatically detect a molecule's point group at the start of a calculation and use its multiplication table to block-diagonalize the Hamiltonian and Fock matrices by symmetry, dramatically speeding up electronic structure calculations on symmetric molecules like buckminsterfullerene (IhI_h, order 120) or benzene (D6hD_{6h}, order 24) — savings that scale directly with how large and non-abelian the point group is. Materials scientists studying phonon modes and photonic band structure in symmetric nanostructures, and NMR spectroscopists predicting equivalent nuclei via symmetry-related permutations, all lean on the same closure-associativity-identity-inverse skeleton established here.

Ask the tutor: Can you walk me through why C3σv≠σvC3C_3\sigma_v \ne \sigma_v C_3 in C3vC_{3v} using the actual hydrogen-label permutations?

The physical picture — why symmetry operations form a group

Every symmetry operation of a molecule is a rigid transformation of three-dimensional space — a rotation, reflection, inversion, or improper rotation — chosen so that after applying it, every atom lands on a position previously occupied by an atom of the same kind. The nuclear framework looks unchanged, even though individual atoms may have permuted among equivalent sites. Because these operations are built from rotations and reflections, they preserve all interatomic distances and angles. This is the crucial geometric fact underlying everything else: a rigid motion of a rigid motion is still a rigid motion. Consider ammonia, NH₃, a trigonal pyramid with C3vC_{3v} symmetry. Its operations are EE (do nothing), C3C_3 and C32C_3^2 (rotations by 120° and 240° about the principal axis), and three vertical mirror planes σv\sigma_v, σv′\sigma_v', σv′′\sigma_v'', each containing the axis and one N–H bond. That is six operations total. Suppose you first reflect through σv\sigma_v and then rotate by C3C_3. Geometrically, "reflect then rotate" is some new rigid motion that fixes the central nitrogen and permutes the three hydrogens among themselves. Because the only rigid motions doing that (consistent with the pyramidal shape) are exactly the six operations listed above, the product C3σvC_3 \sigma_v must equal one of them. It cannot be some seventh, unlisted transformation, because there is no seventh symmetry operation left to be — the list of six is already the complete symmetry-preserving set for a triangular arrangement of three identical H atoms around the axis. This is closure in action, and you can watch it happen by literally rotating a paper model. Group theory adds one more layer of structure: it insists that composition be checked as a genuine algebraic operation, with associativity, an identity, and inverses, so that the set together with composition satisfies the same abstract axioms as, say, the integers under addition (only finite, and non-commutative in general). Once verified, an enormous machinery becomes available — the group's character table, irreducible representations, and reduction formulas — because these are theorems about any group satisfying the axioms, not special facts about NH₃.

Figure
Ammonia's six symmetry operations, viewed down the C₃ axis
N H₁ H₂ H₃ C₃ axis (out of page) σᵥ (through H₁) σᵥ′ σᵥ″ C₃ᵥ = {E, C₃, C₃², σᵥ, σᵥ′, σᵥ″} — order h = 6

The multiplication table below is built by physically performing each pair of operations in sequence and reading off which single operation reproduces the result. The convention, matching matrix multiplication, is that in the product A^B^\hat{A}\hat{B}, operation B^\hat{B} is performed first, then A^\hat{A}.

Figure
Cayley (multiplication) table for C₃ᵥ — row then column, B first then A
Entry = (row operation) applied first, then (column operation): ·B̂ B̂ → EC₃C₃² σᵥσᵥ′σᵥ″  ↓ E C₃ C₃² σᵥ σᵥ′ σᵥ″ EC₃C₃² σᵥσᵥ′σᵥ″ C₃C₃²E σᵥ″σᵥσᵥ′ C₃²EC₃ σᵥ′σᵥ″σᵥ σᵥσᵥ′σᵥ″ EC₃C₃² σᵥ′σᵥ″σᵥ C₃²EC₃ σᵥ″σᵥσᵥ′ C₃C₃²E

Notice the asymmetry across the diagonal: C3σv=σv′′C_3 \sigma_v = \sigma_v'' but σvC3=σv′\sigma_v C_3 = \sigma_v' (read the table with row-first, column-second convention above). This confirms C3vC_{3v} is non-abelian — order of operations matters, exactly as it must for a group describing rotations and reflections in three dimensions.

The core ideas — the four group axioms in molecular language

A set G={E^,A^,B^,C^,… }G = \{\hat{E}, \hat{A}, \hat{B}, \hat{C}, \dots\} of symmetry operations, together with the rule "perform one operation, then another," is a group if and only if four conditions hold.

Closure. For every pair of operations in the set, their product is also in the set:

A^,B^∈G  ⟹  A^B^∈G\hat{A}, \hat{B} \in G \implies \hat{A}\hat{B} \in G

where: A^B^\hat{A}\hat{B} means "apply B^\hat{B} first, then A^\hat{A}," and both operations, and their composite, are symmetry operations of the same molecule. Reading: no sequence of symmetry operations can ever produce a "new" transformation outside the original list — the set is self-contained under composition.

Associativity. For any three operations,

(A^B^)C^=A^(B^C^)(\hat{A}\hat{B})\hat{C} = \hat{A}(\hat{B}\hat{C})

where: grouping of three sequential operations does not affect the final result, only the order left-to-right matters. Reading: this holds automatically because all symmetry operations are represented by linear (matrix) transformations acting on coordinates, and matrix multiplication is associative — you never need to check this by hand for a molecule.

Identity. There exists an element E^∈G\hat{E} \in G such that

E^A^=A^E^=A^for every A^∈G\hat{E}\hat{A} = \hat{A}\hat{E} = \hat{A} \quad \text{for every } \hat{A} \in G

where: E^\hat{E} is the "do nothing" operation, always a symmetry operation of any molecule. Reading: every point group contains the identity; it is the operation that trivially leaves every atom exactly where it started.

Inverse. For every A^∈G\hat{A} \in G there exists A^−1∈G\hat{A}^{-1} \in G such that

A^A^−1=A^−1A^=E^\hat{A}\hat{A}^{-1} = \hat{A}^{-1}\hat{A} = \hat{E}

where: A^−1\hat{A}^{-1} is the operation that exactly undoes A^\hat{A}. Reading: rotations are undone by rotating the opposite way (Cn−1=Cnn−1C_n^{-1} = C_n^{n-1}), reflections and C2C_2 rotations and inversion are each their own inverse (σ2=E\sigma^2 = E, C22=EC_2^2=E, i2=Ei^2=E), and improper rotations SnS_n have inverses built from Snn−1S_n^{n-1} or Sn2n−1S_n^{2n-1} depending on parity.

Order of the group. The number of elements in GG is called the order, denoted hh. For C3vC_{3v}, h=6h = 6; for C2vC_{2v}, h=4h=4; for D6hD_{6h} (benzene), h=24h = 24. A further structural fact, essential for later work with character tables, is that operations split into classes: elements B^\hat{B} and B^′\hat{B}' are conjugate (in the same class) if there exists some A^\hat{A} in the group with

B^′=A^B^A^−1\hat{B}' = \hat{A}\hat{B}\hat{A}^{-1}

where: conjugation by A^\hat{A} represents "the same kind of operation viewed from a rotated/reflected perspective." In C3vC_{3v}, the two mirror-related rotations C3C_3 and C32C_3^2 form one class, and the three vertical mirrors σv,σv′,σv′′\sigma_v,\sigma_v',\sigma_v'' form another, because each type of operation can be transformed into another member of its own class by conjugation with a group element. This is why C3vC_{3v}'s character table has only 3 classes (EE, 2C32C_3, 3σv3\sigma_v) rather than 6 separate columns.

Derivation AProving closure directly from geometry, not by table-lookup

Goal. Show that for any molecule, the composition of two symmetry operations must again be a symmetry operation of that molecule — so closure is not an empirical accident of C3vC_{3v} but a theorem.

Step 1 — Define a symmetry operation precisely. A symmetry operation R^\hat{R} of a molecule is a rigid transformation of R3\mathbb{R}^3 (rotation, reflection, inversion, or improper rotation, always representable as an orthogonal 3×33\times 3 matrix) such that applying R^\hat{R} to the nuclear positions produces a configuration indistinguishable from the original: every nucleus of a given element ends up at a position that either it, or an identical nucleus, previously occupied, and all bond lengths/angles are preserved (orthogonal matrices preserve dot products, hence lengths and angles).

Step 2 — Compose two such operations. Let A^\hat{A} and B^\hat{B} each satisfy Step 1's condition for the molecule. Define C^≡A^B^\hat{C} \equiv \hat{A}\hat{B}, meaning: first apply B^\hat{B} to every nuclear position, then apply A^\hat{A} to the result. Since B^\hat{B} maps the nuclear configuration onto an indistinguishable copy of itself (a relabeling of identical nuclei, geometrically unchanged), applying A^\hat{A} next takes that already indistinguishable configuration and maps it, by the same reasoning, onto another indistinguishable copy. Composition of two orthogonal matrices is itself an orthogonal matrix ((A^B^)T(A^B^)=B^TA^TA^B^=B^TB^=I(\hat{A}\hat{B})^T(\hat{A}\hat{B}) = \hat{B}^T\hat{A}^T\hat{A}\hat{B} = \hat{B}^T\hat{B} = I since both are orthogonal), so C^\hat{C} preserves all distances and angles automatically.

Step 3 — Confirm C^\hat{C} fixes the same point. All point-group operations share at least one common fixed point (the "point" in point group — for C3vC_{3v}, every operation fixes the nitrogen). Since both A^\hat{A} and B^\hat{B} fix that point, their composite does too: C^(r0)=A^(B^(r0))=A^(r0)=r0\hat{C}(\mathbf{r}_0) = \hat{A}(\hat{B}(\mathbf{r}_0)) = \hat{A}(\mathbf{r}_0) = \mathbf{r}_0.

Step 4 — Conclude C^\hat{C} is a symmetry operation, hence in GG. By Steps 2–3, C^\hat{C} is an orthogonal transformation fixing the shared point and mapping the nuclear framework onto an indistinguishable copy of itself. That is exactly the definition of a symmetry operation of the molecule from Step 1. Since GG is defined as the complete set of all symmetry operations of the molecule, C^\hat{C} must already be one of the finitely many elements already listed in GG — there is no room for an unlisted operation, because GG was constructed to be exhaustive. Hence A^B^∈G\hat{A}\hat{B} \in G for all A^,B^∈G\hat{A}, \hat{B} \in G: closure is proved.

Go deeper · Derivation B · 2 minBuilding the C₂ᵥ multiplication table from first principles and checking all four axioms
Derivation BBuilding the C₂ᵥ multiplication table from first principles and checking all four axioms

Goal. For water (point group C2vC_{2v}, operations {E,C2,σv,σv′}\{E, C_2, \sigma_v, \sigma_v'\}), derive every entry of the multiplication table by explicit coordinate action, then verify closure, identity, and inverses element-by-element (associativity is guaranteed by matrix multiplication and is not separately checked).

Step 1 — Set up coordinates. Place the O atom at the origin, the C2C_2 axis along zz, and let σv=σv(xz)\sigma_v = \sigma_v(xz) be the plane containing both H atoms, with σv′=σv(yz)\sigma_v' = \sigma_v(yz) perpendicular to it. The four operations act on a point (x,y,z)(x,y,z) as:

E(x,y,z)=(x,y,z),C2(x,y,z)=(−x,−y,z)E(x,y,z) = (x,y,z), \qquad C_2(x,y,z) = (-x,-y,z)
σv(xz)(x,y,z)=(x,−y,z),σv′(yz)(x,y,z)=(−x,y,z)\sigma_v(xz)(x,y,z) = (x,-y,z), \qquad \sigma_v'(yz)(x,y,z) = (-x,y,z)

where: C2C_2 is rotation by 180° about zz; the two mirrors flip the sign of the coordinate they are perpendicular to.

Step 2 — Compute one representative product, C2⋅σv(xz)C_2 \cdot \sigma_v(xz). Apply σv(xz)\sigma_v(xz) first, then C2C_2:

C2(σv(xz)(x,y,z))=C2(x,−y,z)=(−x,y,z)C_2\big(\sigma_v(xz)(x,y,z)\big) = C_2(x,-y,z) = (-x, y, z)

Comparing to the four maps in Step 1, (−x,y,z)(-x,y,z) is exactly the action of σv′(yz)\sigma_v'(yz). Therefore

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

Step 3 — Compute the reverse order, σv(xz)⋅C2\sigma_v(xz)\cdot C_2. Apply C2C_2 first, then σv(xz)\sigma_v(xz):

σv(xz)(C2(x,y,z))=σv(xz)(−x,−y,z)=(−x,y,z)=σv′(yz)(x,y,z)\sigma_v(xz)\big(C_2(x,y,z)\big) = \sigma_v(xz)(-x,-y,z) = (-x,y,z) = \sigma_v'(yz)(x,y,z)

So σv(xz) C2=σv′(yz)\sigma_v(xz)\, C_2 = \sigma_v'(yz) also. In this particular group the two products agree — C2C_2 and σv(xz)\sigma_v(xz) happen to commute — which is why C2vC_{2v} turns out to be abelian (every element commutes with every other), unlike C3vC_{3v}.

Step 4 — Fill in the remaining products the same way.

C2⋅C2(x,y,z)=C2(−x,−y,z)=(x,y,z)=E(x,y,z)  ⟹  C22=EC_2 \cdot C_2 (x,y,z) = C_2(-x,-y,z) = (x,y,z) = E(x,y,z) \implies C_2^2 = E
σv(xz)⋅σv(xz)(x,y,z)=σv(xz)(x,−y,z)=(x,y,z)=E  ⟹  σv2=E\sigma_v(xz)\cdot\sigma_v(xz)(x,y,z) = \sigma_v(xz)(x,-y,z) = (x,y,z) = E \implies \sigma_v^2 = E
σv′(yz)⋅σv′(yz)(x,y,z)=σv′(yz)(−x,y,z)=(x,y,z)=E  ⟹  (σv′)2=E\sigma_v'(yz)\cdot\sigma_v'(yz)(x,y,z) = \sigma_v'(yz)(-x,y,z) = (x,y,z) = E \implies (\sigma_v')^2 = E
σv(xz)⋅σv′(yz)(x,y,z)=σv(xz)(−x,y,z)=(−x,−y,z)=C2(x,y,z)  ⟹  σvσv′=C2\sigma_v(xz)\cdot \sigma_v'(yz)(x,y,z) = \sigma_v(xz)(-x,y,z) = (-x,-y,z) = C_2(x,y,z) \implies \sigma_v\sigma_v' = C_2

Step 5 — Assemble the full table and verify the axioms.

A^\B^\hat{A}\backslash\hat{B}EEC2C_2σv(xz)\sigma_v(xz)σv′(yz)\sigma_v'(yz)
EEEEC2C_2σv\sigma_vσv′\sigma_v'
C2C_2C2C_2EEσv′\sigma_v'σv\sigma_v
σv\sigma_vσv\sigma_vσv′\sigma_v'EEC2C_2
σv′\sigma_v'σv′\sigma_v'σv\sigma_vC2C_2EE

Closure: every entry in the interior of the table is one of {E,C2,σv,σv′}\{E,C_2,\sigma_v,\sigma_v'\} — no new symbol ever appears. Identity: row and column for EE simply reproduce the column/row label, confirming E^A^=A^E^=A^\hat{E}\hat{A}=\hat{A}\hat{E}=\hat{A}. Inverses: every diagonal entry equals EE (C22=EC_2^2=E, σv2=E\sigma_v^2=E, (σv′)2=E(\sigma_v')^2=E), so every element in C2vC_{2v} is its own inverse. Associativity is guaranteed since each operation was represented above as a linear coordinate map (equivalent to a 3×33\times3 orthogonal matrix), and matrix multiplication is associative by the properties of linear algebra. All four axioms hold: C2v={E,C2,σv,σv′}C_{2v} = \{E, C_2, \sigma_v, \sigma_v'\} is confirmed to be a group of order h=4h=4, and — unusually among point groups — an abelian one, since the table is symmetric about its diagonal.

Worked examples

Example 1 — Foundational: verifying the inverse axiom for S4S_4 in point group S4S_4 (e.g., idealized 1,3,5,7-tetrasubstituted cyclooctatetraene skeleton). The group S4={E,S4,C2,S43}S_4 = \{E, S_4, C_2, S_4^3\} has order h=4h=4 (here C2=S42C_2 = S_4^2, since two successive S4S_4 operations — each a 90° rotation combined with a reflection — combine to a pure 180° rotation, because the two reflections cancel). Verify that every element has an inverse within the set. Take A^=S4\hat{A} = S_4 (rotate 90° about zz, then reflect through xyxy). Its inverse must satisfy S4A^−1=ES_4 \hat{A}^{-1} = E. Try A^−1=S43\hat{A}^{-1} = S_4^3 (three successive applications of S4S_4, i.e., rotate 270° then reflect three times, net effect: rotate 270°270° and reflect once since reflections are involutions and σh3=σh\sigma_h^3=\sigma_h):

S4⋅S43=S44S_4 \cdot S_4^3 = S_4^4

Four successive S4S_4 operations means four 90° rotations (total 360°=0°360°=0°) and four reflections through σh\sigma_h (an even number, so they cancel: σh4=E\sigma_h^4 = E). Hence

S44=C44⋅σh4=E⋅E=ES_4^4 = C_4^4 \cdot \sigma_h^4 = E \cdot E = E

confirming S4−1=S43S_4^{-1} = S_4^3, and since S43S_4^3 is already listed as a member of the group, the inverse axiom holds for this element. Checking C2C_2: C2⋅C2=C22=C44=EC_2 \cdot C_2 = C_2^2 = C_4^4 = E (a 360° rotation), so C2C_2 is its own inverse, again found inside the set. Every element's inverse is present — the inverse axiom is satisfied, and no operation is "missing" from the table, which is exactly what closure guarantees in advance.

Example 2 — Applied: using the C3vC_{3v} table to predict a product relevant to NH₃ vibrational analysis without recomputing coordinates. Suppose in an infrared analysis of ammonia you need σv′⋅C32\sigma_v' \cdot C_3^2 — the operation equivalent to first rotating by 240° then reflecting through σv′\sigma_v' — because this composite appears when reducing the basis of N–H bond-stretch displacement vectors into irreducible representations (a step that eventually leads into Matrix Representations of Symmetry Operations). Rather than re-deriving this by direct coordinate geometry, read the multiplication table constructed earlier (row =σv′= \sigma_v', column =C32=C_3^2): From the Cayley table, row σv′\sigma_v', column C32C_3^2 gives σv′′\sigma_v'':

σv′⋅C32=σv′′\sigma_v' \cdot C_3^2 = \sigma_v''

This means the composite transformation is physically identical to a single reflection through the third mirror plane σv′′\sigma_v'' — a fact you can double check by tracking where H₁, H₂, H₃ go under each step: C32C_3^2 sends (H₁,H₂,H₃)→(H₂,H₃,H₁) [rotating by 240°, equivalently −120°, cycles labels backward by one], then σv′\sigma_v' (the mirror through H₂) fixes H₂ and swaps H₁↔H₃, giving net permutation (H₁,H₂,H₃)→(H₃,H₂,H₁)→ wait, composing carefully: apply C32C_3^2 first to get (H₂,H₃,H₁) in the H₁,H₂,H₃ slots, then apply σv′\sigma_v' which fixes slot-2 and swaps slots 1,3, giving (H₁,H₃,H₂) read in original slot order — which is exactly the permutation produced by a single reflection through the plane containing H₃, i.e. σv′′\sigma_v'', matching the table exactly. Because this product was already guaranteed by closure to equal some member of {E,C3,C32,σv,σv′,σv′′}\{E,C_3,C_3^2,\sigma_v,\sigma_v',\sigma_v''\}, the table lookup is trustworthy shorthand for a full geometric recomputation.

Example 3 — Competition-level: proving a general theorem — every group of order hh that is prime must be cyclic, and identifying which point groups this excludes. This is a pure-group-theory result (Lagrange's theorem corollary) with direct chemical payoff: it tells you, sight unseen, the multiplication-table structure of any point group whose order is a prime number, such as C3C_3 (order 3, e.g., triphenylphosphine idealized without the phenyl twist) or C5C_5 (order 5).

Claim. If ∣G∣=p|G| = p for prime pp, then GG is cyclic — generated entirely by repeated application of a single operation — and therefore abelian.

Proof sketch relevant to point groups. By Lagrange's theorem, the order of any subgroup of GG must divide ∣G∣=p|G|=p. Since pp is prime, its only divisors are 1 and pp itself. Take any non-identity element A^∈G\hat{A}\in G and consider the cyclic subgroup it generates, ⟨A^⟩={E,A^,A^2,… }\langle \hat{A}\rangle = \{E, \hat{A}, \hat{A}^2, \dots\}. This subgroup has order dividing pp; since A^≠E\hat{A}\ne E, its order is not 1, so it must be exactly pp. But a subgroup of order pp inside a group of order pp is the whole group. Hence G=⟨A^⟩G = \langle \hat{A}\rangle: every element of GG is some power of A^\hat{A}, and powers of a single element always commute (A^mA^n=A^m+n=A^nA^m\hat{A}^m\hat{A}^n = \hat{A}^{m+n} = \hat{A}^n\hat{A}^m), so GG is abelian.

Chemical consequence. Point group CnC_n for prime nn (e.g. C3C_3, C5C_5, C7C_7) is automatically cyclic and abelian — its entire multiplication table is generated from just Cn,Cn2,…,Cnn−1,EC_n, C_n^2, \dots, C_n^{n-1}, E with no independent reflections or rotations to introduce non-commutativity. This immediately tells you, without constructing a single Cayley table entry, that a molecule belonging to pure C3C_3 (chiral, propeller-shaped, no mirror planes — e.g., idealized triarylphosphine with a helical twist) has only one-dimensional irreducible representations that come in complex-conjugate pairs, since abelian groups have hh distinct 1-D irreducible representations (a fact that becomes central once you reach Classifying the Point Groups and construct that molecule's character table). By contrast, C3vC_{3v} (order 6, not prime) is not forced to be abelian by this theorem — and indeed the Cayley table above showed explicitly that it is not, since 6=2×36=2\times3 is composite and admits the non-abelian structure built from a normal cyclic subgroup {E,C3,C32}\{E,C_3,C_3^2\} together with the three reflections.

Limiting cases, scope & common traps

SituationWhat happensWhy
Linear molecule, C∞vC_{\infty v} or D∞hD_{\infty h}Group has infinite orderContinuous rotation angle ϕ\phi about the bond axis gives infinitely many distinct CϕC_\phi operations, all still closing into the set
Single atom / spherical top with full rotational symmetryFull rotation group SO(3)SO(3) (or O(3)O(3) with reflections), continuous and infiniteEvery rotation about every axis through the center is a symmetry operation
Order-1 group, C1C_1Trivial group {E}\{E\}A molecule with no symmetry beyond the identity — axioms hold trivially since there is only one element and E⋅E=EE\cdot E=E
Abelian vs non-abelianC2vC_{2v}, C2hC_{2h}, CiC_i, CsC_s, CnC_n (n≤2n\le2) are abelian; C3vC_{3v} and higher-order groups with n≥3n\ge3 mixing rotations and reflections are generally non-abelianCommutativity requires that swapping the order of any two operations still lands on the same element — true only for restricted symmetry types
Checking closure "by inspection" without full operation listSilent failure: an incomplete operation list can appear to close under composition on the pairs you happened to test, while actually missing operationsAlways list operations systematically (proper axes, improper axes, planes, center) using the Improper Rotations and Sn Axes classification before building any table

The chemist behind it

Origins · 1 minHans Bethe and how this was discovered
HB
Hans Bethe
1906–2005 · Solid-state and atomic physics, group theory in crystal fields, 1929

Hans Bethe was a German-American theoretical physicist whose 1929 paper on the splitting of atomic energy levels in crystalline electric fields introduced systematic group-theoretical (point-group) analysis into the study of matter — the ancestor of the ligand-field and crystal-field theory used throughout modern inorganic and solid-state chemistry. Working at a time when quantum mechanics was barely three years old, Bethe showed that the way a free ion's degenerate energy levels split when placed in a crystal environment is dictated entirely by the point-group symmetry of the surrounding lattice site — not by detailed calculation of the electric field itself. This was among the first demonstrations that the abstract group axioms discussed here have direct, quantitatively testable consequences for real spectra. Bethe went on to a legendary career spanning nuclear astrophysics (explaining the fusion reactions powering stars, for which he won the 1967 Nobel Prize in Physics), quantum electrodynamics, and Cold War-era science policy, but chemists across every subfield who use point-group character tables to predict d-orbital splitting, vibrational band symmetry, or selection rules are drawing directly on the mathematical machinery he helped establish.

History
- 1830s — Auguste Bravais and later crystallographers classify the finite symmetry groups of crystal lattices, the geometric ancestors of point groups.
- 1870s–1890s — Arthur Schoenflies and Evgraf Fedorov independently complete the classification of the 32 crystallographic point groups and 230 space groups, giving chemistry the Schoenflies notation (C2vC_{2v}, D3hD_{3h}, etc.) still used today.
- 1929 — Hans Bethe applies group representation theory to crystal-field splitting of atomic energy levels, launching group theory as a working tool in physical chemistry.
- 1930s — Eugene Wigner and others formalize the application of representation theory to quantum mechanical selection rules, underpinning modern spectroscopy.
- 1960s — Cotton's textbook Chemical Applications of Group Theory systematizes point-group methods for a generation of chemists, cementing character tables as standard chemistry curriculum.
Why do we require a "common fixed point" for point-group operations specifically?

Point groups describe finite molecules where every symmetry operation leaves at least one point in space unmoved — typically the center of mass, or a specific atom on the principal axis. This distinguishes point groups from space groups, which describe infinite periodic crystals and include translations that move every point. Because no point is left fixed under a pure translation, translational symmetry cannot belong to a point group; it requires the larger space-group framework, built by combining point-group operations with lattice translations. The "point" in point group is thus not incidental terminology — it is the defining geometric constraint that keeps the group finite (except for linear molecules) and keeps every operation representable as an orthogonal matrix rather than a general affine transformation.

Does the order in which you multiply matter for every point group, or just some?

It depends on the specific group. Abelian point groups — where every pair of operations commutes — include C1C_1, CsC_s, CiC_i, CnC_n for n≤2n\le 2, C2vC_{2v}, C2hC_{2h}, D2D_2, D2hD_{2h}, and S2nS_{2n} among others; these tend to have low order and lack a rotation axis of order 3 or higher combined with off-axis reflections. Non-abelian groups appear once you have a rotation axis of order n≥3n\ge3 together with operations that do not all commute with it, such as C3vC_{3v}, D3D_3, and virtually all higher-symmetry groups relevant to real molecules like benzene (D6hD_{6h}) or methane (TdT_d). You must check commutativity explicitly (or recognize the structural pattern) rather than assume it either way.

How does closure actually get used in a character table, once you build one?

Closure guarantees that the set of operations partitions cleanly into conjugacy classes, and that the number of irreducible representations exactly equals the number of classes — a theorem that would not hold if the "group" secretly contained an operation whose products fell outside the set. Every entry in a character table is a trace of a representation matrix evaluated at one operation per class; the validity of using just one representative per class (rather than tabulating every single operation) rests entirely on the closure and conjugation structure established here. Skipping this verification step and building a character table from an incomplete operation list produces a table that looks plausible but gives wrong selection rules.

Is the identity operation ever "trivial" in a way that makes it unimportant?

No — although E^\hat{E} (do nothing) seems physically vacuous, it is mathematically indispensable. Without a guaranteed identity element, "inverse" would be undefined (an inverse is only meaningful relative to some identity), and representation theory would lose its anchor: every irreducible representation assigns the number 1 (or the identity matrix) to E^\hat{E}, and the dimension of a representation is read off as the character of E^\hat{E}. In this sense E^\hat{E} is the reference point against which every other operation's effect is measured.

Can a point group have operations that are inverses of themselves but not equal to E?

Yes, and this is extremely common. Any operation of order 2 — meaning applying it twice returns you to the identity — is its own inverse: A^2=E^  ⟹  A^−1=A^\hat{A}^2 = \hat{E} \implies \hat{A}^{-1} = \hat{A}. This includes every C2C_2 rotation, every reflection σ\sigma, and the inversion operation ii, since reflecting twice through the same plane, rotating twice by 180°, or inverting twice through the same center all restore the original configuration. Higher-order rotations like C3C_3 are not their own inverse (C3−1=C32≠C3C_3^{-1} = C_3^2 \ne C_3), which is why groups containing only order-2 operations (plus EE) tend to be simpler and abelian, as in C2vC_{2v}.

How is this different from the permutation-group description of identical nuclei sometimes used in spectroscopy?

Point groups track rigid geometric operations (rotations, reflections) that happen to also permute identical nuclei as a side effect, while the permutation-inversion group formalism (used for high-resolution rovibrational spectroscopy, particularly of floppy or tunneling molecules like ammonia's inversion) tracks all feasible permutations of identical nuclei plus spatial inversion of the whole molecule, independent of whether they correspond to a simple rigid rotation. For rigid molecules at equilibrium geometry, the two formalisms give isomorphic groups with matching multiplication tables, which is why the rigid point-group treatment developed here suffices for the vast majority of structural and spectroscopic applications; the permutation-inversion approach becomes necessary specifically when large-amplitude motions connect distinct geometric arrangements.

Why does the number of symmetry operations (order h) matter practically, beyond bookkeeping?

The order hh appears directly in the reduction formula used to decompose any reducible representation (such as a set of atomic basis orbitals, bond vectors, or Cartesian displacement coordinates) into irreducible representations:

ni=1h∑Rχ(R) χi(R)n_i = \frac{1}{h}\sum_{R} \chi(R)\,\chi_i(R)

where the sum runs over all hh operations, χ(R)\chi(R) is the character of the reducible representation, and χi(R)\chi_i(R) is the character of irreducible representation ii. A larger, more symmetric point group (larger hh) gives more stringent symmetry constraints, which is exactly why highly symmetric molecules like methane or benzene have so many forbidden vibrational or electronic transitions compared to low-symmetry molecules — the closure-verified operation count hh is doing real quantitative work, not just organizational work.

Before this

Where this leads