# Category (mathematics)

Group-like structures | |||||
---|---|---|---|---|---|

Totality^{α} |
Associativity | Identity | Invertibility | Commutativity | |

Semigroupoid | Unneeded | Required | Unneeded | Unneeded | Unneeded |

Category | Unneeded | Required | Required | Unneeded | Unneeded |

Groupoid | Unneeded | Required | Required | Required | Unneeded |

Magma | Required | Unneeded | Unneeded | Unneeded | Unneeded |

Quasigroup | Required | Unneeded | Unneeded | Required | Unneeded |

Loop | Required | Unneeded | Required | Required | Unneeded |

Semigroup | Required | Required | Unneeded | Unneeded | Unneeded |

Inverse Semigroup | Required | Required | Unneeded | Required | Unneeded |

Monoid | Required | Required | Required | Unneeded | Unneeded |

Group | Required | Required | Required | Required | Unneeded |

Abelian group | Required | Required | Required | Required | Required |

^α Closure, which is used in many sources, is an equivalent axiom to totality, though defined differently. |

In mathematics, a **category** (sometimes called an **abstract category** to distinguish it from a concrete category) is an algebraic structure similar to a group but without requiring inverse or closure properties. It comprises "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions.

*Category theory* is a branch of mathematics that seeks to generalize all of mathematics in terms of categories, independent of what their objects and arrows represent. Virtually every branch of modern mathematics can be described in terms of categories, and doing so often reveals deep insights and similarities between seemingly different areas of mathematics. As such, category theory provides an alternative foundation for mathematics to set theory and other proposed axiomatic foundations. In general, the objects and arrows may be abstract entities of any kind, and the notion of category provides a fundamental and abstract way to describe mathematical entities and their relationships.

In addition to formalizing mathematics, category theory is also used to formalize many other systems in computer science, such as the semantics of programming languages.

Two categories are the same if they have the same collection of objects, the same collection of arrows, and the same associative method of composing any pair of arrows. Two *different* categories may also be considered "equivalent" for purposes of category theory, even if they do not have precisely the same structure.

Well-known categories are denoted by a short capitalized word or abbreviation in bold or italics: examples include **Set**, the category of sets and set functions; **Ring**, the category of rings and ring homomorphisms; and **Top**, the category of topological spaces and continuous maps. All of the preceding categories have the identity map as identity arrow and composition as the associative operation on arrows.

The classic and still much used text on category theory is *Categories for the Working Mathematician* by Saunders Mac Lane. Other references are given in the References below. The basic definitions in this article are contained within the first few chapters of any of these books.

Any monoid can be understood as a special sort of category (with a single object whose self-morphisms are represented by the elements of the monoid), and so can any preorder.

## History

Category theory first appeared in a paper entitled "General Theory of Natural Equivalences", written by Samuel Eilenberg and Saunders Mac Lane in 1945.^{[1]}

## Definition

There are many equivalent definitions of a category.^{[2]} One commonly used definition is as follows. A **category** *C* consists of

- a class ob(
*C*) of**objects** - a class hom(
*C*) of**morphisms**, or**arrows**, or**maps**, between the objects. Each morphism*f*has a*source object a*and a*target object b*where*a*and*b*are in ob(*C*). We write*f*:*a*→*b*, and we say "*f*is a morphism from*a*to*b*". We write hom(*a*,*b*) (or hom_{C}(*a*,*b*) when there may be confusion about to which category hom(*a*,*b*) refers) to denote the**hom-class**of all morphisms from*a*to*b*. (Some authors write Mor(*a*,*b*) or simply*C*(*a*,*b*) instead.) - for every three objects
*a*,*b*and*c*, a binary operation hom(*a*,*b*) × hom(*b*,*c*) → hom(*a*,*c*) called*composition of morphisms*; the composition of*f*:*a*→*b*and*g*:*b*→*c*is written as*g*∘*f*or*gf*. (Some authors use "diagrammatic order", writing*f;g*or*fg*.)

such that the following axioms hold:

- (associativity) if
*f*:*a*→*b*,*g*:*b*→*c*and*h*:*c*→*d*then*h*∘ (*g*∘*f*) = (*h*∘*g*) ∘*f*, and - (identity) for every object
*x*, there exists a morphism 1_{x}:*x*→*x*(some authors write*id*_{x}) called the*identity morphism for x*, such that for every morphism*f*:*a*→*x*and every morphism*g*:*x*→*b*, we have 1_{x}∘*f*=*f*and*g*∘ 1_{x}=*g*.

From these axioms, one can prove that there is exactly one identity morphism for every object. Some authors use a slight variation of the definition in which each object is identified with the corresponding identity morphism.

## Small and large categories

A category *C* is called **small** if both ob(*C*) and hom(*C*) are actually sets and not proper classes, and **large** otherwise. A **locally small category** is a category such that for all objects *a* and *b*, the hom-class hom(*a*, *b*) is a set, called a **homset**. Many important categories in mathematics (such as the category of sets), although not small, are at least locally small.

## Examples

The class of all sets (as objects) together with all functions between them (as morphisms), where the composition of morphisms is the usual function composition, forms a large category, **Set**. It is the most basic and the most commonly used category in mathematics. The category **Rel** consists of all sets (as objects) with binary relations between them (as morphisms). Abstracting from relations instead of functions yields allegories, a special class of categories.

Any class can be viewed as a category whose only morphisms are the identity morphisms. Such categories are called discrete. For any given set *I*, the *discrete category on I* is the small category that has the elements of *I* as objects and only the identity morphisms as morphisms. Discrete categories are the simplest kind of category.

Any preordered set (*P*, ≤) forms a small category, where the objects are the members of *P*, the morphisms are arrows pointing from *x* to *y* when *x* ≤ *y*. Furthermore, if *≤* is antisymmetric, there can be at most one morphism between any two objects. The existence of identity morphisms and the composability of the morphisms are guaranteed by the reflexivity and the transitivity of the preorder. By the same argument, any partially ordered set and any equivalence relation can be seen as a small category. Any ordinal number can be seen as a category when viewed as an ordered set.

Any monoid (any algebraic structure with a single associative binary operation and an identity element) forms a small category with a single object *x*. (Here, *x* is any fixed set.) The morphisms from *x* to *x* are precisely the elements of the monoid, the identity morphism of *x* is the identity of the monoid, and the categorical composition of morphisms is given by the monoid operation. Several definitions and theorems about monoids may be generalized for categories.

Similarly any group can be seen as a category with a single object in which every morphism is *invertible*, that is, for every morphism *f* there is a morphism *g* that is both left and right inverse to *f* under composition. A morphism that is invertible in this sense is called an isomorphism.

A groupoid is a category in which every morphism is an isomorphism. Groupoids are generalizations of groups, group actions and equivalence relations.

Any directed graph generates a small category: the objects are the vertices of the graph, and the morphisms are the paths in the graph (augmented with loops as needed) where composition of morphisms is concatenation of paths. Such a category is called the *free category* generated by the graph.

The class of all preordered sets with monotonic functions as morphisms forms a category, **Ord**. It is a concrete category, i.e. a category obtained by adding some type of structure onto **Set**, and requiring that morphisms are functions that respect this added structure.

The class of all groups with group homomorphisms as morphisms and function composition as the composition operation forms a large category, **Grp**. Like **Ord**, **Grp** is a concrete category. The category **Ab**, consisting of all abelian groups and their group homomorphisms, is a full subcategory of **Grp**, and the prototype of an abelian category. Other examples of concrete categories are given by the following table.

Category | Objects | Morphisms |
---|---|---|

Mag |
magmas | magma homomorphisms |

Man^{p} |
smooth manifolds | p-times continuously differentiable maps |

Met |
metric spaces | short maps |

R-Mod |
R-modules, where R is a ring | R-module homomorphisms |

Ring |
rings | ring homomorphisms |

Set |
sets | functions |

Grp |
groups | group homomorphisms |

Top |
topological spaces | continuous functions |

Uni |
uniform spaces | uniformly continuous functions |

Vect_{K} |
vector spaces over the field K |
K-linear maps |

Fiber bundles with bundle maps between them form a concrete category.

The category **Cat** consists of all small categories, with functors between them as morphisms.

## Construction of new categories

### Dual category

Any category *C* can itself be considered as a new category in a different way: the objects are the same as those in the original category but the arrows are those of the original category reversed. This is called the *dual* or *opposite category* and is denoted *C*^{op}.

### Product categories

If *C* and *D* are categories, one can form the *product category* *C* × *D*: the objects are pairs consisting of one object from *C* and one from *D*, and the morphisms are also pairs, consisting of one morphism in *C* and one in *D*. Such pairs can be composed componentwise.

## Types of morphisms

A morphism *f* : *a* → *b* is called

- a
*monomorphism*(or*monic*) if it is left-cancellable, i.e.*fg*=_{1}*fg*implies_{2}*g*=_{1}*g*for all morphisms_{2}*g*_{1},*g*:_{2}*x*→*a*. - an
*epimorphism*(or*epic*) if it is right-cancellable, i.e.*g*=_{1}f*g*implies_{2}f*g*=_{1}*g*for all morphisms_{2}*g*,_{1}*g*:_{2}*b*→*x*. - a
*bimorphism*if it is both a monomorphism and an epimorphism. - a
*retraction*if it has a right inverse, i.e. if there exists a morphism*g*:*b*→*a*with*fg*= 1_{b}. - a
*section*if it has a left inverse, i.e. if there exists a morphism*g*:*b*→*a*with*gf*= 1_{a}. - an
*isomorphism*if it has an inverse, i.e. if there exists a morphism*g*:*b*→*a*with*fg*= 1_{b}and*gf*= 1_{a}. - an
*endomorphism*if*a*=*b*. The class of endomorphisms of*a*is denoted end(*a*). - an
*automorphism*if*f*is both an endomorphism and an isomorphism. The class of automorphisms of*a*is denoted aut(*a*).

Every retraction is an epimorphism. Every section is a monomorphism. The following three statements are equivalent:

*f*is a monomorphism and a retraction;*f*is an epimorphism and a section;*f*is an isomorphism.

Relations among morphisms (such as *fg* = *h*) can most conveniently be represented with commutative diagrams, where the objects are represented as points and the morphisms as arrows.

## Types of categories

- In many categories, e.g.
**Ab**or**Vect**_{K}, the hom-sets hom(*a*,*b*) are not just sets but actually abelian groups, and the composition of morphisms is compatible with these group structures; i.e. is bilinear. Such a category is called preadditive. If, furthermore, the category has all finite products and coproducts, it is called an additive category. If all morphisms have a kernel and a cokernel, and all epimorphisms are cokernels and all monomorphisms are kernels, then we speak of an abelian category. A typical example of an abelian category is the category of abelian groups. - A category is called complete if all small limits exist in it. The categories of sets, abelian groups and topological spaces are complete.
- A category is called cartesian closed if it has finite direct products and a morphism defined on a finite product can always be represented by a morphism defined on just one of the factors. Examples include
**Set**and**CPO**, the category of complete partial orders with Scott-continuous functions. - A topos is a certain type of cartesian closed category in which all of mathematics can be formulated (just like classically all of mathematics is formulated in the category of sets). A topos can also be used to represent a logical theory.

## See also

## Notes

- ↑ S. Eilenberg and S. Mac Lane "General Theory of Natural Equivalences", Transactions of The American Mathematical Society 01/1945; 58(2):231-231. doi:10.2307/1990284
- ↑ Barr & Wells, Chapter 1.

## References

- Adámek, Jiří; Herrlich, Horst; Strecker, George E. (1990),
*Abstract and Concrete Categories*(PDF), John Wiley & Sons, ISBN 0-471-60922-6 (now free on-line edition, GNU FDL). - Asperti, Andrea; Longo, Giuseppe (1991),
*Categories, Types and Structures*(PDF), MIT Press, ISBN 0-262-01125-5 . - Awodey, Steve (2006),
*Category theory*, Oxford logic guides,**49**, Oxford University Press, ISBN 978-0-19-856861-2 . - Barr, Michael; Wells, Charles (2005),
*Toposes, Triples and Theories*, Reprints in Theory and Applications of Categories,**12**(revised ed.), MR 2178101 . - Borceux, Francis (1994), "Handbook of Categorical Algebra",
*Encyclopedia of Mathematics and its Applications*, 50–52, Cambridge: Cambridge University Press, ISBN 0-521-06119-9 . - Hazewinkel, Michiel, ed. (2001) [1994], "Category",
*Encyclopedia of Mathematics*, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4 - Herrlich, Horst; Strecker, George E. (2007),
*Category Theory*, Heldermann Verlag . - Jacobson, Nathan (2009),
*Basic algebra*(2nd ed.), Dover, ISBN 978-0-486-47187-7 . - Lawvere, William; Schanuel, Steve (1997),
*Conceptual Mathematics: A First Introduction to Categories*, Cambridge: Cambridge University Press, ISBN 0-521-47249-0 . - Mac Lane, Saunders (1998),
*Categories for the Working Mathematician*, Graduate Texts in Mathematics 5 (2nd ed.), Springer-Verlag, ISBN 0-387-98403-8 . - Marquis, Jean-Pierre (2006), "Category Theory", in Zalta, Edward N.,
*Stanford Encyclopedia of Philosophy*. - Sica, Giandomenico (2006),
*What is category theory?*, Advanced studies in mathematics and logic,**3**, Polimetrica, ISBN 978-88-7699-031-1 . - category in
*nLab*