Foundation Universal Forcing Order Realization Order Realization

The ordered model

In mathematics, a realization is a concrete model that makes an abstract structure tangible. The declaration orderRealization builds one such model inside the Recognition Science framework. It takes the framework's abstract counting objects, called LogicNat, and maps them onto the familiar integers: 0, 1, 2, 3, and so on. The mapping is the usual embedding, so the abstract object named 3 becomes the integer 3. Nothing exotic happens at this stage; the integers serve as a carrier, a stage on which the framework's arithmetic can perform.

The model also assigns a cost to moving between integers. The rule is simple: moving from an integer to itself costs 0, and moving to any different integer costs 1. This is called the equality cost, and it satisfies two basic properties that the framework requires of any cost: it is symmetric (the cost from a to b equals the cost from b to a), and the cost of staying put is zero. These properties are proved as theorems in the machine-checked library of formal theorems, not assumed.

The point of the construction is not the integers themselves. The framework's central result is that a forced arithmetic structure emerges from its axioms, and orderRealization shows that this structure can be carried by the ordinary integers with unit steps. More strongly, the library proves that this ordered model is initial: every other realization of the framework's arithmetic is uniquely connected to it. This means the integers, with this cost and this embedding, are not one model among many; they are the starting point from which all others derive.

In Recognition Science, this is a structural result about arithmetic, not a physical claim. The declaration establishes that the framework's forced counting rules can live on the integer line with a simple step cost. It does not claim that physical space is discrete, that time advances in unit ticks, or that the integers themselves are the true ontology of the universe. The integers are a convenient stage, and the theorem says the show can run there.

What the declaration changes is the framework's own footing. Before orderRealization, the forced arithmetic was an abstract construction; after it, the framework can point to a concrete, checkable model where that arithmetic runs on the plain integers. That is the difference between a rule stated and a rule exhibited.

/-- Equality cost on integers. -/
def intCost (a b : ℤ) : Nat :=
  if a = b then 0 else 1

@[simp] theorem intCost_self (a : ℤ) : intCost a a = 0 := by
  simp [intCost]

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']

/-- Ordered realization carries the universal forced arithmetic. -/
noncomputable def order_arithmetic_invariant (R : LogicRealization.{0, 0}) :
    (arithmeticOf orderRealization).peano.carrier ≃ (arithmeticOf R).peano.carrier :=
  ArithmeticOf.equivOfInitial (arithmeticOf orderRealization) (arithmeticOf R)

/-- Interpret `LogicNat` as nonnegative integers. -/
def intOrbitInterpret (n : LogicNat) : ℤ :=
  (LogicNat.toNat n : ℤ)

What this page does not claim

This declaration does not claim that physical space or time is discrete or advances in unit steps. It does not claim the integers are the fundamental ontology of the framework, only a carrier for its arithmetic. It does not claim the equality cost is the same as the framework's main forced cost function J(x).

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/OrderRealization.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: