SearcharxivSearch

arXiv · 2603.16237

The d'Alembert Inevitability Theorem

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathan Washburn, Milan Zlatanović, Elshad Allahyarov. 2026-03-17. The d'Alembert Inevitability Theorem. https://arxiv.org/abs/2603.16237

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA