Special functions
Two special functions with very different personalities. The hypergeometric function \(F(a, b, c, z)\) is a "master function": with the right parameters it becomes the logarithm, the arcsine, a binomial power, Legendre polynomials and many more. The zeta function \(\zeta(z)\) looks like a simple series of reciprocal powers, yet it encodes the distribution of the prime numbers and hides the most famous open problem in mathematics. This post introduces both, with the key formulas explained and checked.
With the Pochhammer symbol (rising factorial) \( (a)_n = a(a + 1)\cdots(a + n - 1) \), \( (a)_0 = 1 \), the series is compactly
\[ F(a, b, c, z) = \sum_{n=0}^\infty\frac{(a)_n(b)_n}{(c)_n}\,\frac{z^n}{n!}. \](It is often written \({}_2F_1(a, b; c; z)\): two parameters "upstairs", one "downstairs".) We need \(c \ne 0, -1, -2, \dots\), otherwise a denominator vanishes.
Why the name and the radius of convergence. The ratio of consecutive terms is a rational function of \(n\):
\[ \frac{t_{n+1}}{t_n} = \frac{(a + n)(b + n)}{(c + n)(n + 1)}\,z \ \longrightarrow\ z \quad (n \to \infty). \]This is the defining property of a hypergeometric series (it generalizes the geometric series, whose ratio is constant: \(a = 1\), \(b = c\) gives exactly \(1 + z + z^2 + \cdots\)). By the ratio test, the radius of convergence is \(1\). If \(a\) or \(b\) is a negative integer, the series stops and \(F\) is a polynomial.
| Parameters | Function |
|---|---|
| \( F(1, b, b, z) \) | \( \frac{1}{1 - z} = 1 + z + z^2 + \cdots \) |
| \( F(a, b, b, z) \) | \( (1 - z)^{-a} \) (binomial series) |
| \( zF(1, 1, 2, z) \) | \( -\ln(1 - z) \) |
| \( zF(\frac12, \frac12, \frac32, z^2) \) | \( \arcsin z \) |
| \( zF(\frac12, 1, \frac32, -z^2) \) | \( \arctan z \) |
| \( F(-n, n + 1, 1, \frac{1 - z}{2}) \) | Legendre polynomial \(P_n(z)\) |
The value at \(z = 1\) has a closed form, Gauss's summation theorem (for \( \operatorname{Re}(c - a - b) > 0 \)):
\[ F(a, b, c, 1) = \frac{\Gamma(c)\,\Gamma(c - a - b)}{\Gamma(c - a)\,\Gamma(c - b)}. \]Why. Expand \( (1 - tz)^{-a} = \sum_n\frac{(a)_n}{n!}t^nz^n \) and integrate term by term. Each term gives a Beta integral:
\[ \int_0^1 t^{b + n - 1}(1 - t)^{c - b - 1}\,dt = \mathrm B(b + n, c - b) = \frac{\Gamma(b + n)\Gamma(c - b)}{\Gamma(c + n)}. \]Since \( \frac{\Gamma(b + n)}{\Gamma(b)} = (b)_n \) and \( \frac{\Gamma(c + n)}{\Gamma(c)} = (c)_n \), the prefactor turns this into \( \frac{(b)_n}{(c)_n} \), and the series of Section 1 appears. (Numerical check at \(a = 0.3\), \(b = 0.5\), \(c = 1.7\), \(z = 0.4\): both sides equal \(1.04181\).)
The integral is useful for more than computing: its right-hand side makes sense for all \(z\) off the ray \([1, \infty)\), so it provides the analytic continuation of \(F\) to \(|z| > 1\) mentioned in 1°. Putting \(z = 1\) and using the Beta function gives Gauss's summation theorem directly.
Why: substitute \( y = \sum t_nz^n \) and collect the coefficient of \(z^n\). The equation requires
\[ (n + 1)(n + c)\,t_{n+1} = (n + a)(n + b)\,t_n, \]which is exactly the ratio of consecutive coefficients computed in Section 1. In other words, the differential equation and the series encode the same recurrence.
The equation is a linear second-order ODE with three singular points, \(z = 0, 1, \infty\). Every such equation (with "regular" singular points) can be transformed into this one, which is why so many functions of physics (Legendre, Chebyshev, Jacobi polynomials, elliptic integrals) are hypergeometric. A second, independent solution near \(0\) is \( z^{1-c}F(a - c + 1, b - c + 1, 2 - c, z) \) (for \(c\) not an integer).
Here \( n^z = e^{z\ln n} \) and \( |n^{-z}| = n^{-\operatorname{Re}z} \), so the series converges absolutely for \( \operatorname{Re}z > 1 \) by comparison with the real \(p\)-series. At \(z = 1\) it is the harmonic series, which diverges: \(\zeta\) has a simple pole at \(z = 1\) with residue \(1\). The continuation to the rest of the plane is a single-valued meromorphic function whose only pole is \(z = 1\).
(The book writes the sum with index \(k\) but the term \(\frac{1}{n^z}\); the index is the same letter throughout.)
The functional equation relates values at \(z\) and \(1 - z\), symmetric about the line \( \operatorname{Re}z = \frac12 \). It is what carries \(\zeta\) from the half-plane \( \operatorname{Re}z > 1 \), where the series converges, to \( \operatorname{Re}z < 0 \). Consequences:
Why: expand \( \frac{1}{e^t - 1} = \sum_{n\ge1}e^{-nt} \) and use \( \int_0^\infty t^{z-1}e^{-nt}\,dt = \frac{\Gamma(z)}{n^z} \) (substitute \(nt = s\) in Euler's integral). Summing over \(n\) gives \( \Gamma(z)\zeta(z) \).
The integral with \(e^t - 1\) appears in physics as Planck's law: the total energy radiated by a black body involves \( \int_0^\infty\frac{t^3}{e^t - 1}dt = \Gamma(4)\zeta(4) = 6\cdot\frac{\pi^4}{90} = \frac{\pi^4}{15} \).
Why: each factor is a geometric series, \( \frac{1}{1 - p^{-z}} = 1 + \frac{1}{p^z} + \frac{1}{p^{2z}} + \cdots \). Multiplying these series for all primes produces every product \( \frac{1}{(p_1^{k_1}p_2^{k_2}\cdots)^z} \), and by the fundamental theorem of arithmetic every natural number \(n\) arises exactly once as such a prime factorization. So the product equals \( \sum\frac{1}{n^z} \). The Euler product is the bridge between analysis and number theory.
The Euler product shows that \(\zeta(z) \ne 0\) for \( \operatorname{Re}z > 1 \) (a convergent product of nonzero factors), and the functional equation then gives no zeros for \( \operatorname{Re}z < 0 \) except the trivial ones. All other zeros, the nontrivial zeros, lie in the critical strip \( 0 \le \operatorname{Re}z \le 1 \). The first one is at \( \frac12 + 14.1347\,i \).
Billions of zeros have been computed, all on the line, but no proof is known. Through the Euler product, the location of the zeros controls how regularly the prime numbers are distributed; the hypothesis is equivalent to the best possible error term in the prime number theorem. It is one of the Clay Millennium Prize Problems.
| Formula | Meaning |
|---|---|
| \( F(a, b, c, z) = \sum\frac{(a)_n(b)_n}{(c)_n}\frac{z^n}{n!} \) | hypergeometric series, \(|z| < 1\) |
| \( F = \frac{\Gamma(c)}{\Gamma(b)\Gamma(c - b)}\int_0^1 t^{b-1}(1 - t)^{c-b-1}(1 - tz)^{-a}dt \) | Euler's integral, \(\operatorname{Re}c > \operatorname{Re}b > 0\) |
| \( z(1 - z)y'' + [c - (a + b + 1)z]y' - aby = 0 \) | Gauss's equation |
| \( \zeta(z) = \sum n^{-z} \), \(\operatorname{Re}z > 1\) | zeta function; pole at \(1\) |
| \( \zeta(1 - z) = 2^{1-z}\pi^{-z}\cos\frac{\pi z}{2}\Gamma(z)\zeta(z) \) | functional equation |
| \( \zeta(z) = \frac{1}{\Gamma(z)}\int_0^\infty\frac{t^{z-1}}{e^t - 1}dt \) | integral, \(\operatorname{Re}z > 1\) |
| \( \zeta(2k) = \frac{2^{2k-1}\pi^{2k}B_k}{(2k)!} \) | Euler's even values |
| \( \frac{1}{\zeta(z)} = \prod_p(1 - p^{-z}) \) | Euler product, \(\operatorname{Re}z > 1\) |
Try each one before opening the solution. More solved problems from this topic are in Series.
The factors \((b)_n\) cancel: \( F = \sum\frac{(a)_n}{n!}z^n \), which is the binomial series of \( (1 - z)^{-a} \), since \( \binom{-a}{n}(-1)^n = \frac{(a)_n}{n!} \).
The \(n = 1\) term: \( \frac{\frac12\cdot\frac12}{\frac32}z^2 = \frac{z^2}{6} \), so \( zF = z + \frac{z^3}{6} + \cdots \), which matches \( \arcsin z = z + \frac{z^3}{6} + \frac{3z^5}{40} + \cdots \).
\( \frac{\Gamma(2)\Gamma(1 + n)}{\Gamma(2 + n)\Gamma(1)} = \frac{n!}{(n + 1)!} = \frac{1}{n + 1} \).
\( \zeta(4) = \frac{\pi^4}{90} \). The alternating sum is \( (1 - 2^{1-2})\zeta(2) = \frac12\cdot\frac{\pi^2}{6} = \frac{\pi^2}{12} \).
\( \Gamma(2)\zeta(2) = \frac{\pi^2}{6} \).
\(z = 4\): \( \zeta(-3) = 2^{-3}\pi^{-4}\cos(2\pi)\,\Gamma(4)\,\zeta(4) = \frac18\cdot\frac{1}{\pi^4}\cdot 6\cdot\frac{\pi^4}{90} = \frac{6}{720} = \frac{1}{120} \).
The hypergeometric function is the most "generic" special function: a series whose coefficient ratio is a rational function of \(n\), equivalently the solution of Gauss's equation with three singular points. With the right parameters it becomes almost every elementary and classical function, and its integral representation, built from the Beta function, continues it beyond the unit disk. The zeta function starts as a simple series but leads very far: a functional equation linking \(z\) and \(1 - z\), exact values at even integers involving \(\pi\) and Bernoulli numbers, and the Euler product, which ties it to the prime numbers and to the Riemann hypothesis.
Related posts: the Gamma and Beta functions in the complex plane, infinite products, power series, and Fourier series.