Skip to content

Erdős Problem #1120

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: 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.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

A polynomial can have a complicated lemniscate: the region where its absolute value is at most one.

Erdős Problem #1120 considers a monic polynomial of degree \(n\), all of whose zeros are inside the closed unit disk, and the set

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

How long must the shortest path inside \(E\) be when it starts at the origin and finishes anywhere on the unit circle \(|z|=1\)?

The main question is about the worst-case shortest length as a function of degree, not the length for an arbitrarily chosen example.

A small example

For \(f(z)=z^n\),

\[ E=\{z:|z|\le1\}. \]

The straight path from \(0\) to \(1\) lies entirely in \(E\) and has length exactly one. Conversely, any curve from the origin to a point of modulus one has length at least one by the triangle inequality. Thus the shortest allowable length for this polynomial is exactly

\[ L(z^n)=1 \]

for every \(n\ge1\).

This gives a sharp elementary example of the trivial lower bound, but it cannot bound the worst case over all monic degree‑\(n\) polynomials.

What is known

The catalogue attributes the original question to Erdős via Hayman (1974), Problem 4.22. It reports a result of Clunie and Netanyahu, communicated privately, that some path of the required kind always exists.

Erdős expected the maximum of these shortest lengths to increase with degree, although slowly. The exact growth remains open.

The difficulty comes from the geometry of the sublevel region: even though the zeros lie near the origin, the set \(E\) need not resemble a disk. A connected route from the origin to the boundary may have to wind around complicated narrow regions.

GCL's current state

Authenticated source audit #2391 proves the monomial case with exact metric reasoning and distinguishes the existence of a path from minimizing its length.

The source statement was recovered from the indexed problem and LaTeX source. The reported original path-existence proof has not been obtained in a verifiable published form.

What remains

Obtain the original Hayman statement and a citable proof of the path-existence lemma. Investigate certified shortest paths for low-degree polynomials through exact semialgebraic geometry, then bound the maximum over all allowed polynomials. A single monomial case is not an asymptotic result.

Sources and claim boundaries

Erdős Problem #1120; original-statement transcription; Hayman (1974), p. 4.22; Clunie–Netanyahu, reported personal communication; GCL source audit. The monomial shortest path is independently exact. The general question remains open. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2391 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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