It is a combinatorics proof. Anyone has any idea on how to prove
$$\sum \limits_{i=0}^{l} \sum\limits_{j=0}^i (-1)^j {m-i\choose m-l} {n \choose j}{m-n \choose i-j} = 2^l {m-n \choose l}\;$$
We need to prove this equation holds for all $l$.
I know that $\sum {n \choose j}{m-n \choose i-j}$ equals to ${m \choose i}$ but has no idea if there is a $(-1)^j$, it seems like a PIE but actually not....
Could anyone help me move forward in the process?
It is convenient to use the coefficient of operator $[z^n]$ to denote the coefficient of $z^n$ in a series. We can write this way \begin{align*} [z^m](1+z)^n=\binom{n}{m}\tag{1} \end{align*}
Comment:
In (2) we apply (1) to the binomial coefficients of the inner series and set the upper limit of the index $j$ to $\infty$ without changing anything since we add only zeros.
In (3) we use the linearity of the coefficient of operator, do some rearrangements to prepare for the next step and use the rule \begin{align*} [u^{p-q}]P(u)=[u^p]u^qP(u) \end{align*}
In (4) we apply the substitution rule \begin{align*} A(u)=\sum_{j=0}^\infty a_ju^j=\sum_{j=0}^\infty u^j[z^j]A(z)\\ \end{align*}
In (5) we apply (1) to the binomial coefficient of the first series
In (6) we do again some rearrangement similar to (3)
In (7) we apply the substitution rule again
In (8) we select the index $j=l$ to obtain the term with power $m-n-l$