arxiv: 2604.03036 · v1 · submitted 2026-04-03 · 🧮 math.CV · math.CA· math.MG

Recognition: 2 theorem links

· Lean Theorem

A note on the Erd\"os minimal area problem

Subhajit Ghosh , Koushik Ramachandran

Authors on Pith no claims yet

Pith reviewed 2026-05-13 18:07 UTC · model grok-4.3

classification 🧮 math.CV math.CAmath.MG MSC 30C1531A15

keywords polynomial lemniscatesminimal areaErdős questionlogarithmic capacitycompact setscomplex analysispotential theory

0 comments

The pith

The minimal area of polynomial lemniscates is determined when all zeros lie on a compact set K with logarithmic capacity strictly larger than 1.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper resolves a question from Erdős, Herzog, and Piranian by finding the smallest possible area of the region where |p(z)| ≤ 1 for a polynomial p whose roots are all required to sit inside a given compact set K. The resolution applies only when the logarithmic capacity of K exceeds 1, a condition that prevents the area from being driven to zero by spreading the roots. Using tools from potential theory, the authors identify the exact infimum area that can be achieved under this root constraint. A reader would care because the result turns an open minimization problem into a concrete geometric statement tied directly to the capacity of the root set. The work stays within classical complex analysis yet gives an explicit answer where only a question existed before.

Core claim

We answer a question of Erdős, Herzog, and Piranian on the minimal area of polynomial lemniscates when all the zeros of the polynomial are constrained to lie on a compact set K whose logarithmic capacity is strictly larger than 1.

What carries the argument

Logarithmic capacity of the compact set K, which governs the admissible zero distributions and thereby fixes the lower bound on the area enclosed by the lemniscate |p(z)| ≤ 1.

If this is right

The infimum area is attained by at least one polynomial with zeros in K.
The same minimal area holds for every compact K meeting the capacity condition.
The bound cannot be improved by choosing higher-degree polynomials under the same root constraint.
The result supplies a positive lower bound that is independent of the particular shape of K beyond its capacity.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same capacity threshold may control minimal areas for other sublevel sets such as |p(z)| ≤ r for r ≠ 1.
The technique could extend to minimal-area problems for rational functions whose poles are constrained to K.
When capacity equals 1 the infimum may drop to zero, suggesting a sharp transition that could be tested numerically on circles of radius 1 and slightly larger.

Load-bearing premise

The compact set K must have logarithmic capacity strictly larger than 1.

What would settle it

An explicit sequence of polynomials with all zeros inside some K of capacity greater than 1 whose lemniscate areas approach a number smaller than the minimum derived in the paper.

read the original abstract

We answer a question of Erd\"os, Herzog, and Piranian on the minimal area of polynomial lemniscates when all the zeros of the polynomial are constrained to lie on a compact set K whose logarithmic capacity is strictly larger than 1.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Ghosh and Ramachandran close the Erdős-Herzog-Piranian question on minimal lemniscate area for zeros on K with cap(K) > 1 using standard potential theory.

read the letter

The paper settles an old question by showing that the minimal area of a polynomial lemniscate is attained precisely when the zeros lie on a compact K whose logarithmic capacity exceeds 1. They reach this by comparing the Green function of the complement with the area integral over the level sets of the polynomial, and the comparison yields the exact minimum under that hypothesis. The argument is direct and stays within classical tools, which is a strength here since it avoids unnecessary machinery. The result is new in the sense that the specific question had stayed open in the cited literature. The main limitation is the strict inequality cap(K) > 1; the paper states this upfront and does not claim to handle the boundary or sub-unit capacity cases, where the area can behave differently or fail to attain a minimum in the same way. No circular steps appear once the capacity condition is granted, and the derivation does not rely on unstated fitting or extra parameters. This note is for readers already working in potential theory and complex analysis who follow the Erdős problem. It is short, focused, and supplies a clean answer, so it is worth sending to a referee even if the revision list turns out to be short.

Referee Report

1 major / 0 minor

Summary. The manuscript claims to resolve a question of Erdős, Herzog, and Piranian on the minimal area of polynomial lemniscates with all zeros constrained to lie on a compact set K whose logarithmic capacity is strictly larger than 1. The resolution is framed via potential-theoretic comparison of the Green function and the area integral over the lemniscate, with the capacity hypothesis cap(K) > 1 serving as the key condition under which the minimal area is attained or computed.

Significance. If the result holds, it would provide a direct answer to a classical open problem in geometric function theory and potential theory. The explicit use of the capacity threshold distinguishes the attainable case from cap(K) ≤ 1 and supplies a concrete extremal value for the area, which could inform related questions on lemniscates and polynomial approximation.

major comments (1)

Abstract: the resolution of the Erdős–Herzog–Piranian question is asserted, but the text supplies no derivation, proof steps, or supporting calculations. The mathematical support for the central claim therefore cannot be verified from the available information.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the report and the recommendation for major revision. The central claim is established in the body of the note via a direct comparison between the Green function of the complement of K and the area integral over the level set of the polynomial, which yields an explicit minimal area precisely when cap(K) > 1. We address the single major comment below.

read point-by-point responses

Referee: Abstract: the resolution of the Erdős–Herzog–Piranian question is asserted, but the text supplies no derivation, proof steps, or supporting calculations. The mathematical support for the central claim therefore cannot be verified from the available information.

Authors: The manuscript is a short note whose argument occupies the main text: the area of the lemniscate {z : |p(z)| ≤ 1} is bounded from below by an integral involving the Green function g_K of the complement of K, and the capacity hypothesis cap(K) > 1 forces the infimum to be attained at a specific value obtained by comparing the Robin constant with the logarithmic capacity. We acknowledge that the steps are compressed and will expand them in the revision by inserting the explicit integral comparison, the application of the minimum principle for the Green function, and the resulting area formula. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The manuscript resolves an external open question posed by Erdős, Herzog, and Piranian. It proceeds under the explicit hypothesis that cap(K) > 1, using standard potential-theoretic comparisons between the Green function and the area integral over the lemniscate. No load-bearing step reduces to a self-definition, a fitted input renamed as prediction, or a self-citation chain; the capacity condition is an external hypothesis that excludes the case cap(K) ≤ 1 rather than being derived from the result itself. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on classical results from logarithmic potential theory, including the definition and properties of capacity and Green's functions on compact sets in the plane, without introducing new free parameters or invented entities.

axioms (1)

standard math Standard properties of logarithmic capacity, equilibrium measures, and Green's functions for compact sets in the complex plane
The minimal-area result is expressed in terms of capacity and therefore relies on these established facts from potential theory.

pith-pipeline@v0.9.0 · 5325 in / 1235 out tokens · 63711 ms · 2026-05-13T18:07:28.441628+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 3.1: for cap(K)≥t>1, A_n(K)≤exp(−ρ n) via Fekete polynomials and Bernstein inequality
IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Use of logarithmic capacity and Green-function comparison for area integrals

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

[1]

T. F. BLOOM,Erd¨ os problems.#1040,https://www.erdosproblems.com/1040. Accessed 2026-04-03

work page 2026
[2]

ERD ¨OS, F

P. ERD ¨OS, F. HERZOG,ANDG. PIRANIAN,Metric properties of polynomials, J. Analyse Math., 6 (1958), pp. 125–148

work page 1958
[3]

ERD ¨OS ANDE

P. ERD ¨OS ANDE. NETANYAHU,A remark on polynomials and the transfinite diameter, Israel J. Math., 14 (1973), pp. 23– 25

work page 1973
[4]

T. FENG, T. TRINH, G. BINGHAM, J. KANG, S. ZHANG, S.HYUNKIM, K. BARRETO, C. SCHILDKRAUT, J. JUNG, J. SEO, C. PAGANO, Y. CHERVONYI, D. HWANG, K. HOU, S. GUKOV, C.-C. TSAI, H. CHOI, Y. JIN, W.-Y. LI, H.-A. WU, R.-A. SHIU, Y.-S. SHIH, Q. V. LE,ANDT. LUONG,Semi-autonomous mathematics discovery with gemini: A case study on the erd¨ os problems, 2026. https://a...

work page arXiv 2026
[5]

GHOSH ANDK

S. GHOSH ANDK. RAMACHANDRAN,Number of components of polynomial lemniscates: a problem of Erd¨ os, Herzog, and Piranian, J. Math. Anal. Appl., 540 (2024), pp. Paper No. 128571, 21

work page 2024
[6]

KRISHNAPUR, E

M. KRISHNAPUR, E. LUNDBERG,ANDK. RAMACHANDRAN,On the area of polynomial lemniscates, 2025. https://arxiv.org/abs/2503.18270

work page arXiv 2025
[7]

POMMERENKE,On the derivative of a polynomial, Michigan Math

C. POMMERENKE,On the derivative of a polynomial, Michigan Math. J., 6 (1959), pp. 373–375

work page 1959
[8]

RANSFORD,Potential theory in the complex plane, vol

T. RANSFORD,Potential theory in the complex plane, vol. 28 of London Mathematical Society Student Texts, Cambridge University Press, Cambridge, 1995. DEPARTMENT OFMATHEMATICS, BAR-ILANUNIVERSITY, RAMATGAN, 5290002, ISRAEL Email address:ghoshsu1@biu.ac.il TATAINSTITUTE OFFUNDAMENTALRESEARCH, CENTRE FORAPPLICABLEMATHEMATICS, BANGALORE, INDIA- 560065 Email a...

work page 1995