A central problem in knot theory is determining when two knots, or more generally two links, are equivalent. Since a single knot or link can be represented in many different ways, mathematicians have introduced the notion of invariants. These are numbers or polynomials associated to a knot or link that remain unchanged when the knot is deformed without being cut or passed through itself. In a sense, invariants function as fingerprints, allowing one to compare different representations of the same underlying topological object. If two links have different values of a given invariant, then they cannot possibly be equivalent.

The Jones polynomial

It would be helpful to relate knots to better understood mathematical concepts such as polynomials. This is where the Jones polynomial makes its appearance. The objective here is to construct a polynomial corresponding to a knot, based on the crossings we see in the knot diagram. In the end, we want to make sure that the polynomial is invariant under Reidemeister moves, so that the same knots yield the same Jones polynomial. One simple way to define it is by introducing a slightly different polynomial: the Kauffman bracket polynomial.

Definition 1 (Kauffman bracket)

The Kauffman bracket is a function from unoriented link diagrams in the oriented plane to the space of Laurent polynomials with integer coefficients in an indeterminate AA . A diagram DD is mapped to DZ[A,A1]\left\langle D \right\rangle \in \Z[A,A^{-1}] and is characterized by

i) \langle =1\rangle = 1 , where is the standard diagram of the unknot;

ii) \langle =A\rangle = A \langle +A1\rangle + A^{-1} \langle \rangle ;

iii) L\langle L \cup =(A2A2)L\rangle = (-A^2 - A^{-2}) \langle L \rangle for all links LL .

This definition can be viewed as an algorithm for computing the Kauffman bracket. One starts off with a knot, and proceeds by removing any crossing as in iii), where the new bracket is written as a linear combination of brackets with an appropriate factor of AA or A1A^{-1} . This process can be repeated until one is only left with an unknot, which is either disconnected from the rest of the diagram, or the end point of the algorithm. For the first case, one proceeds by applying ii), and in the second case, one replaces the diagram with the unknot with 1, corresponding to i).

The Kauffman bracket is not invariant under the first Reidemeister move, as can be easily shown (see [1] for details). However, it can be shown that a change of the diagram DD by a Type II or Type III Reidemeister move does not change D\left\langle D \right\rangle . To construct a polynomial that is also invariant under all Reidemeister moves, we refine the definition a bit more. To accomplish this, we require the following.

Definition 2

The sign of a crossing in a diagram DD of an oriented link is defined by +1 for the following diagram

System diagram
and -1 for the following diagram
System diagram

The writhe w(D)w(D) of DD is the sum of the signs of all the crossing of DD .

It is clear that the writhe remains invariant under Reidemeister moves of Type II and Type III. Moreover, it behaves in a predictable fashion under Type I moves. Combining this with the Kauffman bracket, we are led to the following result.

Theorem 3

Let DD be a diagram of an oriented link LL . Then the expression

(A)3w(D)D (-A)^{-3w(D)} \left\langle D \right\rangle

is an invariant of the oriented link LL .

This leads to the following definition.
Definition 4 (The Jones polynomial)

The Jones polynomial V(L)V(L) of an oriented link LL is the Laurent polynomial in t1/2t^{1/2} , with integer coefficients, defined by

V(L)=((A)3w(D)D)t1/2=A2Z[t1/2,t1/2] V(L)=\left((-A)^{-3 w(D)}\langle D\rangle\right)_{t^{1 / 2}=A^{-2}} \in \mathbb{Z}\left[t^{1 / 2}, t^{-1 / 2}\right]

where DD is any oriented diagram for LL .

The fact that the Jones polynomial belongs to Z[t1/2,t1/2]\mathbb{Z}[t^{1/2},t^{-1/2}] can be easily shown by performing induction on the number of crossing in the diagram. By Theorem 3 , it is well-defined. This means that when two links are equivalent, that their Jones polynomials are the same. The contrapositive version of this statement allows us to check whether two links are not the same, simply by showing that their Jones polynomials are not equal. It can however occur that several inequivalent knots share the same Jones polynomial [2]. It is easy to deduce that V(unknot)=1V(\mathrm{unknot}) = 1 , but it is, as of yet, unknown whether there exists a non-trivial knot KK with V(K)=1V(K) = 1 .

Since the Jones polynomial does not necessarily allow us to tell whether two knots are not equivalent, it would be helpful to construct more knot invariants.

The Alexander polynomial

The Alexander polynomial has deep topological roots. On this site, however, we are primarily concerned with computation. We therefore merely provide a very efficient algorithm to compute the Alexander polynomial.

Let K\mathcal{K} be an oriented knot with nn crossings. draw it in the plane as a long knot diagram DD in such a way that at every crossing both strands are oriented upward (this is always possible, since we may rotate crossings as needed), and so that near its beginning and its end the knot is oriented upward as well. We call such a diagram an upward knot diagram. An example of an upward knot diagram is shown in the figure below.

Figure 1: The numbered trefoil.

We now label each edge of the diagram with an integer: a running index kk that ranges from 11 to 2n+12n+1 along the orientation of the knot. In the example on above, the indices run from 11 to 77 .

Definition 6 (Alexander polynomial)

Let

A=I+cAc, A = I + \sum_{c} A_{c},

with II the identity matrix, and where for each crossing cc , the matrix Ac(t)A_{c}(t) is zero except in the following blocks:

\qquad \longrightarrow \qquad Accolumn i+column j+row iTsTs1row j01 \begin{array}{c|cc} A_c & \text{column } i^{+} & \text{column } j^{+} \\ \hline \text{row } i & -T^s & T^s - 1 \\ \text{row } j & 0 & -1 \end{array}

The Alexander polynomial of K\mathcal{K} is then defined, up to multiplication by a unit in Z[T±1]\mathbb{Z}[T^{\pm 1}] , as the determinant of AA :

ΔK(T)=detA. \Delta_{\mathcal{K}}(T) = \det A.

References

  1. W. Lickorish, An Introduction to Knot Theory. New York, NY: Springer, 1997. doi:10.1007/978-1-4612-0691-0
  2. L. Watson, Any tangle extends to non-mutant knots with the same Jones polynomial, Journal of Knot Theory and Its Ramifications, vol. 15, no. 09, p. 1153–1162, 2006. doi:10.1142/S0218216506005007