The most important concept: free-forgetful pairs and hom-set bijections
Some pairs of functors are not inverses, but are as close as they can be. These pairs are called adjunctions, and they turn up everywhere.
Hover over an arrow on either side to light up its partner across the bijection. Add or remove pairs to see that they always match one to one.
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)).
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!
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.
Switch between Free Construction and Forget Structure to watch a set become a group and back again.
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.
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.
Switch between the unit, the counit, and the triangle identity to see how the round trips fit together.
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.
Key insight: The triangle identities state that εF ∘ Fη = idF and Gε ∘ ηG = idG. 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.
Click through four famous adjunctions from different parts of mathematics. Look for the free side and the forgetful side in each.
The free functor builds the most general group from a set; the forgetful functor strips away the group operation.
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.
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.
Ubiquity — Adjunctions appear everywhere: currying, limits, quantifiers, tensor products
Spot a mistake or have an idea?