Faà di Bruno's formula

[mklabgr]

Faà di Bruno's formula

Summary

Faà di Bruno’s formula is a powerful result in calculus that generalizes the chain rule to higher-order derivatives of composite functions. While the ordinary chain rule describes how to differentiate a function such as ($f(g(x))$) once, repeated differentiation quickly becomes complicated because many combinations of derivatives of the inner and outer functions appear. 

Developed in its modern form by the Italian mathematician Francesco Faà di Bruno, the formula provides a systematic way to compute the (n)-th derivative of a composite function by organizing these terms using combinatorial structures, particularly partitions of integers.

The formula has important connections between calculus, combinatorics, and mathematical analysis. It expresses higher derivatives of $(f(g(x)))$ as a sum involving derivatives of ($f$), derivatives of ($g$), and coefficients related to Bell polynomials, which efficiently encode the many possible ways derivatives can be distributed among the factors. 

Beyond pure mathematics, Faà di Bruno’s formula has applications in probability theory, statistics, differential equations, perturbation methods, and computer algebra systems where symbolic differentiation of complex expressions is required. Its significance lies not only in extending the chain rule but also in revealing the hidden combinatorial patterns behind repeated differentiation, making it a fundamental tool for understanding the structure of higher-order calculus.


ARTICLE