Hilbert's 17th Problem and the Champagne Problem
In a non-constructive way it was proved by Becker that \[ B(t)= {1+t^2 \over 2+ t^2} \in Q(t) \] is a sum of \(2n\)th powers in \(Q(t)\). He offered a bottle of champagne to the first person to find an explicit representation. The author of the present article starts out with this problem and then goes back to history giving a short overview of the development of the theory of ordering and ordered fields. She shows how, similar to solution of Hilbert's 17th problem via Artin-Schreier theory, the modern theory of orderings of higher level leads to Becker's proof. Finally she mentions that the constructive proof of Hilbert's 17th problem was extended by Reznick to a solution of the champagne problem \(R(t)\) and gives the explicit formula.
This page was built for publication: Hilbert's 17th Problem and the Champagne Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345022)
