Spin networks and their evaluations
In the special case of the tetrahedron graph the author presents a complete solution to the rationality property of the generating series of all evaluations with a fixed underlying graph using the combinatorics of the chromatic evaluation of a spin network, and a complete study of the asymptotics of the 6j-symbols in all cases: Euclidean, Plane or Minkowskian ,using the theory of Borel transform.
The author also computes the asymptotic expansions for all possible colorings, including the degenerate and non-physical cases. They find that quantities in the asymptotic expansion can be expressed as geometric properties of the dual tetrahedron graph interpreted as a metric polyhedron.
letting ( Γ,γ ) denote the tetrahedral spin network colored by an admissible coloring . Consider the planar dual graph which is also a tetrahedron with the same labelling on the edges. Regarding the labels of as edge lengths one may ask whether ( Γ,γ ) can be realized as a metric Euclidean tetrahedron with these edge lengths. The admissibility of ( Γ,γ ) implies that all faces of the dual tetrahedron satisfy the triangle inequality. A well-known theorem of metric geometry implies that ( Γ,γ ) can be realized in exactly one of three flat geometries
(a) Euclidean 3-dimensional space R³
(b) Minkowskian space R²’¹
(c) Plane Euclidean R².
Which of the above applies is decided by the sign of the Cayley-Menger determinant det(C) which is a degree six polynomial in the six edge labels.
Its assumed that ( Γ,γ ) is nondegenerate in the sense that all faces of are two dimensional. In the degenerate case, the evaluation of 6-symbol is a ratio of factorials, whose asymptotics are easily obtained from Stirling’s formula.
The geometry of the tetrahedron
The asymptotics of the 6j-symbols are related to the geometry of the planar dual tetrahedron. The 6j-symbol is a tetrahedral spin network ( Γ,γ ) admissibly labeled as shown below:
with γ= (a, b, c, d, e, f). Its dual tetrahedron ( Γ,γ ) is also labelled by γ. The tetrahedron and its planar dual, together with an ordering of the vertices and a colouring of the edges of the dual is depicted below. When a more systematic notation for the edge labels is needed they will be denoted them by dij it follows that
(a, b, c, d, e, f) = (d12, d23, d14, d34, d13, d24)
We can interpret the labels of the dual tetrahedron as edge lengths in a suitable flat geometry. A condition that allows one to realize ( Γ,γ ) in a flat metric space such that the edge lengths equal the edge labels. Labeling the vertices of ( Γ,γ ). We can formulate such a condition in terms of the Cayley-Menger determinant. This is
a homogeneous polynomial of degree 3 in the six variables a2, . . . , f2. A definition of the determinant is:
Given numbers dij we can define the Cayley-Menger matrix by
Cij = 1−d²ij/2 for i, j ≥1
Cij = sgn(i−j) for when i = 0 or j = 0.
In terms of the coloring = (a, b, c, d, e, f) of a tetrahedron, we have:
The sign of the Cayley-Menger determinant determines in what space the tetrahedron can be realized such that the edge labels equal the edge lengths
- If det(C) > 0 then the tetrahedron is realized in Euclidean space R³.
- If det(C) = 0 then the tetrahedron is realized in the Euclidean plane R².
- If det(C) < 0 then the tetrahedron is realized in Minkowski space R²’¹.
In each case the volume of the tetrahedron is given by
The 6 dimensional space of non-degenerate tetrahedra consists of regions of Minkowskian and regions of Euclidean tetrahedra. It turns out to be a cone that is made up from one connected component of three dimensional Euclidean tetrahedra and two connected components of Minkowskian tetrahedra. The three dimensional Euclidean and Minkowskian tetrahedra are separated by Plane tetrahedra. The Plane tetrahedra also form two connected components, representatives of which are depicted below:
The tetrahedra in the Plane component that look like a triangle with an interior point are called triangular and the Plane tetrahedra from that other component that look like a quadrangle together with its diagonals are called quadrangular. The same names are used for the corresponding Minkowskian components.
An integer representative of the triangular Plane tetrahedra is not easy to find as the smallest example is (37, 37, 13, 13, 24, 30).
Let’s look at the dihedral angles of a tetrahedron realized in either of the three above spaces. The cosine and sine of these angles can be expressed in terms of certain minors of the Cayley-Menger
matrix. Define the adjugate matrix ad(C) whose ij entry is (−1)i+j times the determinant of the matrix obtained from C by deleting the i-th row and the j-th column. Define Ciijj to be the matrix obtained from C by deleting both the i-th row and column and the j-th row and column.
The Law of Sines and the Law of Cosines are well-known formulae for a triangle in the Euclidean plane. let’s look at the Law of Sines and the Law of Cosines for a tetrahedron in all three flat geometries.
If we let θkl be the exterior dihedral angle at the opposite edge ij. The following formula is valid for all non-degenerate tetrahedra:
- Asymptotic Analysis of Spin Networks with Applications to Quantum Gravity by Hal Haggard (quantumtetrahedron.wordpress.com)
- Exact and asymptotic computations of elementary spin networks (quantumtetrahedron.wordpress.com)
- Numerical work with sagemath 22: The Hypergeometric function (quantumtetrahedron.wordpress.com)
- The geometry of String Theory compactifications (I): the basics. (mappingignorance.org)