Erdős problem 1047
Let be a monic polynomial with distinct roots, and let be a constant small enough such that has distinct connected components.
Sources
FormalConjectures/ErdosProblems/
1047.lean
Retained formal statement
The answer is no, as shown by Pommerenke [Po61], who showed that, if is sufficiently large, and where is sufficiently close to , then has two components, and the component which contains is not convex.
∀ᶠ (k : ℕ) in Filter.atTop, ∃ δ, 0 < δ ∧ ∀ (a : ℝ), (1 + 1 / ↑k) * ↑k ^ (1 / (↑k + 1)) < a → a < (1 + 1 / ↑k) * ↑k ^ (1 / (↑k + 1)) + δ → (Erdos1047.componentsIn (Erdos1047.sublevelSet (Polynomial.X ^ k * (Polynomial.X - Polynomial.C ↑a)) 1)).ncard = 2 ∧ ¬Convex ℝ (connectedComponentIn (Erdos1047.sublevelSet (Polynomial.X ^ k * (Polynomial.X - Polynomial.C ↑a)) 1) 0)SolvedStatement only, no proof