Category theory

From Citizendium
Revision as of 07:57, 1 January 2008 by imported>Giovanni Antonio DiMatteo (→‎Definition)
Jump to navigation Jump to search

Category theory

Definition

A category consists of the following data:

  1. A class of "objects," denoted
  2. 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

    1. Associative: whenever the compositions are defined
    2. Having identity: for every object there is an element such that for all , and .

Examples

  1. The category of sets:
  2. The category of topological spaces:
  3. The category of functors: if Failed to parse (unknown function "\mathscr"): {\displaystyle \mathscr{C}} and 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{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.

  1. The category of schemes is one of the principal objects of study