Foundation Distinction To Arithmetic Real Not Forced From Distinction

The boundary of what a distinction forces

A distinction is a discrete record of events: the fact that two points in a carrier are not the same. The Recognition Science framework's machine-checked library of formal theorems proves that from any such distinction, a countable arithmetic structure follows. This structure behaves like the natural numbers: it has a zero, a successor operation that never repeats, and induction. The proof is constructive, meaning the framework can name the arithmetic object that a given distinction forces into existence.

The theorem real_not_forced_from_distinction states a boundary on this process. It says that the real number line, the continuum of all decimal expansions, cannot be faithfully certified by any countable system of certificates. A faithful certificate would assign to each real number a unique finite label, and the theorem proves no such assignment can exist. The reason is cardinality: the reals are uncountable, while any countable certificate system can only label countably many objects. This is a classical result about the size of the continuum, restated inside the framework's own language.

In Recognition Science, the theorem draws a precise line. A distinction forces exactly the countable initial Peano arithmetic, never the continuum. The real line enters the framework only through a separate completion or display interface, not as a native consequence of distinction data. This is not a failure of the framework; it is a deliberate statement of scope, making explicit what the primitive can and cannot generate.

The theorem does not claim that the reals do not exist, nor that they are less real than the naturals. It claims only that the reals are not forced by the bare fact of distinction. The framework's own account of the continuum would have to come from another source, and the theorem names that source as an open question rather than a derived result.

/-- **ℝ 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

/-- 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 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

What this page does not claim

The theorem does not claim the real numbers do not exist or are less fundamental than the naturals. The theorem does not claim the framework has no account of the continuum, only that distinction alone does not force it.

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: