Clebsch–Gordan Computation
Computing Clebsch–Gordan coefficients is a structured change-of-basis problem. Reliable output requires exact admissibility tests, a declared phase convention, and checks of orthogonality and angular-momentum eigenvalues. A list of plausible square roots is insufficient: inconsistent signs can change interference terms while preserving individual probabilities.
Required background. Clebsch–Gordan coefficients defines the coupled basis; tables and conventions fixes the Condon–Shortley convention used here.
Exact quantum numbers
Section titled “Exact quantum numbers”Use
Store doubled quantum numbers as integers. Then half-integer parity checks and triangle rules become exact integer tests, avoiding comparisons of rounded decimal inputs.
A coefficient vanishes unless , , , , with , , and nonnegative integers. Check these conditions before evaluating a factorial expression. They eliminate invalid requests and prevent negative factorial arguments from masquerading as arithmetic failures.
For software returning Wigner symbols, the convention conversion is
The argument and the phase both matter. Verify the software’s argument ordering rather than assuming every interface takes and values in the same order.
Constructing a coupling matrix
Section titled “Constructing a coupling matrix”Build dimensionless single-spin matrices with
In the ordered product basis form . Work in fixed- blocks of and diagonalize . Its eigenvalues are . The normalized eigenvectors supply coupling coefficients, but their arbitrary signs still need a convention.
For each , choose the highest-weight state with the standard positive coefficient on its largest allowed component. Generate lower states with
This ties the phases within a multiplet together. Independently diagonalizing every block and accepting arbitrary signs does not do so. For coupling more than two spins, multiplicity spaces introduce further basis choices that must also be declared.
Two spin-one-half factors
Section titled “Two spin-one-half factors”Order the product states as , , , . In the block,
The symmetric vector has eigenvalue two and gives . The antisymmetric vector has eigenvalue zero and, with the stated phase, gives .
Place coupled states in columns of . Then and is diagonal. Together with the lowering relation, these tests check magnitudes, phases between multiplet states, and the interpretation of rows and columns.
Large angular momenta and cancellation
Section titled “Large angular momenta and cancellation”Direct factorial formulas can overflow even when the final coefficient has magnitude at most one. Log-factorials control range but do not remove cancellation between alternating terms. Use exact arithmetic for moderate quantum numbers or algorithms designed for stable recurrences or exact integer accumulation at larger values. Increasing floating-point precision should be a diagnostic with a demonstrated plateau, not an untested cure.
For a full fixed- block, check column orthogonality, row completeness, and the residual. Compare selected low-spin values with an independent convention reference. Exchange symmetry gives an additional test:
Phase-insensitive tests alone cannot establish convention agreement. Conversely, a uniform sign change of an entire multiplet may be a convention difference rather than incorrect physics if all related quantities are transformed consistently.
Exercises
Section titled “Exercises”A routine returns the correct normalized triplet and singlet vectors but negates only . Which check detects the inconsistency?
Solution
Orthogonality and the eigenvalue test still pass. The ladder test fails: requires the phase fixed by the positive ladder coefficient. Negating every state in the multiplet instead would preserve that relation.
References
Section titled “References”- Edmonds, A. R., Angular Momentum in Quantum Mechanics, Princeton University Press, 1957, reprinted 1996 — coupling phases and recurrence relations.
- Johansson, H. T., and C. Forssén, “Fast and Accurate Evaluation of Wigner 3j, 6j, and 9j Symbols Using Prime Factorisation and Multi-Word Integer Arithmetic,” SIAM Journal on Scientific Computing 38, A376–A384 (2016), author manuscript — exact accumulation avoids cancellation in factorial sums.
- National Institute of Standards and Technology, Digital Library of Mathematical Functions, §34.3, Basic Properties of the 3j Symbol — symmetry and orthogonality checks.