Let's use the Fundamental Theorem Algebra (FTA) and the Brahmagupta Fibonacci identity to prove that every non-negative polynnomial may be written as a sum of squares of polynomials.
Let and . By the Fundamental Theorem of Algebra, a degree polynomial has exactly complex roots, and our polynomial is of the form constant times a product of positive quadratics. The graph of the polynomial lies entirely above the x-axis, or touches it. So in the first case, the roots of p are all complex, whereas in the latter, has real roots with even multiplicity. Hence our polynomial is of the form
where is a real coefficient, the 's have degree 1, and 's have degree 2 and no real roots. We also note that by the complex conjugate root theorem, the roots of come in complex conjugate pairs. Also, does not intersect the x-axis, so the degree of must be even.
A monic positive quadratic , with no real roots, can be written as by completing the square. From here, an expression of as a sum of squares follows from the Brahmagupta-Fibonacci identity; the product of 's, hence a product of the sums of squares, can be written as the sum of squares. For example, the product of two quadratics
If the degree of is 2, then
where hence the sum of two squares.
If degree of is greater than or equal to 4, then we can write as the product of quadratics. By applying the Brahmagupta-Fibonacci identity as needed, the product of many sums of squares can be written as a sum of many squares.
Since the degree of is not odd, we have shown that a non-negative univariate polynomial is a sum of squares of polynomials.
Note that in the case that , where , is itself a square.