A diagrammatic approach to the AJ Conjecture
Renaud Detcherry, Stavros Garoufalidis

TL;DR
This paper introduces a diagram-dependent version of the $ ilde{A}$-polynomial for knots, proves it satisfies one direction of the AJ Conjecture using octahedral decompositions and state sum formulas, advancing understanding of knot invariants.
Contribution
It proposes a new diagram-dependent $ ilde{A}$-polynomial and proves it satisfies one side of the AJ Conjecture using geometric and algebraic methods.
Findings
The diagram-dependent $ ilde{A}$-polynomial aligns with the $ ilde{A}$-polynomial conjecturally.
The proof employs octahedral decompositions from planar knot diagrams.
The approach connects geometric decompositions with quantum invariants.
Abstract
The AJ Conjecture relates a quantum invariant, a minimal order recursion for the colored Jones polynomial of a knot (known as the polynomial), with a classical invariant, namely the defining polynomial of the character variety of a knot. More precisely, the AJ Conjecture asserts that the set of irreducible factors of the -polynomial (after we set , and excluding those of -degree zero) coincides with those of the -polynomial. In this paper, we introduce a version of the -polynomial that depends on a planar diagram of a knot (that conjecturally agrees with the -polynomial) and we prove that it satisfies one direction of the AJ Conjecture. Our proof uses the octahedral decomposition of a knot complement obtained from a planar projection of a knot, the -matrix state sum formula for the colored Jones polynomial, and itsâŚ
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A diagrammatic approach to the AJ Conjecture
Renaud Detcherry
Max Planck Institute for Mathematics
Vivatsgasse 7, 53111 Bonn, Germany
http://people.mpim-bonn.mpg.de/detcherry
 andÂ
Stavros Garoufalidis
Max Planck Institute for Mathematics
Vivatsgasse 7, 53111 Bonn, Germany
http://www.math.gatech.edu/~stavros
(Date: Friday 1 March, 2019)
Abstract.
The AJ Conjecture relates a quantum invariant, a minimal order recursion for the colored Jones polynomial of a knot (known as the polynomial), with a classical invariant, namely the defining polynomial of the character variety of a knot. More precisely, the AJ Conjecture asserts that the set of irreducible factors of the -polynomial (after we set , and excluding those of -degree zero) coincides with those of the -polynomial. In this paper, we introduce a version of the -polynomial that depends on a planar diagram of a knot (that conjecturally agrees with the -polynomial) and we prove that it satisfies one direction of the AJ Conjecture. Our proof uses the octahedral decomposition of a knot complement obtained from a planar projection of a knot, the -matrix state sum formula for the colored Jones polynomial, and its certificate.
1991 Mathematics Classification. Primary 57N10. Secondary 57M25.
*Key words and phrases: Knot, planar projection, planar diagram, Jones polynomial, colored Jones polynomial, AJ Conjecture, -holonomic sequences, certificate, holonomic modules, gluing equations, character variety. *
Contents
-
2 Knot diagrams, their octahedral decomposition and their gluing equations
-
2.4 The spine of the -triangulation of a knot diagram and its gluing equations
-
3 -holonomic functions, creative telescoping and certificates
-
4.1 State sum formula for the colored Jones polynomial of a knot diagram
-
5.1 From the annihilator of the state summand to the gluing equations variety
1. Introduction
1.1. The colored Jones polynomial and the AJ Conjecture
The Jones polynomial of a knot [Jon87] is a powerful knot invariant with deep connections with quantum field theory, discovered by Witten [Wit89]. The discoveries of Jones and Witten gave rise to Quantum Topology. An even more powerful invariant is the colored Jones polynomial of a knot , a sequence of Laurent polynomials that encodes the Jones polynomial of a knot and its parallels. Since the dependence of the colored Jones polynomial on the variable plays no role in our paper, we omit it from the notation. The colored Jones polynomial determines the Alexander polynomial [BNG96], is conjectured to determine the volume of a hyperbolic knot [Kas95, Kas97, MM01], is conjectured to select two out of finitely many slopes of incompressible surfaces of the knot complement [Gar11b], and is expected to determine the character variety of the knot, viewed from the boundary [Gar04]. The latter is the AJ Conjecture, which is the focus of our paper.
The starting point of the AJ Conjecture [Gar04] is the fact that the colored Jones polynomial of a knot is -holonomic [GL05], that is, it satisfies a nontrivial linear recursion relation
[TABLE]
where for all . We can write the above equation in operator form as follows where is an element of the ring where are the operators that act on sequences of functions by:
[TABLE]
Observe that the set
[TABLE]
is a left ideal of , nonzero when is -holonomic. Although the latter ring is not a principal left ideal domain, its localization is, and cleaning denominators allows one to define a minimal -order, content-free element which annihilates the colored Jones polynomial.
On the other hand, the -polynomial of a knot [CCG*+*94] is the defining polynomial for the character variety of representations of the boundary of the knot complement that extend to representations of the knot complement.
The AJ Conjecture asserts that the irreducible factors of of positive -degree coincide with those of . The AJ Conjecture is known for most 2-bridge knots, and some 3-strand pretzel knots; see [L0Ě6] and [LZ17].
Let us briefly now discuss the -holonomicity of the colored Jones polynomial [GL05]: this follows naturally from the fact that the latter can be expressed as a state-sum formula using a labeled, oriented diagram of the knot, placing an -matrix at each crossing and contracting indices as described for instance in Turaevâs book [Tur94]. For a diagram with crossings, this leads to a formula of the form
[TABLE]
where the summand is a -proper hypergeometric function and for fixed , the support of the summand is a finite set. The fundamental theoreom of -holonomic functions of Wilf-Zeilberger [WZ92] concludes that is -holonomic. Usually this ends the benefits of (4), aside from its sometimes use as a means of computing some values of the colored Jones polynomial for knots with small (eg or less) number of crossings and small color (eg, ).
Aside from quantum topology, and key to the results of our paper, is the fact that a planar projection of a knot gives rise to an ideal octahedral decomposition of its complement minus two spheres, and thus to a gluing equations variety and to an -polynomial reviewed in Section 2 below. In [KKY18], Kim-Kim-Yoon prove that coincides with the -polynomial of , and in [KP] Kim-Park prove that is, up to birational equivalence, invariant under Reidemeister moves, and forms a diagrammatic model for the decorated character variety of the knot.
The aim of the paper is to highlight the fact that formulas of the form (4) lead to further knot invariants which are natural from the point of view of holonomic modules and form a rephrasing of the AJ Conjecture that connects well with the results of [KKY18] and [KP].
1.2. -holonomic sums
To motivate our results, consider a sum of the form
[TABLE]
where and and is a proper -hypergeometric function with compact support for fixed . Then is -holonomic but more is true. The annihilator
[TABLE]
of the summand is a -holonomic left ideal where and are operators, each acting in one of the variables with the obvious commutation relations (operators acting on different variables commute and the ones acting on the same variable -commute). Consider the map
[TABLE]
It is a fact (see Proposition 3.2 below) that
[TABLE]
and that the left hand side is nonzero. Elements of the left hand side are usually called âgood certificatesâ, and in practice one uses the above inclusion to compute a recursion for the sum [PWZ96, Zei91]. If and denotes generators of the left and the right hand side of (7), it follows that is a right divisor of . We will call the latter the certificate recursion of obtained from (5).
In a sense, the certificate recursion of is more natural than the minimal order recursion and that is the case for holonomic -modules and their push-forward, discussed for instance by Lairez [Lai16].
What is more important for us is that if one allows presentations of of the form (5) where is allowed to change by for instance, consequences of the -binomial identity, then one can obtain an operator which is independent of the chosen presentation.
1.3. Our results
Applying the above discussion to (4) with , allows us to introduce the certificate recursion of the colored Jones polynomial, which depends on a labeled, oriented planar diagram of a knot. We can also define to be the left gcd of the elements in the local ring , lifted back to .
We now have all the ingredients to formulate one direction of a refined AJ Conjecture. Our proof uses the octahedral decomposition of a knot complement obtained from a planar projection of a knot, the -matrix state sum formula for the colored Jones polynomial, and its certificate.
Theorem 1.1**.**
*For every knot ,
(a) divides .
(b) Every irreducible factor of of positive -degree is a factor of .*
Remark 1.2**.**
The -polynomial has only been computed in a handful of cases, see [GS10], [GM11], [GK12] and [GK13]. In all cases where is known, it is actually obtained from certificates and in that case .
Question 1.3**.**
Is it true that for any knot , one has ?
Question 1.4**.**
Is it true that the certificate recursion of a planar projection of a knot is invariant under Reidemester moves on ?
A positive answer to the latter question is a quantum analogue of the fact that the gluing equation variety associated to a diagram is independent of , a result that was announced by Kim and Park [KP]. We believe that the above question has a positive answer, coming from the fact that the Yang-Baxter equation for the R-matrix follows from a -binomial identity, but we will postpone this investigation to a future publication.
1.4. Sketch of the proof
To prove Theorem 1.1, we fix a planar projection of an oriented knot . On the one hand, the planar projection gives rise to an ideal decomposition of the knot complement (minus two points) using one ideal octahedron per crossing, subdividing further each octahedron to five ideal tetrahedra. This ideal decomposition gives rise to a gluing equations variety, discussed in Section 2. On the other hand, the planar projection gives a state-sum for the colored Jones polynomial, by placing one -matrix per crossing and contracting indices. The summand of this state-sum is -proper hypergeometric and its annihilator defines an ideal in a quantum Weyl algebra, discussed in Section 4. The annihilator ideal is matched when with the gluing equations ideal in the key Proposition 5.1. This matching, implicit in the Grenoble notes of D. Thurston [Thu99], combined with a certificate (which is a quantum version of the projection map from gluing equations variety to ), and with the fact that the gluing equation variety sees all components of the character variety [KKY18], conclude the proof of our main theorem.
Our method of proof for Theorem 1.1 using certificates to show one direction of the AJ Conjecture is general and flexible and can be applied in numerous other situations, in particular to a proof of one direction of the AJ Conjecture for state-integrals, and to one direction of the AJ Conjecture for the 3Dindex [AM, Dim13]. This will be studied in detail in a later publication. For a discussion of the AJ Conjecture for state-integrals and for a proof in the case of the simplest hyperbolic knot, see [AM].
Finally, our proof of Theorem 1.1 does not imply any relation between the Newton polygon of the polynomial and that of . If the two Newton polygons coincided, the Slope Conjecture of [Gar11b] would follow, as was explained in [Gar11a]. Nonetheless, the Slope Conjecture is an open problem.
2. Knot diagrams, their octahedral decomposition and
their gluing equations
2.1. Ideal triangulations and their gluing equations
Given an ideal triangulation of a 3-manifold with cusps, Thurstonâs gluing equations (one for each edge of ) give a way to describe the hyperbolic structure on and its deformation if is hyperbolic [Thu77, NZ85]. The gluing equations define an affine variety , the so-called gluing equations variety, whose definition we now recall. The edges of each combinatorial ideal tetrahedron get assigned variables, with opposite edges having the same variable as in the left hand side of Figure 1. The triple of variables (often called a triple of shapes of the tetrahedron)
[TABLE]
satisfies the equations
[TABLE]
and every solution of (8) uniquely defines a triple of shapes of a tetrahedron. Note that the shapes of the tetrahedron , , or lie in , and that they are uniquely determined by . When we talk about assigning a shape to a tetrahedron below, it determines shapes and as in Figure 1.
Given an ideal triangulation with tetrahedra, assign shapes for to each tetrahedron. If is an edge of the corresponding gluing equation is given by
[TABLE]
where is the set of all tetrahedra that meet along the edge , and is the shape parameter corresponding to the edge of . The gluing equation variety is the affine variety in the variables defined by the edge gluing equations, for all edges of . Equivalently, it is the affine variety in the variables defined by the edge equations and the equations (8), one for each tetrahedron.
We next discuss the relation between a solution to the gluing equations and decorated (or sometimes called, augmented) representations of the fundamental group of the underlying 3-manifold . The construction of decorated representations from solutions to the gluing equations appears for instance in Zickertâs thesis [Zic08] and also in [GGZ15]. Below, we follow the detailed exposition by Dunfield given in [BDRV, Sec.10.2-10.3].
A solution of the gluing equations gives rise to a developing map from the universal cover to the 3-dimensional hyperbolic space . Since the orientation preserving isometries of are in , this in turn gives rise to a representation of the fundamental group , well-defined up to conjugation. Whatâs more, we get a decorated representation (those were called augmented representations in Dunfieldâs terminology). Following the notation of [BDRV, Sec.10.2-10.3], let denote the augmented character variety of . Thus, we get a map:
[TABLE]
So far, can have boundary components of arbitrary genus. When the boundary consists of a single torus boundary component, and is a simple closed curve on , the holonomy of an augmented representation gives a regular function . Note that for a decorated representation , the set of squares of the eigenvalues of is given by . Once we fix a pair of meridian and longitude of the boundary torus, then we get a map
[TABLE]
The defining polynomial of the 1-dimensional components of the above map is the -polynomial of the 3-manifold . Technically, this is the -version of the -polynomial and its precise relation with the -version of the -polynomial (as defined by [CCG*+*94]) is discussed in detail in Champanerkarâs thesis [Cha03]; see also [BDRV, Sec.10.2-10.3].
We should point out that although (9) is a map of affine varieties, its image may miss components of , and hence the gluing equations of the triangulation may not detect some factors of the -polynomial. In fact, when the boundary of consists of tori, the image of (9) always misses the components of abelian representations (and every knot complement has a canonical such component), but it may also miss others. For instance, there is a 5-tetrahedron ideal triangulation of the knot with an edge of valency one, and for that triangulation, is empty.
For later use, let us record how to compute the holonomy of a peripheral curve on the gluing equations variety. Given a path in a component of that is normal with respect to this triangulation, it intersects the triangles of in segment joining different sides. Each segment may go from one side of the triangle to either the adjacent left side or right side. Also it separates one corner of the triangle from the other two; this corner correspond to a shape parameter which we name or depending whether the segment goes left or right. The holonomy of is then:
[TABLE]
2.2. Spines and gluing equations
The ideal triangulations that we that we will discuss in the next section come from a planar projection of a knot, and it will be easier to work with their spines, that is the the dual -skeleton. Because of this reason, we discuss the gluing equations of an ideal triangulation in terms of its spine. In that case, edges of are dual to 2-cells of the spine, and give rise to gluing equations. Recall that a spine of is a CW-complex embedded in , such that each point of has a neighborhood homeomorphic to either , where is the -shaped graph or to the cone over the edges of a tetrahedron, and such that is homeomorphic to . Points of the third type are vertices of the spine, points of the second type form the edges of the spines and points of the first type form the regions of the spine.
For any ideal triangulation of , the dual spine is obtained as shown in Figure 1. Shape parameters that were assigned to tetrahedra are now assigned to vertices of the spine. At each vertex, two opposite corners bear the same shape parameter , and the other bear the parameters according to the cyclic ordering (see Figure 1). Edge equations translate into region equations, the region equation associated to the region being:
[TABLE]
For a path on the spine that is in normal position with respects to , it intersects each region in a collection of segments . The holonomy of the segment is
[TABLE]
where left and right corners are defined as in Figure 2, and the holonomy of is
[TABLE]
2.3. The octahedral decomposition of a knot diagram
In this section we fix a diagram in of an oriented knot . By diagram, we mean an embedded 4-valent graph in the plane, with an overcrossing/undercrossing choice at each vertex. Let and denote the set and the number of crossings of . In this section as well as the remainder of the paper, an arc of will be the segment of the diagram joining two successive crossings of . An overpass (resp. underpass) will be a small portion of the upper strand (resp. lower strand) of a crossing. We will denote the set of overpasses by and the set of underpasses by . An overarc (resp. underarc) will be the portion of the knot joining two successive underpasses (resp. overpasses). An overarc of may pass through some number of crossings of , doing so as the upper strand each time.
Given a diagram of the knot with crossings, let be some ball lying above the projection plane and another ball lying under the projection plane. A classical construction, first introduced by Weeks in his thesis, and implemented in SnapPy as a method of constructing ideal triangulations of planar projections of knots [CDW, Wee05], yields a decomposition of into ideal octahedra. The decomposition works as follows: at each crossing of , put an octahedron whose top vertex is on the overpass and bottom vertex is on the underpass. Pull the two middle vertices lying on the two sides of the overpass up towards and the two other middle vertices down towards . One can then patch all these octahedra together to get a decomposition of . We refer to [KKY18] as well as [Thu99] for figures and more details on this construction.
From the octahedral decomposition of , one can get an ideal triangulation of simply by splitting the octahedra further into tetrahedra. There are two natural possibilities for this splitting, as one can cut each octahedra into either or tetrahedra as shown in Figure 3. We will be interested in the decomposition where we split each octahedra into tetrahedra, obtaining thus a decomposition of into tetrahedra. We denote this ideal triangulation by , and we call it the â-triangulation of â.
Since the inclusion map is an isomorphism on fundamental groups, a solution to the gluing equations of gives rise to a decorated representation of the knot complement.
2.4. The spine of the -triangulation of a knot diagram
and its gluing equations
Let denote the gluing equation variety of . To write down the equations of , we will work with the dual spine, and use the spine formulation of the gluing equations introduced in Section 2.1. We describe this spine just below. This well-known spine is studied in detail by several authors including [KKY18].
Figure 4 shows a picture of the spine near a crossing of . The spine contains vertices near each crossing of and can be described as follows:
First we embed in as a solid torus sitting in the middle of the projection plane; except for overpasses which go above the projection plane and underpasses which go below. We let the boundary of a tubular neighborhood of to be a subset of the spine. At each crossing we connect the overpass and the underpass using two triangles that intersects transversally in one point. Finally we glue the regions of the projection plane that lie outside to the rest of the spine. The regions of the spine are then of types:
- â˘
An upper/lower triangle region for each crossing, and in total.
- â˘
For each region of one gets an horizontal region in the spine; we call these big regions, in total.
- â˘
The boundary of a neighborhood of is cut by the triangle regions and the big regions into regions lying over the projection plane (upper shingle region) and some lying under the projection plane (lower shingle regions). Note that upper shingle regions start and end at underpasses; they are in correspondance with the overarcs of the diagram, in total. Similarly, the lower shingle regions are in correspondance with underarcs, and there is also of them.
We now assign shape parameters to each vertex of the spine as shown in Figure 4. There are shape parameters for each crossing : a central one which we call and others: standing for lower-in, lower-out, upper-in and upper-out. When the crossing we consider is clear, we will sometimes write dropping the index .
Note that the assignment of shape parameters is such that the main version of the parameter lies on a corner of a triangle region, while the auxiliary are prescribed by the cyclic ordering induced by the boundary of .
We can now write down the gluing equations coming from the -spine:
The upper/lower triangle equations are (in the notation of Figure 4)
[TABLE]
The upper/lower shingle equations. Consider an upper shingle region corresponding to an overarc going from some crossing labelled to the crossing , going through crossings as overpasses. Then the shingle region has one corner for each of its ends, and corners for each overpasses, as explained in Figure 5. We get:
[TABLE]
Lemma 2.1**.**
The upper/lower shingle equations have the equivalent forms, respectively:
[TABLE]
[TABLE]
Proof.
Grouping together shape parameters coming from the same vertex and using , we get:
[TABLE]
and then, using Equation (11):
[TABLE]
Finally, using Equation (11), we can rewrite this as equation (12) between only âs (or only âs) parameters.
Similarly for a lower shingle region corresponding to an underarc running from crossing to crossing , one gets an equation:
[TABLE]
which simplifies to (13). â
Figure 6 shows a top-view of the -spine near a crossing, as well as the shape parameters of horizontal corners of the spine. We see that each vertex of a region of gives rise to corners in the corresponding big region. For each region of , we get a big region equation of the form
[TABLE]
where the corner factors are prescribed by the rule shown in Figure 6.
Below, we will denote the triangle, region and shingle equations by , and respectively. The above discussion defines the gluing equations variety as an affine subvariety of defined by
[TABLE]
We now express the holonomies and of the meridian and zero winding number longitude in terms of the above shape parameters. Note that if is not the unknot, it is always possible to find in the diagram of an underpass that is followed by an overpass that corresponds to a different crossing of . We then name those two crossings and . Assume that the meridian is positioned as shown in Figure 7. Then the rule described in Section 2.1 gives us the following holonomy:
[TABLE]
As , we get:
[TABLE]
Finally, we turn to the holonomy of a longitude. We first compute the holonomy of the longitude corresponding to the blackboard framing of the knot. We can represent this longitude on the diagram as a right parallel of . We draw this longitude on the spine in Figure 8, we can see that it intersects each upper or lower shingle region in one segment.
We compute the holonomy of each segment in an upper shingle using the convention
[TABLE]
and each lower shingle segment using the convention
[TABLE]
We can actually ignore the signs as there are segments, an even number.
As Figure 8 shows, we get:
[TABLE]
The last product is over the set of crossings of , and for simplicity we do not indicate the dependence of the variables on the crossing . Let be the longitude with zero winding number with . The winding number of the blackboard framing longitude is the writhe of the diagram , which can be computed by , where and are the number of positive and negative crossings of the diagram. We then have and thus
[TABLE]
2.5. Labeled knot diagrams
In this section we introduce a labeling of the crossings in a knot diagram, closely related to the Dowker-Thistlethwaite notation of knots.
Recall that is a planar diagram of an oriented knot and that we have chosen two special crossings and that are successive in the diagram, such that such crossing corresponds to an underpass and crossing to an overpass. This choice determines a labeling of crossings of as follows.
Following the knot, we label the other crossings Note that as the knot passes through each crossing twice, each crossing of gets two labels . Exactly one of those two labels correspond to the overpass and the other one to the underpass. Arcs of the diagram join two successive over- or underpasses labeled and (or and ). We write for the arc joining crossings and .
This labeling is illustrated in Figure 9 in the case of the Figure eight knot.
2.6. Analysis of triangle and shingle relations
In this section, we show that the triangle and shingle equations allow us to eliminate variables in the gluing variety . We have the following:
Proposition 2.2**.**
In , each of the variables are monomials in the variables and .
Proof.
Fix a labeled knot diagram as in Section 2.5. Before eliminating variables, we start by assigning to each arc of the diagram a new parameter . These parameters are expressed in terms of the previous parameters by the following rules:
[TABLE]
We recall that in the above (resp. ) is the set of overpasses (resp. underpasses) in the diagram . Also, given integers with , we denote
[TABLE]
Note that the arc parameters are all clearly monomials in and the âs.
We claim that each of the shape parameters are monomials in the âs and . This will imply the proposition. Indeed, let be an arc of . Then we claim that:
[TABLE]
Note by definition. If is an underpass, the formula
[TABLE]
matches with the upper shingle equation expressing in terms of . Indeed, if is the underpass coming immediately after underpass , Equation (12) says:
[TABLE]
As crossings correspond to overpasses and to an underpass, we also have
[TABLE]
By induction, we find that for any underpass .
The second case is then a consequence of the lower triangle equation , and the fact that as is an underpass.
Note that by Equation (16), so the fourth case is valid for the arc . Similarly to case 1, we can prove case 4 for other arcs ending in an overpass from the lower shingle equations by induction.
Finally, the third case follows as , and . â
In the rest of the paper, we will often use the arc parameters defined above to express equations in
For instance, thanks to Proposition 2.2, we can rewrite the big region equations as equations , where is expressed in terms of the variables only.
Remark 2.3**.**
Although the arc parameters are just monomials in the variables, they are helpful for writing down the equations defining in a more compact way. When the choice of a crossing is implicit, we introduce a simplified notation for the parameters associated to arcs neighboring . We will write for the parameters associated to the inward half of the overpass, inward half of underpass, outward half of underpass and outward half of underpass.
With this convention, at any crossing we have:
[TABLE]
For instance, we get a new expression of the holonomy of the longitude:
Proposition 2.4**.**
With the convention of Remark 2.3, the holonomy of the zero-winding number longitude is expressed by:
[TABLE]
Proof.
By Equation (17) we have:
[TABLE]
â
2.7. Analysis of big region equations
Recall that the big region equations are parametrized by the regions of the planar diagram , i.e., by the connected components of . In this section, we give an alternative set of equations which are parametrized by the crossings of , and we call those the loop equations.
Our motivation comes from the fact that we will later match the loop equations with equations that come from a state sum formula for the colored Jones polynomial.
Consider a crossing in the labeled diagram . Recall from Section 2.5 that has two labels . The arc starts and ends at the same crossing, hence one may close it up to obtain a loop . For a region of the diagram, let us pick a point in the interior of . We write for the winding number of relative to the point . The big region equation corresponding to the region is , where is the product of corners factors, see Equation (14) and Figure 6. The loop equation is then defined by
[TABLE]
We also introduce
[TABLE]
Proposition 2.5**.**
The set of equations , for all is equivalent to the set of equations for all region of .
Proof.
The equations , are clearly implied by the big region equations as the âs and are monomials in the âs. We will show that the âs are also monomials in and the âs, and thus equations are a consequence of loop equations.
Let us consider the diagram as an oriented -valent graph embedded in . For any , we can also introduce a loop equation
[TABLE]
Note that is a morphism of group and that the equation can be presented in this form too:
Indeed, chose with positive orientation. Then if , and , hence .
Thus we only need to prove that is generated by and the classes . The diagram has vertices and edges, and thus . So we need to show that and the loops are a -basis of . To do this we first show that they are linearly independent in the space of -chains .
Recall that we fixed a labeling of overpasses and underpasses in following the knot . Note that the arcs give a basis of . We order this basis with the convention .
Then in , and if a crossing has labels , then .
We see that is not in the space generated by the as it is the only one with non-zero coordinate along .
Moreover, the loops are linearly independent as the indices of their first non-zero coordinates are all different.
So and the are linearly independent in , and thus a -basis of . We can actually show that they form a -basis of . Indeed if , we can subtract a -linear combination of and the âs to to obtain an element with [math] coordinate on and each for each crossing with labels . This element has then to be zero as is a -basis of .
Thus and the âs generate , and the âs are monomials in the . â
2.8. Formulas for the loop equations
In this section, we simplify the equations which we defined as monomials in the big region equations. Our goal is to express those equations in terms of the arc parameters introduced in Section 2.6, which we recall are monomials in the variables.
Proposition 2.6**.**
Let be a crossing of with labels . For , let if corresponds to a positive crossing and otherwise. Let also and . Then we have:
[TABLE]
where in the above we set
[TABLE]
Proof.
We recall that is the loop obtained from the arc of by gluing its two ends together. Let also be the complementary loop of , which is obtained from the arc by gluing the two ends. Note that goes through the underpass labeled .
As is a product of big region equations, and each big region factor is a product of corner factors, we can rewrite as a product of corner factors. Each corner of appears in one region only , and the winding number of around is the same as . Thus we may rewrite as
[TABLE]
where the corner factors are those of Figure 6.
Figure 10 shows the local pattern of winding numbers of corners near a crossing of , depending which neighboring arcs belong to and . First let us note for a crossing between two strands of , all local winding numbers are equal, thus the crossing contributes by the product of all corners factors to some power. However, at any positive crossing, the product of corner factors is
[TABLE]
by the rule and the triangle equations. Similarly, at any positive crossing, the product of corner factors is
[TABLE]
So crossings between two strands of do not contribute to .
Next we consider a crossing between one strand of and one strand of . By the local winding numbers shown in Figure 10 and that fact that the product of the corner factors at a crossing is , such a crossing contributes by the product of the two corner factors to the left of . Similarly, for a crossing between two strands of , we get the product of the two corner factors to the left of the first strand times the two corner factors to the left of the other strand.
Hence, each overpass or underpass of contributes to one factor which is the product of the two left corner factors. By the rule described in Figure 6, for a positive overpass we get
[TABLE]
where the last equality comes from the fact that, at any crossing, . Similarly, at a negative overpass we get:
[TABLE]
At a positive underpass we get:
[TABLE]
and, finally, at a negative underpass we get:
[TABLE]
All those overpass/underpass factors correspond to the ones in Equation (21). Finally we turn to the contribution of crossing . By the local pattern of winding numbers in Figure 10, and the corner factors rule of Figure 6, we have, if is a positive overpass:
[TABLE]
If is a negative overpass, we have:
[TABLE]
If is a positive underpass, then:
[TABLE]
Finally if is a negative underpass, then:
[TABLE]
We clearly see that in each case the factor matches with that of Proposition 2.6. â
We want to rearrange the loop equations slightly, grouping together the factors on the one side and the factors and on the other side. For the former we claim:
Lemma 2.7**.**
Let be a crossing of with labels , the loop , and the loop . For an over- or underpass, let be the sign of the corresponding crossing. Then we have
[TABLE]
Remark 2.8**.**
By the above lemma, the factors in the product on the right of Equation (21) group up to one factor .
Proof.
The crossings of that are in are of two types: self-crossings of and crossing between and . Self-crossings of belong to both an overpass and an underpass , hence in both sums in the lemma, those crossings contribute to .
Moreover the linking number of and can be computed in two ways as or as . Thus hence in both sums in the lemma mixed crossings contribute to . â
Lemma 2.9**.**
Let be a crossing of with labels . Then:
[TABLE]
where if is an overpass and .
Proof.
We have by definition of and :
[TABLE]
Moreover, as at any crossing , we have:
[TABLE]
Finally, if is an overpass then as and . Similarly, if is an underpass. â
From Proposition 2.6 together with Lemma 2.7 and 2.9, we obtain another formula for the loop equation:
Proposition 2.10**.**
Let be a crossing of with labels and let be the associated loop equation. If , let be the sign of the corresponding crossing. Then:
[TABLE]
where is obtained from of Proposition 2.6 by replacing respectively a factor , , , or by , , , or if is a positive overpass, a negative overpass, a positive underpass or a negative underpass.
Finally, we turn to the expression of the last loop equation that we introduced in Section 2.7.
Proposition 2.11**.**
We have the formula:
[TABLE]
Proof.
We proceed similarly as in the proof of 2.6. As we are taking the whole knot instead of one of the loops , the local pattern of winding numbers at any crossing looks like the third drawing in Figure 10.
By the corner factor rule of Figure 6, we get a factor
[TABLE]
at a positive crossing and a factor:
[TABLE]
at a negative crossing, using that at any crossing. â
2.9. A square root of the holonomy of the longitude
In this section, we show that the holonomy of the longitude admits a square root in . We prove the following.
Proposition 2.12**.**
Let be defined by
[TABLE]
Then and .
Proof.
By Equation (18),
[TABLE]
and by Equation (22):
[TABLE]
Those two equations clearly imply that . The non-trivial part is to show that is actually in , which is equivalent to showing the degree of the monomial is even in each of the variable and .
First we note that all arc parameters have degree [math] along and degree along . So what we need to show is that the product has odd degree along each variable associated to a crossing. We remark that this product is also the product of all arc parameters as each arc is an inward arc of exactly one crossing.
Let be a crossing with labels . Then for any arc the arc parameter is of the form , where , and if and only if . So all we have to show is that is always odd for any crossing . The reason is that the loop has intersection points with the rest of , and those intersection points bound a collection of segments, which are the intersection of with a disk bounded by . So is always even. â
3. -holonomic functions, creative telescoping and
certificates
In this section we recall some properties of -holonomic functions, creative telescoping and certificates, which we will combine with a state sum formula for the colored Jones polynomial to prove our main Theorem 1.1. Recall that a -holonomic function is one that satisfies a non-zero recursion relation of the form (1), i.e., a function with annihilator (3) satisfying . -holonomic functions of several variables are defined using a notion of Hilbert series dimension, and are closed under sums, products as well as summation of some of their variables. Building blocks of -holonomic functions are the proper -hypergeometric functions of [WZ92]. For a detailed discussion of -holonomic functions, we refer the reader to the survey article [GL16].
The following proposition is the fundamental theorem of -holonomic functions. When is proper -hypergeometric, a proof was given in Wilf-Zeilberger [WZ92]. A detailed proof of the next proposition, as well as a self-contained introduction to -holonomic functions, we refer the reader to [GL16].
Proposition 3.1**.**
(a) Proper -hypergeometric functions are -holonomic.
(b) Let be -holonomic in the variables such that has finite support for any and let be defined by
[TABLE]
Then is -holonomic.
The above proposition combined with an -matrix state-sum formula for the colored Jones polynomial implies that the colored Jones polynomial of a knot (or link, colored by representations of a fixed simple Lie algebra) is -holonomic [GL05].
With the notation of the above proposition, a natural question is how to compute given . This is a difficult problem practically unsolved. However, an easier question can be solved: namely given , how to compute a nonzero element in . The answer to this question is given by certificates, which are synonymous to the method of creative telescoping, coined by Zeilberger [Zei91]. The latter aims at computing recursions for holonomic functions obtained by summing/integrating all but one variables. For a detailed discussion and applications, see [PWZ96, WZ92] and also [BLS13].
Proposition 3.2**.**
(a) Let and be as in Proposition 3.1, and consider the map from (6). Let
[TABLE]
Then .
(b) There exist as above with .
Nonzero elements as in (24) are called âcertificatesâ, and those that satisfy are called âgood certificatesâ. Certificates are usually computed in the intersection , where membership reduces to a linear algebra question over the field and then lifted to the ring by clearing denominators.
Part (b) is shown in Zeilberger [Zei90] and in detail in Koutschanâs thesis [Kou09, Thm.2.7]. In the latter reference, this is called the âelimination propertyâ of holonomic ideals. Part (a) is easy and motivates the name âcreative telescopingâ. Indeed, one may write
[TABLE]
A recurrence relation of this form is also called a certificate. After expanding the sum , the terms
[TABLE]
are telescoping sums and thus equal to [math]. Finally, note that when is proper -hypergeometric, an operator as above may be found by using its monomials as unknowns and solving a system of linear equations of . Hence, once is found (and that is the difficult part), it is easy to check that it satisfies the relation , which reduces to an identity in a field of finitely many variablesâhence the name âcertificateâ.
Part (b) follows by multiplying an element of on the left if necessary by a monomial in . We thank C. Koutschan for pointing this out to us.
4. The colored Jones polynomial of a knot
4.1. State sum formula for the colored Jones polynomial
of a knot diagram
In this section, we use a diagram of an oriented knot to give a (state sum) formula for the -th colored Jones polynomial of . Such a formula is obtained by placing an -matrix at each crossing, coloring the arcs of the diagram with integers, and contracting tensors as described for instance in Turaevâs book [Tur94]. The formula described in this section follows the conventions introduced in [GL15]; we also refer to [GL15] for all proofs.
For , we define the -th quantum factorial by
[TABLE]
Note that quantum factorials satisfy the recurrence relation for any . As it will be helpful for us to have recurrence relations that are valid for any , we will use the following convention of quantum factorials and their inverses:
[TABLE]
With the above definition and with the notation of (2) we have:
[TABLE]
Fix a labeled diagram of an oriented knot as in Section 2.5. After possibly performing a local rotation, one can arrange so that at each crossing the two strands of are going upwards. The diagram is then composed of two types of pieces: the crossings (which can be possible or negative) and local extrema. Let be the set of arcs of the diagram , we say that a coloring
[TABLE]
is -admissible if the color of any arc is in and for any crossing, if are the color of the neighboring arcs in shown in Figure 11, then . Let be the set of all -admissible colorings of the arcs of . Note that coincides with the set of lattice points in the -th dilatation of a rational convex polytope defined by the -admissibility conditions.
For a proof of the next proposition, we refer to [GL15, Sec.2].
Proposition 4.1**.**
The normalized -th colored Jones polynomial of is obtained by the formula:
[TABLE]
where is a product of weights associated to crossings and extrema of as shown in Figure 11.
The insertion of the factor in front of the above sum is done for convenience only, so that is a Laurent polynomial in rather than one in . This normalization plays no role in the AJ Conjecture. Note that we have for every knot and for any and is the Jones polynomial of .
Note that the color of all arcs are completely determined by the shifts associated to crossings and the color of the arc . In other words, is a linear function of . Suppressing the dependence on , we abbreviate simply by .
When examining recurrence relations for the colored Jones it will be more convenient to express as a sum over all rather than a sum over colorings in the set of lattice points in the rational convex polytope . For this we have the lemma:
Lemma 4.2**.**
For any knot , we have:
[TABLE]
Proof.
We recall that we have set the convention if . From the definition of weights associated to crossings, we see that at any crossing the weight vanishes unless , and .
Pick a coloring so that the associated weight is non-zero. Consider the color of the arc . If is an underpass, then we get that . If on the other hand is an overpass, then , so . If is an underpass, one concludes that , else, one can continue until we meet an underpass , and write
[TABLE]
Thus if the weight is non-zero, the color of all arcs must be non-negative.
Similarly, we can show that the color of all arcs muss be at most . We already know that if is an overpass. Else, if is the overpass immediately before , we have
[TABLE]
Thus any non-zero weight corresponds to an element of . â
4.2. The annihilator ideal of the summand of the
state sum
It is easy to see that the summand of the state sum (25) is a -proper hypergeometric function in the sense of [WZ92]. In this section we compute generators of its annihilator ideal. To do so, we compute the effect of the shift operators , and on . Each operator is acting on exactly one of the variables leaving all others fixed.
- â˘
shifts to .
- â˘
shifts to . As the color of any other arc of is of the form with , the operator actually shifts the color of all arcs up by .
- â˘
for each crossing shifts to .
The propositions of this section will match, after setting , with the gluing equations of the -spine of the knot projection.
Because we will later reduce our equations by plugging , it will only matter to us that they are exact up to fixed powers of . We will write for a power of which does not depend on .
Let us start by considering the effect of on .
Proposition 4.3**.**
The summand of the colored Jones polynomial satisfies:
[TABLE]
Remark 4.4**.**
The denominators in the above equations actually vanish if . To obtain recurrence relations that are valid for any , we can simply move each denominator to the other side of the equation. The convention if will ensure that the equations still hold.
Proof.
Let us note first that the weights of local extrema are linear powers of . When computing the ratio those weights will only contribute to a factor. Thus we can discard those weights while trying to prove Proposition 4.3. We can also discard any linear power from the weights of crossing for the same reason.
We also note that one can separate the weights of crossings into a product of two factors and , where
[TABLE]
and
[TABLE]
where are the colors of arcs neighboring the crossing , following the convention described in Figure 11.
Recall that shifts the color of all arcs up by . Up to , the ratio is a product of factors and for every crossing. We compute that:
[TABLE]
and
[TABLE]
if is positive and
[TABLE]
if is negative. This gives Equation (27). â
Let us now turn to the effect of operator .
Proposition 4.5**.**
The summand of the colored Jones state sum satisfies:
[TABLE]
Proof.
Again, we can safely ignore the contribution of weights of local extrema and any linear power of in the weights of crossings as they just contribute to a factor. First, note that the effect of is to shift up by and leave the colors of all arcs invariant. Then, as in the previous Proposition, any crossing contributes to the ratio by the product of two factors and , where
[TABLE]
and
[TABLE]
as , if is a positive crossing. For a negative crossing, we have:
[TABLE]
as . Combining the factors and we get Equation (28). â
Proposition 4.6**.**
Fix a labeled diagram as in Section 2.5. Let be a crossing of with labels . Then the summand of the colored Jones polynomial satisfies:
[TABLE]
if is an overpass and
[TABLE]
if is an underpass. In the above, we set
[TABLE]
Proof.
Let be a crossing with labels . The effect of is to shift up by . Note that the colors of arcs do not depend on , while the colors of arcs are of the form , where does not depend on and if is an overpass, else. Thus the effect of is to shift the colors of arcs in up by (if is an overpass) or down by (if is an underpass).
As before we neglect the weights of local extrema and any linear power in the weights of crossings. Let us write for the colors of the arcs neighboring a crossing with labels , let .
First we note that the weights can separated into a factor associated to the overpass and a factor associated to the underpass . The weights are not separable in the same way; however the ratios are linear powers of and thus we can compute those factors up to as a product of two factors , where in we apply the shift only to the colors and in we apply the shift only to the colors .
Now we compute the factors and associated to over- or underpasses.
Note that if , then no arc of the over- or underpass has its color changed under the shift . Thus in this case.
Consider that corresponds to a positive crossing. Assume first that is an overpass. If is an overpass, the operator shifts the colors up by , and we have
[TABLE]
If was an underpass instead, colors are shifted down by under , so that
[TABLE]
Now if is an underpass and is an overpass, the colors are shifted up by under and we get:
[TABLE]
Finally if is an underpass instead, colors are shifted down by and:
[TABLE]
We see that those factors match with the ones in Equation (29) and (30) considering . If corresponds to a negative crossing, only the factor is changed. The computation of the factors is similar and left to the reader.
There is now just one factor to be considered: the factor coming from crossing . Assume that is a positive overpass, then shifts the colors and up by one and leaves colors invariant. Also here shifts up by one. We get
[TABLE]
and
[TABLE]
Thus matches with the formula of Proposition 4.5. The other possibilities for (negative overpass, positive underpass, negative underpass) yield similar computations and are left to the reader. â
Recall that the annihilator ideal is a left ideal of the ring where and . Let denote the corresponding ideal of the ring . Let , (for ) and denote the expressions on the right hand side of Equations (28), (27) and (29), (30) respectively.
Proposition 4.7**.**
The ideal is generated by the set
[TABLE]
Below, we will need to specialize our operators to . To make this possible, we introduce the subring of the field that consists of all rational functions that are regular (i.e., well-defined) at .
Let denote the left ideal of the ring .
Proposition 4.8**.**
The ideal is generated by the set (31).
Proof.
First, let us note that is a subring of
Indeed, if is in then is also in as the denominator of evaluated at is the same as that of . The same can said for multiplication by one of the âs.
Secondly, it is easy to see that the elements and (for ) are in . Let be the left ideal generated by those elements.
Let us order monomials in and the âs using a lexicographic order. We claim that contains a monic element in each non zero -degree. Indeed, if is one of the above described generators and , multiplying by on the left we get that contains an element of the form where . Using also the generators the claim follows.
Now let be an arbitrary element . We may write
[TABLE]
As contains a monic element in each non-zero degree, one may subtrack elements of to to drop its degree until we get that for some element . But must also be in , and as it must be zero. Thus we can conclude that . â
5. Matching the annihilator ideal and the gluing equations
5.1. From the annihilator of the state summand to the
gluing equations variety
In the previous sections we studied the gluing equations variety of a knot diagram and the state summand of the colored Jones polynomial of . In this section we compare the annihilator ideal of the summand with the defining ideal of the gluing equations variety, once we set , and conclude that they exactly match. Let us abbreviate the evaluation of a rational function at by .
Consider the map defined by:
[TABLE]
where denotes the coordinate ring of the affine variety and is the element of described in Proposition 2.12.
The main result which connects the quantum invariant with the classical one can be summarized in the following.
Theorem 5.1**.**
(a)* We have:*
[TABLE]
(b)* If as in (7), then annihilates the colored Jones polynomial and .*
Proof.
Recall the generators of the annihilator ideal given by Equation (31), as well as the functions for of the coordinate ring of defined in Section 2.7. We will match the two.
For an arc of the diagram with color , let be the multiplication by . We claim that , the corresponding arc parameter. Indeed, for the arc we have is the arc parameter of the arc , and going from arc to we shift the multiplication operator by and the arc parameter by , depending on whether is an over- or underpass.
[TABLE]
If is a crossing with labels , and is an overpass, we have by Equation (29):
[TABLE]
where
[TABLE]
if is a positive crossing for example. Similarly by Equation (30), if is an underpass, then
[TABLE]
Comparing with Equation (23), we get that
[TABLE]
Comparing with Equation (22), we get that
[TABLE]
Finally, if is a crossing with labels , comparing with Equation (21), we get that
[TABLE]
if is an overpass, while if is an underpass we get that
[TABLE]
Thus the image of the generators of the ideal by are generators of the ideal . This proves part (a) of Theorem 5.1. Part (b) follows from part (a) and Equation (7). â
5.2. Proof of Theorem 1.1
Proof.
Fix a labeled, oriented planar projection of . Then, the certificate recursion annihilates the colored Jones polynomial, as this is true for all -holonomic sums (5). This concludes part (a).
For part (b), Theorem 5.1 implies that . In other words, the function in the coordinate ring of is identically zero. Since this is true for every labeled, oriented diagram of a knot , this concludes part (b) of Theorem 1.1. â
Acknowledgements
S.G. was supported in part by DMS-18-11114. S.G. wishes to thank Dylan Thurston for enlightening conversations in several occasions regarding the octahedral decomposition of knot complements and the state sum formulas for the colored Jones polynomial and Christoph Koutchan for enlightening conversations on -holonomic functions. The paper was conceived and completed while both authors were visiting the Max-Planck Institute for Mathematics in Bonn. The authors wish to thank the institute for its hospitality.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AM] Joergen Andersen and Alessandro Malusa, The AJ-conjecture for the TeichmĂźller TQFT , ar Xiv:1711.11522 , Preprint 2017.
- 2[BDRV] David Boyd, Nathan Dunfield, and Fernando Rodriguez-Villegas, Mahlerâs measure and the dilogarithm (II) , ar Xiv:math.NT/0308041 , Preprint 2005.
- 3[BLS 13] Alin Bostan, Pierre Lairez, and Bruno Salvy, Creative telescoping for rational functions using the Griffiths-Dwork method , ISSAC 2013âProceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2013, pp. 93â100.
- 4[BNG 96] Dror Bar-Natan and Stavros Garoufalidis, On the Melvin-Morton-Rozansky conjecture , Invent. Math. 125 (1996), no. 1, 103â133.
- 5[CCG + 94] Daryl Cooper, Marc Culler, Henry Gillet, Daryl Long, and Peter Shalen, Plane curves associated to character varieties of 3 3 3 -manifolds , Invent. Math. 118 (1994), no. 1, 47â84.
- 6[CDW] Marc Culler, Nathan Dunfield, and Jeffery Weeks, Snap Py , http://www.math.uic.edu/t 3m/Snap Py .
- 7[Cha 03] Abhijit Ashok Champanerkar, A-polynomial and Bloch invariants of hyperbolic 3-manifolds , Pro Quest LLC, Ann Arbor, MI, 2003, Thesis (Ph.D.)âColumbia University.
- 8[Dim 13] Tudor Dimofte, Quantum Riemann surfaces in Chern-Simons theory , Adv. Theor. Math. Phys. 17 (2013), no. 3, 479â599.
