Higher Leibniz Rule for an Inner Product Quadratic Form
ProvedFunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_inner_self_apply_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This is the higher-order Leibniz rule for the map .
Let be a real inner-product space, let be , let , let , and let . Then
The formula is a reusable pointwise identity for differentiating quadratic forms whose first factor is the identity map.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis.BakryEmery. Shown in its original module context. Proof omitted.
theorem iteratedFDeriv_inner_self_apply {G : E → E} (hG : ContDiff ℝ ∞ G) (d : ℕ) (z : E)
(h : Fin (d + 1) → E) :
iteratedFDeriv ℝ (d + 1) (fun w => ⟪w, G w⟫) z h =
⟪z, iteratedFDeriv ℝ (d + 1) G z h⟫ +
∑ k : Fin (d + 1), ⟪h k, iteratedFDeriv ℝ d G z (k.removeNth h)⟫
Module navigation
Module: Analysis/BakryEmery/IteratedDerivative.
Next: iteratedFDeriv_succ_comp_perm_of_fix_zero.
Source excerpt, lines 45–49 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_IteratedDerivative
open scoped RealInnerProductSpace ContDiff
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
Formal statement
theorem FunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_inner_self_apply_readable {G : E → E} (hG : ContDiff ℝ ∞ G) (d : ℕ) (z : E)
(h : Fin (d + 1) → E) :
iteratedFDeriv ℝ (d + 1) (fun w => ⟪w, G w⟫) z h =
⟪z, iteratedFDeriv ℝ (d + 1) G z h⟫ +
∑ k : Fin (d + 1), ⟪h k, iteratedFDeriv ℝ d G z (k.removeNth h)⟫ := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/BakryEmery/IteratedDerivative.lean#L43-L118 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.BakryEmery.IteratedDerivative`, declaration `FunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_inner_self_apply`; the repository is private at upload time).