Freyd adjoint functor theorem

Freyd adjoint functor theorem

The Freyd adjoint functor theorem gives conditions under which a functor between categories admits a left or right adjoint, providing a powerful criterion used throughout mathematics and theoretical computer science. It connects structural properties of categories such as completeness, cocompleteness, and smallness conditions with existence of adjoint functors, and it has influenced work in algebraic topology, algebraic geometry, and homological algebra. The theorem is associated with the work of Peter J. Freyd and is a standard tool alongside results like the Adjoint functor theorem (general) and the Special Adjoint Functor Theorem.

Statement

The Freyd adjoint functor theorem asserts that a functor F : C → D has a left adjoint provided certain exactness and smallness hypotheses hold: C is complete and well-powered with a small set of generators, F preserves limits and satisfies the solution set condition. In dual form, a functor has a right adjoint under cocompleteness, cowell-poweredness with small cogenerators, F preserving colimits, and an appropriate dual solution set condition. The theorem refines earlier criteria from authors such as Alexander Grothendieck, Saunders Mac Lane, and complements results by Eilenberg–Moore and Grothendieck–Verdier contexts.

Motivation and history

Freyd formulated the theorem in the context of mid-20th century developments linking category theory to foundations of algebraic topology and homological algebra. Influences include the categorical reformulations in Samuel Eilenberg and Saunders Mac Lane's work, the development of abelian categories in Alexander Grothendieck's school, and foundational efforts by William Lawvere and F. William Lawvere on adjunctions and topos theory. The theorem addressed practical needs arising in constructions in sheaf theory used in Jean-Pierre Serre's and Alexander Grothendieck's research, and informed later categorical frameworks used by Michael Barr, Charles Rezk, and Ross Street. Historical applications appeared in work by Barry Mitchell and in structural results exploited by Jean Bénabou and Pierre Gabriel.

Proof outline

A standard proof begins by reducing existence of an adjoint to constructing universal arrows for each object of the target category, then uses the solution set condition to guarantee a set-indexed family of candidates. One shows completeness or cocompleteness supplies limits or colimits needed to assemble a universal object using products and equalizers or their duals, referencing techniques developed by Mac Lane and refined by Freyd himself. Well-poweredness or cowell-poweredness controls subobject lattices as in work by Peter Freyd and Samuel Eilenberg, while generator or cogenerator hypotheses ensure that the constructed maps are universal via representability arguments akin to those in the Yoneda lemma. The proof employs smallness arguments related to Zermelo–Fraenkel set theory considerations and avoids large-cardinal pathologies discussed in contexts like Grothendieck universes.

Examples and applications

Concrete instances include the left adjoint to the forgetful functor from groups to sets, the abelianization functor from groups to abelian groups, and free-object constructions for monoids and rings. In algebraic geometry, the theorem underlies adjoints between categories of modules and sheaves, and it supports existence results used in derived category constructions employed by Verdier and Grothendieck. In topology, adjoints appear between categories like Top and Set for free topological constructions; in functional analysis and operator algebras adjoint existence informs C*-algebra and Banach space adjunctions studied by Gelfand and Naimark. Computer science applications occur in the theory of lambda calculus and categorical semantics by Haskell Curry-influenced developments and in categorical models used by Dana Scott and Gunter Rote.

Variants and related results

Related criteria include the Special Adjoint Functor Theorem (SAFT), the General Adjoint Functor Theorem (GAFT), and enriched versions for V-enriched categories developed in contexts by G. M. Kelly and Max Kelly. There are homotopical adaptations in model category theory by Quillen and elaborations in higher category theory by researchers such as Jacob Lurie and Charles Rezk, and enriched or internal analogues appearing in work by Emily Riehl and Marco Grandis. Connections exist with representability theorems like Brown representability and with limit/colimit preservation results used in descent theory and stacks as in the work of Deligne and M. Artin.

Category:Category theory