Complete monotonicity of log-functions
Rourou Ma, Julian Weigert
TL;DR
This work studies complete monotonicity on the positive orthant for the log-based function family $\mathcal{F}_s$, proving that for each fixed degree $n$ the finite-dimensional cone $\mathrm{CM}_{s,n}$ is linearly isomorphic to the nonnegative polynomial cone $\mathrm{Psd}_{s,n}$, hence $\mathrm{CM}_{s,n}$ is semialgebraic and testable in finite time. The key tool is a linear map $\mathcal{L}$ built from a matrix $A$ whose entries involve derivatives of the gamma function, yielding an explicit representation of $\mathcal{F}_{s,n}$ in terms of multivariate polynomials and enabling a PSD-based certificate via $A^{-1}$. Two complementary viewpoints are developed: a Laplace-transform criterion (via the Bernstein–Hausdorff–Widder–Choquet theorem) and an infinite-order-derivative framework that transfers CM to the nonnegativity of a limiting polynomial $\widetilde{g}_\infty$, connected to $\mathcal{L}^{-1}(f)$. The results provide a practical, finite-time algorithm for CM testing in this function family and open avenues for nested semialgebraic approximations, with potential applications to positivity constraints arising in scattering amplitudes and related physics.
Abstract
In this article we investigate the property of complete monotonicity within a special family $\mathcal{F}_s$ of functions in $s$ variables involving logarithms. The main result of this work provides a linear isomorphism between $\mathcal{F}_s$ and the space of real multivariate polynomials. This isomorphism identifies the cone of completely monotone functions with the cone of non-negative polynomials. We conclude that the cone of completely monotone functions in $\mathcal{F}_s$ is semi-algebraic. This gives a finite time algorithm to decide whether a function in $\mathcal{F}_s$ is completely monotone
