Foundation Universal Forcing Strict Ordered Strict Ordered Arith Equiv Logic Nat

The integer ledger

The declaration strictOrdered_arith_equiv_logicNat is a formal bridge inside the Recognition Science framework. It connects two different ways of describing a simple counting system. On one side sits a ledger built from the integers, where the cost of moving from one entry to another is zero if the entries are identical and one if they differ. On the other side sits the ordinary natural numbers, the familiar counting numbers 0, 1, 2, and so on. The declaration proves, in the framework's machine-checked library of formal theorems, that these two descriptions are structurally the same: every counting number corresponds to exactly one ledger position, and the correspondence preserves the way the system is organized.

To see why this matters, picture a bookkeeper who records transactions on an infinite line of integer positions. The bookkeeper's only rule is that checking an entry against itself costs nothing, while checking against any other entry costs one unit. That rule is symmetric: checking entry 5 against entry 7 costs the same as checking 7 against 5. The framework's declaration shows that this starkly simple ledger, with no arithmetic operations built in, still contains a copy of the natural numbers. The counting numbers emerge from the ledger's structure alone, not from any extra assumptions about addition or ordering.

The declaration does not claim that this integer ledger is the only possible one. It does not prove that the natural numbers are unique, nor that this particular realization is preferred over any other. It establishes one specific equivalence: the arithmetic structure derived from this strict ordered realization matches the standard natural numbers. The proof relies on the framework's earlier result that this realization is a lightweight version of a more general logical structure, and that lightweight version is what the equivalence uses.

What the declaration does not claim is broader significance. It does not say that the integers are the natural numbers, nor that this ledger is how mathematics must be built. It does not assert anything about the physical world, about recognition costs in nature, or about the forcing chain that produces constants like the golden ratio. The declaration is a narrow, precise statement: a particular formal construction, the strict ordered integer realization, has the same arithmetic shape as the natural numbers. It is a building block, not a conclusion.

In the framework's own terms, this is a definitional equivalence, not a theorem about the world. The declaration is tagged as a definition, and its content is a structural correspondence proved in the framework's library. A reader should take from it a concrete fact: a ledger with only equality and difference as its costs still carries the full structure of counting. That fact is machine-checked, but it is a fact about the framework's internal constructions, not a claim about external reality.

def strictOrdered_arith_equiv_logicNat :
    (StrictLogicRealization.arith strictOrderedRealization).peano.carrier
      ≃ ArithmeticFromLogic.LogicNat :=
  (StrictLogicRealization.toLightweight strictOrderedRealization).orbitEquivLogicNat

def intCost (a b : ℤ) : Nat :=
  if a = b then 0 else 1

theorem intCost_symm (a b : ℤ) : intCost a b = intCost b a := by
  by_cases h : a = b
  · subst h
    simp [intCost]
  · have h' : b ≠ a := by intro hb; exact h hb.symm
    simp [intCost, h, h']

What this page does not claim

The declaration does not claim that the integer ledger is the only possible realization. It does not claim anything about physical recognition costs or natural constants. It does not assert that the natural numbers are unique or that this construction is preferred.

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/UniversalForcing/Strict/Ordered.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: