OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.1: For every η>0\eta > 0 and every large NN, some signing of length NN has |Pε|≤(1+η)N|P_\varepsilon| \le (1+\eta)\sqrt{N} on the unit circle

Real Littlewood polynomials with maximum modulus close to N\sqrt{N}..

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

The polynomial PXP_X of a vector X=(X0,…,XN−1)X = (X_0, \dots, X_{N-1}) of NN real coefficients, indexed from 00, is the function of a complex variable zz given by PX(z)=∑k=0N−1Xkzk.P_X(z) = \sum_{k=0}^{N-1} X_k z^k .(1) A signing of length NN is a vector ε=(ε0,…,εN−1)\varepsilon = (\varepsilon_0, \dots, \varepsilon_{N-1}) of real numbers each equal to −1-1 or 11, and PεP_\varepsilon is then the Littlewood polynomial of ε\varepsilon.

The question is how close to N\sqrt{N} a choice of real signs can bring the maximum of |Pε||P_\varepsilon| on the unit circle as NN grows.

The Claim

Theorem 1. Let η\eta be a positive real number. There is an integer N0≥1N_0 \ge 1 such that every integer N≥N0N \ge N_0 has a signing ε\varepsilon of length NN with |Pε(z)|≤(1+η)Nfor every z∈ℂ with |z|=1.|P_\varepsilon(z)| \le (1 + \eta)\sqrt{N} \qquad \text{for every } z \in \mathbb{C} \text{ with } |z| = 1 .(2)✦

In the paper, the result reads: for Littlewood polynomials with real coefficients, lim⁡N→∞mN=1\lim_{N \to \infty} m_N = 1, with mNm_N the least value of max⁡|z|=1|Pε(z)|/N\max_{|z| = 1} |P_\varepsilon(z)| / \sqrt{N} over the signings ε\varepsilon of length NN; equivalently, for every η>0\eta > 0 there is N0N_0 such that for every integer N≥N0N \ge N_0 there are signs ε0,…,εN−1\varepsilon_0, \dots, \varepsilon_{N-1} with max⁡|z|=1|Pε(z)|≤(1+η)N\max_{|z| = 1} |P_\varepsilon(z)| \le (1 + \eta)\sqrt{N}.

What Is Checked

The claim (2) is stated over the signings of length NN and the polynomial (1) of a real coefficient vector, evaluated at every complex number of modulus 11.