Lemma 18.4.6. Let \(P\) be a finite poset and \(C\) a small category with finite colimits. The restriction of the functor \[ P\times \Lex(C\catop,\An)\to \Fun(P\catop,\Lex(C\catop,\An))\ , \quad (a,x)\mapsto a\otimes x \] to \(P\times C\) via the Yoneda embedding of \(C\) takes values in the full subcategory \(\Fun(P\catop,C)\). This induces an equivalence \(\langle P\times C\rangle_\pf=\Fun(P\catop,C)\) (in other words, \(\Fun(P\catop,C)\) is the smallest finitely cocomplete full subcategory of \(\Fun(P\catop,\Lex(C\catop,\An))\) generated by objects of the form \(a\otimes x\) for \(a : P^\simeq\) and \(x : C^\simeq\)). In particular, we have \[ \Ind(\Fun(P\catop,C))=\Fun(P\catop,\Ind(C))\, . \]

Proof

The evaluation of \(a\otimes x\) at an object \(e\) of \(P\) is \[ \sum_{u : \Hom_P(e,a)}\, x\, . \] Since the order on \(P\) is decidable, the proposition \(\Hom_P(e,a)\) is decidable and hence is a finite set. This implies the first claim.

Therefore, in order to prove the second assertion, it suffices to know that any object of \(\Fun(P\catop,C)\) is a finite colimit of objects of the form \(a\otimes x\). The opposite \(P\catop\) is again a finite poset. The objects of \(\Tw(P\catop)\) form a decidable subobject of \((P\catop)^\simeq\times(P\catop)^\simeq\), and its order is decidable. Filtering a finite enumeration of the product therefore shows that \(\Tw(P\catop)\) is a finite poset. In particular, a new application of Proposition 16.4.23 tells us that \(\Tw(P\catop)\catop\) is a finite category. Therefore, Proposition 12.9.1 concludes the proof of the second assertion. The third one follows right away from the second one by Theorem 18.3.8.

From Section 18.4, Left Bousfield localization of compactly generated categories.