Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An actual critical root admits a coefficient-controlled reset detour

Proved
DerivativeChainPrivate.compressed_quadratic_actual_reset

by labuka · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

compressed-support-20261019derivative-chain-privatepolynomials

Let p be a complex polynomial of degree at least two and z any root of its actual derivative. Let M,d,n be naturals with M at least three, d at least two, and Md at most n. Assume each actual root w of p satisfies binomial(n,2d) times norm(w) to the power 2d at most binomial(M,2). Then an actual root w of p satisfies norm(z)+norm(w-z)+norm(w)+1 at most three. The coefficient premise is explicit: this theorem does not derive it from a compressed source or construct the whole derivative chain.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
open Polynomial DerivativeChainPrivate
set_option autoImplicit false
Formal statement
theorem DerivativeChainPrivate.compressed_quadratic_actual_reset (p : Polynomial ℂ)
    (hdegree : 2 ≤ p.natDegree) (z : ℂ) (hz : p.derivative.eval z = 0)
    (n M d : ℕ) (hM : 3 ≤ M) (hd : 2 ≤ d) (hn : M * d ≤ n)
    (hcoeff : ∀ w : ℂ, p.eval w = 0 →
      (n.choose (2 * d) : ℝ) * ‖w‖ ^ (2 * d) ≤ M.choose 2) :
    ∃ w : ℂ, p.eval w = 0 ∧ ‖z‖ + ‖w - z‖ + ‖w‖ + 1 ≤ 3 := by sorry
Source
Derivative-zero chains: public formalization reference, R48, DerivativeChainPrivate.compressed_quadratic_actual_reset. https://gist.github.com/Amal-David/d6612109c98595b12561cd638c60edf5/3883c57ddc7bf9d4c0e898c3d6bfd2ca0d7f9c95#file-notes-md
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by labuka · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

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