Category: Difference between revisions
(New page: ==Definition== A '''category''' <math>\mathcal{C}</math> is the following data: * A collection <math>\operatorname{Ob}\mathcal{C}</math> of '''objects'''. * For any objects <math>A,B \in...) |
No edit summary |
||
Line 3: | Line 3: | ||
A '''category''' <math>\mathcal{C}</math> is the following data: | A '''category''' <math>\mathcal{C}</math> is the following data: | ||
* A collection <math>\operatorname{Ob}\mathcal{C}</math> of '''objects'''. | * A [[defining ingredient::collection]] <math>\operatorname{Ob}\mathcal{C}</math> of '''objects'''. | ||
* For any objects <math>A,B \in \operatorname{Ob}\mathcal{C}</math>, a collection <math>\mathcal{C}(A,B)</math> of '''morphisms'''. Every element in <math>\mathcal{C}(A,B)</math> is termed a ''morphism'' from <math>A</math> (i.e., with source or domain <math>A</math>) to <math>B</math> (i.e., with target or co-domain <math>B</math>). The morphism sets for different pairs of objects are disjoint. | * For any objects <math>A,B \in \operatorname{Ob}\mathcal{C}</math>, a collection <math>\mathcal{C}(A,B)</math> of '''morphisms'''. Every element in <math>\mathcal{C}(A,B)</math> is termed a ''morphism'' from <math>A</math> (i.e., with source or domain <math>A</math>) to <math>B</math> (i.e., with target or co-domain <math>B</math>). The morphism sets for different pairs of objects are disjoint. | ||
* For every object <math>A \in \operatorname{Ob}\mathcal{C}</math>, a distinguished morphism <math>\operatorname{id}_A \in \mathcal{C}(A,A)</math>. | * For every object <math>A \in \operatorname{Ob}\mathcal{C}</math>, a distinguished morphism <math>\operatorname{id}_A \in \mathcal{C}(A,A)</math>. | ||
Line 12: | Line 12: | ||
* For <math>A,B,C,D \in \operatorname{Ob}\mathcal{C}</math>, with <math>f \in \mathcal{C}(A,B), g \in \mathcal{C}(B,C), h \in \mathcal{C}(C,D)</math>, we have <math>h \circ (g \circ f) = (h \circ g) \circ f</math>. | * For <math>A,B,C,D \in \operatorname{Ob}\mathcal{C}</math>, with <math>f \in \mathcal{C}(A,B), g \in \mathcal{C}(B,C), h \in \mathcal{C}(C,D)</math>, we have <math>h \circ (g \circ f) = (h \circ g) \circ f</math>. | ||
* For <math>A,B \in \operatorname{Ob}\mathcal{C}</math>, with <math>f \in \mathcal{C}(A,B)</math>, we have <math>f \circ \operatorname{id}_A = \operatorname{id}_B \circ f = f</math>. | * For <math>A,B \in \operatorname{Ob}\mathcal{C}</math>, with <math>f \in \mathcal{C}(A,B)</math>, we have <math>f \circ \operatorname{id}_A = \operatorname{id}_B \circ f = f</math>. | ||
The collections of objects and morphisms need not be sets. If the collection of objects is a set, ''and'' the collection of morphisms between any two objects is a set, the category is termed a [[small category]]. If the collection of morphisms between any two objects is a set, the category is termed a [[locally small category]]. |
Revision as of 00:06, 9 December 2008
Definition
A category is the following data:
- A collection of objects.
- For any objects , a collection of morphisms. Every element in is termed a morphism from (i.e., with source or domain ) to (i.e., with target or co-domain ). The morphism sets for different pairs of objects are disjoint.
- For every object , a distinguished morphism .
- For , a map, called composition of morphisms, from to . This map is denoted by .
satisfying the following compatibility conditions:
- For , with , we have .
- For , with , we have .
The collections of objects and morphisms need not be sets. If the collection of objects is a set, and the collection of morphisms between any two objects is a set, the category is termed a small category. If the collection of morphisms between any two objects is a set, the category is termed a locally small category.