Category theory

Category theory is a branch of mathematics that studies abstract structures and the relationships between them. It provides a unifying framework in which diverse mathematical concepts are expressed in terms of objects and the morphisms (or arrows) that connect them, with composition and identity as the fundamental notions. Originating in the mid‑20th century as a language for algebraic topology and homological algebra, category theory has since become a foundational tool across mathematics, computer science, and parts of theoretical physics. By focusing on morphisms and their compositional behavior, it reveals deep structural analogies and allows the transfer of ideas between otherwise unrelated fields.

Definition

A category \(\mathcal{C}\) consists of:

• a class of objects \(\mathrm{Ob}(\mathcal{C})\);
• a class of morphisms (or arrows) \(\mathrm{Hom}(\mathcal{C})\);
• for each morphism \(f\) an object \(\mathrm{dom}(f)\) (the domain) and an object \(\mathrm{cod}(f)\) (the codomain), written \(f : A \to B\);
• for any two morphisms \(f : A \to B\) and \(g : B \to C\) a composite morphism \(g \circ f : A \to C\);
• for every object \(A\) an identity morphism \(\mathrm{id}_A : A \to A\).

These data must satisfy two axioms:

• Associativity: \((h \circ g) \circ f = h \circ (g \circ f)\) for all composable morphisms.
• Identity: \(f \circ \mathrm{id}_A = f\) and \(\mathrm{id}_B \circ f = f\) for every \(f : A \to B\).

A morphism \(f : A \to B\) is an isomorphism if there exists a morphism \(g : B \to A\) such that \(g \circ f = \mathrm{id}_A\) and \(f \circ g = \mathrm{id}_B\). Isomorphic objects are considered indistinguishable in categorical terms.

Basic Examples

Many familiar mathematical structures form categories:

• Set: objects are sets, morphisms are functions.
• Grp: groups and group homomorphisms.
• Top: topological spaces and continuous maps.
• Vect\(_k\): vector spaces over a field \(k\) and linear transformations.
• Pos: partially ordered sets and monotone functions.
• Monoid as a category: a monoid can be seen as a category with a single object; morphisms are the monoid elements, composition is the monoid multiplication.
• Preorder as a category: a preordered set \((P, \leq)\) yields a category whose objects are elements of \(P\) and there is a unique morphism \(a \to b\) precisely when \(a \leq b\).

The opposite category \(\mathcal{C}^{\mathrm{op}}\) of any category \(\mathcal{C}\) is obtained by reversing all morphisms; this formalizes duality principles that run throughout the subject.

Functors

A functor is a structure‑preserving map between categories. Given categories \(\mathcal{C}\) and \(\mathcal{D}\), a functor \(F : \mathcal{C} \to \mathcal{D}\) assigns:

• to each object \(A\) of \(\mathcal{C}\) an object \(F(A)\) in \(\mathcal{D}\);
• to each morphism \(f : A \to B\) a morphism \(F(f) : F(A) \to F(B)\),

subject to \(F(\mathrm{id}_A) = \mathrm{id}_{F(A)}\) and \(F(g \circ f) = F(g) \circ F(f)\).

Small categories and functors themselves form a category, denoted Cat. Important types of functors include forgetful functors (e.g., from Grp to Set, forgetting the group structure) and free functors, which are often left adjoints to forgetful functors. A functor \(F : \mathcal{C} \to \mathbf{Set}\) is representable if it is naturally isomorphic to \(\mathrm{Hom}_{\mathcal{C}}(A, -)\) for some object \(A\); such functors give a systematic way of translating categorical structure into set‑theoretic terms.

Natural Transformations

A natural transformation compares two functors. Given parallel functors \(F, G : \mathcal{C} \to \mathcal{D}\), a natural transformation \(\eta : F \Rightarrow G\) consists of a family of morphisms \(\eta_A : F(A) \to G(A)\) (one for each object \(A\) of \(\mathcal{C}\)) such that for every morphism \(f : A \to B\) in \(\mathcal{C}\) the following square commutes in \(\mathcal{D}\):
\[
\begin{array}{ccc}
F(A) & \xrightarrow{\eta_A} & G(A) \\
F(f) \downarrow & & \downarrow G(f) \\
F(B) & \xrightarrow{\eta_B} & G(B)
\end{array}
\]
If every \(\eta_A\) is an isomorphism, \(\eta\) is a natural isomorphism. Natural transformations are central to the subject; indeed, the original purpose of defining categories was to give a rigorous setting for natural equivalence of functors.

Universal Properties and Limits

Many constructions in mathematics are characterized by universal properties expressed through commutative diagrams. In category theory, these are captured by limits and colimits. For a given diagram (a pattern of objects and morphisms), a limit is a universal cone, while a colimit is a universal co‑cone. Concrete examples include:

• Products: a product \(A \times B\) with projections \(\pi_1, \pi_2\) such that any pair of maps \(C \to A, C \to B\) factors uniquely through \(A \times B\). Its dual is the coproduct.
• Terminal and initial objects: an object \(1\) is terminal if for every \(A\) there is a unique morphism \(A \to 1\); an initial object \(0\) has a unique morphism \(0 \to A\).
• Equalizers and coequalizers: capturing subobjects and quotients.
• Pullbacks and pushouts: fibred products and amalgamated sums, fundamental in topology, geometry and algebra.

A category that has all small limits is called complete; dually, if it has all small colimits it is cocomplete. Categories such as Set, Grp, and Top are both complete and cocomplete.

Adjoint Functors

An adjunction between functors \(F : \mathcal{C} \to \mathcal{D}\) and \(G : \mathcal{D} \to \mathcal{C}\), denoted \(F \dashv G\), is given by a natural isomorphism of Hom‑sets:
\[
\mathrm{Hom}_{\mathcal{D}}(F(C), D) \cong \mathrm{Hom}_{\mathcal{C}}(C, G(D))
\]
natural in \(C\) and \(D\). \(F\) is the left adjoint and \(G\) the right adjoint.

Adjoint functors permeate mathematics:

• The free group functor \(\mathbf{Set} \to \mathbf{Grp}\) is left adjoint to the forgetful functor.
• In a Cartesian closed category, \((-) \times B\) is left adjoint to the exponential functor \((-)^B\).
• The suspension functor in topology is left adjoint to the loop space functor.
• Quantifiers in logic can be modeled as adjoints to substitution functors.

Adjunctions unify free constructions, Galois connections, and the notion of optimal solutions to certain problems.

Equivalence of Categories

While isomorphisms of categories are rarely the correct notion of sameness, categories are considered essentially the same if they are equivalent. An equivalence between \(\mathcal{C}\) and \(\mathcal{D}\) consists of functors \(F : \mathcal{C} \to \mathcal{D}\) and \(G : \mathcal{D} \to \mathcal{C}\) together with natural isomorphisms \(1_{\mathcal{C}} \cong GF\) and \(FG \cong 1_{\mathcal{D}}\). For instance, the category of finite‑dimensional vector spaces is equivalent to its opposite via the dual space functor. A skeleton of a category, obtained by retaining one object from each isomorphism class, gives an equivalent, often simpler, category.

Higher Categories and Enrichment

Category theory has been extended in several directions:

• 2‑categories and bicategories: allow morphisms between morphisms (2‑cells), with Cat (natural transformations as 2‑cells) being the prototypical example.
• n‑categories and ∞‑categories: generalizations with morphisms at all levels, crucial in homotopy theory. Models include strict n‑categories, weak n‑categories, and quasi‑categories (as developed by Joyal and Lurie).
• Enriched categories: replace Hom‑sets by objects of a monoidal category, leading to metric spaces as enriched categories over real numbers, or categories with internal hom.
• Monoidal categories: categories equipped with a tensor product that is associative up to natural isomorphism, used extensively in knot theory, quantum algebra and linear logic.

Applications

Beyond pure mathematics, category theory has become a versatile tool:

• Mathematics: It supplies the language of abelian categories for homological algebra, the functor‑of‑points approach in algebraic geometry, and a framework for Tannakian duality.
• Computer science: Cartesian closed categories model the simply‑typed lambda calculus (the Curry–Howard–Lambek correspondence). Monads, a categorical concept, structure computational effects in functional programming (notably in Haskell). Categorical logic informs type theory and domain theory.
• Logic and foundations: Topos theory, introduced by Grothendieck and refined by Lawvere and Tierney, is a categorical generalization of set theory that can accommodate intuitionistic logic and serves as an alternative foundation for mathematics.
• Physics: Category theory appears in topological quantum field theory (cobordism categories), categorical quantum mechanics (e.g., the category of Hilbert spaces with completely positive maps), and string theory.

History

Category theory was born in the 1940s through the work of Samuel Eilenberg and Saunders Mac Lane. Their 1945 paper "General Theory of Natural Equivalences" defined categories, functors, and natural transformations in order to clarify natural isomorphisms arising in algebraic topology and homology. In the 1950s and 1960s, Alexander Grothendieck reshaped algebraic geometry using abelian categories and later introduced toposes, while Daniel Kan developed the notion of adjoint functors. F. William Lawvere pioneered the use of categories in the foundations of mathematics and categorical logic in the 1960s, leading to the modern view of toposes as universes of sets. Mac Lane’s classic text "Categories for the Working Mathematician" (1971) consolidated the subject. The late 20th and early 21st centuries saw an explosion of higher category theory, with works by Quillen (model categories), Joyal (quasi‑categories), and Lurie (higher topos theory) profoundly influencing homotopy theory and beyond.

See also

• Abstract nonsense
• Categorical logic
• Grothendieck topology
• Model category
• Simplicial set
• Monoidal category
• Topos
• Enriched category
• Applied category theory