Foundation Distinction To Arithmetic Arithmetic Of Distinction Peano Surface

The forced arithmetic

Peano arithmetic is the standard set of rules for counting: there is a first number (zero), every number has a successor, no two numbers share a successor, and a property that holds for zero and passes from each number to its successor holds for all numbers. These four rules, the Peano surface, are enough to define addition, multiplication, and the whole familiar arithmetic of the natural numbers. The declaration arithmeticOfDistinction_peanoSurface is a machine-checked theorem stating that the framework's construction from a single distinction, a bare fact that two things are different, produces an object that satisfies exactly these four rules.

The framework's central idea is that reality keeps a ledger, a discrete record of recognition events, where the cost of recognition is forced by logic rather than chosen. From the mere existence of two distinguishable points in any carrier, the framework constructs an arithmetic object and proves it is canonical: it is the unique structure that preserves zero and the successor step. The theorem in question proves that this forced object carries the full Peano surface, meaning it behaves exactly like the counting numbers, no more and no less.

The result is precise about what the framework does not force. The carrier of this arithmetic is LogicNat, which is equivalent to the natural numbers and therefore countable. A separate theorem proves that the real numbers are not forced from any countable distinction certificate: the continuum cannot be faithfully covered by a countable system. So the real line enters the framework only through a separate completion or display interface, never from the bare fact of distinction alone.

In Recognition Science, the theorem anchors a larger program: it welds the logical realization of a distinction to its forced arithmetic, making the route from difference to counting a single named object instead of a chain of separate steps. The practical consequence is that the framework treats the natural numbers not as a convenient invention but as the inevitable arithmetic of any system that can tell two things apart. The counting numbers are what distinction forces, and the uncountable continuum is what it does not.

/-- The distinction-forced arithmetic carries the Peano surface: its zero is never
a step, its step is injective, and it satisfies induction. -/
theorem arithmeticOfDistinction_peanoSurface
    {K : Type u} [DecidableEq K] (x y : K) (hxy : x ≠ y) :
    ArithmeticOf.PeanoSurface (arithmeticOfDistinction x y hxy) :=
  UniversalForcing.peano_surface (logicRealizationOfDistinction K x y hxy)

/-- The carrier of the distinction-forced arithmetic is canonically `LogicNat`. -/
noncomputable def arithmeticOfDistinction_carrier_equiv_logicNat
    {K : Type u} [DecidableEq K] (x y : K) (hxy : x ≠ y) :
    (arithmeticOfDistinction x y hxy).peano.carrier ≃ LogicNat :=
  distinction_arithmetic_equiv_logicNat.{u, u, u} x y hxy

/-- The distinction-forced arithmetic carrier is **countable**: it is `LogicNat`,
which is equivalent to `ℕ`. This is the δ-native lower fact: a distinction forces
exactly the countable initial Peano object, no more. -/
theorem arithmeticOfDistinction_carrier_countable
    {K : Type u} [DecidableEq K] (x y : K) (hxy : x ≠ y) :
    Countable (arithmeticOfDistinction x y hxy).peano.carrier := by
  haveI : Countable LogicNat := Countable.of_equiv Nat LogicNat.equivNat.symm
  exact Countable.of_equiv LogicNat
    (arithmeticOfDistinction_carrier_equiv_logicNat x y hxy).symm

/-- **ℝ is not forced from a distinction.** No countable certificate system
faithfully covers ℝ. Restated from `RealLineNonNativity.real_not_faithfully_certifiable`
to sit beside the distinction-forced (countable) arithmetic and make the
unification explicit: distinction forces `LogicNat`, never `ℝ`. -/
theorem real_not_forced_from_distinction
    {Cert : Type} [Countable Cert] (assign : ℝ → Cert) :
    ¬ PrimitiveRecognitionCalculus.RealLineNonNativity.Faithful assign :=
  PrimitiveRecognitionCalculus.RealLineNonNativity.real_not_faithfully_certifiable assign

What this page does not claim

The theorem does not claim that the real numbers are impossible or contradictory, only that they are not forced from a countable distinction. The Peano surface alone does not define addition or multiplication; those operations are built on top of it. The framework does not claim that distinction is the only way to arrive at arithmetic, only that it is one forced route.

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