Erdős Problem #228
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: analysis, polynomials.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
For each sufficiently large integer \(n\), can we choose a polynomial \(P(z)\) of degree exactly \(n\) whose coefficients are all \(+1\) or \(-1\), such that its absolute value remains comparable to \(\sqrt n\) at every point of the complex unit circle?
where the positive constants \(c,C\) are independent of \(n\) and \(z\). These are called flat Littlewood polynomials. The pointwise lower bound is as important as the upper bound.
A small example
The polynomial \(1+z+\cdots+z^n\) has the required coefficient alphabet, but at \(z=1\) its modulus equals \(n+1\), much larger than \(\sqrt n\). Other simple sign choices may vanish on the unit circle and violate the lower bound.
Parseval's identity gives
Therefore the natural overall scale of the modulus is indeed \(\sqrt{n+1}\), but an average-square identity cannot guarantee uniform bounds away from zero and infinity.
What is known
PROVED for every integer degree at least two. Paul Balister, Béla Bollobás, Robert Morris, Julian Sahasrabudhe and Marius Tiba, Flat Littlewood polynomials exist, Annals of Mathematics 192 (2020), 977–1004, established the existence of absolute constants \(0<\delta<\Delta\) and, for each degree \(n\), a polynomial of that degree with coefficients in \(\{-1,1\}\) satisfying
at all points of the unit circle. This resolved Littlewood's 1966 conjecture, as recorded in Erdős #228.
The argument is substantially deeper than constructing low-peak polynomial sequences: both sides must hold at every angle. Contrast #230, where unimodular complex coefficients, rather than signs, permit much flatter asymptotics.
GCL's current state
Pinned and maintained status: PROVED. Original source issue: #1497. The original Annals article, author list and every-degree quantifier were verified. GCL has not independently replayed the probabilistic construction or certified external Lean proof artifacts.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded task enumerates coefficients in \(\{-1,1\}\) for degrees from 2 through 8 inclusive, evaluates the modulus on a fine angular mesh and then certifies any proposed full-circle lower bound using derivative Lipschitz estimates. Acceptance: report \(\min_{|z|=1}|P(z)|\) and \(\max_{|z|=1}|P(z)|\) with numerical error bounds, without extrapolating finite small-degree results into the uniform all-degree theorem.
Sources and claim boundaries
- Balister–Bollobás–Morris–Sahasrabudhe–Tiba, Annals (2020), primary proof.
- Erdős #228; source issue #1497.
No new flat-polynomial construction, independent full proof or protected editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1497 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.