In the book Concrete Mathematics, the following identity appears: $$(r-k){r\choose k} = r {r-1\choose k}$$ It is followed by a proof that it holds for all real r. This proof makes use of the property that
both sides of [the identity] are polynomials in r of degree k+1.
So far so good. However, the passage goes on by claiming that the following identity cannot be extended to real values for r this way, because it is not and identity between polynomials. $${n \choose k} = {n \choose n-k}$$
How can the factors (r-k) and r make the first identity polynomial when the second is not; am I missing some other difference that is critical?
We recall the definition (5.1) of binomial coefficients stated in chapter 5 Binomial coefficients with $\alpha\in\mathbb{C}$ and integer values $p$
\begin{align*} \binom{\alpha}{p}= \begin{cases} \frac{\alpha(\alpha-1)\cdots(\alpha-p+1)}{p!}&p\geq 0\\ 0&p<0 \end{cases}\tag{1} \end{align*}
In (2) we see the right hand side is a rational function with numerator and denominator being polynomials in $n$ of degree $n-k$.
Since the argument stated in the book is valid for polynomials only but not for rational functions in general, it cannot be applied to (2).