ScalingStacks

3.10. Classification diagrams of functor categories[0MT5]

The following generalizes one of the statements of (3.7), and we note it for future reference.

[05U4]

Proposition 3.11. Let CC and DD be categories, and W⊂DW\subset D a subcategory such that iso⁡D⊂W\iso D\subset W. Then there are natural isomorphisms

N⁡(DC,we⁡(DC))≈N​(D,W)N​C≈N​(D,W)discnerve⁡C.N(D^{C},\we(D^{C}))\approx N(D,W)^{NC}\approx N(D,W)^{\discnerve C}.
[05U5]

Proof. We must show that for each m,n≥0m,n\geq 0 the natural maps N⁡(DC,we⁡(DC))→N​(D,W)N​C→N​(D,W)discnerve⁡CN(D^{C},\we(D^{C}))\rightarrow N(D,W)^{NC}\rightarrow N(D,W)^{\discnerve C} induce one-to-one correspondences amongst the sets of

  1. (1)

    functors [m]×[n]→DC[m]\times[n]\rightarrow D^{C} which carry “vertical” maps into we⁡(DC)\we(D^{C}),

  2. (2)

    maps F⁡(m)×Δ⁡[n]→N​(D,W)N​CF(m)\times\Delta[n]\rightarrow N(D,W)^{NC} of simplicial spaces, and

  3. (3)

    maps F⁡(m)×Δ⁡[n]→N​(D,W)discnerve⁡CF(m)\times\Delta[n]\rightarrow N(D,W)^{\discnerve C} of simplicial spaces.

By (3.8) and (3.12) it will suffice to show this in the case m=n=0m=n=0, in which case the result becomes a straightforward computation. ∎

[05U6]

Lemma 3.12. Let CC a category, and WW a subcategory with ob⁡W=ob⁡C{\operatorname{ob}}W={\operatorname{ob}}C. Then there is a natural isomorphism

N⁡(C[n]~,we⁡(C[n]~))≈(N​C)Δ⁡[n],N(\widetilde{C^{[n]}},\we(\widetilde{C^{[n]}}))\approx(NC)^{\Delta[n]},

where C[n]~⊂C[n]\widetilde{C^{[n]}}\subset C^{[n]} denotes the full subcategory whose objects are those functors [n]→C[n]\rightarrow C which factor through W⊂CW\subset C, and we⁡(C[n]~)=we⁡(C[n])∩C[n]~\we(\widetilde{C^{[n]}})=\we(C^{[n]})\cap\widetilde{C^{[n]}}.

[05U7]

Proof. For any pair (D,W)(D,W) of category DD and subcategory WW, we have that we⁡(D[n]~)=W[n]\we(\widetilde{D^{[n]}})=W^{[n]}, and that nerve⁡(W[n])=(nerve⁡W)Δ⁡[n]\nerve(W^{[n]})=(\nerve W)^{\Delta[n]}. We obtain the result by substituting C[m]C^{[m]} for DD. ∎

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

Charles Rezk

Original source: arXiv:math/9811037v3

Original source · math/9811037v3