IndisputableMonolith.Cost.FunctionalEquation
The Cost.FunctionalEquation module supplies the log reparametrization G_F(t) = F(exp t) that converts the multiplicative Recognition Composition Law into the additive d'Alembert equation. Analysts closing the T5 J-uniqueness step in the forcing chain cite it to reach the cosh form of the J-cost function. The module defines auxiliary objects G and H plus their evenness and additivity identities by direct substitution, relying on the imported AczelClass smoothness interface.
claimLet F satisfy the Recognition Composition Law. The log reparametrization is $G_F(t) := F(e^t)$. Under this change of variables the equation becomes the d'Alembert form $G(t+u) + G(t-u) = 2G(t)G(u)$ with $G(0)=1$.
background
In the Cost domain the J-cost function obeys the Recognition Composition Law J(xy) + J(x/y) = 2J(x)J(y) + 2J(x) + 2J(y). The module Cost.FunctionalEquation performs the change to logarithmic coordinates that turns the multiplicative structure into an additive functional equation. It imports the AczelClass typeclass whose doc states: 'This module declares the typeclass interface for the d'Alembert smoothness package and the bootstrap theorem that uses it.' The local setting assumes positive reals and the normalization conventions already fixed in the parent Cost module.
proof idea
This is a definition module. It introduces the reparametrization G_F t = F (exp t) together with the auxiliary functions G, H and the identities CoshAddIdentity, G_even_of_reciprocal_symmetry, even_deriv_at_zero. Each identity follows by direct substitution into the functional equation and algebraic rearrangement; no heavy tactics appear.
why it matters in Recognition Science
The module bridges the multiplicative Recognition Composition Law to the additive d'Alembert equation needed for T5. It is imported by Cost.AczelClassification, whose doc notes that it packages 'the part of the d'Alembert forcing chain that is supplied by the Aczel classification theorem', and by Cost.AczelTheorem which concludes every continuous solution is C^∞. This step removes the central regularity seam before the ODE H'' = H and the eight-tick octave are reached.
scope and limits
- Does not prove existence of non-constant solutions without normalization.
- Does not derive the explicit cosh form J(x) = cosh(log x) - 1.
- Does not address the phi fixed point or self-similarity.
- Does not treat the full eight-tick octave or spatial dimension D = 3.
used by (21)
-
IndisputableMonolith.Algebra.CostAlgebra -
IndisputableMonolith.Cost.AczelClassification -
IndisputableMonolith.Cost.AczelProof -
IndisputableMonolith.Cost.AczelTheorem -
IndisputableMonolith.Cost.ContDiffReduction -
IndisputableMonolith.Cost.FunctionalEquationAczel -
IndisputableMonolith.CostUniqueness -
IndisputableMonolith.Ethics.ThermodynamicInstabilityOfExtraction -
IndisputableMonolith.Foundation.AxiomDischargePlan -
IndisputableMonolith.Foundation.CostAxioms -
IndisputableMonolith.Foundation.DAlembert.Counterexamples -
IndisputableMonolith.Foundation.DAlembert.FourthGate -
IndisputableMonolith.Foundation.DAlembert.FullUnconditional -
IndisputableMonolith.Foundation.DAlembert.Proof -
IndisputableMonolith.Foundation.DAlembert.RightAffineFromFactorization -
IndisputableMonolith.Foundation.DAlembert.Stability -
IndisputableMonolith.Foundation.DAlembert.Ultimate -
IndisputableMonolith.Foundation.DAlembert.Unconditional -
IndisputableMonolith.Foundation.LogicAsFunctionalEquation -
IndisputableMonolith.Measurement.RecognitionAngle.AngleFunctionalEquation -
IndisputableMonolith.NumberTheory.ZeroCompositionInterface
depends on (2)
declarations in this module (62)
-
def
G -
def
H -
def
CoshAddIdentity -
def
DirectCoshAdd -
lemma
CoshAddIdentity_implies_DirectCoshAdd -
lemma
G_even_of_reciprocal_symmetry -
lemma
G_zero_of_unit -
theorem
Jcost_G_eq_cosh_sub_one -
theorem
Jcost_cosh_add_identity -
theorem
even_deriv_at_zero -
lemma
dAlembert_even -
lemma
dAlembert_double -
lemma
dAlembert_product -
lemma
dAlembert_diff_square -
def
HasLogCurvature -
lemma
sub_one_eq_mul_ratio -
lemma
tendsto_H_one_of_log_curvature -
theorem
dAlembert_continuous_of_log_curvature -
lemma
deriv_exp_neg -
lemma
ode_diagonalization -
lemma
deriv_neg_self_zero -
lemma
deriv_pos_self_zero -
theorem
ode_zero_uniqueness -
theorem
cosh_second_deriv_eq -
theorem
cosh_initials -
theorem
ode_cosh_uniqueness_contdiff -
def
ode_linear_regularity_bootstrap_hypothesis -
def
ode_regularity_continuous_hypothesis -
def
ode_regularity_differentiable_hypothesis -
theorem
cosh_satisfies_bootstrap -
theorem
cosh_satisfies_continuous -
theorem
cosh_satisfies_differentiable -
theorem
ode_cosh_uniqueness -
def
dAlembert_continuous_implies_smooth_hypothesis -
def
dAlembert_to_ODE_hypothesis -
theorem
cosh_dAlembert_smooth -
theorem
cosh_dAlembert_to_ODE -
theorem
dAlembert_cosh_solution -
theorem
dAlembert_cosh_solution_of_log_curvature -
def
IsReciprocalCost -
def
IsNormalized -
def
IsCalibrated -
def
IsCalibratedLimit -
lemma
taylorWithinEval_succ_real -
lemma
taylorWithinEval_one_univ -
lemma
taylorWithinEval_two_univ -
lemma
isCalibratedLimit_of_isCalibrated -
lemma
isCalibrated_of_isCalibratedLimit -
def
SatisfiesCompositionLaw -
theorem
reciprocal_implies_G_even -
theorem
normalized_implies_G_zero -
theorem
composition_law_equiv_coshAdd -
theorem
washburn_uniqueness -
def
symmetric_second_diff_limit_hypothesis -
theorem
dAlembert_smooth_of_aczel -
theorem
dAlembert_to_ODE_general_theorem -
theorem
dAlembert_to_ODE_theorem -
theorem
ode_regularity_continuous_of_smooth -
theorem
ode_regularity_differentiable_of_smooth -
theorem
ode_regularity_bootstrap_of_smooth -
theorem
dAlembert_cosh_solution_aczel -
theorem
washburn_uniqueness_aczel