Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

All-positive-scale compression bounds for centered source roots

Proved
DerivativeChainContinuation.all_scale_compression_bound

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

continuation-20261026derivative-chainsgeometric-budgets

Let a0,…,an∈Ca_0,\ldots,a_n\in\mathbb Ca0​,…,an​∈C with n>0n>0n>0, let z∈Cz\in\mathbb Cz∈C be arbitrary and t>0t>0t>0. Put bi=ai−zb_i=a_i-zbi​=ai​−z, di=t+∣bi∣2d_i=t+|b_i|^2di​=t+∣bi​∣2, D=∏idiD=\prod_i d_iD=∏i​di​, M0=(n+1)−1∑i1/diM_0=(n+1)^{-1}\sum_i1/d_iM0​=(n+1)−1∑i​1/di​, M1=(n+1)−1∑ibi/diM_1=(n+1)^{-1}\sum_i b_i/d_iM1​=(n+1)−1∑i​bi​/di​, F=tM02+∣M1∣2F=tM_0^2+|M_1|^2F=tM02​+∣M1​∣2, A=tM0A=tM_0A=tM0​, and β=tD′/D\beta=tD\prime/Dβ=tD′/D, where D′D\primeD′ is the corresponding product over the actual normalized derivative roots of ∏i(X−bi)\prod_i(X-b_i)∏i​(X−bi​). Set Γ=tF−β\Gamma=tF-\betaΓ=tF−β. Assume ∑iai=0\sum_i a_i=0∑i​ai​=0 and let δ\deltaδ be the source polynomial's Schoenberg deficit. Then

0≤Γ≤Amin⁡(1,δ/t)≤min⁡(1,δ/t),Γ≤A(1−e−δ/t),A2e−δ/t≤β.0\le\Gamma\le A\min(1,\delta/t)\le\min(1,\delta/t),\qquad\Gamma\le A(1-e^{-\delta/t}),\qquad A^2e^{-\delta/t}\le\beta.0≤Γ≤Amin(1,δ/t)≤min(1,δ/t),Γ≤A(1−e−δ/t),A2e−δ/t≤β.

Repeated roots and every positive squared scale are included; there is no assumption t>δt>\deltat>δ.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainContinuation_AllScaleCompression
import Definitions.Def_DerivativeChainContinuation_RowCovariance
import Definitions.Def_DerivativeChainContinuation_ScaleMoments
import Definitions.Def_DerivativeChainPrivate_foundations
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option maxHeartbeats 1000000
open Matrix Polynomial
open scoped BigOperators ComplexOrder
Formal statement
theorem DerivativeChainContinuation.all_scale_compression_bound (n : ℕ) (hn : 0 < n) (a : Fin (n+1) → ℂ)
    (hcenter : ∑ i,a i=0) (z : ℂ) (t : ℝ) (ht : 0 < t) :
    let b := fun i => a i-z;
    let δ := schoenbergDeficit (∏ i,(X-C (a i)));
    0 ≤ scaleCompressionGap b t ∧
      scaleCompressionGap b t ≤ t*scaleMeanZero b t*min 1 (δ/t) ∧
      t*scaleMeanZero b t*min 1 (δ/t) ≤ min 1 (δ/t) ∧
      scaleCompressionGap b t ≤ t*scaleMeanZero b t*(1-Real.exp (-δ/t)) ∧
      (t*scaleMeanZero b t)^2*Real.exp (-δ/t) ≤ t*scaleDerivativeProduct b t/scaleSourceProduct b t := by sorry
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/AllScaleCompression.lean#L26-L108

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