Degree bounds for Putinar's Positivstellensatz on the hypercube

The Positivstellens"atze of Putinar and Schm"udgen 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"atze 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 Bn = [-1, 1]n. We show an upper degree bound for Putinar-type representations on Bn of the order O(fmax/fmin), where fmax, fmin are the maximum and minimum of f on Bn, respectively. Previously, specialized results of this kind were available only for Schm"udgen-type representations and not for Putinar-type ones. Complementing this upper degree bound, we show a lower degree bound in Omega(√[8]fmax/fmin). This is the first lower bound for Putinar-type representations on a semialgebraic set with nonempty interior described by a standard set of inequalities.