{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-11-09-erdos-herzog-piranian-lemniscate-conjecture-proof/","md":"https://postcutoff.com/e/2026-11-09-erdos-herzog-piranian-lemniscate-conjecture-proof/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-11-09-erdos-herzog-piranian-lemniscate-conjecture-proof","date":"2026-11-09","date_precision":"day","short_title":"Erdős–Herzog–Piranian lemniscate conjecture (Teng Zhang)","deck":null,"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'.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.12830: A proof of the Erdős–Herzog–Piranian lemniscate conjecture (Teng Zhang)","url":"https://arxiv.org/abs/2611.12830","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-11-15","updated":"2026-11-15","orgs":["Xi'an Jiaotong University","OpenAI"],"title":"Teng Zhang posts a proof of the Erdős–Herzog–Piranian lemniscate conjecture (1958) in every degree; ChatGPT 6.1 was used for editing, figures and exploratory discussion","summary":"arXiv 2611.12830 (math.CV, 9 Nov 2026), Teng Zhang (Xi'an Jiaotong University): for every monic polynomial p of degree n ≥ 1 the length of {z : |p(z)| = 1} is at most that for zⁿ − 1, with equality exactly for (z − z₀)ⁿ − e^{iθ}. The proof uses Möbius variations of the critical values, estimates for inverse branches, and rigorous computer-assisted estimates in a finite range of degrees. Tao (2025) had proved the conjecture for all sufficiently large n. The paper says the mathematics was developed by the author; ChatGPT 6.1 helped with editing, figures and exploratory discussion.","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"],"key_numbers":[],"tags":["math","complex-analysis","polynomials","erdos-problems","lemniscate","computer-assisted-proof","chatgpt","arxiv"],"science":{"field":"mathematics","subfield":"complex analysis","problem":"Erdős–Herzog–Piranian lemniscate length conjecture (1958)","result":"Claimed proof in every degree, with equality cases","open_since":"1958","ai_system":["ChatGPT 6.1"],"human_role":"Human-led; AI for editing, figures and exploratory discussion only","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint with computer-assisted estimates"},"status":"pending","shock":""},"body_md":"## What happened\n\nTeng Zhang, who earlier disproved the Bloch constant conjecture with a Codex-generated Lean proof, posted a claimed complete proof\nof the lemniscate conjecture, closing the finite range of degrees left after Tao's 2025 large-degree theorem.\n\n## Why it matters\n\nIt is one of Erdős's best-known problems in complex analysis. It is listed here because the paper carries an AI statement, but\nthe disclosed AI role is limited; the result is essentially human work with computer-assisted estimates.","disputed":[{"label":"Verification","text":"Unrefereed preprint with computer-assisted estimates","sources":[]}],"related":[{"id":"2026-11-15-ai-assisted-results-november-15-listing","url":"https://postcutoff.com/e/2026-11-15-ai-assisted-results-november-15-listing/","date":"2026-11-15","date_precision":"day","short_title":"AI-assisted results, 15 Nov","deck":null,"takeaway":"arXiv posts no listings at weekends and Hexagon had no new works, so this sweep read the 366 arXiv papers of 7–13 Nov with AI statements that no file cited, line by line in the PDFs, and 59 conjecture papers without a statement. Five got their own entries; 115 with a substantive AI role are listed here. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":9,"filed":"2026-11-15","updated":"2026-11-15","orgs":["OpenAI","Anthropic","Google","Axiom Math","various researchers"]},{"id":"2026-10-12-bloch-constant-conjecture-disproved","url":"https://postcutoff.com/e/2026-10-12-bloch-constant-conjecture-disproved/","date":"2026-10-12","date_precision":"day","short_title":"Bloch constant conjecture (Ahlfors–Grunsky, 1937) disproved","deck":"Teng Zhang shows B < 0.47186… − 1.3×10⁻⁹, with a Lean proof generated by Codex","takeaway":"The value Ahlfors and Grunsky conjectured for Bloch's constant in 1937 is not the true value. The human proof uses a genus-two translation surface; ChatGPT helped explore approaches and Codex generated the Lean formalization.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-14","updated":"2026-10-14","orgs":["Xi'an Jiaotong University","OpenAI"]}],"people":[{"id":"terence-tao","name":"Terence Tao","url":"https://postcutoff.com/person/terence-tao/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-15","type":"filed","text":"Created (science agent; abstract, Table 1 and AI statement read in the PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-15","run":null,"sources_read":"Science agent; abstract, Table 1 and AI statement read in the PDF","updated":"2026-11-15","human_review":null,"version":{"date":"2026-11-15"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":162,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":132,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":223,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":162,"in_training_data":false}],"short_url":null}