Left and Right Adjoints

Core Idea

For functors F: C → D and G: D → C, F is left adjoint to G (written F ⊣ G) if there exists a natural isomorphism Hom_D(F(−), −) ≅ Hom_C(−, G(−)). This relationship encodes a deep structural property: F and G preserve the monoidal and functorial properties of their source and target categories. Adjoint pairs unify free constructions, tensor products, and many universal properties across algebra and topology.

How It's Best Learned

Start with concrete adjoint pairs: free-forgetful adjunctions between Set and algebraic categories, tensor product and hom adjunctions between module categories, and homology-cohomology pairings. Verify the adjunction by computing natural isomorphisms of hom-sets explicitly.

Common Misconceptions

Adjoint functors are not inverses or quasi-inverses; they are distinct functors with a specific structural relationship. Left and right refer to the position in the hom-functor isomorphism, not to group-theoretic inverses. An adjoint pair exists only when the universal property can be satisfied in a natural, categorical way.

Explainer

Building on adjoint functors and universal properties, left and right adjoints unpack a fundamental asymmetry: the left adjoint is the "building" functor that freely constructs structure, while the right adjoint is the "forgetting" or "embedding" functor that reduces or restricts structure. This asymmetry carries deep consequences for what each functor preserves.

The archetypal example is the free-forgetful adjunction. The forgetful functor U: Grp → Set sends every group to its underlying set, forgetting the group multiplication. The free functor F: Set → Grp sends every set S to the free group generated by S — the group of all words in the symbols of S and their formal inverses. These form an adjoint pair F ⊣ U, and the natural isomorphism Hom_Grp(F(S), G) ≅ Hom_Set(S, U(G)) says: group homomorphisms out of a free group correspond exactly to functions from the generating set into the underlying set of G. This is the universal property of free groups, now stated as an adjunction. The left adjoint F occupies the left slot in Hom_D(F(−), −); the right adjoint U occupies the right slot.

The terms left and right are not arbitrary: they encode which limits and colimits each functor preserves. Left adjoints always preserve colimits — coproducts, coequalizers, pushouts, filtered colimits. Right adjoints always preserve limits — products, equalizers, pullbacks, limits of diagrams. This follows from the universal property structure of the adjunction and can be proven once, then applied everywhere. As a consequence, the tensor product functor M ⊗ − (left adjoint to Hom(M, −)) preserves direct sums but not products in general — it is right-exact but not left-exact. Hom(M, −) (right adjoint to M ⊗ −) preserves products and kernels but not cokernels.

This failure of exactness is not a deficiency — it is a diagnostic. When M ⊗ − fails to preserve a kernel, the failure is measured by Tor₁(M, −). When Hom(M, −) fails to preserve a cokernel, the failure is measured by Ext¹(M, −). Adjoint pairs thus predict exactly where derived functors must appear: at every point where the adjoint fails to preserve a limit or colimit it "should" but doesn't. Understanding that Tor and Ext arise from the failure of adjoints to be exact is one of the deepest organizational principles in homological algebra.