nLab full functor




A functor F:CDF\colon C \to D from a category CC to a category DD is called full if for each pair of objects x,yCx, y \in C, the function

F:C(x,y)D(F(x),F(y))F\colon C(x,y) \to D(F(x), F(y))

between hom sets is surjective.

More abstractly, we may say a functor is full if it is 1-surjective – or, in simple terms, ‘surjective on morphisms between given objects’. (Note that a functor may be full without being surjective on morphisms, overall, since FF is allowed to not hit morphisms between objects that are not in the image of FF.)

Fullness is most important for functors which are also faithful, and full and faithful functors are often called fully faithful. For ordinary functors this may sound odd, because there is no real sense in which “full” modifies “faithful.” However, in some contexts (such as for morphisms in a general 2-category), there is a good notion of “full-and-faithful” or “fully faithful,” but the right notion of “full” alone is not so clear. “Fully faithful” is also sometimes abbreviated to “ff”; see also bo-ff factorization system.

A subcategory is called a full subcategory if its inclusion functor (which is automatically faithful) is also full, and any full and faithful functor exhibits an equivalence of its domain with a full subcategory of its codomain.



Given a pair of adjoint functors

𝒞AAAARL𝒟 \mathcal{C} \underoverset {\underset{R}{\longrightarrow}} {\overset{L}{\longleftarrow}} { \phantom{AA} \bot \phantom{AA} } \mathcal{D}

For proof see this Prop at adjoint functor.

basic properties of…

Last revised on May 27, 2020 at 16:19:46. See the history of this page for a list of all contributions to it.