Faà di Bruno's Formula/Proof 3
Jump to navigation
Jump to search
Let $D_x^k u$ denote the $k$th derivative of a function $u$ with respect to $x$.
Then:
- $\ds D_x^n w = \sum_{j \mathop = 0}^n D_u^j w \sum_{\substack {\sum_{p \mathop \ge 1} k_p \mathop = j \\ \sum_{p \mathop \ge 1} p k_p \mathop = n \\ \forall p \mathop \ge 1: k_p \mathop \ge 0} } n! \prod_{m \mathop = 1}^n \dfrac {\paren {D_x^m u}^{k_m} } {k_m! \paren {m!}^{k_m} }$
Proof
We have that:
- $\dfrac {D_x^k u} {k!}$ is the coefficient of $z^k$ in $\map u {x + z}$
- $\dfrac {D_u^j w} {j!}$ is the coefficient of $y^j$ in $\map w {u + y}$.
Hence the coefficient of $z^n$ in $\map w {\map u {x + z} }$ is:
- $\dfrac {D_x^n w} {n!} = \ds \sum_{\substack {\sum_{p \mathop \ge 1} k_p \mathop = j \\ \sum_{p \mathop \ge 1} p k_p \mathop = n \\ \forall p \mathop \ge 1: k_p \mathop \ge 0} } \dfrac {j!} {k_1! \, k_2! \cdots k_n!} \paren {\dfrac {D_x^1 u} {1!} }^{k_1} \paren {\dfrac {D_x^2 u} {2!} }^{k_2} \cdots \paren {\dfrac {D_x^n u} {n!} }^{k_n}$
This needs considerable tedious hard slog to complete it. In particular: plenty of details to be filled in To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Finish}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Source of Name
This entry was named for Francesco Faà di Bruno.
Sources
- 1800: L.F.A. Arbogast: Du Calcul des Dérivations
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.5$: Permutations and Factorials: Exercise $21$