Powers (Pacific J. Math. 251 (2011), 385–391) proved that when a semialgebraic set and a strictly positive polynomial on it are given with rational coefficients, Schmüdgen-type representations can always be taken with sums of squares of polynomials over , and the same holds for Putinar-type representations as long as a ball polynomial is included among the generators. She asked whether this proviso is dispensable: if is finite and the quadratic module is archimedean in , is then also archimedean as a quadratic module in — concretely, can the certificate of compactness always be rewritten with rational sums-of-squares multipliers? This is the surviving open core of the rationality-transfer questions in that note: the companion question of Sturmfels, whether a rational polynomial that is a sum of squares over is also a sum of squares over , was answered negatively by Scheiderer (2016), and even strictly positive counterexamples were later constructed by Laplagne (2024). The archimedean descent question remains open in general; the only partial result known is the affirmative answer of Keshari–Ojha–Patra (2025) for the case where the support algebra is zero-dimensional.
Background
A polynomial that is nonnegative on all of can sometimes be certified as such by writing it as a finite sum of squares (SOS) of polynomials. More generally, for a finite set of polynomials one considers the basic closed semialgebraic set , and an explicit representation of a polynomial as an SOS-weighted combination of the certifies that is nonnegative on . Two representation theorems are central. The preordering consists of all finite sums with each an SOS; Schmüdgen's theorem (1991) states that if is compact, then every polynomial strictly positive on lies in . The quadratic module consists of all with SOS multipliers (each constraint polynomial used at most once); Putinar's theorem (1993) draws the same conclusion under the stronger hypothesis that is archimedean, meaning that every polynomial is bounded by some integer in — equivalently, that some ball polynomial belongs in , so that the ball polynomial serves as a certificate of compactness for . These theorems underlie the standard semidefinite-programming hierarchy for polynomial optimization. Since the underlying solvers work in floating point, the certificates they output are numerical, and the exact-certification question arises: if and have rational coefficients, do representations with rational coefficients always exist? Powers (2011) proved that the answer is yes for Schmüdgen representations on compact , and yes for Putinar representations whenever a ball polynomial is available among the generators; her arguments descend, respectively, a purely algebraic proof of Schmüdgen's theorem (via the abstract Positivstellensatz for preordered rings) and an algorithmic proof of Putinar's theorem (via Pólya's classical theorem that a homogeneous polynomial strictly positive on the positive orthant acquires nonnegative coefficients after multiplication by a power of the sum of its variables) to rational coefficients. Her note leaves open whether the archimedean hypothesis itself descends from to — the question of this record. The subtlety is real: for the companion question raised by Sturmfels, whether an that is an SOS in must be an SOS in , the answer is negative. Hillar (2009) had proved the positive transfer under the extra hypothesis that is a sum of squares over a totally real number field (a number field all of whose complex embeddings are real), with an explicit bound on the number of rational squares needed. But Scheiderer (2016) constructed explicit rational polynomials that are sums of squares over yet not over — norm forms, i.e. products of all Galois conjugates, of linear forms over totally imaginary number fields (number fields with no real embedding) whose Galois group acts sufficiently transitively on the complex embeddings — and Laplagne (2024) produced such an example that is even strictly positive everywhere. In the plain SOS setting the obstruction is the possible absence of rational points on the boundary of the Gram spectrahedron (the convex set of symmetric matrices with , where is the vector of monomials, in which a rational SOS decomposition corresponds to a rational positive semidefinite Gram matrix). For the archimedean question, the analogous issue is whether the semialgebraic set of tuples of rational SOS multipliers representing a ball polynomial can be empty while the corresponding set over is nonempty — precisely the failure mode that the known SOS counterexamples realize for single representations, but which has not been shown possible for the archimedean property itself.
Problem Statement
Let and let be a finite set of polynomials with rational coefficients. For a field , write for the set of sums of squares of polynomials with coefficients in , and let denote the quadratic module generated by in . Suppose that is archimedean, that is, every element of is bounded in ; equivalently, there exist and real sums of squares with Question (Powers, 2011): must then also be archimedean? Concretely, must there exist and rational sums of squares with or, equivalently, some such that each admits such a representation with rational sums-of-squares multipliers? The question is posed at this full generality — all and all finite , with no restriction on the geometry of ; in particular, the typical case where has nonempty interior in is included and is not covered by the known partial results. A complete answer is either a proof that archimedeanness of a finitely generated quadratic module always descends from to , or an explicit finite set of rational polynomials together with a proof that is archimedean while is not.
References
- V. Powers, Rational certificates of positivity on compact semialgebraic sets, Pacific Journal of Mathematics 251 (2011), no. 2, 385–391, doi:10.2140/pjm.2011.251.385, https://doi.org/10.2140/pjm.2011.251.385; preprint arXiv:0911.1331, https://arxiv.org/abs/0911.1331
- C. J. Hillar, Sums of squares over totally real fields are rational sums of squares, Proceedings of the American Mathematical Society 137 (2009), no. 3, 921–930, doi:10.1090/S0002-9939-08-09641-X, https://doi.org/10.1090/S0002-9939-08-09641-X; preprint arXiv:0704.2824, https://arxiv.org/abs/0704.2824
- C. Scheiderer, Sums of squares of polynomials with rational coefficients, Journal of the European Mathematical Society 18 (2016), 1495–1513, doi:10.4171/jems/620, https://doi.org/10.4171/jems/620; preprint arXiv:1209.2976, https://arxiv.org/abs/1209.2976
- J. Capco and C. Scheiderer, Two remarks on sums of squares with rational coefficients, Banach Center Publications 121 (2020), 25–36, doi:10.4064/bc121-2, https://doi.org/10.4064/bc121-2; preprint arXiv:1905.13282, https://arxiv.org/abs/1905.13282
- S. Laplagne, Sum of squares decomposition of positive polynomials with rational coefficients, Journal of Pure and Applied Algebra 228 (2024), article 107631, doi:10.1016/j.jpaa.2024.107631, https://doi.org/10.1016/j.jpaa.2024.107631; preprint arXiv:2312.16801, https://arxiv.org/abs/2312.16801
- S. Laplagne, Facial reduction for exact polynomial sum of squares decomposition, Mathematics of Computation 89 (2020), 859–877, doi:10.1090/mcom/3476, https://doi.org/10.1090/mcom/3476; preprint arXiv:1810.04215, https://arxiv.org/abs/1810.04215
- M. K. Keshari, D. Ojha and N. S. Patra, Descent problem for certificate of non-negativity on semi-algebraic sets, preprint arXiv:2508.07060 (2025), https://arxiv.org/abs/2508.07060
- K. Schmüdgen, The K-moment problem for compact semi-algebraic sets, Mathematische Annalen 289 (1991), 203–206, doi:10.1007/BF01446568, https://doi.org/10.1007/BF01446568
- M. Putinar, Positive polynomials on compact semi-algebraic sets, Indiana University Mathematics Journal 42 (1993), no. 3, 969–984, doi:10.1512/iumj.1993.42.42045, https://doi.org/10.1512/iumj.1993.42.42045