Category Theory · aiwiki.page

Category theory is a branch of mathematics that studies structures through the maps between them and the rules governing how those maps compose. Its basic framework—a category—consists of objects, morphisms, and composition satisfying identity and associativity laws. Rather than describing a structure only through its elements, category theory investigates its relationships with other structures. This perspective provides a common language for constructions across algebra, topology, logic, and theoretical computer science. (cl.cam.ac.uk)

Categories and morphisms

A category $\mathcal C$ consists of:

A collection of objects.
For each pair of objects $A,B$ , a collection $\operatorname{Hom}_{\mathcal C}(A,B)$ of morphisms, written $f:A\to B$ .
A composition operation assigning $g\circ f:A\to C$ to $f:A\to B$ and $g:B\to C$ .
An identity morphism $1_A:A\to A$ for every object $A$ .

Composition satisfies

h\circ(g\circ f)=(h\circ g)\circ f, \qquad 1_B\circ f=f=f\circ1_A.

These are the essential axioms; objects need not be sets, and morphisms need not be ordinary functions. (emilyriehl.github.io)

Important examples include:

Category	Objects	Morphisms
$\mathbf{Set}$	Sets	[[mathematical-function
$\mathbf{Grp}$	Groups	[[homomorphism
$\mathbf{Vect}_k$	[[vector-space	Vector spaces]] over a fixed field $k$
$\mathbf{Top}$	[[topological-space	Topological spaces]]

A partially ordered set also defines a category: there is exactly one arrow $a\to b$ when $a\leq b$ , and none otherwise. Reflexivity supplies identities, and transitivity supplies composition. (emilyriehl.github.io)

An isomorphism is a morphism $f:A\to B$ with an inverse $g:B\to A$ , satisfying $g\circ f=1_A$ and $f\circ g=1_B$ . A commutative diagram expresses equality between composites along different paths. Diagrams are therefore statements about morphisms, not merely illustrations. (cl.cam.ac.uk)

Functors and natural transformations

A functor $F:\mathcal C\to\mathcal D$ maps objects to objects and morphisms to morphisms, preserving their sources, targets, identities, and composition:

F(1_A)=1_{F(A)},\qquad F(g\circ f)=F(g)\circ F(f).

For example, the forgetful functor from groups to sets retains underlying sets and functions while discarding group operations. Functors describe systematic constructions between mathematical settings. (cl.cam.ac.uk)

A natural transformation $\eta:F\Rightarrow G$ between functors $\mathcal C\to\mathcal D$ consists of morphisms $\eta_A:F(A)\to G(A)$ , one for every object, satisfying

G(f)\circ\eta_A=\eta_B\circ F(f)

for every $f:A\to B$ . This condition says that the comparison between the constructions is compatible with every morphism in the source category. A natural transformation is a natural isomorphism when all its components are isomorphisms. (people.math.osu.edu)

A classical example is the evaluation map from a vector space to its double dual:

V\longrightarrow V^{**}, \qquad v\longmapsto\bigl(\phi\mapsto\phi(v)\bigr).

It is natural in $V$ and is an isomorphism for finite-dimensional vector spaces. Unlike an identification of $V$ with $V^*$ obtained by choosing a basis, it requires no such choice. (people.math.osu.edu)

Universal properties, limits, and duality

A universal property characterizes an object by how morphisms to or from it factor uniquely. Such characterizations determine objects up to the unique isomorphism compatible with the specified structure. They allow one definition to cover constructions in different categories. (arxiv.org)

For example, a product of $A$ and $B$ is an object $P$ with projections $p_A:P\to A$ and $p_B:P\to B$ , such that every pair $f:X\to A$ , $g:X\to B$ factors through a unique $u:X\to P$ :

p_A\circ u=f,\qquad p_B\circ u=g.

In sets, this is the Cartesian product. (cl.cam.ac.uk)

Products belong to the broader theory of limits, which represent universal cones over diagrams. Their duals, colimits, represent universal cocones. Other examples include equalizers and pullbacks, and their dual constructions, coequalizers and pushouts. (arxiv.org)

The opposite category $\mathcal C^{\mathrm{op}}$ reverses every arrow of $\mathcal C$ . Reversing arrows exchanges categorical notions such as limits and colimits. A contravariant functor from $\mathcal C$ is formally an ordinary functor from $\mathcal C^{\mathrm{op}}$ . This makes duality a precise method for translating definitions and theorems. (emilyriehl.github.io)

Adjunctions, representability, and equivalence

An adjunction between $F:\mathcal C\to\mathcal D$ and $G:\mathcal D\to\mathcal C$ is a family of bijections

\operatorname{Hom}_{\mathcal D}(F(A),B) \cong \operatorname{Hom}_{\mathcal C}(A,G(B)),

natural in both variables. Here $F$ is left adjoint to $G$ . Adjunctions express universal constructions through relationships between functors. (arxiv.org)

A representable functor expresses a construction as morphisms involving a fixed object. The Yoneda lemma makes this viewpoint precise: for a locally small category, a functor $H:\mathcal C^{\mathrm{op}}\to\mathbf{Set}$ , and an object $A$ ,

\operatorname{Nat}\bigl(\operatorname{Hom}_{\mathcal C}(-,A),H\bigr) \cong H(A).

A natural transformation on the left is determined by its value on $1_A$ . Consequently, an object's morphism relationships determine it up to isomorphism. (arxiv.org)

An equivalence of categories consists of functors in opposite directions whose composites are naturally isomorphic to the respective identity functors. Equivalence permits different presentations of the same categorical structure without requiring literal equality of objects or categories. (cl.cam.ac.uk)

History

Samuel Eilenberg and Saunders Mac Lane introduced categories, functors, and natural transformations in their 1945 paper General Theory of Natural Equivalences. Their purpose was to formalize the naturality of constructions and comparisons appearing in algebra and topology. (people.math.osu.edu)

Category theory subsequently expanded through Alexander Grothendieck's work in algebraic geometry and F. William Lawvere's work on logic and mathematical foundations. Categorical methods also became important in the semantics of programming languages. These developments turned a framework for comparing constructions into a subject studying categories themselves and their additional structures. (cl.cam.ac.uk)

Structured and higher categories

Additional structure produces several major branches:

A monoidal category has a tensor operation and a unit object, with coherent associativity and unit isomorphisms. It supports the description of systems composed in parallel as well as processes composed sequentially. Symmetric monoidal categories additionally permit the interchange of factors. (math.ucr.edu)
A topos, in its elementary formulation, is a category with finite limits, exponentials, and a subobject classifier. These structures support an internal logical language. Toposes generalize important features of the category of sets, but their internal logic need not satisfy the law of excluded middle. (arxiv.org)
Higher categories include transformations between morphisms. Bicategories have objects, morphisms, and 2-morphisms, with associativity and unit laws holding through coherent isomorphisms rather than strict equalities. (arxiv.org)
Infinity categories encode higher transformations and coherence data. They extend constructions such as equivalences, adjunctions, limits, and the Yoneda lemma to homotopical settings; several mathematical models support these theories. (arxiv.org)

Applications and foundations

In computer science, categorical semantics relates type theory and programming languages to mathematical structures. Cartesian closed categories model the simply typed lambda calculus, while structured categories and functors provide interpretations of logical theories. Categorical methods distinguish the syntax of a theory from its mathematical models. (andrew.cmu.edu)

In mathematical physics, monoidal categories describe composition of processes and combination of systems. Quantum mechanics supplies examples involving Hilbert spaces and linear operators; topology supplies categories of manifolds and cobordisms. String diagrams make some of the shared compositional structure visible. These are precise correspondences between particular mathematical frameworks, not identifications of the disciplines as a whole. (math.ucr.edu)

Category theory also offers approaches to foundations alongside set theory. Toposes can serve as mathematical universes with their own internal logic. Such approaches require specific axioms: the elementary definition of a category alone does not supply all the structures needed for ordinary mathematics. (arxiv.org)

Size issues and scope

A category is small when its objects and morphisms form sets, and locally small when each individual hom-collection is a set. Categories such as the category of all sets require care about classes or universes. Functor categories and categories of categories can introduce further size requirements; categorical language does not remove foundational paradoxes. (people.math.osu.edu)

Universal constructions are not guaranteed to exist in every category. Likewise, an abstract categorical description captures the structure specified by its objects, morphisms, and additional operations—not automatically every feature of a concrete example. Applying the theory therefore requires establishing the relevant hypotheses and choosing a category that retains the information under investigation. (emilyriehl.github.io)

References

Category Theory — Lecture Notescl.cam.ac.uk
Category Theory in Contextemilyriehl.github.io
General Theory of Natural Equivalencespeople.math.osu.edu
Basic Category Theoryarxiv.org
An informal introduction to topos theoryarxiv.org
Basic Bicategoriesarxiv.org
Infinity category theory from scratcharxiv.org
Categorical Logicandrew.cmu.edu
Physics, Topology, Logic and Computation: A Rosetta Stonemath.ucr.edu