Length of a finite real location history
DefinitionDerivativeChainContinuation_GreedyTowercontinuation-20261027derivative-chainsgreedynearest-parent
For x: ℕ → ℝ and n∈ℕ, define greedyCost(x,n)=Σ_(k=0)^(n-1) |x_(k+1)-x_k|. For n=0 the empty sum is zero. No root or nearest-parent condition is included in this length definition.
Definition code
import Mathlib import Definitions.Def_DerivativeChainPrivate_foundations set_option autoImplicit false namespace DerivativeChainContinuation open Polynomial open scoped BigOperators noncomputable def greedyCost (x : ℕ → ℝ) (n : ℕ) : ℝ := ∑ k ∈ Finset.range n, |x (k+1)-x k| end DerivativeChainContinuation
Source
Private analytic checkpoint d69f598e254dee1915468fa93b3e33b8e1b5b7d6: research-results/unified-20261025/greedy/RAY_THEOREM.md, SHA-256 0d8a115e7059d0fae02ca0217cd20d64fc1baaf2a83795a4b171fa556be44a57. Local formal commit 7200800a2f88105b736aa292a1ec518302074d94 (not asserted pushed), submission_sync/new_formal/greedy/GreedyTower.lean, lines 8-9, SHA-256 8b40116c462af4a8a43ad41639ccc897e8a071b5f6821b4a44f21f48d5c9b196.