Definition 1.4 (Functor). Let C and D be categories. A functor F:C→D consists of mappings F:ob⁡C→ob⁡D and F+mor⁡C→mor⁡D such that:

  • F(dom⁡f)=dom⁡Ff

  • F(cod⁡f)=cod⁡Ff

  • F(1A)=1FA

  • F(fg)=(Ff)(Fg) whenever fg is defined.

We write Cat for the category of small categories and the functors between them.