A relationship between two functors L : C → D and R : D → C given by a natural bijection Hom_D(L(X), Y) ≅ Hom_C(X, R(Y)) natural in X∈C and Y∈D, equivalently specified by a unit η: Id_C ⇒ R∘L and counit ε: L∘R ⇒ Id_D satisfying the triangle identities.

Principle

Adjunction formalizes universal constructions: L is left adjoint to R if L freely generates D-objects from C-objects subject to a universal property realized by the bijection of hom-sets; the unit and counit encode this universal correspondence and must satisfy coherence (triangle) identities.

Demonstration

The free–forgetful pair F : Set → Ab (free abelian group) and U : Ab → Set (forgetful) form an adjunction F ⊣ U: for any set S and abelian group A, group homomorphisms F(S)→A correspond naturally to set maps S→U(A). The unit maps elements of S to their generators in Z[S] and the counit evaluates formal sums.

Misapplication

Confusing adjointness with equivalence (an adjoint pair need not be invertible) or assuming existence of adjoints without checking size/co-completeness conditions; claiming a bijection of hom-sets that is not natural in both variables is a common error.

Consequence

Adjunctions produce canonical constructions (free objects, localizations, completions), induce monads and comonads, and provide a versatile method to build and recognize universal properties across category theory and algebra.

Reversal

The reversed notion swaps left and right: if L ⊣ R then R is right adjoint to L; completely inverting the adjunction to an equivalence requires further data (a unit and counit that are isomorphisms), which yields a stronger notion than mere adjointness.

Boundary

Adjunctions require functors between categories with well-defined hom-sets; existence depends on categorical completeness/co-completeness or smallness hypotheses. Not every functor has a left or right adjoint; adjointness is a structural, not automatic, property.

Semantic Tension

Adjunctions are often conflated with Galois connections or inverse equivalences: Galois connections are order-theoretic analogues but lack full categorical naturality, and equivalence of categories is stricter than adjointness because it requires invertible unit/counit up to isomorphism.

Synthesis

An adjunction is a natural bijection of hom-sets (or unit/counit satisfying triangle identities) between two functors that encodes a universal 'free/forgetful' style correspondence, yielding canonical constructions and algebraic structures like monads.