Foundation Primitive Recognition Calculus Certified Analytic Protocols Value Add

The countable registry

A registry, in the Recognition Science framework, is a countable list of certified analytic ingredients: named constants and unary transformers that build new protocols from old ones. The declaration value_add is a small theorem about how this registry behaves when two expressions are added together. It states that the value displayed by the registry for an addition expression is exactly the sum of the values of its two parts. In plain terms, the registry's arithmetic is honest: adding expressions adds their values.

The theorem is one of six components gathered into a single result called transcendental_protocol_closure. Together they show that any such registry, no matter how many constants or transformers it lists, generates only countably many real values, and every one of those values is witnessed by an actual protocol. The continuum of real numbers is not the carrier of analytic content; a certified countable registry is. This is a proved theorem in the framework's machine-checked library of formal theorems, with no framework-specific axioms beyond the standard logical postulates.

What the declaration does not claim is just as important. It does not say that the registry can represent every real number, or that its countable values cover the continuum. It does not say that the registry's transformers are complete, only that they are countable. And it does not say that addition is the only binary operation available; the framework keeps binary operations to the native additive ones already proved, encoding further operations as unary transforms on paired protocols if needed.

The consequence for the framework is a guard against what its authors call continuum smuggling: the subtle error of assuming that because real numbers appear in the display, the underlying analytic content must be uncountable. The theorem closes that door. A reader can now see that the framework's analytic content is a countable, certified structure, and that its arithmetic is faithful to the real values it names.

/-- Native addition remains addition under the value display. -/
theorem value_add (R : Registry) (a b : Expr) :
    value R (.add a b) = value R a + value R b := by
  simp [value, eval, Protocol.value_add]

/-- Registry values are countable because expressions are finite trees over
countable labels. This is the countability fact that blocks continuum smuggling. -/
theorem values_countable (R : Registry) : (values R).Countable :=
  Set.countable_range (value R)

/-- Every registry value has a protocol witness, by construction. -/
theorem every_value_has_protocol (R : Registry) (x : ℝ) (hx : x ∈ values R) :
    ∃ p : Protocol, p.value = x := by
  rcases hx with ⟨e, rfl⟩
  exact ⟨eval R e, rfl⟩

What this page does not claim

The registry can represent every real number. The registry's transformers are complete. Addition is the only binary operation available in the framework.

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