Category theory; homological algebra Definition
Category
Definition
A category consists of the following data:
- a class , whose members are called the objects of ;
- for each pair of objects , a class of morphisms from to , written , with these classes pairwise disjoint;
- for each triple of objects , a composition map , written ;
- for each object , an identity morphism .
These data must satisfy two axioms:
- associativity: for all , and ;
- identity: for all .
Remarks
The category is locally small when every is a set, and small when moreover is a set. Example: has sets as objects and functions as morphisms, with the usual composition and the identity functions. Composition of functions is associative and the identity functions are neutral, so both axioms hold. Non-example: take sets as objects and, as morphisms , the functions whose image has at most one point. A composite of two such functions again has at most one point in its image, so composition is defined. The identity function of a set with two elements is not such a morphism, so clause 4 fails. Many authors write or for , and for .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
Further reading
About this page
| Tag | MCEE53VGBQ |
|---|---|
| URI | m2://MCEE53VGBQ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 18A05, 18A15 |
| Defines | Category |
| Uses | Set, Function |
Markdown ยท JSON ยท Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.