Every positive aligned-ray greedy history costs the outer radius
ProvedDerivativeChainContinuation.positive_aligned_all_greedyFor a nonempty labelled tuple a=(a_0,…,a_n)∈ℂ^(n+1), put N=n+1 and p_a(X)=∏(j=0)^n(X-a_j). Its ordinary row of degree m is P_m=p_a differentiated N-m times, for 1≤m≤N. An actual greedy location history z=(z_0,…,z_n) satisfies P(i+1)(z_i)=0 and |z_(i+1)-z_i|≤|w-z_i| for every i<n and every complex root w of P_(i+2). Its length is L(z)=Σ_(i=0)^(n-1)|z_(i+1)-z_i|. Repeated root values and every local tie are allowed. A positive quotient Q∈ℝ[X] means Q≠0, Q splits over ℝ, and every element of its root multiset is strictly positive. Multiplicities are retained; nonzero constants satisfy this condition. For natural k,r write S_(k,r,Q)(X)=X^r Q(X^k)∈ℂ[X], mapping the real coefficients into ℂ. The central multiplicity r is arbitrary. Assume k≥2, Q has positive degree, and the actual monic source satisfies p_a=S_(k,r,Q). Actual greedy histories exist. There is a largest positive real root b of Q, and every actual greedy history z has L(z)=b^(1/k). At every degree m≥k its selected root is nonzero, has maximal norm among every complex root of P_m, and is c z_(k-1) for some real c≥1.
import Mathlib import Definitions.Def_DerivativeChainContinuation_GreedyActual import Definitions.Def_DerivativeChainContinuation_PositiveGreedyChain import Definitions.Def_DerivativeChainContinuation_PositiveSpokeClosure import Definitions.Def_DerivativeChainPrivate_SpokeRows import Definitions.Def_DerivativeChainPrivate_foundations set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option maxHeartbeats 1600000 open Polynomial DerivativeChainPrivate namespace DerivativeChainContinuation end DerivativeChainContinuation open DerivativeChainContinuation open scoped BigOperators
theorem DerivativeChainContinuation.positive_aligned_all_greedy (n : ℕ) (a : Fin (n+1) → ℂ)
(k r : ℕ) (Q : Polynomial ℝ) (hk : 2 ≤ k) (hQ : PositiveQuotient Q)
(hQdegree : 0<Q.natDegree) (hp : fromRoots a=spokePoly k r Q) :
(∃ z : Fin (n+1) → ℂ,IsGreedyChain a z) ∧
∃ b : ℝ,0<b ∧ Q.eval b=0 ∧ (∀ y : ℝ,Q.eval y=0 → y ≤ b) ∧
∀ z : Fin (n+1) → ℂ,IsGreedyChain a z →
chainCost z=b^((k : ℝ)⁻¹) ∧
∀ i : Fin (n+1),k ≤ i.val+1 →
z i≠0 ∧ (∀ w : ℂ,(row a (i.val+1)).eval w=0 → ‖w‖ ≤ ‖z i‖) ∧
∃ c : ℝ,1 ≤ c ∧ z i=(c : ℂ)*complexHistoryOf z (k-1) := by sorry