Foundation Primitive Recognition Calculus Certified Analytic Protocols

Countable analytic content

A certified analytic protocol is a finite recipe for building a real number from rationals, named constants, and unary transforms. The recipe is an expression tree: rational literals, registered constants, negation, addition, subtraction, and registered unary operations. Evaluation turns the tree into a protocol, and the protocol's value is a real number. The key fact is that the set of all values generated by any registry is countable, because expressions are finite trees over countable labels. This countability fact blocks continuum smuggling: the uncountable real line is not the carrier of analytic content; a certified countable protocol registry is.

Every registry value has a protocol witness by construction. Rational literals evaluate to their rational values. Native addition, negation, and subtraction remain addition, negation, and subtraction under the value display. The transcendental protocol closure theorem packages these facts: any countably indexed registry of certified analytic constants and protocol transformers generates only countably many real values, and every value is witnessed by a Delta-real protocol. The theorem is proved in the machine-checked library of formal theorems, with no unproved assumptions beyond the standard axioms of the ambient type theory.

In Recognition Science, the framework models reality as a discrete record of recognition events. The certified analytic protocol registry is the framework's way of saying that the analytic content of that record is countable, not a continuum. The framework proves that any cost function satisfying five plain conditions must equal J(x) = (x + 1/x)/2 - 1, and from J a chain of theorems forces the golden ratio phi as the unique self-similar scaling, an eight-tick recognition cycle, 2^3, and three spatial dimensions. The certified analytic protocol registry is the countable substrate on which that forcing chain lives.

The practical consequence is that the framework's analytic content is finitely generated and machine-checkable. A researcher can build a registry, evaluate expressions, and trust that every value is witnessed by a protocol. The framework does not claim that the continuum is irrelevant to physics; it claims that the analytic content of recognition is countable. The library's theorem is a precise statement about what a countable registry can generate, not a claim about the nature of the real numbers themselves.

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

/-- **Transcendental protocol closure.** Any countably indexed registry of certified
analytic constants and protocol transformers generates only countably many real
values, and every value is witnessed by a Delta-real protocol. The continuum is not
the carrier of analytic content; a certified countable protocol registry is. -/
theorem transcendental_protocol_closure (R : Registry) :
    (values R).Countable
      ∧ (∀ x : ℝ, x ∈ values R → ∃ p : Protocol, p.value = x)
      ∧ (∀ q : ℚ, value R (.rat q) = (q : ℝ))
      ∧ (∀ a b : Expr, value R (.add a b) = value R a + value R b)
      ∧ (∀ a : Expr, value R (.neg a) = - value R a)
      ∧ (∀ a b : Expr, value R (.sub a b) = value R a - value R b) :=
  ⟨values_countable R, every_value_has_protocol R, value_rat R, value_add R,
    value_neg R, value_sub R⟩

/-- **Transcendental protocol closure.** Any countably indexed registry of certified
analytic constants and protocol transformers generates only countably many real
values, and every value is witnessed by a Delta-real protocol. The continuum is not
the carrier of analytic content; a certified countable protocol registry is. -/
theorem transcendental_protocol_closure (R : Registry) :
    (values R).Countable
      ∧ (∀ x : ℝ, x ∈ values R → ∃ p : Protocol, p.value = x)
      ∧ (∀ q : ℚ, value R (.rat q) = (q : ℝ))
      ∧ (∀ a b : Expr, value R (.add a b) = value R a + value R b)
      ∧ (∀ a : Expr, value R (.neg a) = - value R a)
      ∧ (∀ a b : Expr, value R (.sub a b) = value R a - value R b) :=
  ⟨values_countable R, every_value_has_protocol R, value_rat R, value_add R,
    value_neg R, value_sub R⟩

What this page does not claim

The countability theorem does not claim the real numbers are countable. The framework turn does not claim the continuum is irrelevant to physics. The certified analytic protocol registry does not itself derive the golden ratio or three dimensions.

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: