Category Theory
A category is objects, arrows and composition, and the point of the definition is that sets, groups, rings, vector spaces, modules, spaces and posets all satisfy it. This collection develops that language and the theorems that make it worth having. Functors and natural transformations turn constructions and comparisons between them into objects of study. The Yoneda lemma says an object is determined by the arrows into it, which is what allows a universal property to serve as a definition. Limits and colimits specify an object by the arrows to or from a diagram, so products, coproducts, equalisers, pullbacks and their duals become one construction with one uniqueness argument. An adjunction pairs two functors through a natural bijection of hom-sets, equivalently through a unit and a counit satisfying the triangle identities, and left adjoints preserve colimits while right adjoints preserve limits. Reflective subcategories are the case where an inclusion has a left adjoint, the adjoint functor theorems say when an adjoint exists at all, and every adjunction induces a monad and a comonad whose algebras measure how much of it the monad remembers.
Homological algebra is the declared consumer. Its chain complexes, long exact sequences, derived functors, Ext, Tor and spectral sequences are scaffolded to take their additive and abelian categories, their exactness criteria and their diagram lemmas from the continuation of this track, and to quote the Yoneda lemma and the pointwise computation of limits in functor categories. Algebraic geometry reaches the same way, through commutative algebra.
Pathway
The parts run in order. Everything a page needs from this group has been read by the time you reach it, and the level on each row is how many dependency steps into the group that page sits.
Part 1 · Categories, functors and Yoneda
2 pagesA category is objects, arrows and composition, and the point of the definition is that sets, groups, rings, vector spaces, modules, spaces and posets all satisfy it. Functors and natural transformations make constructions and comparisons themselves objects of study, and the Yoneda lemma says an object is determined by the arrows into it, which is what turns a universal property into a definition.
Sets and functions, groups and homomorphisms, unital rings, vector spaces, modules, topological spaces, and posets provide the recurring examples.
24 definitions, 4 lemmas, 21 propositions, 8 theorems, 2 corollaries, 1 remarkExamples & counterexamples →Locally small categories supply set-valued hom-collections, while opposite and product categories control their variance.
7 definitions, 1 lemma, 1 proposition, 9 theorems, 2 corollaries, 1 remarkExamples & counterexamples →
Part 2 · Limits and adjunctions
4 pages · after Part 1Limits and colimits specify an object by all arrows to or from a diagram, so products, equalisers, pullbacks and their duals become instances of one universal construction. Adjunctions express the same economy for functors, and ends, coends and weighted limits extend it to bifunctors and naturality. The added page shows how this universal language becomes additive: preadditive categories identify hom-sets with abelian groups, biproducts force the needed enrichment, matrix calculus organises maps between finite biproducts, and kernels and cokernels recover finite limits and colimits. Additive functors and idempotent completion then supply the standard structural consequences.
- Limits and Colimits46 results
Categories, functors, natural transformations, opposite categories, universal objects, representable functors, and the Yoneda lemma supply the language for specifying an object through all morphisms to or from it.
11 definitions, 5 lemmas, 6 propositions, 17 theorems, 6 corollaries, 1 remarkExamples & counterexamples → - Adjunctions Units and Counits51 results
Categories, functors and natural transformations are published, together with whiskering and horizontal composition, the interchange law, functor categories, comma…
6 definitions, 3 lemmas, 6 propositions, 23 theorems, 4 corollaries, 4 false statements, 5 remarksExamples & counterexamples → - Ends Coends and Weighted Limits50 results
Opposite and product categories, natural transformations, cones, limits, and the Yoneda machinery already provide the ordinary categorical language used here.
8 definitions, 1 lemma, 3 propositions, 23 theorems, 7 corollaries, 6 false statements, 2 remarksExamples & counterexamples → This page develops the thesis that additivity is not extra decoration on a category once finite biproducts exist.
10 definitions, 7 propositions, 24 theorems, 9 corollaries, 3 counterexamples, 5 false statements, 2 remarksExamples & counterexamples →
Part 3 · Reflections, adjoint functors and monads
15 pages · after Part 2Reflective subcategories and adjoint functor theorems produce left adjoints; monads, comonads, and Beck encode that data algebraically. Abelian categories supply kernels, cokernels, exactness, generators, and diagram lemmas, while monoidal, closed, braided, and symmetric structures organize tensor products, coherence, internal homs, and commutativity. Duality and rigidity give tensor adjunctions, dual morphisms, and pivotal, spherical, and ribbon refinements of trace and dimension. Enrichment transfers these constructions to a monoidal base through enriched Yoneda, tensors, cotensors, weighted limits, and adjunctions. Finally, finite rigid -linear abelian multitensor categories have exact tensoring; finite semisimplicity gives multifusion categories, and a simple unit gives fusion categories. Their Grothendieck rings encode fusion rules and duality's anti-involution, distinguishing a fusion unit from a possibly split multifusion unit.
A reflective subcategory is full and has an inclusion with a left adjoint; its dual is coreflective.
8 definitions, 2 lemmas, 1 proposition, 23 theorems, 4 corollaries, 4 false statements, 2 remarksExamples & counterexamples →- Abelian Categories55 results
This page builds the image and coimage of a morphism before it ever says that the two agree.
7 definitions, 3 propositions, 30 theorems, 3 corollaries, 3 counterexamples, 5 false statements, 4 remarksExamples & counterexamples → - Monads Comonads and Their Algebras59 results
An adjunction is controlled by its unit, counit, and triangle identities (Adjunction by unit, counit, and the triangle identities), and composing adjunctions gives the…
15 definitions, 2 lemmas, 28 theorems, 8 corollaries, 4 false statements, 2 remarksExamples & counterexamples → This page uses the published language of functor categories, comma categories, adjunctions, Yoneda, and weighted limits to turn Kan extensions from a universal property into something computable.
7 definitions, 17 theorems, 4 false statements, 1 remarkExamples & counterexamples →- Monadicity and Beck's Theorem44 results
Monads and their Eilenberg–Moore algebras provide the comparison functor attached to a right adjoint, while Monadic and strictly monadic functors distinguishes equivalences…
8 definitions, 12 lemmas, 1 proposition, 15 theorems, 3 corollaries, 1 counterexample, 4 false statementsExamples & counterexamples → This page introduces monoidal categories with the pentagon and triangle as the only axioms, then records the first places where they come from: finite products, endofunctor…
9 definitions, 15 theorems, 2 corollaries, 6 false statements, 6 remarksExamples & counterexamples →This page is where the abelian-category block starts behaving like homological algebra rather than like category-theoretic infrastructure.
14 definitions, 24 theorems, 3 corollaries, 3 counterexamples, 6 false statements, 4 remarksExamples & counterexamples →This page keeps three boundaries explicit. Closedness is extra structure on a monoidal category, not a default consequence of having a tensor product; in a non-symmetric…
7 definitions, 18 theorems, 1 corollary, 1 counterexample, 5 false statements, 1 remarkExamples & counterexamples →- Exactness and the Member Calculus49 results
This page is the arrow-theoretic bridge between abstract abelian-category structure and the diagram chases that follow.
6 definitions, 3 propositions, 25 theorems, 4 counterexamples, 7 false statements, 4 remarksExamples & counterexamples → This page fixes the coherence theorem in its canonical-map form and proves it by the strictification route.
3 definitions, 8 theorems, 1 corollary, 5 false statements, 5 remarksExamples & counterexamples →This page adds the commutativity data that ordinary monoidal categories do not have.
6 definitions, 15 theorems, 3 corollaries, 1 counterexample, 2 false statements, 2 remarksExamples & counterexamples →This page packages the standard diagram lemmas in the order that actually drives later proofs: first the short five lemma, then the snake lemma and its connecting morphism…
2 definitions, 1 lemma, 21 theorems, 2 corollaries, 5 false statements, 4 remarksExamples & counterexamples →This page keeps three distinctions sharp. Left and right duals are different data in a general monoidal category; a categorical trace is first typed on a morphism into a…
9 definitions, 14 theorems, 1 corollary, 2 counterexamples, 6 false statements, 5 remarksExamples & counterexamples →- Enriched Categories43 results
This page develops the Kelly-first enriched-category spine without flattening the hypotheses.
9 definitions, 22 theorems, 3 corollaries, 1 counterexample, 8 remarksExamples & counterexamples → - Tensor and Fusion Categories29 results
The convention is that a tensor category has a scalar simple unit; a multitensor category need not.
9 definitions, 10 theorems, 2 corollaries, 5 false statements, 3 remarksExamples & counterexamples →