TheoremBase

The Multinomial Theorem in a Commutative Ring

The n-th power of a sum of m elements of a commutative ring is the sum, over all exponent tuples with sum n, of the multinomial coefficient times the corresponding monomial.

Statement

In the setting of Finite Combinatorics: Notation, let RR, with ++, ⋅\cdot, 00 and 11, be a commutative ring. Let m∈Nm\in\mathbb{N}, x1,…,xm∈Rx_{1},\dots,x_{m}\in R and n∈N0n\in\mathbb{N}_{0}, and let K={k∈N0m:k1+⋯+km=n}K=\{k\in\mathbb{N}_{0}^{m}:k_{1}+\dots+k_{m}=n\}, with tuples as in Tuples in a Set: the Set of n-Tuples and Their Components (i).

Multinomial theorem.

(x1+⋯+xm)n=∑k∈K(k1+⋯+kmk1,…,km)x1k1⋯xmkm.(x_{1}+\dots+x_{m})^{n}=\sum_{k\in K}\binom{k_{1}+\dots+k_{m}}{k_{1},\dots,k_{m}}x_{1}^{k_{1}}\cdots x_{m}^{k_{m}}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…