This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

(1, 2) and weak (1, 3) homotopies on knot projections

Noboru Ito  Yusuke Takimura
Abstract.

In this paper, we obtain the necessary and sufficient condition that two knot projections are related by a finite sequence of the first and second flat Reidemeister moves (Theorem 1). We also consider an equivalence relation that is called weak (1, 3) homotopy. This equivalence relation occurs by the first flat Reidemeister move and one of the third flat Reidemeister moves. We introduce a map sending weak (1, 3) homotopy classes to knot isotopy classes (Sec. 3). Using the map, we determine which knot projections are trivialized under weak (1, 3) homotopy (Corollary 3).

Addendum: added 2014

After this article was published, the following information about doodles was pointed out by Roger Fenn. A doodle was introduced by Fenn and Taylor [2], which is a finite collection of closed curves without triple intersections on a closed oriented surface considered up to the second flat Reidemeister moves with the condition (\ast) that each component has no self-intersections. Khovanov [4] introduced doodle groups, and for his process, he considered doodles under a more generalized setting (i.e., removing the condition (\ast) and permitting the first flat Reidemeister moves). He showed [4, Theorem 2.2], a result similar to our [3, Theorem 2.2 (c)]. He also pointed out that [1, Corollary 2.8.9] gives a result similar to [4, Theorem 2.2]. The authors first noticed the above results by Fenn and Khovanov via personal communication with Fenn, and therefore, the authors would like to thank Roger Fenn for these references.

References

  • [1] R. Fenn, Techniques of geometric topology, London Mathematical Society Lecture Note Series, 57. Cambridge University Press, Cambridge, 1983.
  • [2] R. Fenn and P. Taylor, Introducing doodles, Topology of low-dimensional manifolds (Proc. Second Sussex Conf., Chelwood Gate, 1997), pp. 37–43, Lecture Notes in Math., 722, Springer, Berlin, 1979.
  • [3] N. Ito and Y. Takimura, (1, 2) and weak (1, 3) homotopies on knot projections, J. Knot Theory Ramifications 22 (2013), 1350085, 14 pp.
  • [4] M. Khovanov, Doodle groups, Trans. Amer. Math. Soc. 349 (1997), 2297–2315.

1. Introduction

Throughout this paper, we consider objects in the smooth category. A knot is defined as a circle smoothly embedding into 3{\mathbb{R}}^{3} and its knot projection is a regular projection of the knot to a sphere. Here, the term regular projection means a projection to a sphere in which the image has only transversal double points of self-intersection. If each double point of a knot projection is specified by over-crossing and under-crossing branches, we call the knot projection a knot diagram. Therefore, for a given knot projection that has nn double points, it is possible to consider 2n2^{n} knot diagrams. Indeed, knot projections have been studied by this approach [T1, T2].

Knot isotopy classes are often interpreted as equivalence classes of knot diagrams under first, second, and third Reidemeister moves defined by Fig. 1. The diagrams in Fig. 1 show that the local replacements on the neighborhoods and the exterior of the neighborhoods are the same for both diagrams of each move.

Ω1\Omega_{1}Ω2\Omega_{2}Ω3\Omega_{3}
Refer to caption
Figure 1. Reidemeister moves Ω1\Omega_{1}, Ω2\Omega_{2}, and Ω3\Omega_{3}.

As shown in Fig. 2, we can define local moves of knot projections, called homotopy moves in this paper, by seeing projection images of Reidemeister moves of knot diagrams. We call H1H_{1}, H2H_{2}, and H3H_{3} of Fig. 2 the first, second, and third homotopy moves or simply H1H_{1}, H2H_{2}, and H3H_{3} moves.

H1H_{1}H2H_{2}H3H_{3}
Refer to caption
Figure 2. Homotopy moves H1H_{1}, H2H_{2}, and H3H_{3}.

Arnold introduced invariants of knot projections under the second or third homotopy moves, called perestroikas and found low-ordered invariants [A1, A2] by using concepts similar to Vassiliev’s ordered invariants of knots [Va].

This paper was motivated by attempts to solve the problem that determines which knot projections can be trivialized by the first and third moves. Starting with Arnold’s work, we can choose any two kinds of homotopy moves from the H1H_{1}, H2H_{2}, and H3H_{3} moves. First, we take H1H_{1} and H2H_{2} moves and consider the equivalence relation between knot projections by H1H_{1} and H2H_{2} moves. We obtain a necessary and sufficient condition that two knot projections are equivalent under H1H_{1} and H2H_{2} moves (Theorem 1). Second, we take H2H_{2} and H3H_{3}, which is nothing but regular homotopy, and knot projections under regular homotopy are classified by rotation numbers [W]. The last possibility is the case of H1H_{1} and H3H_{3} moves, which includes open problems: which two knot projections are equivalent under relations generated by H1H_{1} and H3H_{3} moves is unknown, and even which knot projection can be trivialized by H1H_{1} and H3H_{3} moves is unknown. In this paper, as a first step, we give a necessary and sufficient condition that a knot projection can be trivialized under relations by H1H_{1} and restricted H3H_{3} moves.

The restricted H3H_{3} moves are weak third homotopy moves, or simply weak H3H_{3} moves, defined by Fig. 3 for knot projections.

weak H3H_{3} movestrong H3H_{3} move
Refer to caption
Figure 3. Weak (left) and strong (right) third homotopy moves. Viro [Vi] introduced these moves as weak (left) and strong (right) triple point perestroikas.

The weak third homotopy move is a positive weak perestroika, and its inverse move is based on the work of Viro [Vi] who defined high-ordered invariants by generalizing Arnold invariants. Viro introduced weak and strong triple point perestroikas (Fig. 3). Arnold’s (and subsequently Viro’s) triple point perestroikas have positive directions that depend on the connecting branches of triple points (for details, see [A2, p. 6]).

For all knot projections, we consider equivalence classes under the first homotopy move and the weak third homotopy move, called weak (1, 3) homotopy. In particular, we determine which knot projections are trivialized under weak (1, 3) homotopy (Corollary 3).

At the end of this section, we discuss the remarkable work of Hagge and Yazinski [HY] with regard to this paper. We investigate the equivalence relation of knot projections by the first and third homotopy moves; i.e. (1, 3) homotopy. Hagge and Yazinski [HY] studied the non-triviality of (1, 3) homotopy classes of knot projections. However, we still do not have any numerical invariants for all knot projections that exhibit the non-triviality of knot projections under (1, 3) homotopy.

2. (1, 2) homotopy classes of knot projections

We define (1, 2) homotopy as the equivalence relation generated by H1H_{1} and H2H_{2} moves for all knot projections. In this section, we determine how to detect two knot projections under (1, 2) homotopy (Theorem 1). The H1H_{1} (resp. H2H_{2}) move consists of generating and removing a 11-gon (resp. 22-gon) as shown in Fig. 4. Every generation (resp. removal) of a 11-gon is called a 1a1a move or denoted by 1a1a (resp. 1b1b move or 1b1b), and every generation (resp. removal) of a 22-gon is called a 2a2a move or denoted by 2a2a (resp. 2b2b move or 2b2b), as in Fig. 4.

1b1b1a1a2a2a2b2b
Refer to caption
Figure 4. Our conventions 1a1a, 1b1b, 2a2a, and 2b2b.
Definition 1.

For an arbitrary knot projection PP having nn individual 11-gons and 22-gons, the reduced projection PrP^{r} is the knot projection obtained through any sequences of 1b1b and 2b2b deleting nn individual 11-gons and 22-gons arbitrarily.

We consider two special cases of this definition to define 1-homotopy (resp. 2-homotopy) as the equivalence relation generated by H1H_{1} (resp. H2H_{2}) moves for all knot projections. For an arbitrary knot projection PP having nn individual 11-gons (resp. 22-gons), the reduced projection P1rP^{1r} (resp. P2rP^{2r}) is the knot projection obtained through any sequences of 1b1b (resp. 2b2b) deleting nn individual of 11-gons (resp. 22-gons).

Definition 1 looks like that the definition depends on the way of deleting 11- and 22-gons (Fig. 5). However, the reduced knot projection does not depend on the way of deleting 11- and 22-gons. In other words, the uniqueness of the reduced knot projection is well defined by Theorem 1 (Corollary 1).

P2P_{2}P1P_{1}P1r{P_{1}}^{r}P2r{P_{2}}^{r}
Refer to caption
Figure 5. Examples of knot projections and their reduced knot projections (by using Theorem 1, P1rP2r{P_{1}}^{r}\neq{P_{2}}^{r} under (1, 2) homotopy).
Theorem 1.
  1. (i)

    Two knot projections PP and PP^{\prime} are equivalent under 1-homotopy if and only if P1rP^{1r} and P1r{P^{\prime}}^{1r} are equivalent under isotopy on S2S^{2}.

  2. (ii)

    Two knot projections PP and PP^{\prime} are equivalent under 2-homotopy if and only if P2rP^{2r} and P2r{P^{\prime}}^{2r} are equivalent under isotopy on S2S^{2}.

  3. (iii)

    Two arbitrary knot projections PP and PP^{\prime} are equivalent under (1, 2) homotopy if and only if Pr{P}^{r} and Pr{P^{\prime}}^{r} are equivalent under isotopy on S2S^{2}.

We will obtain the proof of (iii) which includes the proofs of (i) and (ii). As shown below, Theorem 1 is derived from Lemma 1.

Lemma 1.

Any finite sequence generated by H1H_{1} and H2H_{2} moves between an arbitrary knot projection and an arbitrary reduced knot projection can be replaced with a sequence of only 1a1a and 2a2a moves or only 1b1b and 2b2b moves.

Proof.

Let nn be an arbitrary integer, with n2n\geq 2, and let xx be a sequence of n2n-2 moves consisting of 1a1a and 2a2a. We use the convention that the sequence xx followed by a 1a1a move is denoted by x(1a)x(1a). For the other moves (e.g. 1b1b, 2a2a, or (2a)(1b)(2a)(1b)), the same convention is applied. Let PiP_{i} be the iith knot projection appearing in a sequence of H1H_{1} and H2H_{2} moves of length nn. In the discussion below, we often use the symbol QQ, which stands for a knot projection. We also use the convention that if the sequence x(1a)(1b)x(1a)(1b) can be replaced with xx, we denote this by x(1a)(1b)x(1a)(1b) == xx. We apply the same convention to all similar cases that appear below.

Below we make claims about four cases of the first appearance of 1b1b or 2b2b in the sequence P1P_{1} \to P2P_{2} \to\dots\to PnP_{n} \to Pn+1P_{n+1} of H1H_{1} and H2H_{2} moves.

  • Case 1: x(1a)(1b)x(1a)(1b) == xx or x(1b)(1a)x(1b)(1a).

  • Case 2: x(2a)(1b)x(2a)(1b) == x(1a)x(1a) or x(1b)(2a)x(1b)(2a).

  • Case 3: x(1a)(2b)x(1a)(2b) == x(1b)x(1b) or x(2b)(1a)x(2b)(1a).

  • Case 4: x(2a)(2b)x(2a)(2b) == xx or x(2b)(2a)x(2b)(2a).

Case 1: The last two moves (1a)(1b)(1a)(1b) can be presented as in Fig. 6. The symbols δx\delta_{x} and δy\delta_{y} denote 11-gons with boundaries, as shown in Fig. 6.

δx\delta_{x}δy\delta_{y}1a1a1b1b
Refer to caption
Figure 6. The last two moves of x(1a)(1b)x(1a)(1b) of Case 1.
  1. (i)

    If δx\delta_{x} \cap δy\delta_{y} \neq \emptyset, there are two cases of the pair δx\delta_{x} and δy\delta_{y} as shown in Fig. 7.

    Refer to caption
    Figure 7. Case 1–(i). The case δx\delta_{x} == δy\delta_{y} (left) and the case δx\delta_{x} \cap δy\delta_{y} == {one vertex}\{{\text{one vertex}}\} (right).

    In both of these cases, we have x(1a)(1b)x(1a)(1b) == xx by Fig. 8.

    Refer to caption
    Figure 8. Case 1–(i). The sequence x(1a)(1b)x(1a)(1b) == xx.
  2. (ii)

    If δx\delta_{x} \cap δy\delta_{y} == \emptyset, then Fig. 9 implies x(1a)(1b)(1b)x(1a)(1b)(1b) == x(1b)x(1b). Here, we can find the special move 1b1b, corresponding to the inverse move of given 1a1a. The move 1a1a follows this sequence, and we have x(1a)(1b)(1b)(1a)x(1a)(1b)(1b)(1a) == x(1b)(1a)x(1b)(1a) as in Fig. 9. Therefore, x(1a)(1b)x(1a)(1b) == x(1b)(1a)x(1b)(1a).

    Pn1P_{n-1}1a{1a}PnP_{n}1b{1b}Pn+1P_{n+1}1b1bQQ1a1aPn+1P_{n+1}1b1b
    Refer to caption
    Figure 9. Case 1–(ii). The sequence Pn1P_{n-1} 1a\stackrel{{\scriptstyle 1a}}{{\to}} PnP_{n} 1b\stackrel{{\scriptstyle 1b}}{{\to}} Pn+1P_{n+1} 1b\stackrel{{\scriptstyle 1b}}{{\to}} QQ shows that x(1a)(1b)(1b)x(1a)(1b)(1b) == x(1b)x(1b).

Case 2: The last two moves (2a)(1b)(2a)(1b) can be presented as in Fig. 10. The symbol δx\delta_{x} (resp. δy\delta_{y}) denotes a 22-gon (resp. 11-gon) with a boundary, as shown in Fig. 10.

δx\delta_{x}δy\delta_{y}2a2a1b1b
Refer to caption
Figure 10. The last two moves of x(2a)(1b)x(2a)(1b) of Case 2.
  1. (i)

    If δx\delta_{x} \cap δy\delta_{y} \neq \emptyset, the pair δx\delta_{x} and δy\delta_{y} appears as in Fig. 11.

    δx\delta_{x}δy\delta_{y}
    Refer to caption
    Figure 11. Case 2-(i).

    In this case, we have x(2a)(1b)x(2a)(1b) == x(1a)x(1a) by Fig. 12.

    Refer to caption
    Figure 12. Case 2-(i). The sequence x(2a)(1b)x(2a)(1b) == x(1a)x(1a).
  2. (ii)

    If δx\delta_{x} \cap δy\delta_{y} == \emptyset, then Fig. 13 implies that x(2a)(1b)(2b)x(2a)(1b)(2b) == x(1b)x(1b). Here, we can find the special move 2b2b, corresponding to the inverse move of given 2a2a. The move 2a2a follows this sequence, and we have x(2a)(1b)(2b)(2a)x(2a)(1b)(2b)(2a) == x(1b)(2a)x(1b)(2a) as in Fig. 13. Therefore, x(2a)(1b)x(2a)(1b) == x(1b)(2a)x(1b)(2a).

    Pn1P_{n-1}2a2aPnP_{n}1b1bPn+1P_{n+1}2b2bQQ2a2aPn+1P_{n+1}1b1b
    Refer to caption
    Figure 13. Case 2-(ii). The sequence Pn1P_{n-1} 2a\stackrel{{\scriptstyle 2a}}{{\to}} PnP_{n} 1b\stackrel{{\scriptstyle 1b}}{{\to}} Pn+1P_{n+1} 2b\stackrel{{\scriptstyle 2b}}{{\to}} QQ shows that x(2a)(1b)(2b)x(2a)(1b)(2b) == x(1b)x(1b).

Case 3: The last two moves (1a)(2b)(1a)(2b) can be presented as in Fig. 14. The δx\delta_{x} (resp. δy\delta_{y}) denotes a 11-gon (22-gon) with a boundary, as shown in Fig. 14.

δx\delta_{x}δy\delta_{y}1a1a2b2b
Refer to caption
Figure 14. The last two moves of x(1a)(2b)x(1a)(2b) of Case 3.
  1. (i)

    If δx\delta_{x} \cap δy\delta_{y} \neq \emptyset, the pair δx\delta_{x} and δy\delta_{y} appears as in Fig. 15.

    δy\delta_{y}δx\delta_{x}
    Refer to caption
    Figure 15. Case 3-(i).

    In this case, x(1a)(2b)x(1a)(2b) == x(1b)x(1b) by Fig. 16.

    Refer to caption
    Figure 16. Case 3-(i). The sequence x(1a)(2b)x(1a)(2b) == x(1b)x(1b).
  2. (ii)

    If δx\delta_{x} \cap δy\delta_{y} == \emptyset, then Fig. 17 implies that x(1a)(2b)(1b)x(1a)(2b)(1b) == x(2b)x(2b). Here, we can find the special move 1b1b, corresponding to the inverse move of given 1a1a. The move 1a1a follows this sequence, and we have x(1a)(2b)(1b)(1a)x(1a)(2b)(1b)(1a) == x(2b)(1a)x(2b)(1a) as in Fig. 17. Therefore, x(1a)(2b)x(1a)(2b) == x(2b)(1a)x(2b)(1a).

    Pn1P_{n-1}1a1aPnP_{n}2b2bPn+1P_{n+1}1b1bQQ1a1aPn+1P_{n+1}2b2b
    Refer to caption
    Figure 17. Case 3-(ii). The sequence Pn1P_{n-1} 1a\stackrel{{\scriptstyle 1a}}{{\to}} PnP_{n} 2b\stackrel{{\scriptstyle 2b}}{{\to}} Pn+1P_{n+1} 1b\stackrel{{\scriptstyle 1b}}{{\to}} QQ shows that x(1a)(2b)(1b)x(1a)(2b)(1b) == x(2b)x(2b).

Case 4: The last two moves (2a)(2b)(2a)(2b) can be presented as in Fig. 18. The symbols δx\delta_{x} and δy\delta_{y} denote 22-gons with boundaries, as shown in Fig. 18.

δx\delta_{x}δy\delta_{y}2a2a2b2b
Refer to caption
Figure 18. The last two moves of x(2a)(2b)x(2a)(2b) of Case 4.
  1. (i)

    If δx\delta_{x} \cap δy\delta_{y} \neq \emptyset, there are two cases of the pair δx\delta_{x} and δy\delta_{y}, as shown in Fig. 19.

    δx\delta_{x}δy\delta_{y}
    Refer to caption
    Figure 19. Case 4-(i). The case δx\delta_{x} == δy\delta_{y} (left) and the case δx\delta_{x} \cap δy\delta_{y} == {one vertex}\{{\text{one vertex}}\}.

    In both of these cases, we have x(2a)(2b)x(2a)(2b) == xx as in Fig. 20.

    δx\delta_{x}δy\delta_{y}
    Refer to caption
    Figure 20. Case 4-(i). The sequence x(2a)(2b)x(2a)(2b) == xx.
  2. (ii)

    If δx\delta_{x} \cap δy\delta_{y} == \emptyset, then Fig. 21 implies that x(2a)(2b)(2b)x(2a)(2b)(2b) == x(2b)x(2b). Here, we can find the special move 2b2b, corresponding to the inverse move of given 2a2a. The move 2a2a follows this sequence, and we have x(2a)(2b)(2b)(2a)x(2a)(2b)(2b)(2a) == x(2b)(2a)x(2b)(2a) as in Fig. 21. Therefore, x(2a)(2b)x(2a)(2b) == x(2b)(2a)x(2b)(2a).

Pn1P_{n-1}2a2aPnP_{n}2b2bPn+1P_{n+1}2b2bQQ2a2aPn+1P_{n+1}2b2b
Refer to caption
Figure 21. Case 4-(ii). The sequence Pn1P_{n-1} 2a\stackrel{{\scriptstyle 2a}}{{\to}} PnP_{n} 2b\stackrel{{\scriptstyle 2b}}{{\to}} Pn+1P_{n+1} 2b\stackrel{{\scriptstyle 2b}}{{\to}} QQ shows that x(2a)(2b)(2b)x(2a)(2b)(2b) == x(2b)x(2b).

Thus, we have shown that the above claims about the four cases are true.

Next, we show that the statement of Lemma 1 is true. Let us consider a given sequence ss of 1a1a, 1b1b, 2a2a, and 2b2b from the left with the given reduced knot projection. Here, 1b1b and 2b2b are called bb moves. We focus on the first appearance of any bb move, which is called the first bb move. The first bb move cannot be the first move of the sequence ss since we start from the left with the reduced knot projection that does not have any 11-gons and 22-gons. If the first bb move is 1b1b, we use the discussions of Cases 1-(ii) and 2-(ii) and move to the left (if necessary) until the bb move encounters Case 1-(i) or 2-(i), either of which eliminates the bb moves. Here, note that the bb move must encounter Case 1-(i) or 2-(i) because the bb move must not the first move of ss. If the first bb move is 2b2b, we use the discussions of Cases 3-(ii) and 4-(ii) and move to the left (if necessary) until the bb move encounters Case 3-(i) or 4-(i), either of which eliminates the 2b2b move. Cases 3-(i) or 4-(i) eliminate 2b2b and permit the replacement y(2b)y(2b) with z(1b)z(1b), where yy and zz are sequences entirely consisting of 1a1a and 2a2a moves. However, z(1b)z(1b) belongs to Case 1 or 2, and so the bb move 1b1b is eliminated. This completes the proof. ∎

Now we will prove Theorem 1.

Proof.

For two arbitrary knot projections PP and PP^{\prime}, we take the projections PrP^{r} and Pr{P^{\prime}}^{r} arbitrarily. For PrP^{r} and Pr{P^{\prime}}^{r}, we apply Lemma 1. If PrP^{r} \neq Pr{P^{\prime}}^{r} under isotopy on S2S^{2}, there exists a non-empty sequence of only 1a1a and 2a2a moves from PrP^{r} to Pr{P^{\prime}}^{r} or from Pr{P^{\prime}}^{r} to PrP^{r}. However, neither PrP^{r} nor Pr{P^{\prime}}^{r} has any 11-gon or 22-gon. This contradicts that the non-empty sequence consists of only 1a1a and 2a2a moves. Then, the assumption that PrP^{r} \neq Pr{P^{\prime}}^{r} under isotopy on S2S^{2} is false. Therefore, our claim is true. The proof of the statement (i) (resp. (ii)) of Theorem 1 is obtained by considering Case 1 (resp. Case 4) of Lemma 1. ∎

Theorem 1 implies Corollary 1.

Corollary 1.

For an arbitrary knot projection PP, the reduced knot projection PrP^{r} is uniquely determined; that is, PrP^{r} does not depend on the way in which 11-gons and 22-gons of PP are deleted.

Remark 1.

Reduced projections having no 11-gons and 22-gons, produced by Definition 1, are called lune-free graphs [EHK, AST]. The knot projection P2r{P_{2}}^{r} of Fig. 5 appears in [EHK, AST].

3. Positive resolutions and weak (1, 3) homotopy invariants.

In the rest of this paper, unless otherwise specified, we adopt unoriented knot projections, and so the sphere containing knot projections does not have its orientation. Moreover, by invoking isotopy on S2S^{2}, if necessary, we can assume without loss of generality that every double point of the knot projection PP consists of two orthogonal branches.

In this section, we define a map from weak (1, 3) homotopy classes to knot isotopy classes. Take an arbitrary knot projection PP and give PP any orientation. Let us define crossings as double points of knot diagrams. We replace the neighborhood of every double point by that of the crossing of knot diagrams as shown in Fig. 22.

Refer to caption
\mapsto
Figure 22. Positive resolution.

This replacement does not depend on the orientation of PP. Then, the replacements define the map from knot projections to knot diagrams.

Polyak [P] introduced this map and called each replacement a positive resolution when every double point is regarded as a singular point. That is, this map gives resolutions of singularities of double points. Using this map, Polyak defined finite type invariants of plane curves. We consider further applications.

Theorem 2.

For an arbitrary knot projection PP, the positive resolution of all double points of PP defines the map from weak (1, 3) homotopy classes of knot projections to knot diagrams.

Proof.

Let us denote by pp the map defined by the positive resolutions of all double points of PP and sending knot projections to knot diagrams. We will check the behavior of pp of the first and third homotopy moves.

  • H1H_{1} moves.

    We denote by D1D_{1} (resp. D2D_{2}) the local diagram defined by the left (resp. right) side of the H1H_{1} move in Fig. 2. All possibilities for D2D_{2} are shown in Fig. 23. In every case, p(D2)p(D_{2}) is transferred to p(D1)p(D_{1}) by the first Reidemeister move Ω1\Omega_{1} of Fig. 1.

    \mapsto\mapsto
    Refer to caption
    Figure 23. The first homotopy move H1H_{1} and positive resolutions.
  • Weak H3H_{3} moves.

    We denote by D3D_{3} (resp. D4D_{4}) the local diagram defined by the left (resp. right) side of the weak H3H_{3} move in Fig. 3. As Fig. 24 shows, p(D3)p(D_{3}) is transferred to p(D4)p(D_{4}) by the third Reidemeister move Ω3\Omega_{3} of Fig. 1.

    \mapsto\mapsto
    Refer to caption
    Figure 24. The third homotopy move H3H_{3} and positive resolutions.

Then, an arbitrary representative of a weak (1, 3) homotopy class is sent by the map pp to an isotopy class of a knot. This completes the proof. ∎

In what follows, we permit the same symbol pp to denote the map defined by Theorem 2 from weak (1,3) homotopy classes of knot projections to isotopy classes of knots.

Corollary 2.

Let II be an arbitrary knot invariant and let pp be the map defined by Theorem 2 from weak (1,3) homotopy classes of knot projections to knot isotopy classes. Then, IpI\circ p is an invariant under weak (1, 3) homotopy.

Example 1.

As is well known, tricolorability is a knot invariant. Let I1I_{1} be the map I1(D)I_{1}(D) == 11 if a knot diagram DD is tricolorable and the map I1(D)I_{1}(D) == 0 otherwise. Let P5P_{5}, P6P_{6}, and P7P_{7} be the knot projections shown from the left to right as in Fig. 25. Thus, I1p(P5)I_{1}\circ p(P_{5}) == 0, I1p(P6)I_{1}\circ p(P_{6}) == 11, and I1p(P7)I_{1}\circ p(P_{7}) == 11. The diagram P7P_{7} appears in [HY].

P5P_{5}P6P_{6}P7P_{7}
Refer to caption
Figure 25. Examples of knot projections.

4. Triviality of knot projections under weak (1, 3) homotopy

Let us call the knot projection of P5P_{5} in Fig. 25 the trivial diagram. If a knot projection PP and the trivial diagram can be related by a finite sequences of H1H_{1} and H3H_{3} moves, the knot projection PP is described as trivial under weak (1, 3) homotopy. If a diagram the same as P5P_{5} is a knot diagram, we also call the knot diagram the trivial diagram.

Corollary 3.

Let PP be an arbitrary knot projection. The knot projection PP is trivial under weak (1, 3) homotopy if and only if PP and the trivial diagram can be related by a finite sequence consisting of the first homotopy moves.

Proof.

By Theorem 2, there exists the map from weak (1,3) homotopy classes of knot projections to knot isotopy classes, which is denoted by pp. Then if TT is a weak (1, 3) homotopy classes of a knot projection containing the trivial diagram, then p(T)p(T) is the unknot that is defined as the knot isotopy classes containing the trivial diagram.

We will prove that the converse of the claim. If PP is an arbitrary weak homotopy classes of an arbitrary knot projection, then p(P)p(P) is a positive knot by the definition of pp. As is well known, if a positive knot diagram belongs to the isotopy class of the unknot, there exists a finite sequence of Ω1\Omega_{1} moves (Fig. 1) between the positive knot diagram and the trivial diagram (e.g. [PT]). Neglecting the information on overpasses and underpasses at double points, we can regard the sequence as one that consists of H1H_{1} moves between a knot projection and the trivial diagram. This completes the proof. ∎

Theorem 2 and Corollary 3 imply the following.

Corollary 4.

Let pp the map defined by Theorem 2 from a weak (1,3) homotopy class of knot projections to a knot isotopy class. If the weak (1, 3) homotopy class containing the trivial diagram is denoted by TT and the unknot is denoted by UU, then

p(T)=Uandp1(U)=T.p(T)=U~{}{\text{and}}~{}p^{-1}(U)=T.
Proof.

The first equation is assured by Theorem 2 and the second equation is obtained from Corollary 3. ∎

Acknowledgments

The authors would like to thank Professor Kouki Taniyama for his fruitful comments. The work on this paper by N. Ito was partially supported by JSPS KAKENHI Grant Number 23740062.

References

  • [AST] C. Adams, R. Shinjo, Tanaka, Complementary regions of knot and link diagram. Ann. Comb. 15 (2011), 549–563.
  • [A1] V. I. Arnold, Plane curves, their invariants, perestroikas and classifications. With an appendix by F. Aicardi. Adv. Soviet Math., 21, Singularities and bifurcations, 33–91, Amer. Math. Soc. Providence, RI, 1994.
  • [A2] V. I. Arnold, Topological invariants of plane curves and caustics. University Lecture Series, 5. American Mathematical Society, Providence, RI, 1994.
  • [EHK] S. Eliahou, F. Harary, and L. H. Kauffman, Lune-free knot graphs, J. Knot Theory Ramifications 17 (2008), 55–74.
  • [HY] T. J. Hagge and J. Yazinski, On the necessity of Reidemeister move 2 for simplifying immersed planar curves, arXiv: 0812.1241.
  • [P] M. Polyak, Invariants of curves and fronts via Gauss diagrams. Topology 37 (1998), 989–1009.
  • [PT] J. H. Przytycki and K. Taniyama, Almost positive links have negative signature, J. Knot Theory Ramifications 19 (2010), 187–289.
  • [T1] K. Taniyama, A partial order of knots. Tokyo J. Math. 12 (1989), 205–229.
  • [T2] K. Taniyama, A partial order of links. Tokyo J. Math. 12 (1989), 475–484.
  • [Va] V. A. Vassiliev, Cohomology of knot spaces. Theory of singularities and its applications, 23–69, Adv. Soviet Math., 1, Amer. Math. Soc., Providence, RI, 1990.
  • [Vi] O. Viro, Generic immersions of the circle to surfaces and the complex topology of real algebraic curves. Topology of real algebraic varieties and related topics, 231–252, Amer. Math. Soc. Transl. Ser. 2, 173, Amer. Math. Soc., Providence, RI, 1996.
  • [W] H. Whitney, On regular closed curves in the plane. Compositio Math. 4 (1937), 276–284.

Waseda Institute for Advanced Study, 1-6-1, Nishi Waseda Shinjuku-ku Tokyo 169-8050, Japan
E-mail address: noboru@moegi.waseda.jp

Department of Mathematics, School of Education, Waseda University, 1-6-1 Nishi Waseda, Shinjuku-ku, Tokyo, 169-8050, Japan
E-mail address: max-drive@moegi.waseda.jp