Erdős Problem #1215
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: disproved (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
Erdős Problem #1215 currently has source status DISPROVED — ENDPOINT NORMALIZATION REQUIRED.
Let \(P\) be any polynomial with \(P(0)=1\) and all zeros on the unit circle. Erdős–Herzog–Piranian asked whether there exists a universal length bound \(C\) for a path from the origin to the unit circle through the sublevel region \(\{z:|P(z)|<1\}\). Literally, \(0\) is NOT in this strict open sublevel because \(|P(0)|=1\). Thus any valid interpretation must permit the starting point on the boundary, with the path interior otherwise inside the strict sublevel. Without this endpoint normalization, no such continuous path has its image entirely in the stated open set, a trivial semantic impossibility that should not replace Mac Lane's substantive counterexample.
A small example
For \(P(z)=1-z\) (one root at \(z=1\) on the unit circle), \(P(0)=1\) and hence the origin lies on the boundary of \(\{|P|<1\}\). The open real segment \(0<t\le1\) satisfies \(|P(t)|=1-t<1\), while the starting endpoint \(t=0\) has equality. The phase25 fixture evaluates the 11 points \(t=0,0.1,\dots,1\). This is one easy path under the boundary-endpoint interpretation, not a universal length bound.
What is known
The maintained https://www.erdosproblems.com/1215 reports DISPROVED as a uniform bounded-length assertion by Mac Lane [Ma53]. Cohen [Co52] showed paths can exist for each polynomial; Loewner's example excludes every straight radial segment. Mac Lane's polynomials can force sublevel paths through arbitrarily complicated narrow corridors/labyrinths, so no universal path-length constant works. Repeating a loop is not a counterexample, since one asks for the existence of some short path; forcing all admissible paths to be long is essential. The precise labyrinth theorem and '\(|P|>2\) on compact \(A\)' normalization require original-source review.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Obtain EHP55, Cohen52 and Mac Lane53 original formulations, normalize boundary-point convention before comparing path lengths, and independently inspect labyrinth construction. Preserve substantive 'no uniform C' conclusion rather than claiming that \(P(0)=1\) alone resolves the intended problem.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1215 ; [EHP55],[Co52],[Ma53].
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2486 — 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.