Nonnegative Polynomial
   HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a positive polynomial (respectively non-negative polynomial) on a particular
set Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
is a
polynomial In mathematics, a polynomial is a Expression (mathematics), mathematical expression consisting of indeterminate (variable), indeterminates (also called variable (mathematics), variables) and coefficients, that involves only the operations of addit ...
whose values are positive (respectively non-negative) on that set. Precisely, Let p be a polynomial in n variables with real
coefficient In mathematics, a coefficient is a Factor (arithmetic), multiplicative factor involved in some Summand, term of a polynomial, a series (mathematics), series, or any other type of expression (mathematics), expression. It may be a Dimensionless qu ...
s and let S be a
subset In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
of the n-dimensional
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
\mathbb^n. We say that: * p is positive on S if p(x)>0 for every x in S. * p is non-negative on S if p(x)\ge 0 for every x in S.


Positivstellensatz (and nichtnegativstellensatz)

For certain sets S, there exist algebraic descriptions of all polynomials that are positive (resp. non-negative) on S. 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 Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) over the intersection of the cone of po ...
problems, which can be efficiently solved using
convex optimization Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems ...
techniques.


Examples of positivstellensatz (and nichtnegativstellensatz)

* Globally positive polynomials and sum of squares decomposition. ** Every real polynomial in one variable is non-negative on \mathbb
if and only if In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either bo ...
it is a sum of two squares of real ''polynomials'' in one variable. This equivalence does not generalize for polynomial with more than one variable: for instance, the Motzkin polynomial X^4Y^2+X^2Y^4-3X^2Y^2+1 is non-negative on \mathbb^2 but is not a sum of squares of elements from \mathbb ,Y/math>. ( Motzkin showed that it was positive using the
AM–GM inequality In mathematics, the inequality of arithmetic and geometric means, or more briefly the AM–GM inequality, states that the arithmetic mean of a list of non-negative real numbers is greater than or equal to the geometric mean of the same list; and ...
.) ** A real polynomial in n variables is non-negative on \mathbb^n if and only if it is a sum of squares of real ''rational'' functions in n variables (see
Hilbert's seventeenth problem Hilbert's seventeenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by David Hilbert. It concerns the expression of positive definite rational functions as sums of quotients of squares. The original que ...
and Artin's solution). ** Suppose that p\in\mathbb _1,\dots,X_n/math> is
homogeneous Homogeneity and heterogeneity are concepts relating to the uniformity of a substance, process or image. A homogeneous feature is uniform in composition or character (i.e., color, shape, size, weight, height, distribution, texture, language, i ...
of even degree. If it is positive on \mathbb^n\setminus\, then there exists an
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
m such that (X_1^2+\cdots+X_n^2)^mp is a sum of squares of elements from \mathbb _1,\dots,X_n/math>. * Polynomials positive on
polytope In elementary geometry, a polytope is a geometric object with flat sides ('' faces''). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions as an ...
s. ** For polynomials of degree\le 1 we have the following variant of Farkas lemma: If f,g_1,\dots,g_k have degree\le 1 and f(x)\ge 0 for every x\in\mathbb^n satisfying g_1(x)\ge 0,\dots,g_k(x)\ge 0, then there exist non-negative real numbers c_0,c_1,\dots,c_k such that f=c_0+c_1g_1+\cdots+c_kg_k. ** Pólya's theorem: If p\in\mathbb _1,\dots,X_n/math> is homogeneous and p is positive on the set \, then there exists an integer m such that (x_1+\cdots+x_n)^mp has non-negative coefficients. ** Handelman's theorem: If K is a compact polytope in Euclidean d-space, defined by linear inequalities g_i\ge 0, and if f is a polynomial in d variables that is positive on K, then f can be expressed as a linear combination with non-negative coefficients of products of members of \. * Polynomials positive on
semialgebraic set In mathematics, a basic semialgebraic set is a set defined by polynomial equalities and polynomial inequalities, and a semialgebraic set is a finite union of basic semialgebraic sets. A semialgebraic function is a function with a semialgebraic gr ...
s. ** The most general result is Stengle's Positivstellensatz. ** For compact semialgebraic sets we have Schmüdgen's positivstellensatz, Putinar's positivstellensatz and Vasilescu's positivstellensatz. The point here is that no denominators are needed. ** For nice compact semialgebraic sets of low dimension, there exists a nichtnegativstellensatz without denominators.


Generalizations of positivstellensatz

Positivstellensatz also exist for signomials,
trigonometric polynomial In the mathematical subfields of numerical analysis and mathematical analysis, a trigonometric polynomial is a finite linear combination of functions sin(''nx'') and cos(''nx'') with ''n'' taking on the values of one or more natural numbers. The c ...
s, polynomial matrices, polynomials in free variables, quantum polynomials, and definable functions on o-minimal structures.


Notes


Further reading

* Bochnak, Jacek; Coste, Michel; Roy, Marie-Françoise. ''Real Algebraic Geometry''. Translated from the 1987 French original. Revised by the authors. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) esults in Mathematics and Related Areas (3) 36. Springer-Verlag, Berlin, 1998. . * Marshall, Murray. "Positive polynomials and sums of squares". ''Mathematical Surveys and Monographs'', 146. American Mathematical Society, Providence, RI, 2008. , {{ISBN, 0-8218-4402-4.


See also

*
Polynomial SOS In mathematics, a form (i.e. a homogeneous polynomial) ''h''(''x'') of degree 2''m'' in the real ''n''-dimensional vector ''x'' is sum of squares of forms (SOS) if and only if there exist forms g_1(x),\ldots,g_k(x) of degree ''m'' such that h(x) ...
*
Hilbert's seventeenth problem Hilbert's seventeenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by David Hilbert. It concerns the expression of positive definite rational functions as sums of quotients of squares. The original que ...
*
Hilbert's Nullstellensatz In mathematics, Hilbert's Nullstellensatz (German for "theorem of zeros", or more literally, "zero-locus-theorem") is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic ge ...
for algebraic descriptions of polynomials that are zero on a set ''S.'' Real algebraic geometry