Multinomial theorem

In mathematics, the multinomial theorem describes how to expand a power of a sum in terms of powers of the terms in that sum. It is the generalization of the binomial theorem to polynomials.

Theorem

For any positive integer m and any nonnegative integer n, the multinomial formula tells us how a sum with m terms expands when raised to an arbitrary power n:

${\displaystyle (x_{1}+x_{2}+\cdots +x_{m})^{n}=\sum _{k_{1}+k_{2}+\cdots +k_{m}=n}{n \choose k_{1},k_{2},\ldots ,k_{m}}\prod _{t=1}^{m}x_{t}^{k_{t}}\,,}$

where

${n \choose k_{1},k_{2},\ldots ,k_{m}}={\frac {n!}{k_{1}!\,k_{2}!\cdots k_{m}!}}$

is a multinomial coefficient. The sum is taken over all combinations of nonnegative integer indices k₁ through k_m such that the sum of all k_i is n. That is, for each term in the expansion, the exponents of the x_i must add up to n. Also, as with the binomial theorem, quantities of the form x⁰ that appear are taken to equal 1 (even when x equals zero).

In the case m = 2, this statement reduces to that of the binomial theorem.

Example

The third power of the trinomial a + b + c is given by

$(a+b+c)^{3}=a^{3}+b^{3}+c^{3}+3a^{2}b+3a^{2}c+3b^{2}a+3b^{2}c+3c^{2}a+3c^{2}b+6abc.$

This can be computed by hand using the distributive property of multiplication over addition, but it can also be done (perhaps more easily) with the multinomial theorem, which gives us a simple formula for any coefficient we might want. It is possible to "read off" the multinomial coefficients from the terms by using the multinomial coefficient formula. For example:

$a^{2}b^{0}c^{1}$ has the coefficient ${3 \choose 2,0,1}={\frac {3!}{2!\cdot 0!\cdot 1!}}={\frac {6}{2\cdot 1\cdot 1}}=3$

$a^{1}b^{1}c^{1}$ has the coefficient ${3 \choose 1,1,1}={\frac {3!}{1!\cdot 1!\cdot 1!}}={\frac {6}{1\cdot 1\cdot 1}}=6$.

Alternate expression

The statement of the theorem can be written concisely using multiindices:

$(x_{1}+\cdots +x_{m})^{n}=\sum _{{|\alpha |=n}}{n \choose \alpha }x^{\alpha }$

where α = (α₁,α₂,…,α_m) and x^α = x₁^α₁x₂^α₂⋯x_m^α_m.

Proof

This proof of the multinomial theorem uses the binomial theorem and induction on m.

First, for m = 1, both sides equal x₁ⁿ since there is only one term k₁ = n in the sum. For the induction step, suppose the multinomial theorem holds for m. Then

$(x_{1}+x_{2}+\cdots +x_{m}+x_{{m+1}})^{n}=(x_{1}+x_{2}+\cdots +(x_{m}+x_{{m+1}}))^{n}$

$=\sum _{{k_{1}+k_{2}+\cdots +k_{{m-1}}+K=n}}{n \choose k_{1},k_{2},\ldots ,k_{{m-1}},K}x_{1}^{{k_{1}}}x_{2}^{{k_{2}}}\cdots x_{{m-1}}^{{k_{{m-1}}}}(x_{m}+x_{{m+1}})^{K}$

by the induction hypothesis. Applying the binomial theorem to the last factor,

$=\sum _{{k_{1}+k_{2}+\cdots +k_{{m-1}}+K=n}}{n \choose k_{1},k_{2},\ldots ,k_{{m-1}},K}x_{1}^{{k_{1}}}x_{2}^{{k_{2}}}\cdots x_{{m-1}}^{{k_{{m-1}}}}\sum _{{k_{m}+k_{{m+1}}=K}}{K \choose k_{m},k_{{m+1}}}x_{m}^{{k_{m}}}x_{{m+1}}^{{k_{{m+1}}}}$

$=\sum _{{k_{1}+k_{2}+\cdots +k_{{m-1}}+k_{m}+k_{{m+1}}=n}}{n \choose k_{1},k_{2},\ldots ,k_{{m-1}},k_{m},k_{{m+1}}}x_{1}^{{k_{1}}}x_{2}^{{k_{2}}}\cdots x_{{m-1}}^{{k_{{m-1}}}}x_{m}^{{k_{m}}}x_{{m+1}}^{{k_{{m+1}}}}$

which completes the induction. The last step follows because

${n \choose k_{1},k_{2},\ldots ,k_{{m-1}},K}{K \choose k_{m},k_{{m+1}}}={n \choose k_{1},k_{2},\ldots ,k_{{m-1}},k_{m},k_{{m+1}}},$

as can easily be seen by writing the three coefficients using factorials as follows:

${\frac {n!}{k_{1}!k_{2}!\cdots k_{{m-1}}!K!}}{\frac {K!}{k_{m}!k_{{m+1}}!}}={\frac {n!}{k_{1}!k_{2}!\cdots k_{{m+1}}!}}.$

Multinomial coefficients

The numbers

${n \choose k_{1},k_{2},\ldots ,k_{m}}={\frac {n!}{k_{1}!\,k_{2}!\cdots k_{m}!}},$

which can also be written as

$={k_{1} \choose k_{1}}{k_{1}+k_{2} \choose k_{2}}\cdots {k_{1}+k_{2}+\cdots +k_{m} \choose k_{m}}=\prod _{{i=1}}^{m}{\sum _{{j=1}}^{i}k_{j} \choose k_{i}}$

are the multinomial coefficients. Just like "n choose k" are the coefficients when a binomial is raised to the n^th power (e.g., the coefficients are 1,3,3,1 for (a + b)³, where n = 3), the multinomial coefficients appear when a multinomial is raised to the n^th power (e.g., (a + b + c)³).

Sum of all multinomial coefficients

The substitution of x_i = 1 for all i into:

$\sum _{{k_{1}+k_{2}+\cdots +k_{m}=n}}{n \choose k_{1},k_{2},\ldots ,k_{m}}x_{1}^{{k_{1}}}x_{2}^{{k_{2}}}\cdots x_{m}^{{k_{m}}}=(x_{1}+x_{2}+\cdots +x_{m})^{n}\,,$

gives immediately that

$\sum _{{k_{1}+k_{2}+\cdots +k_{m}=n}}{n \choose k_{1},k_{2},\ldots ,k_{m}}=m^{n}\,.$

Number of multinomial coefficients

The number of terms in a multinomial sum, #_n,m, is equal to the number of monomials of degree n on the variables x₁, …, x_m:

$\#_{{n,m}}={n+m-1 \choose m-1}\,.$

The count can be performed easily using the method of stars and bars.

Central multinomial coefficients

All of the multinomial coefficients for which the following holds true:

$\left\lfloor {\frac {n}{m}}\right\rfloor \leq k_{i}\leq \left\lceil {\frac {n}{m}}\right\rceil ,\ \sum _{{i=1}}^{m}{k_{i}}=n,$

are central multinomial coefficients: the greatest ones and all of equal size.

A special case for m = 2 is the central binomial coefficient.

Interpretations

Ways to put objects into boxes

The multinomial coefficients have a direct combinatorial interpretation, as the number of ways of depositing n distinct objects into m distinct bins, with k₁ objects in the first bin, k₂ objects in the second bin, and so on.^[1]

Number of ways to select according to a distribution

In statistical mechanics and combinatorics if one has a number distribution of labels then the multinomial coefficients naturally arise from the binomial coefficients. Given a number distribution {n_i} on a set of N total items, n_i represents the number of items to be given the label i. (In statistical mechanics i is the label of the energy state.)

The number of arrangements is found by

• Choosing n₁ of the total N to be labeled 1. This can be done ${N \choose n_{1}}$ ways.
• From the remaining N − n₁ items choose n₂ to label 2. This can be done ${N-n_{1} \choose n_{2}}$ ways.
• From the remaining N − n₁ − n₂ items choose n₃ to label 3. Again, this can be done ${N-n_{1}-n_{2} \choose n_{3}}$ ways.

Multiplying the number of choices at each step results in:

${N \choose n_{1}}{N-n_{1} \choose n_{2}}{N-n_{1}-n_{2} \choose n_{3}}...={\frac {N!}{(N-n_{1})!n_{1}!}}{\frac {(N-n_{1})!}{(N-n_{1}-n_{2})!n_{2}!}}{\frac {(N-n_{1}-n_{2})!}{(N-n_{1}-n_{2}-n_{3})!n_{3}!}}....$

Upon cancellation, we arrive at the formula given in the introduction.

Number of unique permutations of words

The multinomial coefficient is also the number of distinct ways to permute a multiset of n elements, and k_i are the multiplicities of each of the distinct elements. For example, the number of distinct permutations of the letters of the word MISSISSIPPI, which has 1 M, 4 Is, 4 Ss, and 2 Ps is

${11 \choose 1,4,4,2}={\frac {11!}{1!\,4!\,4!\,2!}}=34650.$

(This is just like saying that there are 11! ways to permute the letters—the common interpretation of factorial as the number of unique permutations. However, we created duplicate permutations, because some letters are the same, and must divide to correct our answer.)

Generalized Pascal's triangle

One can use the multinomial theorem to generalize Pascal's triangle or Pascal's pyramid to Pascal's simplex. This provides a quick way to generate a lookup table for multinomial coefficients.

The case of n = 3 can be easily drawn by hand. The case of n = 4 can be drawn with effort as a series of growing pyramids.

See also

• Multinomial distribution
• Stars and bars (combinatorics)

References

1. National Institute of Standards and Technology (May 11, 2010). "NIST Digital Library of Mathematical Functions". Section 26.4. Retrieved August 30, 2010.

External links

• mutinom.m function in Specfun (since 1.1.0) package of Octave-Forge for GNU Octave. SVN version
• Hazewinkel, Michiel, ed. (2001), "Multinomial coefficient", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4