Wilf–Zeilberger Pair
   HOME

TheInfoList



OR:

In 
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, specifically 
combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many appl ...
, 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 Herbert Saul Wilf (June 13, 1931 – January 7, 2012) was a mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics in Combinatorial Analysis and Computing at the University of Pennsylv ...
and 
Doron Zeilberger Doron Zeilberger (דורון ציילברגר, born 2 July 1950 in Haifa, Israel) is an Israeli mathematician, known for his work in combinatorics. Education and career He received his doctorate from the Weizmann Institute of Science in 1976, ...
, and are instrumental in the evaluation of many 
sums In mathematics, summation is the addition of a sequence of any kind of numbers, called ''addends'' or ''summands''; the result is their ''sum'' or ''total''. Beside numbers, other types of values can be summed as well: function (mathematics), fu ...
involving 
binomial coefficient In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the t ...
s,
factorial In mathematics, the factorial of a non-negative denoted is the product of all positive integers less than or equal The factorial also equals the product of n with the next smaller factorial: \begin n! &= n \times (n-1) \times (n-2) \t ...
s, 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 In mathematics, Gosper's algorithm, due to Bill Gosper, is a procedure for finding sums of hypergeometric terms that are themselves hypergeometric terms. That is: suppose one has ''a''(1) + ... + ''a''(''n'') = ''S''(''n'')&nb ...
provides a sure method to find a function's WZ counterpart, and can be implemented in a  symbolic manipulation program.


Definition

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), : \lim_G(n,M) = 0. Together, these conditions ensure that : \sum_^\infty (n+1,k)-F(n,k)= 0 because the function ''G''
telescopes A telescope is a device used to observe distant objects by their emission, absorption, or reflection of electromagnetic radiation. Originally meaning only an optical instrument using lenses, curved mirrors, or a combination of both to observe ...
: :\begin \sum_^\infty (n+1,k)-F(n,k) & = \lim_ \sum_^M (n+1,k)-F(n,k)\\ & = \lim_ \sum_^M (n,k+1)-G(n,k)\\ & = \lim_ (n,M+1)-G(n,-M)\\ & = 0-0 \\ & = 0. \end Therefore, : \sum_^\infty F(n+1,k) = \sum_^\infty F(n,k), that is : \sum_^\infty F(n,k) = const. The constant does not depend on ''n''. Its value can be found by substituting ''n = n''0 for a particular ''n''0. 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) is a rational function of ''n'' and ''k'' and is called the ''WZ proof certificate''.


Example

A Wilf–Zeilberger pair can be used to verify the identity : \sum_^\infty (-1)^k 4^ = . Divide the identity by its right-hand side: : \sum_^\infty \frac = 1. Use the proof certificate : R(n,k)=\frac to verify that the left-hand side does not depend on ''n'', where :\begin F(n,k)&=\frac, \\ G(n,k)&=R(n,k)F(n,k-1). \end 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.


References

* * .


See also

* Almkvist–Zeilberger method, an analog of WZ method for evaluating definite integrals. *


External links


Gosper's algorithm
gives a method for generating WZ pairs when they exist.
Generatingfunctionology
provides details on the WZ method of identity certification. {{DEFAULTSORT:Wilf-Zeilberger pair Combinatorics