Definition 18.5.1. Let \(C\) be a small category. We define \(\rex C\) as the smallest finitely cocomplete full subcategory of \(\PSh(C)\) generated by the family of representable presheaves. The Yoneda embedding thus yields a canonical fully faithful functor \(h_C\colon C\to\rex C\).
Theorem 18.5.2. For any category \(D\) with finite colimits, pre-composing with the Yoneda embedding yields an equivalence of the form \[ \Rex(\rex C,D)\simeq\Fun(C,D)\, . \]
Proof
This is a particular case of Theorem 17.3.3.
Notation 18.5.3. We define \(\RexCat\) as the subcategory of \(\Cat\) whose objects are the small categories with finite colimits and whose morphisms are the right exact functors. Dually, we define \(\LexCat\) as the subcategory of \(\Cat\) whose objects are the small categories with finite limits and whose morphisms are the left exact functors. There is a canonical equivalence \[ \RexCat\simeq\LexCat\ , \quad C\mapsto C\catop\, . \]
Corollary 18.5.4. The canonical embedding \(\RexCat\hookrightarrow\Cat\) has a left adjoint given by the rule \(C\mapsto\rex{C}\).
Theorem 18.5.5. The category \(\RexCat\) of small categories with finite colimits is compactly generated (in particular, it has both small colimits and small limits).
Proof
This is a particular case of Corollary 17.3.12.
Remark 18.5.6. Let \(\Cat'\) be a universe of large categories, so that every small category is large and \(\Cat\) itself is large. Let \(\RexCat'\) be the category of large categories with finite colimits. Then the embedding \[ \RexCat\hookrightarrow\RexCat' \] commutes with small colimits as well as with small limits. Recall that the embedding \(\Cat\hookrightarrow\Cat'\) already has these properties. The case of small colimits follows from the explicit description of colimits in \(\RexCat\) given in the proof of Proposition 17.3.8. the case of small limits follows right away from Lemma 17.3.2.
Remark 18.5.7. The functor \[ \Rex\colon\RexCat\catop\times\RexCat\to\Cat \] preserves small limits in each variable. To see this, we use the fact that, for any small category \(A\) and any small categories with finite colimits \(B\) and \(C\), we have \[ \Map(A,\RexCat(B,C))=\Rex(B,\Fun(A,C))^\simeq\, . \] It thus suffices to recall that \[ \Hom_{\RexCat}(-,-)=\RexCat(-,-)^\simeq\colon\RexCat\catop\times\RexCat\to\An \] preserves small limits in each variable and to convince ourselves that \[ \Fun(A,-)\colon\RexCat\to\RexCat \] commutes with limits. For the latter, this follows from the fact that the embedding \[ \RexCat\hookrightarrow\Cat \] is conservative and commutes with small limits as well as with the operator \(\Fun(A,-)\). Therefore, it suffices to check that \[ \Fun(A,-)\colon\Cat\to\Cat \] commutes with small limits, which holds true since it is right adjoint to the functor \[ B\mapsto A\times B\, . \]