Erdős problem 1047 · problems.science

Let $f\in \mathbb{C}[x]$ be a monic polynomial with $m$ distinct roots, and let $c>0$ be a constant small enough such that $\{ z: \lvert f(z)\rvert\leq c\}$ has $m$ distinct connected components.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1047.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1047.leanErdos1047.erdos_10477 linesExact file

1False ↔2  ∀ (f : Polynomial ℂ) (m : ℕ) (c : ℝ),3    f.Monic →4      (f.rootSet ℂ).ncard = m →5        0 < c →6          (Erdos1047.componentsIn (Erdos1047.sublevelSet f c)).ncard = m →7            ∀ t ∈ Erdos1047.componentsIn (Erdos1047.sublevelSet f c), Convex ℝ t

SolvedStatement only, no proof

Proof manifests naming this Problem

Jayyhk Erdős Leanjayyhk:erdos:1047
PLBY Lean proofsErdosProblems.Erdos1047

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI building on literature
Erdős AI contributions wiki · 21 Jan, 2026
Machine
Aristotle
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Proof manifests naming this Problem

Reported activity

Continue

Search problems.science