Faà di Bruno's formula is an identity in mathematics generalizing the chain rule to higher derivatives. It is named after Francesco Faà di Bruno (1855, 1857), although he was not the first to state or prove the formula. In 1800, more than 50 years before Faà di Bruno, the French mathematician Louis François Antoine Arbogast had stated the formula in a calculus textbook,[1] which is considered to be the first published reference on the subject.[2]
Perhaps the most well-known form of Faà di Bruno's formula says that
![{\displaystyle {d^{n} \over dx^{n}}f(g(x))=\sum {\frac {n!}{m_{1}!\,1!^{m_{1}}\,m_{2}!\,2!^{m_{2}}\,\cdots \,m_{n}!\,n!^{m_{n}}}}\cdot f^{(m_{1}+\cdots +m_{n})}(g(x))\cdot \prod _{j=1}^{n}\left(g^{(j)}(x)\right)^{m_{j}},}](//wikimedia.org/api/rest_v1/media/math/render/svg/6bef53bf2898c47370c394592ed95a17ced35a04)
where the sum is over all
-tuples of nonnegative integers
satisfying the constraint
![{\displaystyle 1\cdot m_{1}+2\cdot m_{2}+3\cdot m_{3}+\cdots +n\cdot m_{n}=n.}](//wikimedia.org/api/rest_v1/media/math/render/svg/2386ea9ee11ffa7f538a1d45e3595cd66c38e885)
Sometimes, to give it a memorable pattern, it is written in a way in which the coefficients that have the combinatorial interpretation discussed below are less explicit:
![{\displaystyle {d^{n} \over dx^{n}}f(g(x))=\sum {\frac {n!}{m_{1}!\,m_{2}!\,\cdots \,m_{n}!}}\cdot f^{(m_{1}+\cdots +m_{n})}(g(x))\cdot \prod _{j=1}^{n}\left({\frac {g^{(j)}(x)}{j!}}\right)^{m_{j}}.}](//wikimedia.org/api/rest_v1/media/math/render/svg/115a3532fcb90d6c323e14a5a4fdd8f5eef065af)
Combining the terms with the same value of
and noticing that
has to be zero for
leads to a somewhat simpler formula expressed in terms of Bell polynomials
:
![{\displaystyle {d^{n} \over dx^{n}}f(g(x))=\sum _{k=0}^{n}f^{(k)}(g(x))\cdot B_{n,k}\left(g'(x),g''(x),\dots ,g^{(n-k+1)}(x)\right).}](//wikimedia.org/api/rest_v1/media/math/render/svg/90960a6b59de84381a7632209384f8ec98f1baeb)