The Setting
A signing of length is a vector of real numbers, each equal to or .✦ For a vector of real numbers and a complex number , put (1)✦ when is a signing, is its Littlewood polynomial. Let be the least value of over the signings of length . By Parseval’s identity , and the flatness problem asks how close to the value comes for large .
The item is the deduction of Theorem 1.1 of the OpenAI preprint Asymptotically minimal maxima of real Littlewood polynomials (September 2026) from its reduction to approximation and rounding, in which a vector of real coefficients in with a nearly flat trigonometric polynomial is rounded to a signing. The library states the deduction as five separate facts: a parametrization of the unit circle, a choice of a small positive parameter , a bound on the defect mass of a vector (defined below), an entropy inequality, and the rounding itself.
Phases, Energy and Defect Mass
The phase of a real number is the point of the unit circle, and denotes the phase of : (2)✦
The energy of a vector in is , and its trigonometric polynomial is the function on given by (3)
The defect mass of a vector of real numbers is the real number (4)✦
For a parameter with , the constant is (5)
The Claim
Theorem 1.
For every complex number with there is a with (6)✦
For every there is a with and, with as in (5), (7)✦
Let , let be a real number, and let have energy at least . Then its defect mass satisfies (8)✦
Let , and be real numbers with , and . Then, the left side being when , (9)✦
Let , let satisfy , let and be real numbers, and let have energy at least and satisfy for every . Then there is a signing of length such that, for every complex number with , (10)✦
In the paper, the result reads: a vector of length with energy at least has ; for ; hence for a constant , and one lets .
What Is Checked
The statements are made over vectors in , with their energy, defect mass and trigonometric polynomial in the phase , and over signings with the values of their Littlewood polynomials on the unit circle.