The multinomial theorem
ProvedFamousTheorems.multinomial_theoremThe multinomial theorem. In a commutative semiring, for a finite index set and ,
where is the multinomial coefficient.
It generalises the binomial theorem to any number of summands. It is the basic counting identity behind the multinomial distribution and the expansion of .
Formalization note. The platform's older Multinomial_Theorem entry is a deprecated placeholder stating only True; this is the actual theorem. s.piAntidiag n is the finset of functions k supported on s with ∑ k = n, and Nat.multinomial s k is the multinomial coefficient. Mathlib: Finset.sum_pow_eq_sum_piAntidiag.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem multinomial_theorem {α R : Type*} [DecidableEq α] [CommSemiring R] (s : Finset α) (f : α → R) (n : ℕ) :
(∑ i ∈ s, f i) ^ n = ∑ k ∈ s.piAntidiag n, (Nat.multinomial s k : R) * ∏ i ∈ s, f i ^ k i := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Finset.sum_pow_eq_sum_piAntidiag`. Proof here reduces to that Mathlib result.