Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A nondegenerate chord inside the open unit sublevel set

Proved
ErdosProblems.Erdos1041.PaperCompleteR21.simple_collinear_has_open_unit_chord

by willcook · Sep 24, 2026 · Mathlib c5ea003 (Lean v4.30.0)

erdos-1041native-reusepolynomial

Let f be a monic complex polynomial of degree n at least 2 whose roots lie on one affine line. Assume every indexed factorization of f along that line has distinct root coordinates, and that the sharp diameter bound C_n(D/2)^n is strictly below 1 for each such factorization and greatest pairwise root distance D. Then f has two distinct zeros a and b, and its absolute value is less than 1 at every point of their closed segment. This is a consequence of the published sharp collinear root-diameter theorem, not a statement of the full historical Erdős #1041 path-length problem.

Preamble
import Definitions.Def_ErdosProblems_Erdos1041_PaperCompleteR21_CollinearDiameterWhole
import Mathlib
set_option autoImplicit false
open Polynomial Set
Formal statement
theorem ErdosProblems.Erdos1041.PaperCompleteR21.simple_collinear_has_open_unit_chord {n : ℕ} (hn : 2 ≤ n)
    (f : ℂ[X]) (hf : f.IsMonicOfDegree n) (base dir : ℂ)
    (hdir : ‖dir‖ = 1)
    (hcol : ∀ z ∈ f.roots, ∃ t : ℝ, z = base + dir * (t : ℂ))
    (hindexed : ∀ y : Fin n → ℝ,
      f = (∏ i, (X - C (base + dir * (y i : ℂ)))) →
      Function.Injective (fun i : Fin n => base + dir * (y i : ℂ)))
    (hmargin : ∀ (y : Fin n → ℝ),
      f = (∏ i, (X - C (base + dir * (y i : ℂ)))) →
      ∀ D : ℝ,
        IsGreatest {d : ℝ | ∃ j k : Fin n,
          d = dist (base + dir * (y j : ℂ)) (base + dir * (y k : ℂ))} D →
        1 / (2 ^ (n - 1) * Real.cos (Real.pi / (2 * (n : ℝ))) ^ n) *
          (D / 2) ^ n < 1) :
    ∃ a b : ℂ, a ≠ b ∧ f.eval a = 0 ∧ f.eval b = 0 ∧
      ∀ z ∈ segment ℝ a b, ‖f.eval z‖ < 1 := by sorry
Source
Derived from Will Cook, Erdős #1041 paper, Theorem res:sharp-collinear-root-diameter, https://github.com/wcook04/plectis-erdos/blob/6917e15ec4abc2623512254da93221e446eeb707/paper/1041/erdos-1041-lemniscate-newton-flow.tex ; published Lean theorem https://prove2.me/theorems/d6293174-278a-4d7f-b89b-1f95cb82ba37

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me