ScalingStacks

0NN7

Definition 7.5. Write Arn1,…,nq\Ar_{n_{1},\dotsc,n_{q}} for Ar⁡[n1]×⋯×Ar⁡[nq]\Ar[n_{1}]\times\dotsb\times\Ar[n_{q}]. For a functor

A:N⁡(Arn1,…,nq)=N⁡(Ar⁡[n1]×⋯×Ar⁡[nq])⟶𝒞,A\colon\mathrm{N}(\Ar_{n_{1},\dotsc,n_{q}})=\mathrm{N}(\Ar[n_{1}]\times\dotsb\times\Ar[n_{q}])\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}{\mathcal{C}},

we write Ai1,j1;…;iq,jqA_{i_{1},j_{1};\dotsc;i_{q},j_{q}} for the value of AA on the object ((i1,j1),…,(iq,jq))((i_{1},j_{1}),\dotsc,(i_{q},j_{q})). Let Gap⁡(([n1],…,[nq]),𝒞)\Gap(([n_{1}],\dotsc,[n_{q}]),{\mathcal{C}}) be the full subcategory of Fun⁡(N⁡(Arn1,…,nq),𝒞)\mathrm{Fun}(\mathrm{N}(\Ar_{n_{1},\dotsc,n_{q}}),{\mathcal{C}}) spanned by the functors such that

  • •

    Ai1,j1;…;iq,jq≃∗A_{i_{1},j_{1};\dotsc;i_{q},j_{q}}\simeq* whenever ik=jki_{k}=j_{k} for some kk.

  • •

    For every object (i1,j1,…,iq,jq)(i_{1},j_{1};\dotsc;i_{q},j_{q}) in Ar⁡[n1]×⋯×Ar⁡[nq]\Ar[n_{1}]\times\dotsb\times\Ar[n_{q}], every 1≤r≤q1\leq r\leq q, and every jr≤k≤nrj_{r}\leq k\leq n_{r}, the square

    Ai1,j1;…;iq,jq\textstyle{A_{i_{1},j_{1};\dotsc;i_{q},j_{q}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Ai1,j1;…;ir,k;…;iq,jq\textstyle{A_{i_{1},j_{1};\dotsc;i_{r},k;\dotsc;i_{q},j_{q}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Ai1,j1;…;jr,jr;…;iq,iq\textstyle{A_{i_{1},j_{1};\dotsc;j_{r},j_{r};\dotsc;i_{q},i_{q}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Ai1,j1;…;jr,k;…;iq,iq\textstyle{A_{i_{1},j_{1};\dotsc;j_{r},k;\dotsc;i_{q},i_{q}}}

    is a cocartesian square.

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

Andrew J. Blumberg, David Gepner, Goncalo Tabuada

Original source: arXiv:1001.2282v4