On the Complexity of Hilbert's 17th Problem

Hilbert posed the following problem as the 17th in the list of 23 problems in his famous 1900 lecture: Given a multivariate polynomial that takes only non-negative values over the reals, can it be represented as a sum of squares of rational functions? In 1927, E. Artin gave an affirmative answer to this question. His result guaranteed the existence of such a finite representation and raised the following important question: What is the minimum number of rational functions needed to represent any non-negative n-variate, degree d polynomial? In 1967, Pfister proved that any n-variate non-negative polynomial over the reals can be written as sum of squares of at most 2 rational functions. In spite of a considerable effort by mathematicians for over 75 years, it is not known whether n + 2 rational functions are sufficient! In lieu of the lack of progress towards the resolution of this question, we initiate the study of Hilbert's 17th problem from the point of view of Computational Complexity. In this setting, the following question is a natural relaxation: What is the descriptive complexity of the sum of squares representation (as rational functions) of a non-negative, n-variate, degree d polynomial? We consider arithmetic circuits as a natural representation of rational functions. We are able to show, assuming a standard conjecture in complexity theory, that it is impossible that every non-negative, n-variate, degree four polynomial can be represented as a sum of squares of a small (polynomial in n) number of rational functions, each of which has a small size arithmetic circuit (over the rationals) computing it.

[1]  D. Hilbert.  Über die Darstellung definiter Formen als Summe von Formenquadraten , 1888 .

[2]  D. Hilbert.  Über ternäre definite Formen , 1893 .

[3]  G. M..  Grundlagen der Geometrie , 1909, Nature.

[4]  E. Artin.  Über die Zerlegung definiter Funktionen in Quadrate , 1927 .

[5]  A. Pfister.  Zur Darstellung definiter Funktionen als Summe von Quadraten , 1967 .

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[8]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[9]  G. Stengle.  A nullstellensatz and a positivstellensatz in semialgebraic geometry , 1974 .

[10]  F. Browder.  Mathematical developments arising from Hilbert problems , 1976 .

[11]  Irving Kaplansky.  Review: Felix E. Browder, Mathematical developments arising from Hilbert problems , 1977 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  B. Reznick,et al.  The Pythagoras number of some affine algebras and local algebras. , 1982 .

[14]  Oscar H. Ibarra,et al.  Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs , 1983, JACM.

[15]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[16]  Erich Kaltofen,et al.  Greatest common divisors of polynomials given by straight-line programs , 1988, JACM.

[17]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[18]  B. Reznick.  Uniform denominators in Hilbert's seventeenth problem , 1995 .

[19]  Olga Taussky-Todd.  SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

[20]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[21]  Marie-Françoise Roy,et al.  Witt Rings in Real Algebraic Geometry , 1998 .

[22]  Charles N. Delzell,et al.  Positive Polynomials: From Hilbert’s 17th Problem to Real Algebra , 2001 .

[23]  B. Reznick,et al.  A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra , 2001 .

[24]  Grigoriy Blekherman.  There are significantly more nonegative polynomials than sums of squares , 2003, math/0309130.

[25]  Rüdger Thiele,et al.  Hilbert's Twenty-Fourth Problem , 2002, Journal of Automated Reasoning.