nLab representable functor theorem

Idea

The representable and corepresentable functor theorems are simple consequences of the general adjoint functor theorem and the following observations:

Statement

The representable functor theorem states that:

The latter condition means the following: there is a set II, an II-indexed family of objects X iCX_i\in C, and an II-indexed family of elements f iF(X i)f_i\in F(X_i) such that for every object YCY\in C and hF(Y)h\in F(Y) there is kIk\in I and t:YX it\colon Y\to X_i such that h=F(t)(f i)h=F(t)(f_i).

Dually, the corepresentable functor theorem states that:

The latter condition means the following: there is a set II, an II-indexed family of objects X iCX_i\in C, and an II-indexed family of elements f iF(X i)f_i\in F(X_i) such that for every object YCY\in C and hF(Y)h\in F(Y) there is kIk\in I and t:X iYt\colon X_i\to Y such that h=F(t)(f i)h=F(t)(f_i).

As representable functors are closely connected to adjoint functors, this theorem is essentially equivalent to the adjoint functor theorem and to theorems guaranteeing the existence of limits.

Specifically, assuming that CC is copowered over Set (in particular, this is true if CC is cocomplete), a functor CSetC\to Set is a right adjoint functor if and only if it is representable, in which case the left adjoint functor SetCSet\to C sends the singleton set to the representing object, and more generally a set XX to the copower of XX with the representing object.

References

Last revised on April 20, 2025 at 23:18:07. See the history of this page for a list of all contributions to it.