OpenAI preprint, September 2026 · §4. Spreading Fourier coefficients
The binary recursion:For each
,
some
of the binary recursion is a trigonometric polynomial with
non-proportional positive frequencies of coefficient square sum at least
Functions on tori bounded by one, with spread Fourier
coefficients.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
Take a real function on the torus with values in , and expand it in the characters ,, where and . How close to can the square sum of its Fourier coefficients come when no two of its frequencies are proportional, except a frequency and its negative ? The binary recursion is an explicit construction for this question: a sequence of functions on , each obtained from the one before by adding a coordinate.
The Binary Recursion
A point of is written , with its first coordinate and the remaining ones. The binary recursion is the sequence of real functions on given by on the one-point torus and (1)✦
The torus carries its Haar probability measure, the product of the Haar probability measures of the circle in its coordinates, and integrals over are taken against it.✦The energy of is its mean square over :(2)✦
Positive Frequencies
An integer vector is positive if it is nonzero and its first nonzero coordinate equals .✦The linear form of an integer vector is the linear functional on given by .✦
The Claim
Theorem 1. For every and every ,(3)✦ and the energies of consecutive steps satisfy (4)✦ Let .For some there are a nonempty finite set of positive vectors in and nonzero complex numbers ,, such that (5)✦If and are distinct positive vectors in , then for every real (6)✦
What Is Checked
The claims are stated over the binary recursion of (1), its energy of (2) for the Haar probability measure on , the positive integer vectors and the linear forms of integer vectors.