Positivity Certificates via Integral Representations
Khazhgali Kozhasov, Mateusz Micha{\l}ek, Bernd Sturmfels

TL;DR
This paper investigates positivity certificates for functions related to hyperbolic polynomials, establishing conditions for complete monotonicity using integral representations and hypergeometric functions, and proving parts of a conjecture by Scott and Sokal.
Contribution
It introduces a new approach to certifying complete monotonicity via Riesz kernels and hypergeometric functions, and proves the conjecture for elementary symmetric functions.
Findings
Complete monotonicity holds for sufficiently negative powers of elementary symmetric functions.
Small negative powers of these polynomials are not completely monotone.
The Riesz kernel is expressed as a hypergeometric function related to polytope volumes.
Abstract
Complete monotonicity is a strong positivity property for real-valued functions on convex cones. It is certified by the kernel of the inverse Laplace transform. We study this for negative powers of hyperbolic polynomials. Here the certificate is the Riesz kernel in Garding's integral representation. The Riesz kernel is a hypergeometric function in the coefficients of the given polynomial. For monomials in linear forms, it is a Gel'fand-Aomoto hypergeometric function, related to volumes of polytopes. We establish complete monotonicity for sufficiently negative powers of elementary symmetric functions. We also show that small negative powers of these polynomials are not completely monotone, proving one direction of a conjecture by Scott and Sokal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic and geometric function theory · Point processes and geometric inequalities · Mathematical functions and polynomials
Positivity Certificates via Integral Representations
Khazhgali Kozhasov, Mateusz Michałek and Bernd Sturmfels
Abstract.
Complete monotonicity is a strong positivity property for real-valued functions on convex cones. It is certified by the kernel of the inverse Laplace transform. We study this for negative powers of hyperbolic polynomials. Here the certificate is the Riesz kernel in Gårding’s integral representation. The Riesz kernel is a hypergeometric function in the coefficients of the given polynomial. For monomials in linear forms, it is a Gel’fand-Aomoto hypergeometric function, related to volumes of polytopes. We establish complete monotonicity for sufficiently negative powers of elementary symmetric functions. We also show that small negative powers of these polynomials are not completely monotone, proving one direction of a conjecture by Scott and Sokal.
1. Introduction
A real-valued function on the positive orthant is completely monotone if
[TABLE]
and for all index sequences of arbitrary length . In words, the function and all of its signed derivatives are nonnegative on the open cone .
While this definition makes sense for functions , we here restrict ourselves to a setting that is the natural one in real algebraic geometry. Namely, we consider functions
[TABLE]
where each is a homogeneous polynomial in variables that is positive on . The alternating sign in (1) implies that positive powers of a polynomial cannot be completely monotone. The real numbers will therefore be negative in most cases.
The signed -th order derivative in (1) for has the form where is a homogeneous polynomial. Saying that is completely monotone means that infinitely many polynomials are nonnegative on . How can this be certified?
To answer this question we apply the inverse Laplace transform to the function . Our goal is to find a function that is nonnegative on and that satisfies
[TABLE]
Here denotes Lebesgue measure and is the usual dot product. This integral representation certifies that is completely monotone, since it implies
[TABLE]
Our interest in the formula (3) derives from statistics and polynomial optimization. Certifying that a polynomial is nonnegative is an essential primitive in optimization. This can be accomplished by finding a representation as a sum of squares (SOS) or as a sum of nonnegative circuit polynomials (SONC). See e.g. [3] and [6] for introductions to these techniques. We here introduce an approach that may lead to new certificates.
Algebraic statistics [21] is concerned with probabilistic models that admit polynomial representations and are well suited for data analysis. The exponential families in [14] enjoy these desiderata. Using the formulation above, the distributions in an exponential family have supports in and probability density functions .
One natural class of instances arises when the factors in (2) are linear forms with nonnegative coefficients. An easy argument, presented in Section 3, furnishes the integral representation (3) and shows that is completely monotone. However, even this simple case is important for applications, notably in the algorithms for efficient volume computations due to Lasserre and Zerron [12, 13]. While that work was focused on polyhedra, the theory presented here promises a natural generalization to spectrahedra, spectrahedral shadows, and feasible regions in hyperbolic programming.
The present article is organized as follows. In Section 2 we replace by an arbitrary convex cone , and we recall the Bernstein-Hausdorff-Widder-Choquet Theorem. This theorem says that a certifcate (3) exists for every completely monotone function on , provided we replace by a Borel measure supported in the dual cone . We also discuss operations that preserve complete monotonicity, such as restricting to a linear subspace. Dually, this corresponds to pushing forward the representing measure.
In Section 3 we study the case of monomials in linear forms, seen two paragraphs above. Here the function is piecewise polynomial, for integers , it measures the volumes of fibers under projecting of a simplex onto a polytope. In general, we interpret as pushforward of a Dirichlet distribution with concentration parameters , thus offering a link to Bayesian statistics and machine learning.
Section 4 concerns the case in (2). In order for to be completely monotone, the polynomial must be hyperbolic and the exponent must be negative. The function is known as the Riesz kernel. It can be computed from the complex integral representation in Theorem 4.8 which is due to Gårding [7]. Following [14, Section 3] and [19, Section 4], we study the case when is the determinant of a symmetric matrix of linear forms. Here the Riesz kernel is related to the Wishart distribution.
Our primary objective is to develop tools for computing Riesz kernels, and thereby certifying positivity as in (1). Section 5 brings commutative algebra into our tool box. The relevant algebra arises from the convolution product on Borel measures. We are interested in finitely generated subalgebras and the polynomial ideals representing these. Elements in such ideals can be interpreted as formulas for Riesz kernels. In the setting of Section 3 we recover the Orlik-Terao algebra [15] of a hyperplane arrangement, but now realized as a convolution algebra of piecewise polynomial volume functions.
In Section 6 we give partial answers to questions raised in the literature, namely in [14, Conjecture 3.5] and in [19, Conjecture 1.11]. Scott and Sokal considered elementary symmetric polynomials , and they conjectured necessary and sufficient conditions on negative for complete monotonicity of . We prove the necessity of their conditions. We also show that is completely monotone for sufficiently negative exponents , and we explain how to build the Riesz kernel in this setting.
In Section 7 we view the Riesz kernel of as a function of the coefficients of the hyperbolic polynomial . In the setting of Section 3, when for linear forms , we examine the dependence of on the coefficients of the . These dependences are hypergeometric in nature. In the former case, the Riesz kernel satisfies the -hypergeometric system [17, Section 3.1], where is the support of . In the latter case, it is a Gel’fand-Aomoto hypergeometric function [17, Section 1.5]. This explains the computation in [14, Example 3.11], and it opens up the possibility to use D-modules as in [17, Section 5.3] or [22] for further developing the strand of research initiated here.
2. Complete Monotonicity
We now start afresh, by offering a more general definition of complete monotonicity. Let denote a finite-dimensional real vector space and an open convex cone in . Its closed dual cone is denoted . Points in are linear functions that are nonnegative on . We are interested in differentiable functions on the open cone that satisfy the following very strong notion of positivity.
Definition 2.1** (Complete monotonicity).**
A function is completely monotone if is -differentiable and, for all and all vectors , we have
[TABLE]
Here is the directional derivative along the vector . In this definition it suffices to assume that are extreme rays of . This is relevant when is polyhedral.
Example 2.2**.**
For and , the positive orthant, (4) is equivalent to (1). Moreover, if holds in Definition 2.1 then is completely monotone on too.
Since differentiation commutes with specialization, we have the following remark.
Remark 2.3*.*
Let be a linear subspace of such that is nonempty. If is completely monotone on , then the restriction is completely monotone on .
No polynomial of positive degree is completely monotone. Indeed, by Remark 2.3, it suffices to consider the case and . Derivatives of univariate polynomials cannot alternate their sign for . But, this is easily possible for rational functions.
Example 2.4**.**
Fix arbitrary negative real numbers . Then the function
[TABLE]
is completely monotone on . Remark 2.3 says that we may replace the by linear forms. We conclude that products of negative powers of linear forms are completely monotone on their polyhedral cones. This is the theme we study in Section 3.
The Bernstein-Hausdorff-Widder Theorem [23, Thm. ] characterizes completely monotone functions in one variable. They are obtained as Laplace transforms of Borel measures on the positive reals. This result was generalized by Choquet [4, Thm. ]. He proved the following theorem for higher dimensions and arbitrary convex cones .
Theorem 2.5** (Bernstein-Hausdorff-Widder-Choquet theorem).**
Let be a real-valued function on the open cone . Then is completely monotone if and only if it is the Laplace transform of a unique Borel measure supported on the dual cone , that is,
[TABLE]
Remark 2.6*.*
By the formula (5), any completely monotone function extends to a holomorphic function on the complex tube .
The if direction in Theorem 2.5 is seen by differentiating under the integral sign. Indeed, the left hand side of (4) equals the following function which is nonnegative:
[TABLE]
The integrand is a positive real number whenever and . The more difficult part is the only-if direction. Here one needs to construct the integral representation. This is precisely our topic of study in this paper, for certain functions .
The Borel measure in the integral representation (5) is called the Riesz measure when . As we shall see, its support can be a lower-dimensional subset of . But in many cases the Riesz measure is absolutely continuous with respect to Lesbesgue measure on , that is, there exists a measurable function such that
[TABLE]
The nonnegative function is called the Riesz kernel of . It serves as the certificate for complete monotonicity of , and our aim is to derive formulas for .
We next present a formula for the Riesz kernel in the situation of Example 2.4.
Proposition 2.7**.**
For any positive real numbers , we have
[TABLE]
Hence the Riesz kernel of is equal to .
Proof..
Recall the definition of the gamma function from its integral representation:
[TABLE]
Regarding as a constant, we perform the change of variables . This gives
[TABLE]
This is the case of the desired formula (7). The general case is obtained by multiplying distinct copies of the univariate formula (8). ∎
The Riesz kernel offers a certificate for a function to be completely monotone. This is very powerful because it proves that infinitely many functions are nonnegative on .
Example 2.8**.**
Let . Note that is positive on . We consider negative powers of this polynomial. The function is not completely monotone for . For instance, if then this is proved by
[TABLE]
Namely, the value of this function at the positive point is found to be
[TABLE]
Suppose now that . We claim that no such violation exists, i.e. the function is completely monotone. This is certified by exhibiting the Riesz kernel:
[TABLE]
Then the integral representation (5) holds with the Borel measure . A proof can be found in [19, Corollary 5.8]. We invite our readers to verify this formula.
We next discuss the implications of Remark 2.3 for the measure in (5). Suppose that holds for a cone in a vector space . We want to restrict to a subspace . The inclusion induces a projection , by restricting the linear form. The dual of the cone equals in the space . We are looking for a representation , . The measure is obtained from the measure by the general push-forward construction.
Definition 2.9**.**
Let be a measure on a set and a measurable function. The push-forward measure on is defined by setting , where is any measurable subset.
Example 2.10**.**
Suppose we are given a (measurable) function of real vector spaces and a measure with density on . Then .
The following results are straightforward from the definitions.
Proposition 2.11**.**
Let be completely monotone on a convex cone and the Riesz measure of . Then the Riesz measure of the restriction of to the subspace is the push-forward , where is the projection.
Corollary 2.12**.**
A function is completely monotone on the cone if and only if, for every , the function is completely monotone on . The Riesz measures transform accordingly under the linear transformation dual to .
3. Monomials in Linear Forms
Let be linear forms in variables and consider the open polyhedral cone
[TABLE]
The dual cone is spanned by in . A generator is an extreme ray of the cone if and only if the face is a facet of .
Proposition 3.1**.**
For any positive real numbers , the function
[TABLE]
is completely monotone on the cone . The Riesz measure of is the pushforward of the Dirichlet measure on the orthant under the linear map that takes the standard basis to the linear forms .
Proof..
The monomial is completely monotone on by Example 2.4. Our function is its pullback under the linear map that is dual to the map . The result follows from a slight extension of Proposition 2.11. In that proposition, the map would have been surjective but this is not really necessary. ∎
In what follows we assume that the dual cone is full-dimensional in . Then span . The case is discussed at the end of this section. There is a canonical polyhedral subdivision of , called the chamber complex. It is the common refinement of all cones spanned by linearly independent subsets of . Thus, for a general vector in , the chamber containing is the intersection of all halfspaces defined by linear inequalities that hold for . The collection of all chambers and their faces forms a polyhedral fan with support . That fan is the chamber complex of the map , which we regard as an -matrix.
Example 3.2**.**
Let , and consider the matrix
[TABLE]
The corresponding linear forms are the entries of the row vector . For any positive real numbers , we are interested in the function
[TABLE]
This is completely monotone on the pentagonal cone , consisting of all vectors where the five linear forms are positive. Its dual cone is also a pentagonal cone. The elements of are nonnegative linear combinations of the columns of .
The chamber complex of consists of full-dimensional cones. Ten of them are triangular cones. The remaining cone, right in the middle of , is pentagonal. It equals
[TABLE]
Returning to the general case, for each in the interior of , the fiber of the map is a convex polytope of dimension . The polytope is simple provided lies in an open cone of the chamber complex. All fibers lie in affine spaces that are parallel to . In the following we denote by the square root of the Gram determinant of a matrix , that is, .
Theorem 3.3**.**
The Riesz kernel of is a continuous function on the polyhedral cone that is homogeneous of degree . Its value at a point equals the integral of over the fiber with respect to -dimensional Lebesgue measure. If are integers then the Riesz kernel is piecewise polynomial and differentiable of order . To be precise, is a homogeneous polynomial on each cone in the chamber complex.
Proof..
We first consider the case . Here Proposition 2.7 says that
[TABLE]
The Riesz measure of this function is Lebesgue measure on , and its Riesz kernel is the constant function . The pushforward of this measure under the linear map is absolutely continuous with respect to Lebesgue measure on . The Riesz kernel of this pushforward is the function whose value at is the volume of the fiber divided by . This volume is a function in that is homogeneous of degree . Moreover, the volume function is a polynomial on each chamber and it is differentiable of order . This is known from the theory of splines; see e.g. the book by De Concini and Procesi [5]. This proves the claim since .
Next we let be arbitrary positive integers. We form a new matrix from by replicating identical columns from the column of . Thus the number of columns of is . The matrix represents a linear map from onto the same cone as before, and also the chamber complex of remains the same. However, its fibers are polytopes of dimension , which is generally larger than . We now apply the argument in the previous paragraph to this map. This gives the asserted result, namely the Riesz kernel is piecewise polynomial of degree , and is differentiable of order across walls of the chamber complex.
We finally consider the general case when the are arbitrary positive real numbers. The formula for the Riesz kernel follows by Proposition 3.1. The homogeneity and continuity properties of the integral over hold here as well, because this function is well-defined and positive on each fiber . ∎
Example 3.4**.**
Let , and . Here and the chamber complex is the division into three cones defined by the lines and . The corresponding monomial in linear forms has the integral representation
[TABLE]
For , the Riesz kernel is the piecewise quadratic function
[TABLE]
The three binary quadrics measure the areas of the convex polygons . These polygons are triangles, quadrilaterals and triangles, in the three cases. Note that is differentiable. For small values of , it is instructive to work out the piecewise polynomials of degree for all cases when with .
We have shown that the reciprocal product of linear forms is the Laplace transform of the piecewise polynomial function which measures the volumes of fibers of :
[TABLE]
The volume function can be recovered from this formula by applying the inverse Laplace transform. This technique was applied by Lasserre and Zerron [12, 13] to develop a surprisingly efficient algorithm for computing the volumes of convex polytopes.
Example 3.5**.**
Fix the matrix in Example 3.2, and consider any vector in the central chamber (11). The fiber is a pentagon. Its vertices are the rows of
[TABLE]
The Riesz kernel is given by the area of this pentagon:
[TABLE]
Similar quadratic formulas hold for the Riesz kernel on the other ten chambers.
Remark 3.6*.*
Proposition 3.1 also applies in the case when do not span . Here the cone is lower-dimensional. The Riesz measure is supported on that cone. There is no Riesz kernel in the sense above. But, we can still consider the volume function on the cone . If , then is a negative power of a single linear form. This function is completely monotone on the half-space . The cone is the ray spanned by . The Riesz measure is absolutely continuous with respect to Lebesgue measure on that ray, with density , cf. (8).
4. Hyperbolic Polynomials
We now return to the setting of Section 2 where we considered negative powers of a homogeneous polynomial. We saw in Section 3 that this is completely monotone if is a product of linear forms. For which polynomials and which can we expect such a function to be completely monotone? We begin with a key example.
Fix an integer , set , and let be a symmetric matrix of unknowns. Its determinant is a homogeneous polynomial of degree in the . We write for the open cone in consisting of all positive definite matrices. Up to closure, this cone is self-dual with respect to the trace inner product . Thus, is the closed cone of positive semidefinite (psd) matrices in .
Theorem 4.1** (Scott-Sokal [19]).**
Let . The function is completely monotone on the cone of positive definite symmetric matrices if and only if
[TABLE]
Proof..
The if-direction of this theorem is a classical result in statistics, as we explain below. We define a probability distribution on the space of matrices as follows: each column is chosen independently at random with respect to the -variate normal distribution with mean zero and covariance matrix . The Wishart distribution is the push-forward of the distribution to the space of symmetric matrices, by the map . Since is always psd, the Wishart distribution is supported on the closure of . There are two main cases one needs to distinguish.
If , then the matrix has full rank with probability one. Hence, the support of the Wishart distribution coincides with . An explicit formula for the Riesz measure can be derived from the Wishart distribution. This is explained in detail in [14, Proposition 3.8]. Setting , the Riesz kernel for is equal to
[TABLE]
This formula holds whenever . It proves that is completely monotone on for this range of .
If then the matrix has rank at most . Hence the Wishart distribution is supported on the subset of psd matrices of rank at most . We have
[TABLE]
Let . Multiplying both sides in the formula above by , we obtain
[TABLE]
Here are the columns of an matrix . Hence we may rewrite this formula as
[TABLE]
This establishes complete monotonicity of , , for . Indeed, we realized the Riesz measure on as the push-forward of the (scaled) Lebesgue measure on the space of matrices under the map . The only-if direction of Theorem 4.1 is due to Scott and Sokal [19, Theorem 1.3]. ∎
According to Remark 2.3, the restriction of a completely monotone function to a linear subspace gives a completely monotone function. We thus obtain completely monotone functions by restricting the determinant function to linear spaces of symmetric matrices. This can be constructed as follows. Fix linearly independent symmetric matrices such that the following spectrahedral cone is non-empty:
[TABLE]
Its dual is the image of the cone of psd matrices under the linear map that is dual to the inclusion . Such a cone is known as a spectrahedral shadow. The following polynomial vanishes on the boundary of :
[TABLE]
Corollary 4.2**.**
Let or . Then the function is completely monotone on the spectrahedral cone and its Riesz measure is the push-forward of the Riesz measure from the proof of Theorem 4.1 under the map .
Consider the case when are diagonal matrices. Here the polynomial is a product of linear forms, and we are in the situation of Section 3. For general symmetric matrices , the fibers are spectrahedra and not polytopes. If then the Riesz kernel exists, and its values are found by integrating (13) over the spectrahedra . In particular, if , then the value of the Riesz kernel equals, up to a constant, the volume of the spectrahedron . The role of the chamber complex is now played by a nonlinear branch locus. It would be desirable to compute explicit formulas, in the spirit of Examples 3.4 and 3.5, for these spectrahedal volume functions.
Example 4.3**.**
Let and write for the cone of positive definite matrices
[TABLE]
This space of matrices is featured in [20, Example 1.1] where it serves the prominent role of illustrating the convex algebraic geometry of Gaussians. Let be the determinant of (15). Cross sections of the cone and its dual are shown in the middle and right of [20, Figure 1]. The fibers are the -dimensional spectrahedra shown on the left in [20, Figure 1]. Their volumes are computed by the Riesz kernel for .
We have seen that determinants of symmetric matrices of linear forms are a natural class of polynomials admitting negative powers that are completely monotone. Which other polynomials have this property? The section title reveals the answer.
Definition 4.4**.**
A homogeneous polynomial is hyperbolic for a vector if and, for any , the univariate polynomial has only real zeros. Let be the connected component of the set that contains . If is hyperbolic for , then it is hyperbolic for all vectors in . In that case, is an open convex cone, called the hyperbolicity cone of . Equivalently, a homogeneous polynomial is hyperbolic with hyperbolicity cone if and only if for any vector in the tube domain in the complex space .
Example 4.5**.**
The canonical example of a hyperbolic polynomial is the determinant of a symmetric matrix . Here we take to be the identity matrix. Then is the cone of positive definite symmetric matrices. Hyperbolicity holds because the roots of are the eigenvalues of , and these are all real.
Example 4.6**.**
The restriction of a hyperbolic polynomial to a linear subspace is hyperbolic, provided intersects the hyperbolicity cone of . Therefore the polynomials in (14) are all hyperbolic. In particular, any product of linear forms is hyperbolic, if we take the hyperbolicity cone to be the polyhedral cone in (9).
The following result states that hyperbolic polynomials are precisely the relevant class of polynomials for our study of positivity certificates via integral representations.
Theorem 4.7**.**
Let be a homogeneous polynomial that is positive on an open convex cone in , and such that the power is completely monotone on for some . Then is hyperbolic and its hyperbolicity cone contains .
Proof..
This follows from [19, Corollary 2.3] as explained in [14, Theorem 3.3]. ∎
A hyperbolic polynomial with hyperbolicity cone is called complete if is pointed, that is, the dual cone is -dimensional. In the polyhedral setting of Proposition 3.1, this was precisely the condition for the Riesz kernel to exist. This fact generalizes. The following important result due to Gårding [7, Theorem 3.1] should give a complex integral representation of Riesz kernels for arbitrary hyperbolic polynomials.
Theorem 4.8** (Gårding).**
Let be a complete hyperbolic polynomial with hyperbolicity cone . Fix a vector and a complex number with , and define
[TABLE]
where . Then is independent of the choice of and vanishes when . If then has continuous derivatives of order as a function of , and is analytic in for fixed . Moreover,
[TABLE]
The function looks like a Riesz kernel for . However, it might lack one crucial property: we do not yet know whether is nonnegative for . If this holds then is completely monotone, (16) gives a formula for the Riesz kernel of , and (17) is the integral representation of that is promised in Theorem 2.5.
Remark 4.9*.*
The condition is only sufficient for to be a well-defined function. However, for any hyperbolic and any , the formula (16) defines a distribution on ; see [2, Section 4]. If nonnegative, then this is the Riesz measure.
The following conjecture is important for statistical applications of the models in [14].
Conjecture 4.10** (Conjecture in [14]).**
Let be a complete hyperbolic polynomial with hyperbolicity cone . Then there exists a real such that in (16) is nonnegative on the dual cone . In particular, is a Riesz kernel.
Conjecture 4.10 holds true for all hyperbolic polynomials that admit a symmetric determinantal representation, by Corollary 4.2. This raises the question whether such a representation exists for every hyperbolic polynomial. The answer is negative.
Example 4.11** ().**
Consider the specialized Vámos polynomial in [10, Section 3]:
[TABLE]
It is known that no power of admits a symmetric determinantal representation.
Example 4.12**.**
For any the th elementary symmetric polynomial is hyperbolic with respect to . The hyperbolicity cone of contains the orthant . It is known that has no symmetric determinantal representation when , see [11, Example 5.10] for a proof. Exponential varieties associated with are studied in [14, Section 6].
In Section 6 we prove Conjecture 4.10 for all elementary symmetric polynomials. This is nontrivial because Corollary 4.2 does not apply to when . Scott and Sokal [19] gave a conjectural description of the set of parameters for which the function is completely monotone on . For a warm-up see Example 2.8.
Conjecture 4.13** (Conjecture in [19]).**
Let . Then is completely monotone on the positive orthant if and only if or .
Scott and Sokal settled Conjecture 4.13 for . However, they “have been unable to find a proof of either the necessity or the sufficiency” in general, as they stated in [19, page 334]. In Section 6 we prove the only if direction of Conjecture 4.13.
Remark 4.14*.*
The positive orthant is strictly contained in the hyperbolicity cone of the elementary symmetric polynomial unless . The next proposition ensures that we can replace by the hyperbolicity cone in the formulation of Conjecture 4.13.
Proposition 4.15**.**
Let be a hyperbolic polynomial with hyperbolicity cone and let be an open convex subcone. Then, for any fixed , the function is completely monotone on if and only if it is completely monotone on the subcone .
Proof..
The only if direction is obvious. For the if direction, we argue as follows. For any , by results in [2, Section 2], the function is the Laplace transform of a distribution supported on . For this already follows from Theorem 4.8. If is completely monotone on an open subcone , then, by Theorem 2.5, it is the Laplace transform of a unique Borel measure supported on . But since and since the Laplace transform on the space of distributions supported on is injective [18, Proposition 6], the above implies that this Borel measure is supported on . We thus conclude that is completely monotone on by Theorem 2.5. ∎
5. Convolution Algebras
In this section we examine the convolution of measures supported in a cone. This is a commutative product. It is mapped to multiplication of functions under the Laplace transform. We obtain isomorphisms of commutative algebras between convolution algebras of Riesz kernels and algebras of functions they represent. This allows to derive relations among Riesz kernels of completely monotone functions. In the setting of Section 3, we obtain a realization of the Orlik-Terao algebra [15] as a convolution algebra.
As before, we fix an open convex cone in . We write for the set of locally compact Borel measures that are supported in the closed dual cone . These hypotheses on the measures stipulate that for any compact set , and for any Borel set .
Remark 5.1*.*
The set is a convex cone. In symbols, if and , then .
Given two measures , one defines their convolution as follows:
[TABLE]
where is any Borel subset and denotes its characteristic function.
Lemma 5.2**.**
If then . The convolution is commutative and associative, that is, and for .
Proof..
The first statement holds because the preimage of a compact set under the addition map is compact. This ensures that is a locally compact Borel measure supported in . The second statement, namely commutativity and associativity of the convolution, follows from Tonelli’s Theorem. ∎
We can also check that the convolution product is distributive with respect to addition of measures. In light of Remark 5.1 and Lemma 5.2, this means that \bigl{(}\mathcal{M}_{+}(C),+,*\bigr{)} is a semiring. We turn it into a ring by the following standard construction. Let denote the set of all -linear combinations of measures in . Then we extend the convolution (18) by bilinearity to .
We conclude that \bigl{(}\mathcal{M}(C),+,*\bigr{)} is a commutative -algebra. If we are given a finite collection of measures in , then the subalgebra they generate is the quotient of a polynomial ring modulo an ideal . In this representation, the tools of computer algebra, such as Gröbner bases, can be applied to the study of measures.
Example 5.3**.**
Let and . Fix rational numbers and let be the measure in with density . Additive relations among the translate into multiplicative relations among the . This follows from Example 5.8 below. The algebra generated by these measures is isomorphic to that generated by the monomials . For instance, if and for then
[TABLE]
The convolution product has a nice interpretation in probability theory.
Remark 5.4*.*
Let and be independent random variables with values in the cone , and let and be their probability measures. Then the probability measure of their sum is the convolution of the two measures, that is,
[TABLE]
The convolution of probability measures corresponds to adding random variables.
It is instructive to verify this statement when the random variables are discrete.
Example 5.5** ().**
Let and be independent Poisson random variables with parameters respectively. Thus and are atomic measures supported on the set of nonnegative integers, with for . Then
[TABLE]
Hence is a Poisson random variable with parameter . This fact is well-known in probability. In this example, and .
Let . If the integral
[TABLE]
converges for all , we say that has a Laplace transform .
Remark 5.6*.*
By the Bernstein-Hausdorff-Widder-Choquet Theorem 2.5, the Laplace transform is a completely monotone function on , and if then .
The Laplace transform takes convolutions of measures to products of functions.
Proposition 5.7**.**
If have Laplace transforms, then so does , and
[TABLE]
In particular, the product of two completely monotone functions on is completely monotone, and its Riesz measure is the convolution of the individual Riesz measures.
Proof..
The definition in (18) and Tonelli’s Theorem imply that, for any ,
[TABLE]
The assertion in the second sentence follows from Theorem 2.5 and Remark 5.6. ∎
Example 5.8**.**
Fix and let be the measure on with density . By equation (8), its Laplace transform is the monomial . Thus the assignment gives the isomorphism of -algebras promised in Example 5.3.
Here we are tacitly using the following natural extension of the Laplace transform from the semiring to the full -algebra . If , where the measures have Laplace transforms, then .
Now, let be measures in that have Laplace transforms. We write for the -algebra they generate with respect to the convolution product . This is a subalgebra of the commutative algebra . By Proposition 5.7, the Laplace transform is an algebra homomorphism from into the algebra of -functions on . Moreover, by Remark 5.6, this homomorphism has trivial kernel.
This construction allows us to transfer polynomial relations among completely monotone functions to polynomial relations among their Riesz kernels, and vice versa. In the remainder of this section, we demonstrate this for the scenario in Section 3.
Fix linear forms and let be the polyhedral cone they define. For all , and all with , we have
[TABLE]
Let be the Lebesgue measure on the ray , viewed as a measure on . By (23), the Laplace transform of this measure is the reciprocal linear form:
[TABLE]
The subalgebra of generated by is isomorphic, via Laplace transform, to the subalgebra of the algebra of rational functions on generated by . This algebra was introduced in [15]. It is known as the Orlik-Terao algebra of .
Corollary 5.9**.**
The convolution algebra is isomorphic to the Orlik-Terao algebra, and therefore to , where is the Proudfoot-Speyer ideal in [16]. Its monomials , where runs over multisubsets of linear forms that span , are the piecewise polynomial volume functions in Theorem 3.3.
Indeed, Proudfoot and Speyer [16] gave an excellent presentation of the Orlik-Terao algebra by showing that the circuit polynomials form a universal Gröbner basis of .
Example 5.10** ().**
Let be the linear forms in Example 3.2. Then
[TABLE]
where the Proudfoot-Speyer ideal is generated by its universal Gröbner basis
[TABLE]
Note that these five cubics are the circuits in . The monomial in the convolution algebra (24) represents the piecewise quadratic function in Example 3.5.
6. Elementary Symmetric Polynomials
In this section we study complete monotonicity of inverse powers of the elementary symmetric polynomials . In Theorem 6.4 we prove Conjecture 4.10 for this special class of hyperbolic polynomials. In Theorem 6.6 we prove the only if direction of Conjecture 4.13. These results resolve questions raised by Scott and Sokal in [19].
Our first goal is to show that sufficiently negative powers of are completely monontone. We begin with a lemma by Scott and Sokal which is derived from Theorem 2.5.
Lemma 6.1** (Lemma in [19]).**
Fix , an open convex cone , and functions . The function is completely monotone on if and only if is completely monotone on for all .
Remark 6.2*.*
If is a homogeneous polynomial, then both conditions above are equivalent to complete monotonicity of for and some .
We also need the following generalization of Lemma in [19].
Lemma 6.3**.**
Fix two cones and and . Let be functions on such that is completely monotone on with Riesz kernel . Let be a completely monotone function on with Riesz kernel . Then the function is completely monotone on , with Riesz kernel
[TABLE]
Proof..
By Theorem 2.5, our functions admit the following integral representations:
[TABLE]
From the first equation we get
[TABLE]
For fixed we have . This follows from (8) by setting and changing the variable of integration to . By comparing the two integral representations of , and by using the injectivity of the Laplace transform, we find
[TABLE]
Substituting this expression into (26), we obtain
[TABLE]
All functions we consider are nonnegative, so we can apply Tonelli’s Theorem and get
[TABLE]
The parenthesized expression is the desired Riesz kernel in (25). ∎
We are now ready to prove Conjecture 4.10 for elementary symmetric polynomials. Our proof is constructive, i.e., it yields an explicit formula for the associated Riesz kernel (16). However, the construction is quite complicated, as Example 6.5 shows.
Theorem 6.4**.**
For any elementary symmetric polynomial , where , there exists a real number such that is completely monotone for all .
Proof..
If or , then is completely monotone on for any (see, e.g., Proposition 2.7). Also, by [19, Corollary 1.10], is completely monotone for . For we proceed by induction on . We have
[TABLE]
where and the other variables in (27) are . We apply Lemma 6.1.
We must prove that there exists such that, for all and all ,
[TABLE]
One can derive the following factorization, which holds for any fixed :
[TABLE]
where . The hat means that is omitted. We claim that, for each , the function is completely monotone on provided . Then, by Proposition 5.7, the product (29) is completely monotone on for , and we take .
Now, by symmetry, it suffices to show that is completely monotone. This is equivalent, by Lemma 6.1, to complete monotonicity of , where . By (27), . This implies
[TABLE]
Fix any . We apply Lemma 6.3 to the functions and . By [19, Corollary 1.10] and the induction hypothesis respectively, these are completely monotone. This implies the claim that is completely monotone. ∎
The first new case of complete monotonicity concerns large negative powers of .
Example 6.5**.**
We here illustrate our proof of Theorem 6.4 by deriving the Riesz kernel for from its steps. By [19, Corollary 1.10], the functions and are completely monotone for any . By [19, Corollary 5.8], their Riesz kernels are
[TABLE]
We apply Lemma 6.3 to with , and to with . We conclude that
[TABLE]
is completely monotone for . It has the Riesz kernel
[TABLE]
By Lemma 6.1 applied to (32), we derive, for any , the complete monotonicity of
[TABLE]
Proceeding as in the proof of Lemma 6.3, we express its Riesz kernel as follows
[TABLE]
In the same way one obtains complete monotonicity, for any , of the functions
[TABLE]
To obtain their Riesz kernels , we exchange with in (34). Multiplying the four functions together, we obtain complete monotonicity of
[TABLE]
The Riesz kernel of (38) is written as . By Proposition 5.7, this is the convolution of , , and . By applying Lemma 6.1 to (38) we derive complete monotonicity of for . Lemma 6.3 yields the formula
[TABLE]
for the Riesz kernel of . We note that is symmetric in its five arguments.
We now come to our second main result in this section, namely the only if direction in Conjecture 4.13. This was posed by Scott and Sokal. Note that Conjecture 4.13 holds for since , with Riesz kernel for all negative powers given in Proposition 2.7. We now prove that the condition from Conjecture 4.13 is necessary for to be completely monotone on the positive orthant .
Theorem 6.6**.**
Let . If is completely monotone, then or .
Proof..
The proof is by induction on . The base case was already established in [19, Corollary 1.10]. Assume that is completely monotone on . Then
[TABLE]
For large , the sign of any derivative with respect to of the functions , , and , , is the same (see [19, Lemma 3.1]). It follows that is completely monotone. Hence, by induction, we have . This completes the proof of Theorem 6.6. ∎
7. Hypergeometric Functions
In (2) we started with , where is a polynomial in . This expression can be viewed as a function in three different ways. First of all, it is a function in , with domain . Second, it is a function in , with domain a subset of . And, finally, we can view as function in the coefficients of the polynomials . It is this third interpretation which occupies us in this final section.
Let us begin with the case and consider , for some hyperbolic polynomial
[TABLE]
Here is a subset of whose elements have a fixed coordinate sum . We fix such that is completely monotone. We assume that has Riesz kernel , which we consider as a function of the coefficient vector .
Let denote the Weyl algebra on the -dimensional affine space whose coordinates are the coefficients in (41). We briefly recall (e.g. from [17]) the definition of the -hypergeometric system with parameters .
The system is the left ideal in generated by two sets of differential operators:
- •
the Euler operators , where ;
- •
the toric operators , where are nonnegative integers satisfying . Here it suffices to take a Markov basis [21] for .
It is known (cf. [17, Chapter 4]) that is regular holonomic and its holonomic rank equals for generic parameters . A sufficiently differentiable function on an open subset of or is called -hypergeometric if it is annihilated by the toric operators. It is -homogeneous of degree if it annihilated also by the Euler operators.
Proposition 7.1**.**
The Riesz kernel of is -hypergeometric in the coefficients of the polynomial as in (41). However, it is generally not -homogeneous.
Proof..
We use Gårding’s integral representation of given in Theorem 4.8. The toric operators annihilate since we can differentiate with respect to under the integral sign. The fact that the Riesz kernel is generally not -homogeneous in can be seen from the explicit formula for quadratic forms given in [19, Proposition 5.6]. ∎
We now start afresh and develop an alternative approach for products of linear forms, as in Section 3. The history of hypergeometric functions dates back to 17th century, and there are numerous possible definitions. We describe the approach of Aomoto and Gel’fand [1, 8, 9], albeit in its simplified form via local coordinates on the Grassmannian.
Consider an matrix , with , where the first submatrix is the identity. Fix complex numbers that sum to . The hypergeometric function with parameters is the function in the unknowns defined by:
[TABLE]
We integrate over the unit sphere against the standard measure . Here, for . The integral in (42) is convergent if . For other values of the hypergeometric function is defined via analytic continuation, see [8] for details. One checks that the following partial differential operators annihilate :
- (1)
Column homogeneity gives the operators . 2. (2)
Row homogeneity gives the operators . 3. (3)
We have the toric operators .
This means that the function is -hypergeometric, in the sense defined above, if we take to be the vertex set of the product of standard simplices .
Example 7.2** ().**
Fix and consider the matrix
[TABLE]
The hypergeometric function is obtained by integrating a product of four functions, each of which is zero on a half-plane. Hence the integrand is supported on a cone defined by two out of four linear functions. Which functions these are, depends on the values of . The integral over the circle is an integral over a circular arc, specified by . This can be written as an integral over a segment in . For instance, consider the range of parameters given by and . The boundary lines of the cone are and . This is shown in Figure 1.
Integrating along the segment between and , we obtain the formula
[TABLE]
This integral can be expressed via the classical Gauss hypergeometric function
[TABLE]
We assume for simplicity that . Performing easy integral transformations, given that and satisfy the assumed inequalities, we obtain:
[TABLE]
Below we present an example involving three linear forms in two variables. Here the Riesz kernel is expressed in terms of the classical Gauss hypergeometric function .
Example 7.3**.**
Let with hyperbolicity cone , where . We consider the function , where . Then
[TABLE]
For the general case, let be linear forms on which span a full-dimensional pointed cone in . After a linear change of coordinates, we can assume that is a basis of , and that each other has coordinates in that basis. Consider the projection . The kernel of this linear map is spanned by the rows of the following matrix:
[TABLE]
We extend the above matrix to an matrix by adding a first column and a first row that encodes the vector of unknowns:
[TABLE]
The -st column in the above matrix is associated to the linear form , and hence we may associate to it the parameter . We finally define by the equality . The following formula gives an alternative perspective on Theorem 3.3.
Theorem 7.4**.**
Using the notation above, the Riesz kernel for equals
[TABLE]
where the numerator is the Aomoto-Gel’fand hypergeometric function defined in (42).
Proof..
By the results of Gel’fand and Zelevinsky in [9], the function satisfies
[TABLE]
This derivation is non-trivial. Here, is the linear projection taking the standard basis to the linear forms . Comparing this expression with the formula for the Riesz kernel given in Theorem 3.3, we obtain the claimed result. ∎
Theorem 7.4 serves a blueprint for other completely monotone functions (2). We are optimistic that future formulas for Riesz kernels will be inspired by Proposition 7.1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. Aomoto and M. Kita: Theory of Hypergeometric Functions , Springer, New York, 1994
- 2[2] M. Atiyah, R. Bott, and L. Gårding: Lacunas for hyperbolic differential operators with constant coefficients. I, Acta Math. 131 (1973) 145–206.
- 3[3] G. Blekherman, P. Parrilo and R. Thomas: Semidefinite Optimization and Convex Algebraic Geometry , MOS-SIAM Series on Optimization 13 , 2012.
- 4[4] G. Choquet: Deux exemples classiques de représentation intégrale, L’Enseignement Mathématique 15 (1969) 63–75.
- 5[5] C. De Concini and C. Procesi: Topics in Hyperplane Arrangements, Polytopes and Box-Splines , Universitext, Springer, New York, 2010.
- 6[6] M. Dressler, S. Iliman and T. de Wolff: A positivstellensatz for sums of nonnegative circuit polynomials, SIAM Journal on Applied Algebra and Geometry 1 (2017) 536–555.
- 7[7] L. Gårding: Linear hyperbolic partial differential equations with constant coefficients, Acta Mathematica 85 (1951) 1–62.
- 8[8] I.M. Gel’fand: General theory of hypergeometric functions, Dokl. Akad. Nauk SSSR 288 (1986) 14–18.
