ScalingStacks

3.3. The classification diagram of a pair of categories[0MT2]

Consider a pair (C,W)(C,W) consisting of a category CC together with a subcategory WW such that ob⁡W=ob⁡C{\operatorname{ob}}W={\operatorname{ob}}C; we refer to a morphism of CC as a weak equivalence if it is contained in WW. More generally, given a natural transformation α:f→g\alpha\colon f\rightarrow g of functors f,g:D→Cf,g\colon D\rightarrow C, we say that α\alpha is a weak equivalence if α​d∈W\alpha d\in W for each d∈ob⁡Dd\in{\operatorname{ob}}D, and write we⁡(CD)\we(C^{D}) for the category consisting of all functors from DD to CC and all weak equivalences between them; thus we⁡(C)=W\we(C)=W.

For any such pair (C,W)(C,W) of categories we define a simplicial space N⁡(C,W)N(C,W), called the classification diagram of (C,W)(C,W), by setting

N​(C,W)m=nerve⁡we⁡(C[m]).N(C,W)_{m}=\nerve\we(C^{[m]}).

If we view the category [m]×[n][m]\times[n] as an mm-by-nn grid of objects with rows of mm composable horizontal arrows and columns of nn composable vertical arrows, then the set of nn-simplices of the mmth space of N⁡(C,W)N(C,W) corresponds to the set of functors [m]×[n]→C[m]\times[n]\rightarrow C in which the vertical arrows are sent into W⊂CW\subset C.

We consider several special cases of this construction.

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