[Paper Review] Replacing a graph clasper by tree claspers

Kazuo Habiro|ArXiv.org|Oct 21, 2005

Geometric and Algebraic Topology8 references3 citations

TL;DR

This paper proves that surgery along a connected, strict graph clasper of degree $n$ in a 3-manifold can be replaced by a sequence of surgeries along strict tree claspers of the same degree $n$, establishing that such surgeries induce $C_n$-equivalence. The result provides a topological realization of the algebraic $STU$ relation in finite-type invariants via clasper calculus.

ABSTRACT

We prove that two links related by a surgery along a connected, strict graph clasper of degree n are C_n-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.

Motivation & Objective

• To establish a topological analogue of the $STU$ relation in the context of finite-type invariants.
• To show that surgeries along strict graph claspers of degree $n$ are equivalent to sequences of surgeries along strict tree claspers of the same degree.
• To generalize the notion of $C_n$-moves beyond tree claspers to include graph claspers, preserving equivalence.
• To provide a foundational result for extending clasper calculus to unitrivalent graphs in 3-manifolds.

Proposed method

• Use induction on the number of edges in the graph clasper $G$, starting from the base case of a single edge.
• Apply move 9 from [8, Proposition 2.7] and isotopy to modify the graph clasper, resulting in a new clasper $G'$.
• Handle two cases: when $G'$ remains connected (induction applies directly), and when it splits into two components $G_1$ and $G_2$.
• For the split case, apply [8, Theorem 3.17] to replace each component $G_i$ with a finite collection of simple, disjoint tree claspers $F_i$ of degree $\deg G_i$.
• Perform sliding moves on the claspers $F_2$ to reposition them relative to $c_1'$, preserving $C_n$-equivalence via [8, Propositions 4.4 and 4.6].
• Use a graph-clasper version of [8, Proposition 3.4] to show that the final configuration is ambient isotopic to the original tangle, completing the equivalence.

Experimental results

Research questions

• RQ1 Can surgery along a strict graph clasper of degree $n$ be replaced by a sequence of surgeries along strict tree claspers of the same degree?
• RQ2 Does the $C_n$-equivalence class remain invariant under such a replacement?
• RQ3 How does the topological structure of graph claspers relate to the algebraic $STU$ relations in finite-type invariants?
• RQ4 Is there a canonical way to decompose a graph clasper into tree claspers while preserving the surgery outcome?

Key findings

• Surgery along a connected, strict graph clasper $G$ of degree $n$ results in a tangle $\gamma^G$ that is $C_n$-equivalent to the original tangle $\gamma$.
• The $C_n$-equivalence is achieved via a finite sequence of surgeries along simple, disjoint strict tree claspers of degree $n$.
• The result holds even when the graph clasper is not simple, by reducing to the simple case through strand replacement.
• The sliding of clasper components preserves $C_n$-equivalence, as justified by properties of ambient isotopy and clasper calculus.
• The final configuration after sliding and surgery is ambient isotopic to the original tangle, confirming the equivalence.