The Jones polynomial skein relation determines $V_K$
Statement
For three diagrams identical except at one crossing (positive, negative, and smoothed respectively), the Jones polynomial satisfies , together with ; these two rules determine 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 algorithmically computable.
Proof sketch
Well-definedness sketch via crossing induction. Order the crossings of a diagram and define 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 can be computed by induction on .
Base case. If , already represents the unknot (possibly with extra disjoint unknotted circles from Reidemeister-I-type simplification), and by definition (with a normalization factor for disjoint unknotted components, consistent with the skein relation applied to split unlinks).
Inductive step. Suppose , and pick a crossing whose switch reduces . Let (or ) be the diagram at that crossing before switching and (or ) after switching — by construction decreases for one of them. Let be the same diagram with that crossing smoothed (removing it, connecting strands the other way); has one fewer crossing overall so also has smaller (or is handled by the base case). By the inductive hypothesis, is already known for (or ) and . Rearranging the skein relation to solve for the unknown term (e.g. ) computes for .
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 by local smoothing rules and ; one checks directly (a finite local computation) that is invariant under Reidemeister II and III, and changes by a controlled factor under Reidemeister I, which is exactly compensated by multiplying by where is the writhe (signed crossing count); substituting recovers 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
- Colin C. Adams (2004). The Knot Book
- Dale Rolfsen (1976). Knots and Links
- Vaughan F. R. Jones (1985). A polynomial invariant for knots via von Neumann algebras