IndisputableMonolith.Constants.LambdaRecDerivation
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
- Does not supply numerical approximations to lambda_rec.
- Does not connect the root to physical units or measurements.
- Does not address extensions beyond the one-dimensional balance equation.
- Does not prove existence outside the positive reals.
depends on (1)
declarations in this module (26)
-
def
J_bit_normalized -
def
J_curv -
def
totalCost -
def
balanceResidual -
def
lambda_0 -
lemma
lambda_0_pos -
lemma
lambda_0_sq -
theorem
balance_at_lambda_0 -
theorem
balance_unique_positive_root -
def
K -
theorem
lambda_rec_is_root -
theorem
lambda_rec_unique_root -
theorem
lambda_rec_is_forced -
def
Q3_vertices -
def
Q3_faces -
def
euler_S2 -
def
dihedral_angle -
def
angular_deficit_per_vertex -
theorem
angular_deficit_value -
theorem
total_curvature_gauss_bonnet -
def
kappa_normalized -
theorem
kappa_normalized_eq_one -
theorem
J_curv_derivation -
theorem
balance_determines_lambda -
structure
GDerivationChain -
theorem
G_derivation_chain_complete