Encyclopedia Foundation Foundation Categorical Logic Realization Lawvere Nno
ARTICLE 3 claims 3 theorems
Foundation Categorical Logic Realization Lawvere Nno
A natural-number object is the categorical way to say "counting works," and this declaration pins down that structure without rebuilding category theory.
Natural numbers as a structure
The natural numbers are the counting numbers: zero, one, two, and so on, with a successor operation that moves from each number to the next. In category theory, a natural-number object (NNO) captures this idea structurally: it is an object with a distinguished zero and a successor morphism, such that any other structure with a zero and a successor map has a unique arrow from the NNO into it. This uniqueness property, called initiality, is what makes the NNO the universal counting structure. The LawvereNNO declaration in the Recognition Science framework packages exactly this: a Peano object that is initial, has decidable equality, and contains at least one element different from zero.
The declaration does not rebuild category theory from scratch. Instead, it provides a lightweight interface that names the data a full categorical realization would need: an object type, morphisms, a zero object, the NNO itself, zero and successor morphisms, and an initiality condition. The framework then shows that its own logical natural numbers, built from arithmetic logic, satisfy this interface. A theorem in the library confirms that this canonical construction has the required categorical interface, and a separate definition shows that categorical arithmetic is invariant across realizations: any two realizations of the natural numbers have isomorphic carriers.
In Recognition Science, this declaration is a bridge. It connects the framework's internal arithmetic, which is built from a ledger of recognition events (a discrete record of what has been counted), to the standard categorical language of natural-number objects. The point is not to prove new facts about arithmetic, but to show that the framework's counting structure is genuinely a natural-number object in the Lawvere sense. The declaration establishes a structural identity, not a new mathematical discovery.
What the declaration does not claim is equally important. It does not claim that the framework derives the natural numbers from recognition alone; the natural numbers are assumed as a logical primitive. It does not claim to have constructed a full category-theoretic model with all the usual axioms; the interface is a simplified placeholder. And it does not claim that this categorical realization has any physical content by itself. It is a formal bridge, not a physical law.
THEOREM LawvereNNO · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean
/-- A Lawvere-style natural-number object expressed as an initial Peano object. -/
structure LawvereNNO where
object : PeanoObject
initial : PeanoObject.IsInitial object
decEq : DecidableEq object.carrier
nontrivial : ∃ x : object.carrier, x ≠ object.zero
THEOREM logicNatNNO_has_category_interface · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean
theorem logicNatNNO_has_category_interface :
Nonempty (categoryInterfaceOfLawvere logicNatNNO).initiality :=
⟨trivial⟩
THEOREM categorical_arithmetic_invariant · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean
/-- Categorical arithmetic is invariant with every realization. -/
noncomputable def categorical_arithmetic_invariant (R : LogicRealization.{0, 0}) :
(UniversalForcing.arithmeticOf canonicalCategoricalRealization).peano.carrier
≃ (UniversalForcing.arithmeticOf R).peano.carrier :=
ArithmeticOf.equivOfInitial
(UniversalForcing.arithmeticOf canonicalCategoricalRealization)
(UniversalForcing.arithmeticOf R)
What this page does not claim
The declaration does not construct a full category-theoretic model with all standard axioms. The declaration does not derive the natural numbers from recognition events; they are a logical primitive. The declaration does not assign physical meaning to the categorical realization.
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/Foundation/CategoricalLogicRealization.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:
- What is the full categorical model that this simplified interface is meant to approximate?
- How does the framework's logical natural numbers relate to the recognition ledger's counting structure?
- Does the invariance of categorical arithmetic extend to all possible realizations, or only those built from the framework's logic?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM LawvereNNO · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean
/-- A Lawvere-style natural-number object expressed as an initial Peano object. -/ structure LawvereNNO where object : PeanoObject initial : PeanoObject.IsInitial object decEq : DecidableEq object.carrier nontrivial : ∃ x : object.carrier, x ≠ object.zeroThe LawvereNNO declaration packages a Peano object that is initial, has decidable equality, and contains at least one element different from zero. LawvereNNO · IndisputableMonolith/Foundation/CategoricalLogicRealization.leanTHEOREM logicNatNNO_has_category_interface · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean
theorem logicNatNNO_has_category_interface : Nonempty (categoryInterfaceOfLawvere logicNatNNO).initiality := ⟨trivial⟩A theorem in the library confirms that this canonical construction has the required categorical interface. logicNatNNO_has_category_interface · IndisputableMonolith/Foundation/CategoricalLogicRealization.leanTHEOREM categorical_arithmetic_invariant · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean
/-- Categorical arithmetic is invariant with every realization. -/ noncomputable def categorical_arithmetic_invariant (R : LogicRealization.{0, 0}) : (UniversalForcing.arithmeticOf canonicalCategoricalRealization).peano.carrier ≃ (UniversalForcing.arithmeticOf R).peano.carrier := ArithmeticOf.equivOfInitial (UniversalForcing.arithmeticOf canonicalCategoricalRealization) (UniversalForcing.arithmeticOf R)Categorical arithmetic is invariant across realizations: any two realizations of the natural numbers have isomorphic carriers. categorical_arithmetic_invariant · IndisputableMonolith/Foundation/CategoricalLogicRealization.lean