ScalingStacks

0NA9

Definition 3.7. If i∈{0,1,⋯,x}i\in\{0,1,\cdots,x\}, ϵ∈{+,−}\epsilon\in\{+,-\}, s∈{p,t}2​ns\in\{p,t\}^{2n}, o∈{p,t}o\in\{p,t\} and τ∈{p,t}M\tau\in\{p,t\}^{M}, we will use Wϵi​(τ,o,s)W_{\epsilon}^{i}(\tau,o,s) or Wϵi​(τ,o)W_{\epsilon}^{i}(\tau,o) to denote the web in ⟦Lϵi⟧\left\llbracket L_{\epsilon}^{i}\right\rrbracket with indexing data (τ,o,s)(\tau,o,s) or (τ,o)(\tau,o), as appropriate. Analogously, we write W⁡(τ)W(\tau) and W′​(τ)W^{\prime}(\tau) for τ\tau-indexed webs in ⟦L⟧\left\llbracket L\right\rrbracket and ⟦L′⟧\left\llbracket L^{\prime}\right\rrbracket respectively. If the indexing data is fixed, we will sometimes omit it from the notation (e.g. W±i=W±i​(τ,o,s)W^{i}_{\pm}=W^{i}_{\pm}(\tau,o,s) and W=W⁡(τ)W=W(\tau)) and say that the webs W+iW^{i}_{+} and W−iW^{i}_{-} correspond to each other.

If ff is a chain map and VV and WW are webs in the source and target complexes, then we write f⁡(V,W)f(V,W) for the component of ff from VV to WW.

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