Corollary 17.3.7 (Right exact functors out of a localization). Let \(C\) and \(L\) be small categories with finite colimits, and let \(\gamma\colon C\to L\) be a right exact localization at a family of morphisms \(W\). For every category \(D\) with finite colimits, precomposition with \(\gamma\) induces an equivalence \[ \Rex(L,D)\simeq\Rex^W(C,D), \] where \(\Rex^W(C,D)\) is the full subcategory of \(\Rex(C,D)\) spanned by the functors sending every morphism in \(W\) to an isomorphism. Dually, for a left exact localization between small categories with finite limits, the corresponding assertion holds for left exact functors into any category with finite limits.

Proof

The family of all morphisms inverted by \(\gamma\) is closed under finite colimits in \(\Fun([1],C)\), since \(\gamma\) is right exact, and defines the same localization as \(W\). The finite posets form a localizing subuniverse by Example 17.2.12 and Corollary 17.2.14. Applying Lemma 17.3.6 to this family shows that a functor \(f\colon L\to D\) is right exact if and only if \(f\gamma\) is right exact. Thus the universal property of localization restricts to the displayed equivalence. The left exact version follows by passing to opposite categories.

From Section 17.3, Presentable categories with respect to a subuniverse.