Explicit squared endpoint transport bound for collinear roots
ProvedDerivativeChainContinuation.real_transport_statementcontinuation-20261026derivative-chainsreal-transport
Let , let , and suppose for some with and . Set , , and assume . Define as the infimum of over sequences with and . Then
The bound is uniform in degree and includes repeated roots. The endpoint cost is expanded directly in terms of the source polynomial and its derivatives in the formal statement.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_RealTransportStatement import Definitions.Def_DerivativeChainPrivate_foundations open DerivativeChainPrivate set_option autoImplicit false set_option backward.isDefEq.respectTransparency false open Polynomial open scoped BigOperators
Formal statement
theorem DerivativeChainContinuation.real_transport_statement {n : ℕ} (a : Fin (n+1) → ℂ)
(hline : ∃ o c : ℂ,c≠0 ∧ ∃ r : Fin (n+1) → ℝ,∀ i,a i=o+c*(r i : ℂ))
(hvariance : 0 < ∑ i,‖a i-(∑ j,a j)/(n+1 : ℂ)‖^2) :
(∑ i,(explicitEndpointCost a (a i))^2)/
(∑ i,‖a i-(∑ j,a j)/(n+1 : ℂ)‖^2) ≤ (28/3 : ℝ) := by sorrySource