In this lightheaded post (written long time ago) I want to share with you some fundamental adjunctions that are the "source" of various other adjunctions that pop up all over in mathematics (well, at least all over algebraic topology).

claimtoken-5399a1ffcd81c

A baby case

Let A,B,CA,B,C be sets, and denote by Map(A,B)Map(A,B) the set of set-theoretic maps ABA \to B. Then
!Map(A×B,C)Map(A,Map(B,C)).! Map(A \times B, C) \cong Map(A, Map(B,C)). This is sometimes called Currying or Schönfinkeln, and it really boils down to
![(a,b)f(a,b)][a[bf(a,b)]].! [ (a,b) \mapsto f(a,b) ]\quad \mapsto\quad [a \mapsto [b \mapsto f(a,b)] ].

Definition

An adjunction is a pair of functors F:CDF : C \to D, G:DCG : D \to C between categories C,DC,D together with a natural transformation α\alpha of functors C×CSetsC \times C \to Sets
!α:HomD(F,)HomC(,G).! \alpha : Hom_D(F-,-) \Rightarrow Hom_C(-,G-). In the baby case above, C=SetsC=Sets and F:AA×BF: A \mapsto A\times B is adjoint to G:CMap(B,C)G : C \mapsto Map(B,C).
We call FF the left adjoint to GG and GG the right adjoint to FF. The notation FFGG can be quite useful.

You should care about adjunctions, because their existence implies nice properties: FF is always cocontinuous (preserves colimits) and GG is always continuous (preserves limits). This comes from the continuity properties of Hom(,)Hom(-,-). There is also a theorem (Freyd's AFT) that describes precisely which extra condition a functor has to satisfy, besides continuity, to be a right adjoint.

Another example comes from vector spaces:
!Hom(VW,X)Hom(V,Hom(W,X))! Hom(V \otimes W, X) \cong Hom(V,Hom(W,X)) where we give Hom(W,X)Hom(W,X) the vector space structure via XX.
In fact, this is basically the definition of the tensor product, if you watch closely.

In homotopy theory, one often uses the adjunction
![Σ,][,Ω]! [\Sigma -,-] \cong [-,\Omega -] between suspension Σ\Sigma and loop space Ω\Omega (where the brackets [,][,] denote the morphisms in the homotopy category). From the definitions, ΣX\Sigma X is a quotient of X×[0,1]X \times [0,1] and ΩX\Omega X is a subspace of X[0,1]X^{[0,1]}, and the source of this fundamental adjunction is the baby case above.

Forgetting Adjunctions

To a lot of "forgetful" functors, like from rings with unit to rings not-necessarily-with-unit, from abelian groups to arbitrary groups, from abelian groups to abelian monoids, from compact Hausdorff spaces to arbitrary topological spaces, one can construct left adjoints which give some sort of "free" objects. For example, to any topological space one can assign the Stone-Cech compactification, and to every abelian monoid one can assign the Grothendieck group.

Limits and Colimits

For categories C,JC,J we can form the functor category CJC^J of functors JCJ \to C and consider the diagonal functor Δ:CCJ\Delta : C \to C^J which maps every object to the constant functor. If it has a right adjoint, then we call it Limit (lim:CJClim : C^J \to C) and write
!HomCJ(Δ,)HomC(,lim).! Hom_{C^J}(\Delta -, -) \cong Hom_{C}(-, lim - ).
If it has a left adjoint, then we call it Colimit (colim:CJCcolim : C^J \to C) and write
!HomC(colim,)HomCJ(,Δ).! Hom_{C}(colim -, -) \cong Hom_{C^J}(-, \Delta - ).
Such a (co)limit functor exists iff all (co)limits exist in the ordinary sense.

There would be much more to write (e.g. about nerves and realizations) but I'll stop here to prevent this from rotting in the draft section.

Except, I couldn't resist [UPDATE 2014-06-12]:

The nerve of a category

Given a category CC we can look at all chains of arrows of length nn, i.e. f1,,fnf_1,\dots,f_n such that one has a composition fnf1f_n \circ \cdots \circ f_1. Such a chain of length nn can be mapped to a chain of length n1n-1 by merging two adjacent arrows fi,fi+1f_i,{f_i+1} into fi+1fif_{i+1}\circ f_i and it can be mapped to a chain of length n+1n+1 by inserting identities. All this structure together forms a simplicial set NCNC called the nerve, whose nn-simplices are precisely the chains of arrows of length nn. This construction if functorial, and it admits a left adjoint hh that associates to a simplicial set its "homotopy category":
!HomCat(h,)HomsSet(,N).! Hom_{Cat}(h -, -) \cong Hom_{sSet}(-, N -).

A better (well...) explanation of the suspension-loop space adjunction

Write HoHo for the homotopy category of a category CC with weak equivalences, then we have a derived version of the lim and colim adjunctions:
!HoCJ(Δ,)HoC(,holim),! Ho_{C^J}(\Delta -, -) \cong Ho_{C}(-, holim - ),
!HoC(hocolim,)HoCJ(,Δ).! Ho_{C}(hocolim -, -) \cong Ho_{C^J}(-, \Delta - ).
Specializing this to the diagrams JJ being \cdot \rightarrow \cdot \leftarrow \cdot (for holim) and \cdot \leftarrow \cdot \rightarrow \cdot (for hocolim) we are talking about homotopy pullbacks and homotopy pushouts. Now plugging in a terminal object \ast for the outer things, and an arbitrary object XX in the middle, we get diagrams in CC like X\ast \rightarrow X \leftarrow \ast, whose holim is called ΩX\Omega X and X\ast \leftarrow X \rightarrow \ast whose hocolim is called ΣX\Sigma X.

At this point you should probably try to see that the ordinary suspension and loop space fulfill these universal properties in the category of topological spaces.

Anyway, writing down explicitly the holim and hocolim adjunctions for these particular diagrams, you see the adjunction immediately. I guess this is called "synthetic homotopy theory" and it's beautiful, isn't it?

#