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
Goodman [Go66] constructed an example with simple roots, of degree .
∃ f c, f.Monic ∧ f.natDegree = 4 ∧ (f.rootSet ℂ).ncard = 4 ∧ 0 < c ∧ (Erdos1047.componentsIn (Erdos1047.sublevelSet f c)).ncard = 4 ∧ ∃ t ∈ Erdos1047.componentsIn (Erdos1047.sublevelSet f c), ¬Convex ℝ tSolvedStatement only, no proof