The generalized Lax conjecture for rigidly convex sets
The generalized Lax conjecture for rigidly convex sets
Let be a real-zero (RZ) polynomial with . For a polynomial , write for its rigidly convex set. Generalized Lax conjecture. There exist another RZ polynomial with and symmetric matrices such that
This conjecture softens the requirement that itself have a determinantal representation while preserving its rigidly convex set through the inclusion . The supplied source describes the result as a conjecture to be proved, but gives no resolution evidence; its status is therefore recorded as open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
The generalized Lax conjecture for rigidly convex sets
Let be a rigidly convex set, meaning that it is an algebraic interior whose defining polynomial is real zero with respect to an interior point. A spectrahedron is the solution set of a linear matrix inequality.
Generalized Lax conjecture. Every rigidly convex set is a spectrahedron.
Spectrahedra are known to be rigidly convex, so this conjecture asks whether the converse holds. Its status is not established in the supplied text.
source: Renato G. Bettiol, Mario Kummer and Ricardo A. E. Mendes, “Two results on the Convex Algebraic Geometry of sets with continuous symmetries”, arXiv:2408.03231 (2025).
Sources & referencesView supporting material
Primary source
Alejandro González Nevado, “The generalized Lax conjecture is true for topological reasons related to compactness, convexity and determinantal deformations of increasing products of pointwise approximating linear forms”, arXiv:2601.12267 (2026).
Additional references
2 papers in this index state this conjecture (2025–2026). The statement above is taken from the most recent of them; the others are arXiv:2507.03800.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.