A pair of functors L: C -> D and R: D -> C such that there is a natural bijection Hom_D(Lc, d) ≅ Hom_C(c, Rd) for all objects c in C and d in D; L is left adjoint to R and R is right adjoint to L.

Principle

Adjunctions are organized by unit and counit natural transformations satisfying triangle identities; equivalently, the adjointness bijection is natural in both variables and determines L and R up to unique isomorphism when they exist.

Demonstration

Example: The free–forgetful pair between sets and groups: the free group functor is left adjoint to the forgetful functor, encoding universal maps from generators into group objects and realizing constructions by universal properties.

Misapplication

Assuming that existence of all left adjoints follows formally from certain limits or that an adjoint exists without checking naturality or the triangle identities produces false adjunction claims; also conflating left/right adjoints or ignoring size constraints is a common error.

Consequence

Adjoint functors preserve (co)limits: left adjoints preserve colimits and right adjoints preserve limits; adjunctions organize universal constructions and give canonical factorizations and reflection/coreflection structures.

Reversal

Reversing an adjunction swaps left and right: a left adjoint becomes a right adjoint in the opposite categories, converting colimit-preserving properties into limit-preserving ones and unit into counit roles.

Boundary

Adjunctions live in the categorical setting and require naturality and triangle identities; not every functor has an adjoint and existence may be obstructed by size, presentability, or lack of required (co)limits.

Semantic Tension

Tension arises between describing an adjoint as a bijection of hom-sets (synthetic) and as concrete constructions (free objects, limits); conflating the two can hide whether the adjoint is given by a formula or only known abstractly.

Synthesis

An adjoint functor pair encapsulates a reversible universal relationship: one functor freely generates or cofreely coacts while the other forgets or evaluates, with hom-set bijections and unit/counit data encoding that universal correspondence.