Hypergeometric function identities

From Wikipedia, the free encyclopedia

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

In mathematics, hypergeometric identities are equalities involving sums over hypergeometric terms, i.e. the coefficients occurring in hypergeometric series. These identities occur frequently in solutions to combinatorial problems, and also in the analysis of algorithms.

These identities were traditionally found 'by hand'. There exist now several algorithms which can find and prove all hypergeometric identities.

The list of the classically known identities is sometimes called Bailey's list, after W. N. Bailey.

1 Examples
2 Definition
3 Proofs
4 See also
5 External links

[edit] Examples

$\sum_{i=0}^{n} {n \choose i} = 2^{n}$

$\sum_{i=0}^{n} {n \choose i}^2 = {2n \choose n}$

$\sum_{k} k {n \choose k} = n2^{n-1}$

[edit] Definition

There are two definitions of hypergeometric terms, both used in different cases as explained below. See also hypergeometric series.

A term t_k is a hypergeometric term if

$\frac{t_{k+1}}{t_k}$

is a rational function in k.

A term F(n,k) is a hypergeometric term if

$\frac{F(n,k+1)}{F(n,k)}$

is a rational function in k.

There exist two types of sums over hypergeometric terms, the definite and indefinite sums. A definite sum is of the form

$\sum_{k} t_k.\,$

The indefinite sum is of the form

$\sum_{k=0}^{n} F(n,k).$

[edit] Proofs

Although in the past one has found beautiful proofs of certain identities there exist several algorithms to find and prove identities. These algorithms first find a simple expression for a sum over hypergeometric terms and then provide a certificate which anyone could use to easily check and prove the correctness of the identity.

For each of the hypergeometric sum types there exist one or more methods to find a simple expression. These methods also provide a certificate to easily check the proof of an identity:

Definite sums: Sister Celine's Method, Zeilberger's Algorithm
Indefinite sums: Gosper's Algorithm

A book named A = B has been written by Marko Petkovšek, Herbert Wilf and Doron Zeilberger describing the three main approaches described above.