Recognition: 2 theorem links
· Lean TheoremThe d'Alembert Inevitability Theorem
Pith reviewed 2026-05-14 20:46 UTC · model grok-4.3
The pith
Symmetric polynomial combiners of degree two or less force the d'Alembert composition law for continuous functions on the positive reals.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For continuous nonconstant F : R>0 → R with F(1)=0 satisfying the given composition law with symmetric polynomial P of degree ≤2, P must be exactly 2u + 2v + c uv for some real c. The equation then becomes the d'Alembert functional equation in logarithmic coordinates; solutions are hyperbolic or trigonometric when c ≠ 0 and squared-logarithm when c = 0. Under nonnegativity and convexity only the hyperbolic branch survives, and a curvature calibration fixes c = 2, yielding the canonical reciprocal cost ½(x + x^{-1}) − 1.
What carries the argument
The degree-mismatch exclusion criterion for symmetric polynomials of degree ≥3, which prevents nonconstant continuous solutions when the leading homogeneous part does not cancel.
If this is right
- In n variables the only continuous solutions with c ≠0 depend on a single linear combination of the logarithms of the coordinates.
- When c=0 the solutions are arbitrary quadratic forms in the logarithms.
- Nonnegative convex solutions are restricted to the hyperbolic branch with c>0.
- Coordinate-wise separable nontrivial costs are impossible in all cases.
Where Pith is reading between the lines
- The same degree-mismatch test may apply to other functional equations whose right-hand side is polynomial in two variables.
- The canonical choice c=2 supplies a distinguished cost function that could be tested for optimality in concrete optimization or information-geometric settings.
- Relaxing continuity to measurability would likely preserve the same classification, since d'Alembert's equation is known to behave well under weaker regularity.
Load-bearing premise
The leading term of any symmetric polynomial of degree three or higher does not cancel under the substitution that defines the composition law.
What would settle it
A continuous nonconstant F with F(1)=0 and a symmetric polynomial combiner P of degree three whose leading term cancels, yet the composition law still holds for all x,y >0.
read the original abstract
We study functions satisfying the composition law $F(xy)+F(x/y)=P(F(x),F(y))$ with a symmetric polynomial combiner $P$. We prove that symmetry together with a quadratic degree bound on $P$ forces a composition law of d'Alembert type. We establish a degree mismatch exclusion criterion showing that symmetric polynomial combiners with $\mbox{deg} P(u,v) \ge 3$ do not admit nonconstant continuous solutions, provided the leading term does not cancel (Theorem 3.1.). For continuous nonconstant functions $F:\mathbb{R}_{>0}\to\mathbb{R}$ with $F(1)=0$ satisfying the composition law with a symmetric polynomial $P$ of degree at most two, the combiner is necessarily of the form $P(u,v)=2u+2v+c\,uv$, $c\in\mathbb{R}$ (Theorem 3.3.). The equation reduces in logarithmic coordinates to the classical d'Alembert functional equation. For $c\neq 0$, one obtains hyperbolic or trigonometric branches, while $c=0$ yields the squared-logarithm family. Under the cost-function assumptions $F\ge 0$ and convexity, only the hyperbolic branch with $c>0$ remains. A unit log-curvature calibration selects the canonical value $c=2$, which yields the canonical reciprocal cost $F(x)=\tfrac12(x+x^{-1})-1$. For $c\neq0$, the result extends to $\mathbb{R}_{>0}^n$: every solution depends only on a single linear combination of coordinate logarithms; for $c=0$, the solution is a general quadratic form $\sum_{i,j}a_{ij}\ln x_i\ln x_j$. In either case, nontrivial coordinate-wise separable costs are excluded.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript establishes classification results for continuous functions F: R>0 → R with F(1)=0 obeying the functional equation F(xy)+F(x/y)=P(F(x),F(y)) where P is symmetric polynomial. Theorem 3.1 gives a degree-mismatch exclusion showing that deg P ≥ 3 admits no nonconstant continuous solutions provided the leading term does not cancel. Theorem 3.3 proves that any admissible quadratic P must be of the precise form 2u+2v+c uv (c∈R), reducing the equation in logarithmic coordinates to the classical d'Alembert equation; further restrictions under non-negativity, convexity, and unit log-curvature calibration select the canonical hyperbolic solution F(x)=½(x+x^{-1})−1. Multivariable extensions are stated for both the c≠0 and c=0 cases.
Significance. If the stated theorems hold, the work supplies a clean inevitability result: symmetry plus a quadratic bound on P forces the d'Alembert combiner, with explicit solution branches and a canonical normalization. The degree-exclusion criterion and the reduction to a well-studied equation are technically useful for related functional-equation problems in analysis and optimization.
major comments (1)
- [Theorem 3.1] Abstract, Theorem 3.1: the degree-mismatch exclusion is conditioned on non-cancellation of the leading homogeneous part of P. The manuscript should exhibit an explicit symmetric cubic (or higher) example where cancellation occurs and verify whether a continuous nonconstant F then exists; otherwise the proviso remains formally open.
minor comments (1)
- [Abstract] Abstract: the sentence 'the result extends to R>0^n' should specify whether the same continuity and F(1)=0 hypotheses are retained in the multivariable statement.
Simulated Author's Rebuttal
We thank the referee for the constructive comment on the degree-mismatch exclusion. The observation is well taken and we address it directly below.
read point-by-point responses
-
Referee: [Theorem 3.1] Abstract, Theorem 3.1: the degree-mismatch exclusion is conditioned on non-cancellation of the leading homogeneous part of P. The manuscript should exhibit an explicit symmetric cubic (or higher) example where cancellation occurs and verify whether a continuous nonconstant F then exists; otherwise the proviso remains formally open.
Authors: We agree that the proviso leaves an open question. The proof of Theorem 3.1 relies on a leading-term comparison that fails precisely when cancellation occurs; constructing (or ruling out) a continuous non-constant solution in the cancelled case would require a separate analysis that lies outside the quadratic-classification focus of the paper. In the revised manuscript we will insert a short remark immediately after the statement of Theorem 3.1 explicitly recording that the cancellation case remains open. revision: partial
Circularity Check
Derivation self-contained via logarithmic reduction
full rationale
The abstract describes a direct reduction of the given composition law to the classical d'Alembert equation by logarithmic substitution after establishing the quadratic form of P via degree-mismatch exclusion. This substitution is a standard change of variables that does not embed the target solution form into the premises, and no fitted parameters, self-citations, or definitional loops appear in the stated chain. The result is therefore independent of its inputs.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption F is continuous and non-constant on R>0 with F(1)=0
- domain assumption P is a symmetric polynomial whose leading homogeneous part does not cancel when deg≥3
Lean theorems connected to this paper
-
IndisputableMonolith.Foundation.DAlembert.Inevitabilitybilinear_family_forced matches?
matchesMATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.
For continuous nonconstant functions F:R>0→R with F(1)=0 satisfying the composition law with a symmetric polynomial P of degree at most two, the combiner is necessarily of the form P(u,v)=2u+2v+c uv, c∈R (Theorem 3.3.).
-
IndisputableMonolith.Cost.FunctionalEquationwashburn_uniqueness_aczel matches?
matchesMATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.
The equation reduces in logarithmic coordinates to the classical d'Alembert functional equation. For c≠0, one obtains hyperbolic or trigonometric branches, while c=0 yields the squared-logarithm family. Under the cost-function assumptions F≥0 and convexity, only the hyperbolic branch with c>0 remains. A unit log-curvature calibration selects the canonical value c=2, which yields the canonical reciprocal cost F(x)=½(x+x⁻¹)−1.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.