Foundation Generalized Dalembert Laws Continuous Subsumes Polynomial

The continuous combiner

The d'Alembert functional equation, H(x+y) + H(x-y) = 2 H(x) H(y), is a classical object from the 1747 study of vibrating strings. In plain terms, it forces a function's value at a sum and difference to be determined by its values at the two points, up to a product. The standard classification, due to Aczél and Kannappan, says that under a mild continuity assumption and the normalization H(0) = 1, every real-valued solution is one of exactly three forms: the constant function 1, a hyperbolic cosine cosh(αx), or a trigonometric cosine cos(αx).

The Recognition Science framework's machine-checked library of formal theorems proves this classification from its own axioms, not as an imported postulate. The proof route is worth naming: continuity plus the equation upgrades the solution to infinitely smooth via an integration-bootstrap construction, then a second-derivative identity reduces the problem to a linear ordinary differential equation, whose three branches match the three classical forms. This is a theorem in the framework's library, with no framework-specific axioms beyond the standard logical postulates.

In Recognition Science, the framework models a ledger, a discrete record of recognition events, and a cost, the forced expense of each recognition. A central question is whether the cost function's route-independence, the property that different comparison paths give the same result, forces a specific algebraic form. Earlier work required the route-independence combiner, the function that combines two costs, to be a polynomial of total degree at most two. The new theorem, laws_continuous_subsumes_polynomial, shows that this polynomial hypothesis is stronger than needed: continuity of the combiner alone, together with the other logical laws, suffices to force the same bilinear form P(u,v) = 2u + 2v + c·u·v.

The proof works by showing that the polynomial case is a particular instance of the continuous case. A polynomial combiner is automatically continuous, so the continuous version of the route-independence predicate applies. The continuous combiner is then shown, through the Aczél–Kannappan classification, to satisfy the same bilinear identity. The theorem states that under the continuous laws of logic, there exists a constant c such that the cost function obeys the identity F(x·y) + F(x/y) = 2F(x) + 2F(y) + c·F(x)·F(y) for all positive x and y.

This result does not claim that the continuous combiner analysis inputs, which include a second-derivative identity and a smoothness bootstrap, are automatic from continuity. A counterexample in the library, the quartic log-cost, blocks the proposed second-derivative identity, showing that finite pairwise polynomial closure remains the sharp hypothesis for the Law-of-Logic paper. The continuous version is intended for downstream code, with the polynomial case as a special instance, not as a replacement for the sharper result.

/-- **Aczél–Kannappan classification** (proved theorem, not axiom):
every continuous solution of the d'Alembert functional equation
`H(x+y) + H(x-y) = 2 H(x) H(y)` with `H(0) = 1` is either the
constant 1, a hyperbolic cosine, or a trigonometric cosine.

The proof reduces to
`IndisputableMonolith.Cost.FunctionalEquation.dAlembert_classification`,
which assembles the integration bootstrap, universal-coefficient ODE
derivation, and ODE uniqueness lemmas into the disjunction. -/
theorem aczel_kannappan_continuous_dAlembert
    (H : ℝ → ℝ) (hCont : Continuous H) (h_one : H 0 = 1)
    (hEq : ∀ x y : ℝ, H (x + y) + H (x - y) = 2 * H x * H y) :
    (∀ x, H x = 1) ∨
    (∃ α : ℝ, ∀ x, H x = Real.cosh (α * x)) ∨
    (∃ α : ℝ, ∀ x, H x = Real.cos (α * x)) :=
  IndisputableMonolith.Cost.FunctionalEquation.dAlembert_classification
    H h_one hCont hEq

/-- Every polynomial-LoL operator is a continuous-LoL operator. The bilinear
conclusion still requires the explicit analysis package at this level; the
ordinary polynomial theorem in `LogicAsFunctionalEquation` remains the
unconditional route. -/
theorem laws_continuous_subsumes_polynomial
    (C : ComparisonOperator) (h : SatisfiesLawsOfLogic C)
    (hInputs : ContinuousCombinerAnalysisInputs C
      (laws_polynomial_implies_continuous C h)) :
    ∃ (P : ℝ → ℝ → ℝ) (c : ℝ),
      (∀ x y : ℝ, 0 < x → 0 < y →
        derivedCost C (x * y) + derivedCost C (x / y)
          = P (derivedCost C x) (derivedCost C y)) ∧
      (∀ u v, P u v = 2*u + 2*v + c*u*v) :=
  RCL_is_unique_functional_form_of_logic_continuous C
    (laws_polynomial_implies_continuous C h) hInputs

/-- Polynomial route-independence implies continuous route-independence. -/
theorem polynomial_implies_continuous (C : ComparisonOperator)
    (hPoly : RouteIndependence C) :
    ContinuousRouteIndependence C := by
  obtain ⟨P, ⟨a, b, c, d, e, f, hPform⟩, hSymP, hCons⟩ := hPoly
  refine ⟨P, ?_, hSymP, hCons⟩
  -- Continuity of P from its polynomial form.
  have heq : Function.uncurry P
      = Function.uncurry (fun u v : ℝ => a + b*u + c*v + d*u*v + e*u^2 + f*v^2) := by
    funext ⟨u, v⟩
    simpa using hPform u v
  rw [heq]
  exact polynomial_continuous a b c d e f

What this page does not claim

Continuity alone is not sufficient for the continuous combiner analysis inputs; the quartic log-cost shows the second-derivative identity can fail. The theorem does not prove that the polynomial-degree-at-most-two hypothesis is unnecessary in all cases, only that continuity subsumes it under the continuous laws. The Aczél–Kannappan classification is not posited; it is proved inside the framework from the integration-bootstrap and ODE uniqueness.

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/GeneralizedDAlembert.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: