Faà di Bruno is Taylor Composition
We approach Faà di Bruno as a composition theorem for Taylor polynomials.
For
let
We show that
The proof is an elementary estimate of the Peano remainder and does not use partitions or combinatorial enumeration.
Expanding this composition identity recovers the classical Faà di Bruno formulas.
Polarization gives the multivariate partition formula (Lévy 2006),
while coefficient extraction gives the multi-index formula (Constantine and Savits 1996).
Our approach separates the functorial nature of Taylor approximation from the combinatorial bookkeeping of polarization and coefficient extraction.
As an application, we give a general higher-order product rule.