Four radii from a real-rooted row within fifteen derivatives
ProvedDerivativeChainPrivate.lateRealRowFourRadius_20261027Let a degree-n complex polynomial have all source roots, counted with multiplicity, in the closed disk of center c and radius R, with R nonnegative. Write n=M+K+1 and assume K is at most fifteen. Suppose its actual degree-(M+1) derivative row has only real roots, with multiplicity; equivalently, that row is a nonzero scalar times the product of the linear factors corresponding to a sorted real list b.
Then there is a complete actual derivative-root chain z, choosing one root in every nonconstant ordinary derivative row, whose total Euclidean length is at most 4R.
The intermediate real row is an explicit algebraic hypothesis. The theorem supplies the entire chain, with no assumed short prefix or turning budget. It is a restricted class theorem, not the unrestricted four-radius conjecture.
import Definitions.Def_DerivativeChainPrivate_foundations open Polynomial DerivativeChainPrivate open scoped BigOperators set_option autoImplicit false
theorem DerivativeChainPrivate.lateRealRowFourRadius_20261027 {n : ℕ} (a : Fin n → ℂ)
(M K : ℕ) (hn : n=M+K+1) (hK : K≤15) (c : ℂ) (R : ℝ) (hR : 0≤R)
(ha : ∀ i, ‖a i-c‖≤R) (b : Fin (M+1) → ℝ) (hb : Monotone b)
(s : ℂ) (hs : s≠0)
(hcore : row a (M+1)=C s*∏ i, (X-C (b i : ℂ))) :
∃ z : Fin n → ℂ, IsChain a z ∧ chainCost z≤4*R := by sorry