3 Adjunctions
Definition 3.1 (Adjunction, D. Kan 1958).
Let
and
be categories. An adjunction between
and
consists of functors
and
together with, for each
and ,
a bijection between morphisms
in
and morphisms
in ,
which is natural in
and .
(If
and
are locally small, this means that
and
are naturally isomorphic functors .)
We say
is left adjoint to ,
or
is right adjoint to ,
and we write .
Example 3.2.
-
(a)
The free functor
is left adjoint to the forgetful functor .
By definition, homomorphisms
correspond to functions ;
naturality in
was built into the definition of
in Example 1.5(b) and naturality in
is immediate.
-
(b)
The forgetful functor
has a left adjoint ,
which equips a set
with its discrete topology since any function
is continuous as a map .
also has a right adjoint
given by the ‘ìndiscrete’ topology.
-
(c)
The functor
has a left adjoint
given by discrete categories, and a right adjoint :
is the category with objects
and morphisms
for each .
also has a left adjoint :
is the set of connected components of ,
i.e. the quotient of
by the smallest equivalence relation which identifies
with
for all .
-
(d)
Given a set ,
we can regard
as a functor .
It has a right adjoint, namely .
Given
we can regard it as a function
by .
We call a category
cartesian closed if it has binary products as defined in Example 2.6(f) and each
has a right adjoint .
For example,
is cartesian clsosed, with
taken to be the .
-
(e)
Let
be the -element
monoid with
(and identity ).
We have a functor
sending
to
and a functor
sending
to .
We have :
since any
takes values in
and any
is determined by its restriction to
since .
However, note that this is not an equivalence of categories.
-
(f)
Let
be the category with one object and one morphism (which must the identity on the only object). A
left adjoint for the unique functor
picks out an initial object of ,
i.e. an object such that there is a unique
for each .
Dually, a right adjoint for
‘is’ a terminal object of
(a terminal object is an initial object in ).
Again, the example of
shows that these two can coincide.
-
(g)
Suppose given
in .
We have order-preserving mappings
and ,
and
since .
-
(h)
Suppose given a relation .
We define
and
by
These are contravariant functors and .
We say
and
are adjoint on the right.
-
(i)
is self-adjoint on the
right, since functions
and functions both
correspond to relations .
-
(j)
is self-adjoint on the
right, since linear maps
and both correspond
to bilinear maps .
Theorem 3.3.
Assuming that:
-
-
for
, let
be the
category whose
objects are pairs
where
and
, and whose
morphisms
are
morphisms
making
commute.
Proof.
First suppose .
For each , let
be the morphism
corresponding to .
Then is an
initial object of :
given any ,
the diagram
commutes if
and only if
corresponds to
under the
adjunction, by
naturality of the
adjunction bijection.
So there’s a unique morphism
in .
Conversely, suppose given in initial object
in for each
. We make
into a
function :
given ,
is the unique
morphism in
. Functoriality comes
from uniqueness: given ,
and
are both
morphisms in
. The adjunction
bijection sends to the
unique morphism
in , with inverse
sending to
. This is natural
in since
is a natural
transformation
and natural in
since is
functorial. □
Corollary 3.4.
Assuming that:
Then there is a canonical natural isomorphism .
Proof.
and
are both initial in ,
so there’s a unique isomorphism
between them.
is natural: given ,
and
are both morphisms
in ,
so they’re equal. □
As a result of this, we will often talk about “the” left adjoint of a functor (when it exists), because we don’t
usually care about which one in the isomorphism class we use.
Lemma 3.5.
Assuming that:
Proof.
Given ,
,
we have bijections between morphisms ,
morphisms ,
and morphisms
which are both natural in
and ,
.
□
Corollary 3.6.
Assuming that:
Then the square of
left adjoints commutes up to natural isomorphism.
Proof.
By Lemma 3.5, both ways round are left adjoint to ,
so by Corollary 3.4 they’re isomorphic. □
We saw in Theorem 3.3 that an adjoint
gives rise to a natural transformation , called
the unit of the adjunction. Dually, we have ,
the counit of .
Theorem 3.7.
Assuming that:
Proof.
Suppose .
We defined
in the proof of Theorem 3.3, and
is defined dually. Since
corresponds to ,
the composite
corresponds to .
But by definition
corresponds to .
The other identity is dual.
Conversely, suppose given
and
satisfying the triangular identities. Given ,
we define .
Dually, given ,
we define .
Then ,
and dually .
Naturality of
and
follows from naturality of
and .
□
In Definition 1.9, we had natural isomorphisms
and . These look like the unit
and counit of an adjunction :
do they satisfy the triangular identities? No, but we can always change them:
Proposition 3.8.
Assuming that:
Then there exist isomorphisms
and
satisfying the triangular
identities. In particular,
.
Proof.
We define
and take to
be the composite
|
Note that ,
since
commutes by
naturality of
,
and
is
monic.
Similarly,
.
To verify the triangular identities, consider
which commutes
by
naturality of
.
For the second triangular identity, we have
Hence by
Theorem
3.7 we have
.
But
and
also satisfy the triangular
identities for and
adjunction .
□
Lemma 3.9.
Assuming that:
Then
Proof.
-
(1)
Given
in ,
corresponds to
under the adjunction. So
epic if and only if
acts injectively on morphisms with domain
and specified codomain. Hence
epic for all
if and only if
is faithful.
-
(2)
Similarly,
full and faithful if and only if for all
and
composition with
is a bijection .
This happens if and only if
is an isomorphism for all .
□
Example 3.11.
-
(a)
is reflective in :
the left adjoint to the inclusion sends
to
where
is the subgroup generated by commutators. Any homomorphism
with
abelian factors uniquely through the quotient map .
-
(b)
Recall that a group
is torsion if all elements have finite order, and torsion free if its only element of finite order is
.
In an abelian group ,
the torsion leements form a subgroup ,
and
is right adjoint to the inclusion ,
since any homomorphism
whose
is torsion takes values in .
Similarly,
defines a left adjoint to the inclusion .
-
(c)
Let
be the full subcategory of compact Hausdorff spaces.
is reflective in :
the left adjoint is the Stone-Čech compactification .
-
(d)
Let
be the full subcategory of sequential spaces, i.e. those in which all sequentially closed sets are closed.
The inclusion
has a right adjoint sending
to ,
the same set as
with all sequentially closed sets declared to be closed. The identity mapping
is (continuous, and) the counit of the adjunction.
-
(e)
The category
of preordered sets is reflective in :
the reflection sends
to
where
is the congruence identifying all paralell pairs in .
-
(f)
Given a topological space ,
the poset
of open subsets of
is coreflective in ,
since if
is open and
is arbitrary, we have
if and only if
(recall
denotes interior). Dually, the poset of closed subsets is reflective in .