Algebraic proof

In general, the product of two polynomials with degrees m and n, respectively, is given by

${\displaystyle {\biggl (}\sum _{i=0}^{m}a_{i}x^{i}{\biggr )}{\biggl (}\sum _{j=0}^{n}b_{j}x^{j}{\biggr )}=\sum _{r=0}^{m+n}{\biggl (}\sum _{k=0}^{r}a_{k}b_{r-k}{\biggr )}x^{r},}$

where we use the convention that a_i = 0 for all integers i > m and b_j = 0 for all integers j > n. By the binomial theorem,

${\displaystyle (1+x)^{m+n}=\sum _{r=0}^{m+n}{m+n \choose r}x^{r}.}$

Using the binomial theorem also for the exponents m and n, and then the above formula for the product of polynomials, we obtain

${\displaystyle {\begin{aligned}\sum _{r=0}^{m+n}{m+n \choose r}x^{r}&=(1+x)^{m+n}\\&=(1+x)^{m}(1+x)^{n}\\&={\biggl (}\sum _{i=0}^{m}{m \choose i}x^{i}{\biggr )}{\biggl (}\sum _{j=0}^{n}{n \choose j}x^{j}{\biggr )}\\&=\sum _{r=0}^{m+n}{\biggl (}\sum _{k=0}^{r}{m \choose k}{n \choose r-k}{\biggr )}x^{r},\end{aligned}}}$

where the above convention for the coefficients of the polynomials agrees with the definition of the binomial coefficients, because both give zero for all i > m and j > n, respectively.

By comparing coefficients of x^r, Vandermonde's identity follows for all integers r with 0 ≤ r ≤ m + n. For larger integers r, both sides of Vandermonde's identity are zero due to the definition of binomial coefficients.

Combinatorial proof

Vandermonde's identity also admits a combinatorial double counting proof, as follows. Suppose a committee consists of m men and n women. In how many ways can a subcommittee of r members be formed? The answer is

${\displaystyle {m+n \choose r}.}$

The answer is also the sum over all possible values of k, of the number of subcommittees consisting of k men and r − k women:

${\displaystyle \sum _{k=0}^{r}{m \choose k}{n \choose r-k}.}$

Geometrical proof

Take a rectangular grid of r x (m+n−r) squares. There are

${\displaystyle {\binom {r+(m+n-r)}{r}}={\binom {m+n}{r}}}$

paths that start on the bottom left vertex and, moving only upwards or rightwards, end at the top right vertex (this is because r right moves and m+n-r up moves must be made (or vice versa) in any order, and the total path length is m + n). Call the bottom left vertex (0, 0).

There are ${\displaystyle {\binom {m}{k}}}$ paths starting at (0, 0) that end at (k, m−k), as k right moves and m−k upward moves must be made (and the path length is m). Similarly, there are ${\displaystyle {\binom {n}{r-k}}}$ paths starting at (k, m−k) that end at (r, m+n−r), as a total of r−k right moves and (m+n−r) − (m−k) upward moves must be made and the path length must be r−k + (m+n−r) − (m−k) = n. Thus there are

${\displaystyle {\binom {m}{k}}{\binom {n}{r-k}}}$

paths that start at (0, 0), end at (r, m+n−r), and go through (k, m−k). This is a subset of all paths that start at (0, 0) and end at (r, m+n−r), so sum from k = 0 to k = r (as the point (k, m−k) is confined to be within the square) to obtain the total number of paths that start at (0, 0) and end at (r, m+n−r).

Generalized Vandermonde's identity

One can generalize Vandermonde's identity as follows:

${\displaystyle \sum _{k_{1}+\cdots +k_{p}=m}{n_{1} \choose k_{1}}{n_{2} \choose k_{2}}\cdots {n_{p} \choose k_{p}}={n_{1}+\dots +n_{p} \choose m}.}$

This identity can be obtained through the algebraic derivation above when more than two polynomials are used, or through a simple double counting argument.

On the one hand, one chooses ${\displaystyle \textstyle k_{1}}$ elements out of a first set of ${\displaystyle \textstyle n_{1}}$ elements; then ${\displaystyle \textstyle k_{2}}$ out of another set, and so on, through ${\displaystyle \textstyle p}$ such sets, until a total of ${\displaystyle \textstyle m}$ elements have been chosen from the ${\displaystyle \textstyle p}$ sets. One therefore chooses ${\displaystyle \textstyle m}$ elements out of ${\displaystyle \textstyle n_{1}+\dots +n_{p}}$ in the left-hand side, which is also exactly what is done in the right-hand side.

Chu–Vandermonde identity

The identity generalizes to non-integer arguments. In this case, it is known as the Chu–Vandermonde identity (see Askey 1975, pp. 59–60) and takes the form

${\displaystyle {s+t \choose n}=\sum _{k=0}^{n}{s \choose k}{t \choose n-k}}$

for general complex-valued s and t and any non-negative integer n. It can be proved along the lines of the algebraic proof above by multiplying the binomial series for ${\displaystyle (1+x)^{s}}$ and ${\displaystyle (1+x)^{t}}$ and comparing terms with the binomial series for ${\displaystyle (1+x)^{s+t}}$.

This identity may be rewritten in terms of the falling Pochhammer symbols as

${\displaystyle (s+t)_{n}=\sum _{k=0}^{n}{n \choose k}(s)_{k}(t)_{n-k}}$

in which form it is clearly recognizable as an umbral variant of the binomial theorem (for more on umbral variants of the binomial theorem, see binomial type). The Chu–Vandermonde identity can also be seen to be a special case of Gauss's hypergeometric theorem, which states that

${\displaystyle \;_{2}F_{1}(a,b;c;1)={\frac {\Gamma (c)\Gamma (c-a-b)}{\Gamma (c-a)\Gamma (c-b)}}}$

where ${\displaystyle \;_{2}F_{1}}$ is the hypergeometric function and ${\displaystyle \Gamma (n+1)=n!}$ is the gamma function. One regains the Chu–Vandermonde identity by taking a = −n and applying the identity

${\displaystyle {n \choose k}=(-1)^{k}{k-n-1 \choose k}}$

liberally.

The Rothe–Hagen identity is a further generalization of this identity.