Erdős–Herzog–Piranian lemniscate conjecture (Teng Zhang)
Awaiting review
The takeaway
Erdős, Herzog and Piranian conjectured in 1958 that among monic polynomials of degree n the lemniscate |p(z)| = 1 is longest for zⁿ − 1. Tao proved it for all large n in 2025; a new preprint claims every degree, using computer-assisted estimates for a finite range. The AI role disclosed is minor: editing, figures and ‘exploratory discussions of possible approaches to selected parts’.
Status
- Claim
Awaiting review
- Our reporting
- Medium confidence
- Verification
- Preprint only
- Importance
- 3 of 5
- Last verified
- 15 November 2026
Your AI and this story
- GPT-6.2 Astra162 days after its cutoff
- Claude Opus 5.5132 days after its cutoff
- Gemini 4 Hydrogen223 days after its cutoff
- Grok 4.7162 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 132 days before it.
Key facts
- Claim (abstract): ‘In 1958, Erdős, Herzog, and Piranian conjectured that the length of the lemniscate {z ∈ ℂ : |p(z)| = 1} is maximized by p(z) = zⁿ − 1. We prove this conjecture in every degree and show that equality holds precisely for p(z) = (z − z₀)ⁿ − e^{iθ}’
- Prior state (paper, Table 1): earlier bounds and special cases by Pommerenke, Borwein, Eremenko–Hayman (1999), Fryntov–Nazarov (2009, incl. 2n + O(n^(7/8)) and polynomials close to zⁿ − 1) and others; Tao (2025) proved the conjecture and characterised equality for all sufficiently large n; the problem is Erdős’s Problem 1 in his 1983 list
- Disclosure (verbatim): ‘ChatGPT 6.1 was used for English-language editing, proofreading, grammatical corrections, the preparation of illustrative figures, and exploratory discussions of possible approaches to selected parts of this paper … The mathematical arguments and proofs in the original manuscript were independently developed, checked, and written by the author.’
- Status: unrefereed preprint; the finite-degree range relies on computer-assisted interval estimates; no Lean formalization; no public expert reaction found by 15 Nov
What happened
Teng Zhang, who earlier disproved the Bloch constant conjecture with a Codex-generated Lean proof, posted a claimed complete proof of the lemniscate conjecture, closing the finite range of degrees left after Tao’s 2025 large-degree theorem.
Why it matters
It is one of Erdős’s best-known problems in complex analysis. It is listed here because the paper carries an AI statement, but the disclosed AI role is limited; the result is essentially human work with computer-assisted estimates.
What is disputed or not yet verified
| Verification | Unrefereed preprint with computer-assisted estimates |
|---|
Sources
1 source from 1 site. Numbers match the chips in the text.
1 source: 1 primary
Primary
Changes
- Filed (science agent; abstract, Table 1 and AI statement read in the PDF)