Foundation Primitive Recognition Calculus Generable Real Display Exceeds Generat

Display beyond generation

A real number is generable when it can be obtained from a fixed countable list of named constants and the rationals by finitely many additions, multiplications, subtractions, and divisions. The generable reals form a field: they are closed under the usual arithmetic operations, contain every rational, and contain every named constant. Because only countably many finite descriptions exist, the generable reals are countable, a proper subset of the full real line. This is the classical fact that most real numbers are not definable by any finite recipe.

The framework's library, a machine-checked collection of formal theorems, proves a sharper statement called display exceeds generation. For any countable family of named constants, there exists a real number r that is the value of a Delta-real protocol, meaning the analysis display can reach it, yet r is not generable. The protocol value map lands onto the full continuum, while the ontology is the countable generable field. The gap is exactly the reals that exist only as display, never as finite generation. This is the guard against smuggling uncountable ontology in through the analysis interface.

In Recognition Science, this theorem does not claim that every real is generable, nor that the analysis display creates new ontology. It establishes a precise boundary: the display interface is richer than the generative ontology, and the surplus is uncountable. The theorem is proved in Lean, the framework's formal proof assistant, with no axioms beyond the standard three. It is a structural result about the relationship between two formal notions, not a claim about physical reality.

/-- The generable reals are countable: only countably many finite descriptions
exist. -/
theorem genField_countable (κ : ℕ → ℝ) : (genField κ : Set ℝ).Countable :=
  MinimalField.subfield_closure_countable_of_countable (Set.countable_range κ)

/-- The generable reals are a proper subset of ℝ: countability rules out the whole
continuum. -/
theorem genField_proper (κ : ℕ → ℝ) : (genField κ : Set ℝ) ≠ Set.univ := by
  intro h
  exact Cardinal.not_countable_real (h ▸ genField_countable κ)

/-- **Phase 2 headline: display exceeds generation.** For any countable constant
family, there is a real that is the value of a Delta-real protocol (so the
analysis display reaches it) yet is not generable. The protocol value map lands
onto the full continuum, while the ontology is the countable generable field; the
gap is exactly the reals that exist only as display, never as finite generation.
This is the guard against smuggling uncountable ontology in through the analysis
interface. -/
theorem display_exceeds_generation (κ : ℕ → ℝ) :
    ∃ r : ℝ, (∃ x : DeltaReal.Protocol, x.value = r) ∧ r ∉ genField κ := by
  obtain ⟨r, hr⟩ := (Set.ne_univ_iff_exists_notMem _).mp (genField_proper κ)
  exact ⟨r, DeltaReal.Protocol.value_surjective r, hr⟩

/-- The generable field is closed under the field operations and contains the
rationals and the named constants: it is a genuine operational carrier, not a bare
set. -/
theorem genField_is_operational_carrier (κ : ℕ → ℝ) :
    (∀ q : ℚ, (q : ℝ) ∈ genField κ)
      ∧ (∀ n : ℕ, κ n ∈ genField κ)
      ∧ (∀ a b : ℝ, a ∈ genField κ → b ∈ genField κ → a + b ∈ genField κ)
      ∧ (∀ a b : ℝ, a ∈ genField κ → b ∈ genField κ → a * b ∈ genField κ)
      ∧ (∀ a : ℝ, a ∈ genField κ → -a ∈ genField κ)
      ∧ (∀ a : ℝ, a ∈ genField κ → a⁻¹ ∈ genField κ)
      ∧ (genField κ : Set ℝ).Countable :=
  ⟨rat_mem κ, const_mem κ,
    fun _ _ ha hb => add_mem ha hb, fun _ _ ha hb => mul_mem ha hb,
    fun _ ha => neg_mem ha, fun _ ha => inv_mem ha, genField_countable κ⟩

What this page does not claim

Not every real number is generable, only that the display reaches beyond the generable field. The theorem does not claim that the analysis display creates new ontology, only that it reaches reals not finitely generable. No claim is made about whether the displayed-but-not-generable reals correspond to physical quantities.

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