Goussarov-Polyak-Viro's $n$-equivalence and the pure virtual braid group
Yuka Kotorii

TL;DR
This paper extends Stanford's equivalence to virtual knots and string links using the lower central series of the pure virtual braid group, establishing its relation to Goussarov-Polyak-Viro's $n$-equivalence and finite type invariants.
Contribution
It introduces the $L_n$-equivalence for virtual knots and links and proves its equivalence to the $n$-equivalence, linking it to finite type invariants.
Findings
$L_n$-equivalence equals $n$-equivalence on virtual string links
Two virtual string links are indistinguishable by finite type invariants of degree $n-1$ if $L_n$-equivalent
Extension of Stanford's equivalence to virtual knot theory
Abstract
In the context of finite type invariants, Stanford introduced a family of equivalence relations on knots defined by the lower central series of the pure braid groups and characterized the finite type invariants in terms of the structure of the braid groups. It is known that this equivalence and Ohyama's equivalence defined by a local move are equivalent. On the other hand, in the virtual knot theory, the concept of Ohyama's equivalence was extended by Goussarov-Polyak-Viro, which called an -equivalence. In this paper we extend Stanford's equivalence to virtual knots and virtual string links by using the lower central series of the pure virtual braid group, and call it an -equivalence. We then prove that the -equivalence is equal to the -equivalence on virtual string links. Moreover we directly prove that two virtual string links are not distinguished by any finite type…
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 · Advanced Combinatorial Mathematics
Goussarov-Polyak-Viro’s -equivalence and the pure virtual braid group
Yuka Kotorii
Mathematical Analysis Team, RIKEN Center for Advanced Intelligence Project (AIP)
1-4-1 Nihonbashi, Chuo-ku, Tokyo 103-0027, Japan
Department of Mathematics, Graduate School of Science, Osaka University
1-10 Machikaneyama Toyonaka Osaka 560-0043 Japan
interdisciplinary Theoretical & Mathematical Sciences Program (iTHEMS) RIKEN
2-1, Hirosawa, Wako, Saitama 351-0198, Japan
Abstract.
In the context of finite type invariants, Stanford introduced a family of equivalence relations on knots defined by the lower central series of the pure braid groups and characterized the finite type invariants in terms of the structure of the braid groups. It is known that this equivalence and Ohyama’s equivalence defined by a local move are equivalent. On the other hand, in the virtual knot theory, the concept of Ohyama’s equivalence was extended by Goussarov-Polyak-Viro, which called an -equivalence. In this paper we extend Stanford’s equivalence to virtual knots and virtual string links by using the lower central series of the pure virtual braid group, and call it an -equivalence. We then prove that the -equivalence is equal to the -equivalence on virtual string links. Moreover we directly prove that two virtual string links are not distinguished by any finite type invariants of degree if they are -equivalent, for any positive integer .
The author is partially supported by Grant-in-Aid for Young Scientists (B) (No. 16K17586), Japan Society for the Promotion of Science. This work was in part supported by RIKEN iTHEMS Program.
2010 Mathematics Subject Classification. 57M25, 57M27
1. Introduction
The theory of finite type invariants of knots and links was introduced by Vassiliev [20] and Goussarov [4, 5] and developed by Birman-Lin [2]. People studied a filtration on the set of all knots derived from finite type invariants. Through studying finite type invariants, Ohyama introduced a family of local moves which is defined as local moves satisfying some property [15] (also [4]). A filtration derived from Ohyama’s moves implied the filtration derived from finite type invariants. However, it had been an open question whether it held the converse implication or not.
After that, it solved by Goussarov [6, 7] and Habiro [9, 10] independently by introducing theories of surgery along embedded graphs in 3-manifolds, called -graphs (or variation axes) by Goussarov and claspers by Habiro. Goussarov [7] and Habiro [9, 10] proved that a geometric filtration derived from -variation equivalence generated by -graphs or -equivalence by claspers and the algebraic one derived from finite type invariants are the same. Therefore, the finite type invariants are given a topological characterization. Moreover, Goussarov proved in [7] that for knots in and string links, the n-variation equivalence coincides with the Ohyama’ equivalence.
Stanford also studied a filtration derived from finite type invariants by using the lower central series of the pure braid groups [18, 19]. He gave an equivalency of two filtrations by finite type invariant and his equivalence relation in [19]. Therefore the finite type invariant was characterized in terms of the structure of the braid groups.
On the other hand, a long virtual knot is defined by a (long) knot diagram with virtual crossings modulo Reidemeiser moves, introduced by Kauffman [11]. Goussarov-Polyak-Viro [8] showed that the (long) virtual knot can be redefined as Gauss diagram and also gave the theory of finite type invariants on Gauss diagrams. They also defined an -equivalence on (long) virtual knots as an extension of Ohyama’s equivalence and mentioned that the value of a finite type invariant of degree less than or equal to depended only the -equivalence class.
In this paper, we extend Stanford’s equivalence to (long) virtual knots, called an -equivalence. We prove that -equivalence coincides with -equivalence on long virtual knots (Theorem 5.4). Moreover, we directly prove that, for any non-negative integer , two -equivalent long virtual knots are not distinguished by any finite type invariants of degree (Proposition 6.6). These results are also established on virtual string links.
Acknowledgements
The author thanks Professor Kazuo Habiro for a lot of comments, discussions and suggestions. The author also thanks Professor Vassily Manturov for comments and suggestions.
2. Gauss diagram
A Gauss diagram on strands is an ordered oriented intervals with several oriented chords having disjoint endpoints and equipped with sign as in Figure 1 (which is defined up to isotopy of intervals). Here, we call the chord an arrow. The trivial Gauss diagram is a Gauss diagram without arrow.
Reidemeister moves among Gauss diagrams on several strands are the following three local moves in Figure 2: First Reidemeister move (RI) is in the top row. Second Reidemeister move (RII) is in the second row. Third Reidemeister move (RIII) is in the remaining two rows.
Definition 2.1**.**
Two Gauss diagrams and on several strands are said to be equivalent if and are related by a sequence of Reidemeister moves. By we mean that and are equivalent. We define a -component virtual string link to be the equivalence class of a Gauss diagram on strands, which is denoted by . In particular, 1-component virtual string link is called a long virtual knot. We denote by the set of -component virtual string links. Similarly, the equivalence class of a Gauss diagram on a circle (or several circles) is a virtual knot (or virtual link, respectively).
Definition 2.2**.**
Let and are two Gauss diagrams on the same strands. We denote the composition of and as , which attaches a head of the th interval of to an end of the th interval of for each .
3. Finite type invariant of virtual string links
Goussarov Polyak and Viro defined a finite type invariant for (long) virtual knots in [8]. Similar way to classical knots, we can define Vassiliev-Goussarov filtration on -module generated by the set of (long) virtual knots. Similarly, we can define them for virtual (string) links.
A dashed Gauss diagram is a Gauss diagram with two types of signed chords, arrow and dashed arrow as in Figure 3, possibly both with only arrows and with only dashed arrows. The dashed Gauss diagrams are said to be equivalent if they are related by a sequence of Reidemeister moves for arrows with fixing dashed arrows. We also denote by the equivalence class of a dashed Gauss diagram . For each , let denote the set of equivalence classes of dashed Gauss diagrams on strands with dashed arrows. Then, in particular, .
We construct a map as follows. Let be a dashed Gauss diagram with dashed arrows. Let be the dashed arrows of . For in , let denote the Gauss diagram obtained from by replacing each dashed arrow with an arrow with the same sign if and removing each dashed arrow if . We then define
[TABLE]
Definition 3.1**.**
Let be an invariant of with values in an abelian group . We extend it to by linearly. Then is said to be a finite type invariant of degree if vanishes for any -component dashed Gauss diagram with more than dashed arrows.
Definition 3.2**.**
Denote by the subgroup of generated by the set consisting of the element , where is in . It is easy to see that the ’s form a descending filtration of two-sided ideals of the monoid ring under the composition:
[TABLE]
which we call the Vassiliev-Goussarov filtration on .
Remark 3.3*.*
Let be an abelian group and a positive integer. The following two conditions are equivalent. A map is an -valued finite type invariant of degree on and the map is a homomorphism of abelian groups from to which vanishes on
Definition 3.4**.**
For , two -component virtual string links and are said to be -equivalent if and are not distinguished by any finite type invariants of degree with values in any abelian group, equivalently, .
4. Definition of -equivalence
By using the pure virtual braid group, we introduce a new equivalence relation on Gauss diagrams, called -equivalence. Here it is known that the pure braid group is a subgroup of the pure virtual braid group (see [3, 13]). We then give properties of the set of -equivalence classes.
Definition 4.1** ([1, 12]).**
A pure virtual braid group on strands is a group represented by the following group representation.
[TABLE]
Here, an element of the pure braid group is represented by a diagram as in Figure 4, where is correspondence with a horizontal arrow equipped with sign from the -th strand to the -th strand, and we determine that the orientation of the strand is from top to bottom. For example, the diagram in Figure 4 represents .
Let and . We denote the composition and tensor product of and as h\cdot h^{\prime}={\includegraphics[width=17.34189pt]{composition.eps}\put(-10.0,10.0){h}\put(-10.0,1.0){h^{\prime}}}\in PV_{k} if and h\otimes h^{\prime}={\includegraphics[width=34.69038pt]{product.eps}\put(-25.0,1.0){h}\put(-10.0,1.0){h^{\prime}}}\in PV_{k+k^{\prime}} for any and , respectively. By we mean the -th lower central subgroup of the group , that is, and , which is the commutator of and , that is, where .
Definition 4.2**.**
Two Gauss diagrams and on several strands are related by an -move if there are a positive integer , an element in the -th lower central subgroup of the pure virtual braid group on strands and not in , and an embedding of strands of such that , where is obtained from by attaching by an embedding of strands of in the intervals of except for the endpoints of all arrows of as in Figure 5. By we mean that is obtained from by a -move. In particular, we write if .
We call a pair for an embedded pure virtual braid for . We define that a pair is of degree if and , where is a positive integer, and denote the degree of the pair by deg. Two embedded pure virtual braids for are disjoint if their embeddings are disjoint in the intervals of . For disjoint pairs and for , means or equivalently . Moreover, we can represent as . Here it is easy to see that the degree of is .
Remark 4.3*.*
The first relation of the pure virtual braid group corresponds with the second relation of third Reidemeister moves (illustrated in Figure 2). Therefore does not depend on a word representing a pure virtual braid . On the other hand, we consider in as a word representing . For example, we consider and are different Gauss words and equals to up to a sequence of second Reidemeister moves.
In order to give properties of the -move, we define the parallel embedding. Let , and and are disjoint embedded pure virtual braids for a Gauss diagram . The pair is upper (or under, respectively) parallel to (or embedding is upper (or under) parallel to ) if for each , the orientations of embeddings of -th strands of and by and are the same, an -th embedding by is upper (or under, respectively) than the -th one by with respect to the orientation, and there is no endpoints of arrows of between embedded -th strands for each , as in Figure 6. That is, equals to (or , respectively). We note that the following statements are the same. An embedded pure virtual braid is an under parallel to and is an upper parallel to .
Proposition 4.4**.**
The -moves and Reidemeister moves generate an equivalence relation on Gauss diagrams.
Proof.
The case of the reflexive and transitive relation are obvious. We show the symmetric relation. Let where and . Then , where is upper parallel to . Since the Gauss diagram equals to up to a sequence of RII’s, we have that . ∎
We call this equivalence relation an -equivalence. By we mean that and are -equivalent.
Proposition 4.5**.**
If , then an -move is achieved by an -move. Therefore -equivalence implies -equivalence.
Proof.
By the property of the lower central series, for any . For any embedded pure virtual braid of degree more than or equal to for , there exists a set of disjoint embedded pure virtual braids for such that and each element in has degree , because any element of is represented by the product of elements in each of which is not in . ∎
The following proposition is key property in this paper.
Proposition 4.6**.**
Two Gauss diagrams and are -equivalent if and only if there exists an embedded pure virtual braid of degree such that equals to up to a sequence of Reidemeister moves.
Proof.
A necessary condition is obvious. To prove a sufficient condition, we will show the following two statements (1) and (2).
- (1)
If is obtained from by RI (RII or RIII, respectively) and then an -move ( or , respectively), then is obtained from by an -move ( or , respectively) (), then RI (RII or RIII, respectively), and then the sequence of RII’s.
- (2)
If is obtained from by an -move and then another -move , then is obtained from by a sequence of RII’s and then an -move , and then a sequence of RII’s.
By (1), (2) and Proposition 4.5, if and are -equivalent, there is an -move and a sequence of Reidemeister moves such that is obtained from by the -move and then the sequence of Reidemeister moves, which proves this proposition.
We show (1). We consider the case of RI. In Figure 7, these Gauss diagrams are identical except in a local place of near to RI in this figure. Here is the upper left and the upper right in Figure 7. By gray line we mean an embedded pure virtual braid, where we omit orientations and signs of their arrows. Given an embedded pure virtual braid , we can move the ends of its arrows out the arrow derived from RI by a sequence of RII’s (the right part in Figure 7). We then can consider arrows derived from and new arrows as a new embedded pure virtual braid for (the lower right in Figure 7), which has degree . We denote it by . Then, is obtained from by the RI and then the RII’s. Moreover, similar considerations apply to the other RI.
Similar way to RI, in the case of RII and RIII, we give embedded pure virtual braids and as in Figure 8 and 9, respectively, which are one of RII and RIII. Here, in Figure 9 for simplicity we draw only one strand embedded in each interval between endpoints of arrows derived from RIII.
We show (2). We can transform to by a sequence of RII’s, where is upper parallel and is disjoint from for . Then, we can transform to by a sequence of RII’s, where is upper parallel to . Here the degree of is . We set by and the statement (2) holds. ∎
Remark 4.7*.*
It is obvious that Proposition 4.6 is equivalent to the following statement. There exists the union of disjoint embedded pure virtual braids of degree such that equals to up to a sequence of the Reidemeister moves.
Remark 4.8*.*
In [14], Meilhan and Yasuhara introduced a family of local moves as an extension of -equivalence to welded knots, which is a quotient of virtual knots. They also discuss the virtual knots in this paper. They proved that two virtual knots related by their moves are can not be distinguished by finite type invariants for each degree. It has still been open that it would hold the converse implication.
Lemma 4.9**.**
Let . Let be a Gauss diagram and an embedded pure virtual braid of degree for . Then for any Gauss diagram which is equivalent to there is an embedded pure virtual braid of degree for such that is equivalent to .
Proof.
Since and , we have that . It is from Proposition 4.6 that there is an embedded pure virtual braid of degree for such that . ∎
Remark 4.10*.*
We can show Lemma 4.9 directly. If is obtained from by Reidemeister move RI, RII or RIII, then given an embedded pure virtual braid for we can construct the pair such that is equivalent to by similar method of Figure 7, 8 and 9 in the proof of Proposition 4.6.
The next proposition is well-known fact of group theory.
Proposition 4.11**.**
Let be a group. Let and be elements in the -th and -th lower central subgroup of , respectively. Then the commutator of and is in -th lower central subgroup of .
Lemma 4.12**.**
Let be a Gauss diagram. Let , . Let and be disjoint embedded pure virtual braids for of degree and , respectively. Let be the -th strand of and the -th one of . Suppose that and are on the same interval, and there is no endpoint of arrows and no embedding of another strands of embedded pure virtual braids on the intervals between embeddings and . Then, these embeddings may replace each other up to -equivalence as in Figure 10. Let and be embedded pure virtual braids of degree and obtained from and by replacing and as in Figure 10. Then, there exists an embedded pure virtual braid for of degree such that is disjoint from both and and is equivalent to .
We call this transformation between two embedded pure virtual braids a sliding.
Proof.
For given embedded pure virtual braids and with degree and , respectively, we will construct an embedded pure virtual braid of degree . We consider the case both of the orientations of and are compatible with the orientation of an interval of and is under than (in the case of Figure 10). In the other cases, we may construct it similarly.
First of all, we construct a pure virtual braid . Let , , and . Then, we define as an element of obtained from by adding strands before the 1st strand of and strands after the -th strand of and as an element of obtained from by adding strands between the -th and -th strand of , and strands between the -th and -th strand of . Then the -th strand of and -th strand of are the same order th in and . We define , which is in by Proposition 4.11.
Secondly, we construct an embedding . We define embeddings of and of as follows. For each strand of (or , respectively) derived from (or , respectively), (or , respectively) is the same as (or , respectively), and for each other strand of (or , respectively), (or , respectively) is under (or upper, respectively) parallel embedding to (or , respectively). Then, is under parallel to and . Moreover, we define an embedding of as the upper parallel embedding to . Then, . Similarly, we can construct . ∎
Definition 4.13**.**
A Gauss diagram is -trivial if is -equivalent to the trivial Gauss diagram.
Proposition 4.14**.**
Let . Let be an -trivial Gauss diagram and be an -trivial one. Then the Gauss diagram is -equivalent to .
Proof.
By assumption and Proposition 4.6, there are two embedded pure virtual braids and of degree and such that and , respectively. Then by Lemma 4.12 we have . ∎
Proposition 4.15**.**
For any -trivial Gauss diagram , there is an -trivial Gauss diagram such that both and are -trivial.
Proof.
By assumption and Proposition 4.6, there is an embedded pure virtual braid of degree such that . We define . Then by Lemma 4.12 we have and similarly we have . ∎
Notation 4.16**.**
The set of equivalence classes of Gauss diagrams on strands has a monoid structure under the composition for any positive integer . For , let denote the submonoid of consisting of the equivalence classes of Gauss diagrams on strands which are -trivial. There is a descending filtration of monoids
[TABLE]
For , denotes the quotient of by -equivalence. It is easy to see that the monoid structure on induces that of . There is a filtration on of finite length
[TABLE]
Lemma 4.17**.**
For , the monoid is an abelian group.
Proof.
By Proposition 4.15, for any there exists such that both and are trivial up to -equivalence, and therefore the monoid is a group. By Proposition 4.14, for any , is up to -equivalence, and the group is abelian. It follows from Proposition 4.5 that it holds for . ∎
Proposition 4.18**.**
The monoid is a nilpotent group for any positive integers , and .
Proof.
We fix and prove it by induction on . By Proposition 4.5, it is obvious for . Assume that is a group for some with . We then have a short exact sequence of monoids:
[TABLE]
Here, and are groups by the assumption of induction and Lemma 4.17. Therefore is also a group. Moreover, it is from Proposition 4.14 that for any Therefore, is nilpotent. ∎
5. -equivalence and -equivalence
In this section, we introduce the -equivalence for Gauss diagrams on several strands defined by Goussarov-Polyak-Viro [8] and prove that the -equivalence coincides with -equivalence on virtual string links.
Definition 5.1**.**
[8] Let . A Gauss diagram on several strands is said to be -trivial (with respect to ) if the Gauss diagram satisfies the following condition. There exist non-empty disjoint subsets of the set of arrows of such that for any non-empty subfamily of the set the Gauss diagram obtained from by removing all arrows which belongs to is trivial up to a sequence of second Reidemeister moves.
A Gauss diagram is related to a Gauss diagram by -variation if is obtained from by attaching an -trivial Gauss diagram on several strands to segments of without endpoints of any arrow. Two Gauss diagrams are said to be -equivalent if they are related by a sequence of -variations and Reidemeister moves.
In order to prove the next theorem (Theorem 5.4), we prepare the following definition and two lemmas.
We define a weight for an embedded pure virtual braid , which is a finite subset of , and denote it by . Let be a finite set of embedded pure virtual braids with weights. Let be a finite subset of . Then denote the subset of each element of which has a subset of as a weight, and denote the subset of each element of which has as a weight.
We define the weight of new embedded pure virtual braids obtained by sliding in Lemma 4.12 as follows. When we slide two pairs and with weights, we define the weight of the deformed pairs , and the new embedded pure virtual braid as , and the union of these two weight, respectively. Then it is easy to see that .
Lemma 5.2**.**
Let and be sets of finite embedded pure virtual braids with weights for a Gauss diagram on several strands such that they are related by sliding in Lemma 4.12 (this is, ). Then is equivalent to for any subset of .
Proof.
Let , , , and be embedded pure virtual braids for a Gauss diagram on several strands in Lemma 4.12. Suppose that and have weights. Then, by the definition of their weights by sliding, for any subset of . ∎
Lemma 5.3**.**
(1) Let and be Gauss diagrams on several strands related by RI (RII or RIII, respectively). Let be a set of finite embedded pure virtual braids with weights for . We then have a set of finite embedded pure virtual braids with weights for such that is equivalent to up to a sequence of RI (RII or RIII, respectively) and RII’s for any subset of and the degrees of and are the same for any .
In particular, (2) if there exist disjoint sets of arrows such that as a set of arrows and has -triviality with respect to , then there exist disjoint sets of arrows such that as a set of arrows and has -triviality with respect to .
Proof.
(1) By using the method of (1) in the proof of Proposition 4.6, we can construct from . Here the relation between and in the proof of Lemma 4.6 corresponds to that in Proposition 5.3. In the proof of Proposition 4.6, the degree of and are the same for any and we define the weight of by the weight of .
(2) In particular, we define and . We then have that if has -triviality with respect to , then has also -triviality with respect to where and . ∎
Theorem 5.4**.**
For any , the -equivalence and -equivalence on virtual string links are equal.
Proof.
A pure virtual braid has -triviality with respect to such that is the set of all and , where is a generator of a group. Therefore any element of the -th lower central series of the pure virtual braid group has -triviality. Therefore we have that if two Gauss diagrams are -equivalent, then they are -equivalent. Therefore it suffices to prove that if a Gauss diagram is related to by an -variation then they are -equivalent.
Let be an -trivial Gauss diagram on several strands with respect to such that is obtained from by attaching . Let be the Gauss diagram obtained from by removing all arrows in . By the property of -triviality, equsls to the trivial Gauss diagram up to a sequence of RII’s, where has the same number of intervals as . We can consider each arrow in as an embedded pure virtual braid of degree 1 for and denote their set by , that is , and . It follows from Lemma 5.3(2) that we have a set of embedded pure virtual braids for with degree 1 such that has -triviality with respect to and equals to up to a sequence of RII’s. Therefore is equivalent to a Gauss diagram obtained from by attaching to the same segments of as . Here, can be regarded as by considering as the set of embedded pure virtual braids for . Then shows . Therefore we show the following claim, which proves the theorem.
Claim 5.5*.*
Let be a Gauss diagram and the set of embedded pure virtual braids of degree 1 for with -triviality with respect to . Then is -equivalent to .
Let us first prove the case that is the trivial Gauss diagram . We consider as a set of embedded pure virtual braids with weights each element of which assigns as a weight if it is in . We show the following statement, which proves the claim.
(A) For any , there exists a set of finite embedded pure virtual braids for with weights such that deg for each element of , where means the number of a set, and for every subset of .
We prove it by induction on for . For , we can set . Under the assumption of the claim for , assuming the statement (A) to hold for , we will prove it for . Let be a set of finite embedded pure virtual braids for satisfying (A) for , that is, for any subset of and for each . We take a subset of such that . We then shift all embedded pure virtual braid in to the ahead of the intervals with fixing embedded pure virtual braids in by their sliding (Lemma 4.12) until all endpoints of all element in are completely to their ahead in , where we do not slide between elements in . We denote the set of the obtained embedded pure virtual braids for by . Then, it follows from Lemma 5.2 that for every . Moreover, for each new embedded pure virtual braid and if is derived from sliding between and then . On the other hand, by Lemma 4.12, . Therefore it follows from the assumption of (A), for any new embedded pure virtual braid
[TABLE]
Next we show that for every . If , then it is clear that . If not, then the new embedded pure virtual braids are not contained in and hence . By the property of -triviality in the assumption of the claim, , which corresponds to -triviality with respect to a subfamily (in Definition 5.1) of consisting of elements. By the assumption of (A), . Therefore and so .
Now we regard as a set of embedded pure virtual braids for . It follows from Lemma 5.3(1) that there exists a set of finite embedded pure virtual braids for such that for any . Note that . Thus all embedded pure virtual braids with weights are eliminated. Repeating this procedure for all other such that , we have a set of finite embedded pure virtual braids for such that for any and for any in , which is the required set satisfying (A) for . This proves the claim for the case that .
Next we consider the case that . For a given for in the claim, by Lemma 5.3(2) there exists a set of finite embedded pure virtual braids for with -triviality such that . Then, by the first case of the claim, . Therefore and it proves the claim for the case that .
Finally we prove the claim for the case that is not equivalent to . Since the set of -equivalence classes has a group structure (Proposition 4.18), there is an inverse of up to -equivalence for any . Now we show , which implies . It follows from and Proposition 4.6 that there exists an embedded pure virtual braid of degree such that , where and are disjoint. Moreover it follows from the case of the claim that . Therefore and the proof of claim is proved. ∎
Remark 5.6*.*
Even though we change“second Reidemeister moves” into“Reidemeister moves” in the definition of the -trivial in Definition 5.1, we can show Theorem 5.4 similarly. Therefore it is concluded that these two -equivalences coincide.
6. -equivalence and -equivalence
Goussarov-Polyak-Viro [8] mentioned that the value of a finite type invariant of degree less than or equal to depends only on the -equivalence classes. Therefore it follows from Theorem 5.4 that -equivalence implies -equivalence, indirectly. In this section, we give this relation directly, by redefining the two-sided ideal of the monoid ring by using embedded pure virtual braids.
Definition 6.1**.**
Let . Let be a set of disjoint embedded pure virtual braids for on strands. Denote an element of by
[TABLE]
where runs over all subsets of . We define . The degree of is defined by the sum of the degree of its all elements, denoted by deg().
It is easy to see that
[TABLE]
Lemma 6.2**.**
Let be a Gauss diagram on strands and a set of disjoint embedded pure virtual braids for of degree . Then for any Gauss diagram which is equivalent to there is a set of disjoint embedded pure virtual braids for of degree such that is equal to in .
Proof.
If is obtained from by RI, RII or RIII, we can construct a set of disjoint embedded pure virtual braids for of degree such that by similar method of Figure 7, 8 and 9 in the proof of Proposition 4.6. From the construction of , for each , there is the corresponding such that . Therefore in . ∎
Definition 6.3**.**
Let , be integers with . Let denote the two-sided ideal of generated by the elements under the composition, where is any Gauss diagram on strands and is any set of disjoint embedded pure virtual braids for of degree .
Remark 6.4*.*
The natural homomorphism induces the ring isomorphism .
Lemma 6.5**.**
*Let be a Gauss diagram on strands. We then have the following properties.
(1) For any positive integer ,
(2) For any positive integers , , with ,
Proof.
(1) We show that
[TABLE]
where the left-hand side of the equation means the image of dashed arrows by and the right-hand side of the equation means a Gauss diagram with a set of disjoint embedded pure virtual braids of degree , that is, a set of embedded pure virtual braids of degree 1. If , \varphi([\includegraphics[height=11.38092pt,scale={.8}]{1semicrossing.eps}])=[\includegraphics[height=11.38092pt,scale={.8}]{1crossing.eps}]-[\includegraphics[height=1.9919pt,scale={.2}]{0crossing.eps}]=[[\includegraphics[height=11.38092pt,scale={.8}]{1clasper.eps}]]. Assume the formula holds less than or equal to , it is easy to check that the formula holds .
(2) It suffices to show that for , with . Let . By assumption, there is an embedded pure virtual braid of degree in , say to , where . Then can be represented by a pure virtual braid where deg and deg for any . We define for . Then deg, deg and , where is the restriction of to . Therefore we have
[TABLE]
Hence
[TABLE]
∎
By Lemma 6.5, we can redefine as the ideal of generated by elements where is any Gauss diagram on strands and is any set of disjoint embedded pure virtual braids for of degree .
Proposition 6.6**.**
For any , if two virtual string links and are -equivalent, then and are -equivalent.
Proof.
By Remark 6.4 and Lemma 6.5, if two -component virtual string links and are -equivalent, then . By the definition, it is equivalent to that and are -equivalent. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V.G. Bardakov, The virtual and universal braids , Fund. Math,. 184 (2004), 1–18.
- 2[2] J.S. Birman, X.S. Lin, Knot polynomials and Vassiliev’s invariants , Invent. Math. 111 (1993) 225–270.
- 3[3] R. Fenn, R. Rimanyi, and C. Rourke, Topology 36 (1), 123–135 (1997).
- 4[4] M.N. Goussarov, On n 𝑛 n -equivalence of knots and invariants of finite degree , from: “Topology of manifolds and varieties”, Adv. Soviet Math. 18, Amer. Math. Soc. Providence, RI (1994) 173–192.
- 5[5] M.N. Goussarov, A new form of the Conway-Jones polynomial of oriented links , from: “Topology of manifolds and varieties”, Adv. Soviet Math. 18, Amer. Math. Soc. Providence, RI (1994) 167–172.
- 6[6] M.N. Goussarov (Gusarov), Finite type invariants and n-equivalence of 3-manifolds , C. R. Acad. Sci. Paris S e ´ ´ e \acute{\text{e}} r. I Math. 329 (1999) no. 6, 517–522.
- 7[7] M.N. Goussarov , Variations of knotted graphs. The geometric technique of n-equivalence . (Russian), Algebra i Analiz 12 (2000), no. 4, 79–125; translation in St. Petersburg Math. J. 12 (2001), no. 4, 569–604
- 8[8] M. Goussarov, M. Polyak, and O. Viro, Finite-type invariants of classical and virtual knots , Topology 39 (2000), 1045–1068.
