Encyclopedia Foundation Foundation Primitive Recognition Calculus Delta Forced Not Delta Forced Real
ARTICLE 4 claims 2 theorems 2 models
Foundation Primitive Recognition Calculus Delta Forced Not Delta Forced Real
The real number line is too rich to be a discrete record of events, and a machine-checked proof pins down exactly why.
The real numbers lie outside the ledger
The real numbers are the continuum: the number line with no gaps, the setting for calculus, limits, and continuous motion. A ledger, a discrete record of distinct events, cannot hold all of them. There are simply too many real numbers to line up one after another in a countable list. This is a classical result, known since Georg Cantor in the 1870s, and it is the fact behind the declaration not_deltaForced_real.
In the Recognition Science framework, a type 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 framework's thesis identifies physically real with being δ-forced. The declaration not_deltaForced_real is the theorem that the real numbers are not δ-forced: there is no such injection, because the reals are uncountable.
The proof is short and relies on a standard result. If the reals were δ-forced, they would be countable. But the cardinality of the reals is the continuum, which is strictly larger than the cardinality of the natural numbers. The contradiction is immediate. This is not a new mathematical discovery; it is a formal restatement of Cantor's theorem within the framework's own definitions.
What the declaration does not claim is just as important. It does not say that the real numbers are physically unreal in any ordinary sense. It does not say that calculus is wrong or that continuous mathematics is useless. It says only that, under the framework's specific definition of physical reality as enumerable from distinction, the reals do not qualify. The framework's library proves that the natural numbers, the integers, and the rational numbers are all δ-forced, and that the reals are not. This demarcation is the boundary of the ledger.
In Recognition Science, this result is a key marker. It separates the discrete world of countable distinctions from the continuous world of the continuum. It means that any physical theory built on the ledger will be a theory of discrete structures, not of continuous fields. The real numbers remain a useful tool for approximation and analysis, but they are not, in this account, the fundamental stuff of reality.
THEOREM not_deltaForced_real · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- 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)
MODEL DeltaForced · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- A type is **δ-forced** when it carries an explicit countable certificate: an
injection into ℕ. This is the formal content of "finitely generated, hence
enumerable, from the act of distinction." -/
def DeltaForced (X : Type u) : Prop := Nonempty (X ↪ ℕ)
MODEL PhysicallyReal · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- The ontological reading: **physically real** is, by thesis, exactly δ-forced. The
mathematical content is carried entirely by `DeltaForced`; this name records the
claim that the demarcation line below is the physical one. -/
def PhysicallyReal (X : Type u) : Prop := DeltaForced X
THEOREM forcedTower · demarcation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- The forced tower is constructively (choice-free) physically real. Isolated from
the ℝ statement so the positive content carries no `Classical.choice`: this is the
exact formal residue of "the δ tower ℕδ → ℤδ → ℚδ is built, not posited." -/
theorem forcedTower :
PhysicallyReal ℕ ∧ PhysicallyReal ℤ ∧ PhysicallyReal ℚ :=
⟨deltaForced_nat, deltaForced_int, deltaForced_rat⟩
/-- **Demarcation.** The δ tower (ℕ, ℤ, ℚ) is physically real; the continuum ℝ is
not. The forced-tower conjuncts are choice-free (`forcedTower`); the ℝ conjunct uses
the classical uncountability of ℝ, which is a fact about the display-tier object, not
about the forced side. -/
theorem demarcation :
PhysicallyReal ℕ ∧ PhysicallyReal ℤ ∧ PhysicallyReal ℚ ∧ ¬ PhysicallyReal ℝ :=
⟨deltaForced_nat, deltaForced_int, deltaForced_rat, not_deltaForced_real⟩
What this page does not claim
The real numbers are physically unreal in any ordinary sense. Calculus or continuous mathematics is wrong or useless. The framework's definition of physical reality is the only possible one.
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:
- How does the framework handle continuous mathematics if the reals are not physically real?
- What physical consequences follow from the demarcation between countable and uncountable types?
- Does the framework provide an alternative foundation for calculus and analysis?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM not_deltaForced_real · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- 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)The declaration not_deltaForced_real is the theorem that the real numbers are not δ-forced: there is no such injection, because the reals are uncountable. not_deltaForced_real · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.leanMODEL DeltaForced · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- A type is **δ-forced** when it carries an explicit countable certificate: an injection into ℕ. This is the formal content of "finitely generated, hence enumerable, from the act of distinction." -/ def DeltaForced (X : Type u) : Prop := Nonempty (X ↪ ℕ)A type is δ-forced when it carries an explicit countable certificate: an injection into the natural numbers. DeltaForced · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.leanMODEL PhysicallyReal · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- The ontological reading: **physically real** is, by thesis, exactly δ-forced. The mathematical content is carried entirely by `DeltaForced`; this name records the claim that the demarcation line below is the physical one. -/ def PhysicallyReal (X : Type u) : Prop := DeltaForced XThe framework's thesis identifies physically real with being δ-forced. PhysicallyReal · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.leanTHEOREM forcedTower · demarcation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean
/-- The forced tower is constructively (choice-free) physically real. Isolated from the ℝ statement so the positive content carries no `Classical.choice`: this is the exact formal residue of "the δ tower ℕδ → ℤδ → ℚδ is built, not posited." -/ theorem forcedTower : PhysicallyReal ℕ ∧ PhysicallyReal ℤ ∧ PhysicallyReal ℚ := ⟨deltaForced_nat, deltaForced_int, deltaForced_rat⟩/-- **Demarcation.** The δ tower (ℕ, ℤ, ℚ) is physically real; the continuum ℝ is not. The forced-tower conjuncts are choice-free (`forcedTower`); the ℝ conjunct uses the classical uncountability of ℝ, which is a fact about the display-tier object, not about the forced side. -/ theorem demarcation : PhysicallyReal ℕ ∧ PhysicallyReal ℤ ∧ PhysicallyReal ℚ ∧ ¬ PhysicallyReal ℝ := ⟨deltaForced_nat, deltaForced_int, deltaForced_rat, not_deltaForced_real⟩The framework's library proves that the natural numbers, the integers, and the rational numbers are all δ-forced, and that the reals are not. forcedTower · demarcation · IndisputableMonolith/Foundation/PrimitiveRecognitionCalculus/DeltaForced.lean