Linear Principal Minor Polynomials: hyperbolic determinantal inequalities and spectral containment
Abstract.
A linear principal minor polynomial or lpm polynomial is a linear combination of principal minors of a symmetric matrix. By restricting to the diagonal, lpm polynomials are in bijection to multiaffine polynomials. We show that this establishes a one-to-one correspondence between homogeneous multiaffine stable polynomials and PSD-stable lpm polynomials. This yields new construction techniques for hyperbolic polynomials and allows us to generalize the well-known Fisher–Hadamard and Koteljanskii inequalities from determinants to PSD-stable lpm polynomials. We investigate the relationship between the associated hyperbolicity cones and conjecture a relationship between the eigenvalues of a symmetric matrix and the values of certain lpm polynomials evaluated at that matrix. We refer to this relationship as spectral containment.
1. Introduction
A homogeneous polynomial is called hyperbolic with respect to if and has only real roots for all . The hyperbolicity cone of a polynomial hyperbolic with respect to is the set of all such that has only nonnegative roots. Originally conceived in the context of partial differential equations [10], hyperbolic polynomials were discovered to yield deep results in (non-)linear algebra, combinatorics, and optimization; see, for example, [1, 2, 3, 24, 26, 29].
A fundamental family of hyperbolic polynomials is given by the elementary symmetric polynomials
where ranges over all -element subsets of . The elementary symmetric polynomials are stable: a multivariate polynomial is stable if for all complex numbers lying in the open upper half-plane, we have . If is homogeneous, then it is stable if and only if it is hyperbolic with respect to all , and we denote by its hyperbolicity cone with respect to the vector .
Let denote an matrix of indeterminants, and for any , we let denote the principal submatrix of indexed by . We can then define a polynomial
where again ranges over all -element subsets of . It turns out that these polynomials do not vanish on the Siegel upper half-plane, i.e., the set of all complex symmetric matrices with positive definite imaginary part. Such polynomials are called Dirichlet–Gårding [13] or PSD-stable [16]. For a homogeneous polynomial this property is equivalent to being hyperbolic with respect to any positive definite matrix, and we denote by its hyperbolicity cone (taken with respect to the identity matrix). When the context is clear, we will simply refer to PSD-stable polynomials as stable polynomials.
The starting point of our paper is the observation that is closely related to . For instance, if is the diagonal matrix with diagonal entries , then . To generalize this observation, let be the vector space of real symmetric -matrices and let be the ring of polynomials on it, where we regard as being an matrix of indeterminants. A polynomial is called a linear principal minor polynomial or lpm-polynomial if is of the form
where ranges over all subsets of . The first natural question we pursue is what interesting properties are shared by a homogeneous lpm polynomial and its diagonal restriction . We show that is PSD-stable if and only if is stable. We obtain a similar result for the related concept of Lorentzian polynomials. We prove these facts using the theory of stability preservers [5].
Having established these basic facts we generalize classical determinantal inequalities from linear algebra, such as the Hadamard–Fischer and Koteljanskii inequality to the setting of stable lpm polynomials. This generalizes the Hadamard-type inequalities for -positive matrices obtained in [21]. Another interesting consequence of the above results is that they give construction of a new class of hyperbolic polynomials. Using lpm polynomials we construct a hyperbolic cubic in 6 variables which has a Rayleigh difference that is not a sum of squares. The previously smallest known example with variables was contructed by Saunderson in [27]. Finally, we study whether the eigenvalue vector of a matrix lying in the hyperbolicity cone of a stable lpm polynomial lies in the hyperbolicity cone of and show how this is related to a potential generalization of the classical Schur–Horn theorem [28, 14]. We now discuss our results in detail.
2. Our results in detail
Our discussion of lpm polynomials can also be viewed from a different perspective. A polynomial is multi-affine if it is a linear combination of square-free monomials for . We define a linear map from the vector subspace of multi-affine polynomials in to the vector space of lpm polynomials, which we call the minor lift map, as follows. The minor lift of
is the polynomial given by
We note that and that is homogeneous if and only if is homogeneous. When it is unambiguous, we will use lower case letters such as to denote homogeneous, multiaffine , and use the corresponding upper case letters for the minor lift, so that is equal to .
2.1. Properties of the minor lift map and constructions
Our first result is that the minor lift map sends stable polynomials to PSD-stable polynomials. Stronger even, let us call a matrix -locally PSD if every principal -submatrix of is positive semidefinite. The collection of -locally PSD matrices is a closed convex cone and .
Theorem 2.1.
Let be a homogeneous multiaffine polynomial of degree . If is stable, then is hyperbolic with . In particular, is PSD-stable.
For , let be the projection to the diagonal. A first implication for the associated hyperbolicity cones is as follows.
Corollary 2.2.
Let be a homogeneous multiaffine stable polynomial and . If , then and .
Using Theorem 2.1, we are able to construct new interesting hyperbolic polynomials. Given a hyperbolic polynomial and points in the hyperbolicity cone of , the Rayleigh difference is a polynomial nonnegative on [19]. If the polynomial is not a sum of squares, this has interesting implications for determinantal representations as well as a hyperbolic certificate of nonnegativity of which cannot be recovered by sums of squares. Saunderson [27] characterized all pairs for which there exists such a hyperbolic polynomial of degree , except when , where the smallest known example with a Rayleigh difference that is not a sum of squares depends on 43 variables. We are able to reduce the number of variables to 6. See Section 6 for more details.
Theorem 2.3.
There exists an (explicit) degree-3 hyperbolic polynomial in variables and vectors such that the Rayleigh difference is not a sum-of-squares.
2.2. Hyperbolic determinantal inequalities
We generalize some well known theorems from linear algebra to the setting of lpm polynomials. Note that the cone of positive semidefinite matrices is precisely the hyperbolicity cone of , which is the minor lift of . For our generalizations, we replace the determinant by the minor lift of a homogeneous multiaffine stable polynomial, and the cone of positive semidefinite matrices by the hyperbolicity cone of the minor lift.
Hadamard’s inequality is a classical result comparing the determinant of any positive semidefinite matrix with the product of its diagonal entries.
Theorem (Hadamard’s inequality).
Let be a positive semidefinite matrix, then .
An equivalent statement of this inequality is as follows: if is any, not necessarily symmetric, real -matrix with columns , then . This yields a geometric interpretation, since the absolute value of determinant is the volume of an -dimensional parallelepiped with edges .
Fischer’s inequality generalizes Hadamard’s inequality, and relates the determinant of a positive semidefinite matrix to its principal minors. Let be a partition of the set into disjoint subsets. Given such a partition, we write if for some . Let be the vector space of symmetric matrices that are block diagonal with respect to
Let be the orthogonal projection from onto the subspace .
Theorem (Fischer’s inequality).
Let be a positive semidefinite matrix. Then
Observe that Hadamard inequality is simply Fischer’s inequality with partition . We now give a hyperbolic generalization of Fischer-Hadamard inequality. For , our hyperbolic Hadamard inequality was obtained in [21].
Theorem 2.4 (Hyperbolic Fischer–Hadamard inequality).
Let be a homogeneous PSD-stable lpm-polynomial and a partition. Then
holds for all .
The classical Fischer–Hadamard inequality is a consequence of a more general inequality known as Koteljanskii’s inequality, which handles the case of overlapping blocks [17].
Theorem (Koteljanski’s inequality).
Let and be two subsets of and be a positive semidefinite matrix. Then
While we were not able to generalize Koteljanskii’s inequality in a way that implies the hyperbolic Fischer–Hadamard inequality, we found a hyperbolic generalization of Koteljanskii’s inequality, which uses a different interpretation of what it means to take a minor of a matrix.
Definition 2.5.
Given a degree homogeneous lpm polynomial and with , we define the restriction
where we take partial derivative with respect to diagonal variables not in .
With this definition we can state the hyperbolic Koteljanskii inequality, which is related to the negative lattice condition in [6]:
Theorem 2.6 (Hyperbolic Koteljanskii inequality).
Let be a homogeneous PSD-stable lpm-polynomial and . Then
holds for all .
2.3. Spectral containment property
If is an symmetric matrix, we say that is an eigenvalue vector of if the entries of are precisely the eigenvalues of with appropriate multiplicities. Note that the set of eigenvalue vectors of a symmetric matrix are invariant under permutations.
We recall the example of the -th elementary symmetric polynomial and its minor lift from the introduction. It is well-known that where is an eigenvalue vector of . In particular, it follows that implies that . Notice that since is invariant under permutations of coordinates, the order in which we list the eigenvalues of in does not matter. This motivates the following definition.
Definition 2.7.
A homogeneous multiaffine stable polynomial has the spectral containment property if for any , there is an eigenvalue vector of such that .
Remark 2.8.
We could make a stronger requirement in 2.7 that for all , all eigenvalue vectors of lie in , seems to be too restrictive; we do not have any examples of polynomials besides the elementary symmetric polynomials with this stronger property.
We now give a number of polynomials which have the spectral containment property:
Theorem 2.9.
The following classes of polynomials have the spectral containment property:
-
(1)
The elementary symmetric polynomials .
-
(2)
For any , and any sufficiently small, .
-
(3)
Stable linear polynomials.
-
(4)
Any degree stable polynomial that interlaces .
-
(5)
for sufficiently small.
Moreover, if has the spectral containment property, and is a variable not used in , then has the spectral containment property.
While this property may seem mysterious, we conjecture that it is in fact ubiquitous:
Conjecture 2.10.
Every homogeneous multaffine stable polynomial has the spectral containment property.
If 2.10 is true, then Theorem 2.1 implies that for every -locally PSD matrix and homogeneous multiaffine stable polynomial , some eigenvalue vector of is contained in . This may seem like a very strong condition on the eigenvalues of , but as we show below it is equivalent to the fact that every eigenvalue vector of is contained in , which we already observed above. Let denote the symmetric group on letters and let it act on by permuting coordinates.
Theorem 2.11.
Let be the elementary symmetric polynomial of degree and be a nonzero homogeneous multiaffine stable polynomial of degree . If , then there exists a permutation such that .
In Section 7.4 we will also show that 2.10 would be implied in many cases by another conjecture generalizing the classical Schur–Horn Theorem.
3. The Minor Lift Map and Stability Preservers
Our goal in this section is to prove Theorem 2.1. We first explain how to construct the minor lift map via partial derivatives of the determinant. Let be a multiaffine polynomial. The dual of is
(1) |
For any polynomial , we consider the differential operator . For instance, if is a monomial, then the associated differential operator is . Applying the differential operator associated to to yields
By linearity, we then obtain that
This formulation of the minor lift map will allow us to easily apply the theory of stability preservers.
Remark 3.1.
The minor lift operation interacts nicely with dualization. If is a multiaffine polynomial, then
Here, denotes the evaluation of a polynomial at .
Before we go on, we need the following facts about hyperbolicity cones that can be found in [29].
Lemma 3.2.
Let be a homogeneous polynomial and a cone. The following are equivalent:
-
(1)
is hyperbolic with respect to all , and
-
(2)
for all and .
Lemma 3.3.
Let be hyperbolic with respect to . Then is hyperbolic with respect to every point in the connected component of that contains .
Our first step is the following observation:
Lemma 3.4.
Let be a homogeneous polynomial. Then is PSD-stable if and only if the following two conditions hold:
-
(1)
for all positive definite matrices ;
-
(2)
is stable for every real symmetric matrix .
Proof.
First assume that is PSD-stable and let be a positive definite matrix. By definition we have . Since is homogeneous, this implies that . Further let in the upper half-plane. Then is nonzero for any real symmetric matrix , since is a positive definite matrix.
Proof of Theorem 2.1.
Let be multiaffine, homogeneous and stable. Then by [9, Thm. 6.1] all nonzero coefficients of have the same sign. Without loss of generality assume that all are positive. Then is clearly positive on positive definite matrices since the minors of a positive definite matrix are positive. Thus by Lemma 3.4, it remains to show that
is stable for every real symmetric matrix . The polynomial is stable as well as by [9, Prop. 4.2]. Thus the polynomial is also stable by [5, Thm. 1.3].
Let be -locally PSD. Then for every -subset , we have for all . Hence, if has degree with all coefficients positive, then for all and hence all roots are non-negative. This implies that . ∎
Remark 3.5.
Given a multiaffine homogeneous stable polynomial , the minor lift map gives a hyperbolic polynomial in the entries of a symmetric matrix whose restriction to the diagonal equals to . Such polynomials can also be constructed for stable polynomials that are not necessarily multiaffine. Since we are mainly interested in multiaffine polynomials, we only briefly sketch one possible such construction. To a stable homogeneous polynomial one can find a multiaffine stable polynomial such that we can recover from by substituting each variable by , see [9, §2.5]. This polynomial is called a polarization of . If we restrict the minor lift of to suitable block-diagonal matrices, we obtain a hyperbolic polynomial with the desired properties for .
Remark 3.6.
Using [8, Thm. 3.2] one can show that the analogous statement to Theorem 2.1 for Lorentzian polynomials, a recent generalization of stable polynomials, holds as well.
4. Hyperbolic Hadamard-Fischer Inequality
Our goal in this section is to prove Theorem 2.4. We start by making some general observations about supporting hyperplanes of the hyperbolicity cone:
Lemma 4.1.
Let be hyperbolic with respect to and the corresponding hyperbolicity cone. Assume that and that is reduced in the sense that all its irreducible factors are coprime. Then we have the following:
-
(1)
For all the linear form is nonnegative on .
-
(2)
If , then .
-
(3)
If , then there exists such that .
Proof.
Part (2) is just Euler’s identity since vanishes on . If , then (1) is trivial. Otherwise, the hyperplane is tangent to at . Since is convex and positive on the interior of , this implies that for all . In order to prove (3), we first note that by our assumption on , the set of points where is nowhere dense. Thus if , then there is a point in the interior of such that the line segment intersects in a smooth point . Since and , we have . ∎
We now apply the above observations to lpm polynomials. Recall that for a partition of , we denote by the vector space of block diagonal symmetric matrices with blocks given by and is the orthogonal projection of onto the subspace . Further recall that we write for if for some .
Lemma 4.2.
Fix a partition of and let be any subset. Then for any , we have .
Proof.
For , consider the orbit . If but the orbit is not fully contained in , then there are such that but . ∎
Lemma 4.3.
Let be an lpm polynomial. If , then .
Proof.
Since is a sum of terms of the form with , it suffices to prove the claim for . In that case, this is equivalent to saying that if and , then
Now and Lemma 4.2 applied to each term yields the claim. ∎
The preceding lemma allows us to show that the hyperbolicity cone of a hyperbolic lpm polynomial is closed under projections onto .
Lemma 4.4.
Let be a homogeous PSD-stable lpm polynomial. If , then .
Proof.
We are now able to show the hyperbolic Fischer–Hadamard inequality. Our proof technique is inspired by the proof of [11, Thm. 5].
Proof of Theorem 2.4.
Without loss of generality, we can assume that . If is on the boundary of , then and we are done since implies . Therefore, we may assume that is in the interior of . In this case, let be sufficiently small such that , then is also in . This shows that is in the interior of and . Thus is hyperbolic with respect to and is real rooted with negative roots. Let be the degree of degree and the roots of with each . We consider the coefficients of in :
-
–
The coefficient of is .
-
–
The coefficient of is , since , and by Lemma 4.3, . This last equality is due to Euler’s identity.
-
–
The constant coefficient is .
Thus we have , and . Since all are positive, from the AM-GM inequality we have
This proves the claim. ∎
When , then is the cone of positive semidefinite matrices and our theorem implies the well-known Fischer’s inequality:
Corollary 4.5 (Fischer’s inequality).
If is positive semidefinite, then .
Remark 4.6.
The usual statement of Fischer’s inequality corresponds to the case of two blocks. This is equivalent to our multi-block version since principal submatrices of a positive semidefinite matrix are also positive semidefinite.
In the case, where , Theorem 2.4 and Lemma 4.4 imply 2.2. We also get the following strengthening of Theorem 2.4.
Corollary 4.7.
Let be a homogeneous and PSD-stable lpm-polynomial. If , then the polynomial is monotonically increasing for .
Proof.
The polynomial is real rooted, and
so that is real rooted. Because both and are in , we have for . Hence, by interlacing has at most one root in the interval . If there were a root of in the interval , then at such a root would have a maximum on this interval. This is a contradiction to the fact that is maximized at by Theorem 2.4. Hence, we have that must in fact be nonnegative on this interval. ∎
5. Hyperbolic Koteljanskii inequality
Koteljanskii’s inequality [17] states that for any positive semidefinite matrix and , . This is a generalization of the Hadamard–Fischer inequality. Later this inequality was proven to hold for other classes of (possibly non-symmetric) matrices [15]. In this section we prove Theorem 2.6, a generalization of Koteljanskii’s inequality, where the determinant can be replaced by a PSD-stable lpm polynomial. First we need the hyperbolic counterpart of the fact that principal submatrices of a positive semidefinite matrix are again positive semidefinite, and hence have nonnegative determinant. For this we use Renegar derivatives [25].
Theorem 5.1.
Let be a polynomial, hyperbolic with respect to . Let denote the directional derivative of in direction . Then is also hyperbolic with respect to . Furthermore, their hyperbolicity cones satisfy .
Recall from 2.5 that . Then we have:
Corollary 5.2.
Let be a homogeneous PSD-stable lpm polynomial of degree and . Let with . Then is PSD-stable as well and .
Now we use the result from [6] on negative dependence. For any polynomial and index set we denote .
Theorem 5.3 ([6, Sect. 2.1 and Thm. 4.9]).
Let be a multiaffine stable polynomial with nonnegative coefficients. Then satisfies the nonnegative lattice condition: for all
This theorem directly implies the generalization of Koteljanskii’s inequality.
Proof of Theorem 2.6.
6. Hyperbolic polynomials and sums of squares
Let be hyperbolic with respect to and . Then the mixed derivative
is globally nonnegative by Theorem 3.1 in [19]. If some power has a definite symmetric determinantal representation, i.e., can be written as
for some real symmetric (or complex hermitian) matrices with positive definite, then is even a sum of squares [19, Cor. 4.3]. Therefore, any instance where is not a sum of squares gives an example of a hyperbolic polynomial none of whose powers has a definite symmetric determinantal representation. Another source of interest in such examples comes from the point of view taken in [27], as these give rise to families of polynomials that are not sums of squares but whose nonnegativity can be certified via hyperbolic programming. Saunderson [27] characterized all pairs for which there exists such a hyperbolic polynomial of degree , except when . In this section we will construct an explicit hyperbolic cubic in variables for which there are two points in the hyperbolicity cone such that is not a sum of squares.
Remark 6.1.
If there are two points in the closed hyperbolicity cone of such that is not a sum of squares, then there are also such points in the interior of the hyperbolicity cone as the cone of sums of squares is closed.
Remark 6.2.
In [27] Saunderson constructs a hyperbolic cubic in variables whose Bézout matrix is not a matrix sum of squares. This is the smallest such example that has been known so far. The top left entry of the Bézout matrix is the mixed derivative that we are studying. Thus if the latter is not a sum of squares, then the Bézout matrix is not a matrix sum of squares.
Consider the complete graph on vertices. We define the spanning tree polynomial of as the element of given by
where ranges over all edge sets of spanning trees of . The polynomial is multiaffine, homogeneous and stable [9, Thm. 1.1]. Let be its minor lift. Finally, let be the polynomial obtained from by evaluating at the matrix of indeterminants
Thus is hyperbolic with respect to every positive definite matrix that can be obtained by specializing entries of to some real numbers. In particular, the polynomial
is nonnegative. We will show that it is not a sum of squares. We first study the real zero set of .
Lemma 6.3.
The polynomial is contained in the ideals and where
-
(1)
is generated by all minors of ,
-
(2)
is generated by all off-diagonal entries of ,
-
(3)
is generated by and ,
-
(4)
is generated by and .
Proof.
Part (1) follows from the fact that both and are in . The other claims are apparent since
Definition 6.4.
An ideal in a ring is called real radical if implies for all .
Lemma 6.5.
The ideal is real radical.
Proof.
It suffices to show that each is a radical ideal such that the real points lie Zariski dense in its zero set. This is clear for and . Using Macaulay2 [12] we checked that is radical. Moreover, the primary decomposition of shows that the zero set of is a union of linear spaces. This implies that the real zeros of are dense as well. ∎
Theorem 6.6.
The polynomial is not a sum of squares.
Proof.
Remark 6.7.
In the terminology of [27] this shows in particular that is neither SOS-hyperbolic nor weakly SOS-hyperbolic.
7. The Spectral Containment Property
We would like to relate the hyperbolicity cone of a homogeneous stable polynomial with the hyperbolicity cone of its minor lift. Recall from 2.7 that a homogeneous multiaffine stable polynomial has the spectral containment property if for any , there is some vector consisting of the eigenvalues of with appropriate multiplicity so that . Elementary symmetric polynomials have the spectral containment property, and we will show that several other polynomials have the spectral containment property in this section. The remainder of this section is devoted to proving some sufficient conditions for the spectral containment property, as well as showing some connections between this property and the Schur-Horn theorem.
7.1. Schur–Horn Theorem and stable linear functions
Recall that a linear homogeneous polynomial is stable if and only if either for each , or for each . Moreover, in this case . These are the simplest stable polynomials and yet it is not completely trivial to show that they have the spectral containment property.
Theorem 7.1.
Every stable linear homogeneous polynomial has the spectral containment property.
In order to prove this, we will use Schur’s contribution to the Schur–Horn theorem.
Theorem 7.2 (Schur).
Let be a homogeneous linear function, and let be the associated minor lift. Let be a symmetric matrix and let be an eigenvalue vector for . Let denote the symmetric group which acts on by permuting coordinates. Let denote the orthogonal group of matrices. Then
Proof of Theorem 7.1.
Suppose that , which is equivalent to . By the Schur–Horn theorem, there is some eigenvalue vector of , say , so that . Thus, there is an eigenvalue vector of contained in as desired. ∎
We will see in Section 7.4 that if an appropriate generalization of the Schur-Horn theorem holds, then we would be able to show the spectral containment property for a large class of polynomials.
7.2. Operations Preserving the Spectral Containment Property
In this section we prove that the spectral containment property is preserved under some simple operations involving adjoining a new variable.
Lemma 7.3.
Let be stable, multiaffine and homogeneous. Let be defined by . If has the spectral containment property, then has the spectral containment property.
Proof.
First note that if and only if . Let , then we can divide into blocks as
Here, is equal to , and is some element of .
If is the identity matrix, we can see from the definition of that . Therefore, for , , which implies . Let and be eigenvalue vectors of and respectively, with the property that the entries of and appear in increasing order. The Cauchy interlacing inequalities say that
Thus for we can write for some . Since has the spectral containment property, there is a permutation such that . Since the hyperbolicity cone of the stable polynomial is convex and contains the nonnegative orthant, we also have . This implies that . ∎
The spectral containment property is also preserved when multiplying by a new variable.
Proposition 7.4.
Let be stable, multiaffine and homogeneous. Let defined by . If has the spectral containment property, then has the spectral containment property.
Before we show this, we need another lemma. Let be a matrix written in block form as
and . We write for the Schur complement.
Lemma 7.5.
Let be stable, multiaffine and homogeneous. Let , and , with , then .
Proof.
Note that a vector if and only if and . Recall the determinant formula for Schur complements: for any matrix ,
Also, it is not hard to see from the definition that if , and , then
that is, Schur complements interact naturally with taking submatrices. Therefore,
Thus, if and , then
We can strengthen this result by noting that if we let be the block diagonal matrix given by
then , since it is in particular positive semidefinite. It is clear from the definition that . Thus, we have that for all ,
which implies that . ∎
Proof of 7.4.
First assume that . By Lemma 7.5, and the spectral containment property for , we have that there is an ordering of the eigenvalues of so that .
Now, we can write
where the second term is a rank 1 positive semidefinite matrix.
Let . Note that is block diagonal, so that if is an eigenvalue vector for , then is an eigenvalue vector for . In particular, by ordering the entries appropriately, , from our characterization of in terms of .
By the Weyl inequalities, there is an ordering of the eigenvalues of so that for each . This implies that
where is a nonnegative vector, and therefore is in . Therefore, .
The case of follows from continuity of eigenvalues. Observe that if is in the interior of , then , and also, since the eigenvalues of a symmetric matrix vary continuously with the matrix, the property of having an eigenvalue vector in is closed. Therefore, since is closed and has nonempty interior, there is an eigenvalue vector of in . ∎
7.3. Polynomials Interlacing an Elementary Symmetric Polynomial
The spectral containment property can be proved more easily for polynomials which interlace some elementary symmetric polynomial.
Before stating the main result, we note that the minor lift map preserves interlacing.
Lemma 7.6.
Let be stable, multiaffine and homogeneous. Let be the associated minor lifts. Then interlaces if and only if interlaces .
Proof.
Assume that interlaces . Then by the multivariate Hermite–Biehler Theorem [7, Thm. 5.3] we have that is stable. Let be a symmetric matrix. We have to show that interlaces . From [5, Thm. 1.3] we see that the linear operator that sends a multiaffine polynomial to the polynomial is a stability preserver. Thus is stable. Substituting for all variables in shows that is stable. Now the claim follows from another application of the Hermite–Biehler Theorem. The other direction is clear, since and are the respective restrictions of and to the diagonal matrices. ∎
Lemma 7.7.
Suppose that is a stable, multiaffine and homogeneous polynomial of degree , and that interlaces . Further suppose that for any , there is some eigenvalue vector of , such that . Then has the spectral containment property.
Proof.
We first note the fact that if is any hyperbolic polynomial, and interlaces , then is in the interior of if and only if is in and . This follows easily from considering the bivariate case.
Let be in the interior of . We first want to show that there is an eigenvalue vector of that is contained in ; the case for general will then follow from the fact that the eigenvalues of a symmetric matrix are continuous as a function of the entries of the matrix.
Since interlaces , by Lemma 7.6, we have that interlaces . From this, we conclude that since , is contained in , and so any vector of eigenvalues of is contained in .
Let be any eigenvalue vector of so that , then we see that this must then be in the interior of , as desired. ∎
In 7.9, we show that the set of stable multiaffine forms interlacing is an open subset containing . This implies that if we have a hyperbolic polynomial which is sufficiently close to , then will have the spectral containment property as long as for any , there is some eigenvalue vector , so that .
We will apply this lemma in a few cases, together with some variational characterizations for eigenvalues to show the spectral containment property for some special kinds of polynomials.
Lemma 7.8.
Let be multiaffine polynomials of degree and , and let . There exist multiaffine polynomials of degree such that
Proof.
This is straightforward. ∎
Proposition 7.9.
There is an open neighborhood of in the vector space of multiaffine forms of degree such that every stable multiaffine of degree is interlaced by .
Proof.
Let be the ideal generated by all multiaffine polynomials of degree and let be the degree part of . Let be the set of all polynomials that can be written as a sum of squares of multiaffine polynomials of degree . It follows from the proof of [18, Thm. 6.2] that is in the interior of (with respect to the euclidean topology on ). Thus it follows from Lemma 7.8 that there is an open neighborhood of such that for every stable multiaffine the polynomial is in . Thus interlaces by [19, Thm. 2.1]. ∎
7.4. Generalized Schur-Horn Property and the Spectral Containment Property
We say that an -variate multiaffine homogeneous polynomial has the Schur-Horn property if for any symmetric matrix with some eigenvalue vector ,
The Schur-Horn property for is equivalent to the fact that for any symmetric matrix with eigenvalue vector ,
Another equivalent formulation states that has the Schur-Horn property if and only if the maximum of as varies over is obtained for some such that is diagonal.
The Schur-Horn theorem states that any linear homogeneous polynomial has the Schur-Horn property. We now relate Schur-Horn property and the spectral containment property.
Theorem 7.10.
Let is an homogeneous multiaffine form of degree . If has the Schur-Horn property, and interlaces , then has the spectral containment property.
Proof.
It is clear that if has the Schur-Horn property, then in particular, for any , there is some eigenvalue vector so that . Therefore, has the spectral containment property by Lemma 7.7. ∎
Using the Schur-Horn property and our previous lemmas, we can show that a family of stable polynomials have the spectral containment property.
Lemma 7.11.
If is a degree homogeneous multiaffine polynomial with the Schur-Horn property, then also has the Schur-Horn property.
Proof.
It can easily be seen that if is an symmetric matrix, with an eigenvalue vector , that
This gives the desired result. ∎
Lemma 7.12.
If is a degree homogeneous multiaffine polynomial with the Schur-Horn property, then for sufficiently small, has the spectral containment property.
Proof.
By 7.9, we see that for sufficiently small, is interlaced by . Moreover, by Lemma 7.11, we see that has the Schur-Horn property. Therefore, by Theorem 7.10, we see that has the spectral containment property. ∎
We now give some examples of polynomials with the Schur-Horn property.
7.5. The Schur-Horn Property For Degree Polynomials
Theorem 7.13.
If is a degree multilinear homogeneous polynomial, then has the Schur-Horn property.
Proof.
Write . In this case,
Define the adjugate matrix of by . By Cramer’s rule, the diagonal entries of the adjugate matrix are given by
Hence, using Remark 3.1, we see that .
The eigenvalues of are of the form where is an eigenvalue vector of . We see then that . Now we apply the Schur-Horn theorem to the linear form and the matrix to see that
Applying our identities relating the vector to , we see that
∎
From this, we immediately obtain a corollary.
Corollary 7.14.
There is an open set in the space of degree homogeneous multiaffine polynomials, such that contains and every element of is stable and has the spectral containment property.
7.6. Extensions of Elementary Symmetric Polynomials and the Schur–Horn Property
We note that it is unclear whether the Schur–Horn property is preserved by adding extra variables. We show that this holds for elementary symmetric polynomials.
Proposition 7.15.
Fix natural numbers . Let . Then, has the Schur-Horn property.
We can reduce this to the classical Schur-Horn theorem. To do this, we require a lemma involving a construction, which is referred to in [22, Chapter 3] as a derivation of a matrix .
Lemma 7.16.
For any symmetric matrix , with eigenvalue vector , there exists a symmetric matrix with the following two properties:
-
•
The eigenvalues of are precisely those real numbers of the form
where we range over all possible values of so that .
-
•
The diagonal entries of are precisely those of the form , where ranges over the size subsets of .
Proof of Lemma 7.16.
We will define in terms of wedge powers. If we regard as an endomorphism from to , then is defined as an endomorphism of by letting
where
It is not hard to see that if are linearly independent eigenvectors of with eigenvalues respectively, then is an eigenvector of with eigenvalue , and this clearly implies the first property in Lemma 7.16.
On the other hand, if we use the natural basis of given by , where is a standard basis vector, and , then this basis is orthogonal under the natural inner product of , and also
This clearly implies the second property of Lemma 7.16. ∎
Proof of 7.15.
The classical Schur-Horn theorem implies that for any symmetric matrix ,
and also that
This first statement implies the Schur-Horn property for , and the second implies the Schur-Horn property for . ∎
7.7. A Small Example of the Schur-Horn Property
We give one more example of the Schur-Horn property, which is noteworthy because our proof does not appeal to the classical Schur-Horn theorem.
Lemma 7.17.
The polynomial has the Schur-Horn property.
Remark 7.18.
The polynomial clearly has the Schur-Horn property, by Theorem 7.13, but it is not clear that this remains the case if we introduce a new variable.
Proof.
Let . Let be in , and write its columns as
It is not hard to see via an explicit computation that
We expand this formulation out by multilinearity of the determinant to obtain the following
(2) | |||
(3) | |||
(4) |
We can think of this as a polynomial
where
We make the following claim:
Lemma 7.19.
is in the convex hull of the polynomials
where .
To see that Lemma 7.19 implies the theorem, observe that for any ,
Hence, in particular, any convex combination of the will be lower bounded by this same quantity.
Therefore, since every symmetric matrix is diagonalizable, we have that for any symmetric matrix , and any orthogonal ,
The opposite inequality is easy to see by choosing to be an orthogonal matrix diagonalizing . ∎
It remains to show Lemma 7.19.
Proof of Lemma 7.19.
Since we work in dimension , we can find the inequalities defining this convex hull explicitly using computational methods. It turns out that the polynomial is in the convex hull of the if and only if for each ,
and if , then
and
For our particular value of , it is easy to see that it is the sum of two squares and hence nonnegative. Further notice that the sum of all of the coefficients of is , so that returning to the definition of the polynomial ,
It remains to show that
Notice that
We prove that this is at most 1. Recall that
The Jacobi complementary minors theorem for matrix inverses implies that if , then
We now see that
Similarly, we must have
Let
Notice that since is orthogonal, these two rows are orthogonal, and so . Applying the Cauchy–Binet theorem to we see that
The result now follows. ∎
8. The permutation property
The goal of this section is to prove Theorem 2.11. It says that given any point in the hyperbolicity cone of and any other homogeneous stable multiaffine polynomial of the same degree, some permuation of the coordinates of is in the hyperbolicity cone of . We call this remarkable propery of the permutation property. We first need some preparation.
Lemma 8.1.
Assume that the homogeneous stable polynomials have nonnegative coefficients and a common interlacer. Then is stable. If is in the hyperbolicity cone of , then is in the hyperbolicity cone of or in the hyperbolicity cone of .
Proof.
Let be the all-ones vector. The univariate polynomials and have a common interlacer. Further, all roots of are nonnegative. The existence of a common interlacer implies that and have at most one negative root each. Assume for the sake of a contradiction that both and have a negative root. Then and have the same (nonzero) sign on the smallest root of . This contradicts . Thus either or have only nonnegative roots which implies the claim. ∎
Lemma 8.2.
Let be homogeneous, multiaffine and stable. Let be a transposition. Then and have a common interlacer.
Proof.
Without loss of generality assume that and let . We can write
for some multiaffine . Then the polynomial
is a common interlacer of and . ∎
Corollary 8.3.
Let be homogeneous, multiaffine and stable. Let be a transposition, and for some nonnegative . Then .
Proof.
This is a direct consequence of the two preceding lemmas. ∎
Let be the group algebra of the symmetric group on elements, i.e. is the vector space over with basis for whose ring structure is defined by extending linearly. In we have the identity
(5) |
see for example [23, p. 192]. From this we obtain our desired theorem.
Theorem 8.4.
Let be the elementary symmetric polynomial of degree and any other nonzero homogeneous multiaffine stable polynomial of degree . If is in the hyperbolicity cone of , then is in the hyperbolicity cone of for some permutation .
Proof.
We have for some nonzero scalar . Thus by Equation 5 we can write
for some positive , transpositions and . We define for . Since , 8.3 implies that if is in the hyperbolicity cone of , then either or is in the hyperbolicity cone of . Since and , this argument shows that if is in the hyperbolicity cone of , then is in the hyperbolicity cone of for some . ∎
9. Open problems
Our work sparks a wide range of open problems. We mention some of them here. For several of these problems, we presented proofs for some special cases, whereas the general case remains open.
9.1. Hyperbolic Schur-Horn Theorem
In Section 4 we proved the hyperbolic generalization of Hadamard-Fischer inequality as well as Koteljanskii’s inequality, in Theorem 2.4 and Theorem 2.6. Here we present another potential generalization of classical linear algebra results in Schur-Horn theorem.
Schur-Horn theorem appears in our previous section on Spectral containment Property, where it plays a major role and a generalized version called Schur-Horn property was formed. Here we will form a different generalization of Schur-Horn theorem in terms of hyperbolic polynomials.
We will formulate our generalization in the language of majorization. Given polynomials and of the same degree, both hyperbolic with respect to the direction , we say that majorizes in direction if for all , the roots of majorize the roots of . Recall that given , majorizes if and the following holds: let be obtained from by reordering coordinates such that and , then for each . Equivalently, majorizes if and only if , where the symmetric group acts on by permuting its coordinates.
In this language, we can restate the Schur direction of the Schur-Horn theorem as follows:
Lemma 9.1.
(Schur) majorizes in the identity direction.
We conjecture that this holds for all homogeneous PSD-stable lpm-polynomials.
Conjecture 9.2.
Let be a homogeneous PSD-stable lpm-polynomial. Then majorizes in the identity direction.
Recall for we defined to be the minor lift of degree elementary symmetric polynomial, i.e., sum of all principal minors of . We are able to prove this conjecture for rescalings of . Our proof will use the following result from [4], which follows from Theorem 1 of their paper.
Proposition 9.3.
Suppose majorizes in direction , then majorizes , where denotes the directional derivatives in the direction.
Now we are ready to state and prove our result.
Proposition 9.4.
Let be any positive diagonal matrix, and . Then majorizes in the identity direction.
Proof.
First notice that majorizes in the direction, i.e., roots of majorize roots of for any . This follows from applying original Schur’s theorem to the symmetric matrix , since we have and similarly . Also notice that .
Now we apply 9.3 times, where . This shows that majorizes in the direction. Computing we have
Similarly, . This shows that roots of majorize roots of . This completes the proof. ∎
We may also formulate a hyperbolic generalization of Horn’s theorem, which we conjecture to be true but do not have any results.
Conjecture 9.5.
Let be any degree lpm-polynomial. Let such that majorizes . Then there exists a symmetric matrix such that roots of are given by , and roots of are given by .
9.2. Spectral containment property and the Schur-Horn property
We showed that many polynomials have the spectral containment property. Based on these examples and additional computational evidence we conjecture the following:
Conjecture 9.6.
All homogeneous multiaffine stable polynomials have the spectral containment property.
There are several special cases of this conjecture which are of particular interest, which we enumerate separately.
Conjecture 9.7.
All quadratic homogeneous multiaffine stable polynomials have the spectral containment property.
This case is of special interest because quadratic multiaffine polynomials have especially simple minor lifts. Namely, if
then
It is therefore plausible that this conjecture could be proved (or disproved) by exploiting this special structure.
Conjecture 9.8.
Let be a positive definite diagonal matrix, and let . Then has the spectral containment property.
Again, this is of special interest because of its relation to diagonal congruence as we now explain.
Lemma 9.9.
Let be a homogeneous, multiaffine stable polynomial, let be a positive definite diagonal matrix, and let . Then if and only if , and if and only if .
Proof.
if and only if for all . This is equivalent to the statement that for all . Notice though that if is positive definite, then is in the interior of the hyperbolicity cone of . Therefore, for all if and only if .
Similarly, if , we see that . Therefore,
We thus have that
Because is positive definite, it is in the interior of , and therefore, for all if and only if . This implies the result. ∎
From, this we see that 9.8 is equivalent to the statement that for any , and any positive definite diagonal matrix , we have that there exists an eigenvalue vector of so that . This gives us a very quantitative relationship between the eigenvalues of a symmetric matrix and those of , which are of fundamental interest in a number of situations.
The Schur-Horn property is another interesting property of a multiaffine polynomial. Once again, despite computer search, we are unable to find an example of a multiaffine homogeneous polynomial that does not have the Schur-Horn property. From this, we conjecture
Conjecture 9.10.
All homogeneous multiaffine polynomials have the Schur-Horn property.
References
- [1] Nima Anari, Shayan Oveis Gharan, Amin Saberi, and Mohit Singh. Nash social welfare, matrix permanent, and stable polynomials. In 8th Innovations in Theoretical Computer Science Conference, volume 67 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 36, 12. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2017.
- [2] Julius Borcea and Petter Brändén. Applications of stable polynomials to mixed determinants: Johnson’s conjectures, unimodality, and symmetrized fischer products. Duke Mathematical Journal, 143(2):205–223, 2008.
- [3] Julius Borcea and Petter Brändén. The Lee-Yang and Pólya-Schur programs. I. Linear operators preserving stability. Invent. Math., 177(3):541–569, 2009.
- [4] Julius Borcea and Petter Brändén. Hyperbolicity preservers and majorization. Comptes Rendus Mathematique, 348(15):843–846, 2010.
- [5] Julius Borcea and Petter Brändén. Multivariate Pólya-Schur classification problems in the Weyl algebra. Proc. Lond. Math. Soc. (3), 101(1):73–104, 2010.
- [6] Julius Borcea, Petter Brändén, and Thomas M. Liggett. Negative dependence and the geometry of polynomials. Journal of the American Mathematical Society, 22(2):521–567, 2009.
- [7] Petter Brändén. Polynomials with the half-plane property and matroid theory. Adv. Math., 216(1):302–320, 2007.
- [8] Petter Brändén and June Huh. Lorentzian polynomials. Annals of Mathematics, 192(3):821–891, 2020.
- [9] Young-Bin Choe, James G. Oxley, Alan D. Sokal, and David G. Wagner. Homogeneous multivariate polynomials with the half-plane property. volume 32, pages 88–187. 2004.
- [10] Lars Gårding. Linear hyperbolic partial differential equations with constant coefficients. Acta Math., 85:1–62, 1951.
- [11] Lars Gårding. An inequality for hyperbolic polynomials. Journal of Mathematics and Mechanics, 8(6):957–965, 1959.
- [12] Daniel R. Grayson and Michael E. Stillman. Macaulay2, a software system for research in algebraic geometry. Available at https://faculty.math.illinois.edu/Macaulay2/.
- [13] F Reese Harvey and H Blaine Lawson Jr. Hyperbolic polynomials and the dirichlet problem. arXiv preprint arXiv:0912.5220, 2009.
- [14] Alfred Horn. Doubly stochastic matrices and the diagonal of a rotation matrix. Amer. J. Math., 76:620–630, 1954.
- [15] Charles R. Johnson and Sivaram K. Narayan. The Koteljanskii inequalities for mixed matrices. Linear and Multilinear Algebra, 62(12):1583–1590, 2014.
- [16] Thorsten Jörgens and Thorsten Theobald. Conic stability of polynomials. Res. Math. Sci., 5(2):Paper No. 26, 12, 2018.
- [17] D. M. Koteljanskii. A property of sign-symmetric matrices. American Mathematical Society Translations, (27):19–23, 1963.
- [18] Mario Kummer. Spectral linear matrix inequalities. Adv. Math., 384:Paper No. 107749, 36, 2021.
- [19] Mario Kummer, Daniel Plaumann, and Cynthia Vinzant. Hyperbolic polynomials, interlacers, and sums of squares. Math. Program., 153(1, Ser. B):223–245, 2015.
- [20] Pierre Lalonde. A non-commutative version of Jacobi’s equality on the cofactors of a matrix. Discrete Math., 158(1-3):161–172, 1996.
- [21] Nam Q. Le. Hadamard-type inequalities for -positive matrices, December 2021.
- [22] Marvin Marcus. Finite Dimensional Multilinear Algebra. Marcel Dekker Inc., 1973.
- [23] Maxim Nazarov. Young’s symmetrizers for projective representations of the symmetric group. Adv. Math., 127(2):190–257, 1997.
- [24] Robin Pemantle. Hyperbolicity and stable polynomials in combinatorics and probability. In Current developments in mathematics, 2011, pages 57–123. Int. Press, Somerville, MA, 2012.
- [25] James Renegar. Hyperbolic programs, and their derivative relaxations. Foundations of Computational Mathematics, 6:59–79, 2006.
- [26] Raman Sanyal and James Saunderson. Spectral polyhedra, January 2020.
- [27] James Saunderson. Certifying polynomial nonnegativity via hyperbolic optimization. SIAM J. Appl. Algebra Geom., 3(4):661–690, 2019.
- [28] Issai Schur. Über eine Klasse von Mittelbildungen mit Anwendungen auf die Determinantentheorie. Sitzungsberichte der Berliner Mathematischen Gesellschaft, 22(9-20):51, 1923.
- [29] David G. Wagner. Multivariate stable polynomials: theory and applications. Bull. Amer. Math. Soc. (N.S.), 48(1):53–84, 2011.