Documentation

FormalConjectures.HilbertProblems.«17»

Hilbert's 17th problem #

Let $f(x_1, \dots, x_n)$ be a multivariable polynomial with real coefficients that takes only nonnegative values for all real inputs. Hilbert's 17th problem asks whether there exist rational functions $g_1, \dots, g_m$ such that $f = g_1^2 + g_2^2 + \cdots + g_m^2$. Resolved affirmatively by Artin in 1927. References:

theorem Hilbert17.hilbert_17th_problem {n : } (hn : 0 < n) (f : MvPolynomial (Fin n) ) (h : ∀ (x : Fin n), 0 (MvPolynomial.eval x) f) :
∃ (m : ) (g : Fin mMvRatFunc (Fin n) ), (algebraMap (MvPolynomial (Fin n) ) (MvRatFunc (Fin n) )) f = i : Fin m, g i ^ 2

Hilbert's 17th problem: every non-negative multivariate polynomial is a sum of squares of rational functions.

noncomputable def Hilbert17.f :

The statement is false in general if we restrict to polynomials. The polynomial (by Motzkin) $f(x, y) = x^4 y^2 + x^2 y^4 - 3 x^2 y^2 + 1$ takes only nonnegative values but cannot be written as a sum of squares of polynomials.

Equations
Instances For

    The Motzkin polynomial is non-negative everywhere.

    theorem Hilbert17.f_not_sum_of_squares :
    ¬∃ (n : ) (_ : 0 < n) (S : Fin nMvPolynomial (Fin 2) ), f = i : Fin n, S i ^ 2

    The Motzkin polynomial cannot be written as a sum of squares of polynomials.

    For the polynomial version, Hilbert showed that every nonnegative homogeneous polynomial in $n$ variables of degree $2d$ can be written as a sum of squares of polynomials if and only if

    • $n = 1$
    • $n = 2$
    • $d = 1$
    • $(n, d) = (3, 2)$.
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem Hilbert17.hilbert_17th_problem_poly {n d : } (hn : 0 < n) (hd : 0 < d) :

      Hilbert's 17th problem for homogeneous polynomials: characterization of dimensions and degrees where non-negative polynomials are sums of squares of polynomials.