Pith. sign in
module module moderate

IndisputableMonolith.Constants.LambdaRecDerivation

show as:
view Lean formalization →

LambdaRecDerivation module derives the recursive lambda as the unique positive root of the balance residual equation built from the normalized bit cost of a recognition event. Researchers establishing RS-native constants or the phi-ladder would cite it for the lambda_0 and root-uniqueness results. The module consists of supporting definitions for totalCost and balanceResidual followed by root-isomorphism and uniqueness statements.

claimLet $J_{bit}$ be the normalized bit cost of one recognition event. Define $ au_0 = 1$ tick as the base quantum. Then $\lambda_{rec}$ is the unique positive root of the balance residual equation, with $alanceResidual( au_0, otalCost, alanceAtLambda_0)$ vanishing only at this root.

background

The upstream Constants module defines the fundamental RS time quantum as $ au_0 = 1$ tick. This derivation submodule introduces $J_{bit}$ (normalized bit cost of one recognition event) together with totalCost, balanceResidual, lambda_0, and the auxiliary lemmas lambda_0_pos, lambda_0_sq, and balance_at_lambda_0. These objects sit inside the larger Constants framework that supplies the J-cost function and the Recognition Composition Law.

proof idea

This is a definition module, no proofs. It introduces the auxiliary quantities J_bit_normalized, totalCost, and balanceResidual, states lambda_rec_is_root, and records the uniqueness claim lambda_rec_unique_root.

why it matters in Recognition Science

The module supplies the recursive lambda root required by the parent Constants module for subsequent constant derivations. It fills the step that isolates the unique positive solution to the balance equation, directly supporting the phi-ladder mass formulas and the alpha-band predictions in the Recognition Science chain.

scope and limits

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (26)