Remark 18.4.10. One can understand the functoriality of the equivalence provided by the previous theorem. Given a functor between finite posets \(u\colon P\to Q\), if \(C\) has finite colimits, if \(u^*(F)=F\circ u\), there is an adjunction \[ u_!\colon\Fun(P,\Ind(C))\rightleftarrows\Fun(Q,\Ind(C))\colon u^* \] and the formula \[ u_!(F)(y)=\underset{x : P\, , \, u(x)\leq y}{\colim}\, {F(x)} \] The indexing poset is finite: the predicate \(u(x)\leq y\) is decidable, so it filters a finite enumeration of \(P\) to a finite enumeration of this full subposet. Consequently, this formula shows that the adjunction restricts to one of the form \[ u_!\colon\Fun(P,C)\rightleftarrows\Fun(Q,C)\colon u^*\, . \] There is thus a functor \[ (u\catop)_!\colon\Fun(P\catop,C)\to\Fun(Q\catop,C) \] inducing a functor \[ ((u\catop)_!)^*\colon\Rex(\Fun(Q\catop,C),D)\to\Rex(\Fun(P\catop,C),D)\, . \] For \(a : P\) and \(x : C\), we have \[ (u\catop)_!(a\otimes x)=u(a)\otimes x\, . \] This means that the functor \(((u\catop)_!)^*\) above corresponds under the correspondence of the previous theorem to the functor of type \[ \Rex(C,\Fun(Q,D))\to\Rex(C,\Fun(P,D)) \] defined by \(\varPsi\mapsto u^*\varPsi\).

On the other hand, since both \((u\catop)_!\) and its right adjoint \((u\catop)^*\) are right exact, the induced adjunction \[ ((u\catop)^*)^*\colon\Fun(\Fun(P\catop,C),D)\rightleftarrows\Fun(\Fun(Q\catop,C),D)\colon((u\catop)_!)^* \] restricts to an adjunction \[ ((u\catop)^*)^*\colon\Rex(\Fun(P\catop,C),D)\rightleftarrows\Rex(\Fun(Q\catop,C),D)\colon((u\catop)_!)^*\, . \] Therefore, \(((u\catop)^*)^*\) corresponds to the functor of type \[ \Rex(C,\Fun(P,D))\to\Rex(C,\Fun(Q,D)) \] defined by \(\varPhi\mapsto u_!\varPhi\).

If furthermore \(u\) has a right adjoint \(v\colon Q\to P\), then \[ (v\catop)_!=(u\catop)^*\, . \] This means that \((u\catop)^*\) has a further right adjoint, namely \((v\catop)^*\), that one can interpret through the correspondence of Theorem 18.4.8 as well.

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