Telescoping potential bound for real row-history costs
ProvedDerivativeChainContinuation.transport_potential_boundcontinuation-20261026derivative-chainsreal-transport
Let be an interlacing real derivative tower through level . Let satisfy for every , where denotes ordered dispersion. Writing for mean row-history cost,
This sums the one-step transport inequalities into a bound depending only on the top-row potential.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_FiniteTransport import Definitions.Def_DerivativeChainContinuation_RealEndpointCost import Definitions.Def_DerivativeChainContinuation_RealTower 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.transport_potential_bound (r : RealRows) (n : ℕ) (K : ℝ) (hK : 0 ≤ K)
(hstep : ∀ k<n+1,RealRowStep r k)
(hD : ∀ k≤n+1,orderedDispersion (r k) ≤ (k : ℝ)*(k+1)*Real.sqrt (k+2)*K) :
meanHistoryCost r (n+1) ≤
orderedDispersion (r (n+1))/((n+1 : ℝ)*(n+2))+
4*K*(Real.sqrt (n+2)-Real.sqrt 2) := by sorrySource