ScalingStacks

[0MIE]

Remark 5.5. Unwinding the functor ϕnk\phi_{n}^{k} in the argument above, one finds that the product in the category Corrnk\corr_{n}^{k} may be written recursively in the following manner:

(X0,X1,F)×(Y0,Y1,G)≅(X0×Y0,X1×Y1,F⊗G)(X_{0},X_{1},F)\times(Y_{0},Y_{1},G)\cong(X_{0}\times Y_{0},X_{1}\times Y_{1},F\otimes G)

where F⊗GF\otimes G is defined as the composite:

(X0×Y0)op×(X1×Y1)≅(X0op×X1)×(Y0op×Y1)⟶(F,G)Corrn−1k−1×Corrn−1k−1⟶×Corrn−1k−1.(X_{0}\times Y_{0})^{\mathrm{op}}\times(X_{1}\times Y_{1})\cong(X_{0}^{\mathrm{op}}\times X_{1})\times(Y_{0}^{\mathrm{op}}\times Y_{1})\stackrel{{\scriptstyle(F,G)}}{{\longrightarrow}}\corr_{n-1}^{k-1}\times\corr_{n-1}^{k-1}\stackrel{{\scriptstyle\times}}{{\longrightarrow}}\corr_{n-1}^{k-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