Skip to content

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.

Use

Cj1m1,j2m2JM=⟨j1m1;j2m2∣JM⟩.C^{JM}_{j_1m_1,j_2m_2} =\langle j_1m_1;j_2m_2\vert JM\rangle.

Store doubled quantum numbers 2j1,2m1,2j2,2m2,2J,2M2j_1,2m_1,2j_2,2m_2,2J,2M as integers. Then half-integer parity checks and triangle rules become exact integer tests, avoiding comparisons of rounded decimal inputs.

A coefficient vanishes unless m1+m2=Mm_1+m_2=M, ∣mi∣≤ji|m_i|\le j_i, ∣M∣≤J|M|\le J, ∣j1−j2∣≤J≤j1+j2|j_1-j_2|\le J\le j_1+j_2, with ji−mij_i-m_i, J−MJ-M, and j1+j2−Jj_1+j_2-J 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

Cj1m1,j2m2JM=(−1)j1−j2+M2J+1(j1j2Jm1m2−M).C^{JM}_{j_1m_1,j_2m_2} =(-1)^{j_1-j_2+M}\sqrt{2J+1} \begin{pmatrix}j_1&j_2&J\\m_1&m_2&-M\end{pmatrix}.

The argument −M-M and the phase both matter. Verify the software’s argument ordering rather than assuming every interface takes jj and mm values in the same order.

Build dimensionless single-spin matrices with

(Jz/ℏ)mm=m,J+∣j,m⟩=ℏ(j−m)(j+m+1)∣j,m+1⟩.(J_z/\hbar)_{mm}=m, \qquad J_+\lvert j,m\rangle =\hbar\sqrt{(j-m)(j+m+1)}\lvert j,m+1\rangle.

In the ordered product basis form J=J1⊗I+I⊗J2\mathbf J=\mathbf J_1\otimes I+I\otimes\mathbf J_2. Work in fixed-MM blocks of JzJ_z and diagonalize J2/ℏ2J^2/\hbar^2. Its eigenvalues are J(J+1)J(J+1). The normalized eigenvectors supply coupling coefficients, but their arbitrary signs still need a convention.

For each JJ, choose the highest-weight state with the standard positive coefficient on its largest allowed m1m_1 component. Generate lower MM states with

∣J,M−1⟩=J−∣J,M⟩ℏ(J+M)(J−M+1).\lvert J,M-1\rangle =\frac{J_-\lvert J,M\rangle} {\hbar\sqrt{(J+M)(J-M+1)}}.

This ties the phases within a multiplet together. Independently diagonalizing every MM 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.

Order the product states as ∣↑↑⟩\lvert\uparrow\uparrow\rangle, ∣↑↓⟩\lvert\uparrow\downarrow\rangle, ∣↓↑⟩\lvert\downarrow\uparrow\rangle, ∣↓↓⟩\lvert\downarrow\downarrow\rangle. In the M=0M=0 block,

J2/ℏ2=(1111).J^2/\hbar^2=\begin{pmatrix}1&1\\1&1\end{pmatrix}.

The symmetric vector has eigenvalue two and gives ∣1,0⟩=(∣↑↓⟩+∣↓↑⟩)/2\lvert1,0\rangle=(\lvert\uparrow\downarrow\rangle+\lvert\downarrow\uparrow\rangle)/\sqrt2. The antisymmetric vector has eigenvalue zero and, with the stated phase, gives ∣0,0⟩=(∣↑↓⟩−∣↓↑⟩)/2\lvert0,0\rangle=(\lvert\uparrow\downarrow\rangle-\lvert\downarrow\uparrow\rangle)/\sqrt2.

Place coupled states in columns of UU. Then U†U=IU^\dagger U=I and U†J2UU^\dagger J^2U is diagonal. Together with the lowering relation, these tests check magnitudes, phases between multiplet states, and the interpretation of rows and columns.

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-MM block, check column orthogonality, row completeness, and the J2J^2 residual. Compare selected low-spin values with an independent convention reference. Exchange symmetry gives an additional test:

Cj2m2,j1m1JM=(−1)j1+j2−JCj1m1,j2m2JM.C^{JM}_{j_2m_2,j_1m_1} =(-1)^{j_1+j_2-J}C^{JM}_{j_1m_1,j_2m_2}.

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.

A routine returns the correct normalized triplet and singlet vectors but negates only ∣1,0⟩\lvert1,0\rangle. Which check detects the inconsistency?

Solution

Orthogonality and the J2J^2 eigenvalue test still pass. The ladder test fails: J−∣1,1⟩=2ℏ∣1,0⟩J_-\lvert1,1\rangle=\sqrt2\hbar\lvert1,0\rangle requires the phase fixed by the positive ladder coefficient. Negating every state in the multiplet instead would preserve that relation.

  • 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.