Foundation Primitive Recognition Calculus Generable Real Gen Field Proper

The countable field of generable reals

The real numbers are uncountable: there are so many of them that no list, however infinite, can name them all. But in Recognition Science, the framework's ontology is built from finite descriptions. A ledger, a discrete record of events, can only hold finitely many symbols per entry. So the framework asks a pointed question: which real numbers can actually be produced, starting from rationals and a countable family of named constants, using only finitely many additions, multiplications, negations, and inverses? The answer is the subfield generated by those constants, a set closed under all field operations.

The declaration genField_proper proves a sharp boundary on this set. For any countable family of constants, the field they generate is countable. Since the real numbers are uncountable, the generated field cannot be the whole real line. The theorem states this directly: the set of generable reals is not equal to the set of all reals. This is not a numerical estimate or a conjecture; it is a proved consequence of the definitions, checked in the framework's machine-checked library of formal theorems.

The proof is a short chain. The library shows the generated field is countable because it is built from a countable set of constants by finitely many operations. A separate theorem, also in the library, shows the real numbers are not countable. Combining these two facts yields the conclusion. The declaration itself is the final step of that argument, packaged as a single theorem.

The consequence matters for the framework's internal consistency. The same library proves that the analysis interface, called Delta-real protocols, can reach every real number as a display value. So there are reals that can be shown on a screen, so to speak, but cannot be finitely generated. The gap is deliberate: it prevents the analysis interface from smuggling in uncountable ontology through the back door. The ontology stays countable; the display can reach the continuum. This is the guard the framework names as display exceeds generation.

What the declaration does not claim is just as important. It does not say which specific real numbers are missing. It does not say that the generated field is small in any measure-theoretic sense; it only says the field is not everything. It does not claim that the constants themselves must be a particular set, such as the framework's phi-power ladder. The theorem holds for any countable family of constants whatsoever, and it says nothing about the values of those constants, only about the size of the field they generate.

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

What this page does not claim

The theorem does not identify any particular non-generable real number. The theorem does not depend on the specific values of the constants, only on their countability. The theorem does not assert that the generable field is small in measure, only that it is not the whole real line.

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: