Adjunctions

The most important concept: free-forgetful pairs and hom-set bijections

Adjunctions

Adjunctions are the most important concept in category theory. An adjunction F ⫤ G says that F and G are "optimally approximate inverses" — not actual inverses, but as close as possible. They encode a natural bijection: Hom(F(A), B) ≅ Hom(A, G(B)).

The Adjunction Bijection

An adjunction F ⊥ G between categories C and D gives a natural bijection: Hom(F(A), B) ≅ Hom(A, G(B)). Every morphism F(A) → B on the left has a unique adjunct (mate) A → G(B) on the right, and vice versa. Hover over a morphism to highlight its adjunct!

Hom(F(A), B)Hom(A, G(B))f₁ : F(A)→Bf₂ : F(A)→Bf₃ : F(A)→Bf̃₁ : A→G(B)f̃₂ : A→G(B)f̃₃ : A→G(B)
3 morphism pairs shown — hover to highlight adjuncts

Key insight: The adjunction bijection Hom(F(A), B) ≅ Hom(A, G(B)) is natural in both A and B. This means the correspondence is not just a set bijection — it varies coherently as you change A and B. This single equation encodes the entire adjunction.

Free ⊥ Forgetful Adjunction

The free functor F : Set → Grp builds the "most general" group from a set. The forgetful functor U : Grp → Set strips away the group operation. Together they form an adjunction: F ⊥ U.

Set S = {a, b}
a
b
Just elements, no structure
F (Free)
F(S) = Free Group on {a, b}
e
a
b
a⁻¹
b⁻¹
ab
ba
Multiplication: ab · b&u207B;¹ = a
Inverses: a · a&u207B;¹ = e

Key insight: The Free ⊥ Forgetful adjunction says: giving a group homomorphism F(S) → G is the same as giving a set function S → U(G). The free functor is the best approximation from the left — it adds exactly enough structure and nothing more.

Unit & Counit

Every adjunction F ⊥ G comes with two natural transformations: the unit η : Id ⇒ GF and the counit ε : FG ⇒ Id. They satisfy the triangle identities (zig-zag equations), which ensure the adjunction is coherent.

Category CCategory DAGF(A)η_AF(A)FGη_A : A → G(F(A)) — "embed into the round trip"

Key insight: The triangle identities state that εF ∘ Fη = id₆ and Gε ∘ ηG = id₇. These ensure the unit and counit are "inverse enough" to make the adjunction work. An adjunction can be equivalently defined as a pair (η, ε) satisfying these two equations.

Gallery of Famous Adjunctions

Adjunctions are everywhere in mathematics. Saunders Mac Lane wrote: "Adjoint functors arise, it seems, everywhere." Here are four famous examples that illustrate the breadth of this concept.

Free / Forgetful

FreeForgetful (U)
Left
Set
Free
Forgetful (U)
Right
Grp

The free functor builds the most general group from a set; the forgetful functor strips away the group operation.

Bijection
Hom_Grp(F(S), G) ≅ Hom_Set(S, U(G))
Intuition
A group homomorphism out of a free group is determined by where the generators go.

Key insight: Every adjunction tells the same story: the left adjoint is the "free" or "best approximation" from one side, and the right adjoint is the "forgetful" or "underlying" construction from the other. When you see a natural bijection between hom-sets, you've found an adjunction.

Key Takeaways

  • Hom-Set Bijection — Hom(F(A), B) ≅ Hom(A, G(B)) naturally in both A and B
  • Free ⊥ Forgetful — The most common adjunction: free constructions are left adjoint to forgetful functors
  • Unit & Counit — η : Id → GF and ε : FG → Id satisfy the triangle identities
  • Ubiquity — Adjunctions appear everywhere: currying, limits, quantifiers, tensor products