The generalization of the binomial theorem that expands (x1 + x2 + ... + xm)^n as a sum over all m-tuples of nonnegative integers (k1,...,km) with sum n, with coefficients given by the multinomial coefficients n!/(k1!...km!).

Principle

Each multinomial coefficient counts the number of distinct ways to allocate n labeled positions among m distinct categories with specified occupancy numbers k1,...,km, producing the corresponding monomial term.

Demonstration

For m = 3 and n = 2: (x + y + z)^2 = x^2 + y^2 + z^2 + 2xy + 2xz + 2yz; coefficients 2 correspond to choices where two distinct variables occupy the two factors.

Misapplication

Applying the finite multinomial formula when factors are noncommuting (e.g., matrices) without accounting for order, or treating noninteger exponents as if the finite combinatorial expansion still held.

Consequence

Enables systematic expansion of powers of sums with many terms, underpins multinomial probability distributions, and provides coefficient formulas used in symmetric polynomial identities and combinatorial enumerations.

Reversal

The inversion treats a multivariate polynomial as factorizable or as arising from products of linear forms rather than as an explicit sum of monomials; reversing emphasizes decomposition over combinatorial assembly.

Boundary

Gives a finite expansion only for nonnegative integer n. For noninteger exponents one requires series expansions with convergence analysis. The standard statement assumes commuting scalar variables; further structure is needed for operator- or noncommutative-valued variables.

Semantic Tension

Close to the binomial theorem (the special case m = 2) and to generating-function methods: the multinomial theorem is a coefficient identity with combinatorial counting content, while generating functions treat similar counts via analytic apparatus.

Synthesis

The Multinomial Theorem extends binomial expansion to sums of arbitrarily many commuting terms by expressing the n-th power as a sum over occupancy distributions; its coefficients are factorial-based counts that connect polynomial algebra to enumerative combinatorics and multivariate probability.