home > mathematics > category theory

Category theory is not abstract nonsense

by Anil Kulkarni13 min readMATHEMATICS

"General abstract nonsense" was coined by the people closest to the subject, and they said it with a grin. Category theory is what happens when you stop asking what mathematical objects are made of and ask only how they relate — and it turns out that is enough.

The phrase is usually credited to Norman Steenrod, one of the founders of algebraic topology, and it was a compliment: "nonsense" meant the parts of an argument that were formal, inevitable, and blessedly free of hard computation.1 The machinery itself arrived in 1945, when @Eilenberg and @MacLane needed to make the word "natural" — as in "this isomorphism is natural" — into actual mathematics. Defining natural transformations required functors; defining functors required categories. The foundation was invented last, to hold up a ceiling that already existed.

The real content of the subject is a habit of definition. Ordinary mathematics defines objects by construction: a product is a set of ordered pairs, a quotient is a set of equivalence classes. The categorical habit is to define objects by #universal-property — by the role they play with respect to every other object at once — and to treat any construction as mere evidence that something fills the role.

Take the product. The categorical definition of A × B never looks inside it: A × B is whatever object comes equipped with two maps π₁ and π₂ back to A and B, such that any object X with its own pair of maps f to A and g to B admits exactly one map u into A × B consistent with everything in sight. That is the entire definition. It mentions no elements, no pairs, no coordinates — only arrows and one crucial word, unique.

Commutative diagram for the universal property of the product, with the unique mediating arrow drawn dashed X A × B A B f g ∃! u π₁ π₂ both triangles commute — and u is the only arrow that makes them
FIG 1 The product, defined by relationships. Whatever X you bring and whatever maps f, g it carries, exactly one arrow u routes them through A × B. The dashed arrow — existence plus uniqueness — is the whole definition; ordered pairs are one implementation among many.

The dashed arrow is the payoff. Because the definition mentions only arrows, it makes sense in any category, and it silently picks out the right object every time: cartesian products of sets, direct products of groups, product topologies on spaces — and, in the category whose objects are propositions and whose arrows are implications, the logical "and".2 One definition, correctly instantiated across every field, with a bonus rigidly attached: any two objects satisfying it are isomorphic in exactly one compatible way. Constructions vary; the role does not.

Yoneda, honestly

The theorem that licenses all of this is the #yoneda-lemma, and it can be said in one honest paragraph. Fix an object A, and record, for every object X, the set of arrows from X to A — the totality of A's relationships, together with how those relationships transform when X varies. The lemma says this record determines A up to isomorphism, and that every consistent way of probing objects by arrows is itself given by an object. Nothing about A is lost by discarding its internals and keeping its interactions. Definition by relationship is not a stylistic preference; it is mathematically complete.

That is why "abstract nonsense" settled into affection rather than insult. Grothendieck rebuilt algebraic geometry on exactly this #naturality-first foundation, and the same diagrams now type-check programs and organise databases.3 The nonsense is the load-bearing part: what survives when every specific detail is stripped away is precisely the content that transports between fields intact.

Notes

  1. The attribution wobbles between Steenrod and others, but the self-deprecating usage was universal among the first generation. Mac Lane reports the term without a trace of defensiveness in his own textbook [2] — the practitioners adopted it faster than the critics did.
  2. A partially ordered set is a category with at most one arrow between any two objects. There, the universal property of the product reduces to "greatest lower bound"; for propositions ordered by implication, the greatest lower bound of P and Q is P ∧ Q.
  3. The monad — category theory's packaging of "computation carrying context" — is a core abstraction of working programming languages, Haskell most famously. Programmers rediscovered the pattern before most of them knew its name.

References

  1. Eilenberg, S., Mac Lane, S. (1945). "General theory of natural equivalences." Transactions of the American Mathematical Society 58, 231–294.
  2. Mac Lane, S. (1998). Categories for the Working Mathematician, 2nd ed. Springer.
  3. Riehl, E. (2016). Category Theory in Context. Dover Publications.