Foundation Primitive Recognition Calculus Certified Analytic Transformers

The countable core

A protocol is a discrete record of recognition events, a finite or countable object that the framework uses to assign a real number value. The recognition calculus is the system for building new protocols from old ones. The library extends this system with a richer registry: it adds named constants, unary transformers that take one protocol and produce another, and binary transformers that combine two protocols into one. These are not arbitrary operations; they are indexed by natural numbers, so the registry itself remains countable.

Finite expressions over this registry form the type RichExpr. An expression can be a rational number, a named constant, or a combination built by negation, addition, subtraction, a unary transformer, or a binary transformer. Evaluation maps each expression to a protocol, and the protocol's value is a real number. The library proves a closure theorem: the set of all such values is countable, and every value in that set has a protocol that realizes it. This means the richer language does not secretly import the continuum; it stays within the countable universe the framework requires.

The headline theorem bundles three facts. First, the set of values generated by any rich registry is countable. Second, every such value is protocol-witnessed, meaning there is a concrete protocol whose value equals it. Third, composition of unary transformers is associative: composing f with g and then with h equals composing f with the composition of g and h. This associativity is the algebraic backbone that lets the framework treat transformers as a coherent category of operations.

In Recognition Science, this library establishes a boundary. The framework's cost function and forcing chain produce specific constants like the golden ratio and the fine-structure expression, but those live in a separate part of the library. Here, the point is structural: no matter how many transformers one adds, the generated values remain countable and each has a protocol witness. The framework models recognition as a discrete ledger, and this theorem shows that adding analytic-looking transformers does not break that discreteness. The practical consequence is that the framework can safely use these richer expressions without losing its countable foundation.

theorem values_countable (R : RichRegistry) : (values R).Countable :=
  Set.countable_range (value R)

theorem every_value_has_protocol (R : RichRegistry) (x : ℝ) (hx : x ∈ values R) :
    ∃ p : Protocol, p.value = x := by
  rcases hx with ⟨e, rfl⟩
  exact ⟨eval R e, rfl⟩

theorem composeUnary_assoc (f g h : Protocol → Protocol) :
    composeUnary (composeUnary f g) h = composeUnary f (composeUnary g h) := by
  rfl

What this page does not claim

This library does not derive any specific physical constant or coupling value. The countable values here are not claimed to include all real numbers or the continuum. The framework does not claim these transformers are the only way to build protocols.

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