Foundation Primitive Recognition Calculus Rigidity Base Initiality Base Initial

The base structure

A distinction, in the Recognition Science framework, is the simplest possible act of separating one thing from another. The framework's ledger, a discrete record of such events, begins with this raw signature: a carrier (the collection of possible states), a distinguished starting point called zero, and a single step function that moves from any state to the next. This signature, called a DeltaAlgebra, is deliberately minimal. It contains no arithmetic, no ordering, no notion of addition or multiplication, only the bare bones of counting.

The framework's machine-checked library of formal theorems proves a strong statement about this minimal structure. The declaration base_initial establishes that the natural numbers, built from zero and the successor function, form an initial object in the category of DeltaAlgebras. In plain language: for any structure that has a starting point and a next-step function, there is exactly one way to map the natural numbers into it that respects those two features. Every such structure is a copy of the natural numbers, and the copy is unique. This is the theorem of initiality, and it is proved in the framework's library.

Two further theorems strengthen the result. base_categorical shows that any structure satisfying the Peano axioms (successor is injective, zero is not a successor, and induction holds) is isomorphic to the natural numbers: the map from the natural numbers to that structure is a bijection, meaning the two are the same in every structural sense. base_unique_iso goes further, proving that this isomorphism is unique. Together, the three theorems form base_rigidity, which states that the natural numbers are initial, categorical, and uniquely isomorphic to any Peano model. The framework's library proves all three with no additional axioms beyond the standard three of the ambient type theory.

What this does not claim is equally important. The theorem does not say that the natural numbers are the only possible carrier for a DeltaAlgebra. Any set with a point and a function can serve as a carrier. The theorem says that if the function behaves like a successor (injective, never hitting zero, and supporting induction), then that carrier is forced to look exactly like the natural numbers. It does not claim that the natural numbers are the only structure that can be built from distinctions, nor does it assert anything about the physical world. It is a statement about the mathematics of counting, not about which things in nature actually count.

The consequence for the framework is structural. The natural numbers are not an arbitrary choice for the ledger of recognition events; they are the only choice that satisfies the minimal axioms. This gives the framework a foundation that is not merely convenient but forced. The reader can now see that the framework's account of counting is not one option among many, but the unique option that the axioms permit.

theorem base_initial : target_initial :=
  fun M => ⟨baseInitial M⟩

theorem base_categorical : target_categorical :=
  fun M h => ⟨baseHom M, baseRec_injective M h, baseRec_surjective M h⟩

theorem base_unique_iso : target_unique_iso := by
  intro M h
  refine ⟨{ default := ⟨baseHom M, baseRec_injective M h, baseRec_surjective M h⟩,
            uniq := ?_ }⟩
  intro f
  apply Subtype.ext
  exact (baseInitial M).uniq f.1

/-- The full base-rigidity conjunction: initiality, categoricity, and uniqueness
of the isomorphism. The δ-base is a canonical object — forced up to unique
isomorphism. THEOREM (choice-free; see the audits below). -/
theorem base_rigidity :
    target_initial ∧ target_categorical ∧ target_unique_iso :=
  ⟨base_initial, base_categorical, base_unique_iso⟩

What this page does not claim

The theorem does not claim that the natural numbers are the only possible carrier for a DeltaAlgebra. It does not claim anything about which structures in the physical world satisfy the Peano axioms. It does not derive any arithmetic operations beyond the successor function itself.

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/PrimitiveRecognitionCalculus/Rigidity/BaseInitiality.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: