Skip to content

Erdős Problem #119

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (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

Choose an infinite sequence \(z_1,z_2,\ldots\) on the complex unit circle, so that \(|z_j|=1\). Form the polynomials

\[ p_n(z)=\prod_{j=1}^n(z-z_j), \qquad M_n=\max_{|z|=1}|p_n(z)|. \]

Erdős #119 contains three distinct growth questions: must \(\limsup M_n\) be infinite? Must \(M_n>n^c\) occur for infinitely many \(n\) and some fixed \(c>0\)? Finally, must there be \(c>0\) such that for all sufficiently large \(N\),

\[ \sum_{n\le N}M_n>N^{1+c}? \]

The first two concern an unbounded subsequence or individual peaks. The third concerns the sum of all initial values. An occasional large peak does not automatically settle the sum question.

A small example

Take \(z_j=1\) for every \(j\). Then \(p_n(z)=(z-1)^n\), and the maximum on the unit circle is at \(z=-1\), giving \(M_n=2^n\). All three proposed growth conclusions hold dramatically for this particular sequence. The real problem is a universal assertion over every sequence \((z_j)\).

In general the point \(z\) maximizing \(|p_n(z)|\) can vary with \(n\); replacing \(\max_{|z|=1}\) by evaluation at one fixed point invalidates the definition.

What is known

PARTIALLY SOLVED: the first two statements are proved, the third remains OPEN. Gerold Wagner proved a quantitative form of the first, obtaining \(M_n>(\log n)^c\) infinitely often for some positive constant \(c\).

József Beck proved a polynomial peak bound: for some \(c>0\), and arbitrarily large \(N\),

\[ \max_{n\le N}M_n>N^c. \]

His primary source is The modulus of polynomials with zeros on the unit circle: A problem of Erdős, Annals of Mathematics 134 (1991), 609–651. This solves the second question as recorded in the maintained catalogue.

The third cumulative question, \(\sum_{n\le N}M_n>N^{1+c}\) eventually, is not settled by Beck's peak bound. A hypothetical single high peak among many small terms illustrates the logical gap: to force an \(N^{1+c}\) sum, one needs enough mass, not merely one peak of unspecified exponent \(c\).

The pinned catalogue labels #119 generically SOLVED, reflecting the historical resolution of the headline question; the maintained Erdős #119, edited January 2026, explicitly retains the third question as open. Its mixed status must not be flattened into a full solution.

GCL's current state

The canonical source issue is #1388. The source-fidelity audit identifies each quantified subquestion and records which historic theorem addresses it. Beck's Annals bibliographic record is primary; the full 1991 proof and Wagner's original 1980 argument have not been independently reproduced. Reported formalizations are not claimed to settle the cumulative question.

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 is to verify \(M_n=2^n\) for the constant sequence \(z_j=1\), prove the exact finite geometric-sum formula \(\sum_{n\le N}2^n=2^{N+1}-2\), and formalize the distinction between “infinitely often peaks” and “eventual cumulative growth.” Acceptance: quantify the fixed exponent \(c\) and preserve every existential/universal order. Stop before claiming a solution of the third problem.

Sources and claim boundaries

No new estimate for the cumulative sum, independent full source proof or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1388 — 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.

Back to catalogue · Compendium introduction