Are Khovanov-Rozansky polynomials consistent with evolution in the space of knots?

$R$-coloured knot polynomials for $m$-strand torus knots $Torus_{[m,n]}$ are described by the Rosso-Jones formula, which is an example of evolution in $n$ with Lyapunov exponents, labelled by Young diagrams from $R^{\otimes m}$. This means that they satisfy a finite-difference equation (recursion) of finite degree. For the gauge group $SL(N)$ only diagrams with no more than $N$ lines can contribute and the recursion degree is reduced. We claim that these properties (evolution/recursion and reduction) persist for Khovanov-Rozansky (KR) polynomials, obtained by additional factorization modulo $1+{\bf t}$, which is not yet adequately described in quantum field theory. Also preserved is some weakened version of differential expansion, which is responsible at least for a simple relation between {\it reduced} and {\it unreduced} Khovanov polynomials. However, in the KR case evolution is incompatible with the mirror symmetry under the change $n\longrightarrow -n$, what can signal about an ambiguity in the KR factorization even for torus knots. }


Introduction
Knot "polynomials" [1] are the vacuum expectation values of Wilson loops in 3d Chern-Simons theory [2], perhaps, refined [3]. Since the theory is topological they depend only on the linking properties of the loop K and do not change under smooth variations of its embedding into 3d space X . For simply connected X = R 3 or S 3 they are rational functions (sometime, Laurent polynomials) of peculiar functions q = exp 2πi g −2 +N and A = q N of the coupling constant g and the rank N − 1 of the gauge algebra G = sl(N ). The shape of the polynomials depend on K and representation R of G. The working definitions are in terms of the Reshetikhin-Turaev (RT) lattice theory [4,5] via Reidemeister-invariant convolutions of quantum R-matrices at the nodes of the 2d knot diagrams D and of Khovanov-Rozansky (KR) cohomological calculus [6]- [20] on the hypercubes, associated with D. The central question in Chern-Simons theory is description of these rational functions on the (discrete) space of knots or knot diagrams -and it is a direct generalization of the similar question about 2d conformal blocks [21], defined on the space of the 3-valent Feynman diagrams.
The first step in the story is of course the choice of parametrization of the space itself. Knot diagrams are often considered as glued from braids, and each m-strand braid has a natural decomposition into an ordered (noncommutative) product of the braid-group generators: The first task in the theory of knot polynomials is to describe their dependence on any of the integer-valued parameters n. This approach is called evolution method [22]- [24], because as a function of n the polynomial, obtained by the modified RT method [5], is a sum of Lyapunov-like exponents: over the Young diagrams Q in the product R ⊗m with n-independent coefficients C. In other words, the polynomial satisfies a finite difference equation (recursion) in n, which can be integrated to a system Here we use the finite difference operator∇ (m) and do not divide by 1 − x to simplify most formulas below. Also, we define the shift factor in ∇ (m) x as x rather than x m , because this simplifies formulas for superpolynomials.
If some p of the expansion coefficients C are vanishing, the degree of the equation is actually reduced by p. In particular, this happens for N < m|R|, because all the diagrams Q with more than N lines do not contribute. There are also some "accidental" omissions for HOMFLY polynomials (like C [1], [22] in the case of torus H [4,n] ), but they are usually lifted after t-deformation to superpolynomials.
While evolution recursion is a direct consequence of RT approach, it is not yet so evident for KR method (see the first paper in [13] for a tedious derivation in the simplest example). Thus it is a meaningful question, if KR polynomials satisfy a recursion (4), and if its degree is further reduced at small N ?
In the present paper we analyse the available list of KR polynomials for the simplest torus knots with m = 2, 3, 4, 5 in the fundamental representation R = [1] = and observe that the answer is "yes": not only recursion is true, but its degree drops down at N < m, exactly as it does for the corresponding superpolynomials -where this followed from the super-Rosso-Jones formulas of [22].
If one assumes the recursion, then it provides an answer for infinitely many KR polynomials with all positive integer n once the first few are known -what is a major achievement by itself, given the complexity of direct calculations in KR formalism.
However, as already observed in [25], for some knot families the evolution formulas for superpolynomials provide a unified description only for positive values of the evolution parameter n, while fail to provide pure positive or pure negative polynomials for negative n. In this paper we find that the same happens to KR polynomials even for the torus family with more than two strands. In result, these functions of n do not respect the mirror symmetries n −→ −n, at least in the usual way: while for torus superpolynomials from [22], for their KR counterparts, i.e. the left hand sides are understood as analytic continuations from positive n to negative, provided by the evolution formulas. Despite mirror symmetry is not a true symmetry of knot theory, associated link diagrams are not Reidemeister-equivalent, this is still an unpleasant feature, signalling about some kind of non-analyticity of the KR reductions in the space of knots (or, perhaps, about non-adequate coordinatisation of this space by parameters like n). Of course, the problem (7) disappears in cases when KR reduction is trivial -exhausted by just a substitution a = q N in the superpolynomial, like it happens for reduced 2-strand (m = 2) torus polynomials at N = 2. For the same reason mirror symmetry survives in the 3-strand (m = 3) case for reduced torus polynomials at N = 2, 3 and for the unreduced ones at N = 2.
As to another symmetry, acting on the family of knot polynomials, [m, n] ↔ [n, m], which is topological and relates Reidemeister-equivalent link diagrams, it is respected by our evolution formulas: both are true, P [m,n] (a, q, t) = P [n,m] (a, q, t) (8) and 2 Recursion from Rosso-Jones formula for torus knots The simplest example of (2) appeared in the case of torus knots, when the knot diagram consists of a single m-strand braid (1) of a very special form: with all non-vanishing n a|i = 1, One gets a knot when n and m are coprime, otherwise there is a link with gcd(m, n) components. For m-strand torus knot HOMFLY polynomial is given by the Rosso-Jones evolution formula [26,22] where are quantum dimensions of representations Q, given by the standard hook formula, the eigenvalues of cut-and-join (actually, Casimir) operator are κ Q = (i,j)∈Q (i − j) and the integer-valued coefficients C Q are defined by the Adams rule Since the only dependence on n is in the power of q, this HOMFLY satisfies a homogeneous finite-difference equation where and the degree of the difference equation is naively the number of Young diagrams Q ∈ R 2m . This fact is independent on the actual value of the coefficients C Q , i.e. from the point of view of the equation, they are the free parameters, parametrising its solution. In this sense the equation does not provide too much information about the HOMFLY polynomials, still it reflects an important property -evolution rule -of the torus family with particular number m of strands. However, when some additional information is available, the degree of the equation can be decreased. For example, if the spectrum of Casimir eigenvalues κ Q is degenerate, i.e. if two or more of them coincide, the corresponding Q should appear only once in the product in (13). Such degeneracy is often preserved by the t-deformation.
If instead some of the coefficients C are vanishing, the corresponding ∇ can be omitted and the degree of the difference equation gets lower. The lift from HOMFLY to superpolynomials, however, usually lifts such degenerations: even if C was vanishing for HOMFLY, its t-deformation does not, see examples below.
Another story is when vanishing are some dimensions D Q . For A = q N contributing are only Q with no more than N columns, because otherwise D Q (q, q N ) = 0. The order of the difference equation is reduced accordingly. In particular, for N = 2 R and Q are symmetric representations (two-column representations of sl 2 are equivalent to the single-column ones). The main claim of the present paper will be that this reduction is preserved by the t-deformation -even after additional reduction from super-to KR polynomial. Still, in this section we continue with HOMFLY.
If one adjusts the framing "phase" F R so that it cancels the contribution from one of the κ Q , F R = q 2 m κ Q 0 , then (13) can be promoted (integrated) to a more restrictive non-homogeneous equation with degree lower by one (i.e. one of the free parameters in its solution can be fixed): These framings are usually different from topological and The second equality in (16) follows from transformation law for HOMFLY polynomial from R = to transposed R tr = = R and thus is an accidental feature of the fundamental representation. Relation (16) persists in the case of superpolynomials, but generically it does not survive in the case of their KR reductions.
At m = 2 the fundamental HOMFLY in this framing is and satisfies∇ (2) Associated Jones polynomial (i.e. HOMFLY at A = q 2 ) satisfies the same∇ Here and below we use the standard notation: satisfies the second-order difference equation (3) while associated Jones polynomial satisfies just the first-order one:∇ At m = 4 we get the first degeneracy: C [2,2] = 0. Thus the equation is of the order three, This time the degree of equation is further decreased at N = 3 and N = 2: satisfies the second-order∇ while Jones polynomial satisfies the first-order∇ With increasing strand number m we get the following pattern: Arrows mark the changes which take place at the level of super-and Khovanov polynomials.
Reversing the logic, evolution recursion describes generic solutions of the homogeneous difference equation: from∇ (m) it follows that with p arbitrary integration constants C i . Each of these parameters appears in non-homogeneous equation of degree p − 1, obtained by integrating (33) w.r.t. one of the commuting difference operators∆ x k : where the r.h.s. is independent of n.
Alternatively parameters C k can be defined from "initial conditions", i.e. the values of H n at some p different values of the evolution parameter ("time") n. Used for this purpose below are the directly calculated KR polynomials for relatively small knots. Things would be greatly simplified if also their twins at negative values of n could be used. However, the transformation n ↔ −n acts badly on the evolution formulas for KR polynomials, and this way to extend the set of available initial conditions does not seem to work.

Recursion for torus superpolynomials
Superpolynomials depending on one extra deformation parameter t = −1 could be defined from an analogue of the rule (12) with MacDonald instead of the Schur polynomials -and already this would make them depending on q and t, -but actually there are additional correcting c-factors, discovered in [22] and better described in two different ways in [27] and [28].
Explicit expressions for the simplest reduced superpolynomials in topological framing are [22]: where n = ±1 mod m. Note that this parameter takes the opposite values for the knots [m, −n] and [m, n] in (6). Here we used our usual notation {x} = x − x −1 and the standard MacDonald variables A, q, t, used in [22], are related to DGR variables of [11] by A 2 = −a 2 t, q = −qt, t = q. Torus superpolynomials can be converted from Laurent to true superpolynomials by extracting a power of appears here instead of the writhe number n(m − 1) in the exponents of the framing factor in (37). This explains the appearance of normalization factors in the following sections of this paper.
Superpolynomials are supposed to be positive Laurent polynomials of the DGR variables a, q, t, i.e., all the coefficients should be non-negative integers. However, this is not fully true for above expressions: with the change of n they switch from pure positive to pure negative polynomials. Moreover, this is a typical anomaly: by insertion of additional overall factor of (−) n−1 m one could cure the problem for all positive values of n, but then all the polynomials with negative n will be pure negative -violating also the invariance (6). Sometime this anomaly can cause serious problems for construction of superpolynomials [25], but for the torus knots per se this is a rather innocent detail, which, however, should be remembered and taken into account. It leads to a minor modification in the case of reduced super-and KR polynomials, while for the unreduced ones it is also minor, but can look somewhat unfamiliar, see below.
Expressions (37) for the superpolynomials have the form The last line in this table is to remind that for N ≤ m only the eigenvalues from the first N columns do contribute to the answer, while the coefficients V of the remaining ones vanish in these cases. Such polynomials satisfy the recursion relations A 12 q 6 t −10 ∇ (4) Since for N ≤ m the polynomials P n,m in fact depend only on the first few eigenvalues, they actually satisfy the shortened recursions, which are generated by the difference operators, which survive in the last line in the if we multiply each P on the normalisation factor that makes the eigenvalue for Q 0 = [m] to be equal 1.
Recursions for m = 3 and m = 4 here are the short ones, true for A = t 2 , when {A/t 2 } = 0, i.e., they are valid for (super)Jones polynomials at N = 2: for generic N the degrees of the equations would be 3 and 5 (or 4 for HOMFLY in the case of m = 4, when representation [22] does not contribute). Note that for m = 4 one does not expect difference equations with∇ (m/2) , because the coefficients in the superpolynomials depend on the residue n mod m.
Lyapunov exponents for the torus n-evolution are made from MacDonald split of the Casimir eigenvalues: where m , which enter the difference operators in the short recursion and are independent of A and, consequently, on the details of the N -reduction, can be extracted from [ The choice of the coefficient in front of the "differential" is, however, not specified. In other words, and additional principles are needed to separate positive ξ and positive K, which also contains positive terms divisible by 1 + t -which could be, but are not moved to ξ. The search for these principles is a big challenge, but it is beyond the scope of the present text.

Recursion for torus Khovanov polynomials at m = 2
In this case Khovanov polynomials are known from direct calculation at all odd n [6,8,11,12,13] and they actually coincide with the result of the substitution of N = 2 into for reduced and for unreduced superpolynomials. As explained in [14], relation between the two is implied by the differential expansion of the reduced fundamental superpotential: and for N -reduction {A/t} −→ (1 + q 2N−2 t). Naively unreduced polynomial is obtained by multiplication with the quantum number [N ]. However, one can use the usual identification rule [14] (1 + to substitute -and this is how (48) is obtained from (47).
We, however, omit it because this leads to significant simplifications in the logic, while it is always easy to restore the factor in the answers. Note that, like the superpolynomials (37) our K [m,n] can be pure negative rather than pure positive. Also the reduced N = 2 polynomials computed with the standard programs [9,29] contain one more extra factor q −1 , which we also omit.
Putting N = 2, we obtain from (47) for reduced case and from (48) for the unreduced one. Both of them satisfy non-homogeneous first-order equations: Note that these are exactly the same recursions as the one in the first line of (41): q 2 t 2 = q 4 t 2 , only now we provided explicit expressions for the right hand sides. One can eliminate these right hand sides by applying one more difference operator, then the equation is the same for reduced and unreduced polynomials: Invariance w.r.t. inversion of n would state: It is easy to check that the first recursion for K r in (54) is indeed invariant under this transformation, i.e. (57) is indeed true -what is not a surprise, because K r is obtained by a change of variables from the topologically invariant reduced superpolynomial (47). However, this is not the case for the unreduced K ur -like the unreduced superpolynomial (48), it changes non-trivially under the n-inversion (unless t = −1), because of the underlined term in (54). The second branch differs from (53) by a slight modification of the first term: Instead of (57) the evolution formula for the unreduced Khovanov polynomial satisfies We can now inverse the logic: begin from the recursion relation (41) and derive the evolution formula for arbitrary K [2,n] . Short and long recursions for m = 2 mean that with λ = (−q 2 t) 1/2 and some n-independent α and β. Note that at N = 2 the two Lyapunov exponents differ by a factor of 3, which is independent of parameters q and t. To solve the recursion we need initial conditions and the knowledge of just two should be enough. It can seem that we always have these two: n = ±1 correspond to the unknot. The problem, however, is that we need (57) to use the both. If (57) is true -like it is for reduced KR polynomial, we immediately get: i.e., reproduce (52). Note that the input as initial conditions was only the unknot (!) -this illustrates the usual power of evolution method. However, for unreduced KR polynomial we rather need (59), not (57): what coincides with (53). For the dual branch we havẽ are fully positive (or fully negative) respectively for n > 0 and n < 0, while in the "foreign" domains they contain terms with different signs -still they remain related by (59).
There is also a direct way from (61) to (62) and (63): instead of just multiplying by [2] = q + q −1 one should apply the rule (50): Then we get from the first version of (61) i.e., exactly (62), while the second version turns into (63).

Recursion for Khovanov (N = 2) polynomials at m = 3
In this case recursion is almost as simple as at m = 2. For N = 2 the r.h.s. with {A/t 2 } A=t 2 = 0 in (41) can be omitted, but at the l.h.s. one should substitute a = q 2 , i.e., (A/t) 6 = −q 6 t 3 : this is a manifestation of the double-face reduction rule (44). Thus, though this does not yet follow from any first principle argument, one can expect that Khovanov polynomials at N = 2 satisfy the second order homogeneous equation −q 12 t 7 K [3,n] (N = 2) = 0 (66) while Khovanov-Rozansky at N = 3 should satisfy the full-fledged third order one, the same as the full superpolynomials with a = q 3 and (A/t) 6 = −q 12 t 3 : −q 24 t 9 K [3,n] (N = 3) = 0 (67) We return to KR at N = 3 in sec.9 below, and concentrate in this section on Khovanov polynomials with N = 2.
Making use of explicit expressions [8,29] we can check that this short-evolution hypothesis is indeed true and restore entire evolution formulas: However, there is a non-trivial factor in the mirror-symmetry relation: and, accordingly, K Similarly, for unreduced Khovanov polynomials we get: Again, these formulas can be obtained directly from (68) by application of the rule (64), e.g., Unreduced polynomials satisfy topological identity and mirror relation This means that they should be linear combinations of three Lyapunov exponentials -and indeed they are.
For n = 1 mod 4 Underlined structures enter with the coefficient (1 + t), because it does not contribute in the case of HOMFLY polynomial (the coefficient in front of D [22] is "accidentally" vanishing when t = q). Despite it inters with negative sign, it does not spoil the positivity of the entire expression at n > 0. However, at n < 0 the polynomial fail to be positive or negative and consists of monomials with different signs. Thus there are no chances for any relation like (6).
For n = −1 mod 4 Despite this is not evident from the formulas, for n > 0 (but not for n < 0) these polynomials are pure positive or pure negative, depending on parity of n+1 2 . As already mentioned, this time there is no relation like (70): neither in unreduced nor in reduced case, moreover, the l.h.s. is not even a positive Laurent polynomial. The valid topological identity is K [4,3] = K [3,4] (79) Also, it is unclear how the rule (50) can be applied to derive unreduced polynomials from the reduced ones. This drawback is cured by an improved (better structured) version of above formulas -which one day should be directly deduced from an adequately structured expression for the superpolynomials.

Projective limit
If one throws away all the n-power factors from the formulas for K, i.e., keep only the contribution of the Young diagram Q 0 = [m], one gets the projective limit of Khovanov polynomials, studied in [15], which are positive series. Explicit expressions are easily reproduced from our general formulas: 1 − q 8 t 6 + + [2] · (1 + q 4 t) · q 6 t 4 1 − q 10 t 8 · 1 + q 2 t 2 + q 4 t 4 + . . .

Remnant of differential expansion
Differential expansions (DE) of [23] and [24] play an increasingly important role in modern theory of knot polynomials. Essential for KR reductions will be a complementary nested DE [30]. Somewhat amusingly, the ordinary DE partly survives the Khovanov reduction at N = 2 as well. Namely, while for Khovanov polynomials we have: but the power at the r.h.s. can not be raised from one to two. We emphasize that the normalization of Khovanov polynomials is already fixed by the condition (44) The generating function for the coefficients in front of k is m entier (m−1) 2 4 · x m = x 2 (1−x) 2 (1−x 2 ) , residuedependence is easily restored from the topological identity γ [m,r] = γ [r,m] . Differential d 1 ∼ {A/t}, 2 which is surviving in these formulas in the form (1 + q 2 t), is responsible for the U (1)-reduction of knot polynomials, i.e. the DE relation (87) implies that there is some memory about the U (1) reduction, surviving when that to U (2) is performed, but there is a nontrivial correction when K is not just P(a = q 2 ), i.e. when ξ = 0 in (46).
For KR polynomials at N = 3 -the only beyond N = 2 one available at the moment -the structure is more complicated for any power of q. Still some structure clearly exists in this case as well -and deserves closer attention.

Conclusion
In this paper we made six claims: and we get a shortened recursion, which needs less initial conditions.
(c) In variance with (2) for reduced torus superpolynomials, the evolution expansion (90) for their KR counterparts is not consistent with the mirror symmetry under n ←→ −n. Strictly speaking, the lack of covariance under n ←→ −n is not a problem, because the corresponding knot-diagrams are not Reidemeister equivalent. Still the two knots, though topologically different, are related by a mirror map and thus one could expect a relation like (6). Moreover, if we had a control over these transformation laws, the knowledge of any particular KR polynomial would provide two initial conditions. For m = 2, 3 this mirror anomaly is concentrated in the framing factor and thus is indeed comprehensible, however it becomes far more complicated for m ≥ 4. Technically it is related to the presence of negative items in the coefficients in front of the fractions 1−λ n 1−λ . Actually these negative items are absorbed into structures, proportional to (1 − λ), and thus do not spoil positivity of entire polynomial -but this works only for n > 0, while at n < 0 such combinations fail to be sign-definite and can not pretend to be super-and KR polynomials. This is an unpleasant property of the evolution formulas, already encountered in a similar situation in [25].
(d) The knowledge of the evolution recursion in n allows one to easily calculate Khovanov polynomials with N = 2 for arbitrary torus knots, beginning actually from the unknot(!): one does it first for arbitrary n at m = 2 and then proceeds recursively in m, using the topological identity between [m, n] and [n, m]. Important here is the claim (b): dramatic reduction of recursion degree, which at N = 2 grows linearly with m, what makes above identity sufficient for the m-recursion (e) Though differential expansion [24], implying that for fundamental HOMFLY and superpolynomials in topological framing, is violated for KR polynomials, it is substituted by a weaker, still powerful structure: a linear decomposition of properly normalized K into differentials: As a simplest application, reduction rule (50) applies nicely to Khovanov polynomials and it allows to directly obtain unreduced polynomials from reduced ones. In result unreduced Khovanov polynomial always satisfies However, this kind of rule are not sufficient to further deduce reduced Khovanov per se from superpolynomials and more effort is needed for this purpose. More relevant can be the nested structure, which helps to fix the ambiguities in linear decomposition,-but this story is beyond the scope of this letter.
(f ) A more traditional version of differential expansion is found to survive for Khovanov polynomials (N = 2) in a somewhat surprising form of (87), with additional powers of q, specific for torus knots. It would be interesting to see what happens to these relations beyond the present scope -of torus knot and fundamental representations.