1. Introduction and Overview
Skein modules of 3-manifolds are generalizations of link invariants in 
 to link invariants in arbitrary 3-manifolds. They were introduced by Turaev [
1] and Przytycki [
2] and they have become very important algebraic tools in the study of 3-manifolds, since their properties reflect geometric and topological information about them. Skein modules of 3-manifolds are modules composed of linear combinations of links in the 3-manifolds, modulo some properly chosen (local) skein relations. In this paper, we compute the 
Kauffman bracket skein module of 
, KBSM (
), namely, the skein module based on the Kauffman bracket skein relation
      
      where 
 and 
 are represented schematically by the illustrations in 
Figure 1.
The computation of KBSM () is equivalent to constructing all possible analogues of the Jones polynomial for knots and links in , since the linear dimension of KBSM () means the number of independent Kauffman bracket-type invariants defined on knots and links in . In other words, KBSM () yields all possible isotopy invariants of knots which satisfy the Kauffman bracket skein relation.
The precise definition of KBSM is as follows:
Definition 1. Let M be an oriented 3-manifold and  be the set of isotopy classes of unoriented framed links in M. Let  be the Laurent polynomials in A and let  be the free R-module generated by . Let  be the ideal generated by the skein expressions  and . Note that blackboard framing is assumed and that  stands for the union of a link L and the trivially framed unknot in a ball disjoint from L.
Then, the Kauffman bracket skein module of M, KBSM , is defined to be:  The importance of the Kauffman bracket skein module of a 3-manifold 
M lies in the fact that it detects the presence of non-separating 2-spheres and tori embedded in 
M. On the level of Kauffman bracket skein modules, a non-separating 2-sphere in 
M is detected by the existence of torsion in KBSM (
M). For more details, the reader is referred to [
2].
We consider 
 as being obtained from 
 by integral surgery along the unknot with coefficient zero, that is, 
 is a special type of lens spaces 
 for 
 and 
 (
). In [
3], the Kauffman bracket skein module of the lens spaces 
 is computed via the ‘braid technique’, and a basis of KBSM (
) is obtained that is different from the basis presented in [
4]. In this paper, we apply the ‘braid technique’ to exhaust the computation of the Kauffman bracket skein module of the family of lens spaces. More precisely, the integral surgery model of 
 allows us to ‘push’ every knot and link in 
 to the solid torus, and thus, a basis of KBSM (ST) spans KBSM (
). Following the pioneering work of V.F.R. Jones ([
5,
6]), in [
3], we consider the generalized Temperley–Lieb algebra of type B, 
, together with a Markov trace constructed on 
 and the universal invariant 
V of the Kauffman bracket type for knots and links in ST defined in [
3]. This invariant gives distinct values to distinct elements of any basis of KBSM (ST), and thus, it recovers KBSM (ST). Hence, in order to compute KBSM (
), one needs to extend the invariant 
V for knots and links in ST to an invariant of knots and links in 
, by imposing relations coming from the extra isotopy moves of 
, that we call 
(braid) band moves, abbreviated 
 (or 
). In other words, the following infinite system of equations is obtained:
        
By construction, a solution to the infinite system of Equation (
1) corresponds to the computation of the Kauffman bracket skein module of 
. These equations are simplified with the use of a new basis of KBSM (ST), 
, presented in [
3,
7,
8], that arises naturally on the level of braids. Using the basis 
 of KBSM (ST), we show that the free part of the Kauffman bracket skein module of 
 is generated by the unknot (or the empty knot) and we also show how torsion is captured in the solution of the infinite system. It is worth mentioning that 
 is the first 3-manifold, where torsion on its Kauffman bracket skein module is detected via the ‘braid technique’. Finally, we compute KBSM (
) via a different diagrammatic method based on braids following [
9,
10]. In this way, we obtain a closed formula for the torsion part of the module and our result agrees with that of Hoste and Przytycki [
11]. The diagrammatic method via braids has been successfully applied in [
10] for the case of the Kauffman bracket skein module of the complement of 
-torus knots and in [
3] for the case of the lens spaces 
, 
. The importance of the braid approach lies in the fact that it can shed light to the problem of computing (various) skein modules of arbitrary closed, connected, oriented (abbreviated to c.c.o.) 3-manifolds (see also [
12] for the case of the HOMFLYPT skein module of the lens spaces 
). For a survey on skein modules, see [
13] and for the braid approach, see [
14]. Finally, it is worth mentioning that in [
15], the authors introduce the Mixed Hecke algebra on two fixed strands and they present a spanning set and potential basis for this algebra. This is the first step towards a polynomial invariant for knots and links in the complement of the two-component unlink and in the handlebody of genus two via braids and knot algebras. Our intention is to compute the HOMFLYPT skein module of the connected sum of lens spaces by solving the infinite system of equations obtained from band moves on the two fixed strands.
The paper is organized as follows. In 
Section 2, we recall the topological setting and the essential techniques and results from [
16,
17]. We first present different models for 
, which demonstrate the difference between the knot theory of this 3-manifold to the knot theory of 
. We then explain how knots and links in 
 can be viewed as mixed links in 
. Mixed links are closely related to Kirby diagrams of links in 
, that is, link diagrams in 
 that involve the surgery description of 
. We present isotopy moves for mixed links in 
 that correspond to isotopy moves for knots and links in 
, and using the analogue of the Alexander theorem for knots and links in ST, we pass on the level of mixed braids. We then translate isotopy in 
 to braid equivalence (the analogue of the Markov theorem for braid equivalence in 
). In 
Section 3, we present results from [
3,
7,
18,
19]. More precisely, we start by recalling results on the generalized Hecke algebra of type B, 
, and we present the universal invariant of the HOMFLYPT type for knots in ST via a unique Markov trace, 
, defined on 
. This invariant captures the HOMFLYPT skein module of ST. We then pass to the 
generalized Temperley–Lieb algebra of type B, defined as a quotient algebra of 
 over an appropriate chosen ideal (see relations (
3)), and we obtain the universal invariant V for knots and links in ST of the Kauffman bracket type, that captures KBSM (ST). We also present the basis 
 of KBSM (ST) that describes naturally the isotopy moves for knots and links in 
, and that simplifies the infinite system of Equation (
1). In 
Section 4, we solve the infinite system of Equation (
1) and we prove that the free part of KBSM (
) is generated by the unknot (or the empty knot). We also show how torsion is detected in the solution of this system. Finally, in 
Section 5, we demonstrate the diagrammatic approach based on braids for computing KBSM (
).
  4. The Kauffman Bracket Skein Module of  via 
In this section, we solve the infinite system of Equation (
1), which is equivalent to computing the Kauffman bracket skein module of the lens spaces 
. Recall that this infinite system of equations is obtained by performing braid band moves on elements in the basis 
 of KBSM (ST) and by imposing to the generic invariant 
V for knots and links in ST relations of the form 
, for all 
, where 
. Recall also that the unknowns in the system are the 
s, coming from the fourth rule of the trace function in Theorem 5, that is, 
, for all 
.
We first observe that the equations obtained by applying the two types of bbms on an element in  other than the unknot, are different, and thus, both bbms are needed in order to compute KBSM (). In other words, we have that:
For , the equations  and  are not equivalent.
Consider 
, where 
. Then, the equations obtained by performing bbms on 
 are:
        
We now deal with the equation obtained from a negative bbm and we underline expressions which are crucial for the next step.
      
Hence, for 
, we have that the equations obtained from the performance of the two types of bbms are equivalent if and only if:
        
We now evaluate 
 for 
 and we have:
        
while by substituting 
 in Equation (
7), we obtain that 
. Therefore, we have a contradiction and we conclude that in order to compute KBSM (
), we need to consider the effect of both types of bbms on elements in 
.
  4.1. Useful Lemmata
In this subsection, we present a series of results toward the solution of the infinite system (
1), by studying the effect of the braid band moves on the elements in the basis 
. We recall first an ordering relation defined in [
21]. For that, we shall need the notion of the 
index of a word 
w, denoted 
.
Definition 3 (Definition 1 of [
21])
. Let w be a word in Σ or in . Then, the index of w, , is defined to be the highest index of the s (s, respectively) in w, by ignoring possible gaps in the indices of the looping generators and by ignoring the braiding parts. Moreover, the index of a monomial in s is equal to 0. Definition 4 (Definition 2 of [
21])
. Let  and  in , where  for all  and . Then, we define the following ordering in :- (a) 
- If , then . 
- (b) 
- If , then: - (i) 
- if , then , 
- (ii) 
- if , then: - (α) 
- if , then , 
- (β) 
- if  for all t and , then , 
- (γ) 
- if  for all t and  and , then , 
- (δ) 
- if  and , , then . 
 
 
- The ordering in the set Σ is defined as in , where s are replaced by s. 
 Our goal is to express  for , to sums of elements in .
Lemma 1. For , the following holds in :  Proof.  We prove Lemma 1(i) by induction on 
. The base of induction is 
, which holds. Assume now that the relations hold for 
n. Then, for 
, we have that:
          
□
 We now express monomials of the form 
, where 
 in sums of elements of the form 
. In [
21], a method for expressing monomials in Σ to sums of monomials in 
 (and vice-versa) is presented on the level of the generalized Hecke algebra of type B, 
. This was achieved with the use of the ordering relation defined on the basic sets of 
 (Definition 4). More precisely, in [
21], it is shown that a monomial 
τ in Σ can be written as a sum of elements in the set 
, such that the term 
, which is obtained from 
τ by changing 
 into 
 for all 
i, is the highest order term in the sum. Recall now that the generalized Temperley–Lieb algebra of type B, 
, is a quotient of 
 over the ideal generated by elements in Equation (
3) that only involves the 
σs, and since the only braiding generator in the monomials 
 is 
, it follows that the results presented in [
21] are also true in 
 for the monomials 
. In particular, we have that for 
, the following holds in 
:
          
where 
 and 
 are coefficients for all 
i.
We now deal with elements of the form , such that  and .
Lemma 2. For  and , the following relation holds in :  Proof.  We consider 
 and we apply the Kauffman bracket skein relation as demonstrated in 
Figure 14. Applying the skein relations and conjugation, we may express these elements in terms of elements in the basis 
, together with elements of the form 
, of lower order than 
. The process is repeated until we are left with elements in 
.     □
 Remark 5. In Lemma 2, we considered elements of the form , where . If , then we consider the closure operation on the mixed braids and we order the exponents, since the s are conjugates, i.e., . Then, we braid the resulting loops again (see Figure 15).  Corollary 1. For  and , the following relation holds in :where  are coefficients.    4.2. The Infinite System
By general position arguments, for computing the Kauffman bracket skein module of 
, we may first consider the effect of negative bbms on elements in 
, obtain a spanning set for 
, and then study the effect of positive bbms on elements in 
. With a slight abuse of notation, we denote the above as follows:
          
Hence, we consider elements in  and perform negative braid band moves, obtaining an infinite system of equations, the solution of which corresponds to a basis for . We have the following:
Theorem 9.  is generated by the unknot  and t.
 Proof.  We consider the infinite system of equations 
, for 
. We have that:
          
Hence, , which corresponds to the unknot, and t are free in .
Consider now 
 such that 
. Then:
          
where 
 are coefficients for all 
i.
Hence, 
, for all 
. Thus, by ignoring the coefficients, we have the following:
          
where 
 are coefficients.
Recall now that  and . The result follows.     □
 Corollary 2. The set  forms a basis for .
 We now consider the effect of positive braid band moves on the elements  and t. We have the following result:
Theorem 10. The free part of KBSM  is generated by the unknot and the torsion part is generated by t.
 Proof.  We consider the elements in the basis of 
 and we study the effect of a positive braid band move on them. We have that:
          
We evaluate 
:
          
Substituting 
 in the equation above, we obtain the following:
          
From Equation (
8) and Theorem 9, we have that 
 generates the torsion part of KBSM (
). The free part of KBSM (
) is generated by the unknot (or the empty knot).     □
 Although we do not obtain a closed formula for the torsion part of KBSM (), Theorem 10 implies the following:
Corollary 3. If π denotes the natural projectionthen:    5. A Diagrammatic Approach via Braids
In this section, we present the diagrammatic approach for computing KBSM (
) via braids. Note that during the process that we will describe below, the braids “lose” their natural top-to-bottom orientation, giving rise to what we call 
unoriented braids. Unoriented braids were defined in [
3] as standard braids by ignoring the natural top-to-bottom orientation (for an illustration, see 
Figure 16). These tools seem promising in computing Kauffman bracket skein modules of arbitrary 3-manifolds (see, for example, [
9,
10]).
In [
16], it is shown that in order to describe isotopy for knots and links in a c.c.o. 3-manifold, it suffices to consider only one type of band moves (recall the discussion in 
Section 3). In the algebraic approach, we only considered the type 
β-band moves that correspond to the braid band moves, and in the diagrammatic approach, we will be using the 
α-type band moves (recall 
Figure 7). Our starting point again is the following:
        
that is, we study the effect of the 
α-type band moves on elements in the 
 basis of KBSM (ST). We denote the effect of 
α-type band moves on 
 as 
, where 
 is illustrated in 
Figure 17. Obviously, 
.
We now return to the infinite system of Equation (
9) and we have the following:
        
Hence, 
t produces torsion in KBSM (
).
Notation 2. We denote by  the closure of the looping generator t and by  the closure of m-looping generators in ST. Moreover, , , denotes  followed by m copies of . For an illustration, see Figure 18.  In order to clarify the steps needed toward the computation of KBSM (ST) using the diagrammatic method via braids, we also demonstrate how we obtain the equation for 
. After the performance of the band move on 
, we apply the Kauffman bracket skein relation on the resulting 
 and we write 
 in terms of 
s. Applying the skein relation then again to the 
s, we express them in terms of the 
s, obtaining the equation of the infinite system. For an illustration, see 
Figure 19. Indeed, we have that:
        
Hence, we obtain the following equation:
        
We observe that, in order to obtain the equations of the infinite system, a recursive formula for  is needed. We have the following:
Lemma 3. For , such that , the following relations hold in KBSM ():  Note now that 
 will not affect the process illustrated in 
Figure 20 for 
. Indeed, we have that
      
Moreover, for , we have that .
We now present an ordering relation for elements in the set .
Definition 5. Let  and . Then:
- i. 
- If , then . 
- ii. 
- If , then: - a. 
- If , then . 
- b. 
- If , then . 
 
 Proposition 1. The set , equipped with the ordering relation given in Definition 5, is a totally ordered and a well-ordered set.
 Proof.  In order to show that the set D is a totally ordered set when equipped with the ordering given in Definition 5, we need to show that the ordering relation is antisymmetric, transitive, and total. We only show that the ordering relation is transitive. The antisymmetric property follows similarly and totality follows from Definition 5, since all possible cases have been considered.
Let , such that  and . We prove that . Since , we have that:
        
- (a.)
- either , and since , we have that , 
- (b.)
- or  such that . Then, since , we have that:
             - (i.)
- either , the same as in case (a.), 
- (ii.)
- or , such that . Then, . 
 
We conclude that the ordering relation is transitive. The minimum element in D is , i.e., the unknot, and hence D is a well-ordered set.     □
 The next step is to convert the s to elements in the  basis of KBSM (ST) for all . For that, we need the following lemmas:
Lemma 4. For , such that , the following relations hold in KBSM ():  Proof.  We prove Lemma 4 by strong induction on 
n. The case 
 is the base of induction and we have that 
. Hence, relation (
11) holds for 
. Assume that relations (
11) hold for all 
 up to 
. Then, for 
 we have:
        
where “l.o.t.” stands for lower ordered terms.     □
 Note that 
 corresponds to the monomial 
, namely, a monomial in the 
 basis of KBSM (ST). We now convert these monomials to elements in the 
 basis. We also note that this is performed in ([Section 3] of [
3]) via the ordering relation of Definition 4.
Lemma 5. The following relations hold in KBSM (ST), and hence in KBSM (), for  such that :where β is a monomial of s with index at most .  Proof.  The proof of Lemma 5 is an immediate result of Lemma 2 (recall also 
Figure 14).     □
 Lemma 5 implies the following:
Proposition 2. For , such that , the following relations hold:where the s are coefficients.  Proof.  Consider the monomial  and apply Lemma 5 on each pair of loop generators with consecutive indices. Each time Lemma 5 is applied, the coefficient  will appear on the highest order term of the resulting sum. In total, there are  pairs of s where Lemma 5 is to be applied. The result follows.     □
 We are now ready to present the main theorem of this section.
Theorem 11. The following relations hold in KBSM ():  Proof.  where “l.o.t.” stands for lower ordered terms than 
.     □
 Considering now the result of Theorem 11 on the infinite system of Equation (
9), a solution of which corresponds to computing KBSM (
), we have that the elements of the form 
 for 
, correspond to the torsion part of KBSM (
), since these elements can be written as 
 and 
t produces torsion in 
 (recall relation (
10)). Moreover, we have that the free part of KBSM (
) is generated by the unknot. In other words, we have shown that:
Our results agree with that on [
11], where KBSM (
) is computed with the use of an appropriate basis of Chebyshev polynomials presented in [
24].