pith. sign in
module module high

IndisputableMonolith.Foundation.MultiplicativeRecognizerL4

show as:
view Lean formalization →

MultiplicativeRecognizerL4 defines the multiplicative recognizer on positive reals equipped with a continuous comparison operator satisfying the Law of Logic. It pairs geometric recognizer data with cost-functional data to enable automatic derivation of L4. Researchers constructing the Recognition Science forcing chain cite this module for the multiplicative event space. The module assembles imported results from LogicAsFunctionalEquation, RecognizerInducesLogic, and PrimitiveDistinction without introducing new proofs.

claimLet $\mathcal{E}=\mathbb{R}_{>0}$. A multiplicative recognizer is a recognizer $r:\mathcal{C}\to\mathcal{E}$ equipped with a continuous comparison operator on $\mathcal{E}$ that satisfies the Law of Logic, paired with the cost-functional data required to derive (L4) automatically.

background

Recognition Science starts from a single functional equation on recognizers that map configurations to events. This module specializes the general recognizer to the multiplicative case whose event space is the positive reals. It relies on the unification result that any recognizer automatically generates a Law-of-Logic realization on its event space, as stated in the companion paper RS_Recognition_Geometry_Logic_Unification.tex.

proof idea

this is a definition module, no proofs

why it matters in Recognition Science

The module supplies the multiplicative recognizer structure required by the root IndisputableMonolith module to expose the master forcing-chain theorem. It completes the foundation layer for deriving L4 on the multiplicative event space and feeds directly into the T0-T8 chain.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (3)

Lean names referenced from this declaration's body.

declarations in this module (13)