Source labels openChecked July 26, 2026

Erdős Problem 509

Let $f(z) ∈ ℂ[z]$ be a monic non-constant polynomial. Can the set $\{z ∈ ℂ : |f(z)| ≤ 1\}$ be covered by a set of closed discs the sum of whose radii is $≤ 2$ ?

Complex analysis AMS 30

Mathematical statement

Let $f(z) ∈ ℂ[z]$ be a monic non-constant polynomial. Can the set $\{z ∈ ℂ : |f(z)| ≤ 1\}$ be covered by a set of closed discs the sum of whose radii is $≤ 2$ ?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_509

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_509 : answer(sorry) ↔ ∀ (f : ℂ[X]), f.Monic → f.natDegree ≠ 0 →    ∃ (ι : Type), Nonempty (BoundedDiscCover {z | ‖f.eval z‖ ≤ 1} 2 ι) := by  sorry

Statement source: Formal Conjectures
Lean version: v4.27.0
Placeholder: Present; no proof artifact
Source evidence: Pinned source index
Fidelity review: Community formulation

References

Pinned Formal Conjectures sourceformalization erdosproblems.com/509background