Normed-Space Second-Order Taylor Remainder Bound
ProvedLevyStochCalc.abs_sub_taylor_two_le_modulus_normed_readableThis is the normed-space version of the second-order Taylor remainder estimate. Let E be a normed additive commutative group and real normed space, let f : E → ℝ, let f′ : E → E →L[ℝ] ℝ, let f″ : E → E →L[ℝ] E →L[ℝ] ℝ, and let M ≥ 0. Assume f and f′ have the indicated Fréchet derivatives at every point. For x, y : E, assume that every z in the segment joining x and y satisfies ‖f″(z) − f″(x)‖ ≤ M. Then, using abs_sub_taylor_two_le_modulus_normed_readable,
The result is dimension-free at the level of arbitrary normed spaces and isolates the dependence on the second-derivative oscillation along one segment.
Original Lean declaration header
Within namespace LevyStochCalc. Shown in its original module context. Proof omitted.
theorem abs_sub_taylor_two_le_modulus_normed {f : E → ℝ} {f' : E → E →L[ℝ] ℝ}
{f'' : E → E →L[ℝ] E →L[ℝ] ℝ} {M : ℝ} (hM0 : 0 ≤ M)
(hf : ∀ z, HasFDerivAt f (f' z) z) (hf' : ∀ z, HasFDerivAt f' (f'' z) z) {x y : E}
(hM : ∀ z ∈ segment ℝ x y, ‖f'' z - f'' x‖ ≤ M) :
|f y - f x - f' x (y - x) - f'' x (y - x) (y - x) / 2| ≤ M * ‖y - x‖ ^ 2
Module navigation
Module: LevyStochCalc/Brownian/TaylorTwoModulus.
Supporting theorems: abs_sub_taylor_two_le_modulus.
Previous: abs_sub_taylor_two_le_modulus · Next: abs_sub_taylor_two_le_affine.
Source excerpt, lines 100–104 · 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_sub_taylor_two_le_modulus_normed_readable {f : E → ℝ} {f' : E → E →L[ℝ] ℝ}
{f'' : E → E →L[ℝ] E →L[ℝ] ℝ} {M : ℝ} (hM0 : 0 ≤ M)
(hf : ∀ z, HasFDerivAt f (f' z) z) (hf' : ∀ z, HasFDerivAt f' (f'' z) z) {x y : E}
(hM : ∀ z ∈ segment ℝ x y, ‖f'' z - f'' x‖ ≤ M) :
|f y - f x - f' x (y - x) - f'' x (y - x) (y - x) / 2| ≤ M * ‖y - x‖ ^ 2 := by sorry