Hyperbolic polynomials — homogeneous real polynomials whose restriction to every line through a fixed direction has only real roots — define, by a theorem of Gårding, convex semialgebraic sets called hyperbolicity cones, the feasible sets of hyperbolic programming. Every spectrahedral cone, i.e. every feasible set of a semidefinite program given by a linear matrix inequality, is a hyperbolicity cone, and in three variables the converse holds by the Helton–Vinnikov theorem. Hanselka's completely algebraic proof of the ternary case records the boundary of current knowledge: in four or more variables, it is unknown whether every hyperbolicity cone is spectrahedral. The question must be read at the level of cones rather than of the given polynomial: the literal reading — that every hyperbolic polynomial itself admits a definite symmetric determinantal representation — is false in four or more variables by Brändén's Vámos-matroid counterexamples. The source-faithful cone form, commonly called the Generalized Lax Conjecture, asks: for every polynomial hyperbolic with respect to , does some hyperbolic multiplier with make a definite symmetric determinant? The conjecture remains open: positive results cover special classes, smooth cones are even second-order-cone representable after projection, but no general construction and no counterexample is known.
Background
A homogeneous real polynomial is called hyperbolic with respect to a direction if and, for every , the univariate polynomial has only real roots. Hyperbolic polynomials were introduced by Gårding in the study of hyperbolic partial differential equations with constant coefficients. He proved that the hyperbolicity cone — the set of all such that no root of is strictly positive — is a convex semialgebraic cone, equal to the closure of the connected component of containing , and that is hyperbolic with respect to every point in its interior. Basic examples are products of linear forms (whose hyperbolicity cones are polyhedral cones) and the determinant on the space of real symmetric matrices (whose hyperbolicity cone is the positive semidefinite cone).
A spectrahedral cone is a set of the form , where are real symmetric matrices and denotes positive semidefiniteness; such a homogeneous linear matrix inequality (LMI) is exactly the constraint format of semidefinite programming. Every spectrahedral cone is a hyperbolicity cone: if , then is hyperbolic with respect to , and a direct congruence argument shows — after the substitution , the roots of are the negatives of the eigenvalues of that matrix, so no root is strictly positive exactly when all eigenvalues are nonnegative. Consequently, a definite determinantal representation of — a representation with — realizes the hyperbolicity cone of exactly as a spectrahedral cone. Hyperbolic programming, i.e. linear optimization over a hyperbolicity cone (introduced by Renegar), generalizes both linear and semidefinite programming, so the question of whether, at the level of feasible sets, hyperbolic programming coincides with semidefinite programming is precisely the question of whether the inclusion of cone classes is an equality.
For three variables the equality is known: Lax conjectured in 1958 that ternary hyperbolic forms admit definite determinantal representations; Vinnikov settled the corresponding bivariate statement in 1993 through self-adjoint determinantal representations of real plane curves; and Helton and Vinnikov proved in 2007 that every ternary form hyperbolic with respect to admits a linear determinantal representation definite at , using theta functions on the Jacobian variety of the curve . Lewis, Parrilo and Ramana (2005) established the equivalence of the various formulations and showed that this settles Lax's conjecture. Hanselka (2014) gave a new, completely algebraic proof of the Helton–Vinnikov theorem, and records in his abstract the boundary of current knowledge: 'Whether these [spectrahedral cones] are the only examples [of hyperbolicity cones] is unknown in general.'
Beyond three variables, the naive generalization — that every hyperbolic polynomial itself admits a definite determinantal representation — is false: Brändén (2011), relating linear matrix inequality representations to representability of polymatroids, constructed from the Vámos matroid a real-zero polynomial (equivalently, after homogenization, a hyperbolic form of degree four in four variables) none of whose powers admits a symmetric determinantal representation, and Netzer and Thom (2012) showed by a dimension count that almost no real-zero polynomial admits one. The surviving question is therefore genuinely about cones and not about representing the given polynomial: the determinant of the representing pencil may be a multiple of by a suitable hyperbolic factor. In the equivalent formulation recorded by Kummer (2013), the hyperbolicity cone of is spectrahedral if and only if there exists a hyperbolic polynomial with such that with . The multiplier is genuinely necessary, as the same Vámos example shows — no power of it is a determinant — yet Kummer proved that its hyperbolicity cone is nevertheless spectrahedral. This cone-form question is commonly called the Generalized Lax Conjecture; a survey of the surrounding theory is given by Vinnikov (2012).
Problem Statement
Determine whether every hyperbolicity cone in for is a spectrahedral cone (the Generalized Lax Conjecture in its cone form; the cases are settled affirmatively).
Formally: for every integer and every homogeneous polynomial hyperbolic with respect to a direction , does there exist an integer and real symmetric matrices such that, writing ,
Here is the closed hyperbolicity cone of , i.e. the set of all such that no root of the univariate polynomial is strictly positive.
Equivalently, in the multiplier formulation recorded by Kummer (2013): does there exist a hyperbolic polynomial with such that with ?
The representing pencil is not required to compute itself: by Brändén's Vámos-type examples, some hyperbolic polynomials in four variables have no power admitting a definite determinantal representation, so a hyperbolic multiplier is unavoidable in general. A complete answer is either a proof that such a pencil (equivalently, such a multiplier) exists for every hyperbolic polynomial in four or more variables, or an explicit hyperbolic polynomial together with a proof that no symmetric linear pencil of any size has positive-semidefinite cone equal to its hyperbolicity cone.
References
- Christoph Hanselka. Definite Determinantal Representations of Ternary Hyperbolic Forms. arXiv:1411.1661 (2014, v2 2015). DOI: 10.48550/arXiv.1411.1661. https://arxiv.org/abs/1411.1661
- P. D. Lax. Differential equations, difference equations and matrix theory. Communications on Pure and Applied Mathematics 11(2):175–194 (1958). DOI: 10.1002/cpa.3160110203. https://doi.org/10.1002/cpa.3160110203
- Lars Gårding. Linear hyperbolic partial differential equations with constant coefficients. Acta Mathematica 85:1–62 (1951). DOI: 10.1007/BF02395740. https://doi.org/10.1007/BF02395740
- Lars Gårding. An inequality for hyperbolic polynomials. Journal of Mathematics and Mechanics 8:957–965 (1959). DOI: 10.1512/iumj.1959.8.58061. https://doi.org/10.1512/iumj.1959.8.58061
- Victor Vinnikov. Self-adjoint determinantal representations of real plane curves. Mathematische Annalen 296:453–479 (1993). DOI: 10.1007/BF01445115. https://doi.org/10.1007/BF01445115
- A. S. Lewis, P. A. Parrilo, M. V. Ramana. The Lax conjecture is true. Proceedings of the American Mathematical Society 133(9):2495–2499 (2005). DOI: 10.1090/S0002-9939-05-07752-X. https://doi.org/10.1090/S0002-9939-05-07752-X
- J. William Helton, Victor Vinnikov. Linear matrix inequality representation of sets. Communications on Pure and Applied Mathematics 60(5):654–674 (2007). DOI: 10.1002/cpa.20155. https://doi.org/10.1002/cpa.20155
- Petter Brändén. Obstructions to determinantal representability. Advances in Mathematics 226(2):1202–1212 (2011). DOI: 10.1016/j.aim.2010.08.003. https://doi.org/10.1016/j.aim.2010.08.003
- Tim Netzer, Andreas Thom. Polynomials with and without determinantal representations. Linear Algebra and its Applications 437:1579–1595 (2012). DOI: 10.1016/j.laa.2012.04.043. https://doi.org/10.1016/j.laa.2012.04.043
- Sam Burton, Cynthia Vinzant, Yewon Youm. A real stable extension of the Vamos matroid polynomial. arXiv:1411.2038 (2014). DOI: 10.48550/arXiv.1411.2038. https://arxiv.org/abs/1411.2038
- Mario Kummer. A note on the hyperbolicity cone of the specialized Vámos polynomial. arXiv:1306.4483 (2013, v2 2015). DOI: 10.48550/arXiv.1306.4483. https://arxiv.org/abs/1306.4483
- Mario Kummer. Determinantal representations and Bézoutians. Mathematische Zeitschrift 285:445–459 (2016). DOI: 10.1007/s00209-016-1715-9. https://doi.org/10.1007/s00209-016-1715-9
- Tim Netzer, Andreas Thom. Hyperbolic polynomials and generalized Clifford algebras. Discrete & Computational Geometry 51:802–814 (2014). DOI: 10.1007/s00454-014-9598-1. https://doi.org/10.1007/s00454-014-9598-1
- Petter Brändén. Hyperbolicity cones of elementary symmetric polynomials are spectrahedral. Optimization Letters 8(5):1773–1782 (2014). DOI: 10.1007/s11590-013-0694-6. https://doi.org/10.1007/s11590-013-0694-6
- Nima Amini. Spectrahedrality of hyperbolicity cones of multivariate matching polynomials. Journal of Algebraic Combinatorics 50(2):165–190 (2019). DOI: 10.1007/s10801-018-0848-9. https://doi.org/10.1007/s10801-018-0848-9
- Tim Netzer, Raman Sanyal. Smooth hyperbolicity cones are spectrahedral shadows. Mathematical Programming 153(1):213–221 (2015). DOI: 10.1007/s10107-014-0744-6. https://doi.org/10.1007/s10107-014-0744-6
- Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz. Exponential lower bounds on spectrahedral representations of hyperbolicity cones. Proceedings of the Thirtieth Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 2322–2332. DOI: 10.1137/1.9781611975482.141. https://doi.org/10.1137/1.9781611975482.141
- David Sawall, Markus Schweighofer. Amalgamation of real zero polynomials. Indagationes Mathematicae 35:37–59 (2024). DOI: 10.1016/j.indag.2023.08.002. https://doi.org/10.1016/j.indag.2023.08.002
- Grigoriy Blekherman, Julia Lindberg, Kevin Shu. Symmetric hyperbolic polynomials. Journal of Pure and Applied Algebra 229:107869 (2025). DOI: 10.1016/j.jpaa.2025.107869. https://doi.org/10.1016/j.jpaa.2025.107869
- Claus Scheiderer. Smooth hyperbolicity cones are second-order cone representable. arXiv:2509.17121 (2025). DOI: 10.48550/arXiv.2509.17121. https://arxiv.org/abs/2509.17121
- James Renegar. Hyperbolic programs, and their derivative relaxations. Foundations of Computational Mathematics 6(1):59–79 (2006). DOI: 10.1007/s10208-004-0136-z. https://doi.org/10.1007/s10208-004-0136-z
- Victor Vinnikov. LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future. In: Mathematical Methods in Systems, Optimization, and Control, Operator Theory: Advances and Applications 222, Birkhäuser/Springer Basel, pp. 325–349 (2012). DOI: 10.1007/978-3-0348-0411-0_23. https://doi.org/10.1007/978-3-0348-0411-0_23