Sharp chain-length bound for a monic cubic power 3
ProvedDerivativeChainContinuation.cubicCubeSharpChainRadiusderivative-chainshigher-power-supportsharp-cubic-radius
For a finite complex list write . Write . Let be monic of degree three, and suppose every root lies in the closed disk of center and radius . There is satisfying , starting at the mean of the three roots counted with multiplicity, constant from index 6 onward, and ending at a root of . It admits unit orthogonal complex frame coefficients with nondecreasing projected coordinates and satisfies .
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.cubicCubeSharpChainRadius (q : Polynomial ℂ) (hq : q.Monic) (hdeg : q.natDegree = 3)
(o : ℂ) (R : ℝ) (hR : 0 ≤ R) (hbound : ∀ x : ℂ, q.eval x = 0 → ‖x-o‖ ≤ R) :
∃ (z : Fin 9 → ℂ) (a b : ℂ),
(∀ i, (derivative^[9-(i.val+1)] (q^3)).eval (z i)=0) ∧
z 0=q.roots.sum/3 ∧ (∀ i : Fin 9, 6 ≤ i.val → z i=z 8) ∧ q.eval (z 8)=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 sorrySource