Generalized Hypergeometric Function

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written

 (c_(k+1))/(c_k)=(P(k))/(Q(k))=((k+a_1)(k+a_2)...(k+a_p))/((k+b_1)(k+b_2)...(k+b_q)(k+1)).
(1)

(The factor of k+1 in the denominator is present for historical reasons of notation.) The resulting generalized hypergeometric function is written

sum_(k=0)^(infty)c_kx^k=_pF_q[a_1,a_2,...,a_p; b_1,b_2,...,b_q;x]
(2)
=sum_(k=0)^(infty)((a_1)_k(a_2)_k...(a_p)_k)/((b_1)_k(b_2)_k...(b_q)_k)(x^k)/(k!),
(3)

where (a)_k is the Pochhammer symbol or rising factorial

 (a)_k=(Gamma(a+k))/(Gamma(a))=a(a+1)...(a+k-1).
(4)

A generalized hypergeometric function _pF_q(a_1,...,a_p; b_1,...,b_q;x) therefore has p parameters of type 1 and q parameters of type 2.

A number of generalized hypergeometric functions has special names. _0F_1(;b;z) is called a confluent hypergeometric limit function, and is implemented in the Wolfram Language as Hypergeometric0F1[b, z]. _1F_1(a;b;z) (also denoted M(z)) is called a confluent hypergeometric function of the first kind, and is implemented in the Wolfram Language as Hypergeometric1F1[a, b, z]. The function _2F_1(a,b;c;z) is often called "the" hypergeometric function or Gauss's hypergeometric function, and is implemented in the Wolfram Language as Hypergeometric2F1[a, b, c, x]. Arbitrary generalized hypergeometric functions are implemented as HypergeometricPFQ[{a1, ...ap}, {b1, ..., bq}, x].

The notation for generalized hypergeometric functions was introduced by Pochhammer in 1870 and modified by Barnes (1907, 1908ab; Slater 1960, p. 2; Hardy 1999, p. 111). A number of notational variations are commonly used, including

 _pF_q(a_1,...,a_p;b_1,...,b_q;x),
(5)

used primarily for p,q<=2, using square brackets instead of parentheses

 _pF_q[a_1,...,a_p;b_1,...,b_q;x]
(6)

(Slater 1960, p. 2), including x at the end of the first row and aligning slots in the second row from the right

 _pF_q[a_1,a_2,...,a_p;;  b_1,...,b_q z; ]
(7)

(Bailey 1935, p. 9), including x at the end of the first row and centering each row

 _pF_q[a_1,a_2,...,a_p;z; b_1,...,b_q]
(8)

(Bailey 1935, p. 14), using strict matrix-like alignment of each column with columns right-aligned along their right-most elements

 _pF_q[a_1 a_2 ... a_p;;  b_1 ..., b_q z; ]
(9)

or

 _pF_q[a_1 a_2 ... a_p;;  b_1 ..., b_q;z]
(10)

(Slater 1960, p. 31), and a variation in which rows are centered and x is placed to the right separated by a vertical bar and using parenthesis

 _pF_q(a_1,a_2,...,a_p; b_1,...,b_q|x)
(11)

(Graham et al. 1994, p. 205) or using square brackets and a semicolon

 _pF_q[a_1,a_2,...,a_p; b_1,...,b_q;x].
(12)

The latter convention will be used in this work, as it provides the clearest delineation of the argument x while making the most sparing use of white space in the typesetting of expressions that may contain a large number of symbolic parameters of differing lengths.

If the argument is equal to x=1, then it is conventional to omit the argument altogether, although the trailing semicolon may be either retained or also discarded depending on notational convention. Bailey (1935, p. 9) uses the notation

 _pF_q[a_1,a_2,...,a_p;; b_1,...,b_q]=_pF_q[a_1,a_2,...,a_p;1; b_1,b_2,...,b_q],
(13)

although in this work, the semicolon will be omitted, i.e.,

 _pF_q[a_1,a_2,...,a_p; b_1,b_2,...,b_q]=_pF_q[a_1,a_2,...,a_p; b_1,b_2,...,b_q].
(14)

The Kampe de Feriet function is a generalization of the generalized hypergeometric function to two variables.

The generalized hypergeometric function F_n(x)=_pF_q[a_1,a_2...,a_p; b_1,b_2,...,b_q;x] satisfies

 thetaF_n(x)=n[F_(n+1)(x)-F_n(x)]
(15)

for any of its numerator parameters n=alpha_k, and

 thetaF_n(x)=(n-1)[F_(n-1)(x)-F_n(x)]
(16)

for any of its denominator parameters n=beta_k, where

 theta=zd/(dz)
(17)

is the differential operator (Rainville 1971, Koepf 1998, p. 27).

The generalized hypergeometric function

 _(p+1)F_p[a_1,a_2,...,a_(p+1); b_1,b_2,...,b_p;z]
(18)

is a solution to the differential equation

 [theta(theta+b_1-1)...(theta+b_p-1)-z(theta+a_1)(theta+a_2)...(theta+a_(p+1))]y=0
(19)

(Bailey 1935, p. 8). The other linearly independent solution is

 z^(1-b_1)_(p+1)F_p[1+a_1-b_1,1-a_2-b_2,...,1+a_(p+1)-b_1; 2-b_1,1-b_2-b_1,...,1-b_p-b_1;z].
(20)

A generalized hypergeometric function _(q+1)F_q converges absolutely on the unit circle if

 R(sum_(j=1)^qbeta_j-sum_(j=1)^(q+1)alpha_j)>0
(21)

(Rainville 1971, Koepf 1998).

Many sums can be written as generalized hypergeometric functions by inspection of the ratios of consecutive terms in the generating hypergeometric series. For example, for

 f(n)=sum_(k)(-1)^k(2n; k)^2,
(22)

the ratio of successive terms is

 (a_(k+1))/(a_k)=((-1)^(k+1)(2n; k+1)^2)/((-1)^k(2n; k)^2)=-((k-2n)^2)/((k+1)^2),
(23)

yielding

 f(n)=_2F_1[-2n,-2n;  1;-1]=_2F_1(-2n,-2n;1;-1)
(24)

(Petkovšek et al. 1996, pp. 44-45).

Gosper (1978) discovered a slew of unusual hypergeometric function identities, many of which were subsequently proven by Gessel and Stanton (1982). An important generalization of Gosper's technique, called Zeilberger's algorithm, in turn led to the powerful machinery of the Wilf-Zeilberger pair (Zeilberger 1990).

Special hypergeometric identities include Gauss's hypergeometric theorem

 _2F_1(a,b;c;1)=(Gamma(c)Gamma(c-a-b))/(Gamma(c-a)Gamma(c-b))
(25)

for R[c-a-b]>0, Kummer's formula

 _2F_1(a,b;c;-1)=(Gamma(1/2b+1)Gamma(b-a+1))/(Gamma(b+1)Gamma(1/2b-a+1)),
(26)

where a-b+c=1 and b is a positive integer, Saalschütz's theorem

 _3F_2(a,b,c;d,e;1)=((d-a)_(|c|)(d-b)_(|c|))/(d_(|c|)(d-a-b)_(|c|))
(27)

for d+e=a+b+c+1 with c a negative integer and (a)_n the Pochhammer symbol, Dixon's theorem

 _3F_2(a,b,c;d,e;1)=((1/2a)!(a-b)!(a-c)!(1/2a-b-c)!)/(a!(1/2a-b)!(1/2a-c)!(a-b-c)!),
(28)

where 1+a/2-b-c has a positive real part, d=a-b+1, and e=a-c+1, the Clausen formula

 _4F_3[a,b,c,d; e,f,g;1]=((2a)_(|d|)(a+b)_(|d|)(2b)_(|d|))/((2a+2b)_(|d|)a_(|d|)b_(|d|)),
(29)

for a+b+c-d=1/2, e=a+b+1/2, a+f=d+1=b+g, d a nonpositive integer, and the Dougall-Ramanujan identity

 _7F_6[a_1,a_2,a_3,a_4,a_5,a_6,a_7;  b_1,b_2,b_3,b_4,b_5,b_6;1] 
=((a_1+1)_n(a_1-a_2-a_3+1)_n)/((a_1-a_2+1)_n(a_1-a_3+1)_n)((a_1-a_2-a_4+1)_n(a_1-a_3-a_4+1)_n)/((a_1-a_4+1)_n(a_1-a_2-a_3-a_4+1)_n),
(30)

where n=2a_1+1=a_2+a_3+a_4+a_5, a_6=1+a_1/2, a_7=-n, and b_i=1+a_1-a_(i+1) for i=1, 2, ..., 6. For all these identities, (a)_n is the Pochhammer symbol.

Gessel (1995) found a slew of new identities using Wilf-Zeilberger pairs, including the following:

 _5F_4[-a-b,n+1,n+c+1,2n-a-b+1,n+1/2(3-a-b); n-a-b-c+1,n-a-b+1,2n+2,n+1/2(1-a-b);1]=0
(31)
 _3F_2[-3n,2/3-c,3n+2; 3/2,1-3c;3/4]=((c+2/3)_n(1/3)_n)/((1-c)_n(4/3)_n)
(32)
 _3F_2[-3b,-3/2n,1/2(1-3n); -3n,2/3-b-n;4/3]=((1/3-b)_n)/((1/3+b)_n)
(33)
 _4F_3[3/2+1/5n,2/3,-n,2n+2; n+(11)/6,4/3,1/5n+1/2;2/(27)]=((5/2)_n((11)/6)_n)/((3/2)_n(7/2)_n)
(34)

(Petkovšek et al. 1996, pp. 135-137).

The following table gives various named identities ordered by the orders (p,q) of the _pF_qs they involve. Bailey (1935) gives a large number of such identities.

_2F_1Gauss's hypergeometric theorem, Kummer's theorem, Orr's theorem, Ramanujan's hypergeometric identity
_3F_2Darling's products, Dixon's theorem, Ramanujan's hypergeometric identity, Saalschütz's theorem, Thomae's theorem, Watson's theorem, Whipple's identity
_4F_3Clausen formula, Slater's formula, Whipple's transformation
_5F_4Dougall's theorem
_6F_5Whipple's identity
_7F_6Dougall-Ramanujan identity, Whipple's transformation
_9F_8Bailey's transformation

Nørlund (1955) gave the general transformation

 _nF_(n-1)[a_1,a_2,...,a_n; b_1,b_2,...,b_(n-1);xz] 
=(1-z)^(-a_1)sum_(nu=0)^infty((a_1)_nu)/(nu!)_nF_(n-1)[-nu,a_2,a_3,...,a_n; b_1,b_2,...,b_(n-1);x](z/(z-1))^nu,
(35)

where (a)_n is the Pochhammer symbol. This identity is based on the transformation due to Euler

 sum_(n=0)^infty((a)_n)/(n!)a_nz^n=(1-z)^(-a)sum_(n=0)^infty((a)_n)/(n!)Delta^na_0(z/(1-z))^n,
(36)

where Delta is the forward difference and

 Delta^ka_0=sum_(m=0)^k(-1)^m(k; m)a_(k-m)
(37)

(Nørlund 1955).

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.