Low Dimensional Topology

August 17, 2009

Claspers 1: Basic claspers as graphical notation

Filed under: Knot theory,Quantum topology — dmoskovich @ 2:33 am

This post has comes with a PDF version, which contains more details.

In my opinion, Habiro and Goussarov’s theory of claspers is a milestone in low dimensional topology [1][2][3]. Using this theory, they were able to solve important outstanding problems in quantum topology, and to build a bridge to connect the “quantum” with the “classical”.
In this series of posts, I would like to introduce claspers to readers of this blog. I think that claspers are an handy tool for low-dimensional topologists, as a natural extension (or refinement) of Dehn surgery which (in a sense to be explained in future posts) is compatible with the lower central series of the Torelli group of a Heegaard surface. Claspers are already fairly mainstream in some circles (used or referenced in around 300 papers according to MathSciNet), but I think that they should be more popular with a wider audience (if gropes are familiar to you- in dimension 3 claspers and gropes are essentially equivalent).

Claspers are one of those good ideas which are useful even when emptied of their content, when only the shell remains. In this first post, I would like to ignore the content— all the beautiful general constructions and shimmering theoretical triumphs of the theory— and focus instead on just (a small part of) the form—claspers as notation. Just graphical notation and nothing else! Look how efficiently it presents mathematics in your head!
My example today is a proof of the following theorem (explained below) [4]:

Theorem: Two links are link homologous if and only if they are related by \Delta-moves.

Two oriented and ordered links L=K_1\cup\cdots\cup K_m and L^\prime=K^\prime_1\cup\cdots\cup K^\prime_n are said to be link homologous if m=n and \mathrm{Link}(K_i,K_j)=\mathrm{Link}(K^\prime_i,K^\prime_j) for all i and j with 1\leq i<j\leq n. The terminology is explained by the fact that the linking number \mathrm{Link}(K_i,K_j) is defined as the image of the ith longitude in H_1(S^3-K_j;\mathbb{Z})\cong\mathbb{Z}, so (loosely speaking) two links are link homologous if and only if their homologies agree. The \Delta-move is a certain local move we will soon define. Thus the theorem characterizes \Delta-move equivalence classes (geometric topological information) in terms of a readily computable algebraic invariant.
The proof which I present below, in bold font, was told to me by Andrew Kricker last year in under 30 seconds, who had heard it from Habiro, who was reformulating Murakami and Nakanishi’s original argument, which was no doubt known to Matveev in his original paper where he introduce \Delta-moves [5] (It may appear explicitly in a 1986 Matveev preprint “Nonstandard surgeries on 3-manifolds”— I don’t know because our library does not seem to have a copy. Please tell me if you know). This then is math folklore.
Let’s introduce our graphic notation tool, which is a special kind of basic clasper which I’ll call “chord claspers” (just because I’m biased against non-descriptive adjectives like “basic”). A chord clasper C= A_1\cup B\cup A_2 in the complement of a link L\subset S^3 is the union of two annuli A_1 and A_2 called leaves whose deformation retracts (which are circles) bound disks each of which intersect L at precisely one point, with a band B which connects them, which is called an edge. In this post I’m going to assume that the leaves are not twisted. Claspers may be drawn using their cores by the following rewriting rules:

Chord claspers are nothing more than graphical shorthand for linkage:
They look just like kayak paddles!
It’s time now to introduce the \Delta-move (in a few versions):
As proven in the PDF version of this post, these moves are equivalent, and we collectively call them the \Delta-move.

The proof:

Here is the proof in bold font, with my explanations in normal font:
Undo the link, replacing it with an unlink and some messy web of chord claspers hanging between the components.
Any link may be undone by crossing changes, which in turn may be realized by introducing chord claspers.
Realize “permuting leaves” and the clasp-pass move using \Delta\moves; and untwist edges
Permuting leaves is \Delta_1, which according to our definition is the \Delta-move. The clasp-pass move is the following move:
We untwist edges as follows, using \Delta_4:
Now the whole messy web comes undone, and you are left with the “standard dude”.
Choose a “standard dude” B, which is a pure braid B= S_1\cup\cdots S_n with the property that \mathrm{Link}(S_i,S_j)=\mathrm{Link}(K_i,K_j) for each i and j with 1\leq i<j\leq n.
The link L may be presented as the closure of a tangle T. Stack B^{-1} and B above T:
The linking number of any two arcs in B^{-1}T vanishes. When working modulo \Delta-moves, edges do not see other edges, and leaves do not see other leaves. Edges don’t see the link either because of \Delta_4. They don’t see anything at all. So we can rearrange claspers at will. If both leaves of some chord clasper C clasp the same component S_i, use \Delta_1 and clasp-pass repeatedly to get the local picture below, and remove the clasper:
So all chord claspers both of whose leaves clasp the same component in B^{-1}T can be killed (in particular, the \Delta-move is an unknotting move). What about the ones whose leaves clasp different components? Well, the number of half-twists in the edge of a chord clasper can be 2-reduced as we saw above, and two chord claspers between S_i and S_j whose edges have numbers of half-twists with different parity cancel.
This cancels all chord claspers between S_i and S_j in B^{-1}T because of the condition that \mathrm{Link}(S_i,S_j)=0.
And voila, B^{-1}T comes undone, and you are left with the standard dude B. Thus any two link homologous links are \Delta-move equivalent to B and therefore to one another.
We’re done. Any questions?
Edit: Does anyone have any idea why line 8 of page 3 of Naik and Stanford’s paper states that the proof only “appears to generalize” from links to string links?


Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Create a free website or blog at WordPress.com.

%d bloggers like this: