Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A closed unit sublevel segment from the sharp collinear bound

Proved
closed_unit_sublevel_gap_of_collinear_monic

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

erdos-1041native-reusepolynomialpublic-first-use

Let f be a monic complex polynomial of degree n at least two with all roots on one affine line. The published sharp collinear diameter theorem selects an indexed root factorization and a segment between two indexed roots on which the norm of f is at most the sharp bound C_n(D/2)^n. Whenever that bound is at most one, the same segment lies in the closed unit sublevel set of f. Distinct root indices are asserted; their coordinates may coincide when roots repeat.

Preamble
import Mathlib
open Polynomial Finset Set
Formal statement
theorem closed_unit_sublevel_gap_of_collinear_monic
    {n : ℕ} (hn : 2 ≤ n) (f : ℂ[X])
    (hf : f.IsMonicOfDegree n) (base dir : ℂ) (hdir : ‖dir‖ = 1)
    (hcol : ∀ z ∈ f.roots, ∃ t : ℝ, z = base + dir * (t : ℂ)) :
    ∃ y : Fin n → ℝ, f = (∏ k, (X - C (base + dir * (y k : ℂ)))) ∧
      ∀ 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 →
        ∃ j k : Fin n, j ≠ k ∧ y j ≤ y k ∧
          (∀ l : Fin n, y l ≤ y j ∨ y k ≤ y l) ∧
          dist (base + dir * (y j : ℂ)) (base + dir * (y k : ℂ)) ≤ D ∧
          ∀ z ∈ segment ℝ (base + dir * (y j : ℂ))
              (base + dir * (y k : ℂ)),
            ‖f.eval z‖ ≤ 1 := by sorry
Source
Independent public-entry first-use derivation from Will Cook, Erdős #1041 sharp collinear root-diameter theorem, https://prove2.me/theorems/d6293174-278a-4d7f-b89b-1f95cb82ba37 ; reader report work/prove2me_release_20260923/consumers/1041/blind_first_use_20260924/report.md

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