Adjoint functors

Uses your system voice; voice and rate in settings.

Snapshot

≈ 33 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e., constructions of objects having a certain universal property), such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology. By definition, an adjunction between categories \mathcal{C} and \mathcal{D} is a pair of functors (assumed to be covariant) \begin{align} F&: \mathcal{D} \rightarrow \mathcal{C}\\ G&: \mathcal{C} \rightarrow \mathcal{D} \end{align} and, for all objects c in \mathcal{C} and d in a bijection between the respective morphism sets \mathrm{hom}_{\mathcal{C}}(Fd,c) \cong \mathrm{hom}_{\mathcal{D}}(d,Gc) such that this family of bijections is natural in c and d .…

In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e., constructions of objects having a certain universal property), such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology. By definition, an adjunction between categories \mathcal{C} and \mathcal{D} is a pair of functors (assumed to be covariant) \begin{align} F&: \mathcal{D} \rightarrow \mathcal{C}\\ G&: \mathcal{C} \rightarrow \mathcal{D} \end{align} and, for all objects c in \mathcal{C} and d in a bijection between the respective morphism sets \mathrm{hom}_{\mathcal{C}}(Fd,c) \cong \mathrm{hom}_{\mathcal{D}}(d,Gc) such that this family of bijections is natural in c and d . For locally small categories, naturality here means that there are natural isomorphisms between the pair of functors \mathcal{C}(F-,c) : \mathcal{D} \to \mathrm{Set^{\text{op}}} and \mathcal{D}(-,Gc) : \mathcal{D} \to \mathrm{Set^{\text{op}}} for a fixed c in \mathcal{C} , and also the pair of functors \mathcal{C}(Fd,-) : \mathcal{C} \to \mathrm{Set} and \mathcal{D}(d,G-) : \mathcal{C} \to \mathrm{Set} for a fixed d in \mathcal{D} . For other categories, naturality is defined as a generalisation of this. The functor F is called a left adjoint functor or left adjoint to G , while G is called a right adjoint functor or right adjoint to F . We write F\dashv G . An adjunction between categories \mathcal{C} and \mathcal{D} is somewhat akin to a "weak form" of an equivalence between \mathcal{C} and \mathcal{D} , and indeed every equivalence gives an adjunction, though the equivalence itself is not necessarily an adjunction. In many situations, an adjunction can be "upgraded" to an equivalence, by a suitable natural modification of the involved categories and functors. \varphi_{cd}: \mathrm{hom}_{\mathcal{C}}(Fd,c) \cong \mathrm{hom}_{\mathcal{D}}(d,Gc) of hom-set bijections, we call \varphi an adjunction or an adjunction between F and G . If f is an arrow in \mathrm{hom}_{\mathcal{C}}(Fd,c) , Mac Lane calls \varphi f the right adjunct of f . The functor F is left adjoint to G , and G is right adjoint to F . (Note that G may have itself a right adjoint that is quite different from F ; see below for an example.) In general, the phrases " F is a left adjoint" and " F has a right adjoint" are equivalent. We call F a left adjoint because it is applied to the left argument of \mathrm{hom}_{\mathcal{C}} , and G a right adjoint because it is applied to the right argument of \mathrm{hom}_{\mathcal{D}} . If F is left adjoint to G, we also write F\dashv G. The terminology comes from the Hilbert space idea of adjoint operators T , U with \langle Ty,x\rangle = \langle y,Ux\rangle , which is formally similar to the above relation between hom-sets. The analogy to adjoint maps of Hilbert spaces can be made precise in certain contexts. The two facts that this method of turning rngs into rings is most efficient and formulaic can be expressed simultaneously by saying that it defines an adjoint functor. More explicitly: Let F denote the above process of adjoining an identity to a rng, so F(R)=R . Let G denote the process of "forgetting" whether a ring S has an identity and considering it simply as a rng, so essentially G(S)=S. Then F is the left adjoint functor of G. Note however that we haven't actually constructed R yet; it is an important and not altogether trivial algebraic fact that such a left adjoint functor actually exists.

Symmetry of optimization problems

It is also possible to start with the functor F, and pose the following (vague) question: is there a problem to which F is the most efficient solution? The notion that F is the most efficient solution to the problem posed by G is, in a certain rigorous sense, equivalent to the notion that G poses the most difficult problem that F solves. This gives the intuition behind the fact that adjoint functors occur in pairs: if F is left adjoint to G, then G is right adjoint to F.

Formal definitions

There are various equivalent definitions for adjoint functors: The definitions via universal morphisms are easy to state, and require minimal verifications when constructing an adjoint functor or proving two functors are adjoint. They are also the most analogous to our intuition involving optimizations. The definition via hom-sets makes symmetry the most apparent, and is the reason for using the word adjoint. The definition via counit–unit adjunction is convenient for proofs about functors that are known to be adjoint, because they provide formulas that can be directly manipulated. The equivalency of these definitions is quite useful. Adjoint functors arise everywhere, in all areas of mathematics. Since the structure in any of these definitions gives rise to the structures in the others, switching between them makes implicit use of many details that would otherwise have to be repeated separately in every subject area.

Conventions

The theory of adjoints has the terms left and right at its foundation, and there are many components that live in one of two categories C and D that are under consideration. Therefore, it can be helpful to choose letters in alphabetical order according to whether they live in the "lefthand" category C or the "righthand" category D, and also to write them down in this order whenever possible. In this article for example, the letters X, F, f, ε will consistently denote things that live in the category C, the letters Y, G, g, η will consistently denote things that live in the category D, and whenever possible such things will be referred to in order from left to right (a functor F : D → C can be thought of as "living" where its outputs are, in C). If the arrows for the left adjoint functor F were drawn they would be pointing to the left; if the arrows for the right adjoint functor G were drawn they would be pointing to the right.

Definition via universal morphisms

By definition, a functor F: \mathcal{D} \to \mathcal{C} is a left adjoint functor if for each object X in \mathcal{C} there exists a universal morphism from F to X . Spelled out, this means that for each object X in \mathcal{C} there exists an object G(X) in \mathcal{D} and a morphism \varepsilon_X: F(G(X)) \to X such that for every object Y in \mathcal{D} and every morphism f: F(Y) \to X there exists a unique morphism g: Y \to G(X) with \varepsilon_X \circ F(g) = f . The latter equation is expressed by the following commutative diagram: In this situation, one can show that G can be turned into a functor G :\mathcal{C} \to \mathcal{D} in a unique way such that \varepsilon_X \circ F(G(f)) = f \circ \varepsilon_{X'} for all morphisms f: X' \to X in \mathcal{C} ; F is then called a left adjoint to G . Similarly, we may define right-adjoint functors. A functor G: \mathcal{C} \to \mathcal{D} is a right adjoint functor if for each object Y in \mathcal{D} , there exists a universal morphism from Y to G . Spelled out, this means that for each object Y in \mathcal{D} , there exists an object F(Y) in C and a morphism \eta_Y: Y \to G(F(Y)) such that for every object X in \mathcal{C} and every morphism g: Y \to G(X) there exists a unique morphism f: F(Y) \to X with G(f) \circ \eta_Y = g . Again, this F can be uniquely turned into a functor F: \mathcal{D} \to \mathcal{C} such that G(F(g)) \circ \eta_Y = \eta_{Y'} \circ g for g: Y \to Y' a morphism in \mathcal{D} ; G is then called a right adjoint to F . It is true, as the terminology implies, that F is left adjoint to G if and only if G is right adjoint to F . These definitions via universal morphisms are often useful for establishing that a given functor is left or right adjoint, because they are minimalistic in their requirements. They are also intuitively meaningful in that finding a universal morphism is like solving an optimization problem.

Definition via hom-sets

Using hom-sets, an adjunction between two categories \mathcal{C} and \mathcal{D} can be defined as consisting of two functors F : \mathcal{D} \to \mathcal{C} and G : \mathcal{C} \to \mathcal{D} and a natural isomorphism \Phi:\mathrm{Hom}_\mathcal{C}(F-,-) \to \mathrm{Hom}_\mathcal{D}(-,G-). This specifies a family of bijections \Phi_{Y,X}:\mathrm{Hom}_\mathcal{C}(FY,X) \to \mathrm{Hom}_\mathcal{D}(Y,GX) for all objects X\in\mathcal{C} and Y\in\mathcal{D}. In this situation, F is left adjoint to G and G is right adjoint to F . This definition is a logical compromise in that it is more difficult to establish its satisfaction than the universal morphism definitions, and has fewer immediate implications than the counit–unit definition. It is useful because of its obvious symmetry, and as a stepping-stone between the other definitions. In order to interpret \Phi as a natural isomorphism, one must recognize \text{Hom}_\mathcal{C}(F-,-) and \text{Hom}_\mathcal{D}(-,G-) as functors. In fact, they are both bifunctors from \mathcal{D}^\text{op} \times \mathcal{C} to \mathbf{Set} (the category of sets). For details, see the article on hom-functors. Spelled out, the naturality of \Phi means that for all morphisms f : X \to X' in \mathcal{C} and all morphisms g : Y' \to Y in \mathcal{D} the following diagram commutes: The vertical arrows in this diagram ( \text{Hom}(g,Gf) and \text{Hom}(Fg,f) ) are those induced by composition. Formally, \text{Hom}(Fg, f) : \text{Hom}_\mathcal{C}(FY, X) \to \text{Hom}_\mathcal{C}(FY', X') is given by h \mapsto f \circ h \circ Fg for each h \in \text{Hom}_\mathcal{C}(FY, X). \text{Hom}(g, Gf) is similar.

Definition via counit–unit

A third way of defining an adjunction between two categories \mathcal{C} and \mathcal{D} consists of two functors F : \mathcal{D} \to \mathcal{C} and G : \mathcal{C} \to \mathcal{D} and two natural transformations \begin{align} \varepsilon &: FG \to 1_\mathcal{C} \\ \eta &: 1_\mathcal{D} \to GF\end{align} respectively called the counit and the unit of the adjunction (terminology from universal algebra), such that the compositions F\xrightarrow\overset{}{\;F\eta\;}FGF\xrightarrow\overset{}{\;\varepsilon F\,}F G\xrightarrow\overset{}{\;\eta G\;}GFG\xrightarrow\overset{}{\;G \varepsilon\,}G are the identity morphisms 1_F and 1_G on and respectively. In this situation we say that is left adjoint to and is right adjoint to , and may indicate this relationship by writing (\varepsilon,\eta):F\dashv G  , or, simply F\dashv G  . In equational form, the above conditions on (\varepsilon,\eta) are the counit–unit equations \begin{align} 1_F &= \varepsilon F\circ F\eta\\ 1_G &= G\varepsilon \circ \eta G \end{align} which imply that for each X \in \mathcal{C} and each Y \in \mathcal{D}, \begin{align} 1_{FY} &= \varepsilon_{FY}\circ F(\eta_Y) \\ 1_{GX} &= G(\varepsilon_X)\circ\eta_{GX}. \end{align} Note that 1_{\mathcal C} denotes the identify functor on the category \mathcal C , 1_F denotes the identity natural transformation from the functor to itself, and 1_{FY} denotes the identity morphism of the object FY . These equations are useful in reducing proofs about adjoint functors to algebraic manipulations. They are sometimes called the triangle identities, or sometimes the zig-zag equations because of the appearance of the corresponding string diagrams. A way to remember them is to first write down the nonsensical equation 1=\varepsilon\circ\eta and then fill in either or in one of the two simple ways that make the compositions defined. Note: The use of the prefix "co" in counit here is not consistent with the terminology of limits and colimits, because a colimit satisfies an initial property whereas the counit morphisms satisfy terminal properties, and dually for limit versus unit. The term unit here is borrowed from the theory of monads, where it looks like the insertion of the identity into a monoid.

History

The idea of adjoint functors was introduced by Daniel Kan in 1958. Like many of the concepts in category theory, it was suggested by the needs of homological algebra, which was at the time devoted to computations. Those faced with giving tidy, systematic presentations of the subject would have noticed relations such as \text{Hom}(FX, Y) = \text{Hom}(X, GY) in the category of abelian groups, where was the functor - \otimes A (i.e. take the tensor product with ), and was the functor (this is now known as the tensor-hom adjunction). The use of the equals sign is an abuse of notation; those two groups are not really identical but there is a way of identifying them that is natural. It can be seen to be natural on the basis, firstly, that these are two alternative descriptions of the bilinear mappings from to . That is, however, something particular to the case of tensor product. In category theory the 'naturality' of the bijection is subsumed in the concept of a natural isomorphism.

Free groups

The construction of free groups is a common and illuminating example. Let be the functor assigning to each set the free group generated by the elements of , and let be the forgetful functor, which assigns to each group its underlying set. Then is left adjoint to : {{defn|One can also verify directly that and are natural. Then, a direct verification that they form a counit–unit adjunction (\varepsilon,\eta):F\dashv G is as follows: {{defn| 1_F = \varepsilon F\circ F\eta says that for each set the composition FY\xrightarrow\overset{}{\;F(\eta_Y)\;}FGFY\xrightarrow{\;\varepsilon_{FY}\,}FY should be the identity. The intermediate group is the free group generated freely by the words of the free group . (Think of these words as placed in parentheses to indicate that they are independent generators.) The arrow F(\eta_Y) is the group homomorphism from into sending each generator of to the corresponding word of length one ( ) as a generator of . The arrow \varepsilon_{FY} is the group homomorphism from to sending each generator to the word of it corresponds to (so this map is "dropping parentheses"). The composition of these maps is indeed the identity on .}} {{defn| 1_G = G\varepsilon \circ \eta G says that for each group the composition GX\xrightarrow{\;\eta_{GX}\;}GFGX\xrightarrow\overset{}{\;G(\varepsilon_X)\,}GX should be the identity. The intermediate set is just the underlying set of . The arrow \eta_{GX} is the "inclusion of generators" set map from the set to the set . The arrow G(\varepsilon_X) is the set map from to , which underlies the group homomorphism sending each generator of to the element of it corresponds to ("dropping parentheses"). The composition of these maps is indeed the identity on .}} }}

Free constructions and forgetful functors

Free objects are all examples of a left adjoint to a forgetful functor, which assigns to an algebraic object its underlying set. These algebraic free functors have generally the same description as in the detailed description of the free group situation above.

Diagonal functors and limits

Products, pullbacks, equalizers, and kernels are all examples of the categorical notion of a limit. Any limit functor is right adjoint to a corresponding diagonal functor (provided the category has the type of limits in question), and the counit of the adjunction provides the defining maps from the limit object (i.e. from the diagonal functor on the limit, in the functor category). Below are some specific examples.

Colimits and diagonal functors

Coproducts, pushouts, coequalizers, and cokernels are all examples of the categorical notion of a colimit. Any colimit functor is left adjoint to a corresponding diagonal functor (provided the category has the type of colimits in question), and the unit of the adjunction provides the defining maps into the colimit object. Below are some specific examples. Coproducts. If assigns to every pair of abelian groups their direct sum, and if is the functor which assigns to every abelian group the pair , then is left adjoint to , again a consequence of the universal property of direct sums. The unit of this adjoint pair is the defining pair of inclusion maps from and into the direct sum, and the counit is the additive map from the direct sum of to back to (sending an element of the direct sum to the element of ). Analogous examples are given by the direct sum of vector spaces and modules, by the free product of groups and by the disjoint union of sets.

Further examples

Topology

A functor with a left and a right adjoint. Let be the functor from topological spaces to sets that associates to every topological space its underlying set (forgetting the topology, that is). has a left adjoint , creating the discrete space on a set , and a right adjoint creating the trivial topology on . Suspensions and loop spaces. Given topological spaces and , the space of homotopy classes of maps from the suspension of to is naturally isomorphic to the space of homotopy classes of maps from to the loop space of . The suspension functor is therefore left adjoint to the loop space functor in the homotopy category, an important fact in homotopy theory. Stone–Čech compactification. Let be the category of compact Hausdorff spaces and be the inclusion functor to the category of topological spaces. Then has a left adjoint , the Stone–Čech compactification. The unit of this adjoint pair yields a continuous map from every topological space into its Stone–Čech compactification. Direct and inverse images of sheaves. Every continuous map between topological spaces induces a functor from the category of sheaves (of sets, or abelian groups, or rings, etc.) on to the corresponding category of sheaves on , the direct image functor. It also induces a functor from the category of sheaves of abelian groups on to the category of sheaves of abelian groups on , the inverse image functor. is left adjoint to . Here a more subtle point is that the left adjoint for coherent sheaves will differ from that for sheaves (of sets). Soberification. The article on Stone duality describes an adjunction between the category of topological spaces and the category of sober spaces that is known as soberification. Notably, the article also contains a detailed description of another adjunction that prepares the way for the famous duality of sober spaces and spatial locales, exploited in pointless topology.

Posets

Every partially ordered set can be viewed as a category (where the elements of the poset become the category's objects and we have a single morphism from to if and only if ). A pair of adjoint functors between two partially ordered sets is called a Galois connection (or, if it is contravariant, an antitone Galois connection). See that article for a number of examples: the case of Galois theory of course is a leading one. Any Galois connection gives rise to closure operators and to inverse order-preserving bijections between the corresponding closed elements. As is the case for Galois groups, the real interest lies often in refining a correspondence to a duality (i.e. antitone order isomorphism). A treatment of Galois theory along these lines by Kaplansky was influential in the recognition of the general structure here. The partial order case collapses the adjunction definitions quite noticeably, but can provide several themes: adjunctions may not be dualities or isomorphisms, but are candidates for upgrading to that status closure operators may indicate the presence of adjunctions, as corresponding monads (cf. the Kuratowski closure axioms) a very general comment of William Lawvere is that syntax and semantics are adjoint: take to be the set of all logical theories (axiomatizations), and the power set of the set of all mathematical structures. For a theory in , let be the set of all structures that satisfy the axioms ; for a set of mathematical structures , let be the minimal axiomatization of . We can then say that is a subset of if and only if logically implies : the "semantics functor" is right adjoint to the "syntax functor" . division is (in general) the attempt to invert multiplication, but in situations where this is not possible, we often attempt to construct an adjoint instead: the ideal quotient is adjoint to the multiplication by ring ideals, and the implication in propositional logic is adjoint to logical conjunction.

Category theory

Categorical logic

{{defn|If \phi_Y is a unary predicate expressing some property, then a sufficiently strong set theory may prove the existence of the set Y=\{y\mid\phi_Y(y)\} of terms that fulfill the property. A proper subset T\subset Y and the associated injection of T into Y is characterized by a predicate \phi_T(y)=\phi_Y(y)\land\varphi(y) expressing a strictly more restrictive property. The role of quantifiers in predicate logics is in forming propositions and also in expressing sophisticated predicates by closing formulas with possibly more variables. For example, consider a predicate \psi_f with two open variables of sort X and Y . Using a quantifier to close X , we can form the set \{y\in Y\mid \exists x.\,\psi_f(x,y)\land\phi_{S}(x)\} of all elements y of Y for which there is an x to which it is \psi_f -related, and which itself is characterized by the property \phi_{S} . Set theoretic operations like the intersection \cap of two sets directly corresponds to the conjunction \land of predicates. In categorical logic, a subfield of topos theory, quantifiers are identified with adjoints to the pullback functor. Such a realization can be seen in analogy to the discussion of propositional logic using set theory but the general definition make for a richer range of logics. So consider an object Y in a category with pullbacks. Any morphism f:X\to Y induces a functor f^{*} : \text{Sub}(Y) \longrightarrow \text{Sub}(X) on the category that is the preorder of subobjects. It maps subobjects T of Y (technically: monomorphism classes of T\to Y ) to the pullback X\times_Y T . If this functor has a left- or right adjoint, they are called \exists_f and \forall_f , respectively. They both map from \text{Sub}(X) back to \text{Sub}(Y) . Very roughly, given a domain S\subset X to quantify a relation expressed via f over, the functor/quantifier closes X in X\times_Y T and returns the thereby specified subset of Y . Example: In \operatorname{Set} , the category of sets and functions, the canonical subobjects are the subset (or rather their canonical injections). The pullback f^{*}T=X\times_Y T of an injection of a subset T into Y along f is characterized as the largest set which knows all about f and the injection of T into Y . It therefore turns out to be (in bijection with) the inverse image f^{-1}[T]\subseteq X . For S \subseteq X , let us figure out the left adjoint, which is defined via {\operatorname{Hom}}(\exists_f S,T) \cong {\operatorname{Hom}}(S,f^{*}T), which here just means \exists_f S\subseteq T \leftrightarrow S\subseteq f^{-1}[T]. Consider f[S] \subseteq T . We see S\subseteq f^{-1}[f[S \subseteq f^{-1}[T] . Conversely, If for an x\in S we also have x\in f^{-1}[T] , then clearly f(x)\in T . So S \subseteq f^{-1}[T] implies f[S] \subseteq T . We conclude that left adjoint to the inverse image functor f^{*} is given by the direct image. Here is a characterization of this result, which matches more the logical interpretation: The image of S under \exists_f is the full set of y 's, such that f^{-1} [\{y\}] \cap S is non-empty. This works because it neglects exactly those y\in Y which are in the complement of f[S] . So \exists_f S = \{ y \in Y \mid \exists (x \in f^{-1}[\{y\}]).\, x \in S \; \} = f[S]. Put this in analogy to our motivation \{y\in Y\mid\exists x.\,\psi_f(x,y)\land\phi_{S}(x)\} . The right adjoint to the inverse image functor is given (without doing the computation here) by \forall_f S = \{ y \in Y \mid \forall (x \in f^{-1} [\{y\}]).\, x \in S \; \}. The subset \forall_f S of Y is characterized as the full set of y 's with the property that the inverse image of \{y\} with respect to f is fully contained within S . Note how the predicate determining the set is the same as above, except that \exists is replaced by \forall .}} Define a category based on \R , with objects being the real numbers, and the morphisms being "affine functions evaluated at a point". That is, for any affine function f(x) = ax + b and any real number r , define a morphism (r, f): r \to f(r) . Define a category based on M(\R) , the set of probability distribution on \R with finite expectation. Define morphisms on M(\R) as "affine functions evaluated at a distribution". That is, for any affine function f(x) = ax + b and any \mu\in M(\R) , define a morphism (\mu, f): \mu \to \mu\circ f^{-1} . Then, the Dirac delta measure defines a functor: \delta: x\mapsto \delta_x , and the expectation defines another functor \mathbb E: \mu \mapsto \mathbb E[\mu] , and they are adjoint: \mathbb E \dashv \delta . (Somewhat disconcertingly, \mathbb E is the left adjoint, even though \mathbb E is "forgetful" and \delta is "free".)

Adjunctions in full

There are hence numerous functors and natural transformations associated with every adjunction, and only a small portion is sufficient to determine the rest. An adjunction between categories and consists of A functor called the left adjoint A functor called the right adjoint A natural isomorphism A natural transformation called the counit A natural transformation called the unit An equivalent formulation, where denotes any object of and denotes any object of , is as follows: From this assertion, one can recover that: In particular, the equations above allow one to define , , and in terms of any one of the three. However, the adjoint functors and alone are in general not sufficient to determine the adjunction. The equivalence of these situations is demonstrated below.

Universal morphisms induce hom-set adjunction

Given a right adjoint functor , in the sense of initial morphisms, one may construct the induced hom-set adjunction by doing the following steps. Construct a functor and a natural transformation . For each object in , choose an initial morphism ( ) from to , so that . We have the map of on objects and the family of morphisms . For each , as is an initial morphism, then factorize with and get . This is the map of on morphisms. The commuting diagram of that factorization implies the commuting diagram of natural transformations, so is a natural transformation. Uniqueness of that factorization and that is a functor implies that the map of on morphisms preserves compositions and identities. Construct a natural isomorphism . For each object in , each object in , as is an initial morphism, then is a bijection, where . is a natural transformation, is a functor, then for any objects in , any objects in  D, any , any , we have , and then is natural in both arguments. A similar argument allows one to construct a hom-set adjunction from the terminal morphisms to a left adjoint functor. (The construction that starts with a right adjoint is slightly more common, since the right adjoint in many adjoint pairs is a trivially defined inclusion or forgetful functor.)

counit–unit adjunction induces hom-set adjunction

Given functors , and a counit–unit adjunction , we can construct a hom-set adjunction by finding the natural transformation in the following steps: For each and each , define \begin{align}\Phi_{Y,X}(f) = G(f)\circ \eta_Y\\ \Psi_{Y,X}(g) = \varepsilon_X\circ F(g)\end{align} The transformations Φ and Ψ are natural because η and ε are natural. Using, in order, that is a functor, that is natural, and the counit–unit equation , we obtain \begin{align} \Psi\Phi f &= \varepsilon_X\circ FG(f)\circ F(\eta_Y) \\ &= f\circ \varepsilon_{FY}\circ F(\eta_Y) \\ &= f\circ 1_{FY} = f\end{align} hence ΨΦ is the identity transformation. Dually, using that is a functor, that is natural, and the counit–unit equation , we obtain \begin{align} \Phi\Psi g &= G(\varepsilon_X)\circ GF(g)\circ\eta_Y \\ &= G(\varepsilon_X)\circ\eta_{GX}\circ g \\ &= 1_{GX}\circ g = g\end{align} hence is the identity transformation. Thus is a natural isomorphism with inverse .

Hom-set adjunction induces all of the above

Given functors , and a hom-set adjunction , one can construct a counit–unit adjunction (\varepsilon,\eta):F\dashv G, which defines families of initial and terminal morphisms, in the following steps: Let \varepsilon_X=\Phi_{GX,X}^{-1}(1_{GX})\in\mathrm{hom}_C(FGX,X) for each in , where 1_{GX}\in\mathrm{hom}_D(GX,GX) is the identity morphism. Let \eta_Y=\Phi_{Y,FY}(1_{FY})\in\mathrm{hom}_D(Y,GFY) for each in , where 1_{FY}\in\mathrm{hom}_C(FY,FY) is the identity morphism. The bijectivity and naturality of imply that each is a terminal morphism from to in , and each is an initial morphism from to in . The naturality of implies the naturality of and , and the two formulas \begin{align}\Phi_{Y,X}(f) = G(f)\circ \eta_Y\\ \Phi_{Y,X}^{-1}(g) = \varepsilon_X\circ F(g)\end{align} for each and (which completely determine ). Substituting for and for in the second formula gives the first counit–unit equation 1_{FY} = \varepsilon_{FY}\circ F(\eta_Y), and substituting for and ε X = Φ −1 GX, X (1 GX ) for in the first formula gives the second counit–unit equation 1_{GX} = G(\varepsilon_X)\circ\eta_{GX}.

Existence

Not every functor admits a left adjoint. If is a complete category, then the functors with left adjoints can be characterized by the adjoint functor theorem of Peter J. Freyd: has a left adjoint if and only if it is continuous and a certain smallness condition is satisfied: for every object of there exists a family of morphisms where the indices come from a set , not a proper class, such that every morphism can be written as for some in and some morphism An analogous statement characterizes those functors with a right adjoint. An important special case is that of locally presentable categories. If F : C \to D is a functor between locally presentable categories, then has a right adjoint if and only if preserves small colimits has a left adjoint if and only if preserves small limits and is an accessible functor

Uniqueness

If the functor has two right adjoints and , then and are naturally isomorphic. The same is true for left adjoints. Conversely, if is left adjoint to , and is naturally isomorphic to then is also left adjoint to . More generally, if is an adjunction (with counit–unit ) and are natural isomorphisms then is an adjunction where \begin{align} \eta' &= (\tau\ast\sigma)\circ\eta \\ \varepsilon' &= \varepsilon\circ(\sigma^{-1}\ast\tau^{-1}). \end{align} Here \circ denotes vertical composition of natural transformations, and \ast denotes horizontal composition.

Composition

Adjunctions can be composed in a natural fashion. Specifically, if is an adjunction between C and D and is an adjunction between and then the functor F \circ F' : E \rightarrow C is left adjoint to G' \circ G : C \to E. More precisely, there is an adjunction between and with unit and counit given respectively by the compositions: \begin{align} &1_{\mathcal E} \xrightarrow{\eta'} G' F' \xrightarrow{G' \eta F'} G' G F F' \\ &F F' G' G \xrightarrow{F \varepsilon' G} F G \xrightarrow{\varepsilon} 1_{\mathcal C}. \end{align} This new adjunction is called the composition of the two given adjunctions. Since there is also a natural way to define an identity adjunction between a category and itself, one can then form a category whose objects are all small categories and whose morphisms are adjunctions.

Limit preservation

The most important property of adjoints is their continuity: every functor that has a left adjoint (and therefore is a right adjoint) is continuous (i.e. commutes with limits in the category theoretical sense); every functor that has a right adjoint (and therefore is a left adjoint) is cocontinuous (i.e. commutes with colimits). Since many common constructions in mathematics are limits or colimits, this provides a wealth of information. For example: applying a right adjoint functor to a product of objects yields the product of the images; applying a left adjoint functor to a coproduct of objects yields the coproduct of the images; every right adjoint functor between two abelian categories is left exact; every left adjoint functor between two abelian categories is right exact.

Additivity

If and are preadditive categories and is an additive functor with a right adjoint , then is also an additive functor and the hom-set bijections \Phi_{Y,X} : \mathrm{hom}_{\mathcal C}(FY,X) \cong \mathrm{hom}_{\mathcal D}(Y,GX) are, in fact, isomorphisms of abelian groups. Dually, if G is additive with a left adjoint F, then F is also additive. Moreover, if both and are additive categories (i.e. preadditive categories with all finite biproducts), then any pair of adjoint functors between them are automatically additive.

Relationships

Universal constructions

As stated earlier, an adjunction between categories and gives rise to a family of universal morphisms, one for each object in and one for each object in . Conversely, if there exists a universal morphism to a functor from every object of , then has a left adjoint. However, universal constructions are more general than adjoint functors: a universal construction is like an optimization problem; it gives rise to an adjoint pair if and only if this problem has a solution for every object of (equivalently, every object of ).

Equivalences of categories

If a functor is one half of an equivalence of categories then it is the left adjoint in an adjoint equivalence of categories, i.e. an adjunction whose unit and counit are isomorphisms. Every adjunction extends an equivalence of certain subcategories. Define as the full subcategory of consisting of those objects of for which is an isomorphism, and define as the full subcategory of consisting of those objects of for which is an isomorphism. Then and can be restricted to and and yield inverse equivalences of these subcategories. In a sense, then, adjoints are "generalized" inverses. Note however that a right inverse of (i.e. a functor such that is naturally isomorphic to need not be a right (or left) adjoint of . Adjoints generalize two-sided inverses.

Monads

Every adjunction gives rise to an associated monad in the category . The functor T : \mathcal{D} \to \mathcal{D} is given by . The unit of the monad \eta : 1_{\mathcal{D}} \to T is just the unit of the adjunction and the multiplication transformation \mu : T^2 \to T\, is given by . Dually, the triple defines a comonad in . Every monad arises from some adjunction—in fact, typically from many adjunctions—in the above fashion. Two constructions, called the category of Eilenberg–Moore algebras and the Kleisli category are two extremal solutions to the problem of constructing an adjunction that gives rise to a given monad.

References

External links

– seven short lectures on adjunctions by Eugenia Cheng of The Catsters WildCats is a category theory package for Mathematica. Manipulation and visualization of objects, morphisms, categories, functors, natural transformations, universal properties.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1372690500 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.