ScalingStacks

2.2. The simplicial indexing category[0MSV]

For n≥0n\geq 0 let [n][n] denote the category consisting of n+1n+1 objects and a sequence of nn composable arrows: {0→1→…→n}\{0\rightarrow 1\rightarrow\dots\rightarrow n\}. Let 𝚫\boldsymbol{\Delta} denote the full subcategory of the category of categories consisting of the objects [n][n]. We write ι:[n]→[n]\iota\colon[n]\rightarrow[n] for the identity map in this category.

As is customary, we let di:[n]→[n+1]d^{i}\colon[n]\rightarrow[n+1] for i=0,…,ni=0,\dots,n denote the injective functor which omits the iith object, and we let si:[n]→[n−1]s^{i}\colon[n]\rightarrow[n-1] for i=0,…,n−1i=0,\dots,n-1 denote the surjective functor which maps the iith and (i+1)(i+1)st objects to the same object. Additionally, we introduce the following notation: let αi:[m]→[n]\alpha^{i}\colon[m]\rightarrow[n] for i=0,…,n−mi=0,\dots,n-m denote the functor defined on on objects by αi​(k)=k+i\alpha^{i}(k)=k+i.

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