pith. sign in

arxiv: 2406.01093 · v1 · submitted 2024-06-03 · 🧮 math.GT · math.QA

Primitive Feynman diagrams and the rational Goussarov--Habiro Lie algebra of string links

Pith reviewed 2026-05-24 00:37 UTC · model grok-4.3

classification 🧮 math.GT math.QA
keywords Goussarov-Habiro filtrationstring linksFeynman diagramsLie algebrafinite type invariantsclasper surgerySTU relationsflip graphs
0
0 comments X

The pith

The rational Goussarov-Habiro Lie algebra of string links admits a presentation by primitive Feynman tree diagrams modulo the 1T, AS, IHX and STU² relations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper gives generators and relations for the rational Goussarov-Habiro Lie algebra associated to the filtration of string links by clasper surgeries. It works with primitive Feynman diagrams as generators and shows that the relations 1T, AS, IHX and STU² suffice once the cycles in the flip graphs of forest diagrams are accounted for. This yields an explicit combinatorial model for the graded object that classifies string links up to C_n-equivalence. The same model supplies a diagrammatic proof that, rationally, two string links agree on all finite-type invariants of degree less than n precisely when they are C_n-equivalent.

Core claim

The rational Goussarov-Habiro Lie algebra LL(m)_Q is presented by the vector space of primitive Feynman tree diagrams on m strands, quotiented by the linear span of the 1T, AS, IHX and STU² relations. The proof proceeds by examining the flip graphs on forest diagrams and verifying that their cycles are generated exactly by the STU moves, so that no further relations are required.

What carries the argument

Primitive Feynman tree diagrams together with the relations 1T, AS, IHX and STU², carried by the analysis of cycles in the flip graphs of forest diagrams.

If this is right

  • The graded pieces of the Goussarov-Habiro filtration on string links are spanned by the indicated diagrams modulo the four relations.
  • Agreement of two string links on all rational finite-type invariants of degree less than n is equivalent to C_n-equivalence.
  • The Lie algebra structure is realized directly by the diagrammatic operations compatible with the relations.
  • Massuyeau's rational Goussarov-Habiro conjecture for string links follows from the presentation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same flip-graph technique might produce presentations for the integral or other coefficient versions of the algebra.
  • Explicit bases or dimension formulas for low-degree pieces could be extracted by enumerating the diagrams up to the relations.
  • The method may adapt to other filtered objects such as braids or pure braids where similar diagram calculi appear.

Load-bearing premise

The cycles that appear in the flip graphs of forest diagrams are generated exactly by the STU relations, with no additional independent relations needed.

What would settle it

Exhibit a cycle in some flip graph of forest diagrams whose homology class is not in the span of the STU relations.

Figures

Figures reproduced from arXiv: 2406.01093 by Bruno Dular.

Figure 1
Figure 1. Figure 1: Long knots and string links When m = 1, elements of L(1) are called long knots and closing a long knot yields an isomorphism between L(1) and the monoid of knots under connected sum (Figure 1a). Thus, the study and classification of string links naturally belong to knot theory, and one of the main tools for probing them is the use of invariants. A string link invariant V : L(m) → A valued in an abelian gro… view at source ↗
Figure 2
Figure 2. Figure 2: The 4T, STU and 1T relations 3One can replace isotopies by ambient isotopies by the smooth isotopy extension theorem. 4Here, dominate means that the collection of all Vassiliev invariants determines the mentioned known invariants. 5The cyclic orientation is usually not indicated, in which case it is assumed to be counterclockwise [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The AS and IHX relations A natural question about Vassiliev invariants is: what do they detect? In the case of knots (m = 1), Goussarov [Gou98] and Habiro [Hab00] independently answered this question by introducing Cn-moves, defined using clasper surgeries. Those are local moves on string links that are modelled on tree claspers, ribbon trees with leaves attached to the strands, that geometrically realize … view at source ↗
Figure 4
Figure 4. Figure 4: Diagrams, claspers realizing them and Cn-moves For each n ≥ 1 the quotient monoid L(m)/Cn+1 turns out to be a nilpotent group, and Cn+1- equivalence classes of Cn-trivial string links form a finitely generated abelian group LnL(m) := Ln(m)/Cn+1 [GPV00; Hab00]. Those combine into a graded Lie Z-algebra LL(m) := L n≥1 LnL(m), the Goussarov–Habiro Lie algebra of string links on m strands. From their work, it … view at source ↗
Figure 5
Figure 5. Figure 5: Examples of diagrams By [Bar95], the inclusions Dc (S) ⊂ DF (S) ⊂ D(S) induce isomorphisms18 of graded Z￾modules (2.6) A(S) := ZDc (S) h4Ti ∼= ZDF (S) hSTUi ∼= ZD(S) hSTUi and the relations AS,IHX are consequences of STU (see Figures 2 and 3 for descriptions of all the involved relations). Unless stated otherwise, we use the presentation of A(S) using forest diagram. The degree n part of A(S) is denoted An… view at source ↗
Figure 6
Figure 6. Figure 6: One slice of a graph of labelled forests Proof. To prove this, we scan Pn using the height function (2.20) h: Vn −→ N: v 7−→ Xn i=1 #{j > i | vj < vi} which assigns to a word v the number h(v) of pairs of letters . . . vi . . . vj . . . where vj < vi appearing in it, i.e. the number of inversions in v. For example, h(wn) = 0 is minimal and h(wn) is maximal in Pn. The function h is a Morse function in the s… view at source ↗
Figure 7
Figure 7. Figure 7: Relations obtained from cycles of length 4 and 6 Definition 2.3.2.7. For two labelled forests F, F′ ∈ Fe(T1, . . . , Ts), s ≥ 2, define (2.28) −−→ F F′ := −−→F F1 + · · · + −−−−→ Fl−1F ′ ∈ ZD s−1 (m) hAS, R, 7Ri where F F1 · · · F ′ is a path from F to F ′ in Fe(T1, . . . , Ts). Any two choices of paths differ by a cycle, which can be decomposed into back-and-forth paths, squares and hexagons, by Corollary… view at source ↗
Figure 8
Figure 8. Figure 8: Two different leg moves joining two forests Thus, the notation −−→ F F′ is ambiguous. Given a directed edge F e F ′ we write −→e to denote the third term of the corresponding STU relation, i.e. −→e = F ′ − F in A(m). △ Lemma 2.3.3.3. For any labelled forest diagram F, the forgetful map Fe(F) ։ F(F) satisfies the following path-lifting property: For any path P = F0 e0 F1 e1 . . . el−1 Fl in F(F) and any cho… view at source ↗
Figure 9
Figure 9. Figure 9: A degree 3 simple tree clasper and the resulting clasper surgery. A tree clasper C has a degree deg(C) = #leaves − 1, which is equal to the degree of its underlying tree diagram. For example, the tree claspers in [PITH_FULL_IMAGE:figures/full_fig_p026_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Crossing edges and sliding leaves perform a crossing change between edges of those two trees, up to a Cp+q+1-move, see Figure 10a. Similarly, given a tree of degree p, one can perform a crossing change between one of its edges and a tangle strand, up to a Cp+1-move, see Figure 10b. Lastly, one can slide two leaves, that belong to distinct trees of respective degrees p and q, across one another, up to a Cp… view at source ↗
Figure 11
Figure 11. Figure 11: Realizing a tree diagram (3) The choice of leaf to which we added the additional half-twist. A change of chosen leaf can be obtained by introducing two new half-twists: one to cancel out with the former one, and one as the new one. Since adding a half-twist corresponds to inversing modulo Cn+1 and inversing twice does not change anything, this choice does not matter modulo Cn+1. For a tree clasper CT in s… view at source ↗
Figure 12
Figure 12. Figure 12: The 1T relation for claspers The map R˜ satisfies AS: Flipping a node introduces three half-twists, hence we are done since each half-twist corresponds to inversing (see Theorem 4.7 in [Hab00]): (3.8) ≃ Cn+1 ∼ − . The map R˜ satisfies IHX: Proving that the IHX relation is satisfied requires a bit more care. A proof is given in [Gou01, Theorem 6.6] in the different but equivalent language of [PITH_FULL_IM… view at source ↗
Figure 13
Figure 13. Figure 13: Commutator of string links (top) versus commutator of tree dia￾grams (bottom) rest. All in all, we obtain (3.15) [σ(T), σ(T ′ )] = σ(TT ′T T′ ) = Xr−1 i=1 σ( −→ǫi). Let us compare (3.15) with the commutator of the original tree diagrams T, T′ . We can follow the exact same path of slide moves on the diagrammatic level to get (3.16) [T ′ , T] = −−−−−−−−→ (T T′ )(T ′T) = Xr−1 i=1 −→ei . by Definition 2.3.2.… view at source ↗
read the original abstract

Goussarov-Habiro's theory of clasper surgeries defines a filtration of the monoid of string links $L(m)$ on $m$ strands, in a way that geometrically realizes the Feynman diagrams appearing in low-dimensional and quantum topology. Concretely, $L(m)$ is filtered by $C_n$-equivalence, for $n\geq 1$, which is defined via local moves that can be seen as higher crossing changes. The graded object associated to the Goussarov-Habiro filtration is the Goussarov-Habiro Lie algebra of string links $\mathcal{L} L(m)$. We give a concrete presentation, in terms of primitive Feynman (tree) diagrams and relations ($\text{1T}$, $\text{AS}$, $\text{IHX}$, $\text{STU}^2$), of the rational Goussarov-Habiro Lie algebra $\mathcal{L} L(m)_{\mathbb{Q}}$. To that end, we investigate cycles in graphs of forests: flip graphs associated to forest diagrams and their $\text{STU}$ relations. As an application, we give an alternative diagrammatic proof of Massuyeau's rational version of the Goussarov-Habiro conjecture for string links, which relates indistinguishability under finite type invariants of degree $<n$ and $C_n$-equivalence.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims to give an explicit presentation of the rational Goussarov-Habiro Lie algebra LL(m)_Q in terms of primitive Feynman tree diagrams modulo the relations 1T, AS, IHX and STU². The presentation is obtained by showing that the STU relations generate all cycles in the flip graphs of forest diagrams; as an application the authors supply an alternative diagrammatic proof of Massuyeau’s rational form of the Goussarov-Habiro conjecture relating C_n-equivalence to finite-type invariants of degree less than n.

Significance. If the central generation statement holds, the work supplies a concrete combinatorial model for the associated graded object of the Goussarov-Habiro filtration and an independent diagrammatic route to a known result of Massuyeau. The explicit use of flip-graph cycles and the introduction of the STU² relation constitute a genuine technical contribution to the study of clasper surgery and finite-type invariants.

major comments (2)
  1. [Section on cycles in flip graphs of forests] The abstract and introduction assert that the listed relations together with the analysis of flip-graph cycles yield the claimed presentation, yet the manuscript does not contain a self-contained verification that the STU relations (including the variant STU²) generate the full cycle space of the relevant forest flip graphs; without this completeness argument the identification of LL(m)_Q with the diagram algebra remains conditional.
  2. [Definition and properties of STU²] The treatment of the STU² relation (distinct from the classical STU) is introduced to handle the primitive case, but the text does not supply an explicit check that this relation is compatible with the rational coefficients and does not collapse additional generators; this step is load-bearing for the claimed presentation.
minor comments (2)
  1. [Notation subsection] Notation for the flip-graph vertices and edges is introduced without a small illustrative example for m=2 or m=3; adding one would clarify the correspondence between diagrams and graph edges.
  2. [Main theorem] The statement of the main theorem would benefit from an explicit list of the generators and relations in a single displayed equation rather than being distributed across the text.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback. We address each major comment below and indicate the revisions we will make to strengthen the manuscript.

read point-by-point responses
  1. Referee: [Section on cycles in flip graphs of forests] The abstract and introduction assert that the listed relations together with the analysis of flip-graph cycles yield the claimed presentation, yet the manuscript does not contain a self-contained verification that the STU relations (including the variant STU²) generate the full cycle space of the relevant forest flip graphs; without this completeness argument the identification of LL(m)_Q with the diagram algebra remains conditional.

    Authors: We acknowledge that the completeness of the cycle-space generation argument benefits from a more consolidated presentation. Section 3 develops the necessary inductive analysis on forest diagrams and explicitly shows that STU relations (including STU²) generate all cycles via a sequence of local moves and basis comparisons. To address the concern directly, the revised manuscript will add a new subsection 3.4 that states a single theorem asserting that these relations span the full cycle space, followed by a self-contained outline of the proof that collects the key lemmas without requiring the reader to assemble them from earlier parts. This renders the identification of LL(m)_Q unconditional. revision: yes

  2. Referee: [Definition and properties of STU²] The treatment of the STU² relation (distinct from the classical STU) is introduced to handle the primitive case, but the text does not supply an explicit check that this relation is compatible with the rational coefficients and does not collapse additional generators; this step is load-bearing for the claimed presentation.

    Authors: We agree that an explicit verification of compatibility over Q is warranted. In the revision we will insert a short proposition (new Proposition 2.7) that verifies STU² is well-defined over the rationals by exhibiting an explicit Q-linear map from the diagram space to the known rational Goussarov–Habiro algebra and confirming that the kernel is precisely the span of the intended relations. The argument proceeds by direct computation on diagrams with at most four vertices and invokes the known dimension formula to show no extra generators are collapsed. This step will be placed immediately after the definition of STU². revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The derivation proceeds by directly investigating cycles in the flip graphs of forest diagrams and showing that the STU relations generate all such cycles, thereby obtaining the claimed presentation of LL(m)_Q in terms of primitive tree diagrams modulo the standard 1T, AS, IHX and STU² relations. This combinatorial argument supplies an independent route to the result and to the alternative proof of Massuyeau's conjecture; no step reduces by construction to a fitted parameter, a self-citation chain, or a renaming of prior inputs. The cited relations are standard in the literature and the central claim rests on the new graph-theoretic analysis rather than on any load-bearing self-reference.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Based solely on the abstract; the paper relies on the standard framework and relations of Goussarov-Habiro theory and Feynman-diagram calculus. No free parameters or new invented entities are indicated. Specific additional axioms invoked inside the proof of the presentation cannot be identified.

axioms (2)
  • domain assumption The Goussarov-Habiro filtration on string links is defined by C_n-equivalence via clasper surgeries
    Foundational setup stated in the first sentence of the abstract.
  • domain assumption The relations 1T, AS, IHX and STU² are the complete set of relations needed on primitive Feynman tree diagrams
    Explicitly listed in the abstract as the relations used for the presentation.

pith-pipeline@v0.9.0 · 5767 in / 1541 out tokens · 68876 ms · 2026-05-24T00:37:34.282181+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages · 1 internal anchor

  1. [1]

    Bar-Natan

    [Bar95] D. Bar-Natan. ‘On the Vassiliev knot invariants’. I n: Topology 34.2 (1995), pp. 423–

  2. [2]

    Bar-Natan

    [Bar96] D. Bar-Natan. ‘Non-associative tangles’. In: Geometric topology (proceedings of the Georgia international topology conference),(WH Kazez, ed .) 1996, pp. 139–183. [BH21] P. Boavida de Brito and G. Horel. ‘Galois symmetries o f knot spaces’. In: Compositio Mathematica 157.5 (2021), pp. 997–1021. [BL93] J. S. Birman and X.-S. Lin. ‘Knot polynomials ...

  3. [3]

    The Kontsevich integral

    arXiv: math/0501040 [math.GT] . [CDM12] S. Chmutov, S. Duzhin and J. Mostovoy. Introduction to Vassiliev knot invariants . Cambridge University Press,

  4. [4]

    [Con08] J. Conant. ‘Homotopy approximations to the space of knots, Feynman diagrams, and a conjecture of Scannell and Sinha’. In: American journal of mathematics 130.2 (2008), pp. 341–357. [CST07] J. Conant, R. Schneiderman and P. Teichner. ‘Jacobi identities in low-dimensional topology’. In: Compos. Math. 143.3 (2007), pp. 780–810. [CST12] James Conant, ...

  5. [5]

    [Lan94] S. Lando. ‘On primitive elements in the bialgebra of chord diagrams’. In: Amer. Math. Soc. Transl. Ser 2 (1994), pp. 167–174. [Laz54] M. Lazard. ‘Sur les groupes nilpotents et les anneau x de Lie’. In: Annales scientifiques de l’ ´Ecole Normale Sup´ erieure. Vol

  6. [6]

    1954, pp. 101–190. [LM96] T. T. Q. Le and J. Murakami. ‘The universal Vassiliev- Kontsevich invariant for framed oriented links’. In: Compositio Mathematica 102.1 (1996), pp. 41–64. [LTV10] P. Lambrechts, V. Turchin and I. Voli´ c. ‘Associahe dron, cyclohedron and permuto- hedron as compactifications of configuration spaces’. In: Bulletin of the Belgian Mat...

  7. [7]

    ‘Linking number and Milnor invariants’

    [Mei21] Jean-Baptiste Meilhan. ‘Linking number and Milnor invariants’. In: Encyclopedia of knot theory. Chapman and Hall/CRC, 2021, pp. 817–830. [MM65] J. Milnor and J. Moore. ‘On the structure of Hopf algeb ras’. In: Annals of Mathem- atics (1965), pp. 211–264. [Mon93] S. Montgomery. Hopf algebras and their actions on rings

  8. [8]

    2010, pp

    Cambridge University Press. 2010, pp. 439–472. [NSS22] Yuta Nozaki, Masatoshi Sato and Masaaki Suzuki. ‘On the kernel of the surgery map restricted to the 1-loop part’. In: Journal of Topology 15.2 (2022), pp. 587–619. [Oht02] T. Ohtsuki. Quantum invariants: A study of knots, 3-manifolds, and thei r sets . Vol

  9. [9]

    Postnikov

    [Pos09] A. Postnikov. ‘Permutohedra, associahedra, and be yond’. In: International Mathem- atics Research Notices 2009.6 (2009), pp. 1026–1106. [Ron11] M. Ronco. ‘Shuffle bialgebras’. In: Annales de l’Institut Fourier . Vol

  10. [10]

    2011, pp. 799–850. [Shi23] Y. Shi. ‘Goodwillie’s cosimplicial model for the sp ace of long knots and its applica- tions’. In: Journal of Homotopy and Related Structures (2023), pp. 1–48. REFERENCES 42 [Tur16] Vladimir G. Turaev. Quantum Invariants of Knots and 3-Manifolds . Berlin, Boston: De Gruyter,

  11. [11]

    [Vas90] V

    isbn: 9783110435221. [Vas90] V. A. Vassiliev. ‘Cohomology of knot spaces’. In: Theory of Singularities and its Applications (Providence)(VI Arnold, ed . . . (1990). [Zie12] G. M. Ziegler. Lectures on polytopes. Vol