In mathematics, a positive polynomial (respectively non-negative polynomial) on a particular set is a polynomial whose values are positive (respectively non-negative) on that set. Precisely, Let be a polynomial in variables with real coefficients and let be a subset of the -dimensional Euclidean space . We say that:
For certain sets , there exist algebraic descriptions of all polynomials that are positive (resp. non-negative) on . Such a description is a positivstellensatz (resp. nichtnegativstellensatz). The importance of Positivstellensatz theorems in computation arises from its ability to transform problems of polynomial optimization into semidefinite programming problems, which can be efficiently solved using convex optimization techniques. [1]
A real univariate polynomial is non-negative on if and only if it is a sum of two squares of real univariate polynomials. [2] This equivalence does not generalize to multivariate polynomials, which was originally shown by Hilbert. An explicit example of such a polynomial was not known until Theodore Motzkin showed in 1967 that is not a sum of squares of polynomials but is non-negative on , which follows from the AM-GM inequality. [3]
In higher dimensions, a real polynomial in variables is non-negative on if and only if it is a sum of squares of real rational functions in variables. This was originally posed as Hilbert's seventeenth problem in 1900, and later solved by Emil Artin in 1927. [4]
For homogeneous polynomials, more information can be determined about the denominator. Suppose that is homogeneous of degree 2k. If it is positive on , then there exists an integer such that is a sum of squares of homogeneous polynomials of degree . [5]
For polynomials of degree we have the following variant of Farkas lemma: If have degree and for every satisfying , then there exist non-negative real numbers such that .
For higher degree polynomials on the simplex, Pólya showed that if is homogeneous and positive on the set , then there exists an integer such that has non-negative coefficients. [6]
For higher degree polynomials on general compact polytopes, we have Handelman's theorem: [7] If is a compact polytope in Euclidean -space, defined by linear inequalities , and if is a polynomial in variables that is positive on , then can be expressed as a linear combination with non-negative coefficients of products of members of .
For general semialgebraic sets, the most general result is Stengle's Positivstellensatz.
For compact semialgebraic sets we have Schmüdgen's positivstellensatz, [8] [9] Putinar's positivstellensatz [10] [11] and Vasilescu's positivstellensatz. [12] In particular, no denominators are needed.
For sufficiently nice compact semialgebraic sets of low dimension, there exists a nichtnegativstellensatz without denominators. [13] [14] [15]
Positivstellensatz also exist for signomials, [16] trigonometric polynomials, [17] polynomial matrices, [18] polynomials in free variables, [19] quantum polynomials, [20] and definable functions on o-minimal structures. [21]
{{cite book}}: CS1 maint: location missing publisher (link) CS1 maint: others (link)