Theorem 18.4.8. Let \(P\) be a finite poset. For any categories \(C\) and \(D\) with finite colimits, the canonical equivalence from Theorem 12.9.3 \[ \Fun_!(\Fun(P\catop,\Ind(C)),\Ind(D))\simeq \Fun_!(\Ind(C),\Fun(P,\Ind(D))) \] restricts to a functorial equivalence \[ \Rex(\Fun(P\catop,C),D)\simeq\Rex(C,\Fun(P,D))\, . \]

Proof

The equivalence is defined by sending any functor \(\Phi\colon\Fun(P\catop,\Ind(C))\to\Ind(D)\) to the transposition of the functor obtained by composing \(\Phi\) with the functor \[ P\times\Ind(C)\to\Fun(P\catop,\Ind(C))\ , \quad (a,x)\mapsto a\otimes x\, . \] On the other hand, since \(\Fun(P\catop,C)\) is the smallest full subcategory of \(\Fun(P\catop,\Ind(C))\) stable under finite colimits and containing objects of the form \(a\otimes x\) for \(a : P^\simeq\) and \(x : C^\simeq\), yielding the equivalence \[ \Ind(\Fun(P\catop,C))=\Fun(P\catop,\Ind(C))\, , \] by Lemma 18.4.6, we may see \(\Rex(\Fun(P\catop,C),D)\) as the full subcategory of the category \[ \Fun_!(\Fun(P\catop,\Ind(C)),\Ind(D)) \] spanned by those functors that send objects of the form \(a\otimes x\) to representable presheaves on \(D\) by Theorem 18.3.8. We also have similarly \[ \Fun_!(\Ind(C),\Fun(P,\Ind(D))) =\Rex(C,\Fun(P,\Ind(D))) \] by another application of Theorem 18.3.8.

In other words, we have a pullback square of the form: Commutative diagram; see the PDF for its LaTeX source in which the upper horizontal map must be an equivalence.

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