7. Adjoints
“Adjoint functors arise everywhere.”
——Mac Lane
We assume that our categories are locally small.
7.1Preliminary Definition
定义 7.1.1. An adjunction or adjoint pair between categories and consists of two functors and and a natural transformation with the following universal mapping property: for every objects of and of and for every arrow , there is a unique arrow in such that the following diagram is commutative:
hence .
Here is called a left adjoint of , is called a right adjoint of and is called the unit of adjunction. Also, is called an adjunction. Sometimes, one denotes .
注 7.1.2. For every objects of and of , we may consider given by for every . By universal mapping property of adjunction, is bijective.
例 7.1.3. Let be a category and let be the diagonal functor defined on objects of by and on arrows in by . We are looking for a right adjoint of , say . Then we must have an isomorphism in : for every object of and for every object .
We define the functor on objects of by and on arrows in by . One shows that is an adjunction with unit , whose component at an object of is For every arrow in , the following diagram is commutative:
hence is a natural transformation.
Next one checks universal mapping property for , namely for every objects of and of and for every arrow in , there is a unique arrow in such that the following diagram is commutative:
hence . Since , it is of the form , where and . Then we may chooseOne checks that this choice yields the required properties.
7.2Hom-set Definition
定理 7.2.1. Let and be functors. Then is called an adjunction if one of the following equivalent conditions holds:
(1) | (preliminary definition) There exists a natural transformation (called the unit of adjunction) with the following universal mapping property: for every objects of and of and for every arrow , there is a unique arrow in such that the following diagram is commutative: hence . |
(2) | (official definition) For every objects of and of there is an isomorphism in : which is natural in both and . |
(3) | (dual to preliminary definition) There exists a natural transformation (called the counit of adjunction) with the following universal mapping property: for every objects of and of and for every arrow , there is a unique arrow in such that the following diagram is commutative: hence . |
If the inverse of iswe have the following relating formulas:
• | and . |
• | and . |
证明. (1)(2) Define . By universal mapping property from (1) we know that is an isomorphism in (bijective).
We show naturality in . Let be an arrow in . We need to prove that the following diagram is commutative:
Denote and . Let . We have:Since is a natural transformation, the following diagram is commutative:
It follows that:Hence we have naturality in .
We show naturality in . Let be an arrow in . We need to prove that the following diagram is commutative:
Denote and . Let . We have:Hence we have naturality in .
(2)(1) We have seen that naturality in means that for every arrow in we have:that is,(7.1)Also, naturality in means that for every arrow in we have:that is,(7.2)
We show that with the following components at an object of :is a natural transformation. Let be an arrow in . Consider the following diagram:
We have:where we have used (7.1) for and (7.2) for , . Hence the above diagram is commutative, and thus is a natural transformation.
Let . Then there is a unique arrow such that . But we have:hence . This shows the required universal mapping property for .
7.3Examples of Adjoints
命题 7.3.1. Adjoints are unique up to an isomorphism, that is, given a functor and functors such that and are adjoint pairs, then .
例 7.3.2. Consider the following functors:
• | The free functor defined by for every set , where is the free monoid on the set (i.e. is the set of “words” with “letters” from , and the operation on is the concatenation of “words”), and for every function , , where is the unique monoid homomorphism with and , are the inclusion monoid homomorphisms. |
• | The forgetful functor . |
Let us show that is an adjunction.
By universal mapping property of the free monoid, for every monoid and for every function , there is a unique monoid homomorphism such that .
Let be a set and let be a monoid. We prove that there is an isomorphism in Set (bijection):that is,For every , we define . Let us also considerdefined for every by , where .
Note that is defined by .
For every we have:For every we have:For every , we have:Hence . Therefore, is a bijection.
We prove that is natural in . Let be a function. Then . Consider the following diagram:
For every , we have:Hence the above diagram is commutative, and thus is natural in .
We prove that is natural in . Let be a monoid homomorphism. Consider the following diagram:
For every , we have:Hence the above diagram is commutative, and thus is natural in .
Therefore, is an adjunction.
Alternatively, one may show that there is the natural transformation , whose component at a set isand prove that it satisfies the required universal mapping property of adjunction. Note that
例 7.3.3. Consider the category of all torsion abelian groups (i.e., abelian groups in which every element has finite order) and group homomorphisms. Consider the following functors:
• | The inclusion functor . |
• | The torsion functor defined by for every abelian group , and for every group homomorphism . |
Let us show that is an adjunction.
Note that is well defined, because if the order of an element is finite, then the order of is also finite.
We look for a natural transformation . For every object of , we defineClearly, is a natural transformation. We show universal mapping property for . Let be an object of an object of and a group homomorphism. We look for a unique group homomorphism such that . We have:In fact, we have , and we may take .
Therefore, is an adjunction.
Alternatively, for every torsion abelian group and for every abelian group , one proves that there is an isomorphism in (bijection) , that is, . For every , we haveIn fact, we have , hence .
例 7.3.4. Let and be posets, and let and be order-preserving functions (i.e. functors between poset categories). The following conditions are equivalent:
(i) | For every and , . |
(ii) | For every , , and for every , . |
In this case is called a monotone Galois connection. In fact, is an adjunction between the poset categories and .
例 7.3.5. Let be the set of propositional functions on a set , that is, functions , interpreted as declaring, for each , whether is false or true. Consider the poset categories , where , and , where if and only if for all , which is the case if and only if implies . Consider the following functors:
• | defined by if and only if there is with . |
• | The constant “dummy variable” functor . |
• | defined by if and only if for all . |
Then and are adjunctions.
7.4Further Properties of Adjoints
命题 7.4.1. Let , , and be functors such that and are adjoint pairs. Then is an adjoint pair.
命题 7.4.2. Let and be functors. The following are equivalent:
(1) | is an adjunction. |
(2) | There are natural transformations and such that for every objects of and of the following composite functors yield identities on and respectively: that is, and . They are shortly written as and , and are called the triangle identities. |
证明. (1)(2) Assume that is an adjunction. By Theorem 7.2.1, for every objects of and of there is an isomorphism in with inverse .
By Theorem 7.2.1, there exists a natural transformation with the following universal mapping property: for every objects of and of and for every arrow , there is a unique arrow in such that . In particular, for and , using a relating formula from Theorem 7.2.1, there is a unique arrow such that . Thenand thus .
By Theorem 7.2.1, there exists a natural transformation with the following universal mapping property: for every objects of and of and for every arrow , there is a unique arrow in such that . In particular, for and , using a relating formula from Theorem 7.2.1, there is a unique arrow such that . Thenand thus .
(2)(1) Suppose that there are natural transformations and such that for every objects of and of , we have and .
We show that has universal mapping property from Theorem 7.2.1. Let be an object of , let be an object of and let be an arrow in . We look for a unique arrow such that . Choose . By the naturality of , we have the following commutative diagram:
hence . It follows that:
For uniqueness, suppose that there is also an arrow such that . Then . By the naturality of , we have the following commutative diagram:
推论 7.4.3. Let be an adjunction with , , unit and counit . Consider the following full subcategory of :and the following full subcategory of :Then restricts to an equivalence between the categories and .
证明. Let be an object of . Then is an isomorphism. It follows that is an isomorphism. By the previous proposition we have . It follows that is an isomorphism. This shows that . Hence we may consider the functor , which is the restriction of the functor to .
Also, let be an object of . Then is an isomorphism. It follows that is an isomorphism. By the previous proposition we have . It follows that is an isomorphism. This shows that . Hence we may consider the functor , which is the restriction of the functor to .
例 7.4.4. An equivalence of categories with associated natural isomorphisms and need not be an adjunction with unit and counit . For instance, let and be monoids, and view them as monoid categories. An equivalence of categories between them is a pair of functors, that is, monoid homomorphisms and and two natural isomorphisms and , that is, invertible elements and . The triangle identities imply and . Taking and , an equivalence of categories satisfying the triangle identities consists of two central invertible elements such that . Now let be a non-trivial group and be distinct. Then is an equivalence which is not an adjunction.
命题 7.4.5. If is an equivalence of categories with , and natural isomorphisms and , then there is a unique natural isomorphism such that is an adjoint pair with unit and counit , and a unique natural isomorphism such that is an adjoint pair with unit and counit .
We say that every equivalence of categories can be turned into an adjoint equivalence.
命题 7.4.6 (RAPL, LAPC). Right adjoints preserve limits and left adjoints preserve colimits. In particular, right adjoints preserve products, terminal objects, equalizers and pullbacks, while left adjoints preserve coproducts, initial objects, coequalizers and pushouts.
例 7.4.7. (1) The above property may be useful in practice to show that a given functor does not have a left or right adjoint.
First, consider the inclusion functor . If has a right adjoint, then is a left adjoint and needs to preserve colimits, and in particular, initial objects. But the initial object of is , while the initial object of is . Hence does not have a right adjoint. One may show that it has a left adjoint given by the unitary (Dorroh) extension of a ring.
Now consider the inclusion functor . We have seen that it has the torsion functor as a right adjoint. If has a left adjoint, then it is a right adjoint and needs to preserve limits, and in particular, products. But the product in of the family of torsion abelian groups is , while its product in is their direct product. Hence does not have a left adjoint.
(2) There are functors without any left or right adjoint. For instance take the functor from the zero category to a non-zero category .
Also, there are functors having both a left and a right adjoint. E.g., see the example with the logical quantifiers. Alternatively, consider the following functors:
• | The functor defined by (discrete topology), and for every function . |
• | The forgetful functor . |
• | The functor defined by (indiscrete topology), and for every function . |
Then and are adjunctions.
注 7.4.8. There are some general results, such as Freyd’s Adjoint Functor Theorem, on the existence of left or right adjoints.