Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional sharp power-chain budget for a nonzero-moment triple

Proved
DerivativeChainContinuation.cubic_power_nonzero_sharp

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

derivative-chainshigher-power-supportsharp-cubic-radius

For a finite complex list z0,…,zN−1z_0,\ldots,z_{N-1}z0​,…,zN−1​ write L(z)=∑i=0N−2∣zi+1−zi∣L(z)=\sum_{i=0}^{N-2}|z_{i+1}-z_i|L(z)=∑i=0N−2​∣zi+1​−zi​∣. Write ρ⋆=(1+10)/3\rho_\star=(1+\sqrt{10})/3ρ⋆​=(1+10​)/3. For a triple u,v,wu,v,wu,v,w put m=(u+v+w)/3m=(u+v+w)/3m=(u+v+w)/3 and D=(u2+v2+w2−uv−uw−vw)/3D=(u^2+v^2+w^2-uv-uw-vw)/3D=(u2+v2+w2−uv−uw−vw)/3. Fix an integer h>0h>0h>0 and real a,b≥0a,b\ge0a,b≥0. Put pβ(X)=(X3−aX−bβ)hp_\beta(X)=(X^3-aX-b\beta)^hpβ​(X)=(X3−aX−bβ)h and N=3hN=3hN=3h. Assume that for every Re⁡β≥0\operatorname{Re}\beta\ge0Reβ≥0, Im⁡β>0\operatorname{Im}\beta>0Imβ>0 there is z∈CNz\in\mathbb C^Nz∈CN satisfying pβ(N−i−1)(zi)=0p_\beta^{(N-i-1)}(z_i)=0pβ(N−i−1)​(zi​)=0, z0=0z_0=0z0​=0, a constant suffix zi=zN−1z_i=z_{N-1}zi​=zN−1​ for i≥2hi\ge2hi≥2h, and nondecreasing real and imaginary coordinates. Here require a,b>0a,b>0a,b>0. If u,v,wu,v,wu,v,w lie in the disk of center ooo and real radius RRR, and D≠0D\ne0D=0, put q(X)=(X−u)(X−v)(X−w)q(X)=(X-u)(X-v)(X-w)q(X)=(X−u)(X−v)(X−w). The resulting list starts at the centroid, satisfies the roots of qhq^hqh in derivative orders 3h−i−13h-i-13h−i−1, has constant suffix from index 2h2h2h, and ends at a root of qqq. It has two unit orthogonal frame coefficients A,BA,BA,B, meaning Re⁡(AB‾)=0\operatorname{Re}(A\overline B)=0Re(AB)=0, for which both sequences Re⁡(Azi)\operatorname{Re}(Az_i)Re(Azi​) and Re⁡(Bzi)\operatorname{Re}(Bz_i)Re(Bzi​) are nondecreasing, and L(z)≤ρ⋆RL(z)\le\rho_\star RL(z)≤ρ⋆​R. The strict normalized-chain hypothesis remains an input.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainContinuation_SharpCubicConstant
import Definitions.Def_DerivativeChainPrivate_foundations
open DerivativeChainPrivate Polynomial MeasureTheory Filter Set Topology Metric Function ComplexConjugate
open scoped BigOperators ComplexOrder Topology
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option maxHeartbeats 0
set_option maxRecDepth 100000
Formal statement
theorem DerivativeChainContinuation.cubic_power_nonzero_sharp (h : ℕ) (hh : 0 < h) [NeZero (3*h)]
    (a b : ℝ) (ha : 0 < a) (hb : 0 < b) (last : Fin (3*h)) (hlast : last.val=3*h-1)
    (hstrict : ∀ β : ℂ, 0 ≤ β.re → 0 < β.im → ∃ z : Fin (3*h) → ℂ,
      (∀ i, (derivative^[3*h-(i.val+1)] ((X^3-C (a:ℂ)*X-C ((b:ℂ)*β))^h)).eval (z i)=0) ∧
      z 0=0 ∧ (∀ i : Fin (3*h), 2*h ≤ i.val → z i=z last) ∧
      Monotone (fun i => (z i).re) ∧ Monotone (fun i => (z i).im))
    (u v w o : ℂ) (R : ℝ) (hu : ‖u-o‖ ≤ R) (hv : ‖v-o‖ ≤ R) (hw : ‖w-o‖ ≤ R)
    (hA : (u^2+v^2+w^2-u*v-u*w-v*w)/3 ≠ 0) :
    let q := (X-C u)*(X-C v)*(X-C w)
    ∃ (z : Fin (3*h) → ℂ) (A B : ℂ),
      (∀ i, (derivative^[3*h-(i.val+1)] (q^h)).eval (z i)=0) ∧
      z 0=(u+v+w)/3 ∧ (∀ i : Fin (3*h), 2*h ≤ i.val → z i=z last) ∧ q.eval (z last)=0 ∧
      ‖A‖=1 ∧ ‖B‖=1 ∧ (A*starRingEnd ℂ B).re=0 ∧
      Monotone (fun i => (A*z i).re) ∧ Monotone (fun i => (B*z i).re) ∧
      chainCost z ≤ sharpCubicConstant*R := by sorry
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/SharpPowerNonzero.lean#L8-L63

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