Erdős Problem #116
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
Take a monic polynomial with \(n\) complex roots, counting multiplicities, all in the closed unit disk:
Look at the planar area of the strict sublevel set \(L_p=\{z\in\mathbb C:|p(z)|<1\}\). Erdős, Herzog and Piranian asked how small that area can be. Their first proposed safeguard was a lower bound by an inverse power of \(n\); a stronger question asked for an inverse power of \(\log n\).
The symbol \(|L_p|\) here denotes Euclidean area, not curve length. That distinction separates this problem from #114.
A small example
If every root equals zero, then \(p(z)=z^n\). The condition \(|z^n|<1\) is equivalent to \(|z|<1\), so \(L_p\) is the unit disk and has area \(\pi\) for all \(n\). This gives an example with relatively large area, not a minimizing construction.
The zero-location hypothesis matters. The polynomial's roots must all lie inside the unit disk, though \(L_p\) itself need not be a disk or connected.
What is known
PROVED in its inverse-power and inverse-logarithm forms. A classical theorem of Pommerenke supplies an inverse polynomial lower bound, historically recorded as \(\gg n^{-4}\).
Manjunath Krishnapur, Erik Lundberg and Koushik Ramachandran's On the area of polynomial lemniscates, posted March 2025, proves the sharper universal estimate
for sufficiently large \(n\) and absolute positive constants. The upper bound is an example construction, not an upper bound required for every \(p\); the lower bound holds uniformly over all admissible polynomials.
Thus the first two historical formulations are answered affirmatively. The precise minimizing asymptotic between \(1/\log n\) and \(1/\log\log n\), and which polynomials attain the exact finite-degree minimum, remain questions beyond those results. The 2025 primary abstract also establishes complementary inradius estimates. GCL did not independently reproduce the analytic proof.
GCL's current state
The pinned registry and maintained Erdős #116 classify the problem PROVED. Original source assignment #1385. The 2025 primary theorem's quantifiers and comparison scales were checked. Neither a new minimizing polynomial nor an independent formal proof is claimed.
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 verify exactly that for \(p(z)=z^n\) the strict lemniscate has area \(\pi\), and prove that for every fixed exponent \(K>0\) the function \(1/\log n\) eventually exceeds \(n^{-K}\). Acceptance: strict versus non-strict boundary has zero area in this example, all roots satisfy the unit-disk condition, and the implication's quantifier is correctly stated. The universal lower bound remains an imported published theorem.
Sources and claim boundaries
- Krishnapur–Lundberg–Ramachandran, arXiv:2503.18270, primary abstract and quantitative estimates.
- Erdős #116, Pommerenke and Wagner historical bounds.
- GCL issue #1385.
No new extremal-area theorem, primary proof certification or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1385 — 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.