Category theory
Jump to navigation
Jump to search
Category theory
Definition
A category consists of the following data:
- A class of "objects," denoted
- For objects , a set such that is empty if and
together with a "law of composition": Failed to parse (unknown function "\mathscr"): {\displaystyle \circ :\text{Mor}_{\mathscr{C}}(B,C)\times\text{Mor}_{C}(A,B)\to \text{Mor}_{C}(A,C)} (which we denote by ) which is
- Associative: whenever the compositions are defined
- Having identity: for every object there is an element such that for all , and .
Examples
- The category of sets:
- The category of topological spaces:
- The category of functors: if Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathscr{C}} and Failed to parse (unknown function "\mathscr"): {\displaystyle \mathscr{D}} are two
categories, then there is a category consisting of all contravarient functors from Failed to parse (unknown function "\mathscr"): {\displaystyle \mathscr{C}} to Failed to parse (unknown function "\mathscr"): {\displaystyle \mathscr{D}} , where morphisms are natural transformations.
- The category of schemes is one of the principal objects of study