Full Permutation Symmetry of Iterated Derivatives
ProvedFunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_comp_perm_of_contDiff_readableThis is the full permutation-symmetry theorem for iterated Fréchet derivatives of a smooth map.
Let be a real inner-product space, let be a real normed space, and let be . For every , , every list of directions , and every permutation of ,
This provides the higher-order symmetry used when rearranging derivative slots in multilinear and cumulant expansions.
Formalization Note. The smoothness assumption is ContDiff ℝ ∞; the statement includes the case .
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis.BakryEmery. Shown in its original module context. Proof omitted.
theorem iteratedFDeriv_comp_perm_of_contDiff {f : E → F} (hf : ContDiff ℝ ∞ f) (n : ℕ) (x : E)
(v : Fin n → E) (σ : Equiv.Perm (Fin n)) :
iteratedFDeriv ℝ n f x (v ∘ σ) = iteratedFDeriv ℝ n f x v
Module navigation
Module: Analysis/BakryEmery/IteratedDerivative.
Supporting theorems: iteratedFDeriv_comp_swap_zero_one, iteratedFDeriv_succ_comp_perm_of_fix_zero.
Previous: iteratedFDeriv_comp_swap_zero_one.
Source excerpt, lines 250–252 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_IteratedDerivative
open scoped RealInnerProductSpace ContDiff
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
variable {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
theorem FunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_comp_perm_of_contDiff_readable {f : E → F} (hf : ContDiff ℝ ∞ f) (n : ℕ) (x : E)
(v : Fin n → E) (σ : Equiv.Perm (Fin n)) :
iteratedFDeriv ℝ n f x (v ∘ σ) = iteratedFDeriv ℝ n f x v := by sorry