# Category theory/Functor

### From HaskellWiki

Line 15: | Line 15: | ||

*Every monotone function is a functor, when the underlying partial orders are viewed as categories |
*Every monotone function is a functor, when the underlying partial orders are viewed as categories |
||

*Every monoid homomorphism is a functor, when the underlying monoids are viewed as categories |
*Every monoid homomorphism is a functor, when the underlying monoids are viewed as categories |
||

+ | |||

+ | === Functor operations === |
||

+ | |||

+ | *For all categories <math>\mathcal{C}</math>, there is an '''identity functor''' <math>Id_{\mathcal{C}}</math> (again, the subscript is usually ommitted) given by the rule <math>F(a)=a</math> for all objects and arrows <math>a</math>. |
||

+ | *If <math>F:\mathcal{B}\to\mathcal{C}</math> and <math>G:\mathcal{A}\to\mathcal{B}</math>, then <math>F\circ G:\mathcal{A}\to\mathcal{C}</math>, with composition defined component-wise. |
||

+ | |||

+ | These operations will be important in the definition of a monad. |
||

+ | |||

+ | === The category Cat === |
||

+ | |||

+ | The existence of identity and composition functors implies that, for any well-defined collection of categories <math>E</math>, there exists a category <math>\mathrm{Cat}_E</math> whose arrows are all functors between categories in <math>E</math>. Since no category can include itself as an object, there can be no category of all categories, but it is command and useful to designate a category '''small''' when the collection of objects is a set, and define Cat to be the category whose objects are all small categories and whose arrows are all functors on small categories. |
||

=== Functors in Haskell === |
=== Functors in Haskell === |

## Revision as of 15:27, 3 July 2007

## Contents |

## 1 Definition of a Functor

Given that and are categories, a *functor* is a pair of mappings (the subscripts are generally omitted in practice).

### 1.1 Axioms

- If in , then in
- If in and in , then
- For all objects
*A*in ,*i**d*_{F(A)}=*F*(*i**d*_{A})

### 1.2 Examples of functors

- , the functor giving the free monoid over a set
- , the functor giving the free group over a set
- Every monotone function is a functor, when the underlying partial orders are viewed as categories
- Every monoid homomorphism is a functor, when the underlying monoids are viewed as categories

### 1.3 Functor operations

- For all categories , there is an
**identity functor**(again, the subscript is usually ommitted) given by the rule*F*(*a*) =*a*for all objects and arrows*a*. - If and , then , with composition defined component-wise.

These operations will be important in the definition of a monad.

### 1.4 The category Cat

The existence of identity and composition functors implies that, for any well-defined collection of categories *E*, there exists a category Cat_{E} whose arrows are all functors between categories in *E*. Since no category can include itself as an object, there can be no category of all categories, but it is command and useful to designate a category **small** when the collection of objects is a set, and define Cat to be the category whose objects are all small categories and whose arrows are all functors on small categories.

### 1.5 Functors in Haskell

Properly speaking, a functor in the category Haskell is a pair of a set-theoretic function on Haskell types and a set-theoretic function on Haskell functions satisfying the axioms. However, Haskell being a functional language, Haskellers are only interested in functors where both the object and arrow mappings can be defined and named in Haskell; this effectively restricts them to functors where the object map is a Haskell data constructor and the arrow map is a polymorphic function, the same constraints imposed by the class Functor:

class Functor f where fmap :: (a -> b) -> (f a -> f b)