Foundation Universal Forcing Strict Realization Arith Equiv Logic Nat

The forced arithmetic

The natural numbers, 0, 1, 2, and so on, are the counting numbers everyone meets in childhood. They have a first element, zero, and a way to step from any number to the next one, its successor. This pair of features, a starting point and a successor operation, is so basic that mathematicians have given it a name: a Peano structure. The declaration arith_equiv_logicNat in the Recognition Science framework is a machine-checked proof that this structure is not an optional extra in a system of logic. It is forced.

The framework begins with a recognition event, a discrete record of a comparison between two things. A ledger, a discrete record of such events, is the basic object of study. The theorem concerns a strict realization, which is a minimal set of logical data: a native comparison, a composition operation, an identity, an invariance property, and a non-triviality condition. The key word is strict. An earlier version of the framework allowed a realization to carry its own internal counting structure as a supplied field, like a pre-installed part. The strict version removes that escape hatch. A strict realization must supply only the native logical data, with no counting structure included.

What the declaration proves is that, from this sparse data alone, a counting structure emerges anyway. The theorem constructs a Peano structure from the native generator and composition operation, and then proves that this structure is equivalent to the standard natural numbers. The equivalence is an isomorphism, meaning the two structures are the same in every way that matters for counting: they have the same shape, the same starting point, and the same successor steps. The result is stated in the machine-checked library of formal theorems under the name arith_equiv_logicNat.

The consequence is that arithmetic is not a separate assumption in the framework. It is a derived feature, an inevitable consequence of having a minimal logical system at all. This is what the framework means by universal forcing: the structure of counting is not chosen, it is compelled. The theorem also shows that this forced arithmetic is the same for every strict realization. Any two such systems, however different their native data, end up with the same counting structure, a fact the framework states as universal_forcing.

The declaration does not claim that the natural numbers are the only possible counting system. It claims that any system meeting the strict logical conditions must contain a copy of them. It does not claim that the physical universe is made of such ledgers, only that if a system satisfies the conditions, its arithmetic is fixed. It also does not claim that the Peano structure is unique in an absolute sense, only that it is uniquely determined up to isomorphism, which is the standard notion of sameness for such structures.

/-- Every strict realization has forced arithmetic canonically equivalent to
`LogicNat`. -/
def arith_equiv_logicNat (R : StrictLogicRealization) :
    (arith R).peano.carrier ≃ LogicNat :=
  (toLightweight R).orbitEquivLogicNat

/-- A strict Law-of-Logic realization: native law data only, no supplied orbit. -/
structure StrictLogicRealization where
  Carrier : Type u
  Cost : Type v
  zeroCost : Zero Cost
  compare : Carrier → Carrier → Cost
  compose : Carrier → Carrier → Carrier
  one : Carrier
  generator : Carrier
  identity_law : ∀ x : Carrier, compare x x = 0
  non_contradiction_law : ∀ x y : Carrier, compare x y = compare y x
  excluded_middle_law : Prop
  composition_law : Prop
  invariance_law : Prop
  nontrivial_law : compare generator one ≠ 0

/-- The strict free orbit is uniformly the `LogicNat` iteration object. -/
abbrev FreeOrbit (_R : StrictLogicRealization) : Type :=
  LogicNat

/-- Universal forcing for strict realizations. -/
noncomputable def universal_forcing (R S : StrictLogicRealization) :
    (arith R).peano.carrier ≃ (arith S).peano.carrier :=
  ArithmeticOf.equivOfInitial (arith R) (arith S)

What this page does not claim

The natural numbers are the only possible counting system. The physical universe is made of such ledgers. The Peano structure is unique in an absolute sense, rather than up to isomorphism.

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