Foundation Primitive Recognition Calculus Certified Analytic Transformers Certif

The countable transformer closure

A protocol in the Recognition Science framework is a discrete record of recognition events, and each protocol has a real-number value. The framework's library of formal theorems proves that a certain registry of protocols, built from constants and unary transformers, yields only countably many values. The declaration certified_transformer_headline extends this result to a richer registry that also includes binary transformers and finite compositions of unary transformers. The theorem establishes three facts: the set of values remains countable, every value is witnessed by some protocol, and unary transformer composition is associative.

The richer registry, called RichRegistry, is a structure with three components: a constant that maps natural numbers to protocols, a unary transformer that takes a protocol to a protocol, and a binary transformer that takes two protocols to a protocol. Finite expressions over this registry, called RichExpr, include rational numbers, constants, negation, addition, subtraction, unary applications, and binary applications. The evaluation function maps each finite expression to a protocol, and the theorem's first two conjuncts guarantee that the set of all values of these expressions is countable and that each value has a protocol whose value equals it.

The third conjunct states that composing unary transformers is associative, meaning the order of grouping compositions does not change the resulting transformer. This is a structural property that holds for any functions, but its inclusion in the headline signals that the framework treats transformer composition as a well-defined operation. The theorem is proved in the machine-checked library of formal theorems, with the proof combining three earlier results: the countability of the value set, the existence of a protocol for each value, and the associativity of composition.

In Recognition Science, this result matters because it shows that adding binary transformers and finite compositions does not re-import the continuum. The framework's protocols remain a countable, discrete structure even when the registry is enriched. This is a closure property: the richer certified analytic registry does not escape the countable domain. The theorem does not claim that the richer registry is complete, that every real number is a value, or that the transformers themselves are countable as functions; it only establishes countability of the value set and the witness property.

/-- **Certified analytic transformer headline.** Adding binary transformers and
finite compositions of unary transformers does not re-import the continuum:
generated values remain countable and protocol-witnessed, and unary transformer
composition is associative. -/
theorem certified_transformer_headline (R : RichRegistry) :
    (RichExpr.values R).Countable
      ∧ (∀ x : ℝ, x ∈ RichExpr.values R → ∃ p : Protocol, p.value = x)
      ∧ (∀ f g h : Protocol → Protocol,
          composeUnary (composeUnary f g) h = composeUnary f (composeUnary g h)) :=
  ⟨RichExpr.values_countable R, RichExpr.every_value_has_protocol R, composeUnary_assoc⟩

/-- A richer countable registry with constants, unary protocol transformers, and
binary protocol transformers. -/
structure RichRegistry where
  const : ℕ → Protocol
  unary : ℕ → Protocol → Protocol
  binary : ℕ → Protocol → Protocol → Protocol

/-- **Certified analytic transformer headline.** Adding binary transformers and
finite compositions of unary transformers does not re-import the continuum:
generated values remain countable and protocol-witnessed, and unary transformer
composition is associative. -/
theorem certified_transformer_headline (R : RichRegistry) :
    (RichExpr.values R).Countable
      ∧ (∀ x : ℝ, x ∈ RichExpr.values R → ∃ p : Protocol, p.value = x)
      ∧ (∀ f g h : Protocol → Protocol,
          composeUnary (composeUnary f g) h = composeUnary f (composeUnary g h)) :=
  ⟨RichExpr.values_countable R, RichExpr.every_value_has_protocol R, composeUnary_assoc⟩

What this page does not claim

The theorem does not claim that every real number is a value of some protocol. The theorem does not claim that the set of transformers themselves is countable. The theorem does not claim that the richer registry is complete or closed under all possible operations.

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: