- a collection ob of objects
- for each , a collection of what we call morphisms / arrows from to
- for each , a function which we call composition
- for each , an element of , called the identity on , satisfying the following axioms:
- associativity: for each and , we have ;
- identity laws: for each , we have .
- The domain of , denoted , is
- The codomain of , denoted , is
- denotes two morphisms with the same domain and codomain
- denotes two morphisms, and
- For each , a morphism
The definition already gives us the mathematical objects of a category. We only need to show composition satisfies associativity and identity law.
We first show associativity. Let be morphisms in . Correspondingly, we have morphisms in . We then have the following reasoning (composition subscript omitted):
Lastly we show the existence of identity morphism along with their desired property. Let , we choose the identity morphism of this object to be respectively.
Let be a morphism in . We can show the following:
Thus all desired properties are shown, we conclude is a category.
- a function , written as
- - for each , a function written as , satisfying the following axioms:
- whenever in ;
- whenever .
For each we map it to which is the object functor. We call this function
Now we will construct our morphism functor, that is given we map it to a function , defined by we call this mapping , that is: where
We now show that , to do this, we must prove that it is a group homomorphism, and also that it is well defined. For the well definedness we note that if then we have that . For ease of notation recall that , and we prove that our function is a group homomorphism, that is we show that but on the left we have which is the right, so we are done.
We now verify the functor properties: F _ { \left( X, x _ 0 \right), \left( X, x _ 0 \right) } \left( \operatorname{ id } _ { \left( X, x _ 0 \right) } \right) = \operatorname{ id } _ { \pi _ 1 ^ { \operatorname{ ob } } \left( X, x_0 \right) } = \operatorname{ id } _ { \pi _ 1 } \left( X, x_0 \right) } ParseError: Expected 'EOF', got '}' at position 274: …, x_0 \right) }̲ We have that where , in other words takes an element from and returns that same element, so that as needed.
We now verify that If we focus on the right hand side and give the two functions simpler names ; and respectively, and thus on the right hand side we have: so our original equation holds true.
Thus since we've verified all the conditions, we conclude that is a functor.