/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 1041
Reference: erdosproblems.com/1041
@[expose] public sectionopen Polynomial MeasureTheory ENNRealnamespace Erdos1041section ComponentLemmavariable (n : ℕ) (f : ℂ[X]) (hn : n ≥ 2) (hnum : f.natDegree = n)variable (h_monic : f.Monic)variable (h : f.rootSet ℂ ⊆ Metric.ball 0 1)include hn hnum h h_monicThe length of a subset $s$ of $\mathbb{C}$ is defined to be its 1-dimensional Hausdorff measure $\mathcal{H}^1(s)$.
noncomputable def length (s : Set ℂ) : ℝ≥0∞ := μH[1] sopen scoped Classical inErdős–Herzog–Piranian Component Lemma (Metric Properties of Polynomials, 1958): If $f$ is a monic degree $n$ polynomial with all roots in the unit disk, then some connected component of ${z \mid |f(z)| < 1}$ contains at least two roots with multiplicity.
See p. 139, above Problem 5: [EHP58] Erdős, P. and Herzog, F. and Piranian, G., Metric properties of polynomials. J. Analyse Math. (1958), 125-148.
@[category research solved, AMS 32]
theorem exists_connected_component_contains_two_roots :
∃ C, C ⊆ {z | ‖f.eval z‖ < 1} ∧ IsConnected C ∧
2 ≤ (f.roots.filter (· ∈ C)).card := n:ℕf:ℂ[X]hn:n ≥ 2hnum:f.natDegree = nh_monic:f.Monich:f.rootSet ℂ ⊆ Metric.ball 0 1⊢ ∃ C ⊆ {z | ‖eval z f‖ < 1}, IsConnected C ∧ 2 ≤ (Multiset.filter (fun x ↦ x ∈ C) f.roots).card
All goals completed! 🐙end ComponentLemmaLet $$ f(z) = \prod_{i=1}^{n} (z - z_i) \in \mathbb{C}[x] $$ with $|z_i| < 1$ for all $i$.
Conjecture: Must there always exist a path of length less than 2 in $$ { z \in \mathbb{C} \mid |f(z)| < 1 } $$ which connects two of the roots of $f$?
The answer is negative. ani gave a counterexample of degree seven on the Erdős problems forum on 7 September 2026. The linked formalisation proves, for the member $s = 10^{-6}$ of ani's family, that every connected subset of ${ z \mid |f(z)| < 1 }$ containing two distinct roots has one-dimensional Hausdorff measure greater than $2$.
@[category research solved, question, AMS 32, formal_proof using lean4 at
"https://github.com/wcook04/plectis-erdos-lean/blob/587c48f213106c20ba2cdf3d585700c1394fc44f/verification/FC1041HausdorffCounterexample/lean/ErdosProblems/Erdos1041/Counterexample/HausdorffLength.lean#L449-L454"]
theorem erdos_1041 :
¬ ∀ (n : ℕ) (f : ℂ[X]), n ≥ 2 → f.natDegree = n → f.Monic →
f.rootSet ℂ ⊆ Metric.ball 0 1 →
∃ (z₁ z₂ : ℂ) (h : ({z₁, z₂} : Multiset ℂ) ≤ f.roots) (γ : Path z₁ z₂),
Set.range γ ⊆ { z : ℂ | ‖f.eval z‖ < 1 } ∧ length (Set.range γ) < 2 := ⊢ ¬∀ (n : ℕ) (f : ℂ[X]),
n ≥ 2 →
f.natDegree = n →
f.Monic →
f.rootSet ℂ ⊆ Metric.ball 0 1 →
∃ z₁ z₂, ∃ (_ : {z₁, z₂} ≤ f.roots), ∃ γ, Set.range ⇑γ ⊆ {z | ‖eval z f‖ < 1} ∧ length (Set.range ⇑γ) < 2
All goals completed! 🐙end Erdos1041