WZ theory
Builds on Binomial coefficient
Definition
Let and be functions defined for integers and . The pair is a WZ pair if, for all and , The WZ method proves an identity , with , in three steps:
- set , so the identity reads ;
- give a rational function , the WZ certificate, such that with is a WZ pair;
- check that and that as for each .
Remarks
Why it works: summing the WZ equation over all makes the right side telescope to . So for all , and the sum stays equal to its value at . When is a hypergeometric term, the WZ equation divided by becomes an identity of rational functions, which is checked by algebra.
Example: the identity gives . The certificate is , so . Both sides of the WZ equation equal , by Pascal's rule. Also outside , and .
Non-example: for , the choice does not give a WZ pair. The equation would require , which fails for and , since .
The Wilf–Zeilberger pair node treats the pairs themselves in more detail.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binomial coefficient concept
- WZ theory definition
Further reading
About this page
| Tag | 4HP429BZQ5 |
|---|---|
| URI | m2://4HP429BZQ5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05A19, 33F10 |
| Defines | WZ theory |
| Uses | Binomial coefficient |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.