I met a problem which gave me the left part, and I can compute left part and get right part by Mathematica. However, I don't know how to prove:
$$\sum_{k=x+y}^{\infty}\binom{k-1}{y-1}\binom{k-y}{x}u^k = \binom{x+y-1}{y-1}\left(\frac{u}{1-u}\right)^{x+y}$$ with $x, y \in \mathbb{Z}, x \ge 0, y \ge 1, 0 \le u < 1$.
My Questions:
How to prove above binomial identity?
Is there simple argument behind it? Since it's quite simple, maybe we can construct two equivalent counting processes.
As explained in this thread, the taylor polynomial of
$$\left(\frac{1}{1-u}\right)^{x+y} = \sum_{k=0}^\infty {k+x+y-1 \choose x+y-1 } u^k$$
So
\begin{align}\binom{x+y-1}{y-1}\left(\frac{u}{1-u}\right)^{x+y} &= \sum_{k=0}^\infty \binom{x+y-1}{y-1}{k+x+y-1 \choose x+y-1 } u^{k+x+y} \\ &= \sum_{k=0}^\infty \frac{(k+x+y-1)!}{x!(y-1)!k!} u^{k+x+y} \\ &= \sum_{k=x+y}^\infty \frac{(k-1)!}{x!(y-1)!(k-x-y)!} u^{k} \\ &= \sum_{k=x+y}^\infty \binom{k-1}{y-1}{k-y \choose x }u^{k} \end{align}