ScalingStacks

2. Strict nn-categories[0MLQ]

[0MH8]

Definition 2.1. A small strict 00-category is a set. Proceeding recursively, for any positive integer nn, a small strict nn-category is a small category enriched in small (n−1)(n-1)-categories. A functor between strict nn-categories will mean an enriched functor. We denote by Catn\cat_{n} the category of small strict nn-categories and functors.

[0MH9]

Remark 2.2. For the rest of this paper we will hold the convention that, unless otherwise stated, all strict nn-categories are small.

[0MHA]

Definition 2.3. A set can be regarded as a 11-category with only identity morphisms, and this defines a fully faithful functor

Cat0↪Cat1\cat_{0}\hookrightarrow\cat_{1}

that respects products. Passing to enriched categories then yields a sequence of fully faithful functors

Cat0↪Cat1↪⋯↪Cat(n−1)↪Catn↪⋯.\cat_{0}\hookrightarrow\cat_{1}\hookrightarrow\cdots\hookrightarrow\cat_{(n-1)}\hookrightarrow\cat_{n}\hookrightarrow\cdots.

We will tacitly treat these functor as inclusions in order to treat strict kk-categories as examples of strict nn-categories when 0≤k≤n0\leq k\leq n. In particular, a strict nn-categories in the image of Cat0\cat_{0} under this inclusions will be called discrete.

[0MHB]

Remark 2.4. It is well known that the fully faithful inclusion i:Catk↪Catni:\cat_{k}\hookrightarrow\cat_{n} admits a right adjoint jkj_{k}. The right adjoint jk:Catn→Catkj_{k}:\cat_{n}\to\cat_{k} carries a strict nn-category CC the maximal kk-category jk​Cj_{k}C contained therein.

[0MHC]

Example 2.5. The following are some important examples of strict nn-categories:

  1. (2.5.1)

    The empty nn-category ∅\emptyset is the empty set, regarded as an nn-category. Later it will be convenient to write ∂C0:=∅\partial C_{0}\mathrel{\mathop{:}}=\emptyset.

  2. (2.5.2)

    The 00-cell C0C_{0} is the singleton set, viewed as a strict nn-category. This is also the terminal strict nn-category.

  3. (2.5.3)

    The 11-category EE is the “walking isomorphism,” that is, the unique contractible groupoid that contains exactly two objects.

  4. (2.5.4)

    The kk-cell CkC_{k} is the strict kk-category defined inductively as follows: the set of object of CkC_{k} is the set {⊥,⊤}\{\bot,\top\}, and one has

    homCk⁡(x,y):={C0if ​x=y;Ck−1if x=⊥ and y=⊤;∅otherwise.\hom_{C_{k}}(x,y)\mathrel{\mathop{:}}=\begin{cases}C_{0}&\textrm{if }x=y;\\ C_{k-1}&\textrm{if }x=\bot\textrm{ and }y=\top;\\ \emptyset&\textrm{otherwise.}\end{cases}

    There is a unique composition law making this a strict kk-category, and therefore a strict nn-category for n≥kn\geq k.

  5. (2.5.5)

    The (k−1)(k-1)-category ∂Ck:=jk−1​Ck\partial C_{k}\mathrel{\mathop{:}}=j_{k-1}C_{k} can be described as the (k−1)(k-1)-category of “walking parallel (k−1)(k-1)-morphisms”.

  6. (2.5.6)

    A finite ordinal SS gives rise to a 11-category ΔS\Delta^{S}, whose objects are elements of SS in which there is a unique morphism s→s′s\to s^{\prime} if and only if s≤s′s\leq s^{\prime}. The simplex category of nonempty finite ordinals will be denoted Δ\Delta, as usual.

[0MHD]

Notation 2.6. We may generalize the fourth example in the following manner. Suppose XX a strict nn-category. We obtain a strict (n+1)(n+1)-category σ​X\sigma X, the suspension of XX, as follows. The set of objects of σ​X\sigma X is the set {⊤,⊥}\{\top,\bot\}, and one defines

homσ​X⁡(x,y):={C0if ​x=y;Xif x=⊥ and y=⊤;∅otherwise.\hom_{\sigma X}(x,y)\mathrel{\mathop{:}}=\begin{cases}C_{0}&\textrm{if }x=y;\\ X&\textrm{if }x=\bot\textrm{ and }y=\top;\\ \emptyset&\textrm{otherwise.}\end{cases}

There is a unique composition law that makes this into a strict nn-category.

Observe that the kk-fold suspension of the zero cell C0C_{0} is now nothing more than the kk-cell σk​(C0)=Ck\sigma^{k}(C_{0})=C_{k}. Furthermore, the suspension functor preserves both pullback and pushout squares. Consequently, we have an isomorphism

σ⁡(∅)≅C0⊔C0≅∂C1,\sigma(\emptyset)\cong C_{0}\sqcup C_{0}\cong\partial C_{1},

and therefore by induction we have

σk(∅)≅σk−1(C0∪∅C0)≅Ck−1∪∂Ck−1Ck−1≅∂Ck.\sigma^{k}(\emptyset)\cong\sigma^{k-1}(C_{0}\cup^{\emptyset}C_{0})\cong C_{k-1}\cup^{\partial C_{k-1}}C_{k-1}\cong\partial C_{k}.

The canonical inclusion ∂Ck↪Ck−1\partial C_{k}\hookrightarrow C_{k-1} arises as the kk-fold suspension of the unique functor C0⊔C0→C0C_{0}\sqcup C_{0}\to C_{0}.

The following proposition is well known.

[0MHE]

Proposition 2.7. The cells (CiC_{i}, 0≤i≤n0\leq i\leq n) generate Catn\cat_{n} under colimits; that is, the smallest full subcategory of Catn\cat_{n} containing the cells and closed under colimits is all of Catn\cat_{n}. ∎

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