Foundation Primitive Recognition Calculus Generable Real

The generable reals

In mathematics, a real number is called generable when it can be obtained from a fixed set of starting constants and the rational numbers by finitely many additions, multiplications, subtractions, and divisions. For example, if the constants include π and √2, then 3π + 1/√2 is generable, but a number like the one encoding the halting problem is not. The idea is simple: some reals are reachable by finite arithmetic, and most are not.

This notion has a classical pedigree. The set of numbers obtainable from a given collection by field operations is called the field generated by that collection. When the starting collection is countable, the generated field is also countable: there are only countably many finite expressions, so only countably many values. Since the real numbers are uncountable, the generated field is always a proper subset of ℝ. This is a standard result in field theory, and it is what the framework builds on.

In Recognition Science, the framework models its ontology as a countable family of named constants, one for each natural number. The generable reals are then the subfield of ℝ generated by those constants: everything obtainable from them and the rationals by finitely many field operations. The framework's machine-checked library of formal theorems proves three facts about this construction. First, every rational and every named constant is generable. Second, the generable reals are closed under addition, multiplication, negation, and inversion, so they form a genuine operational carrier, not just a bare set. Third, the generable reals are countable, hence a proper subset of ℝ.

The framework's library also proves a sharper result: for any countable constant family, there exists a real number that is the value of a Delta-real protocol, meaning the analysis display can reach it, yet is not generable. This is the phase 2 headline: display exceeds generation. The protocol value map lands onto the full continuum, while the ontology is the countable generable field. The gap consists exactly of the reals that exist only as display, never as finite generation. This is the guard against smuggling uncountable ontology in through the analysis interface.

What this means in plain terms: the framework keeps its ontology countable, but its analysis interface can still talk about every real number. The cost is that some reals are only display, not generation. That distinction is a deliberate design choice, and the theorems above make it precise.

/-- The generable reals relative to a countable family of named constants `κ`:
the subfield of ℝ generated by the constants. Equivalently, everything obtainable
from the constants and rationals by finitely many field operations. -/
noncomputable def genField (κ : ℕ → ℝ) : Subfield ℝ := Subfield.closure (Set.range κ)

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

This module does not prove that any specific real number is nongenerable. The framework does not claim that the generable field is the only ontology; it is one carrier.

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: