Adjunctions

Origin. Kan (1958). Fundamental concept of category theory. F ⊣ G: left adjoint to right. Universal property characterization. Unifies constructions across mathematics. Foundation for categorical logic.

Models. Two functors F: C → D, G: D → C. Natural bijection: D(FA, B) ≅ C(A, GB). Unit and counit: η, ε. Represents "best approximation."

Formalism.

Adjunction: F ⊣ G (F left adjoint to G) Hom-set bijection: D(FA, B) ≅ C(A, GB) natural in A, B.

Unit and counit: η: Id_C → GF (unit) ε: FG → Id_D (counit)

Triangle identities: εF ∘ Fη = id_F Gε ∘ ηG = id_G

Universal property: η_A: A → GFA is universal arrow from A to G. For any f: A → GB, ∃! g: FA → B with Gg ∘ η_A = f.

Examples: Free ⊣ Forgetful (groups, monoids, etc.) F × — ⊣ —^F (product/exponential) Σ_f ⊣ f* ⊣ Π_f (dependent sums/products) ∃ ⊣ Δ ⊣ ∀ (quantifiers as adjoints)

Properties: Left adjoints preserve colimits: F(colim) = colim(F—). Right adjoints preserve limits: G(lim) = lim(G—).

Monads from adjunctions: T = GF is a monad. η: Id → T (unit) μ = GεF: T² → T (multiplication)

Symbols.

Symbol	Unicode	Name	Meaning
⊣	U+22A3	Adjoint	Left adjoint
η	U+03B7	Eta	Unit
ε	U+03B5	Epsilon	Counit
μ	U+03BC	Mu	Multiplication of the induced monad, μ = GεF
≅	U+2245	Isomorphism	Natural bijection of hom-sets
∘	U+2218	Composition	Composite of morphisms or natural transformations
×	U+00D7	Product	Binary product, right adjoint to the diagonal
Σ	U+03A3	Sigma / Dependent sum	Left adjoint to pullback f*
Π	U+03A0	Pi / Dependent product	Right adjoint to pullback f*
∃	U+2203	Existential quantifier	Left adjoint to substitution
∀	U+2200	Universal quantifier	Right adjoint to substitution
Δ	U+0394	Delta / Diagonal	Weakening functor between the quantifier adjoints
→	U+2192	Arrow	Morphism or functor
Id	—	Identity functor	Domain and codomain of unit and counit
T	—	Induced monad	T = GF, with unit η and multiplication μ
⊣ ⊣	—	Adjoint triple	Chain of adjunctions such as Σ_f ⊣ f* ⊣ Π_f

Metatheory. Adjoints are unique up to unique natural isomorphism, so "the" left adjoint of G is well defined when it exists. The four standard characterizations — hom-set bijection natural in both arguments, unit with a universal property, counit with a universal property, and unit-counit pairs satisfying the triangle identities — are equivalent. Left adjoints preserve all colimits and right adjoints preserve all limits; Freyd's adjoint functor theorem gives a converse, since a limit-preserving functor from a complete, locally small category has a left adjoint provided the solution set condition holds, and the special adjoint functor theorem replaces that condition by well-poweredness plus a cogenerating set. Adjunctions compose, and every adjunction induces a monad T = GF on the domain and a comonad FG on the codomain. Eilenberg–Moore (1965) and Kleisli (1965) independently showed that every monad arises from an adjunction, and these two constructions are respectively terminal and initial in the category of adjunctions inducing it. An adjunction is monadic when the comparison functor into the Eilenberg–Moore category is an equivalence; Beck's monadicity theorem characterizes exactly when this happens. Adjoints are the special case of Kan extensions in which the extension is along the functor to the terminal category, which is why Mac Lane could write that all concepts are Kan extensions.

Applies to. Universal algebra. Logic (quantifiers). Type theory (dependent types). Functional programming (monads). Topos theory.

Limitations. Adjoints often fail to exist, and preservation of limits is not sufficient for existence: the adjoint functor theorem needs local smallness, completeness, and the solution set condition, all of which can fail. The forgetful functor from fields to sets has no left adjoint, so there is no free field; the free complete lattice on three generators is a proper class (Hales, Gaifman, 1964), so the forgetful functor from complete lattices has no left adjoint either. Adjointness constrains one variance only — a left adjoint preserves colimits but need not preserve any limit. Reading quantifiers as adjoints ∃_f ⊣ f* ⊣ ∀_f does not by itself make substitution behave: the Beck–Chevalley condition is an extra requirement, and without it quantification fails to commute with pullback. Dependent products Π_f require local cartesian closure and are absent in a merely cartesian closed category. The triangle identities are strict equations, so the definition does not transport to bicategories or (∞,1)-categories without replacing them by coherence data.