Skip to content

Erdős Problem #114

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

For a complex polynomial \(p(z)\), its unit lemniscate is the locus of points with \(|p(z)|=1\). It can consist of one or several closed curves, with complicated shapes and sometimes singular crossings. Erdős, Herzog and Piranian asked: among monic polynomials of a fixed degree \(n\), is the total arclength of that locus largest for

\[ p(z)=z^n-1? \]

“Monic” means that the coefficient of \(z^n\) equals one. Without this normalization, multiplying a polynomial by a constant changes the level set and its geometry.

A small example

For \(p(z)=z^n\), the condition \(|p(z)|=1\) is simply \(|z|=1\); its lemniscate is the unit circle and has length \(2\pi\) for every \(n\). By contrast, the petals of \(|z^n-1|=1\) have total length asymptotic to \(2n+4\log2\), much longer for large \(n\). The latter value does not follow from counting the number of petals alone: the length of each must be integrated.

The conjecture is an exact finite-degree extremal assertion, not only a leading-order estimate.

What is known

PROVED for all sufficiently large degrees; the all-degree formulation remains unconfirmed. Terence Tao's The maximal length of the Erdős–Herzog–Piranian lemniscate in high degree, submitted 13 December 2025, proves that for every sufficiently large \(n\), the maximizing lemniscate is the one for \(z^n-1\). Tao's author exposition explains the exact relation to the older conjecture.

Earlier Eremenko and Hayman proved the case \(n=2\); Fryntov and Nazarov had already shown the asymptotic extremal length

\[ \sup_{p\text{ monic, }\deg p=n}\ell(\{|p|=1\})=2n+O(n^{7/8}). \]

Thus the leading asymptotic scale is settled, but it is not logically valid to infer every intermediate degree from a theorem that requires sufficiently large \(n\) and one isolated small case. The maintained catalogue labels #114 “falsifiable/open” for this reason. The 2025 source is a preprint and its full proof is not independently reproduced here.

GCL's current state

The pinned registry and maintained Erdős #114 classify the original all-degree question as FALSIFIABLE. Issue: #1383. This article records Tao's proved high-degree boundary without asserting an all-degree solution or verifying the community-posted small-degree manuscripts.

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 successor is to compute the arclength of the degree-one lemniscate \(|z-a|=1\) and show translation leaves length unchanged. Then audit the available \(n=2\) source and distinguish exact finite degree from “all sufficiently large.” Acceptance: unit-circle length \(2\pi\) independently checked, the correct translation-invariance statement, and no extrapolation from the large-degree theorem.

Sources and claim boundaries

No all-degree proof, original source-proof certification or editorial admission is claimed.

Catalogue and evidence provenance

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