Definition 2.1. A small strict -category is a set. Proceeding recursively, for any positive integer , a small strict -category is a small category enriched in small -categories. A functor between strict -categories will mean an enriched functor. We denote by the category of small strict -categories and functors.
2. Strict -categories[0MLQ]
Remark 2.2. For the rest of this paper we will hold the convention that, unless otherwise stated, all strict -categories are small.
Definition 2.3. A set can be regarded as a -category with only identity morphisms, and this defines a fully faithful functor
that respects products. Passing to enriched categories then yields a sequence of fully faithful functors
We will tacitly treat these functor as inclusions in order to treat strict -categories as examples of strict -categories when . In particular, a strict -categories in the image of under this inclusions will be called discrete.
Remark 2.4. It is well known that the fully faithful inclusion admits a right adjoint . The right adjoint carries a strict -category the maximal -category contained therein.
Example 2.5. The following are some important examples of strict -categories:
- (2.5.1)
The empty -category is the empty set, regarded as an -category. Later it will be convenient to write .
- (2.5.2)
The -cell is the singleton set, viewed as a strict -category. This is also the terminal strict -category.
- (2.5.3)
The -category is the “walking isomorphism,” that is, the unique contractible groupoid that contains exactly two objects.
- (2.5.4)
The -cell is the strict -category defined inductively as follows: the set of object of is the set , and one has
There is a unique composition law making this a strict -category, and therefore a strict -category for .
- (2.5.5)
The -category can be described as the -category of “walking parallel -morphisms”.
- (2.5.6)
A finite ordinal gives rise to a -category , whose objects are elements of in which there is a unique morphism if and only if . The simplex category of nonempty finite ordinals will be denoted , as usual.
Notation 2.6. We may generalize the fourth example in the following manner. Suppose a strict -category. We obtain a strict -category , the suspension of , as follows. The set of objects of is the set , and one defines
There is a unique composition law that makes this into a strict -category.
Observe that the -fold suspension of the zero cell is now nothing more than the -cell . Furthermore, the suspension functor preserves both pullback and pushout squares. Consequently, we have an isomorphism
and therefore by induction we have
The canonical inclusion arises as the -fold suspension of the unique functor .
The following proposition is well known.
Proposition 2.7. The cells (, ) generate under colimits; that is, the smallest full subcategory of containing the cells and closed under colimits is all of . ∎
Original source: arXiv:1112.0040v6
Original source · 1112.0040v6