Qfyilyi

For $k, l in mathbb N$
$$sum_{i=0}^ksum_{j=0}^lbinom{i+j}i=binom{k+l+2}{k+1}-1$$
How can I prove this?

I thought some ideas with Pascal's triangle, counting paths on the grid and simple deformation of the formula.

It can be checked here (wolframalpha).

If the proof is difficult, please let me know the main idea.

Sorry for my poor English.

Thank you.

EDIT:
I got the great and short proof using Hockey-stick identity by Anubhab Ghosal, but because of this form, I could also get the Robert Z's specialized answer.
Then I don't think it is fully duplicate.

Your idea about a combinatorial proof which is related to counting paths in a grid is a good one!

The binomial $binom{i+j}i$
counts the paths on the grid from $(0,0)$ to $(i,j)$ moving only right or up. So the double sum
$$sum_{i=0}^ksum_{j=0}^lbinom{i+j}i-1$$
counts the number of all such paths from $(0,0)$ to any vertex inside the rectangle $(0,k)times (0,l)$ different from $(0,0)$.

Now consider the paths from $(0,0)$ to $(k+1,l+1)$ different from $$(0,0)to (0,l+1)to (k+1,l+1)quadtext{and}quad
(0,0)to (k+1,0)to (k+1,l+1)$$ which are
$$binom{k+l+2}{k+1}-2.$$

Now any path of the first kind can be completed to a path of the second kind by changing direction, going to the boundary of the rectangle
$(0,k+1)times(0,l+1)$ and then moving to the corner $(k+1,l+1)$ along the side.

Is this a bijection between the first set of paths and the second one?

$$displaystylesum_{i=0}^ksum_{j=0}^lbinom{i+j}i=sum_{i=0}^ksum_{j=i}^{i+l}binom{j}i=sum_{i=0}^kbinom{i+l+1}{i+1} ^{[1]}$$

$$=sum_{i=0}^kbinom{i+l+1}{l}=sum_{i=l}^{k+l+1}binom{i}{l}−1=binom{k+l+2}{k+1}-1 ^{[1]}$$

1. Hockey-Stick Identity