State and prove a multinomial theorem?

The multinomial theorem is a generalization of the binomial theorem, which allows us to expand expressions that involve sums of more than two terms. It provides a formula for expanding expressions of the form \((x_1 + x_2 + ... + x_k)^n\), where \(k\) is the number of terms and \(n\) is a non-negative integer.

Multinomial Theorem Statement

The multinomial theorem states that:

\[ (x_1 + x_2 + ... + x_k)^n = \sum_{j_1 + j_2 + ... + j_k = n} \frac{n!}{j_1! j_2! ... j_k!} x_1^{j_1} x_2^{j_2} ... x_k^{j_k} \]

In this formula, \(j_1, j_2, ..., j_k\) are non-negative integers that sum up to \(n\), and \(n!\) denotes the factorial of \(n\).

Proof of the Multinomial Theorem

To prove the multinomial theorem, we can use the principle of combinatorial counting:

• Consider the expression \((x_1 + x_2 + ... + x_k)^n\). Each term in the expansion corresponds to a way of selecting \(n\) items from \(k\) categories.
• When expanding, each term \(x_1^{j_1} x_2^{j_2} ... x_k^{j_k}\) represents a selection where \(j_1\) items are chosen from \(x_1\), \(j_2\) from \(x_2\), and so on.
• The number of ways to arrange these selections is given by the multinomial coefficient \(\frac{n!}{j_1! j_2! ... j_k!}\), which accounts for the different arrangements of the selected items.

By summing over all possible combinations of \(j_1, j_2, ..., j_k\) such that their total equals \(n\), we obtain the complete expansion of the expression.

Example

For a practical illustration, consider the expansion of \((x + y + z)^3\):

\[ (x + y + z)^3 = \sum_{j_1 + j_2 + j_3 = 3} \frac{3!}{j_1! j_2! j_3!} x^{j_1} y^{j_2} z^{j_3} \]

This results in terms like \(x^3\), \(3x^2y\), \(3x^2z\), \(3xy^2\), \(3xz^2\), \(y^3\), \(z^3\), and \(xyz\), showcasing the various combinations of the variables.

In summary, the multinomial theorem provides a powerful tool for expanding polynomial expressions with multiple variables, making it essential in combinatorics and algebra.