We say that two functors $L:C\to D$ and $R:D\to C$ are adjoint if they form an adjunction $L \dashv R$ in the 2-category Cat of categories. This means that they are equipped with natural transformations $\eta: 1_C \to R \circ L$ and $\epsilon: L \circ R \to 1_D$ satisfying the triangle identities, that is the compositions $L \stackrel{L\eta}\to L R L\stackrel{\epsilon L}\to L$ and $R\stackrel{\eta R}\to R L R \stackrel{R\epsilon}\to R$ are identities. The left or right adjoint of any functor, if it exists, is unique up to unique isomorphism.
We say that $L$ is the left adjoint of $R$ and that $R$ is the right adjoint of $L$.
In the case of Cat, there are a number of equivalent characterizations of an adjunction, some of which are given below.
An adjunction $L\dashv R$ is equivalently given by a natural isomorphism of hom-functors $C^{op} \times D \to Set$
In other words, for all $c \in C$ and $d \in D$ there is a bijection of sets
naturally in $c$ and $d$. This isomorphism is the adjunction isomorphism and the image of an element under this isomorphism is its adjunct.
Given such an adjunction isomorphism, $\eta$ and $\epsilon$ can be recovered as the adjuncts of identity morphisms. The Yoneda lemma ensures that the entire adjunction isomorphism can be recovered from them by composition: the adjunct of $f:L(c)\to d$ is $R(f) \eta$, and the adjunct of $g:c \to R(d)$ is $\epsilon L(g)$. The triangle identities are precisely what is necessary to ensure that this is an isomorphism.
A functor $L:C\to D$ has a right adjoint if and only if for all $d$, the presheaf $Hom_D(L(-),d):C^{op}\to Set$ is representable, i.e. there exists an object $R(d)$ and a natural isomorphism
There is then a unique way to define $R$ on arrows so as to make these isomorphisms natural in $d$ as well.
In more fancy language, by precomposition $L$ defines a functor
of presheaf categories. By restriction along the Yoneda embedding $Y : D \to [D^{op}, Set]$ this yields the functor
such that
If for all $d \in D$ this presheaf $\bar L(d)$ is representable, then it is functorially so in that there exists a functor $R : D \to C$ such that
This definition has the advantage that it yields useful information even if the adjoint functor $R$ does not exist globally, i.e. as a functor on all of $D$:
it may happen that
is representable for some $d$ but not for all $d$. The representing object may still usefully be thought of as $R(d)$, and in fact it can be viewed as a right adjoint to $L$ relative to the inclusion of the full subcategory determined by those $d$s for which $\bar L(d)$ is representable; see relative adjoint functor for more.
This global versus local evaluation of adjoint functors induces the global/local pictures of the definitions
as discussed there.
Given $R : D\to C$, and $c\in C$, a universal arrow from $c$ to $R$ is an initial object of the comma category $(c/R)$. That is, it consists of an object $L(c)\in D$ and a morphism $i_c : c\to R(L(c))$ – the unit – such that for any $d\in D$, any morphism $f : c\to R(d)$ factors through the unit $i_c$ as
for a unique $\tilde f:L(c)\to d$ – the adjunct of $f$.
In particular, we have a bijection
which it is easy to see is natural in $d$. Again, in this case there is a unique way to make $L$ into a functor so that this isomorphism is natural in $c$ as well.
Note that this definition is simply obtained by applying the Yoneda lemma to the definition in terms of representable functors.
To derive this characterization starting with a natural hom-isomorphism $Hom_{C}(L(-),-) \stackrel{\simeq}{\to} Hom_D(-,R(-))$ let $\tilde f : L c \to d$ be the image of $f : c \to R d$ under the bijection $Hom_C(c, R d) \stackrel{\simeq}{\to} Hom_D(L c, d)$ and consider the naturality square
Let also the unit $i_c : c \to R L c$ be the image of the identity $Id_{L c}$ under the hom-isomorphism and chase this identity through the commuting diagram to obtain
Example This definition in terms of universal factorizations through the unit and counit is of particular interest in the case that $R$ is a full and faithful functor exhibiting $D$ as a reflective subcategory of $C$. In this case we may think of $L$ as a localization and of objects in the essental image of $R$ as local objects. Then the above says that:
Every profunctor
defines a category $C *^k D$ with $Obj(C *^k D) = Obj(C) \sqcup Obj(D)$ and with hom set given by
($k(X,Y)$ is also called the heteromorphisms).
This category naturally comes with a functor to the interval category
Now, every functor $L : C \to D$ induces a profunctor
and every functor $R : D \to C$ induces a profunctor
The functors $L$ and $R$ are adjoint precisely if the profunctors that they define in the above way are equal. This in turn is the case if $C \star^L D \simeq (D^{op} \star^{R^{op}} C^{op})^{op}$.
We say that $C \star^k D$ is the cograph of the functor $k$. See there for more on this.
Functors $L : C \to D$ and $R : D \to C$ are adjoint precisely if we have a commutative diagram
where the downwards arrows are the maps induced by the projections of the comma categories. This definition of adjoint functors was introduced by Lawvere in his Ph.D. thesis, and was the original motivation for comma categories.
This diagram can be recovered directly from the image under the equivalence $[C^{op} \times D, Set] \stackrel{\simeq}{\to} DFib(D,C)$ described at 2-sided fibration of the isomorphism of induced profunctors $C^{op} \times D \to Set$ (see above at “In terms of Hom isomorphism”). Its relation to the hom-set definition of adjoint functors can thus be understood within the general paradigm of Grothendieck construction-like correspondences.
The above characterization of adjoint functors in terms of categories over the interval is used in section 5.2.2 of
(motivated from the discussion of correspondences in section 2.3.1)
to give a definition of adjunction between (infinity,1)-functors.
Let $C$ and $D$ be quasi-categories. An adjunction between $C$ and $D$ is
a morphism of simplicial sets $K \to \Delta^1$
which is
such that $C \simeq K_{0}$ and $D\simeq K_{1}$.
For more on this see
Given $L \colon C \to D$, we have that it has a right adjoint $R\colon D \to C$ precisely if the left Kan extension $Lan_L 1_C$ of the identity along $L$ exists and is absolute, in which case
In this case, the universal 2-cell $1_C \to R L$ corresponds to the unit of the adjunction; the counit and the verification of the triangular identities can all be obtained through properties of Kan extensions and absoluteness.
It is also possible to express this in terms of Kan liftings: $L$ has a right adjoint $R$ if and only if:
In this case, we get the counit as given by the universal cell $L R \to 1_D$, while the rest of the data and properties can be derived from it through the absolute Kan lifting assumption.
Dually, we have that for $R\colon D \to C$, it has a left adjoint $L \colon C \to D$ precisely if
or, in terms of left Kan liftings:
The formulations in terms of liftings generalize to relative adjoints by allowing an arbitrary functor $J$ in place of the identity; see there for more.
If a functor $R$ has a left adjoint $L$, then $L$ is unique up to unique isomorphism.
If a functor $L$ has a right adjoint $R$, then $R$ is unique up to unique isomorphism.
Let $(L \dashv R) : D \to C$ be a pair of adjoint functors. Then
Let $y : I \to D$ be a diagram whose limit $\lim_{\leftarrow_i} y_i$ exists. Then we have a sequence of natural isomorphisms, natural in $x \in C$
where we used the adjunction isomorphism and the fact that any hom-functor preserves limits (see there). Because this is natural in $x$ the Yoneda lemma implies that we have an isomorphism
The argument that shows the preservation of colimits by $L$ is analogous.
A partial converse to this fact is provided by the adjoint functor theorem. See also PointwiseExpression below.
Let $L \dashv R$ be a pair of adjoint functors. Then the following holds:
$R$ is faithful precisely if the component of the counit over every object $x$ is an epimorphism $L R x \stackrel{}{\to} x$;
$R$ is full precisely if the component of the counit over every object $x$ is an split monomorphism $L R x \stackrel{}{\to} x$;
$L$ is faithful precisely if the component of the unit over every object $x$ is a monomorphism $x \hookrightarrow R L x$;
$L$ is full precisely if the component of the unit over every object $x$ is a split epimorphism $x \to R L x$;
$R$ is full and faithful (exhibits a reflective subcategory) precisely if the counit is a natural isomorphism $\epsilon : L \circ R \stackrel{\simeq}{\to} Id_D$
$L$ is full and faithful (exhibits a coreflective subcategory) precisely if the unit is a natural isomorphism $\eta : Id_C \stackrel{\simeq}{\to} R \circ L$.
The following are equivalent:
$L$ and $R$ are both full and faithful;
$L$ is an equivalence;
$R$ is an equivalence.
For the characterization of faithful $R$ by epi counit components, notice (as discussed at epimorphism ) that $L R x \to x$ being an epimorphism is equivalent to the induced function
being an injection for all objects $a$. Then use that, by adjointness, we have an isomorphism
and that, by the formula for adjuncts and the zig-zag identity, this is such that the composite
is the component map of the functor $R$:
Therefore $R_{x,a}$ is injective for all $x,a$, hence $R$ is faithful, precisely if $L R x \to x$ is an epimorphism for all $x$. The characterization of $R$ full is just the same reasoning applied to the fact that $\epsilon_x \colon L R x \to x$ is a split monomorphism iff for all objects $a$ the induced function
is a surjection.
For the characterization of faithful $L$ by monic units notice that analogously (as discussed at monomorphism) $x \to R L x$ is a monomorphism if for all objects $a$ the function
is an injection. Analogously to the previous argument we find that this is equivalent to
being an injection. So $L$ is faithful precisely if all $x \to R L x$ are monos. For $L$ full, it’s just the same applied to $x \to R L x$ split epimorphism iff the induced function
is a surjection, for all objects $a$.
The proof of the other statements proceeds analogously.
Parts of this statement can be strenghened:
Let $(L \dashv R) : D \to C$ be a pair of adjoint functors such that there is any natural isomorphism
then also the counit $\epsilon : L R \to Id$ is an isomorphism.
This appears as (Johnstone, lemma 1.1.1).
Using the given isomorphism, we may transfer the comonad structure on $L R$ to a comonad structure on $Id_D$. By the Eckmann-Hilton argument the endomorphism monoid of $Id_D$ is commutative. Therefore, since the coproduct on the comonad $Id_D$ is a left inverse to the counit (by the co-unitality property applied to this degenerate situation), it is in fact a two-sided inverse and hence the $Id_D$-counit is an isomorphism. Transferring this back one finds that also the counit of the comand $L R$, hence of the adjunction $(L \dashv R)$ is an isomorphism.
Let $R : D \to C$ be a right adjoint functor such that
$C$ is a locally small category,
$D$ has all small limits.
Then the value of the left adjoint $L : C \to D$ on any object $c$ may be computed by a limit:
over the comma category $c/R$ (whose objects are pairs $(d,f:c\to R d)$ and whose morphisms are arrows $d\to d'$ in $D$ making the obvious triangle commute in $C$) of the projection functor
Because with this there is for every $d$ an obvious morphism
(the component map over $d$ of the limiting cone) while moreover because $R$ preserves limits, we have an isomorphism
and hence an obvious morphism of cone tips
It is easy to check that these would be the unit and counit of an adjunction $L\dashv R$.
See adjoint functor theorem for more.
Every adjunction $(L \dashv R)$ induces a monad $R \circ L$ and a comonad $L \circ R$. There is in general more than one adjunction which gives rise to a given monad this way, in fact there is a category of adjunctions for a given monad. The initial object in that category is the adjunction over the Kleisli category of the monad and the terminal object is that over the Eilenberg-Moore category of algebras. (e.g. Borceux, vol 2. prop. 4.2.2) The latter is called the monadic adjunction.
Moreover, passing from adjunctions to monads and back to their monadic adjunctions constitutes itself an adjunction between adjunctions and monads, called the semantics-structure adjunction.
The central point about examples of adjoint functors is:
Adjoint functors are ubiquitous .
To a fair extent, category theory is all about adjoint functors and the other universal constructions: Kan extensions, limits, representable functors, which are all special cases of adjoint functors – and adjoint functors are special cases of these.
Listing examples of adjoint functors is much like listing examples of integrals in analysis: one can and does fill books with these. (In fact, that analogy has more to it than meets the casual eye: see coend for more).
Keeping that in mind, we do list some special cases and special classes of examples that are useful to know. But any list is necessarily wildly incomplete.
A pair of adjoint functors between posets is a Galois correspondence.
A pair of adjoint functors $(L \dashv R)$ where $R$ is a full and faithful functor exhibits a reflective subcategory.
In this case $L$ may be regarded as a localization. The fact that the adjunction provides universal factorization through unit and counit in this case means that every morphism $f : c \to R d$ into a local object factors through the localization of $c$.
A pair of adjoint functors that is also an equivalence of categories is called an adjoint equivalence.
A pair of adjoint functors where $C$ and $D$ have finite limits and $L$ preserves these finite limits is a geometric morphism. These are one kind of morphisms between toposes. If in addition $R$ is full and faithful, then this is a geometric embedding.
The left and right adjoint functors $p_!$ and $p_*$ (if they exist) to a functor $p^* : [K',C] \to [K,C]$ between functor categories obtained by precomposition with a functor $p : K' \to K$ of diagram categories are called the left and right Kan extension functors along $p$
If $K' = {*}$ is the terminal category then this are the limit and colimit functors on $[K,C]$.
If $C =$ Set then this is the direct image and inverse image operation on presheaves.
if $R$ is regarded as a forgetful functor then its left adjoint $L$ is a regarded as a free functor.
If $C$ is a category with small colimits and $K$ is a small category (a diagram category) and $Q : K \to C$ is any functor, then this induces a nerve and realization pair of adjoint functors
between $C$ and the category of presheaves on $K$, where
the nerve functor is given by
and the realization functor is given by the coend
where in the integrand we have the canonical tensoring of $C$ over Set ($Q(k) \cdot F(k) = \coprod_{s \in F(k)} Q(k)$).
A famous examples of this is obtained for $C =$ Top, $K = \Delta$ the simplex category and $Q : \Delta \to Top$ the functor that sends $[n]$ to the standard topological $n$-simplex. In this case the nerve functor is the singular simplicial complex functor and the realization is ordinary geometric realization.
adjoint functor, adjunction
Though the definition of an adjoint equivalence appears in Grothendieck's Tohoku paper, the idea of adjoint functors in general goes back to
and was popularized by
For other textbook reference see any of the references listed at category theory, for instance
Peter Johnstone, first pages of Sketches of an Elephant
A video of a pedagogical introduction to adjoint functors is provided by
The history of the idea that adjoint functors formalize aspects of dialectics is recounted in
For more on this see at adjoint modality.