Erdős problem 115
If is a polynomial of degree such that is connected then is it true that
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/115.leanTrue ↔ ∀ ε > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (p : Polynomial ℂ), p.Monic → p.natDegree = n → IsConnected {z | ‖Polynomial.eval z p‖ ≤ 1} → ∀ (z : ℂ), ‖Polynomial.eval z p‖ ≤ 1 → ‖Polynomial.eval z (Polynomial.derivative p)‖ ≤ (1 / 2 + ε) * ↑n ^ 2Proof manifests naming this Problem
- Jayyhk Erdős Lean
jayyhk:erdos:115 - PLBY Lean proofs
ErdosProblems.Erdos115
Reported activity
Reported by these sources. Not reviewed here.
Formalization
- Machine