Adjoint Functor Theorem for -Categories
The adjoint functor theorem for -categories states that a functor between presentable -categories has a right adjoint if and only if it preserves small colimits. This is the -categorical analogue of the classical adjoint functor theorem and is one of the most powerful and frequently used results in higher category theory.
Statement
Let be a functor between presentable -categories.
(Left adjoint version) has a right adjoint if and only if preserves small colimits.
(Right adjoint version) has a left adjoint if and only if preserves small limits and is accessible (preserves -filtered colimits for some regular cardinal ).
The smash product functor preserves colimits (being a left adjoint of the mapping space functor). By the adjoint functor theorem, it has a right adjoint, which is the pointed mapping space .
More generally, for any presentable -category tensored over , the tensor has a right adjoint (the cotensor/mapping object) whenever it preserves colimits.
For a ring homomorphism , the extension of scalars functor preserves all colimits. By the adjoint functor theorem, it has a right adjoint: the forgetful/restriction functor .
This gives the -categorical version of the extension-restriction adjunction without needing to construct the right adjoint explicitly.
If is an accessible localization functor (preserves colimits and is accessible), then has a right adjoint (the inclusion of local objects). This is immediate from the adjoint functor theorem.
Example: the truncation functor preserves colimits and is accessible, so it has a right adjoint (the inclusion of -truncated spaces into all spaces).
Proof Ideas
The proof uses the theory of accessible -categories. Key steps:
-
Representability: A functor is representable (i.e., for some ) if and only if preserves small limits and is accessible. This is the -categorical version of the representable functor theorem.
-
Construction of right adjoint: For preserving colimits, define by the object representing the functor . This functor preserves limits (as a representable functor in ) and is accessible (because is presentable). By representability, exists for each .
-
Naturality: The construction of is natural in , giving a functor . The adjunction follows from the universal property.
The accessibility condition in the right adjoint version is needed to ensure the "solution set condition" is satisfied, analogous to the classical Freyd adjoint functor theorem.
Applications
The inclusion preserves limits and is accessible. By the adjoint functor theorem, it has a left adjoint: the sheafification functor .
For a functor between small -categories, the restriction functor preserves all limits and colimits. When is presentable:
- has a left adjoint (left Kan extension) because preserves limits and is accessible.
- has a right adjoint (right Kan extension) because preserves colimits.
This gives the full adjunction .
The forgetful functor (from spectra to pointed spaces) preserves limits and is accessible. By the adjoint functor theorem, it has a left adjoint (the suspension spectrum functor).
The resulting adjunction is the fundamental link between unstable and stable homotopy theory.
In a closed monoidal presentable -category , for each object , the tensor functor preserves colimits. By the adjoint functor theorem, it has a right adjoint , the internal hom.
This gives the tensor-hom adjunction automatically.
If a presentable -category has products and equalizers, then it has all limits. By the adjoint functor theorem, the diagonal functor (for any ) has a right adjoint (the limit functor) if and only if it preserves colimits, which it does.
The adjoint functor theorem provides a recognition principle: an -category is presentable if and only if it is accessible and has all colimits. The theorem then guarantees that also has all limits and that colimit-preserving functors from always have right adjoints.
Historical Notes
The -categorical adjoint functor theorem (Lurie, HTT 5.5.2.9) is cleaner than its classical counterpart because the accessibility condition replaces the "solution set condition" of Freyd's theorem. In the presentable setting, accessibility is automatic for functors defined by natural constructions, making the theorem particularly easy to apply.
The classical adjoint functor theorem (Freyd, 1964) required an explicit solution set, which was often hard to verify. The -categorical version avoids this by working within the well-behaved class of presentable -categories.
Summary
The adjoint functor theorem is the central existence theorem for -category theory:
-
Between presentable -categories, colimit-preserving functors have right adjoints.
-
Limit-preserving accessible functors have left adjoints.
-
Applications include: sheafification, Kan extensions, stabilization, internal hom, derived functors.
-
The theorem reduces existence of adjoints to easily checkable conditions (colimit/limit preservation).
-
This is one of the most frequently used results in modern homotopy theory and derived algebraic geometry.