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

Milnor Invariants
From classical links to surface-links, and beyond

Akira Yasuhara Faculty of Commerce, Waseda University, 1-6-1 Nishi-Waseda, Shinjuku-ku, Tokyo 169-8050, Japan [email protected]

Introduction

This is an English translation of the expository article written by the author in Japanese for publication in Sugaku.

Milnor invariants for (classical) links were defined by J. Milnor [31],[32] in the 1950’s. The study of Milnor invariants has a long history, and counts numerous research results. It is impossible (at least for the author) to cover all of them, so in this article the author only try to explain Milnor invariants from the viewpoint of his research. In [27], J.B. Meilhan explained Milnor invariants from a different perspective, and gave a concise summary of the topics not covered here.

This is not a research paper, so we shall sometimes sacrifice precision and give rough explanations so that a broader audience could follow the outline of this article. On the other hand, we also cover topics that are oriented towards readers who are familiar with knot theory, so we may use technical terms without explanation. For explanations, we sometimes use different terminologies and notations from those in the references. In addition, we occasionally simplify statements of results to fit this article.

The content of this article is as follows: In chapter 1, we treat Milnor invariants for classical links. A classical link is a mathematical model of a ‘closed strings in space’. Hence it is closely related to real-world object. On the other hand, by ignoring the real world and focusing only on the structure of the link, we obtain something called a welded link. In chapter 2, we will discuss Milnor invariants for welded links. We also present an algorithm for computing Milnor invariants. The relationship between ‘classical links’ and ‘welded links’  is in some sense similar to the relationship between ‘real numbers’ and ‘complex numbers’  and in fact, classical links are embedded in welded links. Extending the study of classical links to welded links may lead to new discoveries. In chapter 3 we present results giving geometric characterizations of Milnor invariants of welded links; these results also hold for classical links, but the results cannot be derived from observations of classical links. In chapter  4, for surfaces in 4-space, i.e., for surface-links, we introduce 22-dimensional cut-diagrams, which can be regarded as welded surface-links. We define Milnor invariants of 22-dimensional cut-diagrams, and via this definition, we also define Milnor invariants of surface-links. In addition, we present an algorithm for computing these Milnor invariants. The definition of a 2-dimensional cut-diagram can be extended to that of an mm-dimensional cut-diagram (m2)(m\geq 2). In chapter 5, we define Milnor invariants for mm-dimensional cut-diagrams, and likewise for mm-dimensional links.

Acknowledgments.

The author thanks Jean-Baptiste Meilhan for useful comments on a draft version of this article.

1. Milnor invariants for classical links

In this chapter, we give a quick overview of Milnor invariants for classical links.

1.1. Links and string links

Let nn be a positive integer. An nn-component link is a union of nn simple closed curves in 3-space. In particular, a 1-component link is called a knot. For example, in Figure 1, K1K2K_{1}\cup K_{2} is a 22-component link. A link is trivial if it bounds a disjoint union of disks. Two links are equivalent if there is a ‘continuous deformation’ (more precisely, an ambient isotopy) between them.

Let D2D^{2} be the unit disk and D1D^{1} the diameter on the xx-axis with same orientation as the xx-axis. An nn-string link is a union of nn simple curves in the cylinder D2×[0,1]D^{2}\times[0,1] such that the iith component runs from pi×{0}p_{i}\times\{0\} to pi×{1}p_{i}\times\{1\} for each i=1,,ni=1,...,n, where p1,,pnp_{1},...,p_{n} are points on D1D^{1} that are arranged in order along the orientation of D1D^{1}. For example, in Figure 2, K1K2K3K_{1}\cup K_{2}\cup K_{3} is a 33-string link.

Two strings links are equivalent if there is a continuous deformation between them fixing the boundary of D2×[0,1]D^{2}\times[0,1]. An nn-string link is trivial if it is equivalent to the nn-string link i=1n(pi×[0,1])\bigcup_{i=1}^{n}(p_{i}\times[0,1]).

1.2. Peripheral system and Milnor invariants for links

For an nn-component link L=K1KnL=K_{1}\cup\cdots\cup K_{n}, let G(L)G(L) be the fundamental group of the complement of LL. As illustrated in Figure 1, for each component KiK_{i}, we choose a pair of elements mim_{i} and λi\lambda_{i} in G(L)G(L), that are called an iith meridian and an iith longitude respectively,111While we skip the detailed definition, in this article it is enough to know that meridians and longitudes are special elements in G(L)G(L) that depend on the link. and we call the pair (G(L),{mi,λi}i)(G(L),\{m_{i},\lambda_{i}\}_{i}) a peripheral system of LL. It is known that the peripheral systems up to certain equivalence give the classification of links [23, Theorem 6.1.7]. Hence investigating the equivalence classes of peripheral systems is nothing more than investigating the equivalence classes of links. As we will see below, Milnor invariants are invariants derived from peripheral systems.

Refer to caption
Figure 1. Meridian and longitude of a link

Since G(L)G(L) is non-commutative, classifying peripheral systems is as difficult as classifying links. Therefore we consider the natural projection

ρ2:G(L)N2(L)=G(L)/Γ2G(L),\rho_{2}:G(L)\longrightarrow N_{2}(L)=G(L)/\Gamma_{2}G(L),

where Γ2G(L)=[G(L),G(L)]\Gamma_{2}G(L)=[G(L),G(L)] is the commutator subgroup222[X,Y][X,Y] is the subgroup generated by the set {xy1x1y|xX,yY}\{xy^{-1}x^{-1}y~{}|~{}x\in X,y\in Y\} of G(L)G(L). We remark that N2(L)N_{2}(L) is a free abelian group generated by ρ2(m1),,ρ2(mn)\rho_{2}(m_{1}),...,\rho_{2}(m_{n}). Hence each ρ2(λk)(k=1,,n)\rho_{2}(\lambda_{k})~{}(k=1,...,n) can be written as

ρ2(λk)=i{1,,n}{k}μL(ik)ρ2(mi).\rho_{2}(\lambda_{k})=\sum_{i\in\{1,...,n\}\setminus\{k\}}\mu_{L}(ik)\rho_{2}(m_{i}).

The integer coefficient μL(ik)\mu_{L}(ik) of ρ2(mi)\rho_{2}(m_{i}) is called a (length-2) Milnor invariant of LL.

More generally, for an integer q2q\geq 2 we consider the natural projection

ρq:G(L)Nq(L)=G(L)/ΓqG(L),\rho_{q}:G(L)\longrightarrow N_{q}(L)=G(L)/\Gamma_{q}G(L),

where for a group GG, we define Γ1G=G\Gamma_{1}G=G and ΓqG=[Γq1G,G]\Gamma_{q}G=[\Gamma_{q-1}G,G]. It is known that Nq(L)N_{q}(L) is a nilpotent group generated by ρq(m1),,ρq(mn)\rho_{q}(m_{1}),...,\rho_{q}(m_{n}), and it is called the qqth nilpotent group of LL (or the qqth nilpotent quotient of G(L)G(L)). Taking the Magnus expansion E(ρq(λk))E(\rho_{q}(\lambda_{k})), we have an integer μL(I)\mu_{L}(I) with respect to each sequence I=i1,,isk(s<q)I=i_{1},...,i_{s}k~{}(s<q) with length s+1s+1. Here the Magnus expansion E(ρq(λk))E(\rho_{q}(\lambda_{k})) is a formal power series in non-commutative variables X1,,XnX_{1},...,X_{n} given by

E(ρq(mi))=1+Xi,E(ρq(mi1))=1Xi+Xi2Xi3+(i=1,2,,n).E(\rho_{q}(m_{i}))=1+X_{i},~{}E(\rho_{q}(m_{i}^{-1}))=1-X_{i}+X_{i}^{2}-X_{i}^{3}+\cdots\hskip 10.00002pt(i=1,2,\ldots,n).

We denote the integer coefficient of Xi1XisX_{i_{1}}\cdots X_{i_{s}} in E(ρq(λk))E(\rho_{q}(\lambda_{k})) by μL(i1isk)\mu_{L}(i_{1}...i_{s}k). And we define μL(k)=0\mu_{L}(k)=0.

The Magnus expansion has the following property.

Proposition 1.1.

([26], [15]) Let FF be the free group generated by α1,,αn\alpha_{1},...,\alpha_{n}, and let EE be the Magnus expansion defined by E(αi)=1+Xi,E(αi1)=1Xi+Xi2Xi3+E(\alpha_{i})=1+X_{i},~{}E(\alpha_{i}^{-1})=1-X_{i}+X_{i}^{2}-X_{i}^{3}+\cdots for each ii. Then the followings hold.

  1. (1)

    E:FE(F)E:F\longrightarrow E(F) is a bijection, and for any elements g,hFg,h\in F, E(gh)=E(g)E(h)E(gh)=E(g)E(h).

  2. (2)

    For an element gFg\in F, gΓqFg\in\Gamma_{q}F if and only if the minimal degree of E(g)1E(g)-1 is at least qq.

For a link LL, the numbers μL(I)\mu_{L}(I) are determined by a peripheral system (G(L),{mi,λi}i)(G(L),\{m_{i},\lambda_{i}\}_{i}). But (G(L),{mi,λi}i)(G(L),\{m_{i},\lambda_{i}\}_{i}) is not uniquely determined by LL, and μL(I)\mu_{L}(I) (of length at least 3) are not invariants for LL. So, for a sequence II with length at most qq, we define

ΔL(I):=gcd{μL(J)J is a sequence obtained from I by deleting at least oneindex and permuting the resulting sequence cyclicly},\Delta_{L}(I):=\gcd\left\{\mu_{L}(J)~{}\vline~{}\begin{array}[]{l}J\textrm{ is a sequence obtained from $I$ by deleting at least one}\\ \textrm{index and permuting the resulting sequence cyclicly}\end{array}\right\},

and take the residue class μ¯L(I)\overline{\mu}_{L}(I) of μL(I)\mu_{L}(I) modulo ΔL(I)\Delta_{L}(I), which is an invariant for LL and is called a Milnor μ¯\overline{\mu}-invariant.333A length-22 Milnor invariant μL(ik)\mu_{L}(ik) is equal to the linking number lk(Ki,Kk)\mathrm{lk}(K_{i},K_{k}) between KiK_{i} and KkK_{k}. Hence Milnor invariants are regarded as a generalization of linking number. V.G. Turaev [35] and R. Porter [36] characterized Milnor invariants by means of Massey product. Moreover, T. Cochran [12] gave a geometric characterization for Milnor invariants as linking numbers of intersections between Seifert surfaces for links, which are closed related to Massey product. K. Murasugi [34] showed that Milnor invariants are given by linking numbers of branched covering space. We note that if the length of II is 22, then ΔL(I)=0\Delta_{L}(I)=0, and hence μ¯L(I)=μL(I)\overline{\mu}_{L}(I)=\mu_{L}(I). The length of the sequence II is called the length of Milnor invariant μ¯L(I)\overline{\mu}_{L}(I). It seems that Milnor invariants depend on qq, but it is known that Milnor invariants of length at most qq are equal to those obtained from ρq+1\rho_{q+1}. Therefore for any sequence II with length at most qq, Milnor invariant μ¯L(I)\overline{\mu}_{L}(I) is independent of qq.

As in the case of links, we obtain the integer μL(I)\mu_{L}(I) for a string link LL. In this case, the meridians and the longitudes are uniquely chosen as illustrated in Figure 2. Hence for all II, μL(I)\mu_{L}(I) are invariants for LL, and they are called Milnor μ\mu-invariants.

Refer to caption
Figure 2. Meridian and longitude for a string link

1.3. Automorphisms of nilpotent groups and Milnor invariants

Milnor invariants for string links are defined by N. Habegger and X.S. Lin [20]. Their definition is different from that in the previous section. In this section, we present the idea of the definition by Habegger and Lin.

Set Dε=D2×{ε}(ε{0,1})D_{\varepsilon}=D^{2}\times\{\varepsilon\}~{}(\varepsilon\in\{0,1\}). For an nn-string link LD2×[0,1]L\subset D^{2}\times[0,1], by Stallings Theorem [41, Theorem 5.1], the inclusion map

DεLD2×[0,1]LD_{\varepsilon}\setminus L\hookrightarrow D^{2}\times[0,1]\setminus L

induces the isomorphism

φqε:π1(DεL)/Γqπ1(DεL)Nq(L)\varphi_{q}^{\varepsilon}:\pi_{1}(D_{\varepsilon}\setminus L)/\Gamma_{q}\pi_{1}(D_{\varepsilon}\setminus L)\longrightarrow N_{q}(L)

for each qq. Hence we have an isomorphism

φq:=(φq1)1φq0:π1(D0L)/Γqπ1(D0L)π1(D1L)/Γqπ1(D1L).\varphi_{q}:=(\varphi_{q}^{1})^{-1}\circ\varphi_{q}^{0}:\pi_{1}(D_{0}\setminus L)/\Gamma_{q}\pi_{1}(D_{0}\setminus L)\longrightarrow\pi_{1}(D_{1}\setminus L)/\Gamma_{q}\pi_{1}(D_{1}\setminus L).

Since π1(DεL)(=π1(D2{p1,,pn}))\pi_{1}(D_{\varepsilon}\setminus L)(=\pi_{1}(D^{2}\setminus\{p_{1},...,p_{n}\})) is the free group FF generated by the meridians m1,,mnm_{1},...,m_{n}, we have the automorphism

φq:F/ΓqFF/ΓqF.\varphi_{q}:F/\Gamma_{q}F\longrightarrow F/\Gamma_{q}F.

It follows from the definition of φq\varphi_{q} that φq(ρq(mi))=ρq(λi1miλi)\varphi_{q}(\rho_{q}(m_{i}))=\rho_{q}(\lambda_{i}^{-1}m_{i}\lambda_{i}). This means that φq\varphi_{q} ‘contains’  the information of Milnor μ\mu-invariants for LL. In fact, φq\varphi_{q} can be regarded as Milnor invariants of length at most q1q-1, see Proposition 2.4.

1.4. Properties of Milnor invariants

We summarize the properties of Milnor invariants that are deeply related to the topics in this article.

  1. (1)

    (J. Milnor [32], J. Stallings [41], A. J. Casson [6])  Milnor invariants are isotopy invariants for links [32], and moreover link concordance invariants [41], [6].

  2. (2)

    (K. Habiro [21]) Milnor invariants with length at most kk are CkC_{k}-equivalence invariants, where the CkC_{k}-equivalence is an equivalence relation generated by local moves, CkC_{k}-moves, defined by Habiro [21].

  3. (3)

    (J. Milnor [31], N. Habegger and X.S. Lin [20])  For any sequence II consisting of non repeated indices, μ¯(I)\overline{\mu}(I) is link-homotopy invariant [31], where link-homotopy is an equivalence relation generated by changing crossings between strands of the same component. It is known that LL is link-homotopic to a trivial link if and only if μ¯L(I)=0\overline{\mu}_{L}(I)=0 for any non-repeated sequence II [31], and that the μ(I)\mu(I)’s classify string links up to link-homotopy [20].444This follows from [20, Theorem 1.7], which is not stated in terms of Milnor invariants.

2. Diagrams and Milnor invariants

In this chapter, we define Milnor invariants for welded links, which are defined as a generalization of (diagrams of) classical links, and we also give an algorithm for computing these Milnor invariants.

2.1. Link diagrams

A link LL is an object in 3-space, but it can actually be ‘drawn’  on the plane, so we may regard it as a figure on the plane. We call this figure a diagram of LL. In general, a link diagram is a union of closed curves on the plane with finitely many crossings, where each crossing has an ‘over/under information’. Likewise, we can define a string link diagram as a union of curves on the rectangle D1×[0,1]D^{1}\times[0,1] such that the iith component runs from pi×{0}p_{i}\times\{0\} to pi×{1}p_{i}\times\{1\}. A crossing is locally the intersection of two orthogonal line segments, and the point with over (resp. under) information is called over crossing (resp. under crossing), where formally we assume that over and under crossings are distinct points on distinct line segments, see Figure 3.

\begin{overpic}[width=102.43008pt]{crossing.pdf} \put(27.0,20.0){\footnotesize over/under} \put(39.0,12.0){$\longrightarrow$} \put(40.0,4.0){\footnotesize info} \put(100.0,21.0){\small over crossing} \put(100.0,10.0){\footnotesize(under crossing is behind over crossing)} \end{overpic}
Figure 3. Crossing

Two (string) link diagrams are equivalent if one is deformed into the other by a combination of continuous deformations (fixing the boundary) and the three local moves R1, R2, R3 in Figure 4, called Reidemeister moves.

The following theorem shows that the classification of links is nothing more than the classification of link diagrams.

Theorem 2.1.

(Reidemeister Theorem) Two links are equivalent if and only if their diagrams are equivalent.

Refer to caption
Figure 4. Reidemeister moves

2.2. Virtual link diagrams and welded links ([22],[19],[16])

While all crossings of link diagrams have over/under informations, we extend the concept of link diagrams by considering diagrams that formally allow crossings without over/under informations as on the left side of Figure 3. A diagram containing crossings without over/under information does not correspond to any link in 3-space. It is an ‘imaginary’ link, so it is called a virtual link diagram. A crossing without over/under information is called a virtual crossing. On the other hand, a crossing with an over/under information is called a classical crossing. For convenience, we also allow the case where there are no virtual crossings in a virtual link diagram. From now on, when we emphasize that link diagrams contain only classical crossings, we call them classical link diagrams.

For virtual link diagrams, we define five local moves as follows. The first four moves in Figure 5 are called virtual Reidemeister moves (VR1,VR2,VR3,VR4), and the last move is called OC move (Overcrossings Commute).

The residue classes of the set of virtual link diagrams modulo continuous deformations, Reidemeister moves, virtual Reidemeister moves and OC moves is called welded links.555The residue classes modulo continuous deformations, Reidemeister moves and virtual Reidemeister moves are called virtual links. Here we never treat virtual links. We define welded string links in a similar way.

The Reidemeister moves, the virtual Reidemeister moves, and the OC move are called the welded moves. As an important property of welded links, the following theorem is known.

Refer to caption
Figure 5. Virtual Reidemeister moves, OC move
Theorem 2.2.

([42],[19]) Two classical link diagrams are equivalent as classical links if and only if they are equivalent as welded links. More precisely, two classical link diagrams are equivalent up to continuous deformations and Reidemeister moves if and only if they are equivalent up to continuous deformations and welded moves.

This theorem implies that there is a natural injection from the equivalence classes of classical links to welded links, i.e., we can say

‘classical links can be embedded in welded links.’

In this sense, as we mentioned in introduction, the relationship between ‘classical links’ and ‘welded links’  is similar to the relationship between ‘real numbers’ and ‘complex numbers’.

2.3. Based welded links

For an nn-component virtual link diagram LL, we choose nn points p1,,pnp_{1},...,p_{n} on LL such that each pip_{i} is on the iith component of LL and disjoint from the crossings of LL. The pair (L,𝐩)(L,\mathbf{p}) of LL and 𝐩=(p1,,pn)\mathbf{p}=(p_{1},...,p_{n}) is called a based virtual link diagram. Two based virtual link diagrams are equivalent if one is deformed into the other by a combination of continuous deformations, moves as illustrated in Figure 6, and welded moves that do not contain base points. The residue classes of the set of based virtual link diagrams modulo this equivalence relation is called based welded links. Based welded links are ‘between’  welded string links and welded links. In fact we have the following sequence of surjections:

{welded string links}{based welded links}{welded links}.\{\text{welded string links}\}\twoheadrightarrow\{\text{based welded links}\}\twoheadrightarrow\{\text{welded links}\}.

One advantage of considering based welded links is that peripheral systems can be uniquely defined (as explained in the next section). This means that, like string links, based welded links are very ‘suitable’  objects for defining Milnor invariants. In the next section, we define Milnor invariants for based welded links, and by using this definition, we define Milnor invariants for welded string links and for welded links.

Refer to caption
Figure 6. A base point passing through a virtual crossing

2.4. Peripheral systems of based welded links

A diagram of a (based/string) welded link means a representative of the welded link, i.e., a virtual link diagram. However, since it is tedious to distinguish them, the welded link (i.e. the residue class) and its diagram (i.e. a representative) are often identified. From now on we simply call based welded link diagrams based diagrams.

For a based diagram (L,𝐩)(L,\mathbf{p}), LL is divided into several segments by its base points and under-crossings. These segments are called the arcs of LL. Let ai0a_{i0} be the outgoing arc from the base point pip_{i}, and let ai1,,airia_{i1},...,a_{i{r_{i}}} be the other arcs of the iith component of LL that appear after ai0a_{i0} in order, when traveling around the iith component from pip_{i} along the orientation, where ri+1r_{i}+1 is the number of arcs of the iith component (i=1,,n)i=1,...,n), see Figure 7. Note that airia_{ir_{i}} is the ingoing arc to pip_{i}

The group G(L,𝐩)G(L,\mathbf{p}) of (L,𝐩)(L,\mathbf{p}) is the quotient group of the free group F~\widetilde{F} with generating set {aij}i,j\{a_{ij}\}_{i,j} modulo the following relations

Rij=ai(j1)uijε(ij)aij1uijε(ij)(1in,1jri),R_{ij}=a_{i(j-1)}u_{ij}^{\varepsilon(ij)}a_{ij}^{-1}u_{ij}^{-\varepsilon(ij)}~{}~{}(1\leq i\leq n,~{}1\leq j\leq r_{i}),

where uiju_{ij} denote the arc containing the over crossing between the arcs ai(j1)a_{i(j-1)} and aija_{ij} as illustrated in Figure 7, and ε(ij){1,1}\varepsilon(ij)\in\{-1,1\} is the sign of the crossing involving ai(j1),aija_{i(j-1)},a_{ij} and uiju_{ij}; in the figure, if the orientation of uiju_{ij} is from up to down, then ε(ij)=+1\varepsilon(ij)=+1, otherwise ε(ij)=1\varepsilon(ij)=-1.

\begin{overpic}[width=256.0748pt]{schematic-new.pdf} \put(0.0,5.0){$p_{i}$} \put(13.0,22.0){$a_{i0}$} \put(45.0,22.0){$a_{i1}$} \put(75.0,22.0){$a_{i2}$} \put(110.0,22.0){$a_{i(j-1)}$} \put(150.0,22.0){$a_{ij}$} \put(185.0,22.0){$a_{i(r_{i}-1)}$} \put(230.0,22.0){$a_{ir_{i}}$} \put(30.0,-7.0){$u_{i1}$} \put(65.0,-7.0){$u_{i2}$} \put(141.0,-7.0){$u_{ij}$} \put(218.0,-7.0){$u_{ir_{i}}$} \put(250.0,5.0){$p_{i}$} \end{overpic}
Figure 7. Arcs of KiK_{i}
Remark 2.3.

We note that G(L,𝐩)G(L,\mathbf{p}) has a group presentation {aij}i,j|{Rij}i,j\langle\{a_{ij}\}_{i,j}~{}|~{}\{R_{ij}\}_{i,j}\rangle. Let G(L)G(L) be the group obtained from {aij}i,j|{Rij}i,j\langle\{a_{ij}\}_{i,j}~{}|~{}\{R_{ij}\}_{i,j}\rangle by adding the relations ai0airi1(i=1,,n)a_{i0}a_{ir_{i}}^{-1}~{}(i=1,...,n). We call G(L)G(L) the group of LL. It is known that if LL is a classical link, then G(L)G(L) is isomorphic to the fundamental group of the complement of LL.

For each ii, the two elements ai0a_{i0} and

λi=ai0wiui1ε(i1)ui2ε(i2)uiriε(iri)(where wi is the sum of signs ε(il) for all uilKi)\lambda_{i}=a_{i0}^{-w_{i}}u_{i1}^{\varepsilon(i1)}u_{i2}^{\varepsilon(i2)}\cdots u_{ir_{i}}^{\varepsilon(ir_{i})}~{}(\text{where $w_{i}$ is the sum of signs $\varepsilon(il)$ for all $u_{il}\subset K_{i}$})

of G(L,𝐩)G(L,\mathbf{p}) are called the iith meridian and the iith longitude respectively. As in the case of classical links, the pair (G(L,𝐩),{ai0,λi}i)(G(L,\mathbf{p}),\{a_{i0},\lambda_{i}\}_{i}) is called the peripheral system of (L,𝐩)(L,\mathbf{p}). We note that the peripheral system of G(L,𝐩)G(L,\mathbf{p}) is uniquely determined from the diagram (L,𝐩)(L,\mathbf{p}).

2.5. Peripheral systems of diagrams and Milnor invariants

We consider the natural projection

ρq:G(L,𝐩)Nq(L,𝐩)=G(L,𝐩)/ΓqG(L,𝐩).\rho_{q}:G(L,\mathbf{p})\longrightarrow N_{q}(L,\mathbf{p})=G(L,\mathbf{p})/\Gamma_{q}G(L,\mathbf{p}).

We remark that Nq(L,𝐩)N_{q}(L,\mathbf{p}) is a nilpotent group generated by ρq(ai0)=αi(i=1,,n)\rho_{q}(a_{i0})=\alpha_{i}~{}(i=1,...,n), and it is called the qqth nilpotent group of (L,𝐩)(L,\mathbf{p}) (or the qqth nilpotent quotient of G(L,𝐩)G(L,\mathbf{p})). Hence each ρq(λk)\rho_{q}(\lambda_{k}) can be written as a word of α1,,αn\alpha_{1},...,\alpha_{n}. Moreover, it is known that for the free group FF with generating set {αi|(i=1,,n)}\{\alpha_{i}~{}|~{}(i=1,...,n)\}, we have

Nq(L,𝐩)F/ΓqF,N_{q}(L,\mathbf{p})\cong F/\Gamma_{q}F,

see Theorem 2.6. As in the case of string links (see the last paragraph in Section 1.2), by taking the Magnus expansion E(ρq(λk))E(\rho_{q}(\lambda_{k})), we have integers μ(L,𝐩)(i1,,isk)(s<q)\mu_{(L,\mathbf{p})}(i_{1},...,i_{s}k)~{}(s<q), which are invariants for the based diagram (L,𝐩)(L,\mathbf{p}). Since the condition s<qs<q is not essential, we have invariants for all sequences. We call them Milnor μ\mu-invariants for based welded links.

For a welded string link SS, by identifying both ends pi×{0},pi×{1}p_{i}\times\{0\},p_{i}\times\{1\} of SS to a point pi(i=1,,n)p_{i}~{}(i=1,...,n), we obtain a based diagram (L,𝐩)(L,\mathbf{p}). Then we define μS(I):=μ(L,𝐩)(I)\mu_{S}(I):=\mu_{(L,\mathbf{p})}(I) for all sequences II, and call them Milnor μ\mu-invariants for the welded string link SS. For a welded link LL, by choosing a set 𝐩\mathbf{p} of base points on LL, we have a based diagram (L,𝐩)(L,\mathbf{p}). And we define Milnor μ¯\overline{\mu}-invariants μ¯L(I)\overline{\mu}_{L}(I) for the welded link LL for all sequences II as the residue classes of μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I) modulo Δ(L,𝐩)(I)\Delta_{(L,\mathbf{p})}(I), where

Δ(L,𝐩)(I):=gcd{μ(L,𝐩)(J)J is a sequence obtained from I by deleting at least one index and permuting the resulting sequence cyclicly}.\Delta_{(L,\mathbf{p})}(I):=\gcd\left\{\mu_{(L,\mathbf{p})}(J)~{}\vline~{}\begin{array}[]{l}J\textrm{ is a sequence obtained from $I$ by deleting at least }\\ \textrm{one index and permuting the resulting sequence cyclicly}\end{array}\right\}.

As the names ‘invariants’  suggest, Milnor invariants for welded string links and welded links are invariants under their equivalence relations respectively.

2.6. Automorphisms of nilpotent groups of diagrams and Milnor invariants

For each k(=1,,n)k(=1,...,n), since ρq(akrk)=(ρq(λk))1αkρq(λk)\rho_{q}(a_{kr_{k}})=(\rho_{q}(\lambda_{k}))^{-1}\alpha_{k}\rho_{q}(\lambda_{k}), we have the automorphism

φq=φq(L,𝐩):F/ΓqFF/ΓqF,αkρq(akrk).\varphi_{q}=\varphi_{q}(L,\mathbf{p}):F/\Gamma_{q}F\longrightarrow F/\Gamma_{q}F,~{}\alpha_{k}\longmapsto\rho_{q}(a_{kr_{k}}).

By applying the five lemma to the natural exact sequence

1Γq1F/ΓqFF/ΓqFF/Γq1F1,1\rightarrow\Gamma_{q-1}F/\Gamma_{q}F\hookrightarrow F/\Gamma_{q}F\twoheadrightarrow F/\Gamma_{q-1}F\rightarrow 1,

we can see that φq(L,𝐩)\varphi_{q}(L,\mathbf{p}) is an isomorphism. As in the case of classical string links, φq(L,𝐩)\varphi_{q}(L,\mathbf{p}) can be regarded as the Milnor invariants of (L,𝐩)(L,\mathbf{p}) of length at most q1q-1. In fact, by using Proposition 1.1, we have the following proposition.

Proposition 2.4.

(cf. [30, Remark 3.6]) Let qq be a positive integer, and let (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) be based diagrams. For any sequence II of length at most q1q-1, μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p}^{\prime})}(I) if and only if φq(L,𝐩)=φq(L,𝐩)Autc(F/ΓqF)\varphi_{q}(L,\mathbf{p})=\varphi_{q}(L^{\prime},\mathbf{p}^{\prime})\in\mathrm{Aut}_{\mathrm{c}}(F/\Gamma_{q}F), where Autc(F/ΓqF)\mathrm{Aut}_{\mathrm{c}}(F/\Gamma_{q}F) is the set of automorphisms of F/ΓqFF/\Gamma_{q}F that act by conjugation on each generator.

2.7. Colorings of diagrams and Milnor invariants

A map ff from the set of arcs of a diagram (L,𝐩)(L,\mathbf{p}) to a group XX is called an XX-coloring of (L,𝐩)(L,\mathbf{p}) if ff satisfies

f(aij)=f(uj)ε(j)f(ai(j1))f(uj)ε(j),f(a_{ij})=f(u_{j})^{-\varepsilon(j)}f(a_{i(j-1)})f(u_{j})^{\varepsilon(j)},

for each classical crossing involving ai(j1),aija_{i(j-1)},a_{ij} and uju_{j} (see Figure 7). Let (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) be a diagram obtained from (L,𝐩)(L,\mathbf{p}) by a single welded move. Then it is easily seen that there is an XX-coloring of (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) which coincides with ff for the arcs not contained in the disk where the welded move is applied.

Let N~\widetilde{N} be the normal closure of F~\widetilde{F} that contains {Rij}i,j\{R_{ij}\}_{i,j}, and let A(L,𝐩)A(L,\mathbf{p}) be the set of arcs {aij}i,j\{a_{ij}\}_{i,j} of (L,𝐩)(L,\mathbf{p}). Then by compositing the natural projection

A(L,𝐩)F~F~/N~=G(L,𝐩)A(L,\mathbf{p})\subset\widetilde{F}\twoheadrightarrow\widetilde{F}/\widetilde{N}=G(L,\mathbf{p})

and ρq\rho_{q}, we have the map

ϕq:A(L,𝐩)F/ΓqF(Nq(L,𝐩)).\phi_{q}:A(L,\mathbf{p})\longrightarrow F/\Gamma_{q}F(\cong N_{q}(L,\mathbf{p})).

Since ϕq\phi_{q} is an (F/ΓqF)(F/\Gamma_{q}F)-coloring of (L,𝐩)(L,\mathbf{p}) and uniquely determined by (L,𝐩)(L,\mathbf{p}), ϕq(akrk)\phi_{q}(a_{kr_{k}}) is an invariant for (L,𝐩)(L,\mathbf{p}). Moreover since φq(αk)=ϕq(akrk)\varphi_{q}(\alpha_{k})=\phi_{q}(a_{kr_{k}}), ϕq\phi_{q} determines the automorphism φq\varphi_{q} of the nilpotent group of (L,𝐩)(L,\mathbf{p}). By Proposition 2.4, these (F/ΓqF)(F/\Gamma_{q}F)-colorings can also be regarded as Milnor invariants of length at most q1q-1.

2.8. Chen-Milnor map and an algorithm for computing Milnor invariants

Here we show how to calculate Milnor invariants of based diagrams. This is simply a rewriting of the method given by Milnor [32] for classical links into one for based diagrams.

Let (L,𝐩)(L,\mathbf{p}) be a based diagram. For the iith component KiK_{i} illustrated in Figure 7, we put

vij=ui1ε(i1)uijε(ij).v_{ij}=u_{i1}^{\varepsilon(i1)}\cdots u_{ij}^{\varepsilon(ij)}.

(Note that λi=ai0wiviri\lambda_{i}=a_{i0}^{-w_{i}}v_{ir_{i}}.) Let FF be the free group generated by ai0=αi(i=1,,n)a_{i0}=\alpha_{i}~{}(i=1,...,n). Then, for a positive integer qq, we define inductively a homomorphism

ηq=ηq(L,𝐩):F~F(F~)\eta_{q}=\eta_{q}(L,\mathbf{p}):\widetilde{F}\longrightarrow F(\subset\widetilde{F})

as follows:777While ηq\eta_{q} is essentially the same as defined in [32], in [32] ai0airia_{i0}\cup a_{ir_{i}} is treated as a single arc.

(i)η1(aij)=αi;(ii)ηq+1(ai0)=αi,ηq+1(aij)=ηq(vij1)αiηq(vij)(1jri).(\mathrm{i})~{}\eta_{1}(a_{ij})=\alpha_{i};~{}~{}~{}(\mathrm{ii})~{}\eta_{q+1}(a_{i0})=\alpha_{i},~{}\eta_{q+1}(a_{ij})=\eta_{q}(v_{ij}^{-1})\alpha_{i}\eta_{q}(v_{ij})\hskip 10.00002pt(1\leq j\leq r_{i}).

The map ηq\eta_{q} is called Chen-Milnor map [10],[32]. The following lemma can be easily shown by induction on qq.

Lemma 2.5.

([10],[32])

  1. (1)

    For each element aijF~a_{ij}\in\widetilde{F},
         (i) ηq(aij)aij(modΓqF~N~)\eta_{q}(a_{ij})\equiv a_{ij}\pmod{\Gamma_{q}\widetilde{F}\cdot\widetilde{N}}, and    (ii) ηq(aij)ηq+1(aij)(modΓqF)\eta_{q}(a_{ij})\equiv\eta_{q+1}(a_{ij})\pmod{\Gamma_{q}F}.

  2. (2)

    For each relation RijR_{ij}, ηq(Rij)1(modΓqF)\eta_{q}(R_{ij})\equiv 1\pmod{\Gamma_{q}F}.

Since Nq(L,𝐩)=(F~/N~)/Γq(F~/N~)F~/ΓqF~N~N_{q}(L,\mathbf{p})=(\widetilde{F}/\widetilde{N})/\Gamma_{q}(\widetilde{F}/\widetilde{N})\cong\widetilde{F}/\Gamma_{q}\widetilde{F}\cdot\widetilde{N}, by the lemma above, we have the following theorem.

Theorem 2.6.

(J. Milnor [32])

  1. (1)

    ηq\eta_{q} induces an isomorphism

    Nq(L,𝐩)α1,,αn|ΓqF.N_{q}(L,\mathbf{p})\cong\langle\alpha_{1},\ldots,\alpha_{n}~{}|~{}\Gamma_{q}F\rangle.
  2. (2)

    ρq(λk)=ηq(λk)ΓqF(F/ΓqF)\rho_{q}(\lambda_{k})=\eta_{q}(\lambda_{k}){\Gamma_{q}F}(\in F/\Gamma_{q}F), and hence ηq(λk)\eta_{q}(\lambda_{k}) is a representative of ρq(λk)\rho_{q}(\lambda_{k}).

Remark 2.7.

Since ηq(ai0airi1)=[αi,αiwiηq(λi)]=[αi,ηq(λi)]\eta_{q}(a_{i0}a_{ir_{i}}^{-1})=[\alpha_{i},\alpha_{i}^{w_{i}}\eta_{q}(\lambda_{i})]=[\alpha_{i},\eta_{q}(\lambda_{i})] for each i(=1,,n)i(=1,...,n), by combining Remark 2.3 and Theorem 2.6, we see that Nq(L)=G(L)/ΓqG(L)N_{q}(L)=G(L)/\Gamma_{q}G(L) has the following presentation

α1,,αn|[α1,ηq(λ1)],,[αn,ηq(λn)],ΓqF.\langle\alpha_{1},\ldots,\alpha_{n}~{}|~{}[\alpha_{1},\eta_{q}(\lambda_{1})],\ldots,[\alpha_{n},\eta_{q}(\lambda_{n})],\Gamma_{q}F\rangle.

By Proposition 1.1 (2) and Theorem 2.6, we have the following corollary.

Corollary 2.8.

The Milnor invariant μ(L,𝐩)(i1,,isk)\mu_{(L,\mathbf{p})}(i_{1},...,i_{s}k) for (L,𝐩)(L,\mathbf{p}) is equal to the coefficient of X1XsX_{1}\cdots X_{s} in the Magnus expansion of ηq(λk)\eta_{q}(\lambda_{k}), where qq is an integer with q>sq>s.

Remark 2.9.

As explained above, Milnor invariants are ‘theoretically’  easy to compute. However, when we actually do the calculations, we notice that the length of the word ηq(λk)\eta_{q}(\lambda_{k}) grows exponentially with qq. Furthermore, performing the Magnus expansion on it, the amount of calculations becomes enormous. Therefore, by this naive algorithm, it is impossible to calculate it even using a computer. Takabatake, Kuboyama and Sakamoto noticed that long words that appear in the process of calculating Milnor invariants contain a lot of repetitions, and by ‘folding’ the words by these repetitions, they succeeded to produce a program that can calculate up to about q=16q=16 (depending on the complexity of the links) [43].

Remark 2.10.

Dye and Kauffman’s 2010 paper is often cited as the first paper that tried to extend Milnor invariants to virtual diagrams. However, their paper contains obvious and fatal errors ([24, Remark 4.6], [33, Remark 6.8]). Therefore it should be avoided. In fact, the first successful extension is by Kravchenko and Polyak in [25]. They extended Milnor link-homotopy μ\mu-invariants to virtual string links. Kotorii then extended Milnor link-homotopy μ¯\overline{\mu}-invariants to virtual links in [24]. Both extensions are invariants of welded diagrams, but restricted to the case of link homotopy invariants. In the general case, Audoux, Bellingeri, Meilhan and Wagner extended Milnor μ\mu-invariants to welded string links in [1], and Chrisman defined Milnor μ¯\overline{\mu}-invariants for welded links in [11]. In [33], Miyazawa, Wada and the author gave Milnor invariants for (based) welded (string) links using a way completely independent of [1] and [11]. Although these extended Milnor invariants are defined in different ways, they are the same invariant, i.e., for welded (string) links, their values coincide.

3. Characterization of Milnor invariants

In this chapter we discuss the characterization of based diagrams that have the same Milnor invariants. Milnor invariants can be characterized by two equivalence relations, WkW_{k}-concordance and self WkW_{k}-concordance, on diagrams.

3.1. WkW_{k}-concordance and Milnor invariants

The WkW_{k}-concordance is an equivalence relation that combines two equivalence relations, WkW_{k}-equivalence and welded-concordance, which are explained in the next section. The WkW_{k}-equivalence can be seen as a welded version of CkC_{k}-equivalence, an equivalence relation on classical links defined by Habiro [21].

B. Colombari [13] showed the following theorem.

Theorem 3.1.

(B. Colombari [13]) Let kk be a positive integer. Two based diagrams (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) are WkW_{k}-concordant if and only if μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p}^{\prime})}(I) for any sequence II of length at most kk.

Remark 3.2.

In the paper [13], the statement of Theorem 3.1 is made for welded string links rather than based diagrams. These statements are essentially the same. We can define a product on the set wSL\mathrm{wSL} of welded nn-string links. It is shown that the set of WkW_{k}-concordance classes wSL/(Wk+c)\mathrm{wSL}/{(W_{k}+\mathrm{c})} forms a group under the product. Moreover, by using Proposition 2.4 (for the welded string link version) and Theorem 3.1, we can show the following isomorphism

wSL/(Wk+c)Autc(F/Γk+1F).\mathrm{wSL}/{(W_{k}+\mathrm{c})}\cong\mathrm{Aut}_{\mathrm{c}}(F/\Gamma_{k+1}F).
Remark 3.3.

Theorem 3.1 also holds when restricted to classical string links. That is, it completely characterizes Milnor invariants of classical string links. There are many papers that try to characterize Milnor invariants. In particular, the CkC_{k}-concordance [28] and Whitney tower concordance [14] are closely related to Milnor invariants, but they cannot give a complete characterization. These studies are done in the ‘real world’  of classical string links and CkC_{k}-concordance. On the other hand, Colombari gave the result in the ‘real world’  by expanding his study to the ‘imaginary world’  (i.e., welded string links and WkW_{k}-concordance). This is a successful example of how extending the world of classical objects to include welded objects allows us to solve problems from a new perspective.

3.2. WkW_{k}-equivalence

The content of this section is due to [29]. Our main purpose here is to introduce the definition of WkW_{k}-equivalence. Before explaining WkW_{k}-equivalence, some preparation is necessary. From now on, in order to deal with diagrams of (based) welded links and welded string links simultaneously, for convenience, we assume that they are contained in the disk.

3.2.1. WW-tree

Let LL be a diagram. A tree TT that is ‘drawn’ (immersed) on the disk is called a WW-tree for LL if it satisfies the following conditions:

  1. (1)

    The valency of each vertex of TT is either 11 or 33, i.e., TT is a uni-trivalent tree.

  2. (2)

    The trivalent vertices are disjoint from LL, and the univalent vertices are contained in LL and disjoint from the crossings (and base points) of LL.

  3. (3)

    All edges are oriented so that each trivalent vertex has two ingoing and one outgoing edge.

  4. (4)

    We allow only virtual crossings between edges of TT, and between LL and edges of TT.

  5. (5)

    Each edge of TT is assigned a number (possibly zero) of decorations, called twists, which are disjoint from all vertices and crossings. (Although base points and twists are both presented by black dots, twists are on edges of TT and base points are on the diagram LL.)

A univalent vertex of TT with outgoing edge is called a tail, and a univalent vertex with an ingoing edge is called a head. From condition (3) above, we can see that a WW-tree has a unique head, and that specifying the head determines the tails and the orientation of the entire WW-tree. The tails and head are called ends.

The degree of TT is the number of the tails of TT, and a WkW_{k}-tree is a WW-tree with degree kk. In particular, a W1{W}_{1}-tree is called a WW-arrow.

For a union of WW-trees for LL, vertices are assumed to be pairwise disjoint, and all crossings among edges are assumed to be virtual, see Figure 8 for an example. From now on, when drawing diagrams, we will distinguish them from WW-trees by drawing them with slightly thicker lines as in Figure 8.

Refer to caption
Figure 8. A union of a W3W_{3}-tree, a W2W_{2}-tree and two WW-arrows

WW-trees act as ‘guides’ for transforming diagrams locally. Surgery along a WW-tree is a local move on a diagram using the WW-tree as a guide, as described below. Before describing surgery along a WW-tree, we need to explain surgery along WW-arrow.

3.2.2. Surgery along WW-arrows

Let AA be a union of WW-arrows for LL. Surgery along AA yields a new diagram, denoted by LAL_{A}, which is defined as follows.

  1. (i)

    If a WW-arrow in AA does not contain any crossing or twist, we perform the operation shown in Figure 9. Note that this operation depends only on the orientation of LL near the tail of the WW-arrow.

  2. (ii)

    If a WW-arrow in AA contains some crossings and/or twists, in addition to the operations in Figure 9 on the ends, we also perform the operations on the edge in Figure 10.

\begin{overpic}[width=256.0748pt]{surgery.pdf} \put(5.0,-12.0){$L\cup A$} \put(85.0,-12.0){$L_{A}$} \put(152.5,-12.0){$L\cup A$} \put(232.0,-12.0){$L_{A}$} \end{overpic}
Figure 9. Surgery along WW-arrow (i)
\begin{overpic}[width=341.43306pt]{surgery2.pdf} \put(-5.0,22.0){$A$} \put(14.5,-12.0){$A$} \put(77.0,-12.0){$L_{A}$} \put(122.0,22.0){$A$} \put(140.0,-12.0){$L$} \put(198.0,-12.0){$L_{A}$} \put(259.0,-12.0){$A$} \put(317.0,-12.0){$L_{A}$} \end{overpic}
Figure 10. Surgery along WW-arrow (ii)

An arrow presentation for a diagram LL is a pair (V,A)(V,A) of a diagram VV without classical crossings and a union of WW-arrows AA for VV, such that VAV_{A} is equivalent to the diagram LL. Any diagram admits an arrow presentation since all classical crossings can be replaced with virtual crossings and WW-arrows as shown in Figure 11.

Two arrow presentations (V,A)(V,A) and (V,A)(V^{\prime},A^{\prime}) are equivalent if VAV_{A} and VAV^{\prime}_{A^{\prime}} are equivalent. An arrow presentation (V,A)(V,A) is sometimes treated as a union VAV\cup A of a diagram VV and WW-arrows AA, and we do not distinguish them unless necessary. One of the advantages of the arrow presentation is that VAV\cup A contains no classical crossings.

\begin{overpic}[width=170.71652pt]{Aprst.pdf} \put(42.0,22.0){VR2} \end{overpic}
Figure 11. A classical crossing can be replaced by a virtual crossing and a WW-arrow

3.2.3. Arrow-moves

Arrow moves consist of the virtual Reidemeister moves VR1, VR2, VR3, where they may contain WW-arrows, and the local moves AR1, …, AR10 in Figure 12. We stress that arrow moves contain no classical crossings. Here the vertical lines in AR1, AR2, AR3 are assumed to be included in diagrams or WW-arrows, and white dots \circ on WW-arrows in AR8 and AR10 mean that the WW-arrows may or may not include twists. Then we have the following.

Theorem 3.4.

Two arrow presentations are equivalent if and only if they are deformed into each other by a combination of continuous deformations and arrow moves, where in the case of based diagram, in addition to VR1, VR2, VR3, the move of Figure 6 is also required, and the local moves AR1, …, AR10 do not include base points.

\begin{overpic}[width=327.20668pt]{Amoves.pdf} \put(37.0,212.0){AR1} \put(152.0,212.0){AR2} \put(267.0,212.0){AR3} \put(37.0,148.5){AR4} \put(152.0,148.5){AR5} \put(267.0,148.5){AR6} \put(37.0,84.5){AR7} \put(152.0,84.5){AR8} \put(267.0,84.5){AR9} \put(58.0,21.0){AR10} \put(241.5,21.0){AR10} \end{overpic}
Figure 12. Arrow moves AR1–AR10

3.2.4. Surgery along WW-trees

In the following, we define surgery along W-trees. For an integer k2k\geq 2, the expansion (E) of a WkW_{k}-tree is an operation that replaces a WkW_{k}-tree with four WW-trees of degree less than kk, as shown in Figure 13. For each figure of Figure 13, the left (resp. right) dashed parts in the figure on the right of ‘(E)\stackrel{{\scriptstyle({\rm E})}}{{\longrightarrow}}’ means the same figures as the left (resp. right) dashed part in the figure on the left of ‘(E)\stackrel{{\scriptstyle({\rm E})}}{{\longrightarrow}}’. The ends of the dashed parts are only the tails of the trees, and their arrangement is chosen arbitrarily. In general, for a WW-tree TT, by repeating the expansion we obtain a union E(T)E(T) of WW-arrows from TT (Figure 14). While E(T)E(T) depends on the arrangement of its tails, thanks to AR7 it is unique up to the arrow moves. Then we define surgery along a WW-tree TT as surgery along E(T)E(T). In this case, we denote LE(T)L_{E(T)} by LTL_{T}. Similarly, we define surgery along a union of WW-trees.

We say that LTL_{T} is obtained from LL by a WkW_{k}-move if TT is a WkW_{k}-tree. In particular, we say that LTL_{T} is obtained from LL by a self WkW_{k}-move if all ends of TT are contained in the same component of LL. Using the move (I) in Figure 15, we can see that LL is obtained from LTL_{T} by a (self) WkW_{k}-move, i.e., there is a (self) WkW_{k}-tree TT^{\prime} such that (LT)T(L_{T})_{T^{\prime}} and LL are equivalent.

Two diagrams LL and LL^{\prime} are (self) WkW_{k}-equivalent if there is a sequence of diagrams

L=L0,L1,,Lm=LL=L_{0},L_{1},...,L_{m}=L^{\prime}

such that, for each i(=1,,m)i(=1,...,m), LiL_{i} is equivalent to Li1L_{i-1}, or LiL_{i} is obtained from Li1L_{i-1} by a (self) WlW_{l}-move (lk)(l\geq k).888It is shown that if l>kl>k, then a (self) WlW_{l}-move is realized by (self) WkW_{k}-moves [4].

\begin{overpic}[width=312.9803pt]{expansion-new.pdf} \put(58.0,29.0){(E)} \put(240.0,29.0){(E)} \end{overpic}
Figure 13. Expansion (E) of a tree
\begin{overpic}[width=341.43306pt]{extension-new.pdf} \put(103.0,37.0){(E)} \put(227.0,37.0){(E)} \end{overpic}
Figure 14. Expansions of a W3W_{3}-tree

A tree presentation for a diagram LL is a pair (V,T)(V,T) of a diagram VV without classical crossings and a union of WW-trees TT for VV, such that VTV_{T} is equivalent to the diagram LL. Two tree presentations (V,T)(V,T) and (V,T)(V^{\prime},T^{\prime}) are equivalent if VTV_{T} and VTV^{\prime}_{T^{\prime}} are equivalent. A tree presentation (V,T)(V,T) is sometimes treated as a union VTV\cup T of a diagram VV and WW-trees TT, and we do not distinguish them unless otherwise necessary.

3.2.5. WW-tree moves

A local move on a WW-tree presentation is called a WW-tree move if it preserves the equivalence classes of the WW-tree presentations. Here, we introduce four of them given in [29] that will be needed later.

The moves in Figure 15 are called move (I) (Inverse), move (TE) (Tail Exchange), move (HE) (Head Exchange) and move (HTE) (Head Tail Exchange).

In the move (TE), the two tails may be in the same WW-tree. The right side SS of the move (HTE) in Figure 15 represents a union of several WW-trees, each of which has degree greater than the sum of the degrees of the two WW-trees on the left side. Moves (I) and (TE) are obtained by AR9 and by a combination of AR7 and the expansions of WW-trees respectively. For the move (HE), by the expansion of the middle WW-tree of the WW-tree presentation on the right side and applying the move (I) and AR4, the WW-tree presentation on the left side is obtained. To obtain the move (HTE), in addition to AR9, AR10, the expansions of WW-trees and the move (HE), a move called ‘Twist’ (not introduced here) is required. This requires more complex discussions than the other moves, so we omit the details.

\begin{overpic}[width=355.65944pt]{wtree-moves-new.pdf} \put(165.0,76.0){move (I)} \put(58.0,-15.0){move (TE)} \put(264.0,-15.0){move (HE)} \end{overpic}
\begin{overpic}[width=199.16928pt]{TailHead.pdf} \put(80.0,-13.0){move (HTE)} \end{overpic}
Figure 15. WW-tree moves

3.3. Welded-concordance

Two nn-component diagrams LL and LL^{\prime} are welded-concordant if one can be deformed into the other by a sequence of welded equivalence and the birth/death and saddle moves of Figure 16, such that, for each i{1,,n}i\in\{1,\cdots,n\}, the number of birth/death moves is equal to the number of saddle moves, in the deformation from the iith component of LL into the iith component of LL^{\prime}. In the case of based diagrams, the move of Figure 6 is also required, and each local move does not include base points.

It is shown that Milnor invariants for diagrams are welded-concordance invariants [11].

Refer to caption
Figure 16. Birth/death and saddle moves
Remark 3.5.

If LL and LL^{\prime} are classical links, then the usual link concordance implies the welded-concordance. In the definition of the welded-concordance, the condition on the numbers of birth/death and saddle moves corresponds to the fact that each components of LL and LL^{\prime} bounds an annulus in the 4-space. In contrast to the usual link concordance, all welded knots are welded-concordant to the trivial knot [18].

3.4. Ascending presentation and Milnor invariants

In this subsection, we give a sketch of proof of Theorem 3.1 using a special WW-tree presentation called ascending presentation.

Let (V,T)(V,T) be a WW-tree presentation of a based diagram (L,𝐩)(L,\mathbf{p}). Note that VV is also a based diagram. The WW-tree presentation (V,T)(V,T) is ascending999This notion was first defined in [1], in the context of Gauss diagrams. if, when running around each component of VV from the base point along the orientation, all tails of TT appear before all heads of TT. A based diagram is ascendable if it has an ascending presentation.

3.4.1. Peripheral systems of ascending presentations

Let (L,𝐩)(L,\mathbf{p}) be an ascendable diagram with an ascending WW-tree presentation (V,T)(V,T). Since VTV\cup T contains no classical crossings, by (after doing expansions of WW-trees) arrow moves we may assume that VV is a based diagram (O,𝐩)(O,\mathbf{p}), where OO is a trivial diagram, i.e., it contains no crossings. In the following, we suppose that V=(O,𝐩)V=(O,\mathbf{p}).

By the expansions of WW-trees, we obtain a WW-arrow presentation ((O,𝐩),A)((O,\mathbf{p}),A) from the ascending presentation ((O,𝐩),T)((O,\mathbf{p}),T), where for each WW-arrow in AA, a small segment adjacent to the head is always assumed to be on the right side with respect to the orientation of the component of OO that contains the head. Furthermore, we may assume that each WW-arrow contains at most one twist. We remark that ((O,𝐩),A)((O,\mathbf{p}),A) is ascending, since ((O,𝐩),T)((O,\mathbf{p}),T) is ascending.

For ((O,𝐩),A)((O,\mathbf{p}),A), we assign a label by arc αi\alpha_{i} to the WW-arrow whose tail is in the ii-th component of OO. Let FF be the free group generated by {α1,,αn}\{\alpha_{1},...,\alpha_{n}\}, let ui1,,uiriu_{i1},...,u_{ir_{i}} be the labels of WW-arrows that appear in order, when traveling around the iith component of VV from the base point along the orientation.

Then we define

liA:=ui1ε(i1)uiriε(iri)F,l^{A}_{i}:=u_{i1}^{\varepsilon(i1)}\cdot\cdots\cdot u_{ir_{i}}^{\varepsilon(ir_{i})}\in F,

where ε(ij)=1\varepsilon(ij)=-1 if the WW-arrow corresponding to uiju_{ij} contains a twist, and ε(ij)=+1\varepsilon(ij)=+1 otherwise. By the definition of surgery along WW-arrows, it can be seen that liAl^{A}_{i} is the sequence of signed labels of the over crossings that appear when running around the iith component of OAO_{A} from the base point. Moreover, if necessary, by using AR8 move with preserving the ascending presentation, liAl^{A}_{i} can be regarded as an iith longitude λiL\lambda_{i}^{L}. Since liAl_{i}^{A} is an element of the free group FF, we have the following proposition.

Proposition 3.6.

([2]) Let ((O,𝐩),A)((O,\mathbf{p}),A) and ((O,𝐩),A)((O,\mathbf{p}),A^{\prime}) be ascending presentations for ascendable based diagrams (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) respectively. If liA=liA(F)l_{i}^{A}=l_{i}^{A^{\prime}}(\in F) for each ii, then ((O,𝐩),A)((O,\mathbf{p}),A) and ((O,𝐩),A)((O,\mathbf{p}),A^{\prime}) are deformed into each other by a combination of AR7 and AR9, and hence, (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) are equivalent.

On the other hand, by Proposition 1.1 (2), we have the following.

Proposition 3.7.

([13]) For any sequence II with length at most qq, μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p}^{\prime})}(I) if and only if for each ii, λiLλiL(modΓqF)\lambda^{L}_{i}\equiv\lambda^{L^{\prime}}_{i}\pmod{\Gamma_{q}F}.101010This proposition does not require the assumption of ‘ascending’.

3.4.2. Sketch of the proof of Theorem 3.1

Since the ‘only if’  part of Theorem 3.1 is not difficult to show, we admit that the ‘only if’ part holds and show the ‘if’ part. Also, since the case k=1k=1 is obvious, we suppose that k2k\geq 2.

  1. (Step 1)

    We deform by WkW_{k}-concordance the WW-tree presentations of (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) into ascending presentations ((O,𝐩),T)((O,\mathbf{p}),T) and ((O,𝐩),T)((O,\mathbf{p}),T^{\prime}), respectively. This can be done by using the move (HTE) and welded-concordance. Doing the expansions of TT and TT^{\prime}, we have ascending WW-arrow presentations ((O,𝐩),A)((O,\mathbf{p}),A) and ((O,𝐩),A)((O,\mathbf{p}),A^{\prime}).

  2. (Step 2)

    Since μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p^{\prime}})}(I) for any sequence II with length at most kk, by the ‘only if’ part of Theorem 3.1, μ(OA,𝐩)(I)=μ(OA,𝐩)(I)\mu_{(O_{A},\mathbf{p})}(I)=\mu_{(O_{A^{\prime}},\mathbf{p^{\prime}})}(I). Therefore, by Proposition 3.7, for each ii, we have

    liAliA(modΓkF).l^{A}_{i}\equiv l^{{A^{\prime}}}_{i}\pmod{\Gamma_{k}F}.

    In other words, there is an element gig_{i} in ΓkF\Gamma_{k}F such that liA=liAgiFl^{{A^{\prime}}}_{i}=l^{A}_{i}g_{i}\in F. By Proposition 3.6, there are WW-arrows BB such that OA=OABO_{A^{\prime}}=O_{A\cup B} and liA=liAliBl_{i}^{A^{\prime}}=l_{i}^{A}l^{B}_{i}.

  3. (Step 3)

    From an algebraic point of view, we see that gig_{i} is a product of commutators gi1,,gitig_{i1},...,g_{it_{i}} consisting of {α1±1,,αn±1}\{\alpha_{1}^{\pm 1},...,\alpha_{n}^{\pm 1}\} with length at least kk. And by applying the inverse of expansion (Figure 17) to the WW-arrows corresponding to each gisg_{is}, we obtain a WW-tree of degree at least kk. Hence OA=OABO_{A^{\prime}}=O_{A\cup B} and OAO_{A} are WkW_{k}-equivalent.

\begin{overpic}[width=341.43306pt]{reextension-new.pdf} \put(4.0,13.0){$a$} \put(55.0,-7.0){$b$} \put(90.0,23.0){$c$} \put(5.0,65.0){$a{c^{-1}bcb^{-1}}a^{-1}{bc^{-1}b^{-1}c}$} \put(125.0,13.0){$a$} \put(172.0,-7.0){$b$} \put(212.0,23.0){$c$} \put(130.0,65.0){$a{[b,c]^{-1}}a^{-1}{[b,c]}$} \put(251.0,13.0){$a$} \put(301.0,-7.0){$b$} \put(338.0,25.0){$c$} \put(255.0,65.0){$[a,[b,c]]$\footnotesize{$\leftarrow$length-$3$ commutator}} \end{overpic}
Figure 17. Inverse of expansion (where [x,y]:=xy1x1y[x,y]:=xy^{-1}x^{-1}y)

3.5. Self WkW_{k}-concordance and Minor invariants

The content of this section is due to [4]. The self WkW_{k}-concordance is an equivalence relation on diagrams obtained by combining self WkW_{k}-equivalence and welded-concordance. Here, we introduce the result that the self WkW_{k}-concordance classification is given by Milnor invariants.

3.5.1. kk-reduced quotient groups and Milnor invarints

In this section, we define the kk-reduced quotient group of a based diagram (L,𝐩)(L,\mathbf{p}), and explain the relation between this group and Milnor invariants μ(L,𝐩)(I)(r(I)k)\mu_{(L,\mathbf{p})}(I)~{}(r(I)\leq k), where

r(I):=max{ri|i appears ri times in I(i=1,,n)}.r(I):=\max\{r_{i}~{}|~{}\text{$i$ appears $r_{i}$ times in $I$}~{}(i=1,...,n)\}.

The arguments in this section are simply rewritings of those in [4] for welded string links into those for based diagrams.

For the peripheral system (G(L,𝐩),{ai0,λi}i)(G(L,\mathbf{p}),\{a_{i0},\lambda_{i}\}_{i}) of (L,𝐩)(L,\mathbf{p}), let Gi(L,𝐩)G_{i}(L,\mathbf{p}) be the normal closure of G(L,𝐩)G(L,\mathbf{p}) that contains ai0a_{i0}. We call the quotient group

Rk(L,𝐩):=G(L,𝐩)/Γk+1G1(L,𝐩)Γk+1Gn(L,𝐩)R_{k}(L,\mathbf{p}):=G(L,\mathbf{p})/\Gamma_{k+1}G_{1}(L,\mathbf{p})\cdots\Gamma_{k+1}G_{n}(L,\mathbf{p})

the kk-reduced group of (L,𝐩)(L,\mathbf{p}) or the kk-reduced quotient of G(L,𝐩)G(L,\mathbf{p}).

When k=1k=1, it is the link group defined by Milnor [31]. Since G(L,𝐩)G(L,\mathbf{p}) is also sometimes called link group, we use a different name here. Habegger and Lin [20] call it the reduced group.

It is known that Rk(L,𝐩)R_{k}(L,\mathbf{p}) is a nilpotent group for any positive integer kk, and

Γkn+1G(L,𝐩)Γk+1G1(L,𝐩)Γk+1Gn(L,𝐩).\Gamma_{kn+1}G(L,\mathbf{p})\subset\Gamma_{k+1}G_{1}(L,\mathbf{p})\cdots\Gamma_{k+1}G_{n}(L,\mathbf{p}).

Therefore we have the following surjection.

Nkn+1(L,𝐩)=G(L,𝐩)/Γkn+1G(L,𝐩)Rk(L,𝐩).N_{kn+1}(L,\mathbf{p})=G(L,\mathbf{p})/\Gamma_{kn+1}G(L,\mathbf{p})\twoheadrightarrow R_{k}(L,\mathbf{p}).

By composing respectively this with the two maps

ρkn+1:G(L,𝐩)Nkn+1(L,𝐩),ϕkn+1:A(L,𝐩)Nkn+1(L,𝐩)\rho_{kn+1}:G(L,\mathbf{p})\rightarrow N_{kn+1}(L,\mathbf{p}),~{}~{}~{}~{}\phi_{kn+1}:A(L,\mathbf{p})\rightarrow N_{kn+1}(L,\mathbf{p})

defined in Sections 2.5 and 2.7, we have the two maps

ρRk:G(L,𝐩)Rk(L,𝐩),ϕRk:A(L,𝐩)Rk(L,𝐩).\rho_{R_{k}}:G(L,\mathbf{p})\rightarrow R_{k}(L,\mathbf{p}),~{}~{}~{}~{}\phi_{R_{k}}:A(L,\mathbf{p})\rightarrow R_{k}(L,\mathbf{p}).

Since Nkn+1(L,𝐩)N_{kn+1}(L,\mathbf{p}) is generated by ρkn+1(ai0)(i=1,,n)\rho_{kn+1}(a_{i0})~{}(i=1,...,n), Rk(L,𝐩)R_{k}(L,\mathbf{p}) is generated by ρRk(ai0)=αi(i=1,,n)\rho_{R_{k}}(a_{i0})=\alpha_{i}~{}(i=1,...,n). Hence ρRk(λk)\rho_{R_{k}}(\lambda_{k}) is written as a word of α1,,αn\alpha_{1},...,\alpha_{n}.

Let FF be the free group generated by α1,,αn\alpha_{1},...,\alpha_{n}, and let NiN_{i} be the normal closure containing αi\alpha_{i} for each i=1,,ni=1,...,n. Similar to Theorem 2.6 (1), the following theorem holds.

Theorem 3.8.

The Chen-Milnor map ηkn+1\eta_{kn+1} induces the following isomorphism

Rk(L,𝐩)α1,,αn|Γk+1N1Γk+1Nn(=F/Γk+1N1Γk+1Nn).R_{k}(L,\mathbf{p})\cong\langle\alpha_{1},\ldots,\alpha_{n}~{}|~{}\Gamma_{k+1}N_{1}\cdots\Gamma_{k+1}N_{n}\rangle~{}(=F/\Gamma_{k+1}N_{1}\cdots\Gamma_{k+1}N_{n}).

As in Section 2.7, by the theorem above, ϕRk\phi_{R_{k}} is a (F/Γk+1N1Γk+1Nn)(F/\Gamma_{k+1}N_{1}\cdots\Gamma_{k+1}N_{n})-coloring.

3.5.2. Self WkW_{k}-concordance classification

As in Section 2.6, we can define the automorphism

φRk:RkFRkF,αkρRk(λk)1αkρRk(λk)\varphi_{R_{k}}:R_{k}F\longrightarrow R_{k}F,~{}\alpha_{k}\longmapsto\rho_{R_{k}}(\lambda_{k})^{-1}\alpha_{k}\rho_{R_{k}}(\lambda_{k})

of RkF=F/Γk+1N1Γk+1NnR_{k}F=F/\Gamma_{k+1}N_{1}\cdots\Gamma_{k+1}N_{n}.

The following theorem gives the self WkW_{k}-concordance classification of based diagrams.

Theorem 3.9.

Let (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) be based diagrams. Then for any positive integer kk, the following (1),(2) and (3) are mutually equivalent.

  1. (1)

    For any sequence II with r(I)kr(I)\leq k, μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p}^{\prime})}(I).

  2. (2)

    φRk(L,𝐩)=φRk(L,𝐩)Autc(RkF)\varphi_{R_{k}}(L,\mathbf{p})=\varphi_{R_{k}}(L^{\prime},\mathbf{p}^{\prime})\in\mathrm{Aut}_{\mathrm{c}}(R_{k}F).

  3. (3)

    (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) are self WkW_{k}-concordant.

Here Autc(RkF)\mathrm{Aut}_{\mathrm{c}}(R_{k}F) is the set of automorphisms of RkFR_{k}F that act by conjugation on each generator.

Remark 3.10.

(1) In [4], the statement of Theorem 3.9 is given for welded string links rather than based diagrams. These statements are essentially the same. The self W1W_{1}-concordant classes coincide with the self W1W_{1}-equivalence classes. The self W1W_{1}-equivalence classification of welded string links is given in [1].
(2) The set of self WkW_{k}-concordance classes wSL/(self Wk+c)\mathrm{wSL}/{(\text{self }W_{k}+\mathrm{c})} of welded nn-string links forms a group under the product of welded string links. Moreover by using Theorem 3.9 (for the welded string link version), we can show the following isomorphism

wSL/(self Wk+c)Autc(RkF).\mathrm{wSL}/{(\text{self }W_{k}+\mathrm{c})}\cong\mathrm{Aut}_{\mathrm{c}}(R_{k}F).
Remark 3.11.

It is shown by T. Fleming and the author [17] that for any sequence II with r(I)kr(I)\leq k, Milnor invariant μ(I)\mu(I) is a self CkC_{k}-equivalence invariant. The self C1C_{1}-equivalence is link-homotopy, and the self C2C_{2}-equivalence is often called the self Δ\Delta-equivalence. For the case k=1,2k=1,2, it is shown in [31] and [45] respectively that a classical link LL is self CkC_{k}-equivalent to a trivial if and only if μ¯L(I)=0\overline{\mu}_{L}(I)=0 for any sequence II with r(I)kr(I)\leq k. The self CkC_{k}-concordance classification for classical string links is given in [20] for k=1k=1 and in [44] for k=2k=2.

3.5.3. Sketch of the proof of Theorem 3.9

The key for the proof of Theorem 3.9 is ascending presentations, as in the proof of Theorem 3.1. We need two additional theorems below.

A WW-tree TT for a diagram LL is a W(k)W^{(k)}-tree if at least kk ends of TT belong to the same component of LL. The W(k)W^{(k)}-equivalence is an equivalence relation on diagrams generated by surgery along W(k)W^{(k)}-trees, and the W(k)W^{(k)}-concordance is a combination of the W(k)W^{(k)}-equivalence and welded-concordance.

Theorem 3.12.

Let kk be a positive integer. Two diagrams are W(k+1)W^{(k+1)}-equivalent if and only if they are self WkW_{k}-equivalent.

Theorem 3.13.

Let λiL\lambda_{i}^{L} and λiL\lambda_{i}^{L^{\prime}} be iith longitudes of based diagrams (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p^{\prime}}), respectively. Then μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p})}(I) for any sequence II with r(I)kr(I)\leq k if and only if ρRk(λiL)ρRk(λiL)(modΓk+1N1ΓkNiΓk+1Nn)\rho_{R_{k}}(\lambda^{L}_{i})\equiv\rho_{R_{k}}(\lambda^{L^{\prime}}_{i})\pmod{\Gamma_{k+1}N_{1}\cdots\Gamma_{k}N_{i}\cdots\Gamma_{k+1}N_{n}}.

Since the proof of (1)(3)(1)\Rightarrow(3) is the most difficult, we admit (3)(1)(3)\Rightarrow(1) and (1)(2)(1)\Leftrightarrow(2) (and Theorems 3.12 and 3.13) and only give a sketch of proof of (1)(3)(1)\Rightarrow(3).

  1. (Step 1)

    We deform by WknW_{kn}-concordance the WW-tree presentations of (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) into ascending presentations ((O,𝐩),T)((O,\mathbf{p}),T) and ((O,𝐩),T)((O,\mathbf{p}),T^{\prime}), respectively. Doing expansions of TT and TT^{\prime}, we have ascending WW-arrow presentations ((O,𝐩),A)((O,\mathbf{p}),A) and ((O,𝐩),A)((O,\mathbf{p}),A^{\prime}). Since a WknW_{kn}-tree has kn+1kn+1 ends, it is a W(k+1)W^{(k+1)}-tree. Hence, by Theorem 3.12, (L,𝐩)(L,\mathbf{p}) and (L,𝐩)(L^{\prime},\mathbf{p}^{\prime}) are self WkW_{k}-equivalent to ((O,𝐩),A)((O,\mathbf{p}),A) and ((O,𝐩),A)((O,\mathbf{p}),A^{\prime}) respectively.

  2. (Step 2)

    Since μ(L,𝐩)(I)=μ(L,𝐩)(I)\mu_{(L,\mathbf{p})}(I)=\mu_{(L^{\prime},\mathbf{p^{\prime}})}(I) for any sequence II with r(I)kr(I)\leq k, by (3)(1)(3)\Rightarrow(1) of Theorem 3.9, μ(OA,𝐩)(I)=μ(OA,𝐩)(I)\mu_{(O_{A},\mathbf{p})}(I)=\mu_{(O_{A^{\prime}},\mathbf{p^{\prime}})}(I). Therefore, by Theorem 3.13, for each ii, we have

    liAliA(modΓk+1N1ΓkNiΓk+1Nn).l^{A}_{i}\equiv l^{{A^{\prime}}}_{i}\pmod{\Gamma_{k+1}N_{1}\cdots\Gamma_{k}N_{i}\cdots\Gamma_{k+1}N_{n}}.

    Hence, there are elements gijΓk+1Nj(ji),giiΓkNig_{ij}\in\Gamma_{k+1}N_{j}~{}(j\neq i),~{}g_{ii}\in\Gamma_{k}N_{i} such that liA=liAgi1ginFl^{{A^{\prime}}}_{i}=l^{A}_{i}g_{i1}\cdots g_{in}\in F. By Proposition 3.6, there are WW-arrows BB such that OA=OABO_{A^{\prime}}=O_{A\cup B} and liA=liAliBl_{i}^{A^{\prime}}=l_{i}^{A}l_{i}^{B}.

  3. (Step 3)

    From an algebraic point of view, we have that

    1. (a)

      if jij\neq i, then gijΓk+1Njg_{ij}\in\Gamma_{k+1}N_{j} is a product of commutators gij1,,gijsjg_{ij}^{1},...,g_{ij}^{s_{j}} with length at least kk where αj\alpha_{j} appears at least k+1k+1 times, and

    2. (b)

      if j=ij=i, giikΓkNig_{ii}^{k}\in\Gamma_{k}N_{i} is a product of commutators gii1,,giisig_{ii}^{1},...,g_{ii}^{s_{i}} with length at least kk where αi\alpha_{i} appears at least kk times.

    In both cases, by applying the inverse of expansion (Figure 17) to the WW-arrows corresponding to each gisg_{is}, we obtain a WW-tree such that at least k+1k+1 ends belong to the same component of OO. Hence, by Theorem 3.12, OA=OABO_{A^{\prime}}=O_{A\cup B} and OAO_{A} are self WkW_{k}-equivalent.

4. Milnor invariants for surface-links

The content of this and the next chapters is taken from [3]. Milnor invariants can be defined for mm-dimensional links, which are mm-manifolds (smoothly embedded) in (m+2)(m+2)-space [3]. For simplicity, we explain the case m=2m=2. A 2-dimensional link often means spheres in 44-space. Milnor invariants introduced here vanish if the fundamental groups of the objects themelves are trivial. Here we consider oriented surfaces, not only spheres, in 44-space, and call them surface-links. It is possible to consider surfaces with boudary, mimicking string links, but to avoid complications we consider only closed surfaces.

4.1. Surface-link diagrams

As a classical link in 33-space can be drawn as a diagram in the plane, a surface-link in 44-space can be drawn as a diagram in 33-space, for example, see Figure 18. (The arrowed circle \circlearrowleft in the figure represents the surface orientation. When turning a right hand screw in the direction of \circlearrowleft, by specifying ‘front’ and ‘back’  of the surface so that the screw moves back to front, the ‘orientation’ of the surface can also be seen as a ‘specifying front/back’.) We note that, in the case of surface-links, the intersections of surfaces appear as curves, and over/under informations are added according to the arrangements in 44-space by cutting along ‘under-intersections’.

Refer to caption
Figure 18. A surface-link (surface-knot) diagram

In Figure 18, only ‘simple’ intersections of the surface appear as in the left side of Figure 19. But in general, as in the center of Figure 19, an intersection containing a point called a branch point may appear, and as shown on the right side of Figure 19, three surfaces may intersect, forming a triple point. On the other hand, it is known that by using these three types of intersections, any surface-link can be drawn in 3-space.111111There are two types of branch points, positive and negative, see Figure 23. A diagram drawn in this way is called a diagram of a surface-link.

As there is Reidemeister’s theorem for classical links, there is also the following theorem for surface-links. The local moves on diagrams of surface-links that correspond to Reidemeister moves of classical link diagrams are called Roseman moves.

Theorem 4.1.

(Roseman’s Theorem [38, 8, 9]) Two surface-links are equivalent (i.e., there is a continuous deformation of 4-space between them) if and only if their diagrams are deformed into each other by a combination of continuous deformations of 3-space and Roseman moves.

In general, by allowing the three kinds of intersections in Figure 19, (nn-component) surfaces drawn in 3-space are called (nn-component) surface-link diagrams. When n=1n=1, we often call them surface-knot diagrams. Figure 18 shows a surface-knot diagram. A surface-link diagram is trivial if it has no intersections.

A surface-link diagram LL can be separated into several regions by under-intersections. For example, the diagram in Figure 18 is separated into 5 regions A,B,C,D,EA,B,C,D,E. For an nn-component surface-link diagram LL and for each i(i=1,,n)i~{}(i=1,...,n), we choose a point pip_{i} on a region of the iith component. Then we call the pair (L,𝐩)(L,\mathbf{p}) of LL and 𝐩=(p1,,pn)\mathbf{p}=(p_{1},...,p_{n}) a based surface-link diagram. Two based surface-link diagrams are equivalent if one is deformed into the other by a combination of continuous deformations of 3-space and Roseman moves that do not contain base points.

Refer to caption
Refer to caption
Refer to caption
Figure 19. Intersections of diagrams

4.2. Groups of based surface-link diagrams

Let (L,𝐩)(L,\mathbf{p}) be a based surface-link diagram. We define the group G(L,𝐩)G(L,\mathbf{p}) of (L,𝐩)(L,\mathbf{p}) as follows. For the iith component of LL, let ai0a_{i0} be the region that contains the base point pip_{i}, and let ai1,,airia_{i1},...,a_{i{r_{i}}} be the other regions, where ri+1r_{i}+1 is the number of regions in KiK_{i}. (Unlike classical link diagrams, there are no rules for labeling the regions aij(j>0)a_{ij}~{}(j>0), and only the region ai0a_{i0} contains the base point pip_{i}.) Let F~\widetilde{F} be the free group generated by {aij}i,j\{a_{ij}\}_{i,j}. For each simple intersection of LL, we consider a relation zxz1y1zxz^{-1}{y}^{-1} as in Figure 20. The group G(L,𝐩)G(L,\mathbf{p}) of (L,𝐩)(L,\mathbf{p}) is the quotient group of the free group F~\widetilde{F} with a generating set {aij}i,j\{a_{ij}\}_{i,j} modulo these relations. It is known that G(L,𝐩)G(L,\mathbf{p}) is isomorphic to the fundamental group of the complement of the surface-link whose diagram is LL.

\begin{overpic}[width=119.50148pt]{Double+.pdf} \put(48.0,65.0){$x$} \put(48.0,15.0){$y$} \put(98.5,29.0){$z$} \end{overpic}
Figure 20. Relation zxz1y1(x,y,z{aij}ij){z}xz^{-1}{y}^{-1}~{}(x,y,z\in\{a_{ij}\}_{ij})

4.3. Nets of diagrams

In this section, we intuitively explain cut-diagrams of classical links and of surface-links. As we see below, cut-diagrams are ‘nets’ of diagrams.

4.3.1. Cut-diagrams of classical link diagrams

First, we explain cut diagrams of classical link diagrams. The diagram on the left side of Figure 21 is obtained from the circle on the right side by ‘gluing’ points in the arcs A,B,CA,B,C to the points \raisebox{-1.1pt}{$A$}⃝, \raisebox{-1.1pt}{$B$}⃝, \raisebox{-1.1pt}{$C$}⃝ respectively so that \raisebox{-1.1pt}{$A$}⃝, \raisebox{-1.1pt}{$B$}⃝, \raisebox{-1.1pt}{$C$}⃝ become under crossings, and the signs of crossings coincide with the signs of the points. From this observation, it can be seen that the circle on the right side of Figure 21 is a net of the diagram on the left side. We call such nets cut-diagrams of link diagrams. That is, a cut diagram of a link diagram is a set of circles with signed points, that correspond to under crossings and are labeled with arcs containing their over crossings.

Remark 4.2.

For the cut-diagram in Figure 21, let TT be a set of three WW-arrows αX(X=A,B,C)\alpha_{X}~{}(X=A,B,C) such that the tail of αX\alpha_{X} belongs to the arc XX and the head is on the point \raisebox{-1.1pt}{$X$}⃝. And let (O,T)(O,T) be an arrow presentation consisting of the trivial knot diagram OO and TT, where for each WW-arrow in αX\alpha_{X}, a small segment adjacent to the head is always assumed to be on the right side with respect to the orientation of OO, and the number of twists is 0 if the sign of the point XX is positive, or 1 otherwise. Then (O,T)(O,T) is an arrow presentation of the knot diagram on the left side of Figure 21. (In general, since TT may contain more than one WW-arrows whose tails belong the same arc, (O,T)(O,T) is not uniquely determined.) Likewise, from a cut-diagram of any link diagram, we obtain an arrow presentation on a trivial link diagram OO. For a link diagram LL, let (O,T)(O,T) be an arrow presentation obtained from a cut-diagram of LL, and let (O,T)(O,T^{\prime}) be an arrow presentation of LL obtained by the operations in Figure 11. Although the heads of TT and TT^{\prime} coincide, their tails may not coincide. On the other hand, thanks to AR7 (VR1-VR3 and AR6 if necessary), (O,T)(O,T) is equivalent to (O,T)(O,T^{\prime}), and hence it is an arrow presentation of LL. It follows that two link diagrams that have a common cut-diagram are equivalent as welded links.

Refer to caption
Refer to caption
Figure 21. A link (knot) diagram and its cut-diagram

4.3.2. Cut-diagrams of surface-link diagrams

By applying the idea of ‘net’  to surface-link diagrams, we obtain cut-diagrams of surface-link diagrams. The figure on the right side of Figure 22 is a cut-diagram of the surface-link diagram on the left side of Figure 22. In contrast to classical link diagrams, for surface-link diagrams, since the gluing parts are curves, the gluing is specified using oriented, labeled curves on surfaces that correspond to under-intersections.121212These gluing parts without labels are also called lower decker sets [9].

For example, in the cut-diagram on the right side of Figure 22, the curve with label DD between the regions AA and BB intersects the region DD and is oriented so that, in the gluing result (the left side of Figure 22),

(direction of back to front of D,direction of back to front of A(and B),orientation of \raisebox{-1.1pt}{$D$}⃝)(\text{direction of back to front of $D$},\text{direction of back to front of $A$(and $B$)},\text{orientation of $\text{\raisebox{-1.1pt}{$D$}⃝}$})

is equal to the right-handed spatial coordinate system

(direction of x-axis,direction of y-axis,direction of z-axis).(\text{direction of $x$-axis},\text{direction of $y$-axis},\text{direction of $z$-axis}).
Refer to caption
Refer to caption
Figure 22. A surface-link diagram (spherical-link diagram) and its cut-diagram

In general, surface-link diagrams may contain branch points and triple points. Then cut-diagrams have ‘local nets’  as illustrated in Figures 23 (resp. 24), which contain end points corresponding to the branch points (resp. classical crossings corresponding to the triple points).

Refer to caption net\begin{array}[]{c}\stackrel{{\scriptstyle\text{net}}}{{\longrightarrow}}\\[48.36958pt] {}\hfil\end{array} Refer to caption
Refer to caption net\begin{array}[]{c}\stackrel{{\scriptstyle\text{net}}}{{\longrightarrow}}\\[48.36958pt] {}\hfil\end{array} Refer to caption
Figure 23. Cut-diagrams (local nets) around branch points
Refer to caption net\begin{array}[]{c}\stackrel{{\scriptstyle\text{net}}}{{\longrightarrow}}\\[71.13188pt] {}\hfil\end{array} Refer to caption
Refer to caption net\begin{array}[]{c}\stackrel{{\scriptstyle\text{net}}}{{\longrightarrow}}\\[71.13188pt] {}\hfil\end{array} Refer to caption
Figure 24. Cut-diagrams (local nets) around triple points

4.4. Cut-diagrams

In the previous section, we defined cut-diagrams from (surface-)link diagrams. But, in this section, we define cut diagrams independently of (surface-)link diagrams.

4.4.1. 11-dimensional cut-diagrams

A cut diagram of an nn-component link diagram can be seen as a set SS of nn circles (11-dim) with signed points PP (0-dim) arranged on SS, where each point in PP is labeled by an arc of SPS-P. Here, instead of having cut-diagrams from link diagrams, we consider cut-diagrams independently of link diagrams, that are called 11-dimensional cut-diagrams. That is, an nn-component 1-dimensional cut-diagram is a triple (S,P,f)(S,P,f) consisting of a set SS of nn circles, a set of signed points PP on SS, and a map ff from a set of arcs of SPS-P to PP. For a cut-diagram C(=(S,P,f))C(=(S,P,f)), we can build a diagram from CC by gluing it. First, we locally glue only the crossings according to the correspondence of ff to create classical crossings, and then connect these crossings with corresponding arcs to complete the gluing. If CC is cut-diagram of a certain link diagram, then we can connect crossings so that the result is equal to the original link diagram. But, in general, when connecting crossings on a plane, new crossings may be necessary. In such cases, a virtual link diagram can be obtained by making the new crossings virtual crossings. Therefore, for any cut-diagram CC, by gluing it, we have a virtual link diagram LCL_{C}. Although LCL_{C} might not be uniquely determined, by the observation in Remark 4.2, it is unique up to welded moves. Since we can obtain a cut-diagram from any virtual link-diagram, we have the following sequence of surjections.

{virtual link diagrams}{cut-diagrams}{welded links}.\{\text{virtual link diagrams}\}\twoheadrightarrow\{\text{cut-diagrams}\}\twoheadrightarrow\{\text{welded links}\}.

While the surjection from cut-diagrams to welded links is not injective, it induces a bijection from a quotient of cut-diagrams modulo certain moves. Here these moves are just the direct translations of welded moves. In this sense, 1-dimensional cut diagrams can be seen as welded link diagrams.

4.4.2. 22-dimensional cut-diagrams

A cut-diagram of an nn-component surface-link diagram can be seen as a set Σ\Sigma of nn closed surfaces (22-dim) with oriented 1-dimensional diagram131313This is almost a link diagram but it may contain end points that correspond to branch pointsDD (1-dim), where each arc of DD is labeled by a region of ΣD\Sigma-D. Therefore we define 22-dimensional cut-diagrams independently of surface-link diagrams as a triple (Σ,D,f)(\Sigma,D,f) consisting of a set Σ\Sigma of nn closed surfaces, a 11-dimensional diagram DD on Σ\Sigma, and a map ff from the set of arcs of DD to the set of regions of ΣD\Sigma-D. Here, the map ff is defined so that ‘local gluing can be performed’ around each branch point and each triple point.141414For a detailed definition, see [3, Subsection 1.2.1]. For an arc α\alpha of DD, f(α)f(\alpha) is called the label of α\alpha. By putting a circle \raisebox{-1.1pt}{$A$}⃝ on α\alpha, we mean that the label f(α)f(\alpha) of α\alpha is AA.

Since 11-dimensional cut-diagrams can be regarded as welded links, 22-dimensional cut-diagrams can be considered as 2-dimensional generalization of welded links.

4.5. 22-dimensional cut-diagrams and groups

One important property of cut-diagrams is that they contain gluing information around the intersections. From this information, the group of the original surface-link diagram can be computed from the cut-diagram.

In the following, we define peripheral systems of (based) 2-dimensional cut-diagrams and their Milnor invariants, which induce Milnor invariants for surface-links. From now on, in this chapter, we only treat 2-dimensional cut-diagrams, unless otherwise specified, cut-diagrams always mean 22-dimensional.

4.5.1. Peripheral systems of based cut-diagrams

For an nn-component cut-diagram C=(Σ,D,f)C=(\Sigma,D,f), let Σi\Sigma_{i} be the iith component of Σ\Sigma, and let Di=ΣiDD_{i}=\Sigma_{i}\cap D. For each ii, let pip_{i} be a point on a region of ΣiDi\Sigma_{i}-D_{i}. Then the pair (C,𝐩)(C,\mathbf{p}) of CC and 𝐩=(p1,,pn)\mathbf{p}=(p_{1},...,p_{n}) is called a based cut-diagram.

We define the group G(C,𝐩)G(C,\mathbf{p}) of (C,𝐩)(C,\mathbf{p}) as follows. For ΣiDi\Sigma_{i}-D_{i}, let ai0a_{i0} be the region that contains the base point pip_{i}, and let ai1,,airia_{i1},...,a_{i{r_{i}}} be the other regions, where ri+1r_{i}+1 is the number of regions in ΣiDi\Sigma_{i}-D_{i}. Let F~\widetilde{F} be the free group generated by {aij}i,j\{a_{ij}\}_{i,j}. For each arc of DD, we consider a relation zxz1y1zxz^{-1}{y}^{-1} as in Figure 25. The group G(C,𝐩)G(C,\mathbf{p}) of (C,𝐩)(C,\mathbf{p}) is the quotient group of the free group F~\widetilde{F} with generating set {aij}i,j\{a_{ij}\}_{i,j} modulo these relations. If (C,𝐩)(C,\mathbf{p}) is a cut-diagram of a based surface-link diagram (L,𝐩)(L,\mathbf{p}), then G(C,𝐩)G(C,\mathbf{p}) is equal to the group G(L,𝐩)G(L,\mathbf{p}) defined in Section 4.2. (Since G(C,𝐩)G(C,\mathbf{p}) is independent of the choice of 𝐩\mathbf{p}, G(C):=G(C,𝐩)G(C):=G(C,\mathbf{p}) is called the group of the cut-diagram CC.)

\begin{overpic}[width=71.13188pt]{relation-cut.pdf} \put(33.0,50.0){$x$} \put(33.0,15.0){$y$} \put(13.0,33.5){$z$} \end{overpic}
Figure 25. Relation zxz1y1(x,y,z{aij}ij)zxz^{-1}y^{-1}~{}(x,y,z\in\{a_{ij}\}_{ij})

For an oriented loop ll on Σi\Sigma_{i} with base point pip_{i}, we define an element w(l)w(l) in G(C,𝐩)G(C,\mathbf{p}) as follows. Let u1,,ul(i)u_{1},...,u_{l(i)} be the sequence of labels of the arcs in DiD_{i} that appear in order, when traveling along ll from pip_{i} following the orientation. While traveling around ll on the front side of Σi\Sigma_{i}, we define ε(j)=+1\varepsilon(j)=+1 if uju_{j} crosses from left to right, ε(j)=1\varepsilon(j)=-1 if uju_{j} crosses from right to left. Then we set

w(l)=ai0wiu1ε(1)u2ε(2)ul(i)ε(l(i))F~,w(l)=a_{i0}^{-w_{i}}u_{1}^{\varepsilon(1)}u_{2}^{\varepsilon(2)}\cdots u_{l(i)}^{\varepsilon(l(i))}\in\widetilde{F},

where wiw_{i} is the sum of signs ε(s)\varepsilon(s) for usDiu_{s}\subset D_{i}.

Lemma 4.3.

If two loops ll and ll^{\prime} with base points pip_{i} represent the same element of π1(Σi,pi)\pi_{1}(\Sigma_{i},p_{i}), then w(l)w(l) and w(l)w(l^{\prime}) are equal as elements of G(C,𝐩)G(C,\mathbf{p}).151515By this lemma, the correspondance lw(l)l\mapsto w(l) induces a map π1(Σi,pi)G(C,𝐩)\pi_{1}(\Sigma_{i},p_{i})\longrightarrow G(C,\mathbf{p}). Moreover we have that the map is a homomorphism.

By this lemma, for a loop ll representing an element π1(Σi,pi)\pi_{1}(\Sigma_{i},p_{i}), w(l)w(l) can be seen as an element of G(C,𝐩)G(C,\mathbf{p}). For each ii, we call ai0a_{i0} the iith meridian, and we call

Λi:={w(l)|l represents a nontrivial element of π1(Σi,pi)}\Lambda_{i}:=\{w(l)~{}|~{}\text{$l$ represents a nontrivial element of $\pi_{1}(\Sigma_{i},p_{i})$}\}

the iith longitude set of (C,𝐩)(C,\mathbf{p}). The pair (G(C,𝐩),{ai0,Λi}i)(G(C,\mathbf{p}),\{{a_{i0}},\Lambda_{i}\}_{i}) is called the peripheral system of (C,𝐩)(C,\mathbf{p}).

Let {lij|j=1,,2gi}\{l_{ij}~{}|~{}j=1,...,2g_{i}\} be a set of loops on Σi\Sigma_{i} with base points pip_{i} that represent generators of π1(Σi,pi)\pi_{1}(\Sigma_{i},p_{i}), and set Λi0:={w(lij)|j=1,,2gi}\Lambda^{0}_{i}:=\{w(l_{ij})~{}|~{}j=1,...,2g_{i}\}, where 2gi2g_{i} is the minimum number of generators of π1(Σi,pi)\pi_{1}(\Sigma_{i},p_{i}), i.e., gig_{i} is the genus of Σi\Sigma_{i}. By Lemma 4.3, any element in Λi\Lambda_{i} can be written as a product of elements in Λi0\Lambda_{i}^{0}. We call Λi0\Lambda_{i}^{0} an iith longitude system.

4.6. Milnor invariants of 22-dimensional cut-diagrams

In this sction, we define Milnor invariants for cut-diagrams, and also Milnor invariants for surface-links.

Let N~\widetilde{N} be the normal closure of F~\widetilde{F} that contains the relations of (the group presentation of) G(C,𝐩)G(C,\mathbf{p}), and let Nq(C,𝐩)=G(C,𝐩)/ΓqG(C,𝐩)N_{q}(C,\mathbf{p})=G(C,\mathbf{p})/\Gamma_{q}G(C,\mathbf{p}). By composing the following sequence

F~F~/N~=G(C,𝐩)Nq(C,𝐩)\widetilde{F}\twoheadrightarrow\widetilde{F}/\widetilde{N}=G(C,\mathbf{p})\twoheadrightarrow N_{q}(C,\mathbf{p})

of maps, we have a map

ξq:F~Nq(C,𝐩).\xi_{q}:\widetilde{F}\longrightarrow N_{q}(C,\mathbf{p}).

It is known that Nq(C,𝐩)N_{q}(C,\mathbf{p}) is a nilpotent group generated by ξq(ai0)=αi(i=1,,n)\xi_{q}(a_{i0})=\alpha_{i}~{}(i=1,...,n).

In the Magnus expansion of ξq(w(l))\xi_{q}(w(l)), let μ(C,𝐩)(i1,,is;l)(s<q)\mu_{(C,\mathbf{p})}(i_{1},...,i_{s};l)~{}(s<q) be the coefficient of Xi1XisX_{i_{1}}\cdots X_{i_{s}}. For sequences IiIi and JJ with length at most qq, we define

m(C,𝐩)(Ii):=gcd{μ(C,𝐩)(I;lij)|j=1,,2gi}m_{(C,\mathbf{p})}(Ii):=\gcd\{\mu_{(C,\mathbf{p})}(I;l_{ij})~{}|~{}j=1,...,2g_{i}\}

and

Δ(C,𝐩)(J):=gcd{m(C,𝐩)(J)J is a sequence obtained from J by deleting at least one index and permuting the resulting sequence cyclicly}.\Delta_{(C,\mathbf{p})}(J):=\gcd\left\{m_{(C,\mathbf{p})}(J^{\prime})~{}\vline~{}\begin{array}[]{l}J^{\prime}\textrm{ is a sequence obtained from $J$ by deleting at least }\\ \textrm{one index and permuting the resulting sequence cyclicly}\end{array}\right\}.

Then we have the following theorem.

Theorem 4.4.

For any sequences IiIi and JJ of length at most qq, both Δ(C,𝐩)(J)\Delta_{(C,\mathbf{p})}(J) and gcd{m(C,𝐩)(Ii),Δ(C,𝐩)(Ii)}\gcd\{m_{(C,\mathbf{p})}(Ii),\Delta_{(C,\mathbf{p})}(Ii)\} are invariants of CC. In particular they are independent of the choice of 𝐩\mathbf{p}.

We define

νC(Ii):=gcd{m(C,𝐩)(Ii),Δ(C,𝐩)(Ii)}.\nu_{C}(Ii):=\gcd\{m_{(C,\mathbf{p})}(Ii),\Delta_{(C,\mathbf{p})}(Ii)\}.

As for link diagrams, since the condition s<qs<q is not essential, by Theorem 4.4, we have the invariants νC(I)\nu_{C}(I) for all sequences II, and call them Milnor invariants of the cut-diagram CC.

For a surface-link LL, let CC be a cut-diagram obtained from a diagram of LL. For a sequence II, we define

νL(I):=νC(I).\nu_{L}(I):=\nu_{C}(I).

Then we have the following theorem.

Theorem 4.5.

If two surface-link diagrams of LL and LL^{\prime} are deformed into each other by Roseman moves, then νL(I)=νL(I)\nu_{L}(I)=\nu_{L^{\prime}}(I) for any sequence II.

This theorem implies that νL(I)\nu_{L}(I) of all II are invariants of LL. We call the invariants Milnor invariants of LL.

4.7. Based cut-diagrams and Chen map

In this section, we explain how to calculate Milnor invariants of 2-dimensional cut-diagrams.

Let (C,𝐩)(C=(Σ,D,f))(C,\mathbf{p})~{}(C=(\Sigma,D,f)) be a based cut-diagram. For each region aija_{ij} on the iith component Σi\Sigma_{i} of Σ\Sigma, we choose an oriented curve γij\gamma_{ij} from pip_{i} to a point pijp_{ij} in aija_{ij}.

While running the curve γij\gamma_{ij} from pip_{i} to pijp_{ij}, we obtain a word vijv_{ij} by arranging the labels of arcs, powered by its sign, that appear in order, where the signs are defined in Section 4.5.

Let FF be the free group generated by ai0=αi(i=1,,n)a_{i0}=\alpha_{i}~{}(i=1,...,n). For a positive integer qq, by using {vij}ij\{v_{ij}\}_{ij} above, we inductively define a homomorphism

ηq=ηq(C,𝐩):F~F\eta_{q}=\eta_{q}(C,\mathbf{p}):\widetilde{F}\longrightarrow F

as follows.161616The idea of this map was inspired by Chen’s paper [10].

(i)η1(aij)=αi;(ii)ηq+1(ai0)=αi,ηq+1(aij)=ηq(vij1)αiηq(vij)(1jri).(\mathrm{i})~{}\eta_{1}(a_{ij})=\alpha_{i};~{}~{}~{}(\mathrm{ii})~{}\eta_{q+1}(a_{i0})=\alpha_{i},~{}\eta_{q+1}(a_{ij})=\eta_{q}(v_{ij}^{-1})\alpha_{i}\eta_{q}(v_{ij})\hskip 10.00002pt(1\leq j\leq r_{i}).

We call the map ηq\eta_{q} a Chen map of (C,𝐩)(C,\mathbf{p}). The map ηq\eta_{q} is different from the case of link diagrams, and it depends on the choices of not only base points but also the curves {γij}ij\{\gamma_{ij}\}_{ij}.

Lemma 2.5 (1) holds for ηq(C,𝐩)\eta_{q}(C,\mathbf{p}) as well. Moreover, the following theorem holds.

Theorem 4.6.
  1. (1)

    The Chen map ηq(C,𝐩)\eta_{q}(C,\mathbf{p}) induces the following isomorphism.

    Nq(C,𝐩)α1,,αn|{[αi,ηq(w(lij))]|i=1,,n,j=1,,2gi},ΓqF.N_{q}(C,\mathbf{p})\cong\langle\alpha_{1},\ldots,\alpha_{n}~{}|~{}\{[\alpha_{i},\eta_{q}(w(l_{ij}))]~{}|~{}i=1,...,n,~{}j=1,...,2g_{i}\},\Gamma_{q}F\rangle.
  2. (2)

    For any loop ll with base point pip_{i}, ξq(w(l))=ηq(w(l))WΓqF\xi_{q}(w(l))=\eta_{q}(w(l)){W\Gamma_{q}F}, where WW is the normal closure of FF that contains {[αi,ηq(w(lij))]|i=1,,n,j=1,,2gi}\{[\alpha_{i},\eta_{q}(w(l_{ij}))]~{}|~{}i=1,...,n,~{}j=1,...,2g_{i}\}.

By Theorem 4.6 (2), it can be seen that Milnor invariants of CC are obtained by replacing ξq(w(l))\xi_{q}(w(l)) with ηq(w(l))\eta_{q}(w(l)) in the definition. Hence, ηq\eta_{q} gives Milnor invariants of cut-diagrams.

5. Further generalization

For any positive integer mm, we define mm-dimensional cut-diagrams, and their equivalence relation, cut-concordance, which corresponds to a generalization of the usual link concordance for mm-dimensional links.

5.1. mm-dimensional cut-diagrams and cut-concordance

For a diagram171717See [39], [40], or [37]. YY of compact (m1)(m-1)-manifold in a compact mm-manifold XX, we consider a map

f:{ regions of Y}{ regions of XY}f:\{\text{~{}regions of $Y$}\}\longrightarrow\{\text{~{}regions of $X-Y$}\}

that satisfies ‘certain gluing conditions’.181818For the detailed definition, see [3]. Here ‘regions of YY’ correspond to arcs in diagrams in the case of 22-dimensional cut-diagrams. We call the triple (X,Y,f)(X,Y,f) an mm-dimensional cut-diagram.

Let XX be a closed mm-manifold.191919It is not necessary that XX is closed. But for simplicity we assume that. Two mm-dimensional cut-diagrams C0=(X,Y0,f0)C_{0}=(X,Y_{0},f_{0}) and C1=(X,Y1,f1)C_{1}=(X,Y_{1},f_{1}) are cut-concordant if there is an (m+1)(m+1)-dimensional cut-diagram C=(X×[0,1],Y,f)C=(X\times[0,1],Y,f) that satisfies the following two conditions for each ε(=0,1)\varepsilon(=0,1):

  1. (1)

    There is an orientation preserving diffeomorphism ψε:XX×{ε}\psi_{\varepsilon}:X\longrightarrow X\times\{\varepsilon\} such that ψε(Yε)=Y(X×{ε})\psi_{\varepsilon}(Y_{\varepsilon})=Y\cap\big{(}X\times\{\varepsilon\}\big{)}.

  2. (2)

    The following diagram commutes:

{ regions of Yε}\textstyle{\{\text{~{}regions of $Y_{\varepsilon}$}\}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}fε\scriptstyle{f_{\varepsilon}}ψεYε\scriptstyle{\psi_{\varepsilon}^{Y_{\varepsilon}}}{ regions of XYε}\textstyle{~{}~{}\{\text{~{}regions of $X-Y_{\varepsilon}$}\}~{}~{}~{}~{}~{}~{}~{}~{}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}ψεXYε\scriptstyle{\psi_{\varepsilon}^{X-Y_{\varepsilon}}}{ regions of Y}\textstyle{\{\text{~{}regions of $Y$}\}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}f\scriptstyle{f}{ regions of (X×[0,1])Y}.\textstyle{\{\text{~{}regions of $(X\times[0,1])-Y$}\}.}

Here ψεYε\psi_{\varepsilon}^{Y_{\varepsilon}} (resp. ψεXYε\psi_{\varepsilon}^{X-Y_{\varepsilon}}) is a map induced by ψε\psi_{\varepsilon}. The condition (1) implies that Y0XY_{0}\subset X and Y1XY_{1}\subset X cobound YX×[0,1]Y\subset X\times[0,1], and the condition (2) implies that the gluing on C0C_{0} and C1C_{1} can be extended to the gluing on CC.

The cut-concordance is an equivalence relation on cut-diagrams. This is a generalization of link concordance on mm-dimensional links, that are embedded mm-manifolds in the (m+2)(m+2)-space. In fact, the following proposition holds.

Proposition 5.1.

If two mm-dimensional links LL and LL^{\prime} are link concordant, then two cut-diagrams obtained from link diagrams of LL and LL^{\prime} are cut-concordant.

5.2. Milnor invariants for higher dimensional links.

For an mm-dimensional cut-diagram C=(X,Y,f)(m2)C=(X,Y,f)~{}(m\geq 2), the Milnor invariants νC(I)\nu_{C}(I) can be defined in the same way as for m=2m=2. When m=1m=1, as mentioned in Subsection 4.4.1, the virtual link LCL_{C} obtained from CC is uniquely determined as a welded link. Threfore we define μ¯C(I):=μ¯LC(I)\overline{\mu}_{C}(I):=\overline{\mu}_{L_{C}}(I). Then we have the following theorem.

Theorem 5.2.

If two mm-dimensional cut-diagrams CC and CC^{\prime} are cut-concordant, then for any sequence II, the following (1) and (2) hold.

(1) μ¯C(I)=μ¯C(I)\overline{\mu}_{C}(I)=\overline{\mu}_{C^{\prime}}(I) if m=1m=1,        (2) νC(I)=νC(I)\nu_{C}(I)=\nu_{C^{\prime}}(I) if m2m\geq 2.

Let CC be a cut-diagram obtained from a diagram of an mm-dimensional link L(m2)L~{}(m\geq 2). For any sequence II, we define

νL(I):=νC(I).\nu_{L}(I):=\nu_{C}(I).

Then by Proposition 5.1 and Theorem 5.2 we have the following corollary.

Corollary 5.3.

If two mm-dimensional links LL and LL^{\prime} are link concordant, then for any sequence II, the following (1) and (2) hold.

(1) μ¯L(I)=μ¯L(I)\overline{\mu}_{L}(I)=\overline{\mu}_{L^{\prime}}(I) if m=1m=1,        (2) νL(I)=νL(I)\nu_{L}(I)=\nu_{L^{\prime}}(I) if m2m\geq 2.

This implies that for an mm-dimensional link L(m2L~{}(m\geq 2), νL(I)\nu_{L}(I) is a link concordance invariant of LL. We call νL(I)\nu_{L}(I) a Milnor invariant of the mm-dimensional link LL.

References

  • [1] B. Audoux, P. Bellingeri, J.-B. Meilhan and E. Wagner, Homotopy classification of ribbon tubes and welded string links, Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 17 (2017), no. 2, 713–761.
  • [2] B. Audoux and J.B. Meilhan, Characterization of the reduced peripheral system of links, to appear in J. Inst. Math. Jussieu.
  • [3] B. Audoux, J.B. Meilhan and A. Yasuhara, Milnor concordance invariants for knotted surfaces and beyond, preprint.
  • [4] B. Audoux, J.B. Meilhan and A. Yasuhara, kk-reduced groups and Milnor invariants, to appear in Math. Research Letters
  • [5] H.U. Boden and M. Chrisman, Virtual concordance and the generalized Alexander polynomial, J. Knot Theory Ramifications 30, (2021) Paper No. 2150030, 35 pp.
  • [6] A.J. Casson, Link cobordism and Milnor’s invariant, Bull. London Math. Soc. 7 (1975), 39–40.
  • [7] J.S. Carter, S. Kamada and M. Saito, Stable equivalence of knots on surfaces and virtual knot cobordisms, J. Knot Theory Ramifications 11(2002), 311–322.
  • [8] J. S. Carter and M. Saito, Reidemeister moves for surface isotopies and their interpretation as moves to movies, J. Knot Theory Ramifications 2 (1993), 251–284.
  • [9] J. S. Carter and M. Saito, Knotted surfaces and their diagrams, Mathematical Surveys and Monographs, 55 Providence, RI: American Mathematical Society, 1998.
  • [10] K.T. Chen, it Commutator calculus and link invariants, Proc. Amer. Math. Soc., 3 (1952), 44—45.
  • [11] M. Chrisman, Milnor’s concordance invariants for knots on surfaces, Algebr. Geom. Topol. 22 (2022), 2293–2353.
  • [12] T. Cochran, Derivatives of links: Milnor’s concordance invariants and Massey’s products, Mem. Amer. Math. Soc. 84 (1990), no. 427, x+73 pp.
  • [13] B. Colombari, A diagrammatic characterization of Milnor invariants, preprint.
  • [14] J. Conant, R. Schneiderman and P. Teichner, Whitney tower concordance of classical links, Geom. Topol. 16 2012, 1419–1479.
  • [15] R. Fenn, Techniques of geometric topology, London Mathematical Society Lecture Note Series, 57, Cambridge University Press, Cambridge, 1983.
  • [16] R. Fenn, R. Rimányi and C. Rourke, The braid-permutation group, Topology 36 (1997), no. 1, 123–135.
  • [17] T. Fleming and A. Yasuhara, Milnor’s invariants and self CkC_{k}-equivalence, Proc. Amer. Math. Soc. 137 (2009) 761–770.
  • [18] R.Gaudreau, Classification of virtual string links up to cobordism, Ars Math. Contemp. 19(2020) 37–49.
  • [19] M. Goussarov, M. Polyak and O. Viro, Finite-type invariants of classical and virtual knots, Topology 39 (2000), 1045–1068.
  • [20] N. Habegger and X.S. Lin, The classification of links up to link-homotopy, J. Amer. Math. Soc. 3 (1990), 389–419.
  • [21] K. Habiro, Claspers and finite type invariants of links, Geom. Topol. 4 (2000), 1–83.
  • [22] L. H. Kauffman, Virtual knot theory, European J. Combin. 20 (1999), no. 7, 663–690.
  • [23] A. Kawauchi, A survey of Knot Theory, Translated and revised from the 1990 Japanese original by the author. Birkhäuser Verlag, Basel, 1996.
  • [24] Y. Kotorii, The Milnor μ¯\overline{\mu} invariants and nanophrases, J. Knot Theory Ramifications 22 (2013), no. 2, 1250142, 28 pp.
  • [25] O. Kravchenko and M. Polyak, Diassociative algebras and Milnor’s invariants for tangles, Lett. Math. Phys. 95 (2011), no. 3, 297–316.
  • [26] W.Magnus, A. Karrass and D. Solitar, Combinatorial group theory : presentations of groups in terms of generators and relations, Dover books on advanced mathematics, Dover, New York, 1976.
  • [27] J.B. Meilhan, Linking number and Milnor invariants Encyclopedia of Knot Theory, Taylor & Francis, (2021), Chapter 83.
  • [28] J.B. Meilhan and A. Yasuhara, Characterization of finite type string link invariants of degree <5<5, Math. Proc. Cambridge Philos. Soc. 148 (2010) 439–472
  • [29] J.B. Meilhan and A. Yasuhara, Arrow calculus for welded and classical links, Algebr. Geom. Topol. 19 (2019), 397–456.
  • [30] J.B. Meilhan and A. Yasuhara, Link concordances as surfaces in 4-space and the 4-dimensional Milnor invariants, Indiana Univ. Math. J. 71 (2022), 2647–2669.
  • [31] J. Milnor, Link groups, Ann. of Math. (2) 59 (1954), 177—195.
  • [32] J. Milnor, Isotopy of links, Algebraic geometry and topology, A symposium in honor of S. Lefschetz, Princeton University Press, Princeton, N. J., (1957), 280–306.
  • [33] H.A. Miyazawa, K. Wada and A. Yasuhara, Combinatorial Approach to Milnor Invariants of Welded Links, Michigan Math. J. 73 (2023), 141–170.
  • [34] K. Murasugi, Nilpotent coverings of links and Milnor’s invariant, Low dimensional topology, 3rd Topology Semin. Univ. Sussex 1982, Lond. Math. Soc. Lect. Note Ser. 95 (1985), 106–142.
  • [35] V.G. Turaev, The Milnor invariants and Massey products, Zap. Nauchn. Sem. LOMI, 66 (1976), 189–203.
  • [36] R. Porter, The Milnor’s μ¯\overline{\mu}-invariants and Massey products, Trans. Amer. Math. Soc. 284(1984), 40–424.
  • [37] J.H. Przytycki and W. Rosicki, Cocycle invariants of codimension 2 embeddings of manifolds, Knots in Poland III. Proceedings of the 3rd conference, Warsaw, Poland, July 18–25, 2010 and Bȩdlewo, Poland, July 25 – August 4, 2010, (2014) 251–289.
  • [38] D. Roseman, Reidemeister-type moves for surfaces in four-dimensional space, Knot theory, Proceedings of the mini-semester, Warsaw, Poland, 1995, (1998), 347–380.
  • [39] D. Roseman, Projections of codimension two embeddings, Knots in Hellas ’98. Proceedings of the international conference on knot theory an its ramifications, European Cultural Centre of Delphi, Greece, August 7–15, 1998,World Scientific, (2000) 380–410.
  • [40] D. Roseman, Elementary moves for higher dimensional knots, Fundam. Math. bf 184, (2004) 291–310.
  • [41] J. Stallings, Homology and central series of groups, J. Algebra, 2 (1965), 170–181.
  • [42] T.W. Tucker, Boundary-reducible 33-manifolds and Waldhausen’s theorem, Michigan Math.J. 20 (1973), 321 – 327.
  • [43] Y. Takabatake, T. Kuboyama, H. Sakamoto, stringcmp:Faster calculation for Milnor invariant, available at https://code.google.com/archive/p/stringcmp/
  • [44] A. Yasuhara, Classification of string links up to self delta-moves and concordance, Alg. Geom. Topol. 9 (2009), 265–275.
  • [45] A. Yasuhara, Self Delta-equivalence for Links Whose Milnor’s Isotopy Invariants Vanish, Trans. Amer. Math. Soc. 361 (2009), 4721–4749.