ScalingStacks

Fix an almost closure TT of a braid word β\beta for [β]∈Brn+1[\beta]\in\mathrm{Br}_{n+1}. We call the right-hand closure LL and the left-hand closure L′L^{\prime}. We consider the following movies of intermediate diagrams and their associated chain maps between Khovanov–Rozansky complexes.

(3.1) β\betaβ\betaβ\beta⋯{\lx@inpgf@ignorespaces\cdots}β\betaβ\betaβ\beta⟦L+0⟧{\lx@inpgf@ignorespaces\left\llbracket L^{0}_{+}\right\rrbracket}⟦L+1⟧{\lx@inpgf@ignorespaces\left\llbracket L^{1}_{+}\right\rrbracket}⋯{\lx@inpgf@ignorespaces\cdots}⟦L+x−1⟧{\lx@inpgf@ignorespaces\left\llbracket L^{x-1}_{+}\right\rrbracket}⟦L+x⟧{\lx@inpgf@ignorespaces\left\llbracket L^{x}_{+}\right\rrbracket}⟦L⟧{\lx@inpgf@ignorespaces\left\llbracket L\right\rrbracket}⟦L′⟧{\lx@inpgf@ignorespaces\left\llbracket L^{\prime}\right\rrbracket}⟦L−0⟧{\lx@inpgf@ignorespaces\left\llbracket L^{0}_{-}\right\rrbracket}⟦L−1⟧{\lx@inpgf@ignorespaces\left\llbracket L^{1}_{-}\right\rrbracket}⋯{\lx@inpgf@ignorespaces\cdots}⟦L−x−1⟧{\lx@inpgf@ignorespaces\left\llbracket L^{x-1}_{-}\right\rrbracket}⟦L−x⟧{\lx@inpgf@ignorespaces\left\llbracket L^{x}_{-}\right\rrbracket}.R​1±\scriptstyle{\lx@inpgf@ignorespaces R1_{\pm}}R​2±\scriptstyle{\lx@inpgf@ignorespaces R2_{\pm}}R​3±\scriptstyle{\lx@inpgf@ignorespaces R3_{\pm}}R​3±\scriptstyle{\lx@inpgf@ignorespaces R3_{\pm}}R​2±−1\scriptstyle{\lx@inpgf@ignorespaces R2^{-1}_{\pm}}R​1±−1\scriptstyle{\lx@inpgf@ignorespaces R1^{-1}_{\pm}}R​2+\scriptstyle{\lx@inpgf@ignorespaces R2_{+}}R​3+\scriptstyle{\lx@inpgf@ignorespaces R3_{+}}R​3+\scriptstyle{\lx@inpgf@ignorespaces R3_{+}}R​2+−1\scriptstyle{\lx@inpgf@ignorespaces R2^{-1}_{+}}R​1+−1\scriptstyle{\lx@inpgf@ignorespaces R1^{-1}_{+}}R​1+\scriptstyle{\lx@inpgf@ignorespaces R1_{+}}R​1−\scriptstyle{\lx@inpgf@ignorespaces R1_{-}}R​2−\scriptstyle{\lx@inpgf@ignorespaces R2_{-}}R​3−\scriptstyle{\lx@inpgf@ignorespaces R3_{-}}R​3−\scriptstyle{\lx@inpgf@ignorespaces R3_{-}}R​2−\scriptstyle{\lx@inpgf@ignorespaces R2_{-}}R​1−−1\scriptstyle{\lx@inpgf@ignorespaces R1_{-}^{-1}}

In the first row, the ±\pm signs indicate the two versions of this movie, in which the horizontal strand passes in front of (++) or behind (−-) TT. We denote the composition along the top by sw+\mathrm{sw}_{+} and the composition along the bottom by sw−\mathrm{sw}_{-}. In either case we first see a Reidemeister I move (denoted by R​1±R1_{\pm}), then a composite of Reidemeister II moves (denoted by R​2±R2_{\pm}), a number of Reidemeister III moves (each denoted by R​3±R3_{\pm}), a composite of inverse Reidemeister II moves (R​2±−1R2^{-1}_{\pm}), and finally an inverse Reidemeister I move (R​1±−1R1^{-1}_{\pm}). Our goal is to show that, after making careful use of the freedom, described later, to choose up-to-homotopy representatives of the chain maps for Reidemeister III moves, we have the following:

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Scott Morrison, Kevin Walker, Paul Wedrich

Original source: arXiv:1907.12194v5