nLab
free functor

Contents

Idea

Informally, a free functor is a left adjoint to a forgetful functor – part of a free-forgetful adjunction. (This is informal because the concept of forgetful functor is informal; any functor might be viewed as forgetful, so any left adjoint might be viewed as free, while in practice only some are.)

Formally, with respect to a monad or algebraic theory or operad T, and TAlg(C) the corresponding category of algebras over a monad or algebras over an algebraic theory or algebras over an operad, respectively, in some category C, the free T-algebra functor is the left adjoint to the forgetful functor TAlg(C)C.

Such a functor may be thought of as sending any object of C to the T-algebra freely generated by it.

Free objects

In general, if U:CD is thought of as a forgetful functor and F:DC is its left adjoint, then F(x) is the free C-object on an object x of D.

More generally, even if the entire left adjoint F doesn’t exist, a free object on x can be defined using a universal property, as “what the value of F(x) would be if F existed.” Conversely, if a free object on x exists for all xD, then the left adjoint F can be assembled from them.

Cofree functors

Dually, a cofree functor is a right adjoint to a forgetful functor.

For the classical functors which forget algebraic structure, cofree functors are less common than free functors. As a political joke (which works best for someone who associates political freedom with the left wing), cofree functors have sometimes been called fascist functors. Some discussion of this joke may be found at the nForum.

Examples

For free functors

One formal sort of free functor is the left adjoint CC T, where T is a monad on the category C and C T is its Eilenberg-Moore category (the category of T-algebras). This includes all of thee examples above and many others.

A general way to construct free functors is with a transfinite construction of free algebras (in set-theoretic foundations), or with an inductive type or higher inductive type (in type-theoretic foundations).

For cofree functors

  • The cofree coalgebra on a vector space. More generally, if M is an operad in a symmetric monoidal category V, Prop(M) its associated PROP, and if C is a monoidal V-category, then an M-coalgebra in C may be identified with a monoidal V-functor Prop(M) opC. Under suitable completeness assumptions on C, the forgetful functor M-Coalg CC has a right adjoint, and this forgetful functor is comonadic.

  • If M is a monoid, the forgetful functor Set MSet on (left) M-sets has a right adjoint Xhom(M,X), where M acts on functions f:MX according to the rule (mf)(m)=f(mm). This forgetful functor is comonadic. Much more generally, the right adjoint to the underlying functor Set CSet/C 0 (C 0 the set of objects of a category C) is comonadic. More generally still, if V is complete and f:CD is a functor between small categories, the functor V f:V DV C has a right adjoint (although V f will not normally be comonadic in this generality).

  • The forgetful functor CatSet, taking a small category to its set of objects, has a right adjoint K for which KX is a category whose objects are elements of X and where there is exactly one morphism xy for any x,yX. The category KX, which is a groupoid, is known as the chaotic category on X, or the indiscrete category on X.

  • When U:CSet is topological concrete category over Set, as for example the forgetful functor U:TopSet, it frequently happens that U possesses a right adjoint, assigning to a set an “indiscrete topology”.

  • A rich source of examples is coreflective subcategories, which are comonadic over the ambient category. For example, the category of compactly generated spaces is coreflective in the category of all spaces, Top.

Revised on December 6, 2012 08:25:10 by Mike Shulman (192.16.204.218)