Functor

<h2 id="definition">Definition</h2>

Let C and D be <a href="/facts/Category_(mathematics)/7WzxUThf">categories</a>. A functor F from C to D is a mapping that<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a>

<ul><li>associates each <a href="/facts/Mathematical_object/Juhyow9M">object</a> 
 
 
 
 X
 
 
 {\displaystyle X}
 
 in C to an object 
 
 
 
 F
 (
 X
 )
 
 
 {\displaystyle F(X)}
 
 in D,</li>
<li>associates each <a href="/facts/Morphism/Kdpuyz3S">morphism</a> 
 
 
 
 f
 :
 X
 →
 Y
 
 
 {\displaystyle f\colon X\to Y}
 
 in C to a morphism 
 
 
 
 F
 (
 f
 )
 :
 F
 (
 X
 )
 →
 F
 (
 Y
 )
 
 
 {\displaystyle F(f)\colon F(X)\to F(Y)}
 
 in D such that the following two conditions hold:
<ul><li>
 
 
 
 F
 (
 
 
 i
 d
 
 
 X
 
 
 )
 =
 
 
 i
 d
 
 
 F
 (
 X
 )
 
 
 
 
 
 
 {\displaystyle F(\mathrm {id} _{X})=\mathrm {id} _{F(X)}\,\!}
 
 for every object 
 
 
 
 X
 
 
 {\displaystyle X}
 
 in C,</li>
<li>
 
 
 
 F
 (
 g
 ∘
 f
 )
 =
 F
 (
 g
 )
 ∘
 F
 (
 f
 )
 
 
 {\displaystyle F(g\circ f)=F(g)\circ F(f)}
 
 for all morphisms 
 
 
 
 f
 :
 X
 →
 Y
 
 
 
 
 {\displaystyle f\colon X\to Y\,\!}
 
 and 
 
 
 
 g
 :
 Y
 →
 Z
 
 
 {\displaystyle g\colon Y\to Z}
 
 in C.</li></ul></li></ul>
That is, functors must preserve <a href="/facts/Morphism/Kdpuyz3S">identity morphisms</a> and <a href="/facts/Function_composition/r5Pvnmth">composition</a> of morphisms.

<h3>Covariance and contravariance</h3>
See also: <a href="/facts/Covariance_and_contravariance_(computer_science)/NzBlXxF3">Covariance and contravariance (computer science)</a>
There are many constructions in mathematics that would be functors but for the fact that they "turn morphisms around" and "reverse composition". We then define a contravariant functor F from C to D as a mapping that

<ul><li>associates each object 
 
 
 
 X
 
 
 {\displaystyle X}
 
 in C with an object 
 
 
 
 F
 (
 X
 )
 
 
 {\displaystyle F(X)}
 
 in D,</li>
<li>associates each morphism 
 
 
 
 f
 :
 X
 →
 Y
 
 
 {\displaystyle f\colon X\to Y}
 
 in C with a morphism 
 
 
 
 F
 (
 f
 )
 :
 F
 (
 Y
 )
 →
 F
 (
 X
 )
 
 
 {\displaystyle F(f)\colon F(Y)\to F(X)}
 
 in D such that the following two conditions hold:
<ul><li>
 
 
 
 F
 (
 
 
 i
 d
 
 
 X
 
 
 )
 =
 
 
 i
 d
 
 
 F
 (
 X
 )
 
 
 
 
 
 
 {\displaystyle F(\mathrm {id} _{X})=\mathrm {id} _{F(X)}\,\!}
 
 for every object 
 
 
 
 X
 
 
 {\displaystyle X}
 
 in C,</li>
<li>
 
 
 
 F
 (
 g
 ∘
 f
 )
 =
 F
 (
 f
 )
 ∘
 F
 (
 g
 )
 
 
 {\displaystyle F(g\circ f)=F(f)\circ F(g)}
 
 for all morphisms 
 
 
 
 f
 :
 X
 →
 Y
 
 
 {\displaystyle f\colon X\to Y}
 
 and 
 
 
 
 g
 :
 Y
 →
 Z
 
 
 {\displaystyle g\colon Y\to Z}
 
 in C.</li></ul></li></ul>
Variance of functor (composite)<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a>

<ul><li>The composite of two functors of the same variance:
<ul><li>
 
 
 
 
 C
 o
 v
 a
 r
 i
 a
 n
 t
 
 ∘
 
 C
 o
 v
 a
 r
 i
 a
 n
 t
 
 →
 
 C
 o
 v
 a
 r
 i
 a
 n
 t
 
 
 
 {\displaystyle \mathrm {Covariant} \circ \mathrm {Covariant} \to \mathrm {Covariant} }
 
</li>
<li>
 
 
 
 
 C
 o
 n
 t
 r
 a
 v
 a
 r
 i
 a
 n
 t
 
 ∘
 
 C
 o
 n
 t
 r
 a
 v
 a
 r
 i
 a
 n
 t
 
 →
 
 C
 o
 v
 a
 r
 i
 a
 n
 t
 
 
 
 {\displaystyle \mathrm {Contravariant} \circ \mathrm {Contravariant} \to \mathrm {Covariant} }
 
</li></ul></li>
<li>The composite of two functors of opposite variance:
<ul><li>
 
 
 
 
 C
 o
 v
 a
 r
 i
 a
 n
 t
 
 ∘
 
 C
 o
 n
 t
 r
 a
 v
 a
 r
 i
 a
 n
 t
 
 →
 
 C
 o
 n
 t
 r
 a
 v
 a
 r
 i
 a
 n
 t
 
 
 
 {\displaystyle \mathrm {Covariant} \circ \mathrm {Contravariant} \to \mathrm {Contravariant} }
 
</li>
<li>
 
 
 
 
 C
 o
 n
 t
 r
 a
 v
 a
 r
 i
 a
 n
 t
 
 ∘
 
 C
 o
 v
 a
 r
 i
 a
 n
 t
 
 →
 
 C
 o
 n
 t
 r
 a
 v
 a
 r
 i
 a
 n
 t
 
 
 
 {\displaystyle \mathrm {Contravariant} \circ \mathrm {Covariant} \to \mathrm {Contravariant} }
 
</li></ul></li></ul>
Note that contravariant functors reverse the direction of composition.
Ordinary functors are also called covariant functors in order to distinguish them from contravariant ones. Note that one can also define a contravariant functor as a covariant functor on the <a href="/facts/Opposite_category/swDy8NrJ">opposite category</a> 
 
 
 
 
 C
 
 
 o
 p
 
 
 
 
 
 {\displaystyle C^{\mathrm {op} }}
 
.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> Some authors prefer to write all expressions covariantly. That is, instead of saying 
 
 
 
 F
 :
 C
 →
 D
 
 
 {\displaystyle F\colon C\to D}
 
 is a contravariant functor, they simply write 
 
 
 
 F
 :
 
 C
 
 
 o
 p
 
 
 
 →
 D
 
 
 {\displaystyle F\colon C^{\mathrm {op} }\to D}
 
 (or sometimes 
 
 
 
 F
 :
 C
 →
 
 D
 
 
 o
 p
 
 
 
 
 
 {\displaystyle F\colon C\to D^{\mathrm {op} }}
 
) and call it a functor.
Contravariant functors are also occasionally called cofunctors.<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a>
There is a convention which refers to "vectors"—i.e., <a href="/facts/Vector_field/ccFNuPPp">vector fields</a>, elements of the space of sections 
 
 
 
 Γ
 (
 T
 M
 )
 
 
 {\displaystyle \Gamma (TM)}
 
 of a <a href="/facts/Tangent_bundle/dq8zW9Kb">tangent bundle</a> 
 
 
 
 T
 M
 
 
 {\displaystyle TM}
 
—as "contravariant" and to "covectors"—i.e., <a href="/facts/1-forms/NQLbWmtD">1-forms</a>, elements of the space of sections 
 
 
 
 Γ
 
 
 
 (
 
 
 T
 
 ∗
 
 
 M
 
 )
 
 
 
 
 
 {\displaystyle \Gamma {\mathord {\left(T^{*}M\right)}}}
 
 of a <a href="/facts/Cotangent_bundle/dewBXXxr">cotangent bundle</a> 
 
 
 
 
 T
 
 ∗
 
 
 M
 
 
 {\displaystyle T^{*}M}
 
—as "covariant". This terminology originates in physics, and its rationale has to do with the position of the indices ("upstairs" and "downstairs") in <a href="/facts/Einstein_summation/UXwS43wU">expressions</a> such as 
 
 
 
 
 
 
 x
 ′
 
 
 
 
 i
 
 
 =
 
 Λ
 
 j
 
 
 i
 
 
 
 x
 
 j
 
 
 
 
 {\displaystyle {x'}^{\,i}=\Lambda _{j}^{i}x^{j}}
 
 for 
 
 
 
 
 
 x
 
 ′
 
 =
 
 Λ
 
 
 x
 
 
 
 {\displaystyle \mathbf {x} '={\boldsymbol {\Lambda }}\mathbf {x} }
 
 or 
 
 
 
 
 ω
 
 i
 
 ′
 
 =
 
 Λ
 
 i
 
 
 j
 
 
 
 ω
 
 j
 
 
 
 
 {\displaystyle \omega '_{i}=\Lambda _{i}^{j}\omega _{j}}
 
 for 
 
 
 
 
 
 ω
 
 ′
 
 =
 
 ω
 
 
 
 Λ
 
 
 
 T
 
 
 
 .
 
 
 {\displaystyle {\boldsymbol {\omega }}'={\boldsymbol {\omega }}{\boldsymbol {\Lambda }}^{\textsf {T}}.}
 
 In this formalism it is observed that the coordinate transformation symbol 
 
 
 
 
 Λ
 
 i
 
 
 j
 
 
 
 
 {\displaystyle \Lambda _{i}^{j}}
 
 (representing the matrix 
 
 
 
 
 
 Λ
 
 
 
 T
 
 
 
 
 
 {\displaystyle {\boldsymbol {\Lambda }}^{\textsf {T}}}
 
) acts on the "covector coordinates" "in the same way" as on the basis vectors: 
 
 
 
 
 
 e
 
 
 i
 
 
 =
 
 Λ
 
 i
 
 
 j
 
 
 
 
 e
 
 
 j
 
 
 
 
 {\displaystyle \mathbf {e} _{i}=\Lambda _{i}^{j}\mathbf {e} _{j}}
 
—whereas it acts "in the opposite way" on the "vector coordinates" (but "in the same way" as on the basis covectors: 
 
 
 
 
 
 e
 
 
 i
 
 
 =
 
 Λ
 
 j
 
 
 i
 
 
 
 
 e
 
 
 j
 
 
 
 
 {\displaystyle \mathbf {e} ^{i}=\Lambda _{j}^{i}\mathbf {e} ^{j}}
 
). This terminology is contrary to the one used in category theory because it is the covectors that have pullbacks in general and are thus contravariant, whereas vectors in general are covariant since they can be pushed forward. See also <a href="/facts/Covariance_and_contravariance_of_vectors/s3HGMkhz">Covariance and contravariance of vectors</a>.

<h3>Opposite functor</h3>
Every functor 
 
 
 
 F
 :
 C
 →
 D
 
 
 {\displaystyle F\colon C\to D}
 
 induces the opposite functor 
 
 
 
 
 F
 
 
 o
 p
 
 
 
 :
 
 C
 
 
 o
 p
 
 
 
 →
 
 D
 
 
 o
 p
 
 
 
 
 
 {\displaystyle F^{\mathrm {op} }\colon C^{\mathrm {op} }\to D^{\mathrm {op} }}
 
, where 
 
 
 
 
 C
 
 
 o
 p
 
 
 
 
 
 {\displaystyle C^{\mathrm {op} }}
 
 and 
 
 
 
 
 D
 
 
 o
 p
 
 
 
 
 
 {\displaystyle D^{\mathrm {op} }}
 
 are the <a href="/facts/Opposite_category/swDy8NrJ">opposite categories</a> to 
 
 
 
 C
 
 
 {\displaystyle C}
 
 and 
 
 
 
 D
 
 
 {\displaystyle D}
 
.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a> By definition, 
 
 
 
 
 F
 
 
 o
 p
 
 
 
 
 
 {\displaystyle F^{\mathrm {op} }}
 
 maps objects and morphisms in the identical way as does 
 
 
 
 F
 
 
 {\displaystyle F}
 
. Since 
 
 
 
 
 C
 
 
 o
 p
 
 
 
 
 
 {\displaystyle C^{\mathrm {op} }}
 
 does not coincide with 
 
 
 
 C
 
 
 {\displaystyle C}
 
 as a category, and similarly for 
 
 
 
 D
 
 
 {\displaystyle D}
 
, 
 
 
 
 
 F
 
 
 o
 p
 
 
 
 
 
 {\displaystyle F^{\mathrm {op} }}
 
 is distinguished from 
 
 
 
 F
 
 
 {\displaystyle F}
 
. For example, when composing 
 
 
 
 F
 :
 
 C
 
 0
 
 
 →
 
 C
 
 1
 
 
 
 
 {\displaystyle F\colon C_{0}\to C_{1}}
 
 with 
 
 
 
 G
 :
 
 C
 
 1
 
 
 
 o
 p
 
 
 
 →
 
 C
 
 2
 
 
 
 
 {\displaystyle G\colon C_{1}^{\mathrm {op} }\to C_{2}}
 
, one should use either 
 
 
 
 G
 ∘
 
 F
 
 
 o
 p
 
 
 
 
 
 {\displaystyle G\circ F^{\mathrm {op} }}
 
 or 
 
 
 
 
 G
 
 
 o
 p
 
 
 
 ∘
 F
 
 
 {\displaystyle G^{\mathrm {op} }\circ F}
 
. Note that, following the property of <a href="/facts/Opposite_category/swDy8NrJ">opposite category</a>, 
 
 
 
 
 
 (
 
 F
 
 
 o
 p
 
 
 
 )
 
 
 
 o
 p
 
 
 
 =
 F
 
 
 {\displaystyle \left(F^{\mathrm {op} }\right)^{\mathrm {op} }=F}
 
.

<h3>Bifunctors and multifunctors</h3>
A bifunctor (also known as a binary functor) is a functor whose domain is a <a href="/facts/Product_category/qxo71BwR">product category</a>. For example, the <a href="/facts/Hom_functor/H76BLKCD">Hom functor</a> is of the type Cop × C → Set. It can be seen as a functor in two arguments; it is contravariant in one argument, covariant in the other.
A multifunctor is a generalization of the functor concept to n variables. So, for example, a bifunctor is a multifunctor with n = 2.

<h2 id="properties">Properties</h2>
Two important consequences of the functor <a href="/facts/Axiom/mLjP14Mc">axioms</a> are:

<ul><li>F transforms each <a href="/facts/Commutative_diagram/bdG8xuer">commutative diagram</a> in C into a commutative diagram in D;</li>
<li>if f is an <a href="/facts/Isomorphism/pj8KgkxU">isomorphism</a> in C, then F(f) is an isomorphism in D.</li></ul>
One can compose functors, i.e. if F is a functor from A to B and G is a functor from B to C then one can form the composite functor G ∘ F from A to C. Composition of functors is associative where defined. Identity of composition of functors is the identity functor. This shows that functors can be considered as morphisms in categories of categories, for example in the <a href="/facts/Category_of_small_categories/BJt1bdM7">category of small categories</a>.
A small category with a single object is the same thing as a <a href="/facts/Monoid/6AHve7p8">monoid</a>: the morphisms of a one-object category can be thought of as elements of the monoid, and composition in the category is thought of as the monoid operation. Functors between one-object categories correspond to monoid <a href="/facts/Homomorphism/0gyqdEse">homomorphisms</a>. So in a sense, functors between arbitrary categories are a kind of generalization of monoid homomorphisms to categories with more than one object.

<h2 id="examples">Examples</h2>
<a href="/facts/Diagram_(category_theory)/kGTlM945">Diagram</a>
For categories C and J, a diagram of type J in C is a covariant functor 
 
 
 
 D
 :
 J
 →
 C
 
 
 {\displaystyle D\colon J\to C}
 
.
<a href="/facts/Presheaf_(category_theory)/gWTNAFo3">(Category theoretical) presheaf</a>
For categories C and J, a J-presheaf on C is a contravariant functor 
 
 
 
 D
 :
 C
 →
 J
 
 
 {\displaystyle D\colon C\to J}
 
.In the special case when J is Set, the category of sets and functions, D is called a <a href="/facts/Presheaf_(category_theory)/gWTNAFo3">presheaf</a> on C.
Presheaves (over a topological space)
If X is a <a href="/facts/Topological_space/v2ut7CbK">topological space</a>, then the <a href="/facts/Open_set/QfTCIqMu">open sets</a> in X form a <a href="/facts/Partially_ordered_set/qb4a3FAX">partially ordered set</a> Open(X) under inclusion. Like every partially ordered set, Open(X) forms a small category by adding a single arrow U → V if and only if 
 
 
 
 U
 ⊆
 V
 
 
 {\displaystyle U\subseteq V}
 
. Contravariant functors on Open(X) are called <a href="/facts/Presheaf/MM3hcRw4">presheaves</a> on X. For instance, by assigning to every open set U the <a href="/facts/Associative_algebra/DRfoF6KV">associative algebra</a> of real-valued continuous functions on U, one obtains a presheaf of algebras on X.
Constant functor
The functor C → D which maps every object of C to a fixed object X in D and every morphism in C to the identity morphism on X. Such a functor is called a constant or selection functor.
Endofunctor
A functor that maps a category to that same category; e.g., <a href="/facts/Polynomial_functor/mXKoK0C4">polynomial functor</a>.
Identity functor
In category C, written 1C or idC, maps an object to itself and a morphism to itself. The identity functor is an endofunctor.
Diagonal functor
The <a href="/facts/Diagonal_functor/0n7fJ3H4">diagonal functor</a> is defined as the functor from D to the functor category DC which sends each object in D to the constant functor at that object.
Limit functor
For a fixed <a href="/facts/Index_category/kGTlM945">index category</a> J, if every functor J → C has a <a href="/facts/Limit_(category_theory)/JoLugLs3">limit</a> (for instance if C is complete), then the limit functor CJ → C assigns to each functor its limit. The existence of this functor can be proved by realizing that it is the <a href="/facts/Adjoint_functors/bJ1P7AN2">right-adjoint</a> to the <a href="/facts/Diagonal_functor/0n7fJ3H4">diagonal functor</a> and invoking the <a href="/facts/Freyd_adjoint_functor_theorem/bJ1P7AN2">Freyd adjoint functor theorem</a>. This requires a suitable version of the <a href="/facts/Axiom_of_choice/1Ura2HTh">axiom of choice</a>. Similar remarks apply to the colimit functor (which assigns to every functor its colimit, and is covariant).
Power sets functor
The power set functor P : Set → Set maps each set to its <a href="/facts/Power_set/FVuf8PDD">power set</a> and each function 
 
 
 
 f
 :
 X
 →
 Y
 
 
 {\displaystyle f\colon X\to Y}
 
 to the map which sends 
 
 
 
 U
 ∈
 
 
 P
 
 
 (
 X
 )
 
 
 {\displaystyle U\in {\mathcal {P}}(X)}
 
 to its image 
 
 
 
 f
 (
 U
 )
 ∈
 
 
 P
 
 
 (
 Y
 )
 
 
 {\displaystyle f(U)\in {\mathcal {P}}(Y)}
 
. One can also consider the contravariant power set functor which sends 
 
 
 
 f
 :
 X
 →
 Y
 
 
 {\displaystyle f\colon X\to Y}
 
 to the map which sends 
 
 
 
 V
 ⊆
 Y
 
 
 {\displaystyle V\subseteq Y}
 
 to its <a href="/facts/Inverse_image/KANefMAl">inverse image</a> 
 
 
 
 
 f
 
 −
 1
 
 
 (
 V
 )
 ⊆
 X
 .
 
 
 {\displaystyle f^{-1}(V)\subseteq X.}
 
 For example, if 
 
 
 
 X
 =
 {
 0
 ,
 1
 }
 
 
 {\displaystyle X=\{0,1\}}
 
 then 
 
 
 
 F
 (
 X
 )
 =
 
 
 P
 
 
 (
 X
 )
 =
 {
 {
 }
 ,
 {
 0
 }
 ,
 {
 1
 }
 ,
 X
 }
 
 
 {\displaystyle F(X)={\mathcal {P}}(X)=\{\{\},\{0\},\{1\},X\}}
 
. Suppose 
 
 
 
 f
 (
 0
 )
 =
 {
 }
 
 
 {\displaystyle f(0)=\{\}}
 
 and 
 
 
 
 f
 (
 1
 )
 =
 X
 
 
 {\displaystyle f(1)=X}
 
. Then 
 
 
 
 F
 (
 f
 )
 
 
 {\displaystyle F(f)}
 
 is the function which sends any subset 
 
 
 
 U
 
 
 {\displaystyle U}
 
 of 
 
 
 
 X
 
 
 {\displaystyle X}
 
 to its image 
 
 
 
 f
 (
 U
 )
 
 
 {\displaystyle f(U)}
 
, which in this case means 
 
 
 
 {
 }
 ↦
 f
 (
 {
 }
 )
 =
 {
 }
 
 
 {\displaystyle \{\}\mapsto f(\{\})=\{\}}
 
, where 
 
 
 
 ↦
 
 
 {\displaystyle \mapsto }
 
 denotes the mapping under 
 
 
 
 F
 (
 f
 )
 
 
 {\displaystyle F(f)}
 
, so this could also be written as 
 
 
 
 (
 F
 (
 f
 )
 )
 (
 {
 }
 )
 =
 {
 }
 
 
 {\displaystyle (F(f))(\{\})=\{\}}
 
. For the other values,
 
 
 
 {
 0
 }
 ↦
 f
 (
 {
 0
 }
 )
 =
 {
 f
 (
 0
 )
 }
 =
 {
 {
 }
 }
 ,
  
 
 
 {\displaystyle \{0\}\mapsto f(\{0\})=\{f(0)\}=\{\{\}\},\ }
 
 
 
 
 
 {
 1
 }
 ↦
 f
 (
 {
 1
 }
 )
 =
 {
 f
 (
 1
 )
 }
 =
 {
 X
 }
 ,
  
 
 
 {\displaystyle \{1\}\mapsto f(\{1\})=\{f(1)\}=\{X\},\ }
 
 
 
 
 
 {
 0
 ,
 1
 }
 ↦
 f
 (
 {
 0
 ,
 1
 }
 )
 =
 {
 f
 (
 0
 )
 ,
 f
 (
 1
 )
 }
 =
 {
 {
 }
 ,
 X
 }
 .
 
 
 {\displaystyle \{0,1\}\mapsto f(\{0,1\})=\{f(0),f(1)\}=\{\{\},X\}.}
 
 Note that 
 
 
 
 f
 (
 {
 0
 ,
 1
 }
 )
 
 
 {\displaystyle f(\{0,1\})}
 
 consequently generates the <a href="/facts/Trivial_topology/uA7RlGth">trivial topology</a> on 
 
 
 
 X
 
 
 {\displaystyle X}
 
. Also note that although the function 
 
 
 
 f
 
 
 {\displaystyle f}
 
 in this example mapped to the power set of 
 
 
 
 X
 
 
 {\displaystyle X}
 
, that need not be the case in general.
Dual vector space
The map which assigns to every <a href="/facts/Vector_space/M1pxMLx2">vector space</a> its <a href="/facts/Dual_space/4Uw4Knz1">dual space</a> and to every <a href="/facts/Linear_operator/Q1PBKNVV">linear map</a> its dual or transpose is a contravariant functor from the category of all vector spaces over a fixed <a href="/facts/Field_(mathematics)/xAjAS4ko">field</a> to itself.
Fundamental group
Consider the category of <a href="/facts/Pointed_topological_space/V4DTgRCd">pointed topological spaces</a>, i.e. topological spaces with distinguished points. The objects are pairs (X, x0), where X is a topological space and x0 is a point in X. A morphism from (X, x0) to (Y, y0) is given by a <a href="/facts/Continuous_function_(topology)/sKbl02pB">continuous</a> map f : X → Y with f(x0) = y0. To every topological space X with distinguished point x0, one can define the <a href="/facts/Fundamental_group/VyYtLqSP">fundamental group</a> based at x0, denoted π1(X, x0). This is the <a href="/facts/Group_(mathematics)/IQTYqINt">group</a> of <a href="/facts/Homotopy/1nWrPxdj">homotopy</a> classes of loops based at x0, with the group operation of concatenation. If f : X → Y is a morphism of <a href="/facts/Pointed_space/V4DTgRCd">pointed spaces</a>, then every loop in X with base point x0 can be composed with f to yield a loop in Y with base point y0. This operation is compatible with the homotopy <a href="/facts/Equivalence_relation/1MQ5rtkW">equivalence relation</a> and the composition of loops, and we get a <a href="/facts/Group_homomorphism/sDguaNYs">group homomorphism</a> from π(X, x0) to π(Y, y0). We thus obtain a functor from the category of pointed topological spaces to the <a href="/facts/Category_of_groups/sxSd9Kbc">category of groups</a>. In the category of topological spaces (without distinguished point), one considers homotopy classes of generic curves, but they cannot be composed unless they share an endpoint. Thus one has the fundamental <a href="/facts/Groupoid/hvj8wvWe">groupoid</a> instead of the fundamental group, and this construction is functorial.
Algebra of continuous functions
A contravariant functor from the category of <a href="/facts/Topology/2EqW47cU">topological spaces</a> (with continuous maps as morphisms) to the category of real <a href="/facts/Associative_algebra/DRfoF6KV">associative algebras</a> is given by assigning to every topological space X the algebra C(X) of all real-valued continuous functions on that space. Every continuous map f : X → Y induces an <a href="/facts/Algebra_homomorphism/b7YL8aPR">algebra homomorphism</a> C(f) : C(Y) → C(X) by the rule C(f)(φ) = φ ∘ f for every φ in C(Y).
Tangent and cotangent bundles
The map which sends every <a href="/facts/Differentiable_manifold/aSnbXKcV">differentiable manifold</a> to its <a href="/facts/Tangent_bundle/dq8zW9Kb">tangent bundle</a> and every <a href="/facts/Smooth_map/mffL4ch2">smooth map</a> to its <a href="/facts/Derivative/7Ito70Dh">derivative</a> is a covariant functor from the category of differentiable manifolds to the category of <a href="/facts/Vector_bundle/cXACAa1I">vector bundles</a>. Doing this constructions pointwise gives the <a href="/facts/Tangent_space/crvpbSeG">tangent space</a>, a covariant functor from the category of pointed differentiable manifolds to the category of real vector spaces. Likewise, <a href="/facts/Cotangent_space/INNIyG4S">cotangent space</a> is a contravariant functor, essentially the composition of the tangent space with the dual space above.
Group actions/representations
Every <a href="/facts/Group_(mathematics)/IQTYqINt">group</a> G can be considered as a category with a single object whose morphisms are the elements of G. A functor from G to Set is then nothing but a <a href="/facts/Group_action_(mathematics)/Vh9VtUUw">group action</a> of G on a particular set, i.e. a G-set. Likewise, a functor from G to the <a href="/facts/Category_of_vector_spaces/AnnF9JKf">category of vector spaces</a>, VectK, is a <a href="/facts/Linear_representation/3ydLtaGH">linear representation</a> of G. In general, a functor G → C can be considered as an "action" of G on an object in the category C. If C is a group, then this action is a group homomorphism.
Lie algebras
Assigning to every real (complex) <a href="/facts/Lie_group/a9jCQyjF">Lie group</a> its real (complex) <a href="/facts/Lie_algebra/n2gAUkNq">Lie algebra</a> defines a functor.
Tensor products
If C denotes the category of vector spaces over a fixed field, with <a href="/facts/Linear_operator/Q1PBKNVV">linear maps</a> as morphisms, then the <a href="/facts/Tensor_product/7K3pR1ap">tensor product</a> 
 
 
 
 V
 ⊗
 W
 
 
 {\displaystyle V\otimes W}
 
 defines a functor C × C → C which is covariant in both arguments.<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a>
Forgetful functors
The functor U : Grp → Set which maps a <a href="/facts/Group_(mathematics)/IQTYqINt">group</a> to its underlying set and a <a href="/facts/Group_homomorphism/sDguaNYs">group homomorphism</a> to its underlying function of sets is a functor.<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a> Functors like these, which "forget" some structure, are termed <a href="/facts/Forgetful_functor/onEwu6HA">forgetful functors</a>. Another example is the functor Rng → Ab which maps a <a href="/facts/Ring_(algebra)/JnCUXz63">ring</a> to its underlying additive <a href="/facts/Abelian_group/FfWwmx4R">abelian group</a>. Morphisms in Rng (<a href="/facts/Ring_homomorphism/UptcMpFk">ring homomorphisms</a>) become morphisms in Ab (abelian group homomorphisms).
Free functors
Going in the opposite direction of forgetful functors are free functors. The free functor F : Set → Grp sends every set X to the <a href="/facts/Free_group/zPo2NIGb">free group</a> generated by X. Functions get mapped to group homomorphisms between free groups. Free constructions exist for many categories based on structured sets. See <a href="/facts/Free_object/VxL28y8B">free object</a>.
Homomorphism groups
To every pair A, B of <a href="/facts/Group_(mathematics)/IQTYqINt">abelian groups</a> one can assign the abelian group Hom(A, B) consisting of all <a href="/facts/Group_homomorphism/sDguaNYs">group homomorphisms</a> from A to B. This is a functor which is contravariant in the first and covariant in the second argument, i.e. it is a functor Abop × Ab → Ab (where Ab denotes the <a href="/facts/Category_of_abelian_groups/jF3sXRFn">category of abelian groups</a> with group homomorphisms). If f : A1 → A2 and g : B1 → B2 are morphisms in Ab, then the group homomorphism Hom(f, g): Hom(A2, B1) → Hom(A1, B2) is given by φ ↦ g ∘ φ ∘ f. See <a href="/facts/Hom_functor/H76BLKCD">Hom functor</a>.
Representable functors
We can generalize the previous example to any category C. To every pair X, Y of objects in C one can assign the set Hom(X, Y) of morphisms from X to Y. This defines a functor to Set which is contravariant in the first argument and covariant in the second, i.e. it is a functor Cop × C → Set. If f : X1 → X2 and g : Y1 → Y2 are morphisms in C, then the map Hom(f, g) : Hom(X2, Y1) → Hom(X1, Y2) is given by φ ↦ g ∘ φ ∘ f. Functors like these are called <a href="/facts/Representable_functor/dILwN4oj">representable functors</a>. An important goal in many settings is to determine whether a given functor is representable.
<h2 id="relation-to-other-categorical-concepts">Relation to other categorical concepts</h2>
Let C and D be categories. The collection of all functors from C to D forms the objects of a category: the <a href="/facts/Functor_category/r7sWdb2h">functor category</a>. Morphisms in this category are <a href="/facts/Natural_transformation/xwPumTHt">natural transformations</a> between functors.
Functors are often defined by <a href="/facts/Universal_property/5XJBYMNz">universal properties</a>; examples are the <a href="/facts/Tensor_product/7K3pR1ap">tensor product</a>, the <a href="/facts/Direct_sum_of_modules/Y6PBJnjg">direct sum</a> and <a href="/facts/Direct_product/GehGQmNV">direct product</a> of groups or vector spaces, construction of free groups and modules, <a href="/facts/Direct_limit/V3JuHnYK">direct</a> and <a href="/facts/Inverse_limit/f6QecRUu">inverse</a> limits. The concepts of <a href="/facts/Limit_(category_theory)/JoLugLs3">limit and colimit</a> generalize several of the above.
Universal constructions often give rise to pairs of <a href="/facts/Adjoint_functors/bJ1P7AN2">adjoint functors</a>.

<h2 id="computer-implementations">Computer implementations</h2>
Main article: <a href="/facts/Functor_(functional_programming)/4kdQbJvz">Functor (functional programming)</a>
Functors sometimes appear in <a href="/facts/Functional_programming/cdxqPEIM">functional programming</a>. For instance, the programming language <a href="/facts/Haskell_(programming_language)/4Htv9WLu">Haskell</a> has a <a href="/facts/Type_class/MBbIhF4n">class</a> Functor where <a href="/facts/Map_(higher-order_function)/GdzN4UJl">fmap</a> is a <a href="/facts/Polytypic_function/S3cCKsVT">polytypic function</a> used to map <a href="/facts/Function_(computer_programming)/9vFJrg0A">functions</a> (morphisms on Hask, the category of Haskell types)<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> between existing types to functions between some new types.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a>

<h2 id="see-also">See also</h2>
<ul>
<li>Mathematics portal</li></ul>
<ul><li><a href="/facts/Anafunctor/hnwk4YsB">Anafunctor</a></li>
<li><a href="/facts/Profunctor/DAbBG8zK">Profunctor</a></li>
<li><a href="/facts/Functor_category/r7sWdb2h">Functor category</a></li>
<li><a href="/facts/Kan_extension/AvscnCfD">Kan extension</a></li>
<li><a href="/facts/Pseudofunctor/15bRbrVn">Pseudofunctor</a></li></ul>
<h2 id="notes">Notes</h2>

<ul><li><a href="/facts/Nathan_Jacobson/TEDrg4Lk">Jacobson, Nathan</a> (2009), Basic algebra, vol. 2 (2nd ed.), Dover, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-486-47187-7.</li>
<li>Simmons, Harold (2011), "Functors and natural transformations", <a href="https://books.google.com/books?id=VOCQUC_uiWgC&pg=PA74">An Introduction to Category Theory</a>, pp. 72–107, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1017%2FCBO9780511863226.004">10.1017/CBO9780511863226.004</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-107-01087-1</li></ul>
<h2 id="external-links">External links</h2>

Look up functor in Wiktionary, the free dictionary.

<ul><li><a href="https://www.encyclopediaofmath.org/index.php?title=Functor">"Functor"</a>, <a href="/facts/Encyclopedia_of_Mathematics/WC6mGtPm">Encyclopedia of Mathematics</a>, <a href="/facts/European_Mathematical_Society/B3h7b672">EMS Press</a>, 2001 [1994]</li>
<li>see <a href="https://ncatlab.org/nlab/show/functor">functor</a> at the <a href="/facts/NLab/lpPvRmgo">nLab</a> and the variations discussed and linked to there.</li>
<li><a href="/facts/Andr%25C3%25A9_Joyal/Xc0dKuXB">André Joyal</a>, <a href="http://ncatlab.org/nlab">CatLab</a>, a wiki project dedicated to the exposition of categorical mathematics</li>
<li>Hillman, Chris (2001). <a href="https://web.archive.org/web/19970503051012/http://www.math.washington.edu:80/~hillman/PUB/categorical.ps">"A Categorical Primer"</a>. <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3264">10.1.1.24.3264</a>. Archived from <a href="http://www.math.washington.edu:80/~hillman/PUB/categorical.ps">the original</a> on 1997-05-03.</li>
<li>J. Adamek, H. Herrlich, G. Stecker, <a href="http://katmat.math.uni-bremen.de/acc/acc.pdf">Abstract and Concrete Categories-The Joy of Cats</a> <a href="https://web.archive.org/web/20150421081851/http://katmat.math.uni-bremen.de/acc/acc.pdf">Archived</a> 2015-04-21 at the <a href="/facts/Wayback_Machine/nmQ3a6JC">Wayback Machine</a></li>
<li><a href="/facts/Stanford_Encyclopedia_of_Philosophy/LDuL5HW4">Stanford Encyclopedia of Philosophy</a>: "<a href="http://plato.stanford.edu/entries/category-theory/">Category Theory</a>" — by Jean-Pierre Marquis. Extensive bibliography.</li>
<li><a href="http://www.mta.ca/~cat-dist/">List of academic conferences on category theory</a></li>
<li>Baez, John, 1996,"<a href="http://math.ucr.edu/home/baez/week73.html">The Tale of n-categories.</a>" An informal introduction to higher order categories.</li>
<li><a href="http://wildcatsformma.wordpress.com/">WildCats</a> is a <a href="/facts/Category_theory/6zS3DXPa">category theory</a> package for <a href="/facts/Mathematica/dRwoGFG2">Mathematica</a>. Manipulation and visualization of objects, <a href="/facts/Morphism/Kdpuyz3S">morphisms</a>, categories, functors, <a href="/facts/Natural_transformation/xwPumTHt">natural transformations</a>, <a href="/facts/Universal_properties/5XJBYMNz">universal properties</a>.</li>
<li><a href="https://www.youtube.com/user/TheCatsters">The catsters</a>, a YouTube channel about category theory.</li>
<li><a href="http://categorieslogicphysics.wikidot.com/events">Video archive</a> of recorded talks relevant to categories, logic and the foundations of physics.</li>
<li><a href="https://web.archive.org/web/20080916162345/http://www.j-paine.org/cgi-bin/webcats/webcats.php">Interactive Web page</a> which generates examples of categorical constructions in the category of finite sets.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Mac Lane, Saunders (1971), Categories for the Working Mathematician, New York: Springer-Verlag, p. 30, ISBN 978-3-540-90035-1 <a href="978-3-540-90035-1" target="_blank">978-3-540-90035-1</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Carnap, Rudolf (1937). The Logical Syntax of Language, Routledge & Kegan, pp. 13–14. <a href="/wiki/Rudolf_Carnap" target="_blank">/wiki/Rudolf_Carnap</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Jacobson (2009), p. 19, def. 1.2. - Jacobson, Nathan (2009), Basic algebra, vol. 2 (2nd ed.), Dover, ISBN 978-0-486-47187-7 <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Simmons (2011), Exercise 3.1.4. - Simmons, Harold (2011), "Functors and natural transformations", An Introduction to Category Theory, pp. 72–107, doi:10.1017/CBO9780511863226.004, ISBN 978-1-107-01087-1 <a href="https://books.google.com/books?id=VOCQUC_uiWgC&pg=PA74" target="_blank">https://books.google.com/books?id=VOCQUC_uiWgC&pg=PA74</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Jacobson (2009), pp. 19–20. - Jacobson, Nathan (2009), Basic algebra, vol. 2 (2nd ed.), Dover, ISBN 978-0-486-47187-7 <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Popescu, Nicolae; Popescu, Liliana (1979). Theory of categories. Dordrecht: Springer. p. 12. ISBN 9789400995505. Retrieved 23 April 2016. <a href="9789400995505" target="_blank">9789400995505</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Mac Lane, Saunders; Moerdijk, Ieke (1992), Sheaves in geometry and logic: a first introduction to topos theory, Springer, ISBN 978-0-387-97710-2 <a href="978-0-387-97710-2" target="_blank">978-0-387-97710-2</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Hazewinkel, Michiel; Gubareni, Nadezhda Mikhaĭlovna; Gubareni, Nadiya; Kirichenko, Vladimir V. (2004), Algebras, rings and modules, Springer, ISBN 978-1-4020-2690-4 <a href="978-1-4020-2690-4" target="_blank">978-1-4020-2690-4</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Jacobson (2009), p. 20, ex. 2. - Jacobson, Nathan (2009), Basic algebra, vol. 2 (2nd ed.), Dover, ISBN 978-0-486-47187-7 <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">It's not entirely clear that Haskell datatypes truly form a category. See https://wiki.haskell.org/Hask for more details. <a href="https://wiki.haskell.org/Hask" target="_blank">https://wiki.haskell.org/Hask</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">See https://wiki.haskell.org/Category_theory/Functor#Functors_in_Haskell for more information. <a href="https://wiki.haskell.org/Category_theory/Functor#Functors_in_Haskell" target="_blank">https://wiki.haskell.org/Category_theory/Functor#Functors_in_Haskell</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
</ol>

Functor open-in-new

Functor