Virtualized Delta moves for virtual knots and links
Abstract.
We introduce a local deformation called the virtualized -move for virtual knots and links. We prove that the virtualized -move is an unknotting operation for virtual knots. Furthermore we give a necessary and sufficient condition for two virtual links to be related by a finite sequence of virtualized -moves.
Key words and phrases:
virtual knot, virtual link, virtualized -move, odd writhe2020 Mathematics Subject Classification:
57K12, 57K101. Introduction
Although the crossing change is elemental among local deformations in classical knot theory, the virtualization replacing a real crossing with a virtual crossing is considered as a more elemental deformation in virtual knot theory; in fact, a crossing change is realized by two virtualizations.
In this paper, we will introduce an elemental version of a -move. Here, the -move is one of the important local deformations in classical knot theory. In fact, it is an unknotting operation for classical knots, and characterizes classical links with the same pairwise linking numbers.
Definition 1.1.
A virtualized -move is a local deformation on a virtual link diagram as shown in Figure 1.1. We denote it by in figures.
By definition, we see that a -move is realized by a combination of two virtualized -moves and a generalized Reidemeister move VI. In this sense, we can say that the virtualized -move is more elemental than the -move.
Definition 1.2.
Two virtual links and are -equivalent to each other if their diagrams are related by a finite sequence of virtualized -moves and generalized Reidemeister moves.
For virtual knots, we have the following.
Theorem 1.3.
Any virtual knot is -equivalent to the trivial knot; that is, the virtualized -move is an unknotting operation for virtual knots.
Let be the minimal number of virtualized -moves which needs to deform into the trivial knot.
Theorem 1.4.
For any integer , there are infinitely many virtual knots with .
For an -component virtual link with , we will define invariants (). Then we have the following.
Theorem 1.5.
For , two -component virtual links and are -equivalent to each other if and only if holds for any .
This paper is organized as follows. In Section 2, we study several properties of virtualized -moves for virtual knots, and prove Theorems 1.3 and 1.4. In Section 3, we study the behavior of virtualized -moves for virtual links, and prove Theorem 1.5. In Section 4, we divide virtualized -moves into four types, and prove that any one of them generates the other three.
2. Virtualized -moves for virtual knots
Lemma 2.1.
A crossing change at a real crossing is realized by a combination of a virtualized -move and generalized Reidemeister moves.
Proof.
This follows from Figure 2.1, where the symbol means a combination of generalized Reidemeister moves. ∎
Lemma 2.2.
A local deformation FD as shown in Figure 2.2 is realized by a combination of two virtualized -moves and generalized Reidemeister moves.
Proof.
This follows from Figure 2.3. ∎
Remark 2.3.
Lemma 2.4.
A forbidden move is realized by a combination of virtualized -moves and generalized Reidemeister moves.
Proof.
The sequence of Figure 2.4 shows that an upper forbidden move is realized by a combination of two crossing changes and a forbidden detour move, where the symbol means a combination of crossing changes. By Lemmas 2.1 and 2.2, we have the result for the case of an upper forbidden move. The case of a lower forbidden move is proved similarly. ∎
Proof of Theorem 1.3.
Remark 2.5.
By Theorem 1.3, any two virtual knots and are -equivalent to each other. We denote by the minimal number of virtualized -moves needed to deform a diagram of into that of . It is called the -distance between and . In particular, we denote by , and call it the -unknotting number of , where is the trivial knot.
We briefly recall the definitions of the -writhe and the odd writhe of a virtual knot from [9]. Let be a Gauss diagram of and a chord of . If admits a sign , we assign and to the terminal and initial endpoints of , respectively. The endpoints of divide the underlying oriented circle of into two arcs. Let be the one of the two oriented arcs which runs from the initial endpoint of to the terminal. The index of is the sum of the signs of all the endpoints of chords on , and denoted by . For a nonzero integer , the -writhe of is the sum of the signs of all the chords with , and the odd writhe of is defined to be . We remark that is always even [3].
We give a lower bound for by using the odd writhes of and as follows.
Proposition 2.6.
Let and be virtual knots. Then we have the following.
-
(i)
.
-
(ii)
.
Proof.
Let and be Gauss diagrams of and , respectively. It is sufficient to prove that if and are related by a virtualized -move, then the odd writhes satisfy .
We may assume that is obtained from by removing three chords corresponding to three real crossings involved in a virtualized -move. See Figure 2.5. It is known that among these three chords, the number of chords with index odd is equal to zero or two (cf. [7, 10]). Furthermore, the parity of the index of any other chord is preserved by the virtualized -move; in fact, each pair of the three chords has two adjacent endpoints on the underlying circle. See the figure again. Therefore we have the conclusion. ∎
It is known that the crossing change at a real crossing is not an unknotting operation for virtual knots (cf. [2, 5, 10]). If a virtual knot can be deformed into the trivial knot by a finite number of crossing changes, then we denote by the minimal number of such crossing changes. If cannot be unknotted by crossing changes, then we set . Then we have the following by Lemma 2.1 immediately.
Lemma 2.7.
Any virtual knot satisfies .
In the following, we will construct two families of infinitely many virtual knots with for any given integer , which have different properties for . The following theorems induce Theorem 1.4 immediately.
Theorem 2.8.
For any integer , there are infinitely many virtual knots with .
Proof.
For an integer , we consider a knot diagram and its Gauss diagram with real crossings (or chords) as shown in Figure 2.6. Let be the virtual knot presented by this diagram.
Since can be unknotted by crossing changes at real crossings among half twists in the knot diagram, we have . By Lemma 2.7, we have
On the other hand, the horizontal chords of the Gauss diagram have the sign and indices , and the vertical chords have index . Since holds, we have by Proposition 2.6(ii), and hence .
Now it is enough to prove that the virtual knots ’s are mutually distinct. By a straightforward calculation, the Jones polynomial of is given by
Since the maximal degree of is equal to , we have for any . ∎
Theorem 2.9.
For any integer , there are infinitely many virtual knots with and .
Proof.
For an integer , we consider a long virtual knot diagram and its Gauss diagram with real crossings (or chords) and as shown in Figure 2.7. Let be the long virtual knot presented by this diagram, and the virtual knot obtained from the closure of the product of copies of .
Since can be unknotted by a single virtualized -move involving the three crossings , , and in the long knot diagram, we have .
On the other hand, since we have
it follows from [9, Lemma 4.3] that
This induces . Therefore we have by Proposition 2.6(ii), and hence . Furthermore, since holds, we have by [9, Theorem 1.5].
Since holds, we have for any . ∎
3. Virtualized -moves for virtual links
Lemma 3.1.
A local deformation as shown in Figure 3.1 is realized by a combination of a virtualized -move and generalized Reidemeister moves.
Proof.
This follows from Figure 3.2. ∎
Lemma 3.2.
Let be a chord of a Gauss diagram .
-
(i)
If a Gauss diagram is obtained from by reversing the orientation of , then and are related by a finite sequence of virtualized -moves and Reidemeister moves.
-
(ii)
If a Gauss diagram is obtained from by changing the sign of , then and are related by a finite sequence of virtualized -moves and Reidemeister moves.
Proof.
(i) This follows from Lemma 3.1.
(ii) Let be a Gauss diagram obtained from by reversing the orientation and changing the sign of . By Lemma 2.1, and are related by a finite sequence of a virtualized -move and Reidemeister moves. Furthermore is obtained from by reversing the orientation of . Therefore we have the conclusion by (i). ∎
Lemma 3.3.
Let and be chords of a Gauss diagram such that an endpoint of is adjacent to that of . If a Gauss diagram is obtained from by switching the positions of these consecutive endpoints, then and are related by a finite sequence of virtualized -moves and Reidemeister moves.
For integers with , let be the Gauss diagram of an -component virtual link such that
-
(i)
has no self-chords,
-
(ii)
there are no nonself-chords between and ,
-
(iii)
if , then there are no nonself-chords between and ,
-
(iv)
if , then there is a single nonself-chord between and which is oriented from to with a positive sign, and
-
(v)
if , then we meet the endpoint of the chord between and before that between and along .
Figure 3.3 shows the Gauss diagram with . Let be the -component virtual link presented by .
Proposition 3.4.
Let be an integer. Any -component virtual link is -equivalent to for some ’s.
Proof.
Let be a Gauss diagram of . By using Lemma 3.3 and Reidemeister moves I, we can remove all the self-chords from . Therefore we may assume that has no self-chords (up to virtualized -moves and Reidemeister moves).
If there is a nonself-chord between and , then we can replace it with a pair of nonself-chords one of which connects between and , and the other between and . In fact, this is achieved by observing a sequence of link diagrams as shown in Figure 3.4. Therefore we may also assume that there are no nonself-chords between and .
For , let be an -component virtual link, and a Gauss diagram of . For each , the th parity of is defined to be the parity of the number of endpoints of nonself-chords on , and denoted by . Since a self-chord has two endpoints on the same component, is coincident with the parity of the number of endpoints of self-/nonself-chords on .
Lemma 3.5.
For any , the th parity is an invariant of the -equivalence class of .
Proof.
Since the chord(s) involved in a Reidemeister move or a virtualized -move have an even number of endpoints on each , this move preserves . ∎
Remark 3.6.
For , any -component virtual link satisfies
In fact, the number of endpoints of all self-/nonself-chords is even.
The following is an immediate consequence of the proof of Theorem 1.5.
Corollary 3.7.
For , a complete representative system of the -equivalence classes of -component virtual links is given by
In particular, the number of -equivalence classes is equal to .
4. Relations among four types of virtualized -moves
We can divide virtualized -moves into four types , , , and as shown in Figure 4.1. Here, the - and -moves replace three real crossings with virtual ones, and the - and -moves replace three virtual crossings with real ones.
Lemma 4.1.
For any , a crossing change at a real crossing is realized by a combination of an -move and generalized Reidemeister moves.
Proof.
For , a crossing change at a real crossing is obtained from the deformation sequence in Figure 2.1 by replacing with . For , we may follow this sequence in reverse. For and , we may perform the crossing change at every real crossing in the above sequences for and , respectively. ∎
Lemma 4.2.
A local deformation SR as shown in Figure 4.2 is realized by a combination of -moves and generalized Reidemeister moves.
Proof.
Theorem 4.4.
For any , a -move is realized by a combination of -moves and generalized Reidemeister moves.
Proof.
We use the notation “” if a -move is realized by a combination of -moves and generalized Reidemeister moves. Then we have the following.
- •
- •
-
•
: We may follow any sequence for with opposite crossing information in reverse.
-
•
: We may follow any sequence for with opposite crossing information in reverse.
Therefore we have the cycle
which induces the other eight cases immediately. ∎
References
- [1] B. Audoux, P. Bellingeri, J.-B. Meilhan, and E. Wagner, Extensions of some classical local moves on knot diagrams, Michigan Math. J. 67 (2018), no. 3, 647–672.
- [2] J. S. Carter, S. Kamada, and M. Saito, Stable equivalence of knots on surfaces and virtual knot cobordisms, J. Knot Theory Ramifications 11 (2002), no. 3, 311–322.
- [3] Z. Cheng, A polynomial invariant of virtual knots, Proc. Amer. Math. Soc. 142 (2014), no. 2, 713–725.
- [4] A. S. Crans, B. Mellor, and S. Ganzell, The forbidden number of a knot, Kyungpook Math. J. 55 (2015), no. 2, 485–506.
- [5] D. Hrencecin and L. H. Kauffman, On filamentations and virtual knots, Topology Appl. 134 (2003), 23–52.
- [6] T. Kanenobu, Forbidden moves unknot a virtual knot, J. Knot Theory Ramifications 10 (2001), no. 1, 89–96.
- [7] V. O. Manturov, Parity and projection from virtual knots to classical knots, J. Knot Theory Ramifications 22 (2013), no. 9, 1350044, 20 pp.
- [8] S. Nelson, Unknotting virtual knots with Gauss diagram forbidden moves, J. Knot Theory Ramifications 10 (2001), no. 6, 931–935.
- [9] S. Satoh and K. Taniguchi, The writhes of a virtual knot, Fund. Math. 225 (2014), no. 1, 327–342.
- [10] V.Turaev, Virtual strings. Ann. Inst. Fourier (Grenoble) 54 (2004), no. 7, 2455–2525.
- [11] S. Yoshiike and K. Ichihara, Forbidden detour number on virtual knot, Kyungpook Math. J. 61 (2021), no. 1, 205–212.