The Classical and Quantum 6j-Symbols, by Carter, Flath and Saito
The Classical and Quantum 6j-Symbols, by Carter, Flath and Saito
The Classical and Quantum 6j-Symbols, by Carter, Flath and Saito
Scott Carter
Daniel E. Flath
and
i~lasahicoSaito
Mathematical Notes 43
1 Introduction
2 Representations of U(sZ(2))
Basicdefinitions ...................... 7
Finite dimensional irreducible representations ...... 7
Diagrammatics of U(sl(2)) invariant maps . . . . . . . . 12
The Temperley-Lieb algebra . . . . . . . . . . . . . . . . 15
Tensor products of irreducible representations . . . . . . 21
The 6j-symbols . . . . . . . . . . . . . . . . . . . . . . . 27
Computations . . . . . . . . . . . . . . . . . . . . . . . . 43
formula for the 61-symbols . . . . . . . . . .
h rccu~sio~l 63
Iteillh~hs . . . . .
3 Quantum sZ(2) 67
Some finite dimensional representations ......... 67
Representations of the braid groups . . . . . . . . . . . 70
A finite dimensional quotient of C [ B ( n ).] . . . . . . . . 74
I
II tum spin-networks to organize the computations. We define the
5 The Turaev-Viro Invariant
6j-symbols in the classical, quantum, and quantum-root-of-unity
The definition of the Turaev-Viro invariant . . . . . . .. 151 cases, and use these computations to define the Turaev-Viro in-
I Epilogue . . . . . . . . . . . . . . . . . . . . . . . . . . . 157
151 variants of closed 3-dimensional manifolds. Our approach is ele-
References 160 mentary and fairly self-contained. We develop the spin-networks
i
from an algebraic point of view.
1 Introduction
1
=I
I
to run through the classical case (which should be more familiar), on triangulations of a 3-manifold while the orthogonality condition
I
I1 and then t o imitate the classical theory in the quantum case. can be interpreted as a Matveev [25] move on the dual 2-skeleton
I Here we give an overview. The set of (2 by 2) matrices of of a triangulation.
I
determinant 1 over the complex numbers forms a group called The Turaev-Viro invariants were based on work of Kirillov
1
SL(2). The finite dimensional irreducible representations of SL(2) and Reshetikhin on the representation of quantum groups [19].
are well understood. In particular, it is known how to decompose This work together with Reshetikhin-Turaev [29] formed a math-
the tensor product of two such representations into a direct sum ematicdy rigorous framework for the invariants of Witten [34].
II
of irreducibles. In this decomposition one can compute explicitly Meanwhile Kauffman and Lins [18] gave a simple combinatoric
the image of weight vectors and such computations form the heart approach to the invariants based on the Kauffman bracket and
of the so-called Clebsch-Gordan theory. The finite dimensional the spin networks of Penrose [27]. Piunikhin [28] showed that the
representations of S L ( 2 ) are the same as those of U(sl(2)) which Kauffman-Lins approach and the Turaev-Viro approach coincide.
II
is an algebra generated by symbols E, F and H subject to certain Some of Kauffman's contributions to the subject can also be
relations. found in the papers [14], [15], and [17]. A more traditional alge-
Furthermore, the tensor product of three representations can braic approach to quantum groups can be found in [30]; in partic-
be decomposed in two natural ways. The comparison of these ular, they discuss from the outset the Hopf-algebra structures.
two decomytosit ions is sornctimcs c,rllctl r r r n ~ ~ , , l ? r i t/)ro,~ll.
q clllfl T icl;ol.isll'q [23] d(\finition of tlic R t ~ s l ~ c t i k l i i ~ l - ~iilval
~ ~ . ainlltb
ov
..
-p tile rccou1)llllg t ,ir c. I , I ~ o \ L I ~
uell~c~erit:, G ~ ' - ~ ~ ~
LJ~C rlllese
l ~ ] ~ ~ l ~ , 1s of a colllbi~~ator~al
nature. The I<auiinian-L~ns[IS] d e l i n ~ t ~ 01o ~ l
symbols satisfy two fundamental identities (orthogonality and the the Turaev-Viro invariants is defined similarly. Neither of these
Elliott-Biedenharn identity) that can be interpreted in terms of combinatorial approaches relied on representation theory. How-
the decomposition of the union of two tetrahedra. In the ~ l l i ~ t t - ever, the remarkable feature of quantum topology is that there are
I* Biedenharn identity the tetrahedra are glued along a single face close connections between algebra and topology that were hereto-
$1
and recomposed as the union of three tetrahedra glued along an fore unimagined. The purpose of this paper is to explore these
l
edge- For orthogonality the tetrahedra are glued along two faces, relations by examining the algebraic meaning of the diagrams and
It
and the recomposition is not simplicial. by using diagrams to prove algebraic results.
The symmetry of the 6j-symbols and their relationship to Here is our outline. Section 2 reviews the classical theory of
I M ~ a h e d r awas for the most part a mystery, until & - a e v and of U(sZ(2)). There is nothing new here, but we
11
I
I Viro 1321 constructed 3-manifold invariants based on the analo- do how the Clebsch-Gordan coefficients and the 6j-symbols
I/ gous theory for quantum sZ(2). The identities satisfied by the are computed in terms of the bracket expansion (at A = 1). In
Gj-symbols are also satisfied by their quantum analogues. The Section 3 we mimic these constructions to obtain the quantum
Elliott-Biedenharn identity corresponds to an Alexander [I] move Clebsch-Gordan and 6j-symbols. In Section 4 we will define the
" r V U n L J L I L U f i U fl1lU WUXIY 1 U M tJJ->YMB(JLS
quantum trace and discuss the recoupling theory in the root of 2 Representations of U ( s l ( 2 )
/'i
I
unity case. Section 5 reviews the definitions of the Turaev-Viro
2.1 Definition. Let C denote the complex numbers. The
I! invariants and proves that the definition is independent of the
I/ triangulation by means of the Pachner Theorem [26]. group SL(2) is defined to be
ii
Acknowledgments. We all are grateful to L. Kauffman and
R. Lawrence for the interesting conversations that we have had. SL(~)= {(; ;) :a,b,c,dEC, a d - b c = l
I
\ \
I
for funding of travel for the first named author and support of 0:
a Conference in Knot Theory, Low Dimensional Topology, and ,,(,)={(; i) :a,b,c,di(:, a+d=n -
Quantum Groups in Mobile in 1994. C. Pillen, B. Kuripta, K.
' 11
Murasugi, and R. Peele provided us with valuable information.
Jim Stasheff read a preliminary version of the text and provided
This is spanned by E = ( ;),.=( a =
CL
-8 111 have shown to us over the years.
geneous ~ o l ~ n o m i aof
l s degree ( r + s ) in x and y into the tensor proof.1f W is an SL(2)-subrepresentation of V3, then W is also
product of ( r + s ) copies of the fundamental represelltation space. invariant under the action of the algebra sl(2) that is given above.
The tensor product V 8 W of representations V and ]/V illherits Therefore, it is enough to show that the representation of sl(2) On
an action via g(v @ W ) = gv 8g w where v E V and w E W . ~h~~ if vj is irreducible.
I' denotes the fundamental representation space, then v@(T+s)is The matrix E acts by sending a weight vector to one of higher
also arepresentation space. Furthermore, the image of the space of weight F sends such to one of lower weight. Since the image
~olynomialsconsists of the subspace of tensors that of anv non-zero vector under powers of E and F spans V37 this
fixed under the! action of the permutation group on
representation is irreducible.
the tensor factors of VB('+"), and this space is stable under the
Remark. In the sequel, it will be more convenient to work with
action of SL(2).
the universal enveloping algebra U(sl(2)). This is an algebra gen-
It is customary to let ~j denote the set of homogelleous poly-
erated by symbols E , F , and H that are subject only to the rela-
nomials of degree 2 j = r + s where j E {0,1/2,1,3/2,. . .). Note tions E F - F E = 2H, HE - E H = E, and H F - F H = -F.
that v1I2 is the fundamental representation, and V 0is the trivial
The relations are motivated by the properties of the Lie bracket
10
iir REPRESENTATIONS
OF U ( s l ( 2 ) )
should be indexed by
H v = jv and [ H ,F ] = - F , we have H V , + ~= H F v , = -Fur +
+
FHv, = ( j - (r l ) ) ~ , + ~ ; vT+l has weight ( j - ( r 1 ) ) .
thus +
8 Furthermore, we inductively assume that there are constants
e3,m = 5J+m Y 3-m. y, such that Ev, = y,v,-1. By using the relation [ E , F ] = 2 H ,
+
we have that E V , + ~= E F v , = 2HvT F E U , = ( 2 ( j - r ) Y T ) ~ T . +
The first subscript of e is the highest weight of the represen- Hence ?,+I = 2 ( j - r ) + y T ; since yo = 0 , we have y, = r ( 2 j - r + 1).
tatloll <111dind~ta f t 5 t h t tl~rnel~slon
of thc rcprt~.;crltdfioll 5pr7(t\
Yo\\, , 0 fol , o n ~ cI I,c~c,l~l\c.I f * I ? f n r t e t l ~ m r . n s i o ~and
~,~\
(dl111jl I ) = LJ $ 1) wlllle the sccond ~~ldlcates
tile icelght of the vo, v l , . . . are eigenvectors for distlnct elgenvalues of H. Suppose
vector. Note that j and m are both half-integers and that j +m that v, = 0 and v,-1 # 0. Then E v , = 0 = r ( 2 j - r + l)v,-1. So
and j - m are integers. In this notation, j = ( r - 1 ) / 2 E {0,1/2,1,3/2,. . .), the subspace of W generated
by vo is spanned by the linearly independent vectors vo, . . .,v,-1,
Ee3,m = ( j - m)eJ,m+l,
and this subspace is isomorphic t o V J .This proves (a).
Fej,m = ( j + m)eJ,m-17 (b) Let W denote a finite dimensional irreducible represertta-
tion of U(s1(2)),and let w be a non-zero eigenvector of H . Let the
and
integer r be such that E'w # 0 while E'+'w = 0. Then v = E'w
Hel,m = meJ,,.
satisfies the hypotheses of (a). Hence W = V J where H v = jv.
2.2.3 Well Known Lemma. (a) Let W denote a finite 2.2.4 Theorem. Every finite dimensional representation space
dimensional representation space for the algebra U ( s l ( 2 ) ) . Let E for U(sZ(2))decomposes as a direct sum of irreducible representa-
W denote a non-zero vector that satisfies:
tions.
1. E v = 0.
I Proof. See [33]or [8]for example.
2.3 Diagrammatics of U ( s l ( 2 ) )invariant maps. The Pen-
rose spin networks facilitate the computation of U ( s l ( 2 ) )invariant
maps via diagrammatic techniques. At the heart of the networks
are three elementary maps U, n, and / that are defined in Sec-
3. (1 fg U ) : v1I2-+v1I2
(I fg n ) 0 (U 8 1) = ( = ( n 81) 0
tion 2.3.1. Their relations are described in Lemma 2.3.2. The
networks or spin-nets will consist of trivalent graphs embedded
under the identification of C ,g, v1I2= y1l2fg C = v 1 I 2 .
111 i
in the plane with non-negative half-integer labels on the edges.
P
I ,lit
170 + ~ 1 1 ,g,
2 ~ 1 1 2 , , : v 1 1 2 fg ~ 1 1 +
2 vO, : v 1 / 2 fg ~ 1 1 4
2 where as before we identify C 8 '[fl/2 = ~ 1 18
2 c = 1/1/2.
i l f 1/2fg171/2, and I : v1I2-+ v1I2that are defined on basis elements
I / /
(and extended linearly) via
I
X(afgb)=b@a for a , b € { x , y }
6. flou:C-+C
where i = G.Finally
is multiplication by -2.
] ( a )= a for a E { x , y ) .
Proof. Items (I), (2), ( 3 ) and (6) are elementary computations.
2.3.2 Lemma (Penrose [27]). Item (4) is a general property that holds for any bilinear. form n;
similarly, item (5) follows for any "co-bilinear" form U .
1. The maps U, n, X, and ( commute with the action of U ( s l ( 2 ) ) .
2.3.3 Remarks. Penrose and I<auffman introduced these
2. The fundamental binor identity holds:
maps in a diagrammatic context. The domain of a map repre-
=I fg 1 + (U o n) : v1J2
8 v 1 I 2 -+ v1I2 8~ 1 1 :2 sented by such a diagram appears at the bottom of the diagram,
16 'THE CLASSICAL
A N D Q U A N T U~M
~-SYMBOL,S I
and
I The key observation about the diagram algebra is that ~ l a l l a f
(1
isotopies of arcs (that are properly and disjointly embedded ill
.-
-z
i
-
hk H ( ...
-
A
I
-nL+ -..I.
I 21-L-1
a rectangle) are generated by the topological moves that corre-
spend t o (a) the relationship depicted in Lemma 2.3.2 (3) and (b)
example, in the illustla-
.. ,- i l l gant critical l>ointq.
: . , r c ~ l c l l d n ~disf
tloll above the Criticdl p01111~~ e l ~ l e ~ e l ~1t11l lCl dgl l ] ) ~ l ~ i l (I0'
11~ ~ '( / "
The image O(I) is the identity, and for k = 1,.. . , 2 j - 1, the gen- text, [31] for details. Let n = 2j. Since dim (TLn) = Catalan(n)
erator hk is mapped to the composition Uon where these are acting we must prove that dim (B(TLn)) = ( T ) / ( n + 1)- The binor iden-
on the (k, k + 1) factors of the tensor product as in Section 2.3.1. tity shows that B(TL,) = b(C[Cn]), where @ is the linear ex-
tension of the representation defined in the remark immediately
il I
Proof. It is necessary to check that O respects the defining rela- above. We will establish that dim (@(C[xnI)) = (',") /(n + 1). The
I
tions (1-5) of the Temperley-Lieb algebra. The calculatioll follows representation 6 is decomposed as in [33]. Namely, as En repre-
from the diagrammatics of Lemma 2.3.2 part (3). J -I
2.4.2 Lemma.
(i.e. T = (r,s), n = r + s, and 0 L r I s);
Let 6 = -2. f i r a n y j E {0,1/2,1,3/2,. .I, ,
lllclt
(2)t h e s u l 1 3 $ a ~ d \ITrr is t h e irrc~I,,cil,lc rel)resentatioll of
i 5 11 ~ J ( ~ ~ I ~ o I I J O ~( 1 ~ ) / I ,,,,
I ~ ~ ~ 1~, , , , l / c , / , o , j q J , J y2! ,,,, 2 ,
corresponds to the toung lldllle 1 ;
letters zlzto TL23 that 2s yzven by p(ak) = I + hk where ak zs the
transposition that interchanges and k + 1. (3) the exponent d(T) is a positive integer that, incidentally, is
equal to the di~nensionof the representation of GL(2) correspond-
Proof. Clearly, the images (under p) of distant transpositions ing t o the Young frame T.
, commute. Furthermore, jyow c [ x n ] is a semi-simple algebra because the group En is
l1
/I1
p(ukokklok) = I + h i + h x t ~+ hihi51 + hkil hk = p(okklokok*l 1.
finite. The Wedderburn theory of semi-simple algebras [g], applied
to C[Cn], asserts that as algebras
I
Let G(r, n - r ) = n(,,,-,) denote the number of legitimate then there is an action given on the tensor product by g ( v @ t u ) =
filling.; of the Young frame nxilh I, I~n~c > if 1
nri 1 1101
~ l o r ? ] J.(IU. ;I nd 911 ~ I L ) . .\1i element .Y in the assoriatctl 1,ic alge111.a. d ( 2 ) . a c t s
n- 1. boxes on the top. For a two ron. rectangular array, on tensor protluc~svia the Leibniz rule, . Y ( uLI ru) = St?) i u$ I ,
1
Each term in the sum on the right is the square of the number
(P3 : X I . ' ' ' ' x2j ++ - p C xu(1) @ . ' @ Xu(2j)
Observe that +2j 0 + 2 j = 4 2 , So that this map is indeed a projec- 2.5.3 Lemma.
:(~'/2)@23 - (~1/2)@2a ( ~ 1 / 2 ) @ ~ ~
I
2.5.2 Definition. Let u= u : c ~ 1 1 2a ~ 1 1 2 . H~~~~~
defined C -+ ( v " ~ ) @ ~ ( " -define
~), 5 to be the composition
where the sum is taken over all j such that ( a , b, j ) is admissible. Example. Consider v ~/~@ v ~ / t~
According .
o Theorem 2.5.5,
Furthermore, i f ( a ,b, j ) is an admissible triple, then any U ( s l ( 2 ) ) this tensor product decomposes as the direct sum of V 0 and V 1 .
invariant map V j V a @ V b is a scalar multiple of pa @ pb 112,112
v
+ o
The map coincides with U while
0 q5j. Finally, 0
and finally
y 112,112
I (~xY)=~I~(x@Y+YBx).
for (Pa @ 1
.. ( ,' (4. ( x ' J ) ) ) follows by cornputatiol~using
in the sum
3
# 0 for ( a , 6, j ) admissible. The tensor
8 pb (y 3 (A (e3,t)l) = u+v=~
c:;t:ea,U 8 eblv.
product V a €3 vbhas dimension (20 + 1)(2b+ 1 ) while the image 2.5 -7 Lemma, The Clebsch-Gordan coeficients satisfy the fol-
of V 3has dimension ( 2 j 1). Since +
lowing recursion relation
x(2j + 1 ) = (2a + 1)(2b+ 1 )
3
( j+t = ( a + U + l)~:;b:,v,t+l t (b + v + l)'::b:l,t+~.
+ l)ct:%
( j t t ) ! ( j- t ) ! ( a + b - j ) !
( ( 3 ) is the only s p a c e of v 8 v is
P
isomorphic to v'.
Consequently every U ( s l ( 2 ) ) invariant
+ + +
( a u ~ ) ! ( b v + w)!
z!w!(a - u - z ) ! ( b- v - w ) ! '
V3 --+ V a 8 V bmust be a multiple of this map. Z,w:~+w=3-t
1 11
26 THECLASSICAL
AND QUANTUM
6j-SYMBOLS REPRESENTATIONS OF U(~1(2)) 27
Y=----T
We represent x (resp. y) by a white (resp. black) vertex with
a string coming out from the top: 6 (resp. ). Then the neight
1
j+t j-t
I These conventions have been known to physicists (see 1161).
E It is convenient to introduce similar diagrams for dual vectors.
I Consider the dual vector space (v1l2)*. We represent the dual From the closed formula given in Lemma 2.5.7 for the Clebsch-
basis vectors x* and y* of tkis dual space diagrammatically by Gordan coefficients, one cannot easily see the symmetry properties
11. 7 aid 7 , respectively. For parallel strings representing tensor
"P<
( I2a €3 ','
--
f
fiere pabc = pa @ pb @ pc is the tensor product of the multiplication
maps and d3 : ~j -+ (v1I2)B2j sends a a homogeneous polynomial
in x and y to a symmetric tensor.
k
Ii1 lIi Proof. The triple tensor product Va @ vb @ VC decom-
'I (v1I2)@2k ( v 112 ~ 2 @a ( 112)8 2 6 @ (~.l/~)@2c poses as ($,Vn) €3 VC = $,(Vn €3 VC) where the direct sum
is taken over all n such that (a, b, n) is admissible, by Theo-
/ 11 /I
y.'
I I for various values of j. Second, consider the composition
rem 2.5.5. For each such n, (Vn @ Vc) contains at most one copy
of vk.Thus h ~ m ~ ( , ~ ( ~ V
) )a (@vv~b@VC)
, decomposes as a direct
II~I
11 If
=( y 812C)o y nc
k
ilarly, it decomposes as a direct sum of the 1-dimensional spaces
V ~€3, V3).
h ~ m u ( ~ i ( z ) ) (Va
I.
I &
I 2.6.2 Definition. Define the Gj-symbol to be the coefficient
for various values of n.
The values of j and n are restricted so that (b, c, j ) , (a, j , k), { ] in the following equation.
' '
(a, b, n), and (n, c, k) all form admissible Lrlples. Alternatively,
if one of these triples is not admissible, then we may declare the
corresponding map V to be the zero man. (Recall
,------
is admissible, then so are the triples obtained by permuting a , b,
t h a t if f n I-
"&.A "
h ;\ I Pa @ Pb @ PC'
a V b A ) a\ b\/c)
as the indices j and n range in such a way that (6, c, j ) , (a, j,k),
By convention, { a b n
} = 0 if any of the triples (0,c,j),
1
I/
In the 'paces h o m ~ ( ~ l ( 2 ) )(Vk7Va @ Vb @ Vc), we have the two
bases that are defined by these trees, and the ~ i - ~ is ~the ~ b ~ l
change Of basis matrix. For example, consider the case when =
= =
= l/2- One can compute direct]y from the definitions
that the possible values for j and n are 0 and 1, and that:
{ :;::;; ] -lP, =
Recall that a spin-net is an embedding in the plane of a graph
with edges labeled by non-negative half-integers in which each
{ :;:;;: }
vertex has valence3. The three edges coincident at a vertex must
form an admissible triple. The half-integer labels represent the
= 1,
spin carried by an edge. When we need to emphasize the number
and
{ ti; :;:P } = 3/47
of strings represented by an edge (and hence the number of tensor
factors of the fundamental representation carried by an edge), we
will label the edges with natural numbers that are twice the half-
{ ;;; ;:; } = 1/2. integers. The suffers from this minor inconsistency, but
n,lI ab
= +2J ( /a+j-b 8 a+b--j
n 8 /j+b-a ) 0 (42,
+2b) .
the vertices. Furthermore, some edges may be marked with 'ym-
metrizers: +. More precisely, we include valence 2 vertices in
I
3
The compositi~nirj 0 which the two incoming edges have the same hbel.
ab
0 (+a 8 mb) : va 8 vb ,vj is also
U(sz(2)) invariant.
~h~ principal results of the current section are the orthogo-
2.6.3
computations. ~h~ elegance of the nality and the EEott-Biedenharn identities that are satisfied
spin-net notation that we have developed so far is the ~ j - ~ ~ We
~ will
b ~give
l ~proofs
. of these relationships (and
it facili-
tates Otherwise tedious calculations. There is others) that are simply manipulations of diagrams. To this end
slight disadvan-
tage in that the calculations are performed in the tensor power, we state a diagrammatic lemma.
32 THECLASSICAL
AND QUANTUM
6j-SYMBOLS
1. (In 8 ; ) 0 ( 6 8 l , ) = ~ n = ( f i ~l n ) o ( l n 8 6 ) .
Proof. Define
Therefore,
THECLASSICAL SYMBOLS
A N D QUANTUM REPRESENTATIONS
OF U(sz(2)) 39
Figure 5: A movie of 6j-symbols and the Elliott-Biedenharn iden- some of the symmetry properties of the 6j-symbols in the current
tity (right hand side) normalization, and we find a normalization that has full tetrahe-
dral symmetry.
44 THECLASSICAL
AND Q U A N T U M 63-SYMBOLS KEYKESLN'l.A'l.lVNS O F U (S1(L)) 45
2.7.1 Topological invariance. Let a spin-net be given. This Proof. This follows from the remarks 2.6.5.
network is a graph with its edges labeled by non-negative half-
2.7.3 Lemma. The value of fi: ( v ~ / ~ ) @@"( v ~ / ~ ) @C~ is
-i
integers that has only 2-valent and 3-valent vertices. Two edges
given by
incident at a 2-valent vertex must have the same label, and if
edges with labels a, b, and j are incident at a vertex, then the
triple (a, b, j) is admissible. Choose an embedding of the spin-net
into a rectangle such that the endpoints of free edges (if any) are if ~ j = f jforsome j = 1, ...n,
in(- l)#{"'"k'~) if {xj, fi} = {x, y} for all j = 1, . . . , n
on the top and bottom of the rectangle. Suppose that the labels
of the edges that appear on the top are a l , . . .,a,, and those that
appear on the bottom are bl, . . .,b, where these labels are read
1 where x j , q E {x, y} for all j = 1,. . . ,n.
2.7.2 Lemma. The map does not depend on the isotopy Proof. Recall that e,,, = xa+" y , that a similar formula for
class (rel. boundary) of the embedding of the given graph in the eb,, holds, and that the image under 4 of a weight vector, ej,t, is
a symmetrized version of it.
THE CLASSICAL
A N D QUANTUM
6j-syMBOLS REPRESEN lAllUlV3 U p u \J1\"J/
=x 2 ~ ia+b-~ia+b-~( - I ) ~ - u
u+u=1
( -])'-i'
(c,
--
+ 1, - ? ) ' ( ( L t 7 1 ) ' ( h t !))I
.-
(2a)!(Lb)I
Proof. Part ( 1 ) is a direct calculation that can be achieved by
evaluating either side on the highest weight vector, 4J( 2 2 ~ ) . part
( 2 ) follows from ( 1 ) and Lemma 2.7.2 by rotating the vertex of the
right side of the diagram for ( 2 ) 180'. Parts (3) and (4) follow by ( ( a f b - j)!)2(a+b+j+l)!(a+j-b)!(b+j-a)!
on the tensor products of appropriate weight vectors. +
( 2 ~ l ) ! ( at b - j ) !
( a + b - j ) ! ( a + j - b).(
1 b +j - a)!(b +j + a + I)!
(2a)!(2b)!(2jt I ) !
2.7.6 Theorem.
~h~ next to the last equality is a combinatoric identity. The
proof that follows was indicated to us by Rhodes Peele. Consider
Alternatively, B = UeBe where Be = { f E B : f ( a + j - b f 1) = 2.7.7 Corollary. Let (a, b,j) denote an admissible triple of half-
the set f -'({l,. . .,!)) since the inverse image must exclude the
+
integers in the closed interval [a j - b + 1 , 2 j+ 11 and include the
integers in the closed interval [I, a+ j - b]. Each such set can be
arranged in l ! distinct ways. Furthermore, f -'({l+ 2,. . . ,a + b +
j + 1)) is determined by f -l({l,. . .,!)) and this can be arranged
in ( u + b + j - e)! distinct ways. So that
above equation. This completes the proof. labeled m and p attached to the top edge while the edges labeled
The spin-net version of Theorem 2.7.6 is indicated in Corol- s and t are attached to the bottom. By Lemma 2.7.2, the eval-
lary 2.7.7. Here we have labeled the spin-nets with the number of uation of the spin-net remains the same when the cross bar of
52 THECLASSICAL
AND QUANTUM
6j-SYMBOLS
the mH
s t
is rotated clockwise 180' while the end points of the 2.7.10 Lemma. Let TET(a, b, c, d,e, f ) denote the value of the
boundary remain fixed. spin-net depicted below:
Having performed such a rotation, recouple; the 6j-symbol
I
1 Then,
"-- -
1;
i
2.7.11 Remark. In [18] Kauffman and Lins give a closed for-
gives that isoto]
I mula for the value TET(a,b,c,d,e, f ) in both the case at hand
[! and in the quantum case. Furthermore, there are methods to corn- affect the spin-net evaluation. Lemma 2.7.5 indicates how the spin
Pute the values of the 6j-symbols based on the Efiott-Biedenharn net evaluation changes when a crossing is introduced. Changing
I
11 identity [2] or the recursive properties of the projectors [24]. rn orientations can be achieved by twisting the trivalent vertices, and
Section 2.8, we define four fundamental 6j-symbols, and use their strings through as indicated in the diagrams below.
by
11 values and the ELliott-Biedenharn identity to compute the values Here we have indicated crossing information So that the reader
of the 6j-symbols in general. can see how to pull the diporam nn t h e r i ~ h tout to reverse the
ei
I'
,
orientation of the projectec
i* 2.7.12 Lemma. The symbol, .. .
I ---
= T E T ( ~6,, c, d, e, /I/ J I W , 6, I)W, e, m a , c, ~ ) o (c,Be ,) ~
8
is invariant under all permutations of its columns and under
the exchange of any pair of elements in the top row with the
[ 1 :]
corresponding pair in the bottom row. Equivalently, the symbol
(I
({a, b, f >,{a, c, d>, {b, c, e l , {d, e, f}}.
(l1i Proof. This set -is the set of vertices of a tetrahedron with
[: r ]
edges hbeled by half-integers a, b, c, d, e, f , such that any element
/I B~ Lemma 2.7.10, the normalized 6j coefficient
in the set forms an admissible triple. We choose an embedding of
the 1-skeleton of this tetrahedron into a rectangle (see for example is the value of the embedded tetrahedral network divided by
the diagram below). This embedded labeled graph is a spin-net the factor J(@(a, b, f)O(d, e, f)@(a,c, d)@(b,c,e)l which possesses
I
I and as such determines a U(sl(2)) invariant map c + c (such tetrahedral symmetry by definition. This completes the Poof.
56 T H EC L A S S I C AALN D Q U A N T U M
6j-SYMBOLS
Elliott-Biedenharn:
2.7.14 Theorem.
= x n( - 1 ) 2 n ( 2 n + 1 d) [ bj f nc ] [
a n p
d k j ]
~ L A S S I C A LA N D QUANTUM
6j-syMBOLS REPRESENTATIONS O F U(d(2))
P r o o f o f p a r t (6).
Next we observe that part (2) follows from (I),part (4) follows
2+ 1 / 2 112 x - 1 / 2
g - 112 e - 112 f + 112
2- 112 112 x - 112
g - 112 e - 112 f - 112
(e+c- j)(y+h-~+l)
This pushes everything back t o the case
(e- c + f ) ( e + c + f + l ) ( f + d - g)(g + h - + 1 )
( 2 e ) ( 2 f)(% + 1)(2f + 1)
(e+c- f)(f -d-g)
( e - c + f ) ( e + c + f + l ) ( f- d + g ) ( f + d + g + l )
+
( 2 e ) ( 2 f) ( 2 f +
1)
The coefficients A, B , C , and D are values (with suitable
choices for j and k ) of the product
I)
efficients and the 6j-symbols by means of the spin network anal-
3 Quantum
!!/: ysis of Penrose [27] and Kauffman (16, 181. The diagrammatic or
3.1 Some finite dimensional representations. In Set-
F $1 graphical method seems t o be well known [3, 21 but only with the
tion 2 we showed how the tensor products of finite dimensional
work of [19]and its sequels has this been brought to the fore-front
of sZ(2) can be decomposed.
of the theory. The identities 6.16-6.19 given in [19] for the repre-
In this section we mimic this classical theory in the so-called
/ I/ sentations of the quantum group are given above (for the classical
quantum case where the representation spaces are spaces of hO-
ii case) as Theorems 2.6.7, 2.6.6, and parts of Theorem 2.7.14 (but
/
mogelleous polynomials in two variables that only c ~ m m u t eUP
not respectively).
to a parameter. ~t is these representations that give invariants of
il The fact that these proofs are expressible in terms of simple
'$dimensional manifolds, and physical applications are found in
h
diagrammatic manipulations points to various levels of generaliza-
statistical mechanics where they provide solutions to the Yang-
tion. In the next section we explore one such level: knot theoretic
Baxter equation.
quantization, in which the braid group replaces the permutation
Recall we have ~ o u l ~I IuI C U U L I I J ~ ~r;= y l = - r r u w v A u r r v -- --\-I --
group, and a parameter is inserted into the binor identity. This
V J = {llomogeneous polynomials of degree 2.7 in x and Y). Namely,
notion of quantization coincides with the notion of a quantuln
l f (1 + I ) = 27
Z ~ O I I <~\ \I ( I ( > \ c I < ~ j ) ( l ( \ I>\ . J I I I I I ) O 10
I ~ I , ,-,, <,It</ (, , [, , , + I !>-I
L;[L"~J")=/)I tJ
for example [ll]for further references.)
Some puzzles remain about these techniques. Combinato- ~ )axa-1 y b+l
F ( x ~ Y=
rial identities arise - for example, recursion relations among the
( a - b)
n ( x a y b ) = -xayb.
Clebsch-Gordan coefficients. Are there simple discrete probabilis- 2
tic reasons for these formulas, and if SO, how are the more elemen- n.. ...:+L +Lo nnt-ltinn adanted
h o t t ~ ~ to the theorv of weights,
tary combinatorial formulas expressible diagrammatically?
In the next section we turn to the finite dimensional repre- el,m --
.- z3+m
Y3-m
sentations of the quantum group Uq(s1(2)).We will see the direct
analogy-with the classical case as the theory develops, and in Set- Eel,m = ( j - m)ej,m+l
-
tion 4, we examine in detail the special case when the quantum
parameter is a root of unity.
Fe3,,,, = ( j + m)e3,m-1
Hel,m = me,,,
67
Ill T H ECLASSICAL
A N D QUANTUM
~ ~ - S Y M B O ~ ~
/I
We want to "quantize," which, in our context, means introduce second, the action of E , F and K is given by
a parameter. Roughly speaking, we want to replace integers n 20
EeJ,m = [ j - m]e~,m+l
by
[nlq = 9n-1 + qn-3 + . . . + q-(n-l) = qn - q-n +
Fe3,m = [ j mIe3,m-1
q - q-l '
1
A
such that
I{2 - I{-2 11 - ,,q2H - q-2H and FIi. The identities for the l i e brackets follow by manipdat-
[E, Fl = -
4 - 4-I Q - 4-I ing the rational functions of q that result. To prove irreducibility,
C . . ^ " _ , __.
Ti I? = q E
r ,
lilese[orc, tile illla,ge ally null-Lc.!.o \cCli)l ~ l i ; i ~ ( 'Ii ) O \ ~ ( ' l ~ 1:
liF = y - l ~ ~ <
and F spans vi.
where [E,FI = E F - FE. The quantum group Uq(s1(2))is the al- o n e of our present goals (Theorem 3.4.1) is to give concrete
gebra over C that is generated by E, F, I<,and K-1; the elements realizations of the abstractly given representations V i . The real-
i:
are subject to the relations specified above. For the tirne being, izations will be !generated from the fundamental representations
we will not deal with this algebra directly, but instead we v 1 l 2 by tensor products. We can take tensor products of quantized
work with it via its representations. ~ h u we
s will only consider
representations because the algebra Uq(s1(2))has a comultiplica-
the entire algebra (and co-algebra) ea: post facto.
tion. Rather than specifying the comultiplication, we wig specify
the action of u q ( s l ( 2 ) )on tensor products of representations; from
3.1.2 Theorem. . The representations vj -of s1(2) be quan- can these formulas the comultiplication can be derived.
tized i n the following sense: Let q # -0,1, -1 E C . Let j
{0,1/2,1,3/2,. . .), and let A E C , where A2 = q. ~h~~~ is 3.1.3 Theorem. Let U and V be representations of U q ( ~ l ( ~ ) ) -
+
a ( 2 j l)-dimensional representation ~i
of ~ , ( ~ 1 ( 2given
)) ab- ( A always,
~ # o,l,-l). Then there is a representation of
stractly as follows: First, a basis for V; is ) ) U 8 V given by the following formulas-
~ , ( ~ 1 ( 2on
SYMBOL^ '1
A N D QUANTUM
THECLASSICAL 71
as follows:
?/ @ x I--+ -iAW1,
and
-1
Define U A = U : V j = C -
Y@Y++O.
v;" @ vlI2by the formula
Observe that ( A ) = A-1 [ ] 4- A [ 1 1 ] .
@
Let the negative crossing be defined as follows:
rA(sk) = -/
I ...IY
n (x@x)= nl-J (Y@Y)=~,
k-1 n-k-1
and
4 *+ f o r k = 1,2 ,..., n - 1.
li
iI
I
I@
:& 2 and where 6 = - ( A 2 f A-') for some A #0 E C . Recall
,j;) crossing via the bracket identity and associating the loop value
ig that T L n is generated by elements I and hk for k = 1,.. .,n - 1
- ~ - 2 - ~2 to each of the simple closed curves that results in
that are subject to the relations given in Section 2.4.
any of the daughter diagrams. The bracket is an invariant of the
3.3.1 Theorem. For n 2 2 and A # 0 E C there is a surjective regular isotopy class of the diagram, but not of the knot type A'-
algebra homomorphism TO obtain an invariant of K, define
--
PA : C [ B ( n ) ]-, TL,(-[2]) L ( K ) ( A )= ( - A ) - ~ ~ ( ~ ) ( K )
that is defined on generators as f o ~ l o ~ ~ : ..
76 THECLA'SSICAL
AND Q U A N T U M 6j-SYMBOLS QUANTUM d(2)
It is clear that the representation r~ of the braid group defined 3.4 A model for the representations Vi. Let
in Theorem 3.2.5 factors through PA. The algebra TLn(-[2]) is
represented on 2vI@
();"' via the map
LA c en(^;/^)
as in the classical case but with = . We have the follow- be the two-sided ideal generated by qx €3 y - y @ x (where q = A2,
A
ing result:
as always), and let
3.3.4 Theorem. The representation ~ 2 A =j LA n (VA112)@ 2 j .
Then there is an isomorphism
112 @23
" . l ( x 8x 8 . - -8x) =
representation of TLn(-[2]) on ( ~ 1 ' ~ ) ~For Because IA(2j ) is an ideal in T L2, (- [2]) whose action on (VA )
x @ x @ . . . @ x but
, X @ X x . . . @ x .)
@ - - . @ x@ I A ( ~ ) ( x @@ commutes with the action of Uq(s1(2)), it is clear that L? is a
78 T H EC L A S S I C AALN D Q U A N T U M
6j-SYMBOLS
subrepresentation of ( ~ l / ~ )for
@the
~ jactions of all three of T L Z j , 3.4.2 Lemma.
B ( 2 j ) , and Uq(s1(2)). qXayb) = [ a ] ~ a - b - l x a - l Y b+1
1.
3.4.1 Theorem. The actions of Uq(s1(2)),B ( 2 j ) , and T L z j on
A 1@ 2 J /can
(v1I2 ~ ybe described as follows:
3. l i ( x a y b )= AaVbxayb
1. For T L 2 j :
Proof. Notice that v:/' consists of the set of linear combinations
IW = W , hiw = O for all w E (vA~~)@~~/LZ of x and y. Thus E x = F y = 0 , whi1e.F~= y, E y = x , K x = A x ,
and K y = A-lx. These computations form the initial steps of
2. For B ( 2 j ) : inductions that will follow.
We compute, Ii(xBa @ yBb) = ( K x ) B a @ ( ~ y ) =@Aax@"
~ @
S ~ W= A-lw for all w E ( V , / ~ ) @ ~ ~ / L : :
A-by@b = Aa-bxBa 8 yQb where, for example, xga is the tensor
3. For Uq(s1(2)):There is an isomorphism product of a factors of x. Thus the third identity holds.
By Item ( I ) ,we mean that F ( x g a @ yBb) [ a ] ~ ~ - ~ - ~ x@@ ~ - '
- ,. : 1 .;: - j 1 .. II / ' )'???.i,. / 2 i
,
1
4
: Y ~ ~ ~ ( +m o~ d L,t).
First consider the case whe~e = 0. Illcll lllduct 011 (1. I.0'
F ( x B a ) = F(x@~-'B x >
1 projectors,
is depicted as follows:
'j
rn
1 -
TL, t o also be in TL,+k for the rest of this section. Define the
7M
We will assunie, by induction, that +;-l+al+ a l , and
=
Jones- Wentzl Projector, 4: E TL, via the recursion relation:
'-8
that +i-lhi = hk+!-, = 0, for 1 < k < n - 2 the case of +f
being trivial. Then we show that
+a =+A, €3 I + ln - 1 1 / [ ~ ] ( + 5€3~I ) h n - ~ (+fl I)
where
4: = I = id : vii2,y;l2. by applying h, t o the recursion for 4; to obtain hn 0 (+A O 1) =
83
ost horizontal line in the second icon from the left was absorbed
e single vertical strings in the second and fourth icon into the
ring to the left. In this way, the labels on the strings change
om n - 2 to n - 1. (The labels on the vertical strings on the last
on are omitted for type-setting reasons) Furthermore, we have
composition of idempotents. So the above sum reduces to the
- (-PI + En - 11/Inl).
+ [n-l]/[n] n-2
'I'HE A N D Q U A N T U6M
CLASSICAL j-SY
w e obtain hn 0 (4: @ 1 ) 0 h n ( e 8 1 ) = -[n + l]/[n]hn(+f8 11 and the projectors involving n - 1 strings are absorbed since these
by the identity
are idempotents by induction. So far we have shown that +; are
dempotents. Furthermore, 4; # 0 because the coefficient of 1,
among quantum numbers that is easy to verify. Next we use this n the sum is 1, as can be seen by induction.
t o show that +f+; = +An . By induction and by this recursion relation, h k e = 0 = e h k
if k = 1 , . . ., n - 2. Next we compute hn-l+i =
Next we show that these elements are unique. Any given ele-
ment in the Temperley-Lieb algebra can be represented as al, +U
where a is in the ground ring, ,1 denotes the identity, and U E
I A ( n ) so that U is a linear combination of products of the h j .
Suppose that g: = g, is a non-zero element of T L , such that
gnIA(n)= (0). Then g, = a ( ,+M = a21, + 2 o l +M2.
~ In particu-
In the fourth term, the icon that represents (hn-l o 8 lar, a2- a = 0 since In 6 IA(n).If a = 0, then 0 = gnu = g i = g,.
is replaced by the icon representing - [ n ] / [ n- l ] h , ( + , ~ _8~12), Hence a = 1. Thus any non-zero idempotent f n that kills IA(n)
86 THECLASSICAL
AND Q U A N T U M 6j-SYMBOLS
sZ(2)
QUANTUM 87
I
I!
can be written in the form fn = In+U1. Finally, gn = gn(ln+,gl) = 4 First we recall the canonical inductive construction of the set
+
(I, U) fn = f,. This proves uniqueness 0 . =
. of permutations. Let (k, . . .,n) denote the cyclic permutation of
the elements k through n in C,; this cycle (k, . . .,n) can be written
3.5.3 Notation. For every permutation a E C,, define a
braid 13E B(n) as follows. Write a in any way as the product of as a product of adjacent transpositions: (k, . . .,n) = (k, k + 1)(k +
a minimal number of adjacent transpositions (i.e., transpositions
1, k+2)-. . -(n-1, n). To a bijection t : (1,. . .,n) . . .,n), we
-+ (1,
associate a pair (k, tk ), where t(n) = k, t = (k, k + 1,. . . ,n)tk, and
t
P4 of the form ak = (k, k + I)), and let T ( a ) denote this minimal
tk(n) = n so tk can ble regarded as a permutation of (1,. . .,n - 1).
t I
number. Then lift the product to B(n) by replacing each of the . -
In this way, the minimal numbf!r of adjacent transpositions that
I*
14
transpositions ak in the product by the corresponding braid gen-
erator s k . The minimality of the product for a insures that the lift
it takes to write t is 4equal' to
' m
" e minimal number that it takes to
tr write tk plus n - k.
I b will depend only on the permutation a and not on the particular
Consider an ascellding path that starts from the lower left and
14 I*' product representation chosen.
travels upward through the triangle depicted below.
Diagrammatically, the transposition ok is represented by n
'I arcs running down the page in which the kth and (k
cross. The corresponding braid generator
13v
sk
P r o o f of Proposition. We must show that the formula above (0, I), (1,2), . . .,(n - 1,n). In fact, such descriptions of permuta- .
defines an element that kills each of the hk, 1 < k < n - 1, and tions by paths always use the minimal number of adjacent trans-
that the coefficient of ,1 is 1 when the sum is expanded in terms positions necessary to write the permutation.
of the standard basis for the Temperley-Lieb algebra. The proof We compute the coefficient of 1, in the sum ~ u E z , , ( ~ - 3 ) T ( u ) 3 .
we present follows [18]. Rarh n ~ r m n t a . t i n nin t h e sum contributes a term of the form
88 THECLASSICAL
A N D QUANTUM
6j-syMBOtS UANTUM ~1(2) 89
?.
A - ~ ~ to
( ~the) coefficient of ,1 by the bracket identity. we need 3.5.5 Remark. The formula given above for the projector in-
the computation icates precisely how 4
: is analogous to the classical symmetrize
!.',
ing projection 4,.Moreover, the classica~projection satisfies the
= A*~T(o).
same recursion relation with quantum integers replaced by inte-
i<
a€Cn
gers. such a replacement is an evaluation of the quantum Pro-
To prove this, we use long multiplication to multiply out jector at A = 1, and for that value of A, positive braiding is
I A ~ ( ~[ n- ~~=
!) indistinguishable from negative braiding.
When the Jones-Wentzl projector +,Ais defined ( e - g . whell A
is transcendental), it is a nonzero central idempotent such that
- (A4(,-') + A4tn-') + . . . + A ~ ( ~ +- .~. .)+ 1) . . .( ~ +41)
42.IA(n) = (0). So the Temperley-Lieb algebra has a direct sum
The terms in each of the factors are arranged along the horizon- decomposit~onas scalar multiples of the Jones-Went21 projector
tals in the triangular array that is depicted above. A term in this and the ideal I A ( ~ ) :
expansion corresponds to an ascending path. Moreover, the co-
efficient of
TL,(-[2]) = c+!(33 Ia(n).
when like terms are combined, is the number of
paths that have k: points to their right, and tllis is the number of lve have the direct sum decomposition
r)(:~,t~l~ ~ t a t1 1 1 a t 111itti111i111,~
intis IISO 1; ;i(~,ji,c(tllt I , . ~ , ~ , 5 , ~ ~ ~ s j ~ j ~ l ,.~.i,,~,>
,5~ 1 1 2 ),.:.,, d, 1,;
(\,i - +;A(\,;/~),<JIL
-
coefficient of I, in our expressioll for 4
: is 1.
Now for any given k, the minimal product representations of for representations of B(n) and Up(sl(2)) where
the Permutations can be chosen in such a way that the set of
L; = I A ( ~ ) ( V112A)8"
all permutations is partitioned into a set of words W that do
end wit11 a k = (k, f I), and the set Wok. (For example, is the kernel of the projector 4:. This leads us to the following:
/ the triangular scheme above does this for k = 1.) Clearly, these
-
i11 3.5.6 Definition. A Uq(s1(2))-equivariant map
two sets have the same number of elements, and the number of
i $j = df ;": V: 112 8 2 j
(vA )
transpositions that it takes to write an element wak is one more
cause 6khk = --A3hk, and SO the contribution of word w E w is This formula only makes sense when [2j]! # 0, and thus the
canceled by the contribution of wak. A similar argument value of the quantum parameter is important. When it is de-
that 0 = hi, ( Z , E ~ ~ ( A - ~ ) T (.~This
) ~ ) completes the proof. fined, the map $j is a lift of the map w j (which was defined in
90 THECLASSICAL
A N D QUANTUMSYMBOLS ) QUANTUM d(2)
where where
for R =
t , ( S ) is the minimal nunzber of adjacent tran,spositions that it
~ ( I L ' T . ~112 ~ ~ ~ o ."
i ~!m
c - !/?r .~i!/,sr/ fn -L 1 . . . ..!! -!.-1): (, j. 1 , ; . ! P r o o f of Proposition 3.5.7. .4ssrilning Lemma. 3.5.9 nrc.indrlct.
1 on b. In case 6 = O the result Sollows by usi~lginductioll on ,n a.liti
.
#,- the recursion relation for the projector 4.:
X I/2 823
For general values of b we use the maps 4j : V i -4 (VA )
$
defined above, where j = n/2. On the one hand,
+
$J(Fe,,m) = h ( Z j m ] e , , m - ~ )
q y@~-m+l1.
= [ j + m]~(j+m-l)(~-m+l)+~(x@j+m-l
n
C q-2tn(R) = 9 -k(n-k)
R C {1, ...,n}
n n
The map n=nA is defined dually, and is also in analogy with
the classical case.
3.6.4 Lemma.
Also we have,
((x18..-@xn)@(~n@...@Z1)) . .
={O if~~=~~forsomeIc=l,...,n
(iA)n-2S if {xk, Zk) = {x, y) for k = 1,.. . , n
where xk, Z k E {x, y} for all k = 1,2,. . . , n and s = #{k : xk =
Y).
96 THECLASSICAL SYMBOLS
A N D QUANTUM
QUANTUM sl(2)
97
(v:'~)"~' -+ ( v ; ' ~ ) @ ~ ~~
@ 18
v)'(:~~
' is defined and
I j
fi(y@y@x@x)=(i~)-~.
- c
u+v=j
i(b-~)-(a-~)A(b-u)(btutl)-(a-u)(a+~+l)
v
. '
ab (4,
i
(ejj))) follows by computa,tion using Lemma-3.6.4,
/
Ima 3.6.2, and Proposition 3.5.7.
-
J
1s
where Im is the identity map on m tensor factors of Vi/2 (Cf. defined and non-zero for all 3 such that (a, b, j ) is admissible and
Section 2.5.4).
that the representations Vi are irreducible since j 5 a -k b < r / 2 *
i The argument that V j @ VA splits as a direct sum of the images 3.6.10 Lemma. The quantum Clebsch-Gordan coefficients sat-
Ir of the V j follows the same lines as in the proof of Theorem 2.5.5. isfy the following recursion relation
i;
I i
I
The composition pJ o ,/,
3
2b, 2 j ) < r if A is a primitive 4rth root of unity, 7ue have more, u, v, and t are weights of V$, v;, and V;, respectively, and
u+v=t.
/ 1 \
We have maps pa 8 pa 0. Y ab
0 4i : V; -+ V j @ V; when the
3.7 Quantum network evaluation.
sical.case
.
Recall that in the clas-
the key computations were the ev,aluations of the closed
i
triple (a, b, j') is admissible. Define the quantum Clebsch-Gordan "theta-nets" and the closed "tetrahedral" networks. In [18], these
coeficient CZ;;$ to be the coefficient in the sum network evaluations are given in case A = ei"l(2~)and their di-
agrammatic computations can be applied to the case of generic
values of A as well. We use the machinery developed above t o
give alternative computations.
100 THECLASSICAL
A N D QUANTUM
6 j - s ~ ~ ~ ~ ~ ~
i
t
a, b, j, k < r/2.
( a+b-j
a-u 1 $a(ea,u) 8 $b(eb,v)) )
L J
C u+v=j
%
:
Proof. By the assumption on A, the representations V; and V: [a + j - b]![b$ j - a]!
are irreducible. Ther
and when k = j it is a multiple of the identity. Proof. The proof is a yantization of the argument that we gave
during the proof of Theorem 2.7.6. We rely on the quantum combi-
In Theorem 3.6.6
natorial identities stated in Lemma 3.6.2. Furthermore, we recall
weight vector, and in from the proof of Proposition 3.5.4 that
these results and manipulate the expression for the exponent of A
while recalling that A2 = q and obtain the following:
c qk2T(u) = A*"("-1) [I.!
aECn
103
102 THECLASSICAL
A N D Q U A N T U 6j-SYMB
M
where T ( a ) is the minimal number of transpositions of the for an every element of f ((1,. ..,a + j - b)) and less than every
+
(k, k 1) that it takes to write a. +
merit of f({a + j - b + 2,. .., 2 j 1)). We evaluate LEB
q
2T(u)
Consider a sequence 0 = a0 < al < . . . < a, = n, and I two ways to obtain the desired identity-
is a subset
f : {I,. . . ,n) -+ (1, . . .,n) denote a bijection for which the , on the one hand, when S C { I , . . - a + + j +
7
(The preceding formula follows rather easily from the depiction of B~ = {fso (alanaa) : 01 E x{l,...,a+j-b),
permutations as strings crossinq in the planc.)
111 a si111ilar f a s l ~ i oif'~JF1Ii
~
~ p + 1 , . . . , ~ p + lis} increasing for
O<p<r-1,then
From this formulation we have,
N = (a+j-b)( .+j-&l>r(b+j-a)(b+j-aa1M
+ +
a b-3) (a b-j-1
-
because t,( f ({m + 1,. . .,n))) is the minimal number of trans- Next we sum over all the subsets S to obtain
positions that is needed to put f({m + 1 , . . .,n)) back into its
standard position.
Consider the set, B , of bijections f : {1,2,. . ., a + b +j + 1) -+
{1,2, ..., a + b + j + l ) s u c h t h a t t h e v a l u e f ( a + j - b + l ) i s g r e a t e r
1
i
104 THECLASSICAL
AND QUANTUM SYMBOL^
E
the number required to move S into the final position, i.e. t(S).
' Recapitulating,
On the other hand, we compute cEB
~ ~ ~ by( examining
" 1 the F
i
T(ge,s) = (C - a - j + b)(a + b + j + 1- C) - t(S).
images of the various a. Specifically, for a + j - b < C < 2a, let
We recall from Lemma 3.6.2 that
Let ge,s be the unique bijection on {1,2, . . .,a + b + j + 1) such Putting everything together, we get
that ge,s E Be,s and the restrictions of giito each of (1,. . . , e l
and {C + 2 . . . . . n + b + j + 1) are both increasing. Then Br is the
( l ~ , i o ~ i l~i l il $ 1 *IS1 IIP /I, ,. < \ I ~ ( Y
oEBe,s
q 2 ~ ( u )= ( q 2 ~ ( g e , s ) ) (= .(
q2~iul)) q2~(u2))
where the exponent E is given as
= ~ ~ q ~ ~ ( g e , s ) [+
C b] !+[ ja - C]!
and the related exponent P is the following
-.
where theesponent M = C ( C - l ) + ( a + b + j - C ) ( a + b + j - C - I ) .
observe that T ( g e , ~ )is the number of transpositions of the
P = (a+b+j)(a+b+ j-1)-4( a + j - b)(b + j_+1).
form (k, k + 1) that are needed to move {a + j - b + 1 , . . .,C} Set e = a+u and set j = u+v, and compare the two expressions
into the set S. This is the number of transpositions required to for CuGB
q2T(a).We get
move {a + j - b + 1 , . ..,C) into the final position in the interval
q2("+")(j+l)I" + ~ l ! [ b "'"
{I,. . . , a +b +j + I}, which is IS[(a b j + + +
1 - e), minus
u+v=j [a - u]![b
J-
106 THECLASSICAL
AND QUANTUM SYMBOL^
Lemma 3.7.3 follows by manipulating the exponents. This corn-. for various values of j. Second, consider the composition
pletes the proof of Theorem 3.7.1.
( a , j , k), (a, b, n), (n, C,k) is not admissible. The matrix on the left represents the maps U and n, and this
For example, consider the case when a = b = c = = 112. element squared represents the composition of the operators fl €4
One can compute directly from the definitions that
T:(V, 1 ,
112 8 n
(Vl/2)8m
3.10.2 Lemma. (cf. Lemma 2.7.2). Regularly isotopic tangle
via the association of maps n and U to generic maximal and min- diagrams with n strings at the bottom and rn strings at the top
imal points and via the association of the bracket identity to each represent the same map
crossing. In the sequel, we will identify the diagram and the rep-
resented map. T : (v:/~)@~-+ (v:/~)@~.
114 THECLASSICAL
AND QUANTUM
6j-SYMBOLS 115
3.10.3 Definition. Let a, b E (0,1/2,1,. . .). Define maps Suppose that 2b strings come out of the top left edge of the
I;:(+) "nd I;:(-) that are quantizations of the map that switches tangle S , suppose that 2a strings come out of the top right of S,
factors defined in Lemma 2.7.5. Thus, and 2 j strings come out of the bottom of S. The top-right, top-
left, and bottom of the tangle are called the a , ,f3 and y regions of
the boundary, respectively. Thus S represents a map ( V ; I ~ ) @ -+
~~
The (unquantized) switching map X:t can be written as a prod- (v;/~)@~'@ (v:'~)@~~.The strings that come out of the coupon
uct of adjacent transpositions since it represents a permutation; are represented by the three ribbons in the picture below.
choose a minimal such product. Each transposition uk ='(k, k t 1) We will compare the composition Kt:(+) o S to the composi-
in the product is lifted to a braid generator ci,, = sk to define tion (Tz,(-) @ T2b(-)) 0 2 0 Tzj(+) where each of these tangles
&$(+), and it is lifted to &-I = s i l to define Kt:(-). Hence, in is associated canonically with a map among tensor powers of the
the diagrammatic representation of Kt:(+) the 2a strings on the fundamental representation.
left cross over the 2b strings on the right as one reads from top to
3.10.5 Observation. The diagrams depicted below are isotopic
bottom; in Xt:(-) the strings on the top right cross over those on
but not necessarily regularly isotopic diagrams. The isotopies fin:
the top left.
.1/2..>, 11.2 . . , L , ,
])cfilLe i~kapsI ; , , ( & ) : J -" - 1 tl~i1.1,i i ~ . ~I.O~II'C~-
' //I( ((I</, (I-f !h(
.q O I I / ~ O ; I I / ~~ < / i ~ t ? , % ,
while Z
Tn(+) = (sl . . .sn-2~,-1)(sls2 - - .sn-3sn-2) . . - ( s I s ~ ) ~ I .
To obtain the desired maps, It:(&) and Tn(f) apply the bracket
identity t o each braid generator in the product. -
The maps that are represented by the diagram on the left and where X,(f) denotes n strings crossing from top left to lower right
the diagram on the right differ by a factor of ( - A ~ ) ' ~ , for such a over/under n strings running from lower left to upper right, re-
factor measures the difference between isotopy and regular isotopy. spectively.
We next quantify that difference.
Proof. Bracket aficionados will recognize that
In the planar tangle-S (with ,8 region on the upper left, a region
on the upper right, and y region on the bottom edge) suppose that X(f)u = (-A)*~u
x strings start and end in the p region, r strings start and end
I in the a region, p strings start and end in the y region, w strings and
run between the ,8 and the cr region, u strings run between the p nX(k) = ( - ~ ) * ~ n ,
and y regions, and t strings run between the cr and the y region. -
"-
with signs read respectively. (Non-ahcionados are encouraged to
Otherwise the diagram for S can be quite arbitrary, and there is
111 follows I,y ind~~ct.io~t.
~ i o, I ~ ~ ~ ion
I I I ~I 1I ) o~1 11 11c
t 1 1 c ~ \ 1I I I P , 01 i ~ l f ~ l . li11g
i~( of ~ ~ P S~ tFr i l l q \
Tlle LI.ILI\ 1s to l e g u I a l I y 15o~opc
beyond the condition that no strings cross. The tangle Z denotes ;d A
,
01
L, ,a -
Lne alagram. u
the map represented by a rotation of S by 180' about the vertical
The diagrams representing Xn(f) ?J and fi In(&) will be called
axis.
I
w = 2a = 2b = n in the notation above, we have the first equation ?I= ( - A ~ ?I) ~
oT2,(f)
~
in the following:
We turn now to the proof of the general result. Let S' denote
the tangle obtained by twisting the w curlicues out of )$:(+) o S.
Specifically, in each string that runs between the CY and P regions,
the small loop is removed. These loops are removed successively.
Thus we replace Xw(+) o Uw by (Tw(-) @ Tw(-)) o U
,. Then
as in Case 1.
1
120 T H EC L A S S I C AALN D Q U A N T U M
~ ~ - S Y M B O ~ ~
The map Y ba
can be written as a linear combination of maps
x+r+w-p=a+b-j
122 T H EC L A S S I C AALN D Q U A N T U M
6j-SYMBOLS
regardless of the planar tangle S. This gives Item 2 follows from item 1 by techniques of regular isotopy.
Items 3 and 4 follow trivially from the invariance of the map
represented by regularly isotopic diagrams.
This follows by-applying the bracket relation to each of the neg- Proof. Identical to Lemma 2.7.8. U
ative crossings in the half-twist. In the bracket relation either
3.11.2 Lemma.
stra.ig11tstrings or lnasilnum and minimum points result. The op-
\
= (-l)a+b-i~2(a(a+l)+b(b+l)-j(j+l))
where a choice of each square root is made once and for all, is
invariant under all permutations of its columns and under the ex-
change of any pair of elements i n the top row with the correspond-
+
[: t ]
where Ak = ( - 1 ) ~ ~ [ 2 k 11.
ing pair i n the bottom row. Equivalently, the symbol
9
Proof. This is a direct computation. EI
is invariant under the permutations of the set
3.11.5 Remark. These identities are slightly different than
{ { a , b, f 1,{ a , c , d l , {b,c, e l , {d, e, f }1. -
they appear in the classical case. In that case, our choices of the
r
b c j
symbol were motivated by the desire to make con-
Proof. The proof of Lemma 2.7.12 needs t o be modified as fol-
L -
lows. When the closed tetrahedral network depicted in that proof tact with the existing literature, specifically [2]. In the quantum
is rotated through space to reverse its orientation, four twists at case, these identities coincide exactly with those in [32].
the vertices are added. Each of these twists contributes a factor
of An where n , by Lemma 3.10.9, depends on the labels at the 3.12 Theorem.
In [24], Masbaum and Vogel use the recursion relation for the
Jones-Wentzl projectors t o give a formula for the quantum 6j-
A.,
svmbols. See also Section 2.8.
Elliott-Biedenharn:
.
THECLASSICAL
A N D QUANTUM
6j-SYMBOLS
In this section we will define the quantum trace and use it in the
'2
,12(a(b+l)+b(b+l)-1(~+1))@((~,
{UZ }
b13)
map f : W - 147 in case Mr 15 a lT,(s1(2)) ~epresentation.This
notion of trace is quite versa.tile. In particular, such a, tra.ce a.1-
Proof. The proof follows along the same lines as in the proof lowed Jones [12] to define an invariant of knots via braid group
of Theorem 2.7.14, but crossings are lifted to over and under cross- representations. Lickerish's [23] combinatorial definition of the
ings in a consistent manner so that the diagrams can be isotoped in Reshetikhin-Turaev invariants [29] is given via the trace. Lick-
3-dimensional space. The remaining details are left to the reader. orish's techniques are employed in Section 4.2 in order to prove
1I 0
that the matrix representation of the Temperley-Lieb algebra is
faithful for generic values of q.
I 3.12.1 Remark. Similar identities hold for the normalized 6j-
Finally, we will use the trace to characterize certain represen-
symbols as well.
I g tations in the case when A = eZ"/(2T)(or any other primitive 4rth
root of unity). The tensor power (vif2)@Indecomposes as a direct
sum of a trace 0 summand and a sum of representations Vi where
j is taken from the finite set (0,112, . . . ,( r - 2)/2). By excluding
the representations that have trace 0, we will be able to define the
Turaev-Viro [32] invariant as a state summation.
128 T H ECLASSICAL
A N D QUANTUM
6j-SYMBOLS T H EQUANTUM
TRACEA N D COLORREPRESENTATIONS129
L : (vy2)@n 112 @n
-+ (VA )
tr,(L) = t r ( l i 2 o L ) . "..--'
Consider the bases { f s : S C {1,2,. . .,n ) ) and {fs : S c
Figure 7: The braid closure of a tangle
{1,2,. . . , n ) ) for ( v : / ~where
)@~ f, = xf 8 - - .8 x z and f, =
z,S 8 . . .8 ~f with
Proof. The second equality follows because Ir' fs = A ~ ( ' / ~ - "fs
/ ~=)
x if j @ S ~ ~ 1 ~ Tl = # { k : x z = x ) and s = # { k : x: = Y).
- fS~ where For
XjS =
y if j E S the first formula, wc compute using Lemma 3.6.4
and
- ( z if ~ F S i4 o ( L @ In)o ilr ( 1 ) = ij o(L 9 1,)
4.1.3 Remark. The point of the Lemma is, for maps L defined
I ."1.
S <
where the sum is taken over the set of all subsets S C {I,. - . on ( v ; / ~ ) @in~ terms of Temperley-Lieb elements, the trace of the
130 T H ECLASSICAL
AND QUANTUM
63-SYMBOLS T H EQUANTUM
TRACEAND COLORREPRESENTATIONS131
operator can be computed by the bracket expansion of the braid the association of the bracket identity to each crossing. Regu-
closure of the operator; the braid closure of a tangle diagram is larly isotopic diagrams where the end points are fixed during the
depicted in Figure 7. In particular, we apply the Lemma to the isotopy determine the same maps.
Jones-Wentzl projectors to obtain the following: Let I, denote the set linear combinations of such tangle dia-
grams. The bilinear form
4.1.4 Proposition. Suppose that A4T # 1, or if A is a primitive
4rth root of unity, then suppose that n < r - 1.
is defined as the h e a r extension of the map defined on tangles S
In particular, if A is a primitive 4rth root of unity and i f n = r - 1, and M by:
then (S,M) =; o(S @ M ) o ir
trq(C-")= 0.
product (., 0 ) is given as the collection In [21] KOand Smolinski show that all the roots of the equation
det T, = 0 are of the form 6 = 2 cos kn/(m + 1) where 1 < m < n
and 1 5 k < m. So T, is non-singular unless A is a 4rth root of
where w j and wk range over the set of normal form monomials. unity and n > r - 1. This completes the proof.
For example, when n = 3, the matrix is the matrix
4.2.2 Remark. The singularity of the pairing (., .) when n >
r - 1 is a key ingredient in Lickerish's [23] construction of the
- S 3 S2 S2 6 6 - .
Reshetikhin-Turaev invariants. KO and Smolinsky give an ele-
S2 6 63 S2 S2
mentary combinatorial proof of this singularity via a recursive
S2 S3 6 .S2 6'
construction of the Temperley-Lieb basis. The proof of singular-
6 d2 S2 6 S3
ity is originally due to Jones [13].
6 S2 S2 S3 S3 -
Our proof of faithfulness breaks down in case the matrix Tn is
where S is the value associated to any simple closed curve, and
singular, but according to [7] the representation BA is faithful in
the ordered basis of the algebra TL3 is (13, hl, h2, hlh2, h2hl).
a.11 ca.ses except possibly when A = -1. Their proof follows along
the sa.nic li~icsas ours ill t,l~ccla.ssical ca.scl n.llic.11 ; ~ i s oc.o\.cr:, ;.!lo
because this is the loop value associated to the identification
case of A = -1.
U
n I+ [0, iA, - i ~ - ' , 0It. [0, iA, - i ~ - l , 01.
4.3 Color representations. We keep to the case that A is a
More generally, 6 is the loop value in C of the Temperley-Lieb primitive 4rth root of unity with the integer r 2 3. In this case
algebra regardless of the representation. [T] = 0. For such values of A define the set of colors to be the
set {0,1/2,1,3/2, ...,( r - 2)/2). We will consider representations
4.2.1 Proof of Theorem 3.3.4. This proof was indicated to
vi where j is a color, for these representations are irreducible and
us by Paul Melvin. Let T, denote the matrix of the inner product
by computing modulo the trace zero representations, we will still
(., .) defined on n-string tangles with respect to the basis of normal
have a Clebsch-Gordan theory.
form monomials in the generators 1, h l , . . . ,h,-l. Observe that
4.3.1 Lemma. The representation V i is not of trace 0 if a is
det T, is a polynomial function of thk loop value 6. Under the
given representation 6 = -A2 - A-2. a color. I t is of trace 0 if a = ( r - 1)/2.
The representation, Proof. A computation with weight vectors shows that the rep-
resentation V i is irreducible when a < ( r - 1)/2. By Schur's
Lemma, any Uq(s1(2)) map is a multiple of the identity. It suf-
of the Temperley-Lieb algebra into a matrix algebra is faithful fices to compute trq(+&) = [2a + 11 (Lemma 4.1.4); this trace is
when the matrix Tn is non-singular. non-zero unless a = (T - 1)/2.
134 THECLASSICAL
A N D QUANTUM
6j-SYMBOLS T H EQUANTUM
TRACEAND COLORREPRESENTATIONS135
4.3.2 Definition. A q-admissible triple is a triple (a, b, j ) of col- Proof. Let 4 : M 8 v;/'
M 8 v;/' be a Uq(s1(2)) invariant
+
ors such that map. Define an invariant map 4 : M -t M by the formula
The role of the last condition is as follows. When A is a prim- An algebraic computation shows that trq(4) = -trq($). Since M
itive 4rth root of unity and when (a, b, j) is q-admissible, then the
-
has trace zero, trq(+) = 0, and so trq(+) = 0, which completes the
ab
map y j
is non-zero (Theorem 3.6.6). Consider the computa- proof.
j
maps into a summand of ( v ' / ~ ) @ ~ ( ~that
+ ~ )is of
2. V j 8 ~1
I UaC $ (ej
vj) where the sum is over all colors
trace zero.
j such that (a, b, j) is a q-admissible triple.
c2 v; 8 v; $
4.3.4 Lemma. If M is a finite dimensional Uq(s1(2)) repres j:(a,b-1 j)g-admissible
where the sum is over all colors j such that (a, b, j ) is a q-admissible is a Uq(sE(2)) endomorphism of (v;'~)@~("'~). Its quantum trace
triple, and the summand U' is a subrepresentation of trace 0. is the value @(a,b, j ) # 0 (See Remark 3.7.4). Let W $ U denote
a direct sum decomposition of (v:'~)@~("+~)where W is a subrep-
Proof. First we observe that in the case of colors k the Jones- resentation complementary to U, and let pw and pu denote the
Wentzl projectors +& are defined. Thus is defined, for projections onto the indicated summands. Now we compute
112 82j is
(a, b, j ) a q-admissible triple, and the map $j : Vi + (VA )
defined.
Let V j @ V; = W' $ U' be a direct sum dec~mpositionwhere
W' is a direct sum of color representations and U' is a subrep-
resentation of trace 0. By Lemma 4.3.5, we just have to prove
that under the stated conditions (pa @ pa)( y ab
j
(4j(Vi))) is not The first term is 0 because the image of f is assumed to be in U ;
the next two terms are 0 because in a block matrix representation
contained in U'.
of these maps, the two diagonal blocks are 0. The last term is
Let U1' = da@db(U1)c ( l ~ i ' ~ ) @Since
~ ~ ++ ~, @
~ d. b ( ~ i @ ~isl )
0 because it equals the quantum tra.ce of the l1,(s1(2)) inva.ria.nt
ab
Let pabc = Pa 8 pb 8 pc. T h e n -
v,. 8 v; 8 v,. = n:(a,b,n) is q-ad.
=
n:(a,b,n) is q-ad.
(y 8
: 1) o(+n~+c)(v~8vj)@(u8vA")
-
N
{n:(a,b,n) is q-ad.}
( {k:(n,c,k) is q-ad.)
vjaun,c
) @(ua,b@vi)
proof of the first equality.
@ ( @
{n:(a,b,n) is q-ad.}
un,c@(ua,b@vi)
) -
v,. 8 v; 63 vz;l 2
( @
{~,k:(bc,~)&(a,~,k)are
q admis.)
v-
) @ ut
where U' has trace 0. By the computation (*) and the Remak-
where the term @{n:(a,b,n) is q-admis.) Un,c @ (Ua,b 8 V;) On the
Krull-Schmidt Theorem, it suffices to show (*)
right of the last equality is of trace 0. Furthermore,
03 v*k 2 @ VA"
(v,"8 v;) 8 vi {~,k:(b,c,~)&(a,~,k)are
Q admis.) {n,k:(a,b,n)&(n,c,k)areq admis.)
THECLASSICAL
A N D QUANTUM
6j-SYMBOLS TRACEA N D COLORREPRESENTATIONS145
T H EQUANTUM
be a U,(s1(2)) invariant map. Then there are unioue comvlex num.- maw. Thus S = S', and by the linear independence of the maps
bers d, and map S : VJ -+ V j 8 V; 8 V , such that
{ n : ( a ,b, n ) & ( n ,c, k) 4.4.5 Definition. In light of the preceding Lemma, we can
1:
are q-admis.) define in the case that A is a primitive 4rth root of unity the 6 j -
}
\
where T is the tree depicted on the left below - that holds in the
N = N(a, b, c, n, j, k) = a sense of insertion into closed networks.
Then the network, N , is closed by joining the arcs that are labeled
by k. Let N denote this closed network, or its value in C . We
Let T* = T*(a, b, c, d, s, t, g) denote the mirror image of T through
a horizontal axis as shown on the right of the diagram above.
Consider the closed network Closure(T*T).
150 T H ECLASSICAL
A N D QUANTUM
6j-SYMBOLS
Suppose that a coloring is admissible, and consider a tetrahe- on the left can be manipulated to the figure on the right and vice
dron T with colors a, b, c, j, k, n associated to its edges so that the versa.
triples (a, b, n), ( n , ~k),
, (a, j, k), and (b, c, j ) are admissible, and
I: : ;1
these are the labels on the bounding triangles of the tetrahedron.
r -I
the quantity.
7L ?,I
where
A = AT'
3 C AkAl.
{k,e:(j,k,l)isq-admis.)
It is a consequence of the orthogonality identity that the quantity
(I;,~:(~,rl-,l)is
q-admis.} '4 \y
sum and (,-, d, e, f , g, h ) are glued along their common triangular face
(g, h, e). Then an edge labelled j is inserted, so the polyhedron
IMI = IMI f
is the union of 3 tetrahedra: (a, b, e, e , f, j), (b, e, di h, j, li), and
f
where the sum ranges over all admissible colorings f of the given (,, d , f , g, j, k). The Elliott-Biedenharn identity
triangulation.
[4] Crane, L. and Frenkel, Igor, Four Dimensional Topological [13] Jones, V. F. R., Index for Subfactors, Inventiones Math. 72
Quantum Field Theory, Hopf Categories, and Canonical Ba- (1983), 1-25. Reprinted in Kohno "New Developments in the
sis, J. Math. Phys. 35 (lo), (Oct 1994), p. 5136. Theory of Knots," World Scientific Publishing (Singapore
1989).
[5] Drinfel'd, V. G., Quantum Groups, Proc. ICM-86 (Berkeley),
vol.1, Amer.Math.Soc., (1987), 798-820. [14] Kauffman, L., 'Spin Netzoorks and the Jones Polynomial,
'h15tor Newsletter. ?;n 20 (8So\ernl>cl 1959). hlathcnlatlcs
[6] Drinfe'ld, V. G., Quasi-Hopf Algebras and linizhnik- Institute, Oxford, 25-30.
Zamolodchikov Equations, Research Reports in Physics,
Problems of Modern Quantum Field Theory, (Circa 1990). [15] Kauffman, L., SL(2),-Spin Networks, Twistor Newsletter,
No. 32 (12 March 1991), Mathematics Institute, Oxford, 10-
[7] Goodman, F. M. and Wentzl, H., The Temperley-Lieb Algebra 14.
at Roots of Unity, Pacific Journal of Math. Vol 161, No.2
(1993), 307-334. [16] Kauffman, L., "Knots and Physics," World Scientific Pub-
lishing (Singapore 1991).
[8] Humphreys, J. E., "Introduction to Lie Algebras and Repre-
sentation Theory," Springer-Verlag (New York 1972). 1171 Kauffman, L., Map Coloring, q-Deformed Spin Networks,
and the Tureav- Viro Invariants for PManifolds, International
[9] Jacobson, N., "Basic Algebra 11," W. H. Freeman Co. (San Journal of Modern Physics B, Vol. 6, Nos. 11 & 12, (1992)
Francisco 1980). 1765-1794.
[lo] Jimbo, M., A q-Digerence Analogue of U(g) and the Yang-
1181 Kauffman, L. and Lins, S., "The Temperley-Lieb Algebra Re-
Baxter Equation, Letters Math. Phys. 10 (1985), 63-69.
coupling Theory and Invariants of 3-Manifolds," Annals of
160