この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #1048

Partial progress by Aristotle (28 Jan 2026): proof found (Lean), which is a specific case of Pommerenke.

問題
Erdős problem #1048 (analysis); current status: disproved (Lean)
貢献
Aristotle · AI building on known literature
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-01-28 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
部分的
結果
Per Tao's AI-contributions wiki

The problem

If f∈C[x]f\in \mathbb{C}[x] is a monic polynomial with all roots satisfying ∣z∣≤r\lvert z\rvert \leq r for some r<2r<2, then must

{z:∣f(z)∣<1}\{ z: \lvert f(z)\rvert <1\}

have a connected component with diameter >2−r>2-r?

Statement quoted from erdosproblems.com/1048, maintained by Thomas Bloom. Original source: [EHP58,p.142]. 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
28 Jan, 2026 AI building on known literature Aristotle 🟢 Proof found (Lean), which is a specific case of Pommerenke 🟢 Pommerenke (1961)

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.

∎