In mathematics, specifically category theory, adjunction is a relationship that two functors may have, 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 {displaystyle {mathcal {C}}} and {displaystyle {mathcal {D}}} is a pair of functors (assumed to be covariant) {displaystyle F:{mathcal {D}}rightarrow {mathcal {C}}}   and   {displaystyle G:{mathcal {C}}rightarrow {mathcal {D}}} and, for all objects {displaystyle X} in {displaystyle {mathcal {C}}} and {displaystyle Y} in {displaystyle {mathcal {D}}} a bijection between the respective morphism sets {displaystyle mathrm {hom} _{mathcal {C}}(FY,X)cong mathrm {hom} _{mathcal {D}}(Y,GX)} such that this family of bijections is natural in {displaystyle X} and {displaystyle Y} . Naturality here means that there are natural isomorphisms between the pair of functors {displaystyle {mathcal {C}}(F-,X):{mathcal {D}}to mathrm {Set} } and {displaystyle {mathcal {D}}(-,GX):{mathcal {D}}to mathrm {Set} } for a fixed {displaystyle X} in {displaystyle {mathcal {C}}} , and also the pair of functors {displaystyle {mathcal {C}}(FY,-):{mathcal {C}}to mathrm {Set} } and {displaystyle {mathcal {D}}(Y,G-):{mathcal {C}}to mathrm {Set} } for a fixed {displaystyle Y} in {displaystyle {mathcal {D}}} .

The functor {displaystyle F} is called a left adjoint functor or left adjoint to {displaystyle G} , while {displaystyle G} is called a right adjoint functor or right adjoint to {displaystyle F} .

An adjunction between categories {displaystyle {mathcal {C}}} and {displaystyle {mathcal {D}}} is somewhat akin to a "weak form" of an equivalence between {displaystyle {mathcal {C}}} and {displaystyle {mathcal {D}}} , and indeed every equivalence is an adjunction. In many situations, an adjunction can be "upgraded" to an equivalence, by a suitable natural modification of the involved categories and functors.

Contents 1 Terminology and notation 2 Introduction and Motivation 2.1 Solutions to optimization problems 2.2 Symmetry of optimization problems 3 Formal definitions 3.1 Conventions 3.2 Definition via universal morphisms 3.3 Definition via Hom-set adjunction 3.4 Definition via counit–unit adjunction 4 History 4.1 Ubiquity 5 Examples 5.1 Free groups 5.2 Free constructions and forgetful functors 5.3 Diagonal functors and limits 5.4 Colimits and diagonal functors 5.5 Further examples 5.5.1 Algebra 5.5.2 Topology 5.5.3 Posets 5.5.4 Category theory 5.5.5 Categorical logic 5.5.6 Probability 6 Adjunctions in full 6.1 Universal morphisms induce hom-set adjunction 6.2 counit–unit adjunction induces hom-set adjunction 6.3 Hom-set adjunction induces all of the above 7 Properties 7.1 Existence 7.2 Uniqueness 7.3 Composition 7.4 Limit preservation 7.5 Additivity 8 Relationships 8.1 Universal constructions 8.2 Equivalences of categories 8.3 Monads 9 Notes 10 References 11 External links Terminology and notation The terms adjoint and adjunct are both used, and are cognates: one is taken directly from Latin, the other from Latin via French. In the classic text Categories for the working mathematician, Mac Lane makes a distinction between the two. Given a family {displaystyle varphi _{XY}:mathrm {hom} _{mathcal {C}}(FY,X)cong mathrm {hom} _{mathcal {D}}(Y,GX)} of hom-set bijections, we call {displaystyle varphi } an adjunction or an adjunction between {displaystyle F} and {displaystyle G} . If {displaystyle f} is an arrow in {displaystyle mathrm {hom} _{mathcal {C}}(FY,X)} , {displaystyle varphi f} is the right adjunct of {displaystyle f} (p. 81). The functor {displaystyle F} is left adjoint to {displaystyle G} , and {displaystyle G} is right adjoint to {displaystyle F} . (Note that {displaystyle G} may have itself a right adjoint that is quite different from {displaystyle F} ; see below for an example.) In general, the phrases " {displaystyle F} is a left adjoint" and " {displaystyle F} has a right adjoint" are equivalent.

If F is left adjoint to G, we also write {displaystyle Fdashv G.} The terminology comes from the Hilbert space idea of adjoint operators {displaystyle T} , {displaystyle U} with {displaystyle langle Ty,xrangle =langle y,Uxrangle } , 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.[1] Introduction and Motivation The slogan is "Adjoint functors arise everywhere".

— Saunders Mac Lane, Categories for the Working Mathematician The long list of examples in this article indicates that common mathematical constructions are very often adjoint functors. Consequently, general theorems about left/right adjoint functors encode the details of many useful and otherwise non-trivial results. Such general theorems include the equivalence of the various definitions of adjoint functors, the uniqueness of a right adjoint for a given left adjoint, the fact that left/right adjoint functors respectively preserve colimits/limits (which are also found in every area of mathematics), and the general adjoint functor theorems giving conditions under which a given functor is a left/right adjoint.

Solutions to optimization problems In a sense, an adjoint functor is a way of giving the most efficient solution to some problem via a method which is formulaic. For example, an elementary problem in ring theory is how to turn a rng (which is like a ring that might not have a multiplicative identity) into a ring. The most efficient way is to adjoin an element '1' to the rng, adjoin all (and only) the elements which are necessary for satisfying the ring axioms (e.g. r+1 for each r in the ring), and impose no relations in the newly formed ring that are not forced by axioms. Moreover, this construction is formulaic in the sense that it works in essentially the same way for any rng.

This is rather vague, though suggestive, and can be made precise in the language of category theory: a construction is most efficient if it satisfies a universal property, and is formulaic if it defines a functor. Universal properties come in two types: initial properties and terminal properties. Since these are dual notions, it is only necessary to discuss one of them.

The idea of using an initial property is to set up the problem in terms of some auxiliary category E, so that the problem at hand corresponds to finding an initial object of E. This has an advantage that the optimization—the sense that the process finds the most efficient solution—means something rigorous and is recognisable, rather like the attainment of a supremum. The category E is also formulaic in this construction, since it is always the category of elements of the functor to which one is constructing an adjoint.

Back to our example: take the given rng R, and make a category E whose objects are rng homomorphisms R → S, with S a ring having a multiplicative identity. The morphisms in E between R → S1 and R → S2 are commutative triangles of the form (R → S1, R → S2, S1 → S2) where S1 → S2 is a ring map (which preserves the identity). (Note that this is precisely the definition of the comma category of R over the inclusion of unitary rings into rng.) The existence of a morphism between R → S1 and R → S2 implies that S1 is at least as efficient a solution as S2 to our problem: S2 can have more adjoined elements and/or more relations not imposed by axioms than S1. Therefore, the assertion that an object R → R* is initial in E, that is, that there is a morphism from it to any other element of E, means that the ring R* is a most efficient solution to our problem.

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 R → R* 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 which 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 a great deal of tedious 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 which live in one of two categories C and D which 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 which live in the category C, the letters Y, G, g, η will consistently denote things which 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).

Definition via universal morphisms By definition, a functor {displaystyle F:Dto C} is a left adjoint functor if for each object {displaystyle X} in {displaystyle C} there exists a universal morphism from {displaystyle F} to {displaystyle X} . Spelled out, this means that for each object {displaystyle X} in {displaystyle C} there exists an object {displaystyle G(X)} in {displaystyle D} and a morphism {displaystyle epsilon _{X}:F(G(X))to X} such that for every object {displaystyle Y} in {displaystyle D} and every morphism {displaystyle f:F(Y)to X} there exists a unique morphism {displaystyle g:Yto G(X)} with {displaystyle epsilon _{X}circ F(g)=f} .

The latter equation is expressed by the following commutative diagram: In this situation, one can show that {displaystyle G} can be turned into a functor {displaystyle G:Cto D} in a unique way such that {displaystyle epsilon _{X}circ F(G(f))=fcirc epsilon _{X'}} for all morphisms {displaystyle f:X'to X} in {displaystyle C} ; {displaystyle F} is then called a left adjoint to {displaystyle G} .

Similarly, we may define right-adjoint functors. A functor {displaystyle G:Cto D} is a right adjoint functor if for each object {displaystyle Y} in {displaystyle D} , there exists a universal morphism from {displaystyle Y} to {displaystyle G} . Spelled out, this means that for each object {displaystyle Y} in {displaystyle D} , there exists an object {displaystyle F(Y)} in {displaystyle C} and a morphism {displaystyle eta _{Y}:Yto G(F(Y))} such that for every object {displaystyle X} in {displaystyle C} and every morphism {displaystyle g:Yto G(X)} there exists a unique morphism {displaystyle f:F(Y)to X} with {displaystyle G(f)circ eta _{Y}=g} .

Again, this {displaystyle F} can be uniquely turned into a functor {displaystyle F:Dto C} such that {displaystyle G(F(g))circ eta _{Y}=eta _{Y'}circ g} for {displaystyle g:Yto Y'} a morphism in {displaystyle D} ; {displaystyle G} is then called a right adjoint to {displaystyle F} .

It is true, as the terminology implies, that {displaystyle F} is left adjoint to {displaystyle G} if and only if {displaystyle G} is right adjoint to {displaystyle 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-set adjunction A hom-set adjunction between two categories C and D consists of two functors F : D → C and G : C → D and a natural isomorphism {displaystyle Phi :mathrm {hom} _{C}(F-,-)to mathrm {hom} _{D}(-,G-)} .

This specifies a family of bijections {displaystyle Phi _{Y,X}:mathrm {hom} _{C}(FY,X)to mathrm {hom} _{D}(Y,GX)} for all objects X in C and Y in 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 somewhat more difficult to satisfy 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 Φ as a natural isomorphism, one must recognize homC(F–, –) and homD(–, G–) as functors. In fact, they are both bifunctors from Dop × C to Set (the category of sets). For details, see the article on hom functors. Explicitly, the naturality of Φ means that for all morphisms f : X → X′ in C and all morphisms g : Y′ → Y in D the following diagram commutes: The vertical arrows in this diagram are those induced by composition. Formally, Hom(Fg, f) : HomC(FY, X) → HomC(FY′, X′) is given by h → f o h o Fg for each h in HomC(FY, X). Hom(g, Gf) is similar.

Definition via counit–unit adjunction A counit–unit adjunction between two categories C and D consists of two functors F : D → C and G : C → D and two natural transformations {displaystyle {begin{aligned}varepsilon &:FGto 1_{mathcal {C}}\eta &:1_{mathcal {D}}to GFend{aligned}}} respectively called the counit and the unit of the adjunction (terminology from universal algebra), such that the compositions {displaystyle F{xrightarrow {;Feta ;}}FGF{xrightarrow {;varepsilon F,}}F} {displaystyle G{xrightarrow {;eta G;}}GFG{xrightarrow {;Gvarepsilon ,}}G} are the identity transformations 1F and 1G on F and G respectively.

In this situation we say that F is left adjoint to G and G is right adjoint to F , and may indicate this relationship by writing   {displaystyle (varepsilon ,eta ):Fdashv G}  , or simply   {displaystyle Fdashv G}  .

In equation form, the above conditions on (ε,η) are the counit–unit equations {displaystyle {begin{aligned}1_{F}&=varepsilon Fcirc Feta \1_{G}&=Gvarepsilon circ eta Gend{aligned}}} which mean that for each X in C and each Y in D, {displaystyle {begin{aligned}1_{FY}&=varepsilon _{FY}circ F(eta _{Y})\1_{GX}&=G(varepsilon _{X})circ eta _{GX}end{aligned}}} .

Note that {displaystyle 1_{mathcal {C}}} denotes the identify functor on the category {displaystyle {mathcal {C}}} , {displaystyle 1_{F}} denotes the identity natural transformation from the functor F to itself, and {displaystyle 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 {displaystyle 1=varepsilon circ eta } and then fill in either F or G in one of the two simple ways which 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 will satisfy terminal properties, and dually. The term unit here is borrowed from the theory of monads where it looks like the insertion of the identity 1 into a monoid.

History The idea of adjoint functors was introduced by Daniel Kan in 1958.[2] 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 hom(F(X), Y) = hom(X, G(Y)) in the category of abelian groups, where F was the functor {displaystyle -otimes A} (i.e. take the tensor product with A), and G was the functor hom(A,–) (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 X × A to Y. 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.

Ubiquity If one starts looking for these adjoint pairs of functors, they turn out to be very common in abstract algebra, and elsewhere as well. The example section below provides evidence of this; furthermore, universal constructions, which may be more familiar to some, give rise to numerous adjoint pairs of functors.

In accordance with the thinking of Saunders Mac Lane, any idea, such as adjoint functors, that occurs widely enough in mathematics should be studied for its own sake.[citation needed] Concepts can be judged according to their use in solving problems, as well as for their use in building theories. The tension between these two motivations was especially great during the 1950s when category theory was initially developed. Enter Alexander Grothendieck, who used category theory to take compass bearings in other work—in functional analysis, homological algebra and finally algebraic geometry.

It is probably wrong to say that he promoted the adjoint functor concept in isolation: but recognition of the role of adjunction was inherent in Grothendieck's approach. For example, one of his major achievements was the formulation of Serre duality in relative form—loosely, in a continuous family of algebraic varieties. The entire proof turned on the existence of a right adjoint to a certain functor. This is something undeniably abstract, and non-constructive[discuss], but also powerful in its own way.

Examples Free groups The construction of free groups is a common and illuminating example.

Let F : Set → Grp be the functor assigning to each set Y the free group generated by the elements of Y, and let G : Grp → Set be the forgetful functor, which assigns to each group X its underlying set. Then F is left adjoint to G: Initial morphisms. For each set Y, the set GFY is just the underlying set of the free group FY generated by Y. Let   {displaystyle eta _{Y}:Yto GFY}   be the set map given by "inclusion of generators". This is an initial morphism from Y to G, because any set map from Y to the underlying set GW of some group W will factor through   {displaystyle eta _{Y}:Yto GFY}   via a unique group homomorphism from FY to W. This is precisely the universal property of the free group on Y.

Terminal morphisms. For each group X, the group FGX is the free group generated freely by GX, the elements of X. Let   {displaystyle varepsilon _{X}:FGXto X}   be the group homomorphism which sends the generators of FGX to the elements of X they correspond to, which exists by the universal property of free groups. Then each   {displaystyle (GX,varepsilon _{X})}   is a terminal morphism from F to X, because any group homomorphism from a free group FZ to X will factor through   {displaystyle varepsilon _{X}:FGXto X}   via a unique set map from Z to GX. This means that (F,G) is an adjoint pair.

Hom-set adjunction. Group homomorphisms from the free group FY to a group X correspond precisely to maps from the set Y to the set GX: each homomorphism from FY to X is fully determined by its action on generators, another restatement of the universal property of free groups. One can verify directly that this correspondence is a natural transformation, which means it is a hom-set adjunction for the pair (F,G).

counit–unit adjunction. One can also verify directly that ε and η are natural. Then, a direct verification that they form a counit–unit adjunction   {displaystyle (varepsilon ,eta ):Fdashv G}   is as follows: The first counit–unit equation   {displaystyle 1_{F}=varepsilon Fcirc Feta }   says that for each set Y the composition {displaystyle FY{xrightarrow {;F(eta _{Y});}}FGFY{xrightarrow {;varepsilon _{FY},}}FY} should be the identity. The intermediate group FGFY is the free group generated freely by the words of the free group FY. (Think of these words as placed in parentheses to indicate that they are independent generators.) The arrow   {displaystyle F(eta _{Y})}   is the group homomorphism from FY into FGFY sending each generator y of FY to the corresponding word of length one (y) as a generator of FGFY. The arrow   {displaystyle varepsilon _{FY}}   is the group homomorphism from FGFY to FY sending each generator to the word of FY it corresponds to (so this map is "dropping parentheses"). The composition of these maps is indeed the identity on FY.

The second counit–unit equation   {displaystyle 1_{G}=Gvarepsilon circ eta G}   says that for each group X the composition   {displaystyle GX{xrightarrow {;eta _{GX};}}GFGX{xrightarrow {;G(varepsilon _{X}),}}GX}   should be the identity. The intermediate set GFGX is just the underlying set of FGX. The arrow   {displaystyle eta _{GX}}   is the "inclusion of generators" set map from the set GX to the set GFGX. The arrow   {displaystyle G(varepsilon _{X})}   is the set map from GFGX to GX which underlies the group homomorphism sending each generator of FGX to the element of X it corresponds to ("dropping parentheses"). The composition of these maps is indeed the identity on GX.

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, fibred products, 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.

Products Let Π : Grp2 → Grp the functor which assigns to each pair (X1, X2) the product group X1×X2, and let Δ : Grp → Grp2 be the diagonal functor which assigns to every group X the pair (X, X) in the product category Grp2. The universal property of the product group shows that Π is right-adjoint to Δ. The counit of this adjunction is the defining pair of projection maps from X1×X2 to X1 and X2 which define the limit, and the unit is the diagonal inclusion of a group X into X×X (mapping x to (x,x)). The cartesian product of sets, the product of rings, the product of topological spaces etc. follow the same pattern; it can also be extended in a straightforward manner to more than just two factors. More generally, any type of limit is right adjoint to a diagonal functor. Kernels. Consider the category D of homomorphisms of abelian groups. If f1 : A1 → B1 and f2 : A2 → B2 are two objects of D, then a morphism from f1 to f2 is a pair (gA, gB) of morphisms such that gBf1 = f2gA. Let G : D → Ab be the functor which assigns to each homomorphism its kernel and let F : Ab → D be the functor which maps the group A to the homomorphism A → 0. Then G is right adjoint to F, which expresses the universal property of kernels. The counit of this adjunction is the defining embedding of a homomorphism's kernel into the homomorphism's domain, and the unit is the morphism identifying a group A with the kernel of the homomorphism A → 0. A suitable variation of this example also shows that the kernel functors for vector spaces and for modules are right adjoints. Analogously, one can show that the cokernel functors for abelian groups, vector spaces and modules are left adjoints. Colimits and diagonal functors Coproducts, fibred coproducts, 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.

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.

Define a category based on {displaystyle mathbb {R} } , with objects being the real numbers, and the morphisms being "affine functions evaluated at a point". That is, for any affine function {displaystyle f(x)=ax+b} and any real number {displaystyle r} , define a morphism {displaystyle (r,f):rto f(r)} .

Define a category based on {displaystyle M(mathbb {R} )} , the set of probability distribution on {displaystyle mathbb {R} } with finite expectation. Define morphisms on {displaystyle M(mathbb {R} )} as "affine functions evaluated at a distribution". That is, for any affine function {displaystyle f(x)=ax+b} and any {displaystyle mu in M(mathbb {R} )} , define a morphism {displaystyle (mu ,f):rto mu circ f^{-1}} .

Then, the Dirac delta measure defines a functor: {displaystyle delta :xmapsto delta _{x}} , and the expectation defines another functor {displaystyle mathbb {E} :mu mapsto mathbb {E} [mu ]} , and they are adjoint: {displaystyle mathbb {E} dashv delta } . (Somewhat disconcertingly, {displaystyle mathbb {E} } is the left adjoint, even though {displaystyle mathbb {E} } is "forgetful" and {displaystyle 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 C and D consists of A functor F : D → C called the left adjoint A functor G : C → D called the right adjoint A natural isomorphism Φ : homC(F–,–) → homD(–,G–) A natural transformation ε : FG → 1C called the counit A natural transformation η : 1D → GF called the unit An equivalent formulation, where X denotes any object of C and Y denotes any object of D, is as follows: For every C-morphism f : FY → X, there is a unique D-morphism ΦY, X(f) = g : Y → GX such that the diagrams below commute, and for every D-morphism g : Y → GX, there is a unique C-morphism Φ−1Y, X(g) = f : FY → X in C such that the diagrams below commute: From this assertion, one can recover that: The transformations ε, η, and Φ are related by the equations {displaystyle {begin{aligned}f=Phi _{Y,X}^{-1}(g)&=varepsilon _{X}circ F(g)&in &,,mathrm {hom} _{C}(F(Y),X)\g=Phi _{Y,X}(f)&=G(f)circ eta _{Y}&in &,,mathrm {hom} _{D}(Y,G(X))\Phi _{GX,X}^{-1}(1_{GX})&=varepsilon _{X}&in &,,mathrm {hom} _{C}(FG(X),X)\Phi _{Y,FY}(1_{FY})&=eta _{Y}&in &,,mathrm {hom} _{D}(Y,GF(Y))\end{aligned}}} The transformations ε, η satisfy the counit–unit equations {displaystyle {begin{aligned}1_{FY}&=varepsilon _{FY}circ F(eta _{Y})\1_{GX}&=G(varepsilon _{X})circ eta _{GX}end{aligned}}} Each pair (GX, εX) is a terminal morphism from F to X in C Each pair (FY, ηY) is an initial morphism from Y to G in D In particular, the equations above allow one to define Φ, ε, and η in terms of any one of the three. However, the adjoint functors F and G 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 G : C → D; in the sense of initial morphisms, one may construct the induced hom-set adjunction by doing the following steps.

Construct a functor F : D → C and a natural transformation η. For each object Y in D, choose an initial morphism (F(Y), ηY) from Y to G, so that ηY : Y → G(F(Y)). We have the map of F on objects and the family of morphisms η. For each f : Y0 → Y1, as (F(Y0), ηY0) is an initial morphism, then factorize ηY1 o f with ηY0 and get F(f) : F(Y0) → F(Y1). This is the map of F on morphisms. The commuting diagram of that factorization implies the commuting diagram of natural transformations, so η : 1D → G o F is a natural transformation. Uniqueness of that factorization and that G is a functor implies that the map of F on morphisms preserves compositions and identities. Construct a natural isomorphism Φ : homC(F-,-) → homD(-,G-). For each object X in C, each object Y in D, as (F(Y), ηY) is an initial morphism, then ΦY, X is a bijection, where ΦY, X(f : F(Y) → X) = G(f) o ηY. η is a natural transformation, G is a functor, then for any objects X0, X1 in C, any objects Y0, Y1 in D, any x : X0 → X1, any y : Y1 → Y0, we have ΦY1, X1(x o f o F(y)) = G(x) o G(f) o G(F(y)) o ηY1 = G(x) o G(f) o ηY0 o y = G(x) o ΦY0, X0(f) o y, 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 F : D → C, G : C → D, and a counit–unit adjunction (ε, η) : F {displaystyle dashv } G, we can construct a hom-set adjunction by finding the natural transformation Φ : homC(F-,-) → homD(-,G-) in the following steps: For each f : FY → X and each g : Y → GX, define {displaystyle {begin{aligned}Phi _{Y,X}(f)=G(f)circ eta _{Y}\Psi _{Y,X}(g)=varepsilon _{X}circ F(g)end{aligned}}} The transformations Φ and Ψ are natural because η and ε are natural. Using, in order, that F is a functor, that ε is natural, and the counit–unit equation 1FY = εFY o F(ηY), we obtain {displaystyle {begin{aligned}Psi Phi f&=varepsilon _{X}circ FG(f)circ F(eta _{Y})\&=fcirc varepsilon _{FY}circ F(eta _{Y})\&=fcirc 1_{FY}=fend{aligned}}} hence ΨΦ is the identity transformation. Dually, using that G is a functor, that η is natural, and the counit–unit equation 1GX = G(εX) o ηGX, we obtain {displaystyle {begin{aligned}Phi Psi g&=G(varepsilon _{X})circ GF(g)circ eta _{Y}\&=G(varepsilon _{X})circ eta _{GX}circ g\&=1_{GX}circ g=gend{aligned}}} hence ΦΨ is the identity transformation. Thus Φ is a natural isomorphism with inverse Φ−1 = Ψ. Hom-set adjunction induces all of the above Given functors F : D → C, G : C → D, and a hom-set adjunction Φ : homC(F-,-) → homD(-,G-), one can construct a counit–unit adjunction {displaystyle (varepsilon ,eta ):Fdashv G}  , which defines families of initial and terminal morphisms, in the following steps: Let   {displaystyle varepsilon _{X}=Phi _{GX,X}^{-1}(1_{GX})in mathrm {hom} _{C}(FGX,X)}   for each X in C, where   {displaystyle 1_{GX}in mathrm {hom} _{D}(GX,GX)}   is the identity morphism. Let   {displaystyle eta _{Y}=Phi _{Y,FY}(1_{FY})in mathrm {hom} _{D}(Y,GFY)}   for each Y in D, where   {displaystyle 1_{FY}in mathrm {hom} _{C}(FY,FY)}   is the identity morphism. The bijectivity and naturality of Φ imply that each (GX, εX) is a terminal morphism from F to X in C, and each (FY, ηY) is an initial morphism from Y to G in D. The naturality of Φ implies the naturality of ε and η, and the two formulas {displaystyle {begin{aligned}Phi _{Y,X}(f)=G(f)circ eta _{Y}\Phi _{Y,X}^{-1}(g)=varepsilon _{X}circ F(g)end{aligned}}} for each f: FY → X and g: Y → GX (which completely determine Φ). Substituting FY for X and ηY = ΦY, FY(1FY) for g in the second formula gives the first counit–unit equation {displaystyle 1_{FY}=varepsilon _{FY}circ F(eta _{Y})} , and substituting GX for Y and εX = Φ−1GX, X(1GX) for f in the first formula gives the second counit–unit equation {displaystyle 1_{GX}=G(varepsilon _{X})circ eta _{GX}} . Properties Existence See also: Formal criteria for adjoint functors Not every functor G : C → D admits a left adjoint. If C is a complete category, then the functors with left adjoints can be characterized by the adjoint functor theorem of Peter J. Freyd: G has a left adjoint if and only if it is continuous and a certain smallness condition is satisfied: for every object Y of D there exists a family of morphisms fi : Y → G(Xi) where the indices i come from a set I, not a proper class, such that every morphism h : Y → G(X) can be written as h = G(t) o fi for some i in I and some morphism t : Xi → X in C.

An analogous statement characterizes those functors with a right adjoint.

An important special case is that of locally presentable categories. If {displaystyle F:Cto D} is a functor between locally presentable categories, then F has a right adjoint if and only if F preserves small colimits F has a left adjoint if and only if F preserves small limits and is an accessible functor Uniqueness If the functor F : D → C has two right adjoints G and G′, then G and G′ are naturally isomorphic. The same is true for left adjoints.

Conversely, if F is left adjoint to G, and G is naturally isomorphic to G′ then F is also left adjoint to G′. More generally, if 〈F, G, ε, η〉 is an adjunction (with counit–unit (ε,η)) and σ : F → F′ τ : G → G′ are natural isomorphisms then 〈F′, G′, ε′, η′〉 is an adjunction where {displaystyle {begin{aligned}eta '&=(tau ast sigma )circ eta \varepsilon '&=varepsilon circ (sigma ^{-1}ast tau ^{-1}).end{aligned}}} Here {displaystyle circ } denotes vertical composition of natural transformations, and {displaystyle ast } denotes horizontal composition.

Composition Adjunctions can be composed in a natural fashion. Specifically, if 〈F, G, ε, η〉 is an adjunction between C and D and 〈F′, G′, ε′, η′〉 is an adjunction between D and E then the functor {displaystyle Fcirc F':Erightarrow C} is left adjoint to {displaystyle G'circ G:Cto E.} More precisely, there is an adjunction between F F' and G' G with unit and counit given respectively by the compositions: {displaystyle {begin{aligned}&1_{mathcal {E}}{xrightarrow {eta '}}G'F'{xrightarrow {G'eta F'}}G'GFF'\&FF'G'G{xrightarrow {Fvarepsilon 'G}}FG{xrightarrow {varepsilon }}1_{mathcal {C}}.end{aligned}}} 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 C 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 C and D are preadditive categories and F : D → C is an additive functor with a right adjoint G : C → D, then G is also an additive functor and the hom-set bijections {displaystyle 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 C and D 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 C and D gives rise to a family of universal morphisms, one for each object in C and one for each object in D. Conversely, if there exists a universal morphism to a functor G : C → D from every object of D, then G 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 D (equivalently, every object of C).

Equivalences of categories If a functor F : D → C 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 〈F, G, ε, η〉 extends an equivalence of certain subcategories. Define C1 as the full subcategory of C consisting of those objects X of C for which εX is an isomorphism, and define D1 as the full subcategory of D consisting of those objects Y of D for which ηY is an isomorphism. Then F and G can be restricted to D1 and C1 and yield inverse equivalences of these subcategories.

In a sense, then, adjoints are "generalized" inverses. Note however that a right inverse of F (i.e. a functor G such that FG is naturally isomorphic to 1D) need not be a right (or left) adjoint of F. Adjoints generalize two-sided inverses.

Monads Every adjunction 〈F, G, ε, η〉 gives rise to an associated monad 〈T, η, μ〉 in the category D. The functor {displaystyle T:{mathcal {D}}to {mathcal {D}}} is given by T = GF. The unit of the monad {displaystyle eta :1_{mathcal {D}}to T} is just the unit η of the adjunction and the multiplication transformation {displaystyle mu :T^{2}to T,} is given by μ = GεF. Dually, the triple 〈FG, ε, FηG〉 defines a comonad in C.

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.

Notes ^ Baez, John C. (1996). "Higher-Dimensional Algebra II: 2-Hilbert Spaces". arXiv:q-alg/9609018. ^ Kan, Daniel M. (1958). "Adjoint Functors" (PDF). Transactions of the American Mathematical Society. 87 (2): 294–329. doi:10.2307/1993102. ^ Lawvere, F. William, "Adjointness in foundations", Dialectica, 1969. The notation is different nowadays; an easier introduction by Peter Smith in these lecture notes, which also attribute the concept to the article cited. ^ "Indiscrete category". nLab. ^ Mac Lane, Saunders; Moerdijk, Ieke (1992) Sheaves in Geometry and Logic, Springer-Verlag. ISBN 0-387-97710-4 See page 58 References Adámek, Jiří; Herrlich, Horst; Strecker, George E. (1990). Abstract and Concrete Categories. The joy of cats (PDF). John Wiley & Sons. ISBN 0-471-60922-6. Zbl 0695.18001. Mac Lane, Saunders (1998). Categories for the Working Mathematician. Graduate Texts in Mathematics. Vol. 5 (2nd ed.). Springer-Verlag. ISBN 0-387-98403-8. Zbl 0906.18001. External links Adjunctions playlist on YouTube – 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. hide vte Category theory hide Key concepts Key concepts CategoryAdjoint functorsCCCCommutative diagramConcrete categoryEndExponentialFunctorKan extensionMorphismNatural transformationUniversal property Universal constructions Limits Terminal objectsProductsEqualizers KernelsPullbacksInverse limit Colimits Initial objectsCoproductsCoequalizers Cokernels and quotientsPushoutDirect limit Algebraic categories SetsRelationsMagmasGroupsAbelian groupsRings (Fields)Modules (Vector spaces) Constructions on categories Free categoryFunctor categoryKleisli categoryOpposite categoryQuotient categoryProduct categoryComma categorySubcategory show Higher category theory Category Outline Glossary show vte Functor types Categories: Adjoint functors

Si quieres conocer otros artículos parecidos a Adjoint functors puedes visitar la categoría Adjoint functors.

Subir

Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información