Euclidean bound for northeast chain length
ProvedDerivativeChainPrivate.northeast_chain_costderivative-chainshigher-power-supportsharp-cubic-radius
For a finite complex list write . Let and . If both coordinates of its first entries are nondecreasing, then
For , the length is zero and the natural subtraction gives .
Preamble
import Mathlib 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 DerivativeChainPrivate.northeast_chain_cost (n : ℕ) (z : ℕ → ℂ)
(hre : ∀ i < n - 1, (z i).re ≤ (z (i + 1)).re)
(him : ∀ i < n - 1, (z i).im ≤ (z (i + 1)).im) :
chainCost (fun i : Fin n => z i.val) ≤
Real.sqrt 2 * ‖z (n - 1) - z 0‖ := by sorrySource