So last post I gave a (hurried) description of why adjoint pairs of functors are linked to this notion of “similar structure” between two categories. In this post, I want to relate adjunctions to universal properties, and ultimately why we like adjoint pairs so much.
Say we’re working with the “free group on a set” functor, . We know that the free group satisfies a really nice universal property: Given any (set) function , where is a group, there exists a unique group homomorphism extending . If you recall the notion of the “forgetful” functor that takes a group and gives its underlying set, the universal property of the free group on states that there is a bijection
i.e. is an adjoint pair (of course, one should check the naturality of this bijection). Hence the universal property here is really just this adjunction in hiding. This idea is generalized often by saying that a category C has “free objects” if a suitably defined forgetful functor from C possesses a left adjoint.
It’s for this reason that I like to think of a pair of adjoint functors as a sort of “globally defined” universal property, as expressed by the naturality of the bijection between hom-sets. Indeed, we have that a functor has a left adjoint provided that we can find, for each object of C an object “” of D and a morphism that is universal among morphisms form to the image of , i.e. for all , there is a unique satisfying . I use the quotations here only to emphasize the fact that we really want the object “” to be “the component of some suitable functor at .”
I don’t know about you, but this sound a lot like: “For any functor , the comma category has an initial object.” (Remember, a functor simply selects an element of C.) That is, this sounds A LOT like how we initially (haha, pun) constructed universal properties from comma categories. The statement of the above paragraph then says that if we can find such an initial object for any choice of functor , then has a left adjoint. Pretty neat, right?