Foundation Primitive Recognition Calculus Delta Forced Delta Forced Nat

The countable certificate

A set is δ-forced when it carries an explicit countable certificate: an injection into the natural numbers ℕ. This is the formal content of "finitely generated, hence enumerable, from the act of distinction." The declaration deltaForced_nat establishes the base case: the set of natural numbers itself is δ-forced. The proof is immediate, using the identity embedding of ℕ into ℕ. This is the first rung of a tower of sets that the framework's library shows are all δ-forced.

The framework's library proves that the integers ℤ and the rationals ℚ are also δ-forced. For ℤ, the injection maps a nonnegative integer k to 2k and a negative integer −(k+1) to 2k+1, separating evens and odds. For ℚ, the injection pairs a rational's numerator and denominator into a single natural number using a pairing function, and the library proves this map is injective. These three results combine into a theorem called forcedTower, which asserts that ℕ, ℤ, and ℚ are all physically real in the framework's sense.

The library also proves a demarcation theorem: the real numbers ℝ are not δ-forced. The proof runs through Cantor's diagonal argument, showing that any injection from ℝ into ℕ would contradict the uncountability of the continuum. This yields a clean boundary: the countable sets are in, the uncountable sets are out. The framework's thesis identifies physically real with δ-forced, meaning that the mathematical content of the demarcation is carried entirely by the definition of δ-forced, while the name records the claim that this boundary is the physical one.

In Recognition Science, the declaration deltaForced_nat is the seed of a countable tower. The library shows that δ-forced sets are closed under subtypes, sums, and products, so the tower extends far beyond ℕ, ℤ, and ℚ. The key consequence is that the framework's notion of physical reality aligns exactly with countability: a set is physically real if and only if it is countable. This is a theorem in the library, proved by showing that δ-forced implies countable and countable implies δ-forced.

What deltaForced_nat does not claim is just as important. It does not claim that the natural numbers are the only δ-forced set, nor does it claim that the natural numbers are physically real in any sense beyond the framework's own definition. The declaration establishes a single fact: ℕ has an injection into itself. The physical interpretation, that this makes ℕ physically real, is a thesis of the framework, not a mathematical theorem about the natural numbers themselves.

/-- ℕ is δ-forced: it is its own certificate. -/
theorem deltaForced_nat : DeltaForced ℕ := ⟨Function.Embedding.refl ℕ⟩

/-- ℤ is δ-forced via the explicit even/odd certificate. Choice-free. -/
theorem deltaForced_int : DeltaForced ℤ := ⟨⟨intToNat, intToNat_inj⟩⟩

/-- ℚ is δ-forced via the explicit paired certificate. This is the top of the forced
tower constructed in the companion algebra paper (ℕδ → ℤδ → ℚδ). Choice-free. -/
theorem deltaForced_rat : DeltaForced ℚ := ⟨⟨ratToNat, ratToNat_inj⟩⟩

/-- The continuum is **not** δ-forced. A certificate would force `Countable ℝ`, but
ℝ has cardinality `𝔠 > ℵ₀`. -/
theorem not_deltaForced_real : ¬ DeltaForced ℝ := by
  intro h
  have hc : Countable ℝ := countable_of_deltaForced h
  have hle : Cardinal.mk ℝ ≤ Cardinal.aleph0 := Cardinal.mk_le_aleph0_iff.mpr hc
  rw [Cardinal.mk_real] at hle
  exact absurd hle (not_le.mpr Cardinal.aleph0_lt_continuum)

/-- δ-forced ↔ countable. The forward direction is choice-free; the backward
direction extracts a certificate from countability and uses choice. -/
theorem deltaForced_iff_countable (X : Type u) : DeltaForced X ↔ Countable X := by
  constructor
  · exact countable_of_deltaForced
  · intro h
    obtain ⟨f, hf⟩ := h.exists_injective_nat'
    exact ⟨⟨f, hf⟩⟩

What this page does not claim

The natural numbers are the only δ-forced set. The real numbers are physically real in any sense. The declaration deltaForced_nat alone establishes the physical reality of ℕ.

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/PrimitiveRecognitionCalculus/DeltaForced.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: