Universal Properties and Adjunctions

"Free" constructions are abundant in Algebra, and are actually examples of Adjunctions. Specifically, we have an adjunction:

Set?FAlg\bold{Set} \xtofrom[?]{F} \bold{Alg}

Where F:SetAlgF : \bold{Set} \to \bold{Alg} is the free functor from the category of sets to this category of algebraic structures, and ?:AlgSet? : \bold{Alg} \to \bold{Set} is the forgetful functor, which forgets the additional algebraic structure.

Usually, this universal construction is presented a bit differently, but is equivalent to the notion of adjunction.

Free Groups

As a concrete example, take Free Groups. Given a set AA, the free group FAF A is usually defined with a universal property:

There is a group FAF A, and a set function η:AFA\eta : A \to F A such that for any other group GG and function g:AGg : A \to G, there exists a unique group homomorphism φ!:FAG\varphi! : F A \to G making the following diagram commute:

/

Of course, when talking about the interaction of morphisms and objects from Grp\bold{Grp}, we really mean their images, under the forgetful functor ?:GrpSet? : \bold{Grp} \to \bold{Set}. Being explicit, we get the following diagram:

/

We can characterize this object FAF A as being an initial object in the slice category A?A \downarrow ? (where A:1SetA : 1 \to \bold{Set} is the functor sending every object to AA, and every morphism to 1A1_A).

The objects consists of a choice of group GG and set function A?GA \to ?G, and the morphisms are group homomorphisms GHG \to H making the following diagram commute.

/

It's clear that the initial object in this category is the free group FAF A, along with the morphism η:A?FA\eta : A \to ? F A.

Adjunctions

It turns out that this characterization is implied by the adjunction:

F ?F \dashv \ ?

The "primal" characterization of an adjunction LRL \dashv R is that there exists a special binatural isomorphism between the two functors:

D(L,)C(,R)\mathcal{D}(L -, -) \cong \mathcal{C}(-, R -)

A more convenient (and entirely equivalent) characterization is that of two natural transformations:

η:1RLϵ:LR1\begin{aligned} \eta : 1 \Rarr R L \cr \epsilon : L R \Rarr 1 \end{aligned}

Satisfying these two relations:

/

which we call the left and right "zig-zag identities".

[!note] Note: I use the notation αF\alpha_F to denote the natural transformation whose component for the object AA is αFA\alpha_{F A}.

Similarly, GβG \beta denotes the natural transformation whose component at BB is GβBG \beta_B.

Implying the Universal Property

With this adjunction in place, we can show that (LA,ηA)(L A, \eta_A) is the initial object in the comma category ARA \downarrow R, for any object AA.

This is a fun series of diagram chases.

First, we show that there is a morphism to the other objects in the comma category. Given (M,f:ARM)(M, f : A \to R M) some other object in ARA \downarrow R, we provide a morphism φ:LAM\varphi : L A \to M such that this diagram commutes:

/

Applying the right zig-zag identity at MM, we get this commuting diagram:

/

We can compose this with ff to get:

/

But then, by naturality of η\eta, we have:

/

And then LfϵML f \ggg \epsilon_M is our φ\varphi. Since RR is a functor RLfRϵM=R(LfϵM)RL f \ggg R \epsilon_M = R (L f \ggg \epsilon_M)

[!note] Note: In the specific case of a free group, Lf=FfL f = F f works by preserving all of the free algebraic operations we've created, but swapping out the "seeds" we've used. Then we interpret these free operations as concrete operations in MM, using ϵ\epsilon.

Next, we show that this function is unique. In other words, if ϕ:LAM\phi : L A \to M with ηARϕ=f\eta_A \ggg R \phi = f, then ϕ=φ\phi = \varphi.

We start with:

/

Then, we apply the left zig-zag identity, to get:

/

By naturality of ϵ\epsilon, we get:

/

But, since ηARϕ=f\eta_A \ggg R \phi = f, we have:

/

But, by definition φ=LfϵM\varphi = L f \ggg \epsilon_M, giving us:

/

In other words φ=ϕ\varphi = \phi.

The Dual Construction

If we take the opposite functors Lop:CopDopL^{op} : \mathcal{C}^{op} \to \mathcal{D}^{op} and Rop:DopCopR^{op} : \mathcal{D}^{op} \to \mathcal{C}^{op}, we have:

RopLopR^{op} \dashv L^{op}

Using our previous result, we get that for any object MM in Dop\mathcal{D}^{op}, (RopM,ϵM:MLR M)(R^{op} M, \epsilon_M : M \leftarrow LR\ M) is initial in the slice category MLopM \downarrow L^{op}

/

Of course, this is the same thing as saying that (RM,ϵM)(R M, \epsilon_M) is terminal in the slice category LML \downarrow M. In other words, for any object AA in C\mathcal{C}, with a morphism α:LAM\alpha : L A \to M in D\mathcal{D}, there exists a unique f:ARMf : A \to R M such that this diagram commutes:

/

Concretely

Back to the example of free groups, we have the following situation:

/

Ultimately, this just expresses the fact that a group homomorphism out of a free group consists first of replacing each of the seeds with an element of GG, and then reducing the free algebraic structure using ϵ\epsilon.

The Other Direction

We can also go in the other direction. Let L:CDL : \mathcal{C} \to \mathcal{D}, R:DCR : \mathcal{D} \to \mathcal{C} be functors. If we have parameterized functions (which we don't yet assume to be natural) ηA:ARL A\eta_A : A \to RL \ A for any object AA in C\mathcal{C}, and ϵM:LR MM\epsilon_M : LR \ M \to M for any object MM in M\mathcal{M}, such that (LA,ηA)(L A, \eta_A) is initial in ARA \downarrow R, and (RM,ϵM)(R M, \epsilon_M) is terminal in LML \downarrow M, then we have an adjunction:

LRL \dashv R

First, η\eta is natural:

/

The right and left triangles both commute, since they make use of the unique φ!\varphi! that must exist whenever we have a function ARMA \to R M, for some MM.

Secondly, ϵ\epsilon is natural:

/

The left and right triangles both commute, making use of the universal property of LR ALR \ A. (The argument is similar to before, of course).

Now, for the zig-zag identities.

Let's start with the right zig-zag identity, for some object MM:

/

If we take 1:R MR M1 : R \ M \to R \ M, we have a unique φ!\varphi! such that:

/

by the universal property for RLRL.

For any φ:LR MM\varphi : LR \ M \to M, we have a unique f!f! such that:

/

by the universal property for LRLR.

Combining the first diagram, with the image under RR of the second, we get:

/

But, Lf!ϵMLf! \ggg \epsilon_M satisfies the universal property of φ!\varphi!, which is unique. This means that φ=Lf!ϵM\varphi = Lf! \ggg \epsilon_M.

We then have:

/

But clearly, 11 satisfies the universal property of f!f! in this situation, which means f!=1f! = 1. This gives us:

/

And so the right zig-zag property is satisfied.

For the left zig-zag property, we use the same strategy.

Given any object AA, in C\mathcal{C} we want to show:

/

We have the following diagram:

/

With the unique f!f! satisfying this diagram existing because of the universal property of LRLR.

Similarly, for any ff, we have:

/

because of the universal property of RLRL.

Combining both diagrams, we get:

/

A similar argument as last time shows us first that f!=ηRφ!f! = \eta \ggg R\varphi!, and then φ!=1\varphi! = 1, giving us:

/

and so the left zig-zag property is satisfied.

Conclusion

Given functors L:CDL : \mathcal{C} \to \mathcal{D} and R:DCR : \mathcal{D} \to \mathcal{C}, these statements are equivalent:

  1. LRL \dashv R
  2. D(L,)C(,R)\mathcal{D}(L -, -) \cong \mathcal{C}(-, R -)
  3. There exist η:1RL, ϵ:LR1\eta : 1 \Rarr RL, \ \epsilon : LR \Rarr 1 satisfying the zig-zag identities
  4. (AC,MD\forall A \in \mathcal{C}, M \in \mathcal{D}) (RLA,ηA)(RL A, \eta_A) is initial in ARA \downarrow R, and (LRM,ϵM)(LR M, \epsilon_M) is terminal in LML \downarrow M.

In this post, I only proved 343 \iff 4. 121 \iff 2 by definition, and 232 \iff 3 is well known.