Sums of Squares Certificates for Polynomial Moment Inequalities.
Saved in:
| Title: | Sums of Squares Certificates for Polynomial Moment Inequalities. |
|---|---|
| Authors: | Klep, Igor1,2,3 (AUTHOR) igor.klep@fmf.uni-lj.si, Magron, Victor4 (AUTHOR) vmagron@laas.fr, Volčič, Jurij5 (AUTHOR) jurij.volcic@auckland.ac.nz |
| Source: | Foundations of Computational Mathematics. Jun2026, Vol. 26 Issue 3, p1381-1423. 43p. |
| Subjects: | Sum of squares, Semialgebraic sets, Polynomials, Bell's theorem, Hilbert, David, 1862-1943, Quantum theory, Semidefinite programming |
| Abstract: | This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported on semialgebraic sets and subject to moment polynomial constraints is investigated. On the one hand, a positive solution to Hilbert's 17th problem for pseudo-moments is given. On the other hand, moment polynomials positive on actual measures are shown to be sums of squares and formal moments of squares up to arbitrarily small perturbation of their coefficients. When only measures supported on a bounded semialgebraic set are considered, a stronger algebraic certificate for moment polynomial positivity is derived. This result gives rise to a converging hierarchy of semidefinite programs for moment polynomial optimization. Finally, as an application, two open nonlinear Bell inequalities from quantum physics are settled. [ABSTRACT FROM AUTHOR] |
| Copyright of Foundations of Computational Mathematics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported on semialgebraic sets and subject to moment polynomial constraints is investigated. On the one hand, a positive solution to Hilbert's 17th problem for pseudo-moments is given. On the other hand, moment polynomials positive on actual measures are shown to be sums of squares and formal moments of squares up to arbitrarily small perturbation of their coefficients. When only measures supported on a bounded semialgebraic set are considered, a stronger algebraic certificate for moment polynomial positivity is derived. This result gives rise to a converging hierarchy of semidefinite programs for moment polynomial optimization. Finally, as an application, two open nonlinear Bell inequalities from quantum physics are settled. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 16153375 |
| DOI: | 10.1007/s10208-025-09703-z |
