Milnor invariants, $2n$-moves and $V^{n}$-moves for welded string links
Haruko A. Miyazawa, Kodai Wada, Akira Yasuhara

TL;DR
This paper extends the classification of welded string links using Milnor invariants, demonstrating that certain moves and virtualizations can be characterized by these invariants, thus advancing understanding in knot theory.
Contribution
It provides two new classifications of welded string links up to specific moves and virtualizations using Milnor invariants, generalizing previous results for classical links.
Findings
Welded string links are classified up to $2n$-move and virtualization.
Welded string links are classified up to $V^{n}$-move and virtualization.
Milnor invariants effectively distinguish welded string links under these moves.
Abstract
In a previous paper, the authors proved that Milnor link-homotopy invariants modulo classify classical string links up to -move and link-homotopy. As analogues to the welded case, in terms of Milnor invariants, we give here two classifications of welded string links up to -move and self-crossing virtualization, and up to -move and self-crossing virtualization, respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Homotopy and Cohomology in Algebraic Topology · Cellular transport and secretion
Milnor invariants, -moves and -moves
for welded string links
Haruko A. Miyazawa
Institute for Mathematics and Computer Science, Tsuda University, 2-1-1 Tsuda-Machi, Kodaira, Tokyo 187-8577, Japan
,
Kodai Wada
Faculty of Education and Integrated Arts and Sciences, Waseda University, 1-6-1 Nishi-Waseda, Shinjuku-ku, Tokyo 169-8050, Japan
and
Akira Yasuhara
Faculty of Commerce, Waseda University, 1-6-1 Nishi-Waseda, Shinjuku-ku, Tokyo 169-8050, Japan
Abstract.
In a previous paper, the authors proved that Milnor link-homotopy invariants modulo classify classical string links up to -move and link-homotopy. As analogues to the welded case, in terms of Milnor invariants, we give here two classifications of welded string links up to -move and self-crossing virtualization, and up to -move and self-crossing virtualization, respectively.
Key words and phrases:
Welded string links, Milnor invariants, -moves, -moves, self-crossing virtualization, arrow calculus.
2010 Mathematics Subject Classification:
57M25, 57M27
The second author was supported by a Grant-in-Aid for JSPS Research Fellow (#17J08186) of the Japan Society for the Promotion of Science.
The third author was partially supported by a Grant-in-Aid for Scientific Research (C) (#17K05264) of the Japan Society for the Promotion of Science and a Waseda University Grant for Special Research Projects (#2018S-077).
1. Introduction
In [19, 20] J. Milnor defined a family of classical link invariants, known as Milnor -invariants. Given an -component classical link , Milnor invariants are indexed by a finite sequence of elements in . In [12] N. Habegger and X.-S. Lin introduced the notion of classical string links and defined Milnor invariants for classical string links. These invariants are called Milnor -invariants. It is remarkable that -invariants for non-repeated sequences classify classical string links up to link-homotopy [12] (whereas -invariants are not enough strong to classify classical links with four or more components up to link-homotopy [17]). Here the link-homotopy is the equivalence relation on classical (string) links generated by the self-crossing change and ambient isotopy [19].
A -move is a local move as illustrated in Figure 1.1. The -moves were probably first studied by S. Kinoshita in 1957 [15]. Since then, -moves have been well-studied in Knot Theory. In particular, the connections between -moves and classical link invariants are increasingly well-understood; see for example [16, 23, 8, 9]. Recently, the authors [22] established the relation between Milnor link-homotopy invariants and -moves as follows.
Theorem 1.1** ([22, Theorem 1.1]).**
Let be a positive integer. Two classical string links and are -equivalent if and only if for any non-repeated sequence .
Here, the -equivalence is the equivalence relation generated by the -move, self-crossing change and ambient isotopy.
The set of -component classical string links has a monoid structure under the stacking product. Habegger and Lin proved that the set of link-homotopy classes of forms a torsion free group of rank [12, Section 3]. We remark that the quotient of under -equivalence forms a finite group generated by elements of order , and that the order of the group is [22, Corollary 1.2].
The notion of welded string links was introduced by R. Fenn, R. Rimányi and C. Rourke [10]. M. Goussarov, M. Polyak and O. Viro essentially proved that two classical string links are equivalent as welded objects if and only if they are equivalent as classical objects [11, Theorem 1.B]. Therefore, welded string links can be viewed as a natural extension of classical string links. The study of welded string links has recently become an area of active interest; see for example [5, 6, 1, 2, 3, 18].
In [2] B. Audoux, P. Bellingeri, J.-B. Meilhan and E. Wagner defined Milnor invariants, denoted by , for welded string links and proved that the -invariants for non-repeated sequences classify welded string links up to sv-equivalence. Here, the sv*-equivalence* is the equivalence relation generated by the self-crossing virtualization and welded isotopy. A crossing virtualization is a local move replacing a classical crossing with virtual one, and a self-crossing virtualization is a crossing virtualization involving two strands of a single component. The sv-equivalence is indeed a natural extension of link-homotopy in the sense that two classical string links are sv-equivalent if and only if they are link-homotopic [1, Theorem 4.3].
As analogues of Theorem 1.1 to the welded case, we show the following two theorems.
Theorem 1.2**.**
Let be a positive integer. Two -component welded string links and are -equivalent if and only if for any non-repeated sequence , and for any .
Here, the -equivalence is the equivalence relation on welded string links generated by the -move, self-crossing virtualization and welded isotopy.
Remark 1.3*.*
In [3, Proposition 3.8], Audoux, Bellingeri, Meilhan and Wagner proved Theorem 1.2 for . Note that is written as in [3].
Theorem 1.4**.**
Let be a positive integer. Two welded string links and are -equivalent if and only if for any non-repeated sequence .
Here a -move, defined by the authors in [21], is an oriented local move as illustrated in Figure 1.2 which is a generalization of the crossing virtualization. (In fact, the -move is equivalent to the crossing virtualization.) The -equivalence is the equivalence relation on welded string links generated by the -move, self-crossing virtualization and welded isotopy.
Let and denote the quotients of the set of -component welded string links under -equivalence and -equivalence, respectively. Since the set of sv-equivalence classes of forms a group of rank [4, Remark 4.9], it is not hard to see that both and also form groups. In contrast to , the quotient is not a finite group. On the other hand, we have the following.
Corollary 1.5**.**
The quotient forms a finite group generated by elements of order , and the order of the group is .
Theorems 1.2 and 1.4 indicate that -equivalence implies -equivalence (Proposition 5.1). Moreover, these theorems together with Theorem 1.1 imply that both natural maps and are injective (Proposition 5.7). Figure 1.3 gives the summary of relations between , and .
2. Welded string links and welded Milnor invariants
In this section, we review the definitions of welded string links and their Milnor invariants.
2.1. Welded string links
An -component virtual string link diagram is an -component string link diagram in the plane, whose transverse double points admit not only classical crossings but also virtual crossings illustrated in Figure 2.1. Throughout the paper, virtual string link diagrams are assumed to be ordered and oriented.
A welded string link is an equivalence class of virtual string link diagrams under welded Reidemeister moves, which consist of Reidemeister moves R1–R3, virtual moves V1–V4 and the overcrossings commute move OC illustrated in Figure 2.2. A sequence of welded Reidemeister moves is called a welded isotopy.
Here, we give the definition of the group of a welded string link. The group of a virtual string link diagram is defined via the Wirtinger presentation [14, Section 4], i.e. an arc of yields a generator, and each classical crossing gives a relation of the form , where and correspond to the underpasses and corresponds to the overpass at the crossing; see Figure 2.3. (Here, an arc of is a piece of strand such that each boundary is either a strand endpoint or a classical undercrossing, and the interior does not contain classical undercrossings.) The group is preserved under welded isotopy [14, 24], and hence we define the group of a welded string link to be of a virtual diagram of .
2.2. Welded Milnor invariants
In [2], Audoux, Bellingeri, Meilhan and Wagner defined Milnor invariants for ribbon -dimensional string links, i.e. properly embedded annuli in the -ball bounding immersed -balls with only ribbon singularities. They also defined a welded extension of Milnor invariants, which is an invariant of welded string links, via the Tube map (see [25, 24]) sending welded string links to ribbon -dimensional string links. These invariants are called welded Milnor invariants. The construction of welded Milnor invariants is topological, since it is defined via the Tube map. However, applying Milnor’s algorithm given in [20], we can (define and) compute welded Milnor invariants by means of virtual diagrams as follows.
Given an -component welded string link , consider its virtual diagram . Put labels in order on all arcs of the th component while we go along orientation on from the initial arc, where denotes the number of arcs of . We call the arc of the th meridian. The Wirtinger presentation of has the form
[TABLE]
where the are generators or inverses of generators that depend on the signs of the classical crossings. Here we set
[TABLE]
We call the product an th longitude. Furthermore, we obtain the preferred longitude by multiplying by on the left for some .
Let denote the th term of the lower central series of , and let denote the image of in the quotient . Since is generated by (see [7, 2]), the th preferred longitude is expressed modulo as a word in for each . We denote this word by .
Let denote the free group on , and let denote the ring of formal power series in noncommutative variables with integer coefficients. The Magnus expansion is a homomorphism
[TABLE]
defined by, for ,
[TABLE]
Definition 2.1**.**
For a sequence of elements in , the welded Milnor invariant of is the coefficient of in the Magnus expansion .
Remark 2.2* ([2, Theorem 5.4]).*
The -invariant is indeed a welded extension of the (classical) Milnor -invariant in the sense that if is a classical string link, then for any sequence .
To compute , we need to obtain the word in concretely. In [20], Milnor introduced an algorithm to give by using the Wirtinger presentation of and a sequence of homomorphisms . (Although this algorithm was actually given for Milnor invariants of links, it can be applied to those of welded string links.)
Let denote the free group on the Wirtinger generators , and let denote the free subgroup generated by . A sequence of homomorphisms is defined inductively by
[TABLE]
Let denote the th term of the lower central series of , and let denote the normal subgroup of generated by the Wirtinger relations . Milnor proved that
[TABLE]
Hence, by the congruence above, we can identify with , where is a homomorphism defined by .
3. Welded Milnor invariants and -moves
In this section, we discuss the invariance of welded Milnor invariants under -moves. We start with the following theorem concerning -invariants for non-repeated sequences.
Theorem 3.1**.**
Let be a positive integer. If two welded string links and are -equivalent, then for any non-repeated sequence .
Proof.
It is obvious for , and hence we consider the case . Since -invariants for non-repeated sequences are sv-equivalence invariants, we show that their residue classes modulo are preserved under -moves.
Let and be virtual diagrams of -component welded string links and , respectively. Assume that and are related by a single -move in a disk ; see Figure 3.1. Since a -move involving two strands of a single component is realized by sv-equivalence, we may assume that two strands in the disk belong to different components. Put labels , on all arcs of as described in Section 2.2, and put labels on all arcs in which correspond to the arcs labeled in . Also put labels on the arcs of in as illustrated in Figure 3.1. Let be the free group on and the free subgroup on . Let denote the sequence of homomorphisms associated with given in Section 2.2, and define a homomorphism by .
Here, for , we use the notation if is contained in the ideal generated by . For the th preferred longitudes and associated with and , respectively, it is enough to show that
[TABLE]
for any , where denotes [math] or the terms containing at least two for some . Without loss of generality we may assume that , i.e. we compare and . Recall that two strands in belong to different components. This implies that .
If in Figure 3.1, then is obtained from by replacing with and with .
If in Figure 3.1, then and can be written respectively in the forms
[TABLE]
and
[TABLE]
Therefore, in both cases, Congruence (3.1) follows from the claim below. ∎
Claim 3.2*.*
Let be an integer and . For any and , the following and hold:
- (1)
. 2. (2)
.
Proof.
By the definition of , it follows that for some word in . Set and , where and denote the terms of degree such that . Then we have
[TABLE]
where . Note that each term in contains . Therefore, it follows that
[TABLE]
This completes the proof of Claim 3.2 (1).
The proof of Claim 3.2 (2) is done by induction on . The assertion certainly holds for . Recall that
[TABLE]
and
[TABLE]
If does not pass through or in Figure 3.1, then is obtained from by replacing with . Hence, by the induction hypothesis. This implies that
[TABLE]
If passes through and in Figure 3.1, then and can be written respectively in the forms
[TABLE]
and
[TABLE]
By Claim 3.2 (1) and the induction hypothesis, it follows that . This completes the proof of Claim 3.2 (2). ∎
Proposition 3.3**.**
Let be a positive integer. If two -component welded string links and are -equivalent, then for any non-repeated sequence , and for any .
Proof.
As mentioned in Section 1, -equivalence implies -equivalence (Proposition 5.1). This together with Theorem 3.1 implies that the residue class of modulo is preserved under -equivalence.
By a single -move involving two strands of the th and the th components, both of the changes of and are if and [math] otherwise. Furthermore, since and are sv-equivalence invariants, the integer is preserved under -equivalence. This completes the proof. ∎
For -invariants possibly with repeated sequences, we have the following.
Proposition 3.4**.**
Let be a prime number. If two welded string links and are related by -moves, then for any sequence of length .
Proof.
Let and be virtual diagrams of -component welded string links and , respectively. Assume that and are related by a single -move. We use the same notation as in the proof of Theorem 3.1. It is enough to show that, for any ,
[TABLE]
By arguments similar to those in the proof of Theorem 3.1, is obtained from by replacing with for all and inserting the th powers of elements in the free group . The following claim, which was proved in [22], completes the proof. ∎
Claim 3.5* ([22, Claim 3.6]).*
(1) For any word in , we have
[TABLE]
(2) For any and , we have
[TABLE]
4. Arrow calculus
To show Theorems 1.2 and 1.4 we will use arrow calculus, introduced by Meilhan and the third author in [18], which is a welded version of the theory of claspers [13]. In this section, we briefly recall the basic notions of arrow calculus from [18].
4.1. Definitions
Definition 4.1**.**
Let be a virtual string link diagram. An immersed connected uni-trivalent tree in the plane of the diagram is called a w*-tree* for if it satisfies the following:
- (1)
The trivalent vertices of are pairwise disjoint and disjoint from . 2. (2)
The univalent vertices of are pairwise disjoint and are contained in D\setminus\{\text{crossings of D}\}. 3. (3)
All edges are oriented such that each trivalent vertex has two ingoing and one outgoing edge. 4. (4)
All singularities of and those between and are virtual crossings. 5. (5)
Each edge of has a number (possibly zero) of decorations , called twists, which are disjoint from all vertices and crossings.
The univalent vertices of with outgoing edges are called tails, and the unique univalent vertex of with an ingoing edge is called the head. Tails and the head are also called endpoints when we do not need to distinguish between them. The terminal edge of is the edge which is incident to the head. We say that is a w*-tree of degree * or -tree if has tails. In particular, a -tree is called a w*-arrow*.
Given a uni-trivalent tree, picking a univalent vertex as the head uniquely determines an orientation on all edges respecting the above rule. Hence, we may only indicate the orientation on w-trees at the terminal edge.
For a union of w-trees, vertices are assumed to be pairwise disjoint, and crossings among edges are assumed to be virtual. Hereafter, diagrams are drawn with bold lines, while w-trees are drawn with thin lines. Furthermore, we do not draw small circles around virtual crossings between w-trees and between w-trees and diagrams, while we keep small circles between diagrams.
4.2. Surgery along w-trees
The w-trees are equipped with surgery operations on virtual diagrams. This subsection gives the definition of surgery along w-trees.
We first consider the case of w-arrows. Let be a union of w-arrows for a virtual string link diagram . Surgery along on yields a new virtual string link diagram, denoted by , as follows. Assume that there exists a disk in the plane which intersects as illustrated in Figure 4.1. Then the figure indicates the result of surgery along a w-arrow of on . We emphasize that the surgery operation depends on the orientation of the strand of containing the tail of the w-arrow.
If a w-arrow of intersects a (possibly the same) w-arrow (resp. ), then the result of surgery is essentially the same as above but each intersection introduces virtual crossings illustrated in the left-hand side (resp. center) of Figure 4.2. Furthermore, if a w-arrow of has some twists, then each twist is converted to a half-twist whose crossing is virtual; see the right-hand side of Figure 4.2.
An arrow presentation for a virtual string link diagram is a pair of a virtual string link diagram without classical crossings and a union of w-arrows for such that is welded isotopic to . Any virtual string link diagram has an arrow presentation because any classical crossing can be replaced by a virtual one with a w-arrow; see Figure 4.3. Two arrow presentations and are equivalent if and are welded isotopic. In [18, Section 4.3], Meilhan and the third author gave a list of local moves on arrow presentations, which are called arrow moves. They proved that two arrow presentations are equivalent if and only if they are related by a sequence of arrow moves [18, Theorem 4.5].
Now we define surgery along w-trees. We start with some preliminary definitions. A subtree of a w-tree is a connected union of edges and vertices of the w-tree. Let be a subtree of a w-tree for a virtual string link diagram (possibly itself). For each endpoint of , consider a point on which is adjacent to such that we meet and consecutively in this order when going along orientation on . Joining these new points by a copy of , we can form a new subtree such that and run parallel and cross only at virtual crossings. Then and are called two parallel subtrees.
The expansion move (E) for a -tree, having two variations, produces four w-trees of degree illustrated in Figure 4.4. In the figure, the dotted lines on the left-hand side of “” represent two subtrees, which form the -tree together with represented part. The dotted parts on the right-hand side represent parallel copies of both subtrees.
Applying (E) recursively, we can turn any w-tree into a union of w-arrows. We call the union of w-arrows the expansion of the w-tree. The surgery along a w-tree is surgery along its expansion. As before, denotes the result of surgery on along a union of w-trees.
As a natural generalization of arrow presentations, a w*-tree presentation* for a virtual string link diagram is defined as a pair of a virtual string link diagram without classical crossings and a union of w-trees for such that is welded isotopic to . Two w-tree presentations and are equivalent if and are welded isotopic. Then arrow moves are extended to a set of local moves on w-tree presentations, which are called w*-tree moves*. It is proved that two w-tree presentations are equivalent if and only if they are related by a sequence of w-tree moves [18, Theorem 5.21].
In Section 5, we will use three kinds of w-tree moves, inverse, tails exchange and heads exchange moves illustrated in Figure 4.5. The inverse move yields or deletes two parallel w-trees which only differ by a twist on the terminal edge, the tails exchange move makes an exchange of two consecutive tails of w-trees, and the heads exchange move makes an exchange of two consecutive heads of of w-trees at the expense of an additional w-tree illustrated in the lower right of Figure 4.5.
4.3. w-tree moves up to sv-equivalence
To study virtual diagrams up to welded isotopy, we can work on w-tree presentations together with w-tree moves. Considering virtual diagrams up to sv-equivalence, we can use some additional moves on w-tree presentations. In this subsection, we recall these moves from [18, Section 9.1]. (Note that sv-equivalence is called homotopy in [18].)
A self-arrow is a w-arrow whose tail and head are attached to a single component of a virtual diagram. More generally, a repeated w-tree is a w-tree having two endpoints attached to a single component of a virtual diagram. Clearly, adding or deleting a self-arrow on w-tree presentations corresponds to a self-crossing virtualization on virtual diagrams, i.e. surgery along a self-arrow does not change the sv-equivalence class of a virtual diagram. This holds also for repeated w-trees.
Lemma 4.2** ([18, Lemma 9.2]).**
Surgery along a repeated w-tree does not change the sv-equivalence class of a virtual diagram.
Exchanging a head and a tail of w-trees of arbitrary degree can be achieved at the expense of an additional w-tree as follows.
Lemma 4.3** ([18, Lemma 9.3]).**
Let be a -tree for a virtual diagram , and let be a -tree for . Let be obtained from by exchanging a tail of and the head of . Then is sv-equivalent to , where denotes the -tree for illustrated in Figure 4.6.
The modification of Figure 4.6 is called a head-tail exchange move. Heads, tails and head-tail exchange moves are also referred to as ends exchange moves.
5. Proofs
In this section, we give the proofs of Theorems 1.2 and 1.4.
Now we consider three local moves A, B and C on w-tree presentations illustrated in Figures 5.2 and 5.2. Surgery along an A-move is equivalent to a -move whose strands are oriented parallel. On the other hand, surgery along a B-move is equivalent to a -move. Furthermore, it is not hard to see that a B-move is equivalent to a C-move; see [21].
Using w-tree presentations, we show the following.
Proposition 5.1**.**
Let be a positive integer. If two welded string links are -equivalent, then they are -equivalent.
Proof.
A -move involving two strands of a single component is realized by link-homotopy111The equivalence relation on welded string links generated by the self-crossing change and welded isotopy is also referred to as link-homotopy.. Furthermore, as seen in the proof of [22, Theorem 3.1], a -move whose two strands are oriented antiparallel is realized by link-homotopy and a -move whose strands are oriented parallel. Since link-homotopy implies sv-equivalence, we may now assume that the orientations of the strands of a -move are always parallel.
Up to -equivalence, by Lemmas 4.2 and 4.3, we can use w-tree moves, B-, C-moves and ends exchange moves, and delete repeated w-trees on w-tree presentations. Hence, it is enough to show that an A-move is realized by a sequence of these operations, since a -move is realized by surgery along an A-move. Figure 5.3 indicates the proof. In the sequence of Figure 5.3 (a)–(c), we obtain (b) from (a) by B- and C-moves, and (c) from (b) by head-tail exchange moves and deleting repeated w-trees. ∎
For each integer , let denote the set of all sequences of distinct integers in such that for all . For , let be the -tree for the trivial -component string link diagram illustrated in Figure 5.4, and let be obtained from by inserting a twist in the terminal edge. Set and . We remark that is welded isotopic to by applying an inverse move to , where the notation “” denotes the stacking product. In [18], a complete list of representatives for welded string links up to sv-equivalence was given in terms of w-trees and welded Milnor invariants as follows.
Theorem 5.2** ([18, Theorem 9.4]).**
Let be an -component welded string link. Then is sv-equivalent to , where for each ,
[TABLE]
The following plays an important role to show Theorems 1.2 and 1.4.
Lemma 5.3**.**
Let be a positive integer and . Then, for any and , is -equivalent to .
Proof.
Since is welded isotopic to , it suffices to show the case , i.e. is -equivalent to for a sequence . Up to -equivalence, we can use w-tree moves, A-moves and ends exchange moves, and delete repeated w-trees on w-tree presentations. We relate to a w-tree presentation for by a sequence of these operations.
Figure 5.5 (a)–(c) describes the intermediates in the sequence between and a w-tree presentation for . In the sequence, we obtain (a) from by an inverse move, and (b) from (a) by an A-move. We obtain (c) from (b) by ends exchange moves on the th component of and deleting repeated w-trees. Finally, we obtain a w-tree presentation for from (c) by an inverse move and an A-move. ∎
Proposition 5.4**.**
Let be an -component welded string link, and let be as in Theorem 5.2. Then is -equivalent to , where
[TABLE]
for some with and , and where for each ,
[TABLE]
with and .
Proof.
It follows from Theorem 5.2 that is sv-equivalent to , where for each ,
[TABLE]
For each , by Lemma 5.3 and the fact that is welded isotopic to , is -equivalent to .
Now consider the case . Performing ends exchange moves and deleting repeated w-trees, a w-tree presentation for is deformed into one for , where
[TABLE]
By Lemmas 4.2 and 4.3, is sv-equivalent to . Furthermore, a w-tree presentation for is deformed into one for by using A-moves, ends exchange moves and inverse moves. Therefore, is -equivalent to . This completes the proof. ∎
Proposition 5.5**.**
Let be an -component welded string link, and let be as in Theorem 5.2. Then is -equivalent to , where for each ,
[TABLE]
with and .
Proof.
For any , we see that and are related by a single -move. This together with Proposition 5.1 and Lemma 5.3 implies that is -equivalent to for any and . Therefore, the proof can be done by arguments similar to those in the proof of Proposition 5.4. ∎
Proof of Theorem 1.2.
This follows from Propositions 3.3 and 5.4. ∎
Proof of Theorem 1.4.
This follows from Theorem 3.1 and Proposition 5.5. ∎
Remark 5.6*.*
By Theorem 1.2 (resp. Theorem 1.4), we can conclude that Proposition 5.4 (resp. Proposition 5.5) gives a complete list of representatives for welded string links up to -equivalence (resp. -equivalence).
Proof of Corollary 1.5.
This follows from Remark 5.6 and Lemma 5.3. ∎
In the rest of this paper, we discuss the relations between -, - and -equivalence.
It is not hard to see that -equivalence implies -equivalence. Furthermore, -equivalence implies -equivalence by Proposition 5.1. The converse implications hold for classical string links as follows.
Proposition 5.7**.**
Let be a positive integer, and let and be classical string links. The following assertions , and are equivalent:
- (1)
* and are -equivalent.* 2. (2)
* and are -equivalent.* 3. (3)
* and are -equivalent.*
Proof.
It is enough to show the implications and .
The proof of the implication is given as follows. If and are -equivalent, then for any non-repeated sequence by Theorem 1.2. It follows from Remark 2.2 that and . Hence, Theorem 1.1 completes the proof.
Using Theorem 1.4 instead of Theorem 1.2, the implication is similarly shown. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Audoux, P. Bellingeri, J.-B. Meilhan, E. Wagner, On usual, virtual and welded knotted objects up to homotopy , J. Math. Soc. Japan 69 (2017) 1079–1097.
- 2[2] B. Audoux, P. Bellingeri, J.-B. Meilhan, E. Wagner, Homotopy classification of ribbon tubes and welded string links , Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 17 (2017) 713–761.
- 3[3] B. Audoux, P. Bellingeri, J.-B. Meilhan, E. Wagner, Extensions of some classical local moves on knot diagrams , Michigan Math. J. 67 (2018) 647–672.
- 4[4] B. Audoux, J.-B. Meilhan, E. Wagner, On codimension two embeddings up to link-homotopy , J. Topol. 10 (2017) 1107–1123.
- 5[5] D. Bar-Natan, Z. Dancso, Finite-type invariants of w-knotted objects, I: w-knots and the Alexander polynomial , Algebr. Geom. Topol. 16 (2016) 1063–1133.
- 6[6] D. Bar-Natan, Z. Dancso, Finite type invariants of w-knotted objects II: tangles, foams and the Kashiwara-Vergne problem , Math. Ann. 367 (2017) 1517–1586.
- 7[7] K. T. Chen, Commutator calculus and link invariants , Proc. Amer. Math. Soc. 3 (1952) 44–55.
- 8[8] M. K. Da̧bkowski, J. H. Przytycki, Burnside obstructions to the Montesinos-Nakanishi 3 3 3 -move conjecture , Geom. Topol. 6 (2002) 355–360.
