6-j symbol

The 6-j symbol is invariant under any permutation of the columns:

${\displaystyle {\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&j_{6}\end{Bmatrix}}={\begin{Bmatrix}j_{2}&j_{1}&j_{3}\\j_{5}&j_{4}&j_{6}\end{Bmatrix}}={\begin{Bmatrix}j_{1}&j_{3}&j_{2}\\j_{4}&j_{6}&j_{5}\end{Bmatrix}}={\begin{Bmatrix}j_{3}&j_{2}&j_{1}\\j_{6}&j_{5}&j_{4}\end{Bmatrix}}=\cdots }$

The 6-j symbol is also invariant if upper and lower arguments are interchanged in any two columns:

${\displaystyle {\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&j_{6}\end{Bmatrix}}={\begin{Bmatrix}j_{4}&j_{5}&j_{3}\\j_{1}&j_{2}&j_{6}\end{Bmatrix}}={\begin{Bmatrix}j_{1}&j_{5}&j_{6}\\j_{4}&j_{2}&j_{3}\end{Bmatrix}}={\begin{Bmatrix}j_{4}&j_{2}&j_{6}\\j_{1}&j_{5}&j_{3}\end{Bmatrix}}.}$

These equations reflect the 24 symmetry operations of the automorphism group that leave the associated tetrahedral Yutsis graph with 6 edges invariant: mirror operations that exchange two vertices and a swap an adjacent pair of edges.

The 6-j symbol

${\displaystyle {\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&j_{6}\end{Bmatrix}}}$

is zero unless j₁, j₂, and j₃ satisfy triangle conditions, i.e.,

${\displaystyle j_{1}=|j_{2}-j_{3}|,\ldots ,j_{2}+j_{3}}$

In combination with the symmetry relation for interchanging upper and lower arguments this shows that triangle conditions must also be satisfied for the triads (j₁, j₅, j₆), (j₄, j₂, j₆), and (j₄, j₅, j₃). Furthermore, the sum of each of the elements of a triad must be an integer. Therefore, the members of each triad are either all integers or contain one integer and two half-integers.

When j₆ = 0 the expression for the 6-j symbol is:

${\displaystyle {\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&0\end{Bmatrix}}={\frac {\delta _{j_{2},j_{4}}\delta _{j_{1},j_{5}}}{\sqrt {(2j_{1}+1)(2j_{2}+1)}}}(-1)^{j_{1}+j_{2}+j_{3}}{\begin{Bmatrix}j_{1}&j_{2}&j_{3}\end{Bmatrix}}.}$

The triangular delta {j₁  j₂  j₃} is equal to 1 when the triad (j₁, j₂, j₃) satisfies the triangle conditions, and zero otherwise. The symmetry relations can be used to find the expression when another j is equal to zero.

The 6-j symbols satisfy this orthogonality relation:

${\displaystyle \sum _{j_{3}}(2j_{3}+1){\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&j_{6}\end{Bmatrix}}{\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&j_{6}'\end{Bmatrix}}={\frac {\delta _{j_{6}^{}j_{6}'}}{2j_{6}+1}}{\begin{Bmatrix}j_{1}&j_{5}&j_{6}\end{Bmatrix}}{\begin{Bmatrix}j_{4}&j_{2}&j_{6}\end{Bmatrix}}.}$

A remarkable formula for the asymptotic behavior of the 6-j symbol was first conjectured by Ponzano and Regge[2] and later proven by Roberts.[3] The asymptotic formula applies when all six quantum numbers j₁, ..., j₆ are taken to be large and associates to the 6-j symbol the geometry of a tetrahedron. If the 6-j symbol is determined by the quantum numbers j₁, ..., j₆ the associated tetrahedron has edge lengths J_i = j_i+1/2 (i=1,...,6) and the asymptotic formula is given by,

${\displaystyle {\begin{Bmatrix}j_{1}&j_{2}&j_{3}\\j_{4}&j_{5}&j_{6}\end{Bmatrix}}\sim {\frac {1}{\sqrt {12\pi |V|}}}\cos {\left(\sum _{i=1}^{6}J_{i}\theta _{i}+{\frac {\pi }{4}}\right)}.}$

The notation is as follows: Each θ_i is the external dihedral angle about the edge J_i of the associated tetrahedron and the amplitude factor is expressed in terms of the volume, V, of this tetrahedron.

In representation theory, 6-j symbols are matrix coefficients of the associator isomorphism in a tensor category.[4] For example, if we are given three representations V_i, V_j, V_k of a group (or quantum group), one has a natural isomorphism

${\displaystyle (V_{i}\otimes V_{j})\otimes V_{k}\to V_{i}\otimes (V_{j}\otimes V_{k})}$

of tensor product representations, induced by coassociativity of the corresponding bialgebra. One of the axioms defining a monoidal category is that associators satisfy a pentagon identity, which is equivalent to the Biedenharn-Elliot identity for 6-j symbols.

When a monoidal category is semisimple, we can restrict our attention to irreducible objects, and define multiplicity spaces

${\displaystyle H_{i,j}^{\ell }=\operatorname {Hom} (V_{\ell },V_{i}\otimes V_{j})}$

so that tensor products are decomposed as:

${\displaystyle V_{i}\otimes V_{j}=\bigoplus _{\ell }H_{i,j}^{\ell }\otimes V_{\ell }}$

where the sum is over all isomorphism classes of irreducible objects. Then:

${\displaystyle (V_{i}\otimes V_{j})\otimes V_{k}\cong \bigoplus _{\ell ,m}H_{i,j}^{\ell }\otimes H_{\ell ,k}^{m}\otimes V_{m}\qquad {\text{while}}\qquad V_{i}\otimes (V_{j}\otimes V_{k})\cong \bigoplus _{m,n}H_{i,n}^{m}\otimes H_{j,k}^{n}\otimes V_{m}}$

The associativity isomorphism induces a vector space isomorphism

${\displaystyle \Phi _{i,j}^{k,m}:\bigoplus _{\ell }H_{i,j}^{\ell }\otimes H_{\ell ,k}^{m}\to \bigoplus _{n}H_{i,n}^{m}\otimes H_{j,k}^{n}}$

and the 6j symbols are defined as the component maps:

${\displaystyle {\begin{Bmatrix}i&j&\ell \\k&m&n\end{Bmatrix}}=(\Phi _{i,j}^{k,m})_{\ell ,n}}$

When the multiplicity spaces have canonical basis elements and dimension at most one (as in the case of SU(2) in the traditional setting), these component maps can be interpreted as numbers, and the 6-j symbols become ordinary matrix coefficients.

In abstract terms, the 6-j symbols are precisely the information that is lost when passing from a semisimple monoidal category to its Grothendieck ring, since one can reconstruct a monoidal structure using the associator. For the case of representations of a finite group, it is well-known that the character table alone (which determines the underlying abelian category and the Grothendieck ring structure) does not determine a group up to isomorphism, while the symmetric monoidal category structure does, by Tannaka-Krein duality. In particular, the two nonabelian groups of order 8 have equivalent abelian categories of representations and isomorphic Grothdendieck rings, but the 6-j symbols of their representation categories are distinct, meaning their representation categories are inequivalent as monoidal categories. Thus, the 6-j symbols give an intermediate level of information, that in fact uniquely determines the groups in many cases, such as when the group is odd order or simple.[5]

• Clebsch–Gordan coefficients
• 3-j symbol
• Racah W-coefficient
• 9-j symbol

• Biedenharn, L. C.; van Dam, H. (1965). Quantum Theory of Angular Momentum: A collection of Reprints and Original Papers. New York: Academic Press. ISBN 0-12-096056-7.

• Edmonds, A. R. (1957). Angular Momentum in Quantum Mechanics. Princeton, New Jersey: Princeton University Press. ISBN 0-691-07912-9.

• Condon, Edward U.; Shortley, G. H. (1970). "Chapter 3". The Theory of Atomic Spectra. Cambridge: Cambridge University Press. ISBN 0-521-09209-4.
• Maximon, Leonard C. (2010), "3j,6j,9j Symbols", in Olver, Frank W. J.; Lozier, Daniel M.; Boisvert, Ronald F.; Clark, Charles W. (eds.), NIST Handbook of Mathematical Functions, Cambridge University Press, ISBN 978-0-521-19225-5, MR 2723248
• Messiah, Albert (1981). Quantum Mechanics (Volume II) (12th ed.). New York: North Holland Publishing. ISBN 0-7204-0045-7.

• Brink, D. M.; Satchler, G. R. (1993). "Chapter 2". Angular Momentum (3rd ed.). Oxford: Clarendon Press. ISBN 0-19-851759-9.

• Zare, Richard N. (1988). "Chapter 2". Angular Momentum. New York: John Wiley. ISBN 0-471-85892-7.

• Biedenharn, L. C.; Louck, J. D. (1981). Angular Momentum in Quantum Physics. Reading, Massachusetts: Addison-Wesley. ISBN 0-201-13507-8.

• Regge, T. (1959). "Simmetry Properties of Racah's Coefficients". Nuovo Cimento. 11 (1): 116–117. Bibcode:1959NCim...11..116R. doi:10.1007/BF02724914. S2CID 121333785.
• Stone, Anthony. "Wigner coefficient calculator". (Gives exact answer)
• Simons, Frederik J. "Matlab software archive, the code SIXJ.M".
• Volya, A. "Clebsch-Gordan, 3-j and 6-j Coefficient Web Calculator". Archived from the original on 2012-12-20.
• Plasma Laboratory of Weizmann Institute of Science. "369j-symbol calculator".
• GNU scientific library. "Coupling coefficients".
• Johansson, H.T.; Forssén, C. "(WIGXJPF)". (accurate; C, fortran, python)
• Johansson, H.T. "(FASTWIGXJ)". (fast lookup, accurate; C, fortran)