Professional Documents
Culture Documents
Hypergeometric Functions
Hypergeometric Functions
n = 0, 1, 2, . . . .
(1)
The factor z appears because the polynomials involved need not to be monic. The factor
(n + 1) in the denominator is convenient in the sequel. This factor may result from the
factorization, or it may not. If not, this extra factor can be compensated by one of the factors
(n + ai ) in the numerator (choose ai = 1 for some i).
Iteration of (1) leads to
cn =
n = 0, 1, 2, . . . .
X
n=0
cn = c0
n = 1, 2, 3, . . .
and (a)0 := 1.
X
(a1 )n (a2 )n (ap )n z n
.
(b1 )n (b2 )n (bq )n n!
n=0
This leads to
Definition 2. The hypergeometric function p Fq (a1 , a2 , . . . , ap ; b1 , b2 , . . . , bq ; z) is defined by
means of a hypergeometric series as
X
Of course, the parameters must be such that the denominator factors in the terms of the
series are never zero. When one of the numerator parameters ai equals N , where N is a
nonnegative integer, the hypergeometric function is a polynomial in z (see below). Otherwise,
the radius of convergence of the hypergeometric series is given by
if p < q + 1
1 if p = q + 1
=
0 if p > q + 1.
This follows directly from the ratio test. In fact,
0
cn+1
=
|z|
lim
n cn
we have
if p < q + 1
if p = q + 1
if p > q + 1.
Sometimes the most general hypergeometric function p Fq is called a generalized hypergeometric function. Then the words hypergeometric function refer to the special case
X
a, b
(a)n (b)n z n
;z =
.
2 F1 (a, b; c; z) = 2 F1
c
(c)n
n!
n=0
N, b
;z
c
N
X
(N )n (b)n z n
=
,
(c)n
n!
N {0, 1, 2, . . .}.
n=0
Otherwise, the series converges for |z| < 1 and also for |z| = 1 if Re(c a b) > 0.
X
1, 1
(1)n n+1 X (1)n (1)n (1)n z n+1
z
=
= z 2 F1
; z ,
ln(1 + z) =
n+1
(2)n
n!
2
n=0
n=0
X
(1)n 2n+1 X (1/2)n (1)n (1)n z 2n+1
1/2, 1
z
=
= z 2 F1
; z 2 ,
2n + 1
(3/2)n
n!
3/2
n=0
n=0
since
(1/2)n
=
(3/2)n
1
2
3
2
32 2n1
2
=
52 2n+1
2
1
2
2n+1
2
1
.
2n + 1
Note that the example ln(1 z) = z 2 F1 (1, 1; 2; z) shows that though the series converges
for |z| < 1, it has an analytic continuation as a single-valued function in the complex plane
except for the (half) line joining 1 to . This describes the general situation; a 2 F1 function
has an analytic continuation in the complex plane with branch points at 1 and .
a, b
a
(a)n n X a
; z = 1 F0
;z =
z =
(z)n = (1 z)a ,
2 F1
b
n!
n
n=0
n=0
|z| < 1
(2)
and
0 F0
;z
=
X
zn
n=0
n!
= ez ,
z C.
a
X
(a)n z n (b)n X (a)n z n
a, b z
= lim
n =
= 1 F1
lim 2 F1
;
;z
b
b
b
(c)n n! b
(c)n n!
c
c
n=0
n=0
and
lim 2 F1
a, b
; cz
c
= lim
X
(a)n (b)n z n
n=0
n!
X
cn
zn
=
(a)n (b)n
= 2 F0
(c)n
n!
n=0
a, b
;z .
(3)
for all z in the complex plane cut along the real axis from 1 to . Here it is understood that
arg t = arg(1 t) = 0 and (1 zt)a has its principal value.
Proof. First suppose that |z| < 1, then the binomial theorem (2) implies that
(1 zt)a =
X
(a)n
n=0
n!
z n tn .
X
(a)n n 1 n+b1
tb1 (1 t)cb1 (1 zt)a dt =
z
t
(1 t)cb1 dt.
n!
0
0
n=0
n = 0, 1, 2, . . .
to obtain
(c)
(b)(c b)
(c) X (n + b) (a)n n
z
(b)
(n + c) n!
n=0
X
a, b
(a)n (b)n z n
=
= 2 F1
;z ,
c
(c)n
n!
n=0
which proves the theorem for |z| < 1. Since the integral is analytic in the cut plane C \ (1, ),
the theorem holds in that region as well.
3
Eulers integral representation (3) can be used to prove Gausss summation formula:
Theorem 2. For Re(c a b) > 0 we have
a, b
(c)(c a b)
.
;1 =
2 F1
(c a)(c b)
c
(4)
n = 0, 1, 2, . . . .
c
for Re c > Re b > 0. This can be generalized to
a1 , a2 , . . . , ap , ap+1
;z
p+1 Fq+1
b1 , b2 , . . . , bq , bq+1
(bq+1 )
=
(ap+1 )(bq+1 ap+1 )
Z 1
a1 , a2 , . . . , ap
2 F1
a, b
;z
c
= (1 z)
2 F1
a, c b
z
;
z1
c
.
(5)
2 F1
a, b
;z
c
cab
= (1 z)
2 F1
c a, c b
;z .
c
(6)
z
z1
z
z1
Note that Eulers transformation formula can also be written in the form
X
a, b
c a, c b
(c a)n (c b)n z n
c+a+b
(1 z)
; z = 2 F1
;z =
.
2 F1
(c)n
n!
c
c
n=0
X
(c a b)j j X (a)k (b)k z k
a, b
c+a+b
(1 z)
;z
=
z
2 F1
c
j!
(c)k
k!
j=0
k=0
X
n
X
(a)k (b)k (c a b)nk
n=0 k=0
(c)k k! (n k)!
zn.
n = 0, 1, 2, . . . .
k=0
Note that
n!
= n(n 1) (n k + 1) = (1)k (n)(n + 1) (n + k 1) = (1)k (n)k
(n k)!
and
(c a b)nk =
=
(c a b)n
(c a b + n k)(c a b + n k + 1) (c a b + n 1)
(c a b)n
(1)k (1 + a + b c n)k
n = 0, 1, 2, . . . .
n, a, b
;1
c, 1 + a + b c n
=
(c a)n (c b)n
,
(c)n (c a b)n
n = 0, 1, 2, . . . .
(a + n)
.
(a)
=
=
(c a + n)(c b + n)(c)(c a b)
(c a)(c b)(c + n)(c a b + n)
(c)(c a b) (c a + n)(c b + n)
(c a)(c b) (c + n)(c a b + n)
for n .
(c a)n (c b)n
(c)(c a b)
=
.
(c)n (c a b)n
(c a)(c b)
Hence
2 F1
a, b
;1
c
n, a, b
= lim 3 F2
;1
n
c, 1 + a + b c n
(c)(c a b)
(c a)n (c b)n
=
.
= lim
n (c)n (c a b)n
(c a)(c b)
6