Erdős Problem #1047

Aristotle found a new proof of a problem that was already solved (21 Jan 2026).

Problem
Erdős problem #1047 (analysis); current status: disproved (Lean)
Credit
Aristotle · AI building on known literature
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2026-01-21 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PRIOR
ART
Per Tao's AI-contributions wiki

The problem

Let f∈C[x]f\in \mathbb{C}[x] be a monic polynomial with mm distinct roots, and let c>0c>0 be a constant small enough such that {z:∣f(z)∣≤c}\{ z: \lvert f(z)\rvert\leq c\} has mm distinct connected components.

Must all these components be convex?

Statement quoted from erdosproblems.com/1047, maintained by Thomas Bloom. Original source: [EHP58,p.145]. Current status there: disproved (Lean).

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Outcome Literature
21 Jan, 2026 AI building on known literature Aristotle 🟢 New proof found (Lean) 🟢 Goodman (1966)

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎