MathLabs
TheoremProved

The Jones polynomial skein relation determines $V_K$

Statement

For three diagrams L+,L−,L0L_+, L_-, L_0 identical except at one crossing (positive, negative, and smoothed respectively), the Jones polynomial satisfies t−1VL+−tVL−=(t1/2−t−1/2)VL0t^{-1} V_{L_+} - t V_{L_-} = (t^{1/2}-t^{-1/2})V_{L_0}, together with Vunknot(t)=1V_{\text{unknot}}(t)=1; these two rules determine VK(t)V_K(t) for every knot/link uniquely.

Why is it true?

The skein relation turns an intractable-looking 3D deformation problem into pure recursive algebra: any knot diagram can be reduced to the unknot by repeatedly resolving crossings, and the relation tells you exactly how the polynomial changes at each resolution, making VK(t)V_K(t) algorithmically computable.

Proof sketch

Well-definedness sketch via crossing induction. Order the crossings of a diagram DD and define c(D)c(D) as the number of crossings that must be switched to reach a diagram of the unknot (this is always finite, since switching all crossings of any diagram in a suitable order unknots it — a classical fact). We show VK(t)V_K(t) can be computed by induction on c(D)c(D).

Base case. If c(D)=0c(D)=0, DD already represents the unknot (possibly with extra disjoint unknotted circles from Reidemeister-I-type simplification), and VK(t)=1V_K(t)=1 by definition (with a normalization factor (−t1/2−t−1/2)k−1(-t^{1/2}-t^{-1/2})^{k-1} for kk disjoint unknotted components, consistent with the skein relation applied to split unlinks).

Inductive step. Suppose c(D)≥1c(D)\ge 1, and pick a crossing whose switch reduces cc. Let D+D_+ (or D−D_-) be the diagram at that crossing before switching and D−D_- (or D+D_+) after switching — by construction cc decreases for one of them. Let D0D_0 be the same diagram with that crossing smoothed (removing it, connecting strands the other way); D0D_0 has one fewer crossing overall so also has smaller cc (or is handled by the base case). By the inductive hypothesis, VV is already known for D−D_- (or D+D_+) and D0D_0. Rearranging the skein relation t−1VL+−tVL−=(t1/2−t−1/2)VL0t^{-1} V_{L_+} - t V_{L_-} = (t^{1/2}-t^{-1/2})V_{L_0} to solve for the unknown term (e.g. VL+=t(VL−+(t1/2−t−1/2)VL0)V_{L_+} = t\big(V_{L_-} + (t^{1/2}-t^{-1/2})V_{L_0}\big)) computes VV for DD.

Consistency (sketch). The nontrivial part of the theorem — that this recursively computed value does not depend on the order of crossing choices, and is invariant under all three Reidemeister moves — is established by Kauffman's bracket polynomial construction: define ⟨D⟩\langle D\rangle by local smoothing rules ⟨crossing⟩=A⟨smoothing 0⟩+A−1⟨smoothing ∞⟩\langle\text{crossing}\rangle = A\langle\text{smoothing }0\rangle + A^{-1}\langle\text{smoothing }\infty\rangle and ⟨D⊔◯⟩=(−A2−A−2)⟨D⟩\langle D\sqcup\bigcirc\rangle = (-A^2-A^{-2})\langle D\rangle; one checks directly (a finite local computation) that ⟨D⟩\langle D\rangle is invariant under Reidemeister II and III, and changes by a controlled factor under Reidemeister I, which is exactly compensated by multiplying by (−A3)−w(D)(-A^3)^{-w(D)} where w(D)w(D) is the writhe (signed crossing count); substituting t=A−4t=A^{-4} recovers VK(t)V_K(t) satisfying exactly the stated skein relation.

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. Colin C. Adams (2004). The Knot Book
  2. Dale Rolfsen (1976). Knots and Links
  3. Vaughan F. R. Jones (1985). A polynomial invariant for knots via von Neumann algebras