Table of Contents
Fetching ...

Degree bounds for Putinar's Positivstellensatz on the hypercube

Lorenzo Baldi, Lucas Slot

TL;DR

This work studies Putinar's Positivstellensatz on the hypercube $[-1,1]^n$ and derives explicit degree bounds for Putinar-type representations. It proves an upper bound of the form $f \in \mathcal{Q}(1-x_1^2,\dots,1-x_n^2)_{rn}$ with $r \ge 4\mathfrak{c} d^2 (\log n) \frac{f_{\max}}{f_{\min}} + O\left(\frac{f_{\max}}{f_{\min}}\right)^{1/2}$, together with a matching lower bound $r = \Omega\left(\frac{f_{\max}}{f_{\min}}\right)^{1/8}$, establishing the first Putinar-type lower bound for a hypercube with interior. The approach combines an outer-domain Schmüdgen-type certificate on a scaled hypercube with degree-shift lifting to the Putinar module on $[-1,1]^n$, leveraging Markov-type inequalities and Chebyshev bounds. These results significantly improve prior general bounds (which were exponential or superpolynomial in the key ratio) and have direct implications for the convergence rate of the moment-SOS hierarchy in polynomial optimization on the hypercube. The paper also discusses extensions to descriptions using $1\pm x_i$, and provides constructive examples illustrating the inherent degree growth in Putinar certificates, along with connections to stability theory and potential avenues for improving bounds under local optimality conditions.

Abstract

The Positivstellensätze of Putinar and Schmüdgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of these results, namely to show bounds on the required degree of the sums of squares in such representations. These effective Positivstellensätze have direct implications for the convergence rate of the celebrated moment-SOS hierarchy in polynomial optimization. In this paper, we restrict to the fundamental case of the hypercube $\mathrm{B}^{n} = [-1, 1]^n$. We show an upper degree bound for Putinar-type representations on $\mathrm{B}^{n}$ of the order $O(f_{\max}/f_{\min})$, where $f_{\max}$, $f_{\min}$ are the maximum and minimum of $f$ on $\mathrm{B}^{n}$, respectively. Previously, specialized results of this kind were available only for Schmüdgen-type representations and not for Putinar-type ones. Complementing this upper degree bound, we show a lower degree bound in $Ω(\sqrt[8]{f_{\max}/f_{\min}})$. This is the first lower bound for Putinar-type representations on a semialgebraic set with nonempty interior described by a standard set of inequalities.

Degree bounds for Putinar's Positivstellensatz on the hypercube

TL;DR

This work studies Putinar's Positivstellensatz on the hypercube and derives explicit degree bounds for Putinar-type representations. It proves an upper bound of the form with , together with a matching lower bound , establishing the first Putinar-type lower bound for a hypercube with interior. The approach combines an outer-domain Schmüdgen-type certificate on a scaled hypercube with degree-shift lifting to the Putinar module on , leveraging Markov-type inequalities and Chebyshev bounds. These results significantly improve prior general bounds (which were exponential or superpolynomial in the key ratio) and have direct implications for the convergence rate of the moment-SOS hierarchy in polynomial optimization on the hypercube. The paper also discusses extensions to descriptions using , and provides constructive examples illustrating the inherent degree growth in Putinar certificates, along with connections to stability theory and potential avenues for improving bounds under local optimality conditions.

Abstract

The Positivstellensätze of Putinar and Schmüdgen show that any polynomial positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of these results, namely to show bounds on the required degree of the sums of squares in such representations. These effective Positivstellensätze have direct implications for the convergence rate of the celebrated moment-SOS hierarchy in polynomial optimization. In this paper, we restrict to the fundamental case of the hypercube . We show an upper degree bound for Putinar-type representations on of the order , where , are the maximum and minimum of on , respectively. Previously, specialized results of this kind were available only for Schmüdgen-type representations and not for Putinar-type ones. Complementing this upper degree bound, we show a lower degree bound in . This is the first lower bound for Putinar-type representations on a semialgebraic set with nonempty interior described by a standard set of inequalities.
Paper Structure (18 sections, 27 theorems, 115 equations, 1 figure, 1 table)

This paper contains 18 sections, 27 theorems, 115 equations, 1 figure, 1 table.

Key Result

Theorem 1

Assume that $\mathcal{S}(\mathbf{g}) \subseteq \mathbb{R}^n$ is compact. We then have:

Figures (1)

  • Figure 1: Example of the key regions involved in the proof of \ref{['THM:main']} for $n=2$ and $q = 1, 2$ (on the left, right, respectively). The shaded regions depict the sets: $\mathrm{B}^{n} = [-1, 1]^n \subseteq \mathcal{S}(n-\| \mathbf{x} \|^{2q}_{2q}) \subseteq [-\eta, \eta]^n = \mathrm{D}.$

Theorems & Definitions (49)

  • Theorem 1: Schmüdgen's Positivstellensatz Schmudgen:positiv
  • Theorem 2: Putinar's Positivstellensatz Putinar:positiv
  • Theorem 3: Upper degree bound
  • Theorem 4: Lower degree bound
  • Theorem 5: BaldiMourrainParusinski:putinar
  • Definition 6: CQC
  • Corollary 7: BaldiMourrain:putinar, BaldiMourrainParusinski:putinar
  • Theorem 8: LaurentSlot:hypercube
  • Conjecture 9: de Klerk & Laurent, 2010
  • Theorem 10: Magron:putinar
  • ...and 39 more