Notation 20.1.1. We let \(\mathrm{FinSet}\) be the full subcategory of \(\An\) spanned by finite sets.

Given a small category with finite coproducts \(C\) we denote by \(\Padd C\) the full subcategory of \(\PSh(C)\) spanned by finite products preserving functors. In other words, \(\Padd C=\Ind_\kappa(C)\) for \(\kappa\) the localizing subuniverse of finite sets. In this particular case, \(\kappa\)-filtered categories correspond to sifted categories.

Proposition 20.1.2. Let \(C\) be a small category with finite coproducts. The category \(\Padd C\) is compactly generated. Furthermore, the embedding \[ \Padd C\hookrightarrow\PSh(C) \] commutes small sifted colimits.

Proof

It is even a \(\kappa\)-presentable categories by virtue of Remark 17.2.27.

Remark 20.1.3. If \(C\) is small with finite coproducts, the Yoneda embedding of \(C\) takes values in \(\Padd{C}\) and the induced functor \[ h_C\colon C\hookrightarrow\Padd{C} \] commutes with finite coproducts. Indeed, for any object \(x\) of \(C\), the functor \(\Hom_C(-,x)\) takes coproducts in \(C\) to products in \(\An\).

Lemma 20.1.4. Any small category with finite coproducts is sifted.

Proof

Let \(A\) be a small category with an initial object \(*\) as well as binary coproducts. Since \(A=A_{*/}\), \(A\) is weakly contractible. We also have \[ A_{(x\amalg y)/}=A_{x/}\times_A A_{y/} \] for all \(x,y : A^\simeq\), proving that \(A_{x/}\to A\) is a terminal functor for all \(x\).

Lemma 20.1.5. Let \(C\) be a small category with finite coproducts. Given a presheaf \(F\colon C\catop\to\An\), the following assertions are equivalent.

  • (i) The functor \(F\) preserves finite products.

  • (ii) The category \(C_{/F}\) has finite coproducts.

  • (iii) The category \(C_{/F}\) is sifted.

  • (iv) There is a small sifted category \(A\), a functor \(\varphi\colon A\to C\) and an isomorphism of type \[ \underset{a : A}{\colim}\, h_C(\varphi(a)) = F \] in \(\PSh(C)\).

Proof

This is a particular case of Proposition 17.2.19.

Proposition 20.1.6. Let \(u\colon C\to D\) be a finite coproducts preserving functor between small categories with finite coproducts. Then the adjunction \[ u_!\colon\PSh(C)\rightleftarrows\PSh(D)\colon u^* \] restricts to an adjunction of the form \[ u_!\colon\Padd{C}\rightleftarrows\Padd{D}\colon u^*\, . \]

Proof

This is a particular case of Proposition 17.2.21.

Remark 20.1.7. The previous proposition is also a way to interpret localizations that are compatible with finite coproducts. Given \(C\) a small category with finite coproducts and \(W\hookrightarrow\Map([1],C)\) a family of morphisms containing all identities and stable under binary coproducts, let us denote by \[ \gamma\colon C\to L(C) \] the localization of \(C\) by \(W\). By virtue of Proposition 14.1.1 and Proposition 14.1.6, the category \(L(C)\) has an initial object as well as binary coproducts and the functor \(\gamma\) commutes with them. The preceding proposition thus provides an adjunction of the form \[ \gamma_!\colon\Padd{C}\rightleftarrows\Padd{L(C)}\colon\gamma^* \] with \(\gamma^*\) full faithful. The essential image of \(\gamma^*\) consists precisely of the functors that preserve finite products and send maps in \(W\) to isomorphisms. One ca identify \(L(C)\) as the full subcategory of \(\Padd(C)\) with objects the terms of the image of the map \[ C^\simeq\to \Padd{C}\, \quad x\mapsto \gamma_!(\Hom_C(-,x))\, . \]

Proposition 20.1.8. Let \(C\) be a small category with finite coproducts and \(D\) a category with small colimits. The equivalence \[ \Fun_!(\PSh(C),D)=\Fun(C,D) \] restricts to an equivalence from the category of small colimits preserving functors from \(\Padd(C)\) to \(D\) and the category of finite coproducts preserving functors from \(C\) to \(D\).

Proof

This is a particular case of Proposition 17.3.5.

Proposition 20.1.9. Let \(D\) be a locally small category with small colimits. We assume that there is a small family of objects \(E\) in \(D\) with the following properties.

  • (i) For any \(x : E\), the functor \[ \Hom_D(x,-)\colon D\to\An \] commutes with small sifted colimits.

  • (ii) The family \(E\) generates \(D\).

We let \(C\) be the smallest full subcategory of \(D\) containing the initial object as well as all the terms of \(E\) closed under binary coproducts. Then \(C\) is small and the full embedding \[ i\colon C\hookrightarrow D \] extends to an equivalence \[ \Padd C=D\, . \] In particular, any object of \(D\) is canonically a small sifted colimit of a functor with values in \(C\).

Proof

This is a particular case of Theorem 17.2.24.

The preceding definition applies to \(D=\An\) with \(E\) the collection of terminal objects. Since \(\mathrm{FinSet}\) is the smallest full subcategory of \(\An\) containing the empty anima as well as the terminal one and stable under binary coproducts, we get the identification \[ \Padd{\mathrm{FinSet}}=\An\, . \]