Pith. sign in

Explain the Lean lemma `dAlembert_double` in module `IndisputableMonolith.Cost.FunctionalEquation`. Write for an educated reader who knows science and programming but may not know Lean. Cover: (1) what the declaration says in plain English, (2) why it matters in Recognition Science, (3) how to read the formal statement, (4) visible dependencies or certificates in the supplied source, and (5) what this declaration does not prove. Cite only declarations present in the supplied Recognition source.

Big AI job. Grok 4.3 reads the canon and writes a Lean-grounded derivation; usually 20 seconds to 2 minutes. Your answer will appear below.
confidence: high in recognition cached

Explanation of the lemma dAlembert_double

(1) In plain English, the declaration asserts that any real-valued function H obeying H(0) = 1 and the two-variable functional equation H(t + u) + H(t - u) = 2 · H(t) · H(u) for all real t and u must also satisfy the double-step identity H(2t) = 2 · (H(t))² - 1. This is obtained simply by substituting u = t into the given equation and rearranging with elementary arithmetic.

(2) The lemma supports the functional-equation analysis inside the Cost module that underpins the uniqueness argument for the reciprocal-symmetric cost function J. By supplying a concrete algebraic consequence of the d'Alembert relation, it contributes to the chain that isolates the unique cost expression used for the recognition ledger.

(3) The formal statement is read as follows: the lemma is parameterized by a function H : ℝ → ℝ together with two hypotheses (h_one : H 0 = 1 and h_dAlembert : ∀ t u, H (t + u) + H (t - u) = 2 * H t * H u) and an arbitrary real argument t. Its conclusion is the equality H (2 * t) = 2 * (H t)^2 - 1. The proof proceeds by instantiating h_dAlembert at (t, t), invoking h_one to replace the H(0) term, and simplifying the resulting linear equation.

(4) Visible dependencies inside the supplied source are the hypothesis h_dAlembert (used directly) and the tactics linarith and simpa for the arithmetic steps. The lemma is invoked by the subsequent declaration dAlembert_product, which applies it twice to obtain a product identity. Related declarations in the same module include dAlembert_even and Jcost_cosh_add_identity.

(5) The declaration does not prove that any particular function (such as Jcost) satisfies the d'Alembert equation, nor does it establish existence, uniqueness, or smoothness of solutions. It likewise contains no statements about phi, the forcing chain, or derived physical constants; those connections lie outside this single lemma.

cited recognition theorems

outside recognition

Aspects Recognition does not yet address:

  • Any explicit statement of the full T5 uniqueness theorem or its connection to the Law of Logic.
  • Derivation of the golden-ratio constant phi or the numerical values of physical constants from this lemma alone.

recognition modules consulted

The Recognition library is at github.com/jonwashburn/shape-of-logic. The model is restricted to the supplied Lean source and instructed not to invent theorem names. Treat output as a starting point, not a verified proof.