ScalingStacks

[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.

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