Foundation Primitive Recognition Calculus Frscarrier

The finite carrier

The real numbers are vast, but a framework that computes with them might not need all of them. Foundation primitive recognition calculus frscarrier is the part of Recognition Science that fixes which numbers its calculations are allowed to touch. It defines a small grammar of expressions: start with any rational number, or with one of four named constants, and combine them using addition, multiplication, and reciprocal. The four constants are the golden ratio φ, π, Euler's number e, and the inverse fine-structure constant α⁻¹. This grammar is the carrier, the finite set of descriptions from which every recognition value is built.

The central result is a soundness theorem, proved in a machine-checked library: every expression in this grammar evaluates to a real number that belongs to a specific countable field called rsField. Because the grammar has only finitely many symbols and rules, it can generate only countably many distinct expressions. The theorem that all their values lie in a countable field therefore implies that the set of all carrier values is countable. Since the real numbers are uncountable, the carrier is a proper subset of the reals, not the whole continuum. This is the plain-language punchline: the framework's calculations never escape a countable set of numbers, even though it reasons about the real line.

The framework also shows that every carrier value can be displayed as a protocol in the Δ-real interface, a separate representation system. This means the finite descriptions are not an isolated formalism; they connect to a broader framework for handling real-valued quantities. The final theorem, frs_carrier, bundles all these properties into one statement: soundness, the four constants evaluating to their expected values, countability, properness, and the protocol display property.

In Recognition Science, this carrier is the answer to a design question: what numbers does the framework actually compute on? The answer is finite generation over a fixed inventory, not the uncountable continuum. This has a practical consequence: every recognition value can, in principle, be written down as a finite expression. The framework's claims about the real numbers are anchored in a countable set of descriptions, which keeps the entire calculus tractable and explicit.

/-- **Soundness.** Every carrier term evaluates into the countable field `rsField`.
The finite-description syntax never escapes the carrier. -/
theorem eval_mem (ex : FRSExpr) : eval ex ∈ MinimalField.rsField := by
  induction ex with
  | rat q => exact SubfieldClass.ratCast_mem MinimalField.rsField q
  | phi => simpa [eval] using MinimalField.rsField_mem_phi
  | pi => simpa [eval] using MinimalField.rsField_mem_pi
  | e => simpa [eval] using MinimalField.rsField_mem_e
  | alphaInv => simpa [eval] using MinimalField.rsField_mem_alphaInv
  | neg a ih => simpa [eval] using neg_mem ih
  | add a b iha ihb => simpa [eval] using add_mem iha ihb
  | mul a b iha ihb => simpa [eval] using mul_mem iha ihb
  | inv a ih => simpa [eval] using inv_mem ih

/-- The carrier value set is countable: only countably many finite terms exist. -/
theorem carrierValues_countable : carrierValues.Countable :=
  (MinimalField.rsField_countable).mono carrierValues_subset

/-- The carrier values are a proper subset of ℝ. -/
theorem carrierValues_proper : carrierValues ≠ Set.univ := by
  intro h
  exact Cardinal.not_countable_real (h ▸ carrierValues_countable)

/-- **Protocol display.** Every carrier term value is the value of a Delta-real
protocol, so the finite-description carrier renders into the `ℝδ` interface. -/
theorem has_protocol_display (ex : FRSExpr) :
    ∃ x : DeltaReal.Protocol, x.value = eval ex :=
  DeltaReal.Protocol.value_surjective (eval ex)

What this page does not claim

The framework does not prove that all real numbers are reachable by the carrier. The framework does not define the physical meaning of the inverse fine-structure constant α⁻¹. The framework does not show that every recognition value in the framework is a carrier value.

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