Foundation Universal Forcing Continuous Realization Continuous Arith Equiv Logic

The arithmetic bridge

The declaration continuous_arith_equiv_logicNat is a formal statement in the framework's machine-checked library of formal theorems. It establishes a structural equivalence: the arithmetic that emerges from a continuous, positive-ratio recognition process is identical in form to the ordinary natural numbers, the counting numbers 0, 1, 2, 3, and so on. The equivalence is not approximate and not merely similar; it is a precise structural match, expressed as an isomorphism between two number systems.

In plain terms, the declaration says that if you start with a recognition process that compares ratios in a continuous way, the arithmetic operations that arise from that process behave exactly like the arithmetic of counting. The framework models recognition as a ledger, a discrete record of events, and the declaration shows that a continuous version of this ledger still produces the same arithmetic as the discrete counting numbers. This matters because it connects two different ways of building arithmetic: one from continuous comparison, one from discrete counting.

The declaration is a definition in the framework's library, not a theorem. It names a specific construction: it takes a comparison operator that satisfies the laws of logic and produces an equivalence between the arithmetic of the continuous realization and the standard natural numbers. The construction relies on an existing wrapper that re-exports a previously established result under a new namespace. The declaration itself does not prove that the laws of logic hold; it assumes they do as a hypothesis.

What the declaration does not claim is equally important. It does not claim that the continuous realization is the only way to build arithmetic, nor does it claim that the equivalence holds for arbitrary comparison operators. It requires the operator to satisfy the laws of logic. It also does not claim anything about which arithmetic operations are preserved, only that the carrier sets, the underlying collections of numbers, are isomorphic. The declaration is a bridge between two formal constructions, not a statement about the physical world.

/-- The continuous realization carries the universal forced arithmetic. -/
noncomputable def continuous_arith_equiv_logicNat
    (C : ComparisonOperator) (h : SatisfiesLawsOfLogic C) :
    (arithmeticOf (continuousRealization C h)).peano.carrier
      ≃ ArithmeticFromLogic.LogicNat :=
  (continuousRealization C h).orbitEquivLogicNat

/-- The continuous realization carries the universal forced arithmetic. -/
noncomputable def continuous_arith_equiv_logicNat
    (C : ComparisonOperator) (h : SatisfiesLawsOfLogic C) :
    (arithmeticOf (continuousRealization C h)).peano.carrier
      ≃ ArithmeticFromLogic.LogicNat :=
  (continuousRealization C h).orbitEquivLogicNat

What this page does not claim

The declaration does not prove the laws of logic hold for any particular comparison operator. The declaration does not claim the equivalence holds for arbitrary comparison operators. The declaration says nothing about which specific arithmetic operations are preserved, only the underlying carrier sets.

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