ScalingStacks

0NAJ

Proposition 3.13. The filtration-preserving components of the chain maps

R​3+:⟦L+i⟧→⟦L+i+1⟧andR​3−:⟦L−i⟧→⟦L−i+1⟧R3_{+}\colon\left\llbracket L^{i}_{+}\right\rrbracket\to\left\llbracket L^{i+1}_{+}\right\rrbracket\quad\text{and}\quad R3_{-}\colon\left\llbracket L^{i}_{-}\right\rrbracket\to\left\llbracket L^{i+1}_{-}\right\rrbracket

agree if 1≤i<x−11\leq i<x-1. More precisely, we have

R​3+​(W+i,W+i+1)=R​3−​(W−i,W−i+1)R3_{+}(W^{i}_{+},W^{i+1}_{+})=R3_{-}(W^{i}_{-},W^{i+1}_{-})

for pairs of corresponding webs W±iW^{i}_{\pm} in ⟦L±i⟧\left\llbracket L^{i}_{\pm}\right\rrbracket and W±i+1W^{i+1}_{\pm} in ⟦L±i+1⟧\left\llbracket L^{i+1}_{\pm}\right\rrbracket with grext​(W±i)=grext​(W±i+1)\mathrm{gr}_{\mathrm{ext}}(W^{i}_{\pm})=\mathrm{gr}_{\mathrm{ext}}(W^{i+1}_{\pm}).

0NAK

Proof. By inspecting (3.3) and (3.4) — for each of the 1+9+9+1 components of the R​3+R3_{+} chain map, check that the corresponding component of the R​3−R3_{-} chain map is the same (recalling y=0y=0). ∎

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