Faà di Bruno's Formula/Proof 2

Proof
For convenience, let:
 * $w_j := D_u^j w$
 * $u_k := D_x^k u$

Then:

Thus:

Analogously, let a corresponding tableau be set up of set partitions as follows:

Thus inspired, let $a_1 a_2 \cdots a_j$ denote a partition of the set $\set {1, 2, \ldots, n-1}$.

Let:

This rule is isomorphic to:

where the term $w_j u_{r_1} u_{r_2} \ldots u_{r_j}$ corresponds to a partition $a_1 a_2 \cdots a_j$.

Thus there exists a bijection from $\DD^n$ to $D_x^n w$.

Thus, collecting like terms in $D_x^n w$, we obtain a sum of terms:
 * $\map c {k_1, k_2, \ldots} w_j u_i^{k_1} u_2^{k_2} \ldots$

where:
 * $j = k_1 + k_2 + \cdots$

and:
 * $n = k_1 + 2 k_2 + \cdots$

and where:
 * $\map c {k_1, k_2, \ldots}$ is the number of partitions of $\set {1, 2, \ldots, n}$ into $j$ subsets where there are $k_t$ subsets with $t$ elements.

Consider an array of $k_t$ boxes of capacity $t$.

The number of ways to put $n$ different elements into these boxes is the multinomial coefficient:


 * $\dbinom n {1, 1, \ldots, 1, 2, 2, \ldots, 2, 3, 3, \ldots, 3, 4, \ldots} = \dfrac {n!} {\paren {1!}^{k_1} \paren {2!}^{k_2} \paren {3!}^{k_3} \cdots}$

It remains to divide by $k_1! \, k_2! \, k_3! \ldots$ corresponding to the number of ways each group of $k_t$ can be permuted

Hence:
 * $\map c {k_1, k_2, \ldots} = \dfrac {n!} {k_1! \paren {1!}^{k_1} \, k_2! \paren {2!}^{k_2} k_3! \paren {3!}^{k_3} \cdots}$

and the result follows.