The Wigner-Eckart Theorem
The previous article ended at a signpost: once an operator is sorted into spherical tensor components , its matrix elements between angular-momentum states should inherit Clebsch-Gordan geometry wholesale. This article proves that claim — the Wigner-Eckart theorem — and turns it into a working method. The statement is a factorization: every matrix element splits into a CG coefficient, which carries all the orientation dependence and is pure group theory, times a reduced matrix element , one single number per pair of multiplets that carries all the dynamics. Count what that buys. A rank-1 operator between and multiplets has possible matrix elements. The theorem says: compute one, and the other forty-four are CG ratios you can read from a table. Selection rules come free — a matrix element vanishes whenever its CG factor does, so and the triangle rule gate every transition, with celebrated corollaries like the absolute prohibition of vector transitions. The proof is the chapter's algebra closing its loop: the commutator definition of a tensor operator forces its matrix elements to satisfy the same two-term recursion that generates CG tables — and two solutions of one linear recursion with the same boundary structure can differ only by an overall constant. That constant is the reduced matrix element. Everything is machine-verified here on real spherical-harmonic integrals: nine matrix elements collapsing to one ratio, the forbidden zeros landing exactly where the theorem says.
- The theorem: (Sakurai's normalization; conventions table below).
- Geometry/dynamics split: the CG factor carries every ; the reduced element is one number per block — orientation and physics cleanly divorced.
- Proof mechanism: the tensor-operator commutation relations force matrix elements to obey the CG recursion; proportionality follows from linear-algebra uniqueness.
- Selection rules for free: nonzero only if and ; corollary — no transition under any rank-1 (vector) operator.
- Ratio method: measure or compute one component, predict all others; intensity ratios within a multiplet block are squared-CG ratios, verified here on Gaunt integrals (nine elements, one constant ratio).
- special case: scalars are diagonal, — the multiplet-preserving rule the projection theorem will exploit next.
- Key idea: rotations fix everything about a matrix element except one number — compute the geometry once (CG), the physics once (reduced element), and multiply.
Matrix elements of a spherical tensor operator factorize as : a Clebsch-Gordan factor carrying all orientation dependence times one reduced matrix element carrying all dynamics — selection rules are the CG factor's zeros.
Where this lives today
Every atomic-clock error budget uses the theorem: clock transitions are chosen where the CG geometry suppresses field sensitivities, and "tensor light shifts" are catalogued by exactly the rank bookkeeping of equations (1)-(3). Precision tests of fundamental symmetries — atomic parity violation, electric-dipole-moment searches — quote their observables as reduced matrix elements, computed once per system and reused across every orientation of every apparatus. In nuclear and hadron physics, transition strengths ( values, form factors) are reduced matrix elements by definition. And quantum-chemistry codes exploit the factorization to collapse angular integrals: only radial integrals are computed numerically; every -dependence is CG algebra executed symbolically.
The physical picture
A matrix element asks: how strongly does this operator connect that state to this one? The theorem's answer separates two unrelated questions that the raw matrix element tangles together. Geometry: do the angular shapes fit — can a rank- shape glued onto a multiplet contain any component, and how much of orientation lands on orientation ? That is coupling arithmetic, identical for every operator of the same rank. Dynamics: how big is the overlap of the radial/internal structure — the part that knows about wavefunctions, charges, energies? That is one number, blind to every .
The picture to keep: the operator couples angular momenta exactly as if you attached a state to — the matrix element is the amplitude for the coupled object to contain . Once you believe that sentence, the theorem is inevitable; the derivation below makes the belief rigorous.
The theorem, with its conventions pinned
For a spherical tensor operator (definitions and membership tests: Spherical Tensor Operators, consumed) acting between angular-momentum multiplets, with standing for all non-angular labels (radial quantum numbers, species, energies):
where: the double-bar object is the reduced matrix element — defined by this equation, one constant per block, carrying dimensions and dynamics. The is Sakurai's normalization choice; it is pure bookkeeping, but mixing conventions is the classic source of spurious factors:
| convention | factorization | notes |
|---|---|---|
| Sakurai & Napolitano | this article's choice | |
| Edmonds / Racah | 3-j phrasing — 3-j, 6-j and Racah Symbols owns the dictionary | |
| Condon-Shortley | (no root) | absorbs into the reduced element |
Cross-convention translation multiplies the reduced element by known -type factors — never changes a physical ratio. When you quote a reduced matrix element, name your convention in the same breath.
We prove equation (1). The strategy is the recursion argument: sandwich the tensor-operator ladder commutation relation between multiplet states, and discover that the resulting linear relation on matrix elements is identical, coefficient for coefficient, to the two-term recursion that generates Clebsch-Gordan tables (proven in Clebsch-Gordan Coefficients, consumed here). Two solution families of one recursion with the same support can then differ only by a block-constant — the reduced element. This derivation is the base treatment relocated in from the tensor-operator article per the chapter map; the -selection and triangle facts it consumes are cited where used.
Step 1. The easy gates. Sandwich between and : the left side evaluates to times the matrix element, the right to times it, so — the element vanishes unless . This is the azimuthal selection rule, established before any structure.
Step 2. The recursion. Sandwich the ladder relation the same way. On the left, let act leftward on the bra (raising/lowering with the multiplet coefficients of Ladder Operators) and rightward on the ket. Collect terms:
Step 3. Recognize it. Compare with the CG recursion (previous article's equation (6), with its bra-raising bookkeeping): under the dictionary , the two linear relations are term-for-term identical — same square-root coefficients, same index pattern, same support from Step 1. Why identical is no accident: the commutation relations say responds to exactly as the ket does — so the composite object responds exactly as , and its overlaps with must satisfy the coupling recursion. The proof is the "operators are states in disguise" doctrine cashed as linear algebra.
Step 4. Uniqueness. Fix the block . The recursion plus the support rule form a linear system that, as the CG construction showed, determines the whole solution family from a single seed value (the stretched entry) — its solution space is one-dimensional. The matrix elements solve it; the CG coefficients solve it and are not identically zero on the allowed window; therefore the matrix elements are a constant multiple of the CG coefficients. Name the constant : equation (1).
Step 5. Triangle for free: outside every CG coefficient vanishes, so every matrix element does — the operator's rank draws the reach window. And collapses to : scalars are multiplet-diagonal with -independent value — the rule the projection theorem consumes next article. Verified: the factorization audited on real integrals — all nine nonzero Gaunt integrals divided by their CG factors give ONE constant, ; azimuthal and triangle zeros land exactly (samples swept); diagonality exact (article verifier).
The ratio method — the theorem as a tool
The theorem's daily use is leverage: one known element unlocks a block.
where: the reduced elements cancel — ratios within a block are pure geometry, computable before you know anything about the system's dynamics. Intensity ratios of Zeeman components, relative line strengths in a multiplet, branching ratios among -channels: all are squared-CG ratios. The verifier runs the method end-to-end: from the single anchor it predicts , and the direct integral agrees exactly. A companion identity closes the practical kit — the orientation sum rule,
where: the CG column normalization (previous article's orthogonality) eats the geometry entirely: total strength out of any orientation is isotropic. Verified: the five -sums of the block all equal exactly. This is the germ of spectroscopic sum rules — line-strength totals that survive orientation averaging; their dynamical elaboration (oscillator strengths) belongs to the time-dependent chapters.
Go deeper · Derivation B · 2 minSelection rules and the forbidden 0 to 0 vector transition
We derive the complete selection-rule catalogue as corollaries of the factorization, ending with the strongest of the famous zeros. The strategy is to let the CG factor do all the work: a matrix element vanishes whenever its geometry factor does, so every vanishing rule of CG tables (proven in Clebsch-Gordan Coefficients, consumed) becomes a transition prohibition — no dynamics, no wavefunctions, no exceptions.
Step 1. Azimuthal rule. The factor vanishes unless — each component changes the magnetic quantum number by exactly . (Established independently in the proof's Step 1 from the commutator: the two routes agree, a consistency check worth noticing.)
Step 2. Triangle rule. The coupling spans only : unless sits in that window, no CG ladder exists and the entire block vanishes — the operator's rank draws a hard reach limit. Corollary read leftward: observing a transition between and certifies that the responsible operator has rank .
Step 3. The prohibition. Set , , : the window of is , which does not contain . Every component's CG factor is zero — verified directly: for all three . No vector operator, of any physical origin, connects two states. Why this zero is stronger than a parity rule: parity prohibitions depend on the operator's parity and can be evaded by choosing a different multipole; the zero is pure counting — any rank faces an empty window, and rank cannot change anything. That is why radiative transitions are absolutely forbidden to single photons (a photon always carries at least one unit), a statement whose radiative dressing belongs to the time-dependent chapters.
Step 4. Parity, multiplied on top. The CG gates are angular only; if the operator has definite parity and the states , the additional gate applies independently. Example: the triangle allows for a dipole (), but 's oddness kills it — leaving the textbook . Verified: azimuthal zeros () and triangle zeros ( from with ) swept on Gaunt integrals; the zero exact for all ; the diagonal rule exact (article verifier).
Limiting cases
| case | result | meaning |
|---|---|---|
| const | scalars preserve multiplets; the projection theorem's input | |
| , | strictly zero | contains no : the forbidden vector transition |
| whole block zero | triangle window empty — rank 3 cannot bridge two spin-1 multiplets | |
| stretched element , , | CG : element = reduced element | the cleanest anchor for the ratio method |
| sum over orientations | equation (3), -independent | isotropy of total strength; sum-rule germ |
Worked examples
Example 1 — the ratio method on a dipole block, end to end. The operator (the angular skeleton of the electric dipole) acts between and multiplets. Given the single computed anchor , predict and audit the whole block.
Step 1. Extract the reduced combination from the anchor: divide by its CG factor , giving the block constant .
Step 2. Predict: multiply by the target's CG factor (stretched): prediction .
Step 3. Audit against the direct Gaunt integral: exact match — and repeating for all nine nonzero combinations returns the same constant nine times (verified). The block's forty-five conceivable elements: nine nonzero, all now known; thirty-six zero by the gate. Answer: ; one anchor unlocked the block.
Example 2 — why a vector transition cannot happen. A spinless system sits in a state; a rank-1 (vector) perturbation is switched on. Show the amplitude to any final state vanishes identically.
Step 1. Theorem: the amplitude carries the factor — a CG coefficient of the coupling .
Step 2. The window: contains only . There is no ladder to overlap; the coefficient is zero for every — confirmed by the swept integrals .
Step 3. Read the physics: no vector operator — no dipole field, no velocity coupling, nothing rank-1 — can connect two spherically symmetric states. This is the group-theoretic bone of the famous forbidden lines in atomic spectra (the full radiative statement, with its parity and multipole grammar, is the time-dependent chapters' property). Answer: identically zero, from the empty triangle window — dynamics never consulted.
Origins · 1 minwigner-eckart theorem and how this was discovered
The theorem's name welds together the two routes by which it entered physics. Eugene Wigner's 1927 group-theory papers — written amid open hostility to the Gruppenpest, the "group plague" many physicists saw in representation theory — organized atomic term structure by rotational symmetry and contained the factorization for the general rank. Carl Eckart, in 1930, reached the vector case from the physicist's side, systematizing intensity ratios in spectra. It took Condon and Shortley's 1935 The Theory of Atomic Spectra — "the bible" of a generation of spectroscopists — to standardize the phases and turn the theorem into the everyday ratio-and-sum-rule toolkit this article teaches. The double-bar notation and the bookkeeping wars date from the same era; the physics has not moved since, only the conventions. Wigner's fuller portraits live with the unitary-symmetry and time-reversal articles; Eckart's with the picture-equivalence story.
Going further
- Sakurai & Napolitano §3.11 — the proof route and normalization used here.
- Edmonds §5.4 — the 3-j phrasing and the conventions concordance.
- Condon & Shortley (1935) — the classic source; Cohen-Tannoudji complements for dipole selection rules.
- Racah (1942) — where the reduced-element algebra grows into recoupling theory (this chapter's closing article).
Provenance note: All commutator definitions, the boxed theorem, and the projection-theorem/Landé-g derivations follow Sakurai & Napolitano §3.11 and Edmonds §5.4; a verifier should reproduce the recursion in Derivation 1 and confirm it matches the Clebsch-Gordan ladder relation term-by-term, check the triangle/azimuthal selection rules against electric-dipole rules in Cohen-Tannoudji and Griffiths, and verify the Landé formula reduces to for . Convention factor between Sakurai and Edmonds is standard; no fabricated numerical reduced matrix elements are quoted. — The recursion reproduction and selection-rule checks are executed in this article's verify script (on exact Gaunt integrals); the projection-theorem/Landé-g items are owned by the next serial, Projection Theorem for Vector Operators, per the chapter map. This article is also the relocated home of the Wigner-Eckart proof from Spherical Tensor Operators' base (noted there).
How do I actually compute a reduced matrix element?
Compute one convenient full matrix element — the stretched combination (, , ) is best, since its CG factor is 1 — then divide out the CG factor and multiply by (in Sakurai's convention). For operators built from spherical harmonics there are closed forms; for real systems the reduced element is where the radial integral or the many-body computation lives. Either way: once per block, never per orientation.
Is the theorem exact or an approximation?
Exact — it is pure representation theory, holding for any operator with definite rank acting between exact angular-momentum eigenstates. What can fail is the premise: if states are not exact multiplets (-mixing by strong fields or perturbations) or the operator has mixed rank (an unprojected Cartesian dyadic), the factorization applies only after you re-sort states and operator into irreducible pieces.
Why does the CG factor use the coupling j ⊗ k → j′ and not j′ ⊗ k → j?
Because transforms like the coupled object — the operator adds its rank to the initial state, and the matrix element asks how much that composite contains. Reading it backwards gives an equivalent statement with known symmetry factors (the CG exchange phases), which is why conventions differ but never contradict.
What is the relation between selection rules from this theorem and the parity selection rules I know?
Independent gates, multiplied. Wigner-Eckart's gates are angular (, triangle); parity adds -grading: an even-parity rank-2 operator like kills even though the triangle allows it. Electric-dipole rules ( exactly) are the two gates jointly: triangle gives , parity oddness of removes . Always run both gates.
Do degenerate α labels break the theorem?
No — rides along untouched: the theorem factorizes each block separately, and nothing requires the 's to be nondegenerate. What degeneracy can do is force you to diagonalize within a degenerate -multiplet family first (choosing good labels), after which each block again has its single reduced element.
Where do the famous 3-j symbols enter?
As the symmetrized re-dress of the same theorem: Edmonds' form replaces the CG factor by a 3-j symbol with a phase, which makes the symmetries of the factorization manifest (all three momenta democratic). Content identical, ergonomics different. The dictionary, the phase audit, and the symmetry pack are owned by 3-j, 6-j and Racah Symbols — two serials on.
Can I use the theorem for operators that are not hermitian?
Yes — rank is a transformation property, not a reality condition. Ladder-type components ( separately) are non-hermitian and the theorem applies verbatim. For hermitian observables the condition links the block's reduced element to its reverse block, giving the standard reality/symmetry relations between and .