Hockey-stick identity explained

In combinatorial mathematics, the hockey-stick identity,^[1] Christmas stocking identity,^[2] boomerang identity, Fermat's identity or Chu's Theorem,^[3] states that if

n \geq r \ge 0 are integers, then\binom{r}{r} + \binom{r +1 }{r} + \binom{r +2 }{r} + … + \binom{n}{r} = \binom{n +1 }{r +1 }.

The name stems from the graphical representation of the identity on Pascal's triangle: when the addends represented in the summation and the sum itself are highlighted, the shape revealed is vaguely reminiscent of those objects (see hockey stick, Christmas stocking).

Formulations

Using sigma notation, the identity states

\sum ^{n} _{i = r} {i\choose r} = {n +1 \choose r +1 } for n,r\in N , n\geq r

or equivalently, the mirror-image by the substitution

j\to i - r :\sum ^{n - r} _{j =0} {j + r\choose r} = \sum ^{n - r} _{j =0} {j + r\choose j} = {n +1 \choose n - r} for n,r\in N , n\geq r.

Proofs

Generating function proof

Let

X =1+ x . Then, by the partial sum formula for geometric series, we find thatX ^{r} + X ^{r+1} + ... + X ^{n} = (X ^{r-X} ^{n+1})/(1- X) = (X ^{n+1} - X ^{r})/(x) .Further, by the binomial theorem, we also find thatX ^{r} = ( 1+ x) ^{r} = \sum ^{r + k} _{i =0} \binom{r + k}{i} x ^{i} .

Note that this means the coefficient of

x ^{r} in X ^{r} is given by \binom{r + k}{r} .

Thus, the coefficient of

x ^{r} in the left hand side of our first equation can be obtained by summing over the coefficients of x ^{r} from each term, which gives\sum ^{n - r} _{k =0} \binom{r + k}{r}

Similarly, we find that the coefficient of

x ^{r} on the right hand side is given by the coefficient of x ^{r} in X ^{n+1} - X ^{r} , which is\binom{n + 1 }{r + 1 } - \binom{r}{r + 1 } = \binom{n + 1 }{r + 1 }

Therefore, we can compare the coefficients of

x ^{r} on each side of the equation to find that\sum ^{n - r} _{k =0} \binom{r + k}{r} = \binom{n + 1 }{r + 1 }

Inductive and algebraic proofs

The inductive and algebraic proofs both make use of Pascal's identity:

{n \choose k} = {n -1 \choose k -1 } + {n -1 \choose k}.

Inductive proof

This identity can be proven by mathematical induction on

n .

Base caseLet

n = r ;\sum ^{n} _{i = r} {i\choose r} = \sum ^{r} _{i = r} {i\choose r} = {r\choose r} = 1 = {r +1 \choose r +1 } = {n +1 \choose r +1 }.

Inductive stepSuppose, for some

k\in N , k \geqslant r ,\sum ^{k} _{i = r} {i\choose r} = {k +1 \choose r +1 }

Then

\sum ^{k +1} _{i = r} {i\choose r} = \left(\sum ^{k} _{i = r} {i\choose r} \right) + {k +1 \choose r} = {k +1 \choose r +1 } + {k +1 \choose r} = {k +2 \choose r +1 }.

Algebraic proof

We use a telescoping argument to simplify the computation of the sum:

\begin{align} \sum _{t=\color{blue} 0 } ^{n} \binom{t}{k} = \sum _{t=\color{blue} k} ^{n\binom} tk & = \sum ^{n\left[} _{t = k} \binom {t +1 }{k +1 } - \binom {t}{k +1 }\right]\\ & = \sum _{t=\color{green} k} ^{\color{green} n}\binom {\color{green}{t +1 }}{k +1 } - \sum ^{n} _{t = k} \binom t{k +1 }\\ & = \sum _{t=\color{green} {k +1 }} ^{\color{green} {n +1 }}\binom {\color{green}{t}}{k +1 } - \sum ^{n} _{t = k} \binom t{k +1 }\\ & = \binom{n +1 }{k +1 } - \underbrace{\binom k{k +1 }} _{0&&bytelescoping\\ &=\binom{n+1}{k+1}. \end{align}}

Combinatorial proofs

Proof 1

Imagine that we are distributing

n indistinguishable candies to k distinguishable children. By a direct application of the stars and bars method, there are\binom{n + k -1 }{ k -1 }

ways to do this. Alternatively, we can first give

0 \leqslant i\leqslant n candies to the oldest child so that we are essentially giving n - i candies to k -1 kids and again, with stars and bars and double counting, we have\binom{n + k -1 }{ k -1 } = \sum ^{n\binom{n + k -2- i}{k -2 },} _{i =0}

which simplifies to the desired result by taking

n' = n + k -2 and r = k -2 , and noticing that n' - n = k -2= r :\binom{n' +1 }{ r +1 } = \sum ^{n} _{i =0} \binom {n' - i}r = \sum ^{n'} _{i = r} \binom {i}r .

Proof 2

We can form a committee of size

k +1 from a group of n +1 people in\binom{n +1 }{k +1 }

ways. Now we hand out the numbers

1 , 2 , 3 , ... ,n - k +1 to n - k +1 of the n +1 people. We can then divide our committee-forming process into n - k +1 exhaustive and disjoint cases based on the committee member with the lowest number, x . Note that there are only k people without numbers, meaning we must choose at least one person with a number in order to form a committee of k +1 people. In general, in case x , person x is on the committee and persons 1 , 2 , 3 , ... , x -1 are not on the committee. The rest of the committee can then be chosen in\binom{n - x +1 }{k}

ways. Now we can sum the values of these

n - k +1 disjoint cases, and using double counting, we obtain\binom{n +1 }{k +1 } = \binom n k + \binom {n -1 } k + \binom{n -2 } k + … + \binom{k +1 } k + \binom k k.

See also

• • Pascal's identity Pascal's triangle
• Leibniz triangle
• Vandermonde's identity
• Faulhaber's formula, for sums of arbitrary polynomials.

External links

• On AOPS
• On StackExchange, Mathematics
• Pascal's Ladder on the Dyalog Chat Forum

Notes and References

1. CH Jones (1996) Generalized Hockey Stick Identities and N-Dimensional Block Walking. Fibonacci Quarterly 34(3), 280-288.
2. Web site: Christmas Stocking Theorem. W.. Weisstein, Eric. mathworld.wolfram.com. en. 2016-11-01.
3. Book: Merris, Russell . Combinatorics . 2003 . Wiley-Interscience . 0-471-45849-X . 2nd . Hoboken, N.J. . 45 . 53121765.