Skip to content

Erdős Problem #115

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: polynomials, analysis.

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

Let \(p(z)\) be a complex polynomial of degree \(n\). The filled unit lemniscate is

\[ E_p=\{z\in\mathbb C:|p(z)|\le1\}. \]

Erdős asked whether, assuming \(E_p\) is connected, the largest modulus of the derivative there is at most \((1/2+o(1))n^2\). The connectedness condition is indispensable: far-apart roots can produce separated components and much larger derivatives at the boundary.

A small example

Take \(p(z)=z^n\). Its filled lemniscate is the closed unit disk, and \(|p'(z)|=n|z|^{n-1}\le n\). Thus the maximum is exactly \(n\), smaller than the conjectured quadratic worst-case scale. The monic Chebyshev-polynomial family supplies the large-derivative extremizers; an example with small derivative is not evidence of a sharper universal bound.

The statement is asymptotic. It permits a small positive error coefficient tending to zero, rather than asserting \(\max|p'|\le n^2/2\) for all degrees.

What is known

PROVED. Alexander Eremenko and László Lempert, An extremal problem for polynomials, Proceedings of the American Mathematical Society 122 (1994), 191–193, establish a stronger sharp comparison and identify scaled Chebyshev polynomials as extremizers.

In their theorem, after appropriate monic normalization and translation, the maximal derivative on the connected filled lemniscate is bounded by

\[ 2^{1/n-1}n^2. \]

The coefficient \(2^{1/n-1}\) tends to \(1/2\), giving the problem's asymptotic assertion. This exact coefficient matters: replacing it prematurely with \(1/2\) loses the finite-degree correction. The Eremenko–Lempert primary theorem and its characterization of equality are explicitly available in the author-hosted article; its full complex-analytic argument has not been independently replayed by GCL.

A community-linked Lean implementation is reported on the maintained problem page, but GCL has not run its exact toolchain and audited its axioms.

GCL's current state

The pinned catalogue and maintained Erdős #115 report PROVED. Original source issue: #1384. The author paper's main theorem and scaling coefficient were inspected. A third-party proof-assistant report is not treated as a protected kernel certificate.

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 proof task is to show that \(2^{1/n-1}\to1/2\) and hence the exact theorem implies the asserted \((1/2+o(1))n^2\) statement. Acceptance: explicitly quantify the \(o(1)\), preserve the connectedness of \(E_p\), and confirm the direct \(z^n\) derivative example. Stop short of claiming an independent proof of the extremal Eremenko–Lempert theorem itself.

Sources and claim boundaries

No new polynomial extremal inequality, independent Lean replay or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1384 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider 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