Combinatorics and preservation of conically stable polynomials

Given a closed, convex cone K⊆Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K\subseteq \mathbb {R}^n$$\end{document}, a multivariate polynomial f∈C[z]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f\in \mathbb {C}[\textbf{z}]$$\end{document} is called K-stable if the imaginary parts of its roots are not contained in the relative interior of K. If K is the nonnegative orthant, K-stability specializes to the usual notion of stability of polynomials. We develop generalizations of preservation operations and of combinatorial criteria from usual stability toward conic stability. A particular focus is on the cone of positive semidefinite matrices (psd-stability). In particular, we prove the preservation of psd-stability under a natural generalization of the inversion operator. Moreover, we give conditions on the support of psd-stable polynomials and characterize the support of special families of psd-stable polynomials.

Classical related notions include hyperbolic polynomials [11] or stability with respect to an arbitrary domain (see, e.g., [12] and the references therein).Recently, further variants and generalizations have been developed, including conic stability introduced by Jörgens and the third author [14], Lorentzian polynomials introduced by Brändén and Huh [7] and positively hyperbolic varieties introduced by Rincón, Vinzant and Yu [22].
In this work we focus on the notion of conic stability.Given a closed, convex cone K ⊆ R n , a polynomial f ∈ C[z] = C[z 1 , . . ., z n ] is called K-stable, if Im(z) ∈ relint K for every root z of f , where Im(z) denotes the vector of the imaginary parts of the components of z and relint K denotes the relative interior of K.Note that (R ≥0 ) nstability coincides with the usual stability.In the case of a homogeneous polynomial, K-stability of f is equivalent to the containment of relint K in a hyperbolicity cone of f .The notion of K-Lorentzian polynomials recently introduced by Brändén and Leake [8] is, up to scaling, a generalization of homogeneous K-stable polynomials.Stability with respect to the positive semidefinite cone on the space of symmetric matrices is denoted as psd-stability.In the homogeneous case such polynomials are also known as Dirichlet-Gårding polynomials [13].Prominent subclasses of psd-stable polynomials arise from determinantal representations [10].Blekherman, Kummer, Sanyal et al.
Date: November 29, 2022.An extended abstract of this work was accepted for presentation at the Workshop Discrete Mathematics Days 2022, Santander.[1] have constructed a family of psd-stable lpm-polynomials (linear principle minor polynomials) from multiaffine stable polynomials.
The purpose of the current paper is to initiate the study of generalizations of two prominent research directions in stable polynomials towards conically stable polynomials: preservation operators and combinatorial criteria.In particular, a focus is to understand the transition from the classical stability situation to the conic stability with respect to non-polyhedral cones such as the positive semidefinite cone.
With regard to preservation, stable polynomials have been recognized to remain stable under a number of operations, see the survey [25].Prominent examples include the inversion operation (see [2]), the preservation under taking partial derivatives (as a consequence of the univariate Gauß-Lucas Theorem), the Lieb-Sokal Lemma ([17, Lemma 2.3], see also [2,Lemma 2.1]) and the celebrated characterization of Borcea and Brändén of linear operators preserving stability [2,Theorem 1.3].Many of the mentioned applications of stability rely on the preservation properties.
With regard to combinatorial criteria, several important combinatorial results have been achieved, which provide effective criteria for the recognition of stable polynomials.A groundbreaking result of Choe, Oxley, Sokal and Wagner states that the support of a multi-affine, homogeneous and stable polynomial f ∈ R[z] = R[z 1 , . . ., z n ] is the set of bases of a matroid [9,Theorem 7.1].Brändén [6,Theorem 3.2] proved a generalization of this result for the support of any stable polynomial f ∈ R[z], showing that it forms a jump system, i.e., it satisfies the so-called Two-Steps Axiom.See Section 2 for formal definitions.Recently, Rincón, Vinzant and Yu gave an alternative proof of the matroid result, based on a tropical proof of the auxiliary statement that positive hyperbolicity of a variety is preserved under passing over to the initial form [22,Corollary 4.9].
The proofs of these combinatorial properties strongly rely on the preservation properties of stable polynomials.These preservation properties establish the connection between the combinatorial and the algebraic viewpoint.For example, taking the partial derivative of a polynomial f shifts the support vectors of f by a unit vector in a negative coordinate direction (and some support vectors may disappear).Since stability of a polynomial is preserved under taking partial derivatives, one can use this preserver to argue about the combinatorics of the support.In the univariate case, these considerations are classical for deriving log-concavity of sequences with real-rooted generating functions.Our contributions. 1.We generalize several preserving operators for usual stability to the conic stability.In particular, we derive a conic version of the Lieb-Sokal Lemma (see Lemma 2.2 and Corollary 3.6).
2. For the case of psd-stability, we can prove the preservation under a natural generalization of the inversion operator.See Theorem 4.3.This generalized inversion operator is specific to the case of psd-stability and exhibits a prominent role of this class.Furthermore, we show that psd-stable polynomials are preserved under taking initial forms with respect to positive definite matrices.See Theorem 4.10.
3. Combinatorics of psd-stable polynomials.We prove a necessary criterion on the support of any psd-stable polynomial in Theorem 5.1 and characterize the support of special families of psd-stable polynomials.In particular, we characterize psd-stability of binomials (Theorem 5.5), give a necessary criterion for psd-stability of a larger class containing binomials (Theorem 5.4), and introduce a class of polynomials of determinants, which satisfies a generalized jump system criterion with regard to psdstability.Theorem 5.11 characterizes the restrictive structure of psd-stable polynomials of determinants.These results are complemented by an additional conjecture on the support of general psd-stable polynomials.We provide evidence for this conjecture by verifying it for the classes of polynomials treated previously.
The paper is structured as follows.Section 2 collects relevant background on preservers of the usual stability notion as well as an introduction to the notion of Kstability.
In Section 3, we study preservers of conic stability for general and polyhedral cones, including the generalized version of the Lieb-Sokal Lemma.Section 4 treats the case of psd-stability, in particular, the preservation of psd-stability under an inversion operation and under passing over to certain initial forms.Section 5 deals with combinatorial conditions of psd-stable polynomials.Therein, Subsections 5.1 and 5.2 discuss the support of special families of psd-stable polynomials.Subsection 5.3 considers the support of general psd-stable polynomials and also raises a conjecture.
Acknowledgment.This work was supported through DFG grant TH 1333/7-1.The research was primarily done while the first author was with Goethe University, supported by an Early Career Researcher grant of Goethe University.

Preliminaries
Let R ≥0 and R >0 denote the sets of non-negative and of positive real numbers.Further, let H := {z ∈ C : Im(z) > 0} be the open upper half-plane of C. Throughout the text, bold letters will denote n-dimensional vectors unless noted otherwise.
In this section, we collect known properties of stable polynomials and then introduce the generalization of stability, namely conic stability, with which the paper is concerned.

Stable polynomials.
A polynomial f ∈ C[z] is called stable if for every root z of f , there exists some j ∈ [n] with Im(z j ) ≤ 0. Hence, a univariate real polynomial f is stable if and only if it is real-rooted, because the non-real roots of univariate real polynomials occur in conjugate pairs.The following collection from [25,Lemma 2.4] recalls some elementary operations that preserve stability, where f) can be derived from the Gauß-Lucas Theorem.Denote by deg i the degree in the variable z i .
A prominent linear stability preserver is the Lieb-Sokal Lemma ([17, Lemma 2.3], see also [2,Lemma 2.1] or [25,Lemma 3.2]).It is an essential ingredient in Borcea and Brändén's full characterization of linear operations preserving stability [2, Theorem 1.1], see also [3,Section 3.2].Proposition 2.2 (Lieb-Sokal Lemma).Let g(z)+yf (z) ∈ C[z, y] be stable and assume The following statement due to Hurwitz allows us to obtain (conic) stability statements as limit of statements on compact subsets under a uniform convergence condition.As a consequence of [9, Theorem 6.1], the following necessary condition for homogeneous stable polynomials based on their coefficients applies.
Theorem 2.4.All nonzero coefficients of a homogeneous stable polynomial f ∈ C[z] have the same phase.

Stability and initial forms. The initial form in
where S w := {α ∈ S : w, α = max β∈S w, β } and •, • is the natural dual pairing.
That is, we restrict the polynomial f to those monomials whose exponents lie on the face of the Newton polytope of f where the functional w is maximized.
In the context of their work on positively hyperbolic varieties, Rincón, Vinzant and Yu [22,Proposition 4.1] showed that for polynomials with real coefficients, stability is preserved under taking initial forms.Their proof is based on tropical geometry.For the convenience of the reader, we give here a simplified proof, and at the same time slightly generalize the statement to also cover polynomials with complex coefficients.The observation that the statement is also valid for complex coefficients has independently been derived by Kummer and Sert [16,Proposition 2.6].
Proof.Let ϕ := max { α, w : α ∈ supp(f )}, and for λ > 0, define the polynomial f λ (z) := 1 λ ϕ • f (λ w 1 z 1 , . . ., λ wn z n ), which is stable by Proposition 2.1.To apply Hurwitz' Theorem to finally achieve stability of the initial form, we need to ensure that f λ converges uniformly to in w (f ) on every compact subset since the norm in the last equality is bounded, given that C is a compact set.
The discussion of the preservation of conically stable polynomials when passing over to initial forms is continued at the end of Section 4. A collection of points F ⊆ Z n is called a jump system if for every α, β ∈ F and σ ∈ St(α, β) with α + σ / ∈ F there is some τ ∈ St(α + σ, β) such that α + σ + τ ∈ F .In words, if after one step from α towards β we have left the set F , then there must be a second step that takes us back into F .This property is also known as the Two-Steps Axiom.The support of a complex polynomial f (z) = α c α z α is defined as supp(f ) = {α ∈ Z n ≥0 : c α = 0}, that is, it is the set of all exponent vectors α such that the corresponding coefficient c α is non-zero in f .The following theorem reveals the connection between stable polynomials and jump systems.
In [22,Proposition 4.1], the support of stable binomials is explicitly classified as follows.Here, e i denotes the i-th unit vector in R n .Theorem 2.7.Let f = c α z α + c β z β with c α , c β = 0 and α, β ∈ Z n ≥0 be stable and let z α and z β do not have a common factor.Then one of the following holds, a) {α, β} = {0, e i } for some i ∈ [n], b) {α, β} = {e i , e j } for some i, j ∈ [n] and cα c β ∈ R ≥0 , or c) {α, β} = {0, e i + e j } for some i, j ∈ [n] and cα c β ∈ R <0 .2.4.Conic stability.The following notion of conic stability as introduced in [14] generalizes stability to more general cones.Let K be a closed, convex cone in R n and denote by relint K its relative interior.
Observe that by choosing the cone K = R n ≥0 , we recover the usual notion of stability.For any closed, convex cone K, conic stability can be characterized through stability of univariate polynomials (see [14,Lemma 3.4], that proof literally also works without the assumption of full-dimensionality made there).Proposition 2.9 ([14], Lemma 3.4).A polynomial f ∈ C[z] \ {0} is K-stable if and only if for all x, y ∈ R n with y ∈ relint K, the univariate polynomial t → f (x + ty) is stable or identically zero.
0 and the univariate polynomial t → f (x + te) is real rooted.For a fulldimensional cone K ⊂ R n , every homogeneous K-stable polynomial is hyperbolic w.r.t.every e ∈ relint K = int K by [14, Theorem 3.5] and hence, up to a multiplicative constant every homogeneous K-stable polynomial has real coefficients [11].
2.5.Positive semidefinite stability.We introduce the notion of psd-stability, an important special case of conic stability where the cone is chosen to be the positive semidefinite cone.
Denote by S C n the vector space of complex symmetric matrices (rather than Hermitian matrices) and by S n the space of real ones.The cones of real positive semidefinite and positive definite matrices are denoted by S + n and S ++ n .Let C[Z] denotes the ring of polynomials on the symmetric matrix variables Z = (z ij ).More precisely, C[Z] is the vector space generated by monomials of the form Z α = 1≤i,j≤n z α ij ij with some nonnegative symmetric matrix α whose diagonal entries are integers and whose off-diagonal entries are half-integers.Polynomials in C[Z] can also be interpreted as polynomials in the polynomial ring C[{z ij |1 ≤ i ≤ j ≤ n}], by identifying z ij and z ji for i = j.For example, consider the monomial in the polynomial ring C[Z] over the vector space S C 2 .Definition 2.11.Psd-stability is defined as S + n -stability for polynomials over the vector space is the set of all symmetric exponent matrices of the monomials occurring with non-zero coefficients in the polynomial.The variables z ii are called diagonal variables, while the variables z ij with i = j are the off-diagonal variables.We say that a monomial with exponent matrix α is a diagonal monomial if α ij = 0 for all i = j ∈ [n], and we say that it is an off-diagonal monomial if α ii = 0 for all i ∈ [n].By convention, we say that a constant is a diagonal monomial, but not an off-diagonal one.
Example 2.12.Let f (Z) = det(Z) in the polynomial ring C[Z] over the vector space S C 2 .Then The monomial z 11 z 22 is a diagonal monomial while the other one is an an off-diagonal monomial.
A prime example of psd-stable polynomials are determinants.The proof is included for completeness.
Proof.Suppose that f is not psd-stable, that is, there exist real symmetric matrices A and B with B positive definite, such that f (A + iB) = 0. Then B is invertible and 0 , where I n denotes the identity matrix of size n.Hence, −i is a root of the characteristic polynomial of, and thus an eigenvalue of, B − 1 2 AB − 1 2 : a contradiction, since a symmetric real matrix has only real eigenvalues.
Contrary to the usual stability notion, monomials are not necessarily psd-stable.In fact, every monomial with an off-diagonal variable as a factor, is not psd-stable since it evaluates to zero for Z = i • I n .
Psd-stability can be viewed as stability with respect to the Siegel upper half-space H S = {A ∈ C n×n symmetric : Im(A) is positive definite}.The Siegel upper halfspace occurs in algebraic geometry and number theory as the domain of modular forms.

Preservers for conic stability
We provide generalizations of the stability preservers from Section 2 to conic stability with respect to some closed, convex cone K. Our focus is on general cones and on the subclass of polyhedral cones.A main result in this section is Theorem 3.4, a conic version of the Lieb-Sokal Lemma.In Section 4, the specific case of preservers for psd-stability will be studied.
A conical analogue of property b) from Proposition 2.1, scaling, holds trivially since K is a cone: for any c ∈ C and a ∈ R ≥0 , the polynomial c•f (az 1 , . . ., az n ) is K-stable or identically zero.We now study the preservation of conical stability under directional derivatives.For a vector v ∈ R n \ {0}, denote by In the homogeneous case, this statement follows from the concept of a Renegar derivative [21] for hyperbolic polynomials.
To aim at a contradiction to the univariate Gauß-Lucas Theorem, we construct through a substitution in f a univariate polynomial g ≡ 0, which has a non-real zero.Since Im(z) ∈ relint(K), there exists some ε > 0 such that Im(z)−εv ∈ relint K. Define the univariate polynomial and v ∈ K, the univariate polynomial g is stable: if it had any root t with Im(t) > 0, z − iεv + tv would be a root of f , but its imaginary part Im(z) − εv + Im(t)v is in the relative interior of the cone K, a contradiction to the conical stability of f .Moreover, g is not constant, because ∂ v f ≡ 0. Hence, by the Gauß-Lucas Theorem, the derivative g ′ is stable.Since we obtain a contradiction to the stability of g ′ .
There is a natural generalization of property d) in Lemma 2.1 to conic stability.
is stable or the zero polynomial.j+1) with the (j + 1)-th unit vector e (j+1) , 1 ≤ j ≤ n − 1, and Proof.First consider the special case where Im(a) + relint K ′ ⊆ relint K. Further assume that the polynomial g ∈ C[z] is neither zero nor stable.Then there exists w ∈ C k with Im(w) ∈ R k >0 and g(w) = 0, and thus f (a + k j=1 w j v (j) ) = 0. Since Im(a) + k j=1 w j v (j) ∈ Im(a) + relint K ′ ⊆ relint K, f is not K-stable, contradiction.The general case (Im(a) + K ′ ⊆ K) follows from Hurwitz' Theorem.
In the rest of this section, we present and prove a generalization of the Lieb-Sokal Lemma (Lemma 2.2) to conic stability.In the usual Lieb-Sokal Lemma, we take a partial derivative of a polynomial which has degree at most 1 in the corresponding variable.To formulate a similar result for arbitrary cones, we take a directional derivative in a direction lying in the cone, since these directional derivatives preserve conic stability by Lemma 3.1.To this end, we need a generalized notion of degree with respect to an arbitrary direction.
In particular, after taking the directional derivative in direction v exactly ρ v (f ) + 1 times, we obtain the identically zero polynomial.The degree in the direction of a unit vector e (j) coincides with the univariate degree with respect to the variable j.We can now state the conical version of Lieb-Sokal stability preservation.Theorem 3.4 (Conic Lieb-Sokal stability preservation).Let K ′ be given by We first establish a connection between a cone K and its lift K ′ into a higherdimensional space, which we will use to prove Theorem 3.4.
, where f ≡ 0 and K-stable and let Proof.Let g + yf be K ′ -stable.Fix some z with Im(z) ∈ relint K.By K-stability, we have f (z) = 0, and thus we may consider g(z)+yf (z) as a univariate stable polynomial.Setting w = −g(z)/f (z), the stability of the univariate polynomial y → g(z) + yf (z) implies Im(w) ≤ 0. It follows that f (z) = −w.So g(z) + wf (z) = 0 and K ′ -stability follows.
We can now complete the proof of Theorem 3.4.
Proof of Theorem 3.4.We begin by observing that g is K-stable or g ≡ 0. Let v ∈ K with ρ v (f ) ≤ 1.If ∂ v f ≡ 0, there is nothing to prove.So assume ∂ v f ≡ 0, and thus implies f ≡ 0. For a fixed z ∈ C n with Im(z) ∈ relint K we may consider g(z)+yf (z) as a univariate polynomial in y.By Lemma 3.1, the polynomial Using Lemma 3.5 again, the K ′ -stability of g(z)−∂ v f (z)+yf (z) follows.By specializing to y = 0 and using Lemma 2.1, we obtain that g(z) Theorem 3.4 not only generalizes the usual Lieb-Sokal Lemma to the case of arbitrary cones, but also extends it to directional derivatives with respect to every direction in the positive orthant.We can formulate this explicitly as the following refined version for the usual stability notion.
is stable or identically 0.

Preservers for psd-stability
In this section, we restrict to psd-stability.For a complex symmetric matrix Z ∈ S C n , we write Z = X + iY with X, Y ∈ S n .After collecting some elementary preservers, our main results of this section are the preservation of psd-stability under an inversion operation (see Theorem 4.3 and Corollary 4.7) and the preservation of psd-stability under taking initial forms with respect to positive definite matrices (see Theorem 4.10).
For a polynomial f ∈ C[Z], let f Diag ∈ C[Z] denote the polynomial obtained from f by substituting all off-diagonal variables by 0. For 1 ≤ i = j ≤ n, let B ii be the matrix which is 1 in entry (i, i) and zero otherwise, and let B ij be the matrix which is 1/2 in entry (i, j) and (j, i) and zero otherwise.Then, for a polynomial ∂z ij as symbolic expressions.To see this, it suffices to observe that for i < j and a monomial f (Z) = z n .Proof.a) Assume f Diag is not psd-stable.Then there are real symmetric matrices A, B with B ≻ 0 and f Diag (A + iB) = 0. Let A ′ and B ′ be the matrices obtained from A and B by setting all off-diagonal variable to zero.In particular, B ′ is positive definite.Since the only variables occurring in f Diag are the diagonal ones, we have b) Both transformations Z → S T ZS and Z → S −1 ZS preserve the inertia of Im(Z) and thus also psd-stability.c) Set k := |J| and assume without loss of generality J = {1, . . ., k}.For ε > 0, let g ε be the polynomial on the space S k defined by g ε (Z) := f (Diag(Z, iεI n−k )), where Diag(Z, iεI n−k ) is the block diagonal matrix with blocks Z and iεI n−k .The psd-stability of g implies the psd-stability of g ε for all ε > 0. Hurwitz' Theorem 2.3 then gives the desired result, because f (Z J ) = g 0 (Z).d) is obvious, e) and f) are similar to c), and g) is the special case of Lemma 3.1 when K is the psd-cone.
The diagonalization property from Lemma 4.1 plays a central role in the theory of psd-stable polynomials, since it establishes connections to the usual stability notion and also gives further insights into the monomial structure of psd-stable polynomials.c1) The claim follows since the sum of the coefficients of all diagonal monomials is given by f (I n ) which cannot be zero due to f (i c2) The claim follows by combining a) with Theorem 2.4.
When investigating the combinatorics of psd-stable polynomials in Section 5, we will refer to the following observation, which could also be considered as a special case of specialization.Let f (Z) be psd-stable.For the real matrix variables X and any fixed real matrix B ≻ 0, the polynomial f (X + iB) does not have any real roots.
As the first main result in this section, we show the following preservation statement under inversion for psd-stability.
Here, the factor det(Z) deg(f ) serves to ensure that the product is a polynomial again.For the proof of Theorem 4.3, we begin with a technical lemma.Lemma 4.4.Let A, B ∈ S n with B ≻ 0. Then the symmetric matrix C := A + iB is invertible and the imaginary part matrix of the symmetric matrix C −1 is negative definite.
We will use the following elementary computation rules, which can be verified immediately.
Lemma 4.5.Assume that C = A + iB is invertible, and denote its inverse by We also use the following basic statement on eigenvalues in the proof of Lemma 4.4.Proof.Let B ≻ 0, and let λ be an eigenvalue of C with some corresponding eigenvector v. Then (1) By Lemma 4.5, the imaginary part of W = C −1 is given by (−B − AB −1 A) −1 .We observe that B −1 is positive definite and thus AB −1 A is positive semidefinite.Hence, −B − AB −1 A is negative definite.Since the inverse of that matrix is negative definite as well, the claim follows.
We can complete the proof of Theorem 4.3.
Proof of Theorem 4.3.The inverse of a symmetric matrix C = A+iB with positive definite imaginary part B has a negative definite imaginary part, as shown in Lemma 4.4.Thus f (−C −1 ) = 0 if B ≻ 0. Since det(Z) is a psd-stable polynomial as well as f , the polynomial det(Z) deg(f ) f (−Z −1 ) is psd-stable.Note that the factor det(Z) deg(f ) ensures that det(Z) deg(f ) f (−Z −1 ) is a polynomial.This directly follows from Cramer's rule, saying Z −1 = 1 det(Z) • adj(Z), where adj(Z) denotes the adjugate matrix of Z.The following is a slight generalization which resembles the existing formulation of the scalar version in Lemma 2.1.
Corollary 4.7.If Z is a symmetric block diagonal matrix with blocks Z 1 , . . ., Z k and ) is a psdstable polynomial.Here, deg Z 1 f denotes the total degree of f with respect to the variables from the block Z 1 .
We close the section with a brief discussion and our second main result of this section on the preservation of the psd-stability of a polynomial f ∈ C[Z] when passing over to an initial form.For f = α∈S c α Z α ∈ C[Z], the initial form of f is defined with respect to some functional W in the dual space S * n .It is defined as where S W := {α ∈ S : W, α F = max β∈S W, β F } and •, • F is the Frobenius product.
The following example shows that Theorem 2.5 on stability preservation under taking the initial form for any non-zero functional w does not generalize to the case of psdstability.To answer the natural question of whether psd-stability is preserved by passing over to the initial form with respect to certain symmetric matrices, we show that it is enough for W to be positive definite.
For λ > 0 and matrices W ∈ S n , let λ W denote the operation given by (λ W ) ij := λ w ij .Furthermore, for two matrices A, B ∈ S n let A • B denote the Hadamard product of Lemma 4.9.Let f ∈ C[Z] be psd-stable and let W ∈ S n be such that there exists some λ 0 > 0 such that for every λ > λ 0 , λ W is positive definite.Then in W (f ) is psd-stable.
Proof.The Schur product theorem states that the Hadamard product of the two positive definite matrices is positive definite.Thus we have λ W • A ≻ 0 for all A ≻ 0 and λ > λ 0 .Let ϕ = max { α, W F : α ∈ supp(f )} and define the polynomial f λ (Z) := 1 λ ϕ f (λ W • Z).This is psd-stable for any λ > λ 0 , since the positive semi-definiteness of the imaginary part is preserved due to the previous observation.Let µ := max{ α, W : α ∈ supp(f ), α, W < ϕ} and δ := ϕ − µ > 0. Now, for any compact subset C ∈ S n , lim since the norm in the last equality is bounded.By Hurwitz' Theorem 2.3, in W (f ) is psd-stable.
Theorem 4.10.Let f ∈ C[Z] be psd-stable and W ∈ S n be positive definite, then in W (f ) is psd-stable.
Proof.Let W ∈ S n be positive definite.Then W •k , the k-fold Hadamard product of W , is positive definite for all k ≥ 1 and so is exp k! , with the convention that W •0 is the all-ones matrix.For λ > 1, we have ln(λ) is positive definite.The claim now follows from Lemma 4.9 with λ 0 = 1.

Combinatorics of psd-stable polynomials
This section is about combinatorial properties of the support of psd-stable polynomials, inspired by the results in [6,9,22] on the support of stable polynomials listed in Sections 1 and 2. Theorem 5.1 gives a necessary condition on the support of any psd-stable polynomial.In Sections 5.1 and 5.2, we characterize psd-stability of binomials and non-mixed polynomials and the class of polynomials of determinants.Finally, Section 5.3 discusses some aspects on the support of general psd-stable polynomials, provides a conjecture and verifies this conjecture for some special families of polynomials.We sometimes write both z ij and z ji with some i = j, but both denote the same variable z ij with i ≤ j, as explained at the beginning of Section 4.
Theorem 5.1.If an off-diagonal variable z ij (where i < j) occurs in a psd-stable polynomial f ∈ C[Z], then the corresponding diagonal variables z ii and z jj must also occur in f .This mimics the basic fact about positive semidefinite matrices that if an off-diagonal entry is non-zero, the corresponding diagonal entries must also be non-zero.
Proof.We prove the contrapositive.Suppose without loss of generality that z 1n is a variable appearing in f but z nn is not.We can choose an (n − 1) × (n − 1) complex symmetric matrix A and a 2n , . . ., a n−1,n ∈ C such that Im(A) is positive definite and such that substituting these values into f gives a non-constant univariate polynomial g in the variable z 1n .The second condition is possible because the set S ++ n−1 × C n−2 is an open set.Indeed, we can choose all real parts to be zero.
The univariate non-constant polynomial g has a complex root a 1n .The assignment z ij = a ij for all (i, j) = (n, n) gives therefore a root of f no matter what value we choose for z nn .We now claim that if we assign a value a nn with Im(a nn ) positive and large enough, the matrix A ′ which results from assigning these values to Z has a positive definite imaginary part.
Observe that by Sylvester's criterion of leading principle minors, it is enough to check that the determinant of Im(A ′ ) is strictly positive; the remaining leading principal minors will necessarily be positive because they are minors of Im(A), which we chose positive definite.Now, by developing the determinant along the last row, we obtain where c is a constant.Since det Im(A) is positive, we can choose Im(a nn ) positive and sufficiently large so that det Im(A ′ ) is positive.Thus f (A ′ ) = 0 with Im(A ′ ) positive definite, which proves that f is not psd-stable.
The argument used in the proof is connected to the 'positive (semi-)definite matrix completion problem', see for example [5,Section 3.5].In the special case of binomials Theorem 5.1 can be extended as follows.
Lemma 5.2.Let f (Z) = c α Z α + c β Z β be a psd-stable binomial.If the two monomials Z α and Z β do not have a common factor, then either both consist only of diagonal variables, or one only of diagonal and the other only of off-diagonal variables.
Proof.Z α and Z β cannot both be off-diagonal monomials, since this contradicts Theorem 5.1.It remains to be shown that neither monomial can contain both diagonal and off-diagonal variables.Suppose towards a contradiction that one of the two monomials did contain both, w.l.o.g.Z β , and choose j such that β jj > 0. Since the monomials of f do not share any variable, ∂Z α ∂z jj ≡ 0, where we use the derivative notation ∂ ∂z ij on the symmetric matrix space as introduced at the beginning of Section 4.

5.1.
Binomials and non-mixed polynomials.We give characterizations of the support of psd-stable binomials.Some of the results will be stated for the family of nonmixed polynomials, which includes irreducible binomials thanks to Lemma 5.2.Definition 5.3.We call a polynomial f ∈ C[Z] non-mixed if every monomial that occurs in f either consists only of diagonal variables or only of off-diagonal variables.We always write such a non-mixed polynomial as f = α∈A c α Z α + β∈B c β Z β , where A refers to the exponent matrices of diagonal monomials and B refers to the exponent matrices of off-diagonal monomials.
It is useful to consider this larger family because it is closed under directional derivatives while the family of binomials is not.The following two theorems are the main results in this subsection.
Theorem 5.4.Let f (Z) = α∈A c α Z α + β∈B c β Z β be a homogeneous non-mixed polynomial of degree d ≥ 3 and assume c β = 0 for some β ∈ B. Then f is not psdstable.
The following theorem is a complete characterization of the support of psd-stable binomials, analogous to the classification of stable binomials from Theorem 2.7.
Theorem 5.5.Every psd-stable binomial is of one of the following forms: a) Only diagonal variables appear in f and f satisfies the conditions of Theorem 2.7: This theorem shows that the only psd-stable binomials with off-diagonal variables are those described in b): in particular, at most one off-diagonal variable occurs in a psd-stable binomial, and it has degree exactly 2.
The following lemma is a first step towards a proof of the main theorems and shows that the exponents of psd-stable binomials cannot be far apart.The proof relies on taking derivatives in direction V (ij) , with i = j, which denotes the n × n matrix with v ii = v jj = v ij = v ji = 1 and 0 elsewhere.In terms of the basis matrices B ij introduced at the beginning of Section 4, we have Proof.We may assume that the monomials of f do not have a common factor since this does neither affect |α − β| nor ||α| − |β||.By Lemma 5.2, either both monomials are diagonal monomials or w.l.o.g.only Z β is an off-diagonal monomial.If both monomials are diagonal, the claim follows directly from Theorem 2.6, because psd-stable polynomials involving only diagonal variables are stable polynomials.Now assume that Z β is an off-diagonal monomial.Then |β| ≤ |α| follows from Theorem 5.1 after possibly taking derivatives in direction V (ij) for some z ij appearing in Z β .It remains to show |α| ≤ |β|+2.Assume to the contrary that |α|−|β| ≥ 3. Choose i and j with i < j such that z ij occurs in ) by the computation rules at the beginning of Section 4, we see that ∂f ∂V (ij) (Z) has at most two diagonal monomials, each of degree |α|−1, and exactly one off-diagonal monomial of degree |β| − 1.By applying this procedure consecutively |β| times, we obtain a polynomial g is psd-stable by Lemma 3.1.Since g does not involve any off-diagonal variables, it is a stable polynomial.This is a contradiction to Theorem 2.6, since the support of g does not satisfy the Two-Steps Axiom.
In the following, we show that most binomials are not psd-stable by explicitly constructing a root S (of the binomial or a directional derivative of it) whose imaginary part lies in the interior of the psd-cone.This root S will be a symmetric n × n matrix of the form Since Im(S) = I n ≻ 0, any polynomial with root S is not psd-stable.
Proof.Assume towards a contradiction that f is psd-stable.Since |α| > |β| ≥ 1 and Z α and Z β do not share a factor, we have that |α − β| ≥ 3.If both monomials were diagonal monomials, psd-stability would imply stability, and |α − β| ≥ 3 would yield a contradiction to Theorem 2.6.Now assume that Z β is an off-diagonal monomial.We will show that there are s, t ∈ R such that S is a root of f , thus contradicting that f is psd-stable.By Lemma 5.6, the only possibly psd-stable cases are |α| = |β| + 1 and |α| = |β| + 2.
First consider the case |β| = 1.Then |α| ∈ {2, 3}.After substituting S, f = 0 is of the form One may split the real and imaginary part of equation ( 3 .Substituting these into (Re) gives a linear function in t, which has a real solution as well.Now consider the case |β| > 1. Choose i and j with i < j such that the variable z ij occurs in f .Since f is psd-stable, its partial derivative in direction V (ij) is psd-stable by Lemma 3.1.
) is a non-mixed polynomial with the degree of each monomial reduced by 1 and exactly one off-diagonal monomial.Taking |β| − 1 consecutive derivatives in a similar way, we obtain a nonmixed polynomial of the form g Substituting S into g gives equation (3).Thus neither g nor f can be psd-stable.Now we prove Theorem 5.4, which shows that homogeneous non-mixed polynomials of high degree cannot be psd-stable.
Proof of Theorem 5.4.Assume to the contrary that f is a homogeneous non-mixed psd-stable polynomial of degree at least 3.By Remark 2.10, we can assume without loss of generality that all coefficients of f are real.
First assume the degree of f is d = 3.We will show a contradiction to psd-stability by explicitly finding a forbidden root of f .Let a := α∈A c α and b := β∈B c β .Note that a and b are real and a = f (I n ) = 0 by Corollary 4.2 c1).If b = 0, w.l.o.g.we normalize so that a = 1.To obtain the desired forbidden root we look for a solution of the form S introduced above, that is, real solutions s, t for the equation f (S) = (s + i) 3 + bt 3 = 0.By splitting the equation into real and imaginary part, we obtain the system (Re) : (s 3 − 3s) + bt 3 = 0, (Im) : 3s 2 − 1 = 0.
Consider the positive real solution s * = 1 √ 3 of (Im).Plugging this solution into (Re) gives a real cubic in t, which has a real solution t * .
If instead b = 0, we tweak matrix S to S ′ as follows: let β 0 ∈ B such that c β 0 = 0, and let z ij be a variable occurring in the monomial Z β .Then we let S ′ ij = S ′ ji = (1 + ε)t for a small ε > 0. The remaining entries of S ′ are the same as those in S. Since b = β c β = 0, we have that f (S ′ ) = (s + i) 3 + εc β 0 t 3 , and εc β 0 > 0, which means we fall into the case above with the coefficient of t 3 non-zero.We have thus constructed solutions violating psd-stability for any such degree 3 polynomial f .Now let d > 3 and assume d is the smallest degree such that there is a polynomial f of the specified form which is psd-stable of degree d.Its partial derivative in any direction V (ij) is psd-stable by Lemma 3.1.If we choose (i, j), i = j such that the variable z ij occurs in f , ∂f ∂V (ij) is a polynomial of the same form of degree d − 1: , the coefficients of off-diagonal monomials are positive multiples of those of f and therefore there must be a non-zero one.This is a contradiction, since we assumed that d was the smallest degree which a psd-stable polynomial of this form could have.
We finally have all the tools needed to prove Theorem 5.5, which provides a complete classification of the support of psd-stable binomials.
Proof of Theorem 5.5.Let f be a binomial.Then f can be written in the form f (Z) = Z γ f (Z), where f (Z) = c α Z α + c β Z β is an irreducible psd-stable binomial and therefore also a non-mixed polynomial.
If all variables appearing in f are diagonal variables, then f is stable, and by Theorem 2.6 its support has to satisfy the Two-Steps Axiom, which leads to |α−β| ≤ 2 in the case of binomials.Thus, now we can assume the occurrence of an off-diagonal monomial, say Z β .By the structure Theorem 5.1 and after possibly taking derivatives in direction V (ij) for some z ij appearing in Z β , we see |β| ≤ |α|.
From Theorem 5.5, we observe that psd-stable binomials cannot contain a monomial which is the product of different off-diagonal variables.This also holds for psd-stable homogeneous non-mixed polynomials.
Theorem 5.8.Let f be a psd-stable homogeneous non-mixed polynomial of degree 2. Then f is of the form f Proof.Let f (Z) be a psd-stable homogeneous non-mixed polynomial of degree 2 and assume to the contrary that there is a monomial z ij z kl in f involving distinct variables, that is, {i, j} = {k, l}.Note that the index sets {i, j} and {k, l} can intersect.The order of the variable matrix must therefore be at least 3. Consider S ′ as a modified version of S from (2) with S ′ ij := S ′ ji := t 1 , S ′ kl := S ′ lk := t 2 for complex t 1 and t 2 and set all other off-diagonal entries of S ′ to 0 while the diagonal of S is set to some complex value s.Thus, up to a factor, f (S ′ ) = 0 is of the form (4) = 0 with some constants c 1 , c 2 , c and c = 0. Since f is hyperbolic due to its homogeneity and psd-stability, we may assume c 1 , c 2 , c to be real.
Since f is hyperbolic, the quadratic polynomial g in s, t 1 , t 2 on the left hand side of ( 4) is hyperbolic as well.Hyperbolic quadratic polynomials have signature (n − 1, 1) or (1, n − 1) ( [11], see, e.g., also [20]).Since the term s 2 in g comes from a substitution into the terms z 2 11 , . . ., z 2 nn , the representation matrix of g must have signature (2, 1).Hence, the lower right 2 × 2-matrix of the representation matrix (1,1).If at least one of the c i is positive, then we can choose real values for t 1 and t 2 such that s 2 +γ = 0 with some γ > 0, which gives among the two solutions for s one with positive imaginary part.If one of the c i , say, c 2 , is zero and c 1 ≤ 0, then setting t 1 = 1 and t 2 = 1−c 1 c gives the solution s = i with positive imaginary part.It remains to consider the case c 1 < 0, c 2 < 0, in which the signature condition implies (c/2) 2 > c 1 c 2 .By choosing t 1 , t 2 to satisfy t which can formally be viewed as the equality case of the arithmetic-geometric inequality.We can pick the signs of t 1 , t 2 such that ct 1 t 2 > 0. And the previous inequality implies | (and the expression in the argument of the absolute value on the right hand side is negative).Hence, we obtain s 2 + γ = 0 for some positive γ, which gives among the two solutions for s one with positive imaginary part.
Altogether, we have constructed a zero S ′ of f with Im(S ′ ) ≻ 0, which contradicts the psd-stability of f .5.2.Polynomials of determinants.We show that the following class of polynomials of determinants satisfies a generalized jump system criterion with regard to psdstability.Suppose that the symmetric matrix of variables Z is a diagonal block matrix with blocks Z 1 , . . ., Z k .A polynomial of determinants is a polynomial in Z of the form f (Z 1 , . . ., Z k ) = α c α det(Z) α , where we define det( We say a polynomial of determinants f (Z 1 , . . ., Z k ) = α det(Z) α is written in standard form if the largest possible determinantal monomial is factored out, i.e., f (Z 1 , . . ., Z k ) = det(Z) γ β c β det(Z) β = det(Z) γ f (Z), and all c β = 0. We investigate the following notion of support for polynomials of determinants.Definition 5.9.Let f (Z 1 , . . ., Z k ) = α c α det(Z) α be a polynomial of determinants.Then the determinantal support is defined as supp det (f ) = {α ∈ Z k ≥0 : c α = 0}.Note that the determinantal support specializes to the usual support when Z is a diagonal matrix, that is, all Z i are 1 × 1 matrices of a single variable.As a corollary of Theorem 2.6, we obtain the following analogue for the determinantal support of psd-stable polynomials of determinants.
The next theorem shows that psd-stable polynomials of determinants have a very special structure.
Further, for any matrix Z i which has size exactly 2, let Proof.Observe that, by construction, a variable in the matrix Z i does not appear in any other matrix Z j .This ensures that all vectors in the support of the polynomial fDiag (Z), which involves only the diagonal variables, are of the form ), where β = (β 1 , . . ., β k ) ∈ B is an exponent vector of det(Z) in f and d i is the size of the matrix Z i for each i.Further, fDiag is stable and its support is therefore a jump system.Suppose now that some matrix Z i , say Z 1 , has size d 1 ≥ 3. Since f is in standard form, there are β ∈ B such that β 1 > 0 and β ′ ∈ B such that β ′ 1 = 0. Then there are corresponding vectors α = (β 1 , . . ., β 1 d 1 times , β 2 , . . . ) and α ′ = (0, . . ., 0 d 1 times , β ′ 2 , . . . ) in the support of fDiag , which is a jump system.Thus e 1 is a valid step from α ′ to α, but since α ′ + e 1 = (1, 0, . . ., 0, . . . ) is not of the form (5) it cannot belong to the support of fDiag .Now by definition of a jump system, there must be a step from α ′ + e 1 to α which is in the support.However, whichever step we take will lead us again to a vector where the first d 1 entries are not all equal, since d 1 ≥ 3, and thus none of these vectors can be in the support of fDiag , monomial if and only if their cycle decompositions are made of pairwise the same or inverse cycles.Since two such permutations have the same sign, there is no cancelation of monomials in the symmetric determinant det(Z).Thus, applying any transposition step to any monomial of det(Z) will yield another monomial of det(Z): exchanging z ij z kl with z ik z jl or z il z kj preserves the property that each index appears exactly twice.We now only need to show that, given any two monomials Z α and Z β of det(Z), there exists a transposition step from α to β. Choose a variable z ij such that z ij | Z α but z ij ∤ Z β .There must be an index k = j such that z ik | Z β and an index l = i such that z jl | Z β .Then multiplying Z α by z −1 ij z −1 kl z ik z jl is a transposition step, since it decreases the distance to β in the norm | • |.
We conjecture that a property inspired by the structure of the determinant and that of stable polynomials holds for all psd-stable polynomials.
Conjecture 5.13.For any monomial Z β appearing in a psd-stable polynomial, there is a diagonal monomial Z α appearing in f which can be reached by a sequence of linear, double and transposition steps which decrease the distance from β to α and which never leave the support of f . is psd-stable because it is the product of two psd-stable polynomials: the first one is the derivative in direction V (12) of the 2 × 2 determinant, the other one is a 2 × 2 determinant sharing one variable with the first.This polynomial satisfies Conjecture 5.13: for example, if we choose the monomial z 12 z 2 13 , with a double step we reach z 11 z 2 13 , which is also in the support of f , and with a transposition step we reach z 2 11 z 33 , a diagonal monomial in the support.Notice that the double step produces a monomial whose exponent vector is closer to the exponent of the final diagonal monomial (with respect to | • |).Such a sequence of valid steps can be found for all monomials of f .As evidence for the conjecture, we observe that it holds for the classes of polynomials we have studied.Proof.Let f be a psd-stable homogeneous non-mixed polynomial.If f does not involve off-diagonal monomials, the claim follows from the jump system property of usual stable polynomials.Thus assume that f involves off-diagonal variables.We have d := deg(f ) ≤ 2 by Theorem 5.4.In the case of d = 1 there is a double step between every two monomials of f , thus assume d = 2 and let c β Z β be an off-diagonal monomial of f .By Theorem 5.8, c β Z β is of the form c jk z 2 jk for some j = k.Let J = {j, k}, then f (Z J ) is psd-stable by Lemma 4.1 c).By the structure Theorem 5.1, f (Z J ) is of the form f (Z J ) = c 1 z 2 jj + c 2 z jj z kk + c 3 z 2 kk + c jk z 2 jk with c k ∈ C such that z jj and z kk both appear.We claim that c 2 = 0. Assuming c 2 = 0 gives c 1 , c 3 = 0. Reducing f (Z J ) to the diagonal contradicts the jump system property and thus we obtain c 2 = 0. Therefore, the monomial c 2 z jj z kk appears in f (Z J ) and hence also in f (Z).Thus, it is a transposition step from c jk z 2 jk to the corresponding diagonal monomial c 2 z jj z kk .Lemma 5.17.Psd-stable polynomials of determinants satisfy Conjecture 5.13.
Proof.Every monomial Z β in a polynomial of determinants f belongs to a determinantal monomial det(Z) γ and thus is a product of monomials Z β j (with multiplicities γ j ) belonging to determinantal blocks det(Z j ), 1 ≤ j ≤ k.Let Z α j be the diagonal monomial of block det(Z j ).By Lemma 5.12 there is a sequence of transposition steps from Z β j to Z α j which never leaves the support of det(Z j ) for all 1 ≤ j ≤ k.Concatenation of these sequences (with multiplicities γ j ) gives a sequence of transposition steps from Z β to the diagonal monomial Z α of det(Z) γ which never leaves the support of f .Another class of psd-stable polynomials which satisfy Conjecture 5.13 are the psdstable lpm polynomials introduced in [1], which are polynomials of the form f (Z) =

Proposition 2 . 3 .
[15, Par.5.3.4]Let {f k } be a sequence of polynomials non-vanishing in a connected open set U ⊆ R n , and assume it converges to a function f uniformly on compact subsets of U. Then f is either non-vanishing on U or it is identically zero.

Lemma 4 . 1 (
Elementary preservers for psd-stability).Let f ∈ C[Z] be psd-stable.a) Diagonalization: The polynomial Z → f Diag (Z) is psd-stable.b) Transformation: Let S ∈ GL n (R), then f (SZS −1 ) and f (SZS T ) are psdstable.c) Minorization: For J ⊆ [n], let Z J be the symmetric |J| × |J| submatrix of Z with index set J. Then f (Z J ), the polynomial on S C |J| obtained from f by setting to zero all variables with at least one index outside of J, is psd-stable or zero.d) Specialization: For a fixed index i ∈ [n], let Ẑi be any matrix obtained from Z by assigning real values to z ij , z ji for all indices j = i and a value from H to z ii .Then f ( Ẑi ), viewed as polynomial on S C n−1 , is psd-stable or zero.e) Reduction: For i, j ∈ [n], let Zij be any matrix obtained from Z by choosing real values for z ik = z ki for k = i and setting z ii := z jj .Then f ( Zij ), viewed as polynomial on

Corollary 4 . 2 .
Let f ∈ C[Z] be psd-stable.Then: a) The polynomial (z 11 , z 22 , . . ., z nn ) → f Diag (Z) is stable in C[z 11 , z 22 , . . ., z nn ]. b) If f (0) = 0, i.e., if f does not have a constant term, then there is a monomial in f consisting only of diagonal variables of Z. c) If f is homogeneous, then c1) the sum of the coefficients of all diagonal monomials of f is nonzero.c2) all nonzero coefficients of diagonal monomials of f have the same phase.Proof.a) By Lemma 4.1, we know that f Diag (Z) ≡ 0 is psd-stable.Now it suffices to observe that f Diag (Z) = 0 whenever the diagonal of Im(Z) has positive entries only.b) Let f (0) = 0.If each monomial in f contains an off-diagonal variable of Z, then f Diag (Z) ≡ 0, in contradiction to the psd-stability of f Diag (Z).

Lemma 4 . 6 .
Let A, B ∈ S n and set C = A + iB.If B ≻ 0 then λ ∈ H for all eigenvalues λ of C.
0 and thus λ ∈ H. Proof of Lemma 4.4.Let C = A+iB with A, B ∈ S n and B ≻ 0. Lemma 4.6 gives that C is invertible.The symmetry of C −1 is an immediate consequence of the invertibility.Indeed, C −1 C = I implies I