Telescoped Taylor Remainder Along A Sequence
ProvedLevyStochCalc.abs_taylorRemainderNormed_le_affine_readableThis theorem bounds the accumulated second-order Taylor remainder along a finite sequence. Let E, f, f′, f″, A, and K satisfy the same normed-space differentiability and nonnegativity assumptions as in abs_sub_taylor_two_le_affine_readable, including ‖f″(z) − f″(w)‖ ≤ A + K‖z − w‖. For a sequence x : ℕ → E and m : ℕ, the definition taylorRemainderNormed satisfies
This is the telescoped form of the pointwise affine-modulus estimate and is suited to discretized paths and finite partitions.
Original Lean declaration header
Within namespace LevyStochCalc. Shown in its original module context. Proof omitted.
theorem abs_taylorRemainderNormed_le_affine {f : E → ℝ} {f' : E → E →L[ℝ] ℝ}
{f'' : E → E →L[ℝ] E →L[ℝ] ℝ} {A K : ℝ} (hA0 : 0 ≤ A) (hK0 : 0 ≤ K)
(hf : ∀ z, HasFDerivAt f (f' z) z) (hf' : ∀ z, HasFDerivAt f' (f'' z) z)
(hf'' : ∀ z w, ‖f'' z - f'' w‖ ≤ A + K * ‖z - w‖) (x : ℕ → E) (m : ℕ) :
|taylorRemainderNormed f f' f'' x m|
≤ A * ∑ i ∈ Finset.range m, ‖x (i + 1) - x i‖ ^ 2
+ K * ∑ i ∈ Finset.range m, ‖x (i + 1) - x i‖ ^ 3
Module navigation
Module: LevyStochCalc/Brownian/TaylorTwoModulus.
Definition modules: LevyStochCalc/Brownian/TaylorTwoVector.
Supporting theorems: abs_sub_taylor_two_le_affine.
Previous: abs_sub_taylor_two_le_affine.
Source excerpt, lines 167–173 · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_TaylorTwoModulus
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
-- Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (upstream path LevyStochCalc/Brownian/TaylorTwoModulus.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
theorem LevyStochCalc.abs_taylorRemainderNormed_le_affine_readable {f : E → ℝ} {f' : E → E →L[ℝ] ℝ}
{f'' : E → E →L[ℝ] E →L[ℝ] ℝ} {A K : ℝ} (hA0 : 0 ≤ A) (hK0 : 0 ≤ K)
(hf : ∀ z, HasFDerivAt f (f' z) z) (hf' : ∀ z, HasFDerivAt f' (f'' z) z)
(hf'' : ∀ z w, ‖f'' z - f'' w‖ ≤ A + K * ‖z - w‖) (x : ℕ → E) (m : ℕ) :
|taylorRemainderNormed f f' f'' x m|
≤ A * ∑ i ∈ Finset.range m, ‖x (i + 1) - x i‖ ^ 2
+ K * ∑ i ∈ Finset.range m, ‖x (i + 1) - x i‖ ^ 3 := by sorry