ScalingStacks

[0MIB]

Definition 5.3. Define Corrn0:=Gauntn\corr_{n}^{0}\mathrel{\mathop{:}}=\gaunt_{n}, and for k>0k>0, define Corrnk\corr_{n}^{k} recursively as follows. The objects are triples (X0,X1,F)(X_{0},X_{1},F) consisting of two gaunt nn-categories X0X_{0} and X1X_{1} and a functor

F:X0op×X1→Corrn−1k−1.F\colon X_{0}^{\mathrm{op}}\times X_{1}\to\corr_{n-1}^{k-1}.

(Here op=ρ⁡(1,0,…,0)\mathrm{op}=\rho(1,0,\dots,0) is the opposite obtained by reversing just the 1-morphisms of X0X_{0}.) A morphism (X0,X1,F)→(Y0,Y1,G)(X_{0},X_{1},F)\to(Y_{0},Y_{1},G) is a triple (f0,f1,α)(f_{0},f_{1},\alpha) consisting of functors f0:X0→Y0f_{0}\colon X_{0}\to Y_{0} and f1:X1→Y1f_{1}\colon X_{1}\to Y_{1} and a natural transformation

α:F→G∘(f0op×f1).\alpha\colon F\to G\circ(f_{0}^{\mathrm{op}}\times f_{1}).

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

Clark Barwick, Christopher Schommer-Pries

Original source: arXiv:1112.0040v6

Original source · 1112.0040v6