## Adjoint functors

Today I return to the discussion of universals, limits, representability, and related topics. The last piece of this puzzle is the notion of an adjunction. I’ll give a definition and examples today and work out properties later.

An adjunction between categories and consists of a pair of functors and and a natural isomorphism . Notice that the functors on either side of go from to , so each component is a bijection of sets. We say that is “left adjoint” to , and conversely that is “right adjoint” to , and we write .

Now, we have been seeing these things all along our trip so far, but without mentioning them as such. For instance, we have all the “free” constructions:

- the free monoid on a set
- the free group on a set
- the free group on a monoid
- the semigroup ring
- the free ring on an abelian group
- the free module on a set
- the free algebra on a module

and maybe more that I’ve mentioned, but don’t recall.

These all have a very similar form in their definitions. For instance, the free monoid on a set is characterized by the following universal property: every function from into the underlying set of a monoid extends uniquely to a monoid homomorphism . If we write the underlying set of as , we easily see that is a functor. The condition then is that every element of the hom-set corresponds to exactly one element of the hom-set , and every monoid homomorphism restricts to a function on . That is, for every set and monoid we have an isomorphism of sets .

Now, given a function from a set to a set we can consider to be a subset of the free monoid on itself, giving a function . This extends to a unique monoid homomorphism . This construction preserves identities and compositions, making into a functor from to .

If we have a function and a monoid homomorphism then we can build functions and . The isomorphisms and commute with these arrows, so they form the components of a natural isomorphism between the two functors. This proves that the free monoid functor is a left adjoint to the forgetful functor .

All the other examples listed above go exactly the same way, giving left adjoints to all the forgetful functors.

As a slightly different example, we have a forgetful functor that takes an abelian group and “forgets” that it’s abelian, leaving just a group. Conversely, we can take any group and take the quotient by its commutator subgroup to get an abelian group. This satisfies the property that for any group homomorphism from to an abelian group (considered as just a group) there is a unique homomorphism of abelian groups . Thus it turns out that “abelianization” of a group is left adjoint to the forgetful functor from abelian groups to groups.

There are more explicit examples we’ve seen, but I’ll leave them to illustrate some particular properties of adjoints. Take note, though, that not all adjunctions involve forgetful functors like these examples have.

An adjunction between two categories can be seen as a weaker version of an equivalence. An equivalence given by functors and tells us that both and are fully faithful, so . Now let’s put to find that , where the last isomorphism uses the natural isomorphism . So every equivalence is an adjunction.

A very nice introduction to adjoints. I found them scary when I didn’t know them but now one of my favorite things in math is to “play around with adjunctions”, which Grothendieck called ‘functor yoga’!

Comment by ulfarsson | July 17, 2007 |

[…] Unit and Counit of an Adjunction Let’s say we have an adjunction . That is, functors and and a natural isomorphism […]

Pingback by The Unit and Counit of an Adjunction « The Unapologetic Mathematician | July 17, 2007 |

You might enjoy a physicist applying functor theory to elementary particles, kea-monad.blogspot.com. It’s all quite enough to make my head hurt.

Comment by carlbrannen | July 19, 2007 |

[…] and universality Now we have the notion of an adjunction, along with its unit and counit. It’s time to start tying them back into […]

Pingback by Adjoints and universality « The Unapologetic Mathematician | July 19, 2007 |

[…] of Adjoints And now we go back to adjoints. Like every other structure out there, we want to come up with some analogue of a homomorphism […]

Pingback by Transformations of Adjoints « The Unapologetic Mathematician | July 30, 2007 |

[…] gives us a “forgetful” functor which returns the underlying sets and functions. Then as we saw, we often have a left adjoint to this forgetful functor giving the “free” structure […]

Pingback by Free Monoid Objects « The Unapologetic Mathematician | August 2, 2007 |

[…] they give another 2-category: . The objects here again are categories, but now the 1-morphisms are adjunctions between categories. And then we have conjugate pairs between adjunctions, with the […]

Pingback by 2-Categories « The Unapologetic Mathematician | August 16, 2007 |

[…] But I’ve been thinking about it. I’ll also have to check up on some of my references to see if they can tell me how to do what I’m pretty sure can be done, or I’ll just have to cobble it together myself. But it’s pretty cool. I’ll give you one hint: look how I started my discussions of adjoint functors. […]

Pingback by Nothing today « The Unapologetic Mathematician | August 25, 2007 |

[…] When I started in on adjoint functors, I gave the definition in terms of a bijection of hom-sets. Then I showed that we can also specify […]

Pingback by Enriched Adjunctions « The Unapologetic Mathematician | September 4, 2007 |

I agree with ulfarsson that this is a very nice presentation. I was surprised when I first tried to learn about these things that the discussion in Mac Lane (1971), which, like this one, focusses on the bijection between Hom-sets, made more sense to me than the more commonly found introductory discussions starting with the unit (most of Mac Lane is of course much too hard for me, which is as it should be!)

Intuitively for me, I find that the unit-based version looks like something that just comes in thru the window and lands on your plate in front of you, rather than appearing to have a sensible antecedent background (until it’s derived from the bijection, of course).

Comment by MathOutsider | October 26, 2007 |

[…] I want to mention a topic I thought I’d hit back when we talked about adjoint functors. We know that every poset is a category, with the elements as objects and a single arrow from to […]

Pingback by Galois Connections « The Unapologetic Mathematician | May 18, 2009 |

[…] should recall the relation between two adjoint functors. An important difference here is that there is no distinction between left- and right-adjoint […]

Pingback by Adjoint Transformations « The Unapologetic Mathematician | May 22, 2009 |

[…] proof is perhaps best thought of as a general phenomenon involving adjoint functors, but there is a quick (if less enlightening) direct proof […]

Pingback by Completions of rings and modules « Delta Epsilons | August 25, 2009 |

[…] algebra on the vector space . That’s a tip-off that we’re thinking should be the left adjoint of the “forgetful” functor which sends a graded-commutative algebra to its underlying […]

Pingback by Functoriality of Tensor Algebras « The Unapologetic Mathematician | October 28, 2009 |

[…] adjoint functor. For more about adjoints, see (in no particular order) posts at Concrete Nonsense, the Unapologetic Mathematician, and Topological […]

Pingback by Some adjoint functors « Annoying Precision | October 29, 2009 |

[…] we come to the real version of Frobenius reciprocity. It takes the form of an adjunction between the functors of induction and […]

Pingback by (Real) Frobenius Reciprocity « The Unapologetic Mathematician | December 3, 2010 |