Encyclopedia Foundation Foundation Categorical Logic Realization Categorical Arithmetic Invariant

ARTICLE 2 claims 2 models

Foundation Categorical Logic Realization Categorical Arithmetic Invariant

A formal bridge shows that the natural numbers built inside the Recognition Science framework are the same natural numbers, no matter how the framework's internal logic is realized.

The invariant

In mathematics, a natural-number object is a way to capture the counting numbers (0, 1, 2, ...) inside a logical or categorical setting. The classical definition, due to F. William Lawvere in the 1960s, says that a natural-number object is an initial algebra for the successor operation: it is the smallest structure where you can start at zero and apply a "next" operation, and from which there is exactly one structure-preserving map to any other such structure. This uniqueness property is what makes the natural numbers universal.

The Recognition Science framework builds its own arithmetic from a logic-based foundation. Its library defines a ledger, a discrete record of events, and then shows that the counting numbers can be derived from the structure of that ledger. The declaration categorical_arithmetic_invariant establishes a precise bridge: it takes any realization of the framework's logic and produces a bijection between the natural numbers obtained from that realization and the natural numbers obtained from the canonical, or standard, realization. In plain terms, the arithmetic you get does not depend on which particular logical realization you choose; it is invariant.

This is a structural theorem about the framework's own construction, not a new result about the natural numbers themselves. The framework models the natural numbers as an initial Peano algebra, and the invariant declaration packages the fact that any two such initial algebras are isomorphic. The proof relies on the standard categorical fact that initial algebras are unique up to isomorphism. The declaration is a definition, not a theorem, but it is a definition that is backed by a proved equivalence.

What the declaration does not claim is just as important. It does not claim that the natural numbers are the only model of arithmetic, nor does it claim that the framework's logic is consistent. It does not prove that the framework's arithmetic is the same as classical Peano arithmetic; it only proves that the framework's own arithmetic is the same regardless of the logical realization chosen. The bridge is internal to the framework; it says nothing about how the framework's arithmetic relates to arithmetic as developed in other formal systems.

In Recognition Science, this invariant is a small but load-bearing piece: it ensures that the arithmetic used throughout the framework is well-defined, not an artifact of a particular logical choice. It is a coherence result, not a discovery about numbers. The reader should take it as a guarantee of internal consistency, not as a claim about the foundations of mathematics.

MODEL 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)
MODEL 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

What this page does not claim

The declaration does not prove that the framework's arithmetic is identical to classical Peano arithmetic. The declaration does not establish the consistency of the framework's logic. The declaration does not claim that the natural numbers are the only model of arithmetic.

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:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND