Mathematics Category Theory From Rs Categorical Structure Count

The five structures

Category theory is the branch of mathematics that studies mathematical structure itself: instead of asking what a particular object is, it asks how objects of one kind relate to objects of another. Its five canonical structures form a ladder. At the bottom sit objects and morphisms, the arrows between them. On top of those sit functors, which map one whole category to another; natural transformations, which map one functor to another; and adjunctions, a pair of functors that are inverses in a loose, structural sense. This five-rung ladder is the standard skeleton of category theory, taught in every first course.

The Recognition Science library contains a machine-checked proof that this ladder has exactly five rungs. The proof is a theorem named categoricalStructureCount: it defines a type whose members are exactly those five structures, and then verifies by direct computation that the type has cardinality five. The verification is not a hand-wave; it is a formal derivation in the library's logic, with zero unproved assumptions and zero axioms. The theorem does not say that category theory is exhausted by these five notions, nor that the ladder is the only way to organize the subject. It says only that, when the five canonical structures are collected into a single type, that type has exactly five members.

In Recognition Science, this count carries a further meaning. The framework models recognition as a kind of bookkeeping: reality keeps a discrete record of events, and the cost of each recognition is forced by a proved law. Within that framework, the five categorical structures are identified with the five dimensions of a configuration space, and the recognition map is modeled as a functor that preserves the cost structure. The Yoneda lemma, a classical result about how objects are determined by their relationships, is read in the framework as saying that the recognition field embeds in the functor category. These identifications are choices the framework makes, not consequences of the count theorem itself.

The count theorem is a small, clean fact: five canonical structures, exactly five, proved. What it does not do is establish that category theory is the correct language for physics, or that the five structures are the only ones worth studying. Those are larger claims, and the library does not make them in this declaration.

theorem categoricalStructureCount : Fintype.card CategoricalStructure = 5 := by decide

What this page does not claim

The theorem does not claim that category theory is the only or best language for mathematics. The theorem does not claim that the five structures are the only categorical notions worth studying. The framework's identification of the five structures with configuration dimensions is a modeling choice, not a consequence of the count theorem.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Mathematics/CategoryTheoryFromRS.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: