nLab
adjoint functor

Contents

Definition

We say that two functors L:CD and R:DC are adjoint if they form an adjunction LR in the 2-category Cat of categories. This means that they are equipped with natural transformations η:1 CRL and ϵ:LR1 D satisfying the triangle identities, that is the compositions LLηLRLϵLL and RηRRLRRϵ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.

Definition in terms of Hom isomorphism

An adjunction LR is equivalently given by a natural isomorphism of hom-functors C op×DSet

Hom D(L(),)Hom C(,R()).Hom_D(L(-),-) \simeq Hom_C(-,R(-)) \,.

In other words, for all cC and dD there is a bijection of sets

Hom D(L(c),d)Hom C(c,R(d))Hom_D(L(c),d) \simeq Hom_C(c,R(d))

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, η and ϵ 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)d is R(f)η, and the adjunct of g:cR(d) is ϵL(g). The triangle identities are precisely what is necessary to ensure that this is an isomorphism.

Definition in terms of representable functors

A functor L:CD has a right adjoint if and only if for all d, the presheaf Hom D(L(),d):D opSet is representable, i.e. there exists an object R(d) and a natural isomorphism

Hom D(L(),d)Hom C(,R(d)).Hom_D(L(-),d) \cong Hom_C(-,R(d)).

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

L *:[D op,Set][C op,Set]L^* : [D^{op}, Set] \to [C^{op}, Set]

of presheaf categories. By restriction along the Yoneda embedding Y:D[D op,Set] this yields the functor

L¯:DY[D op,Set]L *[C op,Set].\bar L : D \stackrel{Y}{\to} [D^{op}, Set] \stackrel{L^*}{\to} [C^{op}, Set] \,.

such that

L¯:dHom D(L(),d)[D op,Set].\bar L : d \mapsto Hom_D(L(-),d) \in [D^{op}, Set] \,.

If for all dD this presheaf L¯(d) is representable, then it is functorially so in that there exists a functor R:DC such that

L¯YR.\bar L \simeq Y \circ R \,.

Local definition

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

L¯(d):=Hom D(L(),d)[D op,Set]\bar L(d) := Hom_D(L(-),d) \in [D^{op}, Set]

is representable for some d but not for all d. The representing object may still usefully be thought of as R(d).

This global versus local evaluation of adjoint functors induces the global/local pictures of the defintions

as discussed there.

Definition in terms of universal arrows

Given R:DC, and cC, 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)D and an arrow η:cR(L(c)) such that for any dD, any arrow g:cR(d) factors as R(f)η for a unique f:L(c)d. In particular, we have a bijection

Hom C(c,R(d))Hom D(L(c),d)Hom_C(c,R(d)) \cong Hom_D(L(c),d)

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.

Definition in terms of correspondences

Every distributor

k:C op×DSk : C^{op} \times D \to S

defines a category C* kD with Obj(C* kD)=Obj(C)Obj(D) and

Hom C op×D(X,Y)={Hom C(X,Y) ifX,YC Hom D(X,Y) ifX,YD k(X,Y) ifXCandYD otherwise.Hom_{C^{op} \times D}(X,Y) = \left\{ \array{ Hom_C(X,Y) & if X, Y \in C \\ Hom_{D}(X,Y) & if X,Y \in D \\ k(X,Y) & if X \in C and Y \in D \\ \emptyset & otherwise } \right. \,.

This category naturally comes with a functor to the interval category

C* kDΔ 1.C *^k D \to \Delta^1 \,.

Now, every functor L:CD induces a distributor

k f(X,Y)=Hom D(f(X),Y)k_f(X,Y) = Hom_D(f(X), Y)

and every functor R:DC induces a distributor

k g(X,Y)=Hom C(X,R(Y)).k_g(X,Y) = Hom_C(X, R(Y)) \,.

The functors L and R are adjoint precisely if the distributors that they define in the above way are equal. This in turn is the case if C LD(D op R opC op) op.

We say that C kD is the cograph of the functor k. See there for more on this.

Definition for (,1)-functors

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.

Definition

Let C and D be quasi-categories. An adjunction between C and D is

For more on this see

Examples

Properties

Let LR be a pair of adjoint functors. We have the following

Videos