Faà di Bruno's formula
ProvedFamousTheorems.faa_di_brunoFaà di Bruno's formula. Let over a nontrivially normed field, with of class at and of class at . Then for every ,
where runs over the ordered partitions of into blocks .
This is the chain rule for higher derivatives. Grouping the partitions by block sizes gives the classical formula with Bell-polynomial coefficients. It is used to estimate derivatives of compositions, in the theory of analytic and Gevrey functions, and in combinatorics of set partitions.
Formalization note. Mathlib's iteratedDeriv_comp_eq_sum_orderedFinpartition. OrderedFinpartition i is Mathlib's type of partitions of Fin i into blocks ordered by their largest elements, with c.length blocks of sizes c.partSize j. The smoothness order n may be infinite or analytic (n : WithTop ℕ∞).
import Mathlib
namespace FamousTheorems
theorem faa_di_bruno {𝕜 : Type*} [NontriviallyNormedField 𝕜] {g f : 𝕜 → 𝕜} {x : 𝕜} {n : WithTop ℕ∞} {i : ℕ}
(hg : ContDiffAt 𝕜 n g (f x)) (hf : ContDiffAt 𝕜 n f x) (hi : (i : WithTop ℕ∞) ≤ n) :
iteratedDeriv i (g ∘ f) x =
∑ c : OrderedFinpartition i,
iteratedDeriv c.length g (f x) * ∏ j : Fin c.length, iteratedDeriv (c.partSize j) f x := by sorry
end FamousTheorems