- Published on
Geometric Topology 8
- Authors
- Name
- Malachy Reynolds
- @MalachyReynolds
Geometric Topology 8
Summing Over States
Fix a diagram of a link . One can compute the Kauffman bracket of by choosing one of its crossings to split using (iii), and then applying the same step to each of the two resulting diagrams. Proceeding in this way we finish with diagrams, each of which has no crossings left, is therefore a disjoint union of 'circles'. Because the changes only take place around each crossing, the order in which we choose the crossings is irrelevant, as in the proof about invariance.
A choice of splittings for every crossing is called a state. A splitting is positive if and only if the diagram that results is paired with . So a state can be regarded as a map:
that assigns to each crossing the sign in which it is to be split. There are such states. One can indicate by the diagram that results when is applied to , and by (pronounced 'mod ') the number of circles in . Each state involves positive crossings and negative ones, with and .
The Big Sum
Repeated application of rule (iii) yields the "big sum": Proposition:
There are two special states, namely with for all (so all splittings positive) and likewise with all splittings negative.
Exercise: In general, if are states whose values (splittings) disagree at exactly one crossing then .
Alternating Links
Suppose that a link has an alternating diagram that is positively chess-boarded with black/white regions respectively. A positive splitting at every crossing will unite all the black regions and result in unknots around the white ones, so . Similarly .
Lemma: If is reduced then the highest power of in will arise from and Kauffman term:
Proof: Set . Let denote a state with exactly one negative splitting. We know that , so the highest power of in the Kauffman term of will either equal or . We must prove it is the latter, otherwise there is a danger that terms in could cancel each other out. But we claim that the hypothesis 'reduced' forces . For, having made a positive splitting, the resulting two arcs must form part of two distinct circles, otherwise the splitting would be an isthmus, with an arc joining one side to the other. If that splitting is changed to negative, the white regions in are united, two circles become one, and .
Laurent Span
This is the difference between the highest and lowest powers in a Laurent polynomial, so we can talk about the -span in , or the -span in .
Suppose that is both reduced and connected. Then it has regions by Euler's formula. We have seen that the highest power of in arises from . Similarly the lowest power will be . So the -span is:
To pass from the Kauffman bracket to the Jones polynomial we multiply by (which does not affect the span), and replace by . In conclusion:
Corollary: If a link has a connected reduced alternating diagram with crossings, equals the -span of , and so in these circumstances depends only on the ambient isotopy class of .
Examples:
Historical Remarks
In 1987, Kauffman, Murasugi and Thistlethwaite improved the corollary around Laurent span by relating to spanning trees in a graph arising from the chess-boarding, so as to prove:
Theorem: If a link has a reduced alternating diagram with crossings then is its crossing number.
This was one of P.G. Tait's conjectures dating from 1898.
It is an open question as to whether any knot with is necessarily trivial, i.e. ambient isotopic to an unknot. There do exist non-trivial links with . There are examples of distinct knots with , for example:
is the Jones polynomial shared by the Conway and K-T knots, each with .
To cite an easier result, the Jones polynomial behaves well with respect to the connect sum of links, namely . In particular this confirms there are exactly three ambient isotopy classes formed by connecting two trefoil knots.