Conditional transfer from normalized chains to every monic cubic
ProvedDerivativeChainContinuation.cubic_power_sharp_radius_of_strict_normalized_chainderivative-chainshigher-power-supportsharp-cubic-radius
For a finite complex list write . Write . Fix an integer and real . Put and . Assume that for every , there is satisfying , , a constant suffix for , and nondecreasing real and imaginary coordinates. Here require . For any monic complex cubic , if all its roots lie in a disk of center and radius , The resulting list starts at the centroid, satisfies the roots of in derivative orders , has constant suffix from index , and ends at a root of . It has two unit orthogonal frame coefficients , meaning , for which both sequences and are nondecreasing, and . The centroid is , counting multiplicity. The incoming strict normalized-chain existence hypothesis is explicit; this does not prove complete chains for arbitrary powers by itself.
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_sharp_radius_of_strict_normalized_chain (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))
(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 (3*h) → ℂ) (A B : ℂ),
(∀ i, (derivative^[3*h-(i.val+1)] (q^h)).eval (z i)=0) ∧
z 0=q.roots.sum/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 sorrySource