Mathematics Category Theory From Rs Categorical Structure

The five structures

Category theory is the mathematics of structure-preserving maps. Its five canonical notions are objects, morphisms, functors, natural transformations, and adjunctions. Objects are the things being studied; morphisms are the arrows between them; functors map one whole category to another; natural transformations are maps between functors; adjunctions are a special kind of correspondence between functors. These five form the backbone of the subject, appearing in every branch from algebra to topology.

The Recognition Science framework defines a CategoricalStructure as an inductive type with exactly these five constructors. An inductive type is a way of building a collection by listing its possible forms. The framework then proves a theorem, categoricalStructureCount, that the number of such structures is five. The proof is by computation: the machine checks each of the five cases and confirms no others exist. This is a ledger, a discrete record of events, holding five entries.

In Recognition Science, the framework models a recognition map as a functor that preserves J-cost structure. The J-cost of a morphism f equals the J-cost of its input r, written J(f(r)) = J(r). This is a definitional choice, not a theorem. The Yoneda lemma, a classical result, is then used to embed the recognition field into the functor category. The framework's library, a machine-checked collection of formal theorems, contains five structures and zero axioms beyond the standard three.

The declaration does not claim that category theory is derived from Recognition Science. It defines a correspondence between five categorical notions and a counting argument. It does not prove the Yoneda lemma or any other categorical theorem. It does not claim that the five structures are the only possible ones in mathematics. The count is a fact about this particular inductive definition, not about the whole of category theory.

What this establishes is a clean bridge: the five structures that category theorists use every day can be enumerated in a machine-checked way. This gives a concrete starting point for further work, where the framework can ask which categorical results hold under its cost-preserving maps. The enumeration is a small but solid foundation, one that a reader can verify by hand in a few minutes.

inductive CategoricalStructure where
  | objects | morphisms | functors | naturalTransformations | adjunctions
  deriving DecidableEq, Repr, BEq, Fintype

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

inductive CategoricalStructure where
  | objects | morphisms | functors | naturalTransformations | adjunctions
  deriving DecidableEq, Repr, BEq, Fintype

def categoryTheoryCert : CategoryTheoryCert where
  five_structures := categoricalStructureCount

What this page does not claim

Category theory is derived from Recognition Science. The Yoneda lemma is proved in the framework. The five structures are the only possible ones in mathematics.

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: