In mathematics, specifically combinatorics, a Wilf–Zeilberger pair, or WZ pair, is a pair of functions that can be used to certify certain combinatorial identities. WZ pairs are named after Herbert S. Wilf and Doron Zeilberger, and are instrumental in the evaluation of many sums involving binomial coefficients, factorials, and in general any hypergeometric series. A function's WZ counterpart may be used to find an equivalent and much simpler sum. Although finding WZ pairs by hand is impractical in most cases, Gosper's algorithm provides a method to find a function's WZ counterpart, and can be implemented in a symbolic manipulation program.
Two functions F and G form a WZ pair if and only if the following two conditions hold:
F(n+1,k)-F(n,k)=G(n,k+1)-G(n,k),
\limMG(n,M)=0.
Together, these conditions ensure that
| infty | |
| \sum | |
| k=-infty |
[F(n+1,k)-F(n,k)]=0
because the function G telescopes:
\begin{align}
| infty | |
| \sum | |
| k=-infty |
[F(n+1,k)-F(n,k)]&{}=\limM
| M[F(n+1,k)-F(n,k)] | |
| \sum | |
| k=-M |
\\ &{}=\limM
| M | |
| \sum | |
| k=-M |
[G(n,k+1)-G(n,k)]\\ &{}=\limM[G(n,M+1)-G(n,-M)]\\ &{}=0-0\\ &{}=0. \end{align}
Therefore,
| infty | |
| \sum | |
| k=-infty |
F(n+1,k)=
| infty | |
| \sum | |
| k=-infty |
F(n,k),
that is
| infty | |
| \sum | |
| k=-infty |
F(n,k)=const.
The constant does not depend on n.Its value can be found by substituting n = n0for a particular n0.
If F and G form a WZ pair, then they satisfy the relation
G(n,k)=R(n,k)F(n,k-1),
where
R(n,k)
A Wilf–Zeilberger pair can be used to verify the identity
| infty | |
| \sum | |
| k=0 |
(-1)k{n\choosek}{2k\choosek}4n-k={2n\choosen}.
Divide the identity by its right-hand side:
| infty | |
| \sum | |
| k=0 |
| (-1)k{n\choosek | |
| 2k\choosek |
4n-k
Use the proof certificate
| R(n,k)= | 2k-1 |
| 2n+1 |
to verify that the left-hand side does not depend on n,where
\begin{align}F(n,k)&=
| (-1)k{n\choosek | |
| 2k\choosek |
4n-k
Now F and G form a Wilf–Zeilberger pair.
To prove that the constant in the right-hand side of the identity is 1, substitute n = 0, for instance.