ScalingStacks

[0MIP]

Lemma 6.7. Let

π’ž:=S00βˆ’1​Fun⁑(Ξ₯nop,Set)\mathcal{C}\mathrel{\mathop{:}}=S_{00}^{-1}\Fun(\Upsilon_{n}^{\mathrm{op}},\set)

denote the full subcategory of presheaves of sets which are local with respect to the the morphisms of S00S_{00}. Let Ο†:Ciβ†’Cj\varphi:C_{i}\to C_{j} and ψ:Ckβ†’Cj\psi:C_{k}\to C_{j} be an arbitrary pair of maps (i,j,kβ‰₯0i,j,k\geq 0). Then ν⁑(CiΓ—CjCk)\nu(C_{i}\times_{C_{j}}C_{k}) is contained in the smallest full subcategory of π’ž\mathcal{C} that contains the nerves of cells and is closed under the formation of colimits.

[0MIQ]

Proof. Recall that Ξ½\nu commutes with limits. Let mm (≀i,j,k\leq i,j,k) be the largest integer such that Ο†=Οƒm​(g)\varphi=\sigma^{m}(g) and ψ=Οƒm​(f)\psi=\sigma^{m}(f) are both mm-fold suspensions of maps, g:Ciβˆ’mβ†’Cjβˆ’mg:C_{i-m}\to C_{j-m} and f:Ckβˆ’mβ†’Cjβˆ’mf:C_{k-m}\to C_{j-m}.

Suppose, without loss of generality, that Ο†\varphi is not an (m+1)(m+1)-fold suspension of a map. We thus have an mm-suspension of the situation considered in Rk. 6.3; that is, we have a diagram of pullback squares

Οƒm​(Ciβˆ’mΓ—C0F)\sigma^{m}(C_{i-m}\times_{C_{0}}F)Ci=Οƒm​(Ciβˆ’m)C_{i}=\sigma^{m}(C_{i-m})Οƒm​(F)\sigma^{m}(F)Cm=Οƒm​(C0)C_{m}=\sigma^{m}(C_{0})CkC_{k}Cj,C_{j},ψ=Οƒm​(f)\psi=\sigma^{m}(f)Οƒm​(g)\sigma^{m}(g)Οƒm(!)\sigma^{m}(!)⌜\ulcorner⌜\ulcorner

where as above FF denotes the fiber of f:Ckβˆ’mβ†’Cjβˆ’mf:C_{k-m}\to C_{j-m} over the image of gg. So let us consider each of the cases A-D of Rk. 6.3 in turn.

  1. (A)

    If F=βˆ…F=\emptyset, then

    CiΓ—CjCkβ‰…Οƒm​(Ciβˆ’mΓ—C0F)β‰…Οƒm​(βˆ…)β‰…βˆ‚Cm.C_{i}\times_{C_{j}}C_{k}\cong\sigma^{m}(C_{i-m}\times_{C_{0}}F)\cong\sigma^{m}(\emptyset)\cong\partial C_{m}.

    In this case, the morphisms of AβŠ‚S00A\subset S_{00} provide an iterative construction of Ξ½β€‹βˆ‚Cm\nu\partial C_{m} as a colimit in S00βˆ’1​Fun⁑(Ξ₯nop,Set)S_{00}^{-1}\Fun(\Upsilon_{n}^{\mathrm{op}},\set) of cells.

  2. (B)

    Next, if F≅C0F\cong C_{0}, then

    CiΓ—CjCkβ‰…Οƒm​(Ciβˆ’mΓ—C0F)β‰…Οƒm​(Ciβˆ’m)β‰…CiC_{i}\times_{C_{j}}C_{k}\cong\sigma^{m}(C_{i-m}\times_{C_{0}}F)\cong\sigma^{m}(C_{i-m})\cong C_{i}

    is already a cell.

  3. (C)

    Similarly, if Fβ‰…Ckβˆ’mF\cong C_{k-m}, but i=mi=m, then

    CiΓ—CjCkβ‰…Οƒm​(C0Γ—C0F)β‰…Οƒm​(Ckβˆ’m)β‰…CkC_{i}\times_{C_{j}}C_{k}\cong\sigma^{m}(C_{0}\times_{C_{0}}F)\cong\sigma^{m}(C_{k-m})\cong C_{k}

    is again already a cell.

  4. (D)

    Finally, let us suppose that F≅CℓF\cong C_{\ell} with i=m+pi=m+p and k=m+ℓk=m+\ell for p>0p>0. In this case we have,

    Ci×CjCk≅Cm+p×CmCm+ℓC_{i}\times_{C_{j}}C_{k}\cong C_{m+p}\times_{C_{m}}C_{m+\ell}

    is precisely the fiber product considered in the set CβŠ‚S00C\subset S_{00}. One readily observes that morphisms of BB and CC provide an inductive construction of this fiber product as an iterated colimit of cells in π’ž\mathcal{C}.∎

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