Lobachevskii Journal of Mathematics http://ljm.ksu.ru Vol. 16, 2004, 71 – 78

© F. Nagasato

Fumikazu Nagasato
EFFICIENT FORMULA OF THE COLORED KAUFFMAN BRACKETS
(submitted by M. Malakhaltsev)

ABSTRACT. In this paper, we introduce a formula for the homogeneous linear recursive relations of the colored Kauffman brackets, which is more efficient than the formula in [G2].


________________

2000 Mathematical Subject Classification. Primary 57M27; Secondary 57M25.

Key words and phrases. Colored Kauffman bracket, Kauffman bracket skein module.

The author has been supported by JSPS Research Fellowships for Young Scientists.


1. Motivation

In this paper, we discuss the “reducibility” of recursive relations. Assume that for a sequence {F i}i in an integral domain R there exists a non-empty finite subset S in such that

iSciFi = 0,whereci(0) Rfor anyi S.

Then the above relation, called a homogeneous linear recursive relation of {F i}i, is said to be reducible if there exist a non-empty proper subset S S such that

iSdiFi = 0,wheredi(0) Rfor anyi S.

If there does not exist such a proper subset S , then the recursive relation is said to be irreducible.

Let us focus on the following homogeneous linear recursive relation of the colored Kauffman brackets {κn}n [t,t1] without details:

Theorem 1.1 (Gelca [G2]). If Ker(πt) for a knot K in S3 has a non-zero element s := i=1kc i (pi,qi)T , then {κn(K0)}n has the following homogeneous linear recursive relation:

Kns ˜(K 0) := i=1kc it(2n+pi)qi (t2)qi κn+pi(K0) (t2)qi κn+pi2(K0) + i=1kc it(2npi)qi (t2)qi κn+pi(K0) (t2)qi κn+pi2(K0) = 0,

where K0 is a framed knot in S3 with 0-framing such that the core of K0 is isotopic to K. ( K0 is uniquely determined up to isotopy.)

In fact, for a knot satisfying Ker(πt)0, all the recursive relations of the colored Kauffman brackets derived from non-zero elements of Ker(πt) represent defining polynomials of a “noncommutative” SL(2, )-character variety. Moreover the recursive relations include the information of the A-polynomial. (Refer to [GLN] for details of these topics and related researches.) In these sense, Theorem 1.1 is very interesting, and so we now focus on Theorem 1.1. Note that it is still unknown if Ker(πt)0 for any knot.

Now, the formula in Theorem 1.1 is in fact reducible. Namely, all the recursive relations given by the formula in Theorem 1.1 are reducible. Indeed, we can get a more efficient formula as follows:

Theorem 1.2. Under the same notations and the conditions as in Theorem 1.1, the following homogeneous linear recursive relation holds:

Kns(K 0) := i=1kc itpiqi (t2(n+pi)+2)qi κn+pi(K0) + (t2(npi)+2)qi κnpi(K0) = 0.

We will first review some concepts needed later through Subsections 2.1 and 2.3, prove Theorem 1.2 in Subsections 2.4 and 2.5, and show the efficiency of the above formula in Subsection 2.6.

2. formula in Theorem 1.2 and its efficiency

2.1. Glossary. In this paper, we will often consider gluings of 3-manifolds with at least one torus boundary. For convenience, we would like to introduce “the canonical gluing” of such 3-manifolds. Let Mi, i {1, 2}, be a 3-manifold with at least one torus boundary Ti2. Fix a longitude λi and a meridian μi of T i 2 . (In the case of the exterior of a knot in a 3-sphere S3, we fix a preferred longitude of the knot as a longitude of the torus boundary.) Then a gluing of M1 to M2 along the tori T12, T 2 2 is said to be canonical (in terms of λi’s and μi’s) if λ1 and μ1 are glued to λ2 and μ2 respectively.

For an arbitrary compact orientable 3-manifold M, a framed link in M is an embedding of the disjoint union of some annuli into M. The framing of a framed link is presented by the blackboard framing in the case where M is a 3-sphere, a knot complement or a solid torus. The framing is done by the torus framing in the case where M is a cylinder T 2 × I. Here by a framed link in T2 × I with 0-framing in terms of the torus framing, we mean a framed link isotopic to an embedding of the disjoint union of some annuli into the torus T 2 ×{1 2}.

For convenience, we fix a longitude λ and a meridian μ of a torus T2, and fix a preferred longitude and a meridian of a knot K in S3 throughout this paper. Note that λ and μ naturally induce a longitude λ(c) and a meridian μ(c) of T2 ×{c} for any c I.

2.2. KBSM. We mention the Kauffman bracket skein module (KBSM for short) needed later. (Refer to [BBLHPP1P2] for details.) For an arbitrary compact orientable 3-manifold M, the Kauffman bracket skein module Kt(M) is defined by the quotient of the [t,t1]-module [t,t1]L M generated by all isotopy classes of framed links in M (including the empty link φ) by the [t,t1]-submodule generated by all possible elements as follows:

<m:mi 
>P</m:mi><m:mi 
>I</m:mi><m:mi 
>C</m:mi>
t
<m:mi 
>P</m:mi><m:mi 
>I</m:mi><m:mi 
>C</m:mi>
t1
<m:mi 
>P</m:mi><m:mi 
>I</m:mi><m:mi 
>C</m:mi>
,

L
<m:mi 
>P</m:mi><m:mi 
>I</m:mi><m:mi 
>C</m:mi>
(t2 t2)L,for any framed link L in M,

where the three drawings of the first line in the above depictions express framed links identically embedded in M, except in an open ball Int (B3).

For a framed knot Kf in M and a positive integer n, let (Kf)n be the framed link consisting of n parallel copies of Kf. Then we define the element Tn(Kf) of Kt(M) as follows:

Tn(Kf) = Kf Tn1(Kf) Tn2(Kf),

T1(Kf) = Kf,T0(Kf) = 2 φ,Tn(Kf) = Tn(Kf).

Also we define the element Sn(Kf) of Kt(M) as follows:

Sn(Kf) = Kf Sn1(Kf) Sn2(Kf),

S1(Kf) = Kf,S0(Kf) = 1 φ,Sn(Kf) = Sn2(Kf).

Then focus on the following theorem in [P1].

Theorem 2.1 (Przytycki [P1]). Let F be an orientable surface, and let I be an interval [0, 1]. Then the KBSM Kt(F × I) is the free [t,t1]-module generated by all the isotopy classes of framed links in F × I (including the empty link) isotopic to embeddings of the disjoint union of some annuli into F with no trivial component.

Regarding a solid torus D2 × S1 as a cylinder (S1 × I) × I, we see that Kt(D2 × S1) is free as [t,t1]-module with basis (representatives)

{Tn(α)n 0},

where α is an embedded annulus in (S1 × I) × I isotopic to (S1 × [1 3, 2 3]) ×{1 2}. Let (p, q) for coprime integers p, q be a framed knot in T2 × I with 0-framing whose core is isotopic to the simple closed curve of slope pq on T 2 ×{1 2}. (Note that the curve of slope pq means one homologous to p[λ(1 2)] + q[μ(1 2)] in H1 (T2 ×{1 2}).) Then it also follows from Theorem 2.1 that Kt(T2 × I) is free as [t,t1]-module with basis (representatives)

{(np,nq)T := Tn((p,q))p 0,q , gcd(p,q) = 1,n 0}.

2.3. Colored Kauffman bracket. The colored Kauffman bracket is an invariant of framed knots in S3 defined as follows. For a framed knot Kf in S3 and a non-negative integer n, consider an element Sn(Kf) in Kt(S3) = [t,t1]. Then the n-th colored Kauffman bracket κn(Kf) of a framed knot Kf is defined as the element Sn(Kf). Namely, κn(Kf) := Sn(Kf). Note that the equation Sn(Kf) = Sn2(Kf) naturally induces κn(Kf) = κn2(Kf). Here Sn corresponds to the Jones-Wenzl idempotent or “the magic element”. (Refer to [FGL].)

2.4. Efficient formula. As stated in the first section, the formula in Theorem 1.1 is reducible, which fact will be observed in Subsection 2.6. Indeed, we can polish it as seen in Theorem 1.2. (It is still unknown if the formula in Theorem 1.2 is irreducible.) In this subsection, we give a proof of Theorem 1.2.

We first review some propositions and concepts needed later. For a knot K in a 3-sphere S3 let N(K) be an open tubular neighborhood of K in S3, and let EK be the exterior S3 N(K) of K. In [G2] a method is introduced to get a homogeneous linear recursive relation of the colored Kauffman brackets {κn(K0)}n. The method is based on the kernel of the homomorphism as [t,t1]-module

πt : Kt(T2 × I) K t(EK),

induced by the canonical gluing (see Subsection 2.1) of a cylinder T2 × I to the exterior EK along T2 ×{1} and EK. Indeed, the gluing induces a bihomomorphism

CE : Kt(T2 × I) ×K t(EK) Kt(EK).

We simply denote by a b the image CE(a,b) of (a, b) Kt(T2 × I) ×K t(EK). Then the homomorphism πt : Kt(T2 × I) K t(EK) is defined by πt((p,q)T ) = (p,q)T φ.


PIC


Figure 1: The image πt ((1, 0)T )

Now, consider the bihomomorphism

CS : Kt(D2 × S1) ×K t(T2 × I) K t(D2 × S1)

induced by the canonical gluing (see Subsection 2.1) of T 2 × I to D2 × S1 along T 2 ×{0} and (D2 × S1). We also simply denote by c b the image CS(c,b) of (c,b) Kt(D2 × S1) ×K t(T2 × I). Then we get the following formula.

Proposition 2.1 (Gelca [G2]). For elements T n (α) Kt(D2 × S1) and (p, q)T Kt(T2 × I), the following holds:

Tn(α) (p,q)T = t(2n+p)q (t2)qS n+p(α) (t2)qS n+p2(α) + t(2np)q (t2)qS n+p(α) (t2)qS n+p2(α) .

In fact, the above equation can be simplified as follows:

Proposition 2.2. For elements Sn (α) Kt(D2 × S1) and (p, q)T Kt(T2 × I) the following holds:

Sn(α) (p,q)T = tpq (t2(n+p)+2)qS n+p(α) + (t2(np)+2)qS np(α) .

By Proposition 2.2, we can easily prove Theorem 1.2. We review Gelca’s construction given in [G2] to prove the theorem. For any knot K in S3 , consider the pairing

, : Kt(D2 × S1) ×K t(EK) Kt(S3) = [t,t1],

naturally induced by the 10-Dehn filling on EK. By the above pairing we can represent the n-th colored Kauffman bracket κn(K0) of K0 with 0-framing as follows:

Sn(α),φ = κn(K0).

(Refer to Subsection 2.3.) Here we see immediately that for any elements u Kt(D2 × S1), v Kt(EK) and w Kt(T2 × I),

u w,v = u,w v.

Let us consider the case where u = Sn(α), v = φ and w = i=1kc i(pi,qi)T Ker(πt) in the above equation. Then by Proposition 2.2 we get the following recursive relation of {κn(K0) = Sn(α),φ}n:

i=1kc itpiqi (t2(n+pi)+2)qi Sn+pi(α),φ + (t2(npi)+2)qi Snpi(α),φ = 0.

This completes the proof of Theorem 1.2.

2.5. Proof of Proposition 2.2. In this subsection, we give a proof of Proposition 2.2. We first see that Tn(α) = Sn(α) Sn2(α) by induction. Therefore the following holds by Proposition 2.1:

(Sn(α) Sn2(α)) (p,q)T = t(2n+p)q (t2)qS n+p(α) (t2)qS n+p2(α) + t(2np)q (t2)qS n+p(α) (t2)qS n+p2(α) .

Recall Sn(α) = Sn2(α). Hence the above equation is transformed as follows:

(Sn(α) Sn2(α)) (p,q)T = t(2n+p)q (t2)qS n+p(α) (t2)qS n2+p(α) + t(2np)q (t2)qS n2p(α) + (t2)qS np(α) = (t2n+p+2)qS n+p(α) + (t2np+2)qS np(α) (t2n+p2)qS n2+p(α) + (t2np2)qS n2p(α).

Here let us put V n := (t2n+p+2)qS n+p(α) + (t2np+2)qS np(α). Then the above transformation immediately derives the following recursive relation:

Sn(α) (p,q)T V n = Sn2(α) (p,q)T V n2.

Therefore it suffices to show the equation Sn (α) (p,q)T = V n in the case where n is 1 and 0 for proving Proposition 2.2. If n is 1, then we have

S1(α) (p,q)T V 1 = (tp)qS p1(α) + (tp)qS p1(α) = (tp)qS p1(α) (tp)qS p1(α) = 0.

If n is 0, then

S0(α) (p,q)T V 0 = 1 2(S0(α) S2(α)) (p,q)T (tp+2)qS p(α) (tp+2)qS p(α) = 1 2T0(α) (p,q)T (tp+2)qS p(α) (tp+2)qS p(α).

By Proposition 2.1, we have

1 2T0(α) (p,q)T = tpq (t2)qS p(α) (t2)qS p2(α) = (tp+2)qS p(α) + (tp+2)qS p(α).

This shows that S0(α) (p,q)T V 0 = 0 and completes the proof of Proposition 2.2.

2.6. Efficiency of the formula in Theorem 1.2. In this subsection, we show the efficiency of the formula Kn s(K 0) = 0 in Theorem 1.2 comparing Kns ˜(K 0) = 0 in Theorem 1.1.

According to [G1], for the left-handed trefoil,

s := (1,5) T t8(1,1) T + t3(0, 5) T t(0, 1)T Kt(T2 × I)

is in the kernel of πt. We pick up this element to show the efficiency. Let K0 be the left-handed trefoil with 0-framing. Then the element s gives rise to the following recursive relation of {κn(K0)}n via the formula Kns˜(K 0)=0 in Theorem 1.1:

Kns ˜(K0) = (t10n15 + t2n11)κ n+1(K0) + (t10n+7 t10n13 + t2n+3 + t2n1)κ n(K0) + (t10n+5 t10n+5 t2n7 + t2n7)κ n1(K0) + (t10n13 + t10n+7 t2n1 t2n+3)κ n2(K0) + (t10n15 t2n11)κ n3(K0) = 0.

On the other hand, s gives rise to the following recursive relation of {κn(K0)}n via the formula Kns(K 0)=0 in Theorem 1.2:

Kns (K0) = (t10n15 + t2n11)κ n+1(K0) + (t10n+7 t10n13 + t2n+3 + t2n1)κ n(K0) + (t10n+5 + t2n7)κ n1(K0) = 0

As seen in these examples, the formula in Theorem 1.2 gives us a simpler recursive relation than that in Theorem 1.1 gives us. In fact, this phenomenon always holds. More concretely, Kn s ˜(K 0) = Kns(K 0) + Kn2s(K 0) always holds for any knot K in S3 and any element s in Ker(πt) for K. (Hence the recursive relations given by the formula in Theorem 1.1 are reducible.) In this sense, the formula in Theorem 1.2 is more efficient than that in Theorem 1.1.

Acknowledgements

I would like to thank Professor Răzvan Gelca for his useful comments. I also grateful to my advisor, Professor Mitsuyoshi Kato, for his encouragement.

References

[B]   D. Bullock: The (2,)-skein module of the complement of a (2,2p + 1)-torus knot, J. Knot Theory Ramifications 4 (1995), 619–632.

[BL]   D. Bullock and W. LoFaro: The Kauffman bracket skein module of a twist knot exterior, preprint.

[FG]   C. Frohman and R. Gelca: Skein modules and the noncommutative torus, Trans. Amer. Math. Soc. 352 (2000), 4877–4888.

[FGL]   C. Frohman, R. Gelca and W. LoFaro: The A-polynomial from the noncommutative viewpoint, Trans. Amer. Math. Soc. 354 (2001), 735–747.

[GL]   S. Garoufalidis and T.T.Q. Le: The colored Jones function is q-holonomic, preprint.

[G1]   R. Gelca: Noncommutative trigonometry and the A-polynomial of the trefoil, Math. Proc. Cambridge Phil. Soc., 133 (2002), 311–323

[G2]   R. Gelca: On the relation between the A-polynomial and the Jones polynomial, Proc. Amer. Math. Soc. 130 (2001), 1235–1241.

[HP]   J. Hoste and J. Przytycki: The (2,)-skein module of lens spaces; a generalization of the Jones polynomial, J. Knot Theory Ramifications 2 (1993), 321–333.

[L]   W.B.R. Lickorish: The skein method for three-manifold invariants, J. Knot Theory Ramifications 2 (1993), 171–194.

[N]   F. Nagasato: Computing the A-polynomial using noncommutative methods, to appear.

[P1]   J. Przytycki: Skein modules of 3-manifolds, Bull. Pol. Acad. Sci. 39 (1991), 91–100.

[P2]   J. Przytycki: Fundamentals of Kauffman bracket skein module, Kobe J. Math. 16 (1999), no. 1, 45–66.

[S]   N. Saveliev: Lectures on the topology of 3-manifolds: an introduction to the Casson invariant, de Gruyter textbook, Walter de Gruyter, Berlin, 1999.

GRADUATE SCHOOL OF MATHEMATICS, KYUSHU UNIVERSITY, FUKUOKA, 812-8581, JAPAN

E-mail address: fukky@math.kyushu-u.ac.jp

Received February 10,2004; Revised version September 15, 2004