Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite derivative tail admits a telescoping square-cost bound

Proved
DerivativeChainContinuation.finite_tail_energy

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

centroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families

Let h∈Nh\in\mathbb Nh∈N and let Pj∈C[X]P_j\in\mathbb C[X]Pj​∈C[X] be indexed by j∈Nj\in\mathbb Nj∈N. For j<hj<hj<h, suppose Pj+1P_{j+1}Pj+1​ has positive degree and each root of PjP_jPj​ is a root of Pj+1′P_{j+1}^{\prime}Pj+1′​. From any root bbb of P0P_0P0​, one can choose roots zjz_jzj​ of PjP_jPj​ for 0≤j≤h0\le j\le h0≤j≤h with

z0=b,∑j=0h−1∣zj+1−zj∣2≤∣zh∣2−∣b∣2.z_0=b,\qquad \sum_{j=0}^{h-1}|z_{j+1}-z_j|^2\le |z_h|^2-|b|^2.z0​=b,j=0∑h−1​∣zj+1​−zj​∣2≤∣zh​∣2−∣b∣2.

No disk or simple-root hypothesis is imposed. This is the finite energy tail used after a sparse prefix.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
import Definitions.Def_DerivativeChain_root_probability
open DerivativeChain DerivativeChainPrivate
open Polynomial
open scoped BigOperators
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false

set_option autoImplicit false
namespace DerivativeChainContinuation
open Polynomial
open scoped BigOperators



end DerivativeChainContinuation

Formal statement
theorem DerivativeChainContinuation.finite_tail_energy (P : ℕ → Polynomial ℂ) (h : ℕ)
    (hdegree : ∀ j < h, 0 < (P (j+1)).degree)
    (hstep : ∀ j < h, ∀ w : ℂ, (P j).eval w=0 → (P (j+1)).derivative.eval w=0)
    (b : ℂ) (hb : (P 0).eval b=0) :
    ∃ z : ℕ → ℂ, z 0=b ∧ (∀ j ≤ h, (P j).eval (z j)=0) ∧
      (∑ j ∈ Finset.range h, ‖z (j+1)-z j‖^2) ≤ ‖z h‖^2-‖b‖^2 := by sorry
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/FiniteTailEnergy.lean#L7-L39

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