For a basic closed semialgebraic set defined over , every polynomial nonnegative on admits a sum-of-squares certificate with real coefficients, but it is open when such certificates exist with rational coefficients and finitely many generators. The problem asks, for specific compact intervals whose boundary points are algebraic but not rational — , , and — whether (the set of polynomials nonnegative on ) is a finitely generated preordering of ; the source's membership probes — whether and whether for rational — are each settled by an immediate argument (see the Problem Statement). It further asks for uniform degree bounds on certificates when saturation of the natural quadratic module fails, and whether archimedeanity of a quadratic module over descends to without the zero-dimensional support hypothesis. These are the open descent questions left by Keshari, Ojha and Patra (arXiv:2508.07060, 2025), partially answering a question of Powers (2011).
Background
Let be a subfield of and . The preordering is the smallest subset of containing and all sums of squares of polynomials that is closed under addition and multiplication; its elements are finite sums with sums of squares. The quadratic module is the analogous additive-only structure. Both define certificates of nonnegativity on the set , since every element of or is visibly nonnegative on . Write for the set of polynomials nonnegative at every point of ; (resp. ) is called saturated when it equals , so that every nonnegative polynomial is certified. A quadratic module is archimedean when it contains for some positive integer ; by Putinar's theorem archimedeanity guarantees saturation of quadratic modules for strictly positive polynomials over , and Schmüdgen's theorem gives saturation of preorderings on compact sets over . For a finite union of closed intervals with boundary , Kuhlmann and Marshall introduced the natural generators : the linear polynomial (resp. ) for each boundary point with (resp. ), and the quadratic for each pair of boundary points with ; for one takes . They proved over that is saturated; Keshari, Ojha and Patra (2025) proved that this saturation descends to every subfield , i.e. in whenever . Scheiderer (2016) analyzed when sums of squares with real coefficients can be rewritten with rational (or number-field) coefficients, giving both positive descent results and counterexamples. The descent problem, posed in the archimedean case by Powers (2011), asks which of these certificate structures survive when coefficients are restricted from to : saturation can fail because misses the algebraic boundary points, and finite generation of as a preordering of becomes a delicate question of field arithmetic at each boundary point. This matters for exact polynomial optimization and computer algebra, where certificates over can be checked by exact rational arithmetic.
Problem Statement
All rings are (in item (C), ) and all sets are basic closed semialgebraic subsets of defined over . Recall from the background that denotes the basic closed set cut out by , that denotes the preordering generated by them, and that is the natural choice of generators. Answer the following open questions of Keshari, Ojha and Patra (arXiv:2508.07060). (A) Question 8.8: is a finitely generated preordering of in the following compact cases with — (1) ; (2) , in particular does ; (3) , in particular does for some or all ? Here and denote the positive real fourth and square roots of 2. Note that is strictly positive on the compact set , so the membership question in (2) is answered in the affirmative by Schmüdgen's theorem together with its descent to (Powers 2011); and for every such one has at , while every element of is nonnegative on , so the membership question in (3) is answered in the negative by this sign observation. The open content of (1), (2) and (3) is therefore the finite generation of as a preordering of . (B) Question 6.11(2) in the unsolved regime: when is non-compact and either (i) the natural generator set has generators and has no isolated point, or (ii) generators — the regime where — does every admit a representation with such that is bounded by a function of ? (C) Powers' question: if and is archimedean, must be archimedean? Theorem 9.3 of the source settles this only under the hypothesis ; the positive-dimensional case is open.
References
- Manoj K. Keshari, Debapriya Ojha, Niladri Sekhar Patra, "Descent problem for certificate of non-negativity on semi-algebraic sets", 2025, arXiv:2508.07060, DOI 10.48550/arXiv.2508.07060, https://arxiv.org/abs/2508.07060
- Victoria Powers, "Rational certificates of positivity on compact semialgebraic sets", 2011, Pacific Journal of Mathematics 251(2):385-391, DOI 10.2140/pjm.2011.251.385, https://doi.org/10.2140/pjm.2011.251.385
- Salma Kuhlmann, Murray Marshall, "Positivity, sums of squares and the multi-dimensional moment problem", 2002, Transactions of the American Mathematical Society 354(11):4285-4301, DOI 10.1090/S0002-9947-02-03075-1, https://doi.org/10.1090/S0002-9947-02-03075-1
- Salma Kuhlmann, Murray Marshall, Niels Schwartz, "Positivity, sums of squares and the multi-dimensional moment problem II", 2005, Advances in Geometry 5(4):583-606, DOI 10.1515/advg.2005.5.4.583, https://doi.org/10.1515/advg.2005.5.4.583
- Claus Scheiderer, "Sums of squares of polynomials with rational coefficients", 2016, Journal of the European Mathematical Society 18(7):1495-1513, DOI 10.4171/jems/620, https://doi.org/10.4171/jems/620
- Konrad Schmüdgen, "The K-moment problem for compact semi-algebraic sets", 1991, Mathematische Annalen 289(1):203-206, DOI 10.1007/BF01446568, https://doi.org/10.1007/BF01446568
- Mihai Putinar, "Positive polynomials on compact semi-algebraic sets", 1993, Indiana University Mathematics Journal 42(3):969-984, DOI 10.1512/iumj.1993.42.42045, https://doi.org/10.1512/iumj.1993.42.42045
- Victoria Powers, Bruce Reznick, "Polynomials that are positive on an interval", 2000, Transactions of the American Mathematical Society 352(10):4677-4692, DOI 10.1090/S0002-9947-00-02595-2, https://doi.org/10.1090/S0002-9947-00-02595-2
- Victor Magron, Mohab Safey El Din, Markus Schweighofer, "Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials", 2019, Journal of Symbolic Computation 93:200-220, DOI 10.1016/j.jsc.2018.06.005, https://doi.org/10.1016/j.jsc.2018.06.005
- Jose Abel Castellanos-Joo, Deepak Kapur, "Computing Certificates in Archimedean Univariate Saturated Quadratic Modules", 2026, arXiv:2605.18980, DOI 10.48550/arXiv.2605.18980, https://arxiv.org/abs/2605.18980