The Jones polynomial is obtained from the Kauffman bracket of an oriented diagram by the writhe normalization
This asks whether the Jones polynomial equal to one characterizes the unknot among knots. A zero breadth of a Laurent polynomial makes a monomial; the identities and then force that monomial to be one. Thus using Jones breadth as a strictly positive complexity for nontrivial knots requires this detection property. To prove the derivative identity, differentiate the Jones polynomial skein relation at one for a crossing change in a knot. Both crossed diagrams have value one, while the smoothed two-component link has value minus two by Jones polynomial evaluation at one, so . Crossing changes reduce to the unknot, whose derivative is zero. The corresponding Alexander polynomial detection property is false, as nontrivial untwisted Whitehead doubles demonstrate. The Jones question is discussed in research on closed four-strand braids.
Use the Conway-normalized Alexander polynomial. Choosing in the Jones polynomial skein relation gives . The quantities obey the same relation, because smoothing changes the component count by one. Their unlink values agree, so crossing-change induction proves equality for every link. For a knot, the sign is one and . This proves the signed identity, not only equality of knot determinants.
Reflecting a link diagram interchanges its two bracket smoothings and negates its writhe of a link diagram. This replaces by in the normalized Kauffman bracket, hence by . A knot whose Jones polynomial differs from its reciprocal cannot be an amphichiral knot.
For a nonempty link with components, the Jones polynomial skein relation at makes a crossing change preserve the value. Crossing changes turn the link into an unlink with the same number of components. Repeated Jones polynomial of a split union gives the formula. In particular the Jones polynomial is never the zero polynomial.
Placing the two link diagrams in disjoint disks keeps all state circles separate. The reduced Kauffman bracket therefore acquires one extra loop factor . Correcting writhe of a link diagram and setting gives the displayed formula. It concerns a split link, not an arbitrary union of linked components.
For knots, matching bracket smoothing states across a connected sum of knots joins one state circle from each side. Their total circle count is therefore the sum of the two counts minus one. The reduced Kauffman bracket state weights multiply, and writhe of a link diagram adds, proving the formula.
Resolve the two crossings in a skein relation using the Kauffman bracket, then correct by the writhe of a link diagram. The other smoothing cancels, leaving the displayed coefficient of the oriented smoothing. This relation and the value one on the unknot determine the Jones polynomial: crossing changes give descending diagrams, which are unlinks, while the smoothing terms have fewer crossings.
Use the Kauffman bracket assigning the empty diagram value and a disjoint circle factor . Correct by the writhe of a link diagram and substitute . Relative to the Jones polynomial normalized to be on the unknot, this unreduced invariant has an additional factor . For a nonempty -component link, its value at is .

Ancestors (8)

  1. Kauffman bracket
  2. Link diagram
  3. Link
  4. Knot theory
  5. Geometry and topology
  6. Area of mathematics
  7. Mathematics
  8. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

The Jones polynomial is an invariant of a knot or link, introduced by mathematician Vaughan Jones in 1984. It is a powerful tool in knot theory that provides a polynomial invariant, assigning to each oriented knot or link a polynomial with integer coefficients. The Jones polynomial \( V(L, t) \) is defined using a specific state-sum formula based on a diagram of the knot or link.