Twistings and the Alexander polynomial
Abstract.
We give an explicit formula of the Alexander polynomial of the link obtained by adding an arbitrary number of full twists to positively oriented parallel -strands in terms of the Alexander polynomials of the links obtained by adding full twists. From this, we see that the Alexander polynomials stabilize after adding sufficiently many full twists. The main tool used in the computation is expressing the Alexander polynomial using the vector space representation of .
1. Introduction
In this paper we study the change in the Alexander polynomials of links under inserting full twists. More explicitly, suppose is an oriented link with some specific link diagram, such that some part of the link diagram consists of -parallel strands of the same orientation. Let denote this particular link diagram of with this choice of -parallel strands. Let denote the link obtained from by inserting full twists along the -parallel strands and let . We obtain the following expression of the Alexander polynomial of in terms of .
Proposition 1.1.
For each , there exist some Laurent polynomials which only depend on but not on the link , such that
See Definitions 4.5 and 4.8 for the explicit definition of . By examining the definition of , we get the following stabilization result for the Alexander polynomial as .
Proposition 1.2.
The Alexander polynomials stabilize as in the following sense:
For each link diagram with a chosen part consisting of -parallel strands, there exists a Laurent series with finitely many terms of negative degree in , and some integer , such that for any , there exists where for any , the first terms in the increasing order of degree of of agree with the first terms of
By the symmetry of the Alexander polynomials, a similar result holds for the last terms as well.
Since the Laurent series is defined as some -linear combination of the Alexander polynomials for , it satisfies the usual skein relations for Alexander polynomials if we change a crossing away from the chosen -parallel strands. We can think of as an invariant of the -tangle obtained by cutting along the -parallel strands.
The main tool used in this paper is the formulation of the Alexander polynomial as a -quantum invariant. See [Sar15] for a detailed explanation of this point of view. In brief, we study the -equivariant maps induced by oriented tangles on , where is the vector space representation of . Here we use the assumption that all the -parallel strands are of the same orientation. (In general, we would also need the dual space of .) Also, as all the tangles are oriented upwards in our situation, we can ignore the orientation of the tangle, and consider the action of upward-oriented tangles as an action of the braid group on , denoted by
The -module decomposes as a direct sum
where each is a -dimensional irreducible representation of , generated by a highest weight vector with weight as a -module. Then it is enough to study the action of on the vector space spanned by highest weight vectors of of weights for each . Denote this space by
First, we define a map
and prove that is an isomorphism between -vector spaces. This is proved by choosing a good basis of . See Proposition 2.7 and Proposition 2.8 for the details.
Then we show is ‘almost’ an isomorphism of -modules, ‘almost’ because they are different by some powers of . More explicitly,
Proposition 1.3.
For any , any and any one-crossing generator , we have:
where the action of on is the diagonal action of on each component of .
As a result, the action of on is completely determined by its action on the vector space . It is not hard to compute the action of the full twist on explicitly, which is simply a scalar multiplication by . Hence, if we define
as the projection to the subspace , then we can write
The equation holds for any power of by raising the coefficients to the corresponding power. By looking at the first powers of and inverting the coefficient matrix, we can write as a -linear combinations of for each . Therefore, for any , we can write as a -linear combinations of . This leads to the expression of in Proposition 1.1 in terms of .
Here are some directions of future work. Firstly, the construction in this paper relies on the assumption that the -parallel strands are oriented in the same direction. It is a natural question to ask what happens if we reverse the direction of some of the strands.
Secondly, in [LC18], Lambert-Cole proved stabilization results for knot Floer homology under adding twists to -parallel strands. We would like to explore similar stabilization results for knot Floer homology under adding twists to -parallel strands.
Thirdly, in [Roz10], Rozansky used the stabilization results on Khovanov homology under adding twists to define Khovanov homology for links in . See also [Wil21], where Willis extended it to links in . We would like to see, if such stabilization results hold for knot Floer homology, what is the relation of the stabilization limit with the knot Floer homology for links in .
Organization of the paper. In Section 2.1 and 2.2, we briefly review the quantum group and its representations. In Section 2.3, we give a basis of , and prove as vector spaces. In Section 3, we prove Proposition 1.3. In Section 4, we compute the action of the full twist on , and then prove Proposition 1.1 and 1.2.
Acknowledgements. The author wants to thank Ciprian Manolescu and Mike Willis for many helpful discussions.
2. Representations of
In this section, we first give a brief review of representations of . We follow the exposition in Section and in [Sar15] closely. The relatively new material in this section is that we introduce some -vector space basis of the tensor product of the vector space representation , which will be important for our analysis of the braid group action later.
2.1. The quantum enveloping subalgebra
Let be the Lie superalgebra of linear endomorphisms of the -dimensional graded complex vector space with grading . Let be the Cartan subalegbra of the diagonal matrices. Denote the weight lattice by , where is the basis dual to . Denote its dual lattice by . The roots of are and .
The quantum enveloping superalgebra is the unital superalgebra over the field generated by with , with degrees , and relations
(2.1) |
The quantum enveloping superalgebra has a Hopf superalgebra structure, with the comultiplication , the counit and the antipodal map defined as follows:
(2.2) |
2.2. Representations of
For a weight , define the grading of by
Irreducible representations of are indexed by the their highest weight , which are divided into two cases, depending on whether or not belongs to , which is the complement of in the weight lattice .
-
(1)
If , i.e. , then is a -dimensional -vector space spanned by , with grading and actions
(2.3) -
(2)
If , i.e. , then is a -dimensional -vector space spanned by , with gradings and actions
(2.4) where
The most important representation for us is and we introduce some special notations for it.
Definition 2.1.
The vector space representation of is , spanned by with gradings , and actions
(2.5) |
In particular, for , we have and .
The following result describes the decomposition tensor product of certain irreducible representations of .
Lemma 2.2.
Note that the action of on is defined via the comultiplication , and there is a sign adjustment due to the grading, e.g.
Using Lemma 2.2 repeatedly, we get the following decomposition of tensor products of the vector space representations .
Lemma 2.3.
[BM13, Theorem 6.4] The tensor product decomposes as
(2.7) |
2.3. A Basis of
In the rest of this section, we will give an explicit choice of highest weight vectors in with weights . See Proposition 2.7 and 2.8. This construction is partly motivated by the ‘canonical basis’ in [Zha02], and tensor products of the regular representation of the symmetric group. Similar constructions appeared in [Man19] as well. In Section 3, we will see that this choice of basis gives a natural description of the action of the braid group on .
Fix some for the rest of the section. We introduce some notations first.
Definition 2.4.
For , let denote the space of highest weight vectors in with weight , i.e.,
(2.8) |
Denote the space of highest weight vectors of by
Note that if is a basis of highest weight vectors , then is a basis of , by the description of the irreducible representations of in Equation 2.4 and the direct sum decomposition in Lemma 2.7. Therefore, we will focus on finding a basis of for each .
It follows directly from Lemma 2.7 that dim . In particular, is -dimensional, which is spanned by . For other values of , we introduce some other notations before giving a basis.
Definition 2.5.
For , let be the set of strings which satisfies the following conditions:
(2.9) |
We define the function by the following expression:
(2.10) |
where if for some , then we drop the part in the expression.
Remark.
Note that , so a string could be viewed as a recipe to apply ’s to different components of , where means applying to , and means applying -many ’s, each to a single to get
Example 2.6.
When , the only possible string in is the 1-digit string , for which the corresponding vector .
When , possible strings in are those such that and . Thus, we have
(2.11) |
Denote for . More explicitly,
(2.12) |
It is easy to see from the explicit formulae that is a linearly independent set of size . With the help of Lemma 2.9, we get that , so is a basis of .
Now we are ready to state the main result of this section.
Proposition 2.7.
For each , gives a basis of .
To prove this proposition, we will first prove the statement for . For other values of , we will prove the following statement.
Proposition 2.8.
For each , there is an isomorphism of -vector space
such that sends a standard basis of to :
where is the basis of defined as in Example 2.6.
We begin the proof of Proposition 2.7 by showing lies in .
Lemma 2.9.
For each and each , we have .
Proof.
It is enough to check each is a highest weight vector with the correct weight.
First, we give a more explicit formula for . By repeated application of in Equation (2.2), one gets
(2.13) |
and
(2.14) |
Therefore, for each as defined in Definition 2.5,
is a -linear combination of terms in such that in each term, components of the tensor product are and components of the tensor product are , as we require
for . Since has weight and has weight , the weight of is as required.
Now we show for any . Choose a string .
For , let
(2.15) |
and let , i.e. is the sum of entries in before .
Applying to , we get
where the first two equalities are definitions. The third equality follows from , so we can ignore those terms where is applied to . The fourth equality follows from and . The last equality follows from . ∎
Proof of Proposition 2.7 when .
Now we turn to the proof of Proposition 2.8, from which the general case of Proposition 2.7 will follow.
Proof of Proposition 2.8.
On the vector space , we define a product by:
(2.16) |
We extend this to a graded componentwise product on by the obvious formula:
(2.17) |
where
Define for . Let be the -vector space spanned by . Then for each pair with , we have
and for each ,
Therefore, defines an antisymmetric product on , and we can define an isomorphism
(2.18) |
such that for ,
where
Define
(2.19) |
as the restriction of to .
We are going to prove that
() |
Suppose we have shown ( ‣ 2.3), then as , we get . Since , and , it follows that is an isomorphism.
It is left to prove Equation ( ‣ 2.3), which follows from explicit calculations. Note that for a consecutive sequence of indices of length , we have
(2.20) |
where means this term is missed in the wedge product.
This shows a consecutive sequence of indices of length in the wedge product corresponds to applying to under the map . On the other hand, if the index is larger than in the wedge product , then they don’t interact with each other when we express them in terms of , and we can treat them separately when applying .
Now given any string , we can get a corresponding wedge product by requiring , and
(2.21) |
where is defined in Equation (2.15). In words, it says each in corresponds to a consecutive sequence of length in the index set of the wedge product .
It is easy to see this gives a bijection between and the set of elements
For example, one can construct an inverse map, by grouping the indices into blocks of consecutive ones. The th block of length corresponds to , and is given by the difference between th pair of non-consecutive indices. Applying the calculation in Equation (2.20) to each consecutive sequence of length in the index set of shows that
Hence, we have the Equation ‣ 2.3, and finish the proof Proposition 2.8. ∎
3. The action of the braid group on
As described in [Sar15], for each oriented tangle, we can associate a -equivariant map using the -matrix which gives the quasitriangular structure of . See [Sar15, Section 4] for more detailed explanation of the construction.
In this paper, we will consider the -equivariant maps associated to -tangles such that each strands are oriented upwards. We will omit the orientation of the tangles, remembering each strand is oriented upwards, and treat them as elements in the braid group . In this way, we get an action of on the -module . Since the action is -equivariant, it sends highest weight vectors to highest weight vectors and preserves the weight, so we get an action of on the -vector space for defined as in Definition 2.4. Conversely, the action of on is determined by its action on each by Schur’s lemma. We will prove that the action of on is almost the same as the diagonal action of on the wedge product , up to some powers of . Hence, the action of on could be described completely by its action on . Similar result is hinted in [Man19, Proposition 2.5.1]. We will use this to compute the effect of adding full twists on -positively oriented parallel strands on Alexander polynomial in Section 4.
We begin by recalling the definition of -equivariant maps associated to oriented tangles. Every strand in the tangle is supposed to be oriented upwards, so we drop the arrows in the tangle diagrams in this section.
For a positive crossing , we associate the map ,
(3.1) |
where is the vector space representation of as in Definition 2.1.
Fix some positive integer throughout the section. For each generator of the braid group , we associate the map by applying to the th and th component of , i.e.,
(3.2) |
It follows from the construction that this defines a -equivariant action of on . We denote the action by
As explained above, this gives an action of on each . See Definition 2.4 for the definition of . We denote this action by
It is easy to describe the action of on with respect to the basis as introduced in Example 2.6 via explicit calculations. We record it here for later convenience.
Lemma 3.1.
For each , we have
(3.3) |
Proof.
It follows from direct calculation. For example, if , then
where the underline indicates the th and th components of the tensor product. The rest cases are similar. ∎
Recall the isomorphism
defined in Proposition 2.8. See in particular Equation 2.18 and 2.19. The main result of this section is the following proposition.
Proposition 3.2.
For any , any and each generator , we have:
(3.4) |
where the action of on is the diagonal action of on each component of .
Proof.
By Proposition 2.7 and Proposition 2.8, it is enough to check the Equation 3.4 for of the form
Take an arbitrary . Recall defined in Definition 2.5,
as defined in Example 2.6, as defined in Equation 2.15 and let as defined in Equation 2.21.
Take some . The proof will be divided into five cases depending on the position of relative to the positions that ’s are applied to in . The calculation is straightforward, and the hardest part is to keep check of the indices.
-
(1)
If for some , i.e., is applied to some components in .
-
(2)
If for some , i.e., is applied to the th and th components in .
Let . The effect of applying to is the same as applying to the -tensor component. Note that
Therefore
On the other hand, there exists some index in which equals , by Equation 2.21. The action of sends to . Now for indices except , they can’t be equal to or , and acts on them by multiplication by . For , we have
For , we have
From this, we get
Therefore,
and the proposition holds in this case.
-
(3)
If for some , and , i.e., is applied to the first two components of . Note that
We can define a new string as follows.
-
(a)
If , let such that
In words, we obtain from by inserting a string between and in , then changing to and to .
-
(b)
If , let such that
In words, we change to , and to .
Then it follows from the above calculation that
On the other hand, by Equation 2.21, there exists some index in which is equal to , and as . So all the indices except are not equal to or . Hence,
where is obtained from by changing and keeping all the other indices the same. It follows from Equation 2.21 that , hence
and the proposition holds in this case.
-
(a)
-
(4)
If for some , and , i.e., is applied to the last two components of .
The computation is similar to the one in Case (3), and we leave it for the reader.
-
(5)
If for some , and . This is the same as and . In this case, is applied to the th and th components of .
The computation could be carried out in a similar manner as in Case (3), and one gets
So
Here is obtained from by the followings rules depending on whether or not.
-
(a)
If , then we change to , and to .
-
(b)
If , then we change to , to , to , and letting , for . In words, we delete from and add to each of and .
The string is defined similarly, by switching the roles of and .
-
(a)
∎
4. The effect of adding twists to Alexander polynomials
In this section, we study the effect of adding full twists along -positively oriented parallel strands to the Alexander polynomial. By the analysis in the previous section, especially Proposition 3.2, we can compute the action of on in terms of the action of on . For the full twist , we will see the action of it on is a scalar multiplication by some power of . Hence, acts on by scalar multiplications of different powers of on different highest weight subrepresentations of . See Proposition 4.3 for the explicit statement.
Let denote the projection of to the highest weight subrepresentation with weight , then from the previous analysis we can express each as a -linear combination of . Therefore, we can express for any using . By the description of the Alexander polynomials in terms of -equivariant maps, we get a similar result for Alexander polynomials. See Proposition 4.7. We explore some implication of this expression on the stabilization behavior of the Alexander polynomials when we insert enough full twists in Proposition 4.10.
We begin with some definitions. Recall the decomposition
in Lemma 2.7, and the subspace of highest weight vectors with weight in Definition 2.4
Definition 4.1.
For each , denote the subspace of highest weight subrepresentation with weight by , i.e.,
Define as the -equivariant projection from to the subspace .
Note that , as is the space of highest weight vectors of weight
, and each copy of is spanned by . Therefore,
Definition 4.2.
Define , and let , which is the braid representing the full twist on -strands. Denote the induced endomorphisms of on by respectively.
Since the action of on is -equivariant, it restricts to an action on for each . We will prove that the restriction acts by a scalar multiplication on each .
Proposition 4.3.
For each , we have
Proof.
Since , for respectively, and commutes with , the map could be written as
It is enough to check that as commutes with .
When , a basis of is given by Example 2.6. We know the action of on for any pair , as described in Lemma 3.1. It is then straightforward to compute that
(4.1) |
Let be the matrix representing , then is diagonalizable over , with distinct eigenvalues Hence the matrix which represents is a diagonal matrix with every diagonal entry equal to . Therefore,
and the proposition holds for .
When , we use the previous calculation in the case and Proposition 3.2. Proposition 3.2 says that for each generator , and every , we have
so
as is the product of -many elements of the form in .
By the calculation in the case when , we get that
so
(4.2) |
Since is an isomorphism, we get
for as required. ∎
An immediate corollary of this proposition is
Corollary 4.4.
We can write as a -linear combination of , i.e.,
(4.3) |
Now the task is to represent the projection maps in terms of linear combinations of powers of , which could be done easily by solving a linear system of equations. This linear system is guaranteed to be invertible by the non-vanishing of the Vandermonde determinant.
Definition 4.5.
Foe each , define as the matrix by
(4.4) |
Since is a Vandermonde matrix, it is invertible. Let denote the inverse matrix of .
Note that while each entry is a Laurent polynomial in , each entry is a rational function in instead, as we divide out the determinant of when inverting the matrix.
Proposition 4.6.
Proof.
It follows directly from Corollary 4.3. ∎
Let be an oriented link. Recall the Alexander polynomial could be obtained as follows. Cutting along a strand to get a - tangle. This tangle gives a -equivariant map on , which is a scalar multiplication of the identity. Denote this scalar by . Then
See [Sar15, Section 4] for details.
Let be an oriented link with some specific link diagram, such that some part of the link diagram consists of -parallel strands of the same orientation. Let denote this particular link diagram with this choice of -parallel strands. For , let denote the oriented link obtained by adding -full twists along the chosen -parallel strands. Denote . From the above calculation on the , and the expression of the Alexander polynomial as a -invariant, we get a similar relation on the Alexander polynomials of with the Alexander polynomials of .
Proposition 4.7.
For any , we have
(4.6) |
Proof.
It follows from Proposition 4.5 and the expression of Alexander polynomials as a -quantum invariant. ∎
This expression doesn’t look so useful at first glance. In particular, is not a Laurent polynomial, as it has the as its denominator. However, as all the Alexander polynomials are Laurent polynomials in , the coefficient before each in the expression is a Laurent polynomial as well. We give them a name for the convenience of later discussion.
Definition 4.8.
For each pair with and , define the Laurent polynomial by
With , we can write the Alexander polynomial as
(4.7) |
Note that the coefficients are determined by and don’t depend on the specific link .
As , we have the following stabilization results of the expressions .
Lemma 4.9.
The coefficients stabilize in the following sense as :
There exists a Laurent series with finitely many terms of negative degree in , such that for any , there exists , where for any , the first of terms in the increasing order of powers of equal the first terms of
Proof.
It follows from the expression of of . We formally invert the denominator of as a Laurent series with finitely many terms of negative degree in . Since is some fixed matrix which only depends on , for large enough , the term with lowest degree of in the expression
is for some constant , which is obtained when , and comes from the contribution of .
On the other hand, the lowest power of in is for some constant , where again comes from the contribution of . The difference in the powers is , which goes to infinity as . Therefore, for large enough (since there are only finitely many , we can pick large enough such that the following holds for every ), the first terms of are the same as the first terms of
Then
satisfies the requirement of the lemma. From explicit formula of , we see is a non-zero Laurent series. ∎
Because of Equation 4.7, and that all the Alexander polynomials for are Laurent polynomials of finite degree, we have similar stabilization results as in Lemma 4.9 for the Alexander polynomial as . The difference is that the limiting Laurent series obtained in this way might vanish, in which case we switch to the next leading Laurent series, until we reach a non-vanishing one. This explains the appearance of in the next proposition.
Proposition 4.10.
The Alexander polynomials stabilizes as in the following sense:
There exists a Laurent series with finitely many terms of negative degree in , and some integer , such that for any , there exists where for any , the first terms in the increasing order of degree of of agree with the first terms of
Proof.
It follows from Proposition 4.7 and Lemma 4.9. The Laurent series is given by
(4.8) |
and , given that this Laurent series does not vanish. If it vanishes, then by a similar argument as in Lemma 4.9, the first terms of are the same as the first terms of
given that doesn’t vanish.
In general, let
If doesn’t vanish, while , all vanish, then the first terms of are the same as the first terms of
This is the integer as stated in the proposition, and If vanishes for all integers (note by the symmetry of the Alexander polynomials, it is enough for to assume this holds for ), then also vanishes for each , and the statement trivially holds. ∎
Remark.
By the symmetry of the Alexander polynomial, we get similar stabilization results for the last few terms of as well.
Remark.
Since the Laurent series is defined as some -linear combinations of the Alexander polynomials for , it satisfies the usual skein relations for Alexander polynomials if we change a crossing away from the -parallel strands.
Example 4.11.
When ,
and the Equation 4.6 becomes
In this case, it is also easy to get the expression of from the inductive expression
by using the usual skein relation of the Alexander polynomials three times.
The Laurent series is given by
Example 4.12.
When ,
and
where
The Laurent series is
where we expand the inverse of the denominator as a power series in , given that it doesn’t vanish. If it vanishes, then
independent of .
Example 4.13.
Suppose is the torus knot where . Let be the link diagram of which is given by the closure of the braid , where all strands are oriented in the same direction. In this case, represents the torus knot . From the formula of the Alexander polynomial of torus knots
one can see that as , the first few terms of in the increasing order of degree of are obtained when in the summation, which are the same as the first few terms of
Therefore, we get directly the limiting Laurent series is given by
In this sense, torus knots are the prototypical examples of the stabilization result on Alexander polynomials under adding twists. Proposition 4.10 says the Alexander polynomials of other links behave in a similar way under adding full twists as the torus knots.
Example 4.14.
This time we start with the unlink of components, and the diagram we use for is the closure of the identity element in the braid group with the same orientation. Then represents the -components torus link . The Alexander polynomial of is given by the formula:
The first few terms of as are the same as the first few terms of
Therefore, the limiting Laurent series is given by
As in the previous example, this is the same as the computed using Equation 4.8.
References
- [BM13] Georgia Benkart and Dongho Moon, Planar rook algebras and tensor representations of , Comm. Algebra 41 (2013), no. 7, 2405–2416. MR 3169400
- [LC18] Peter Lambert-Cole, Twisting, mutation and knot Floer homology, Quantum Topol. 9 (2018), no. 4, 749–774. MR 3874002
- [Man19] Andrew Manion, On the decategorification of Ozsváth and Szabó’s bordered theory for knot Floer homology, Quantum Topol. 10 (2019), no. 1, 77–206. MR 3900777
- [Roz10] Lev Rozansky, A categorification of the stable SU (2) Witten-Reshetikhin-Turaev invariant of links in , arXiv preprint arXiv:1011.1958 (2010).
- [Sar15] Antonio Sartori, The Alexander polynomial as quantum invariant of links, Ark. Mat. 53 (2015), no. 1, 177–202. MR 3319619
- [Wil21] Michael Willis, Khovanov homology for links in , Michigan Math. J. 70 (2021), no. 4, 675–748. MR 4332675
- [Zha02] R. B. Zhang, Quantum enveloping superalgebras and link invariants, J. Math. Phys. 43 (2002), no. 4, 2029–2048. MR 1892766