Gamma function

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For the gamma function of ordinals, see Veblen function.
The gamma function along part of the real axis

In mathematics, the gamma function (represented by the capital Greek letter Γ) is an extension of the factorial function, with its argument shifted down by 1, to real and complex numbers. That is, if n is a positive integer:

\Gamma(n) = (n-1)!

The gamma function is defined for all complex numbers except the negative integers and zero. For complex numbers with a positive real part, it is defined via a convergent improper integral:

 \Gamma(t) = \int_0^\infty  x^{t-1} e^{-x}\,dx.

This integral function is extended by analytic continuation to all complex numbers except the non-positive integers (where the function has simple poles), yielding the meromorphic function we call the gamma function.

The gamma function is a component in various probability-distribution functions, and as such it is applicable in the fields of probability and statistics, as well as combinatorics.

Motivation[edit]

It is easy graphically to interpolate the factorial function to non-integer values, but is there a formula that describes the resulting curve?

The gamma function can be seen as a solution to the following interpolation problem:

"Find a smooth curve that connects the points (xy) given by y = (x − 1)! at the positive integer values for x."

A plot of the first few factorials makes clear that such a curve can be drawn, but it would be preferable to have a formula that precisely describes the curve, in which the number of operations does not depend on the size of x. The simple formula for the factorial, n! = 1 × 2 × … × n, cannot be used directly for fractional values of x since it is only valid when x is a natural number (i.e., a positive integer). There are, relatively speaking, no such simple solutions for factorials; any combination of sums, products, powers, exponential functions, or logarithms with a fixed number of terms will not suffice to express x!. Stirling's approximation is asymptotically equal to the factorial function for large values of x. It is possible to find a general formula for factorials using tools such as integrals and limits from calculus. A good solution to this is the gamma function.

There are infinitely many continuous extensions of the factorial to non-integers: infinitely many curves can be drawn through any set of isolated points. The gamma function is the most useful solution in practice, being analytic (except at the non-positive integers), and it can be characterized in several ways. However, it is not the only analytic function which extends the factorial, as adding to it any analytic function which is zero on the positive integers will give another function with that property.

A more restrictive property than satisfying the above interpolation is to satisfy the recurrence relation defining a slightly translated version of the factorial function,

\begin{align}
f(1) & = 1 \ \text{, and} \\
f(x+1) &= x f(x),
\end{align}

for x equal to any positive real number. The Bohr–Mollerup theorem proves that these properties, together with the assumption that f be logarithmically convex (or "superconvex"[1]), uniquely determine f for positive, real inputs. From there, the gamma function can be extended to all real and complex values (except the negative integers and zero) by using the unique analytic continuation of f.

Definition[edit]

Main definition[edit]

The extended version of the gamma function in the complex plane

The notation Γ(t) is due to Legendre. If the real part of the complex number t is positive (Re(t) > 0), then the integral

 \Gamma(t) = \int_0^\infty  x^{t-1} e^{-x}\, dx.

converges absolutely, and is known as the Euler integral of the second kind (the Euler integral of the first kind defines the Beta function). Using integration by parts, we see that the gamma function satisfies the functional equation:

\Gamma(t+1)=t \Gamma(t).

Combining this with Γ(1) = 1, we get:

\Gamma(n) = 1 \cdot 2 \cdot 3 \cdots (n-1) = (n-1)!\,

for all positive integers n.

The identity Γ(t) = Γ(t+1)/t can be used (or, yielding the same result, analytic continuation can be used) to extend the integral formulation for Γ(t) to a meromorphic function defined for all complex numbers t, except t = −n for integers n ≥ 0, where the function has simple poles with residue (−1)n/n!.

It is this extended version that is commonly referred to as the gamma function.

Alternative definitions[edit]

The following infinite product definitions for the gamma function, due to Euler and Weierstrass respectively, are valid for all complex numbers t, except the non-positive integers:

\begin{align}
\Gamma(t) &= \lim_{n \to \infty} \frac{n! \; n^t}{t \; (t+1)\cdots(t+n)}
= \frac{1}{t} \prod_{n=1}^\infty \frac{\left(1+\frac{1}{n}\right)^t}{1+\frac{t}{n}} \\
\Gamma(t) &= \frac{e^{-\gamma t}}{t} \prod_{n=1}^\infty \left(1 + \frac{t}{n}\right)^{-1} e^{\frac{t}{n}}
\end{align}

where γ ≈ 0.577216... is the Euler–Mascheroni constant. It is straightforward to show that the Euler definition satisfies the functional equation (1) above.

A somewhat curious parametrization of the gamma function is given in terms of generalized Laguerre polynomials,

\Gamma(t)=x^t \sum_{n=0}^{\infty} \frac{L_n^{(t)}(x)}{t+n},

which converges for Re(t) < 1/2.


The gamma function in the complex plane[edit]

The absolute value of the gamma function on the complex plane.

The behavior of Γ(t) for an increasing positive variable is simple: it grows quickly — faster than an exponential function. Asymptotically as t → ∞, the magnitude of the gamma function is given by Stirling's formula

\Gamma(t+1)\sim\sqrt{2\pi t}\left(\frac{t}{e}\right)^{t},

where the symbol ~ means that the quotient of both sides converges to 1.

The behavior for nonpositive t is more intricate. Euler's integral does not converge for t ≤ 0, but the function it defines in the positive complex half-plane has a unique analytic continuation to the negative half-plane. One way to find that analytic continuation is to use Euler's integral for positive arguments and extend the domain to negative numbers by repeated application of the recurrence formula,

\Gamma(t)=\frac{\Gamma(t+n)}{t(t+1)\cdots(t+n-1)},

choosing n such that t + n is positive. The product in the denominator is zero when t equals any of the integers 0, −1, −2,... . Thus, the gamma function must be undefined at those points; it is a meromorphic function with simple poles at the nonpositive integers. The residues of the function at those points are:

\operatorname{Res}(\Gamma,-n)=\frac{(-1)^n}{n!}.

The gamma function is nonzero everywhere along the real line, although it comes arbitrarily close to zero as t → −∞. There is in fact no complex number t for which Γ(t) = 0, and hence the reciprocal gamma function 1/Γ is an entire function, with zeros at t = 0, −1, −2, ... The gamma function has a local minimum at x_{\mathrm{min}} \approx 1.46163 where it attains the value \Gamma(x_{\mathrm{min}}) \approx 0.885603 . The gamma function must alternate sign between the poles because the product in the forward recurrence contains an odd number of negative factors if the number of poles between t and t+n is odd, and an even number if the number of poles is even.

Properties[edit]

General[edit]

Other important functional equations for the gamma function are Euler's reflection formula

\Gamma(1-z) \Gamma(z) = {\pi \over \sin{(\pi z)}},

which implies

\Gamma(\varepsilon - n) = (-1)^{n-1} \; \frac{\Gamma(-\varepsilon) \Gamma(1+\varepsilon)}{\Gamma(n+1-\varepsilon)},

and the duplication formula

\Gamma(z) \Gamma\left(z + \tfrac{1}{2}\right) = 2^{1-2z} \; \sqrt{\pi} \; \Gamma(2z).

The duplication formula is a special case of the multiplication theorem

\prod_{k=0}^{m-1}\Gamma\left(z + \frac{k}{m}\right) = (2 \pi)^{\frac{m-1}{2}} \; m^{\frac{1}{2} - mz} \; \Gamma(mz).

A simple but useful property, which can be seen from the limit definition, is:

\overline{\Gamma(z)} = \Gamma(\overline{z}) \; \Rightarrow \; \Gamma(z)\Gamma(\overline{z}) \in \mathbf{R} .

Perhaps the best-known value of the gamma function at a non-integer argument is

\Gamma\left(\tfrac{1}{2}\right)=\sqrt{\pi},

which can be found by setting z = 1/2 in the reflection or duplication formulas, by using the relation to the beta function given below with x = y = 1/2, or simply by making the substitution u = √x in the integral definition of the gamma function, resulting in a Gaussian integral. In general, for non-negative integer values of n we have:

\begin{align}
\Gamma\left(\tfrac{1}{2}+n\right) &= {(2n)! \over 4^n n!} \sqrt{\pi} = \frac{(2n-1)!!}{2^n} \sqrt{\pi} = \sqrt{\pi} \left[ {n-\frac{1}{2}\choose n} n! \right] \\
\Gamma\left(\tfrac{1}{2}-n\right) &= {(-4)^n n! \over (2n)!} \sqrt{\pi} = \frac{(-2)^n}{(2n-1)!!} \sqrt{\pi} = \frac{\sqrt{\pi}}{{-\frac{1}{2} \choose n} n!} 
\end{align}

where n!! denotes the double factorial and, when n = 0, n!! = 1. See Particular values of the gamma function for calculated values.

It might be tempting to generalize the result that Γ(1/2) = √π by looking for a formula for other individual values Γ(r) where r is rational. However, these numbers are not known to be expressible by themselves in terms of elementary functions. It has been proved that Γ(n+r) is a transcendental number and algebraically independent of π for any integer n and each of the fractions r = 1/6, 1/4, 1/3, 2/3, 3/4, and 5/6.[2] In general, when computing values of the gamma function, we must settle for numerical approximations.

Another useful limit for asymptotic approximations is:

\lim_{n\to\infty} \frac{\Gamma(n+\alpha)}{\Gamma(n)n^{\alpha}} = 1, \qquad \alpha\in\mathbf{R}

The derivatives of the gamma function are described in terms of the polygamma function. For example:

\Gamma'(z)=\Gamma(z)\psi_0(z).

For positive integer m the derivative of gamma function can be calculated as follows (here γ is the Euler–Mascheroni constant):

\Gamma'(m+1) = m! \left(  - \gamma + \sum_{k=1}^m\frac{1}{k} \right)\,.

For Re(x) > 0 The n-th derivative of the gamma function is:

\frac{{\rm d}^n}{{\rm d}x^n}\,\Gamma(x) = \int_0^\infty t^{x-1} e^{-t} (\ln t)^{n} \,{\rm d}t.[3]

The gamma function has simple poles at z = −n = 0, −1, −2, −3, … The residue there is

\operatorname{Res}(\Gamma,-n)=\frac{(-1)^n}{n!}.

Moreover, the gamma function has the following Laurent expansion in 1

\Gamma(z) = 1+\sum_{k=1}^\infty\frac{\Gamma^{(k)}(1)}{k!}(z-1)^{k},

valid for |z − 1| < 1. In particular

\Gamma(z) = \frac1z-\gamma+\frac12\left(\gamma^2+\frac {\pi^2}6\right)z-\frac16\left(\gamma^3+\frac {\gamma\pi^2}2+2 \zeta(3)\right)z^2+O(z^3).

The Bohr–Mollerup theorem states that among all functions extending the factorial functions to the positive real numbers, only the gamma function is log-convex, that is, its natural logarithm is convex on the positive real axis.

In a certain sense, the log(Γ)-function is the more natural form; it makes some intrinsic attributes of the function clearer. A striking example is the Taylor series of log(Γ) in 1:

\ln \Gamma(z+1)= -\gamma z +\sum_{k=2}^\infty \frac{\zeta(k)}{k} \, (-z)^{k}\qquad \forall\; |z| < 1

with ζ(k) denoting the Riemann zeta function at k.

Fourier series expansion[edit]

The logarithm of the gamma function ("GammaLn") has the following Fourier series expansion

 
\ln\Gamma(x) = \left(\frac{1}{2}-x\right)(\gamma+\ln2)+(1-x)\ln\pi 
- \frac{1}{2}\ln\sin\pi x  + \frac{1}{\pi}\sum_{n=1}^{\infty}\frac{\sin 2\pi n x \cdot\ln{n}}{n}\,, \qquad 0<x<1,

which has been long-time attributed to Ernst Kummer who derived it in 1847.[4][5] However, it was comparatively recently that it was discovered by Iaroslav Blagouchine that this series was first derived by Carl Johan Malmsten in 1842.[6]

An approximation for GammaLn is given by Numerical Recipes in C (First Edition):

GammaLn(x) = ln(2.506628274631 * s) - z
where:
z = x + 4.5 - (x - 0.5) * ln(x + 4.5);
s = 1.00000000019001 + 76.1800917294715/z - 86.5053203294168/(z + 1) + 24.0140982408309/(z + 2) - 1.23173957245016/(z + 3) + 1.20865097386618E-03/(z + 4) - 5.395239384953E-06/(z + 5).

Raabe's formula[edit]

In 1840 Raabe proved that

\int\limits_a^{a+1}\log\Gamma(t)\, dt = \tfrac12\log2\pi + a\log a - a,\quad a\ge0.

In particular, if a=0 then

\int\limits_0^1\log\Gamma(t)\, dt = \tfrac12\log2\pi.

Pi function[edit]

An alternative notation which was originally introduced by Gauss and which was sometimes used is the Pi function, which in terms of the gamma function is

\Pi(z) = \Gamma(z+1) = z \Gamma(z)  = \int_0^\infty  e^{-t} t^z\, dt,

so that

\Pi(n) = n!,

for every non-negative integer n.

Using the Pi function the reflection formula takes on the form

\Pi(z)  \Pi(-z) = \frac{\pi z}{\sin( \pi z)} = \frac{1}{\operatorname{sinc}(z)}

where sinc is the normalized sinc function, while the multiplication theorem takes on the form

\Pi\left(\frac{z}{m}\right) \, \Pi\left(\frac{z-1}{m}\right) \cdots \Pi\left(\frac{z-m+1}{m}\right) = (2 \pi)^{\frac{m-1}{2}} m^{-z-\frac{1}{2}} \Pi(z).

We also sometimes find

\pi(z) = \frac{1}{\Pi(z)},

which is an entire function, defined for every complex number, just like the reciprocal gamma function. That π(z) is entire entails it has no poles, so Π(z), like Γ(z), has no zeros.

Somewhat interestingly, the Volume of an n-ellipsoid with radii r_1,\dotsc,r_n can be expressed as

V_n(r_1,\dotsc,r_n)=\frac{\pi^{\frac{n}{2}}}{\Pi\left(\frac{n}{2}\right)}\prod_{k=1}^{n}r_k

Relation to other functions[edit]

  • In the first integral above, which defines the gamma function, the limits of integration are fixed. The upper and lower incomplete gamma functions are the functions obtained by allowing the lower or upper (respectively) limit of integration to vary.
  • The gamma function is related to the Beta function by the formula
\Beta(x,y)=\frac{\Gamma(x) \; \Gamma(y)}{\Gamma(x+y)}.
\pi^{-\frac{z}{2}} \; \Gamma\left(\frac{z}{2}\right) \zeta(z) = \pi^{-\frac{1-z}{2}} \; \Gamma\left(\frac{1-z}{2}\right) \; \zeta(1-z).
And also in the following elegant formula:
\zeta(z) \; \Gamma(z) = \int_{0}^{\infty} \frac{u^{z}}{e^u - 1} \; \frac{du}{u},
which is valid only for Re(z) > 1.
The logarithm of the gamma function satisfies the following formula due to Lerch:
\log\Gamma(x) = \zeta_{H}'(0,x) - \zeta'(0),
where ζH is the Hurwitz zeta function, ζ is the Riemann zeta function and the prime (') denotes differentiation in the first variable.
\langle\tau^n\rangle \equiv \int_0^\infty dt\; t^{n-1}\, e^{ - \left( \frac{t}{\tau} \right)^\beta} = \frac{\tau^n}{\beta}\Gamma \left({n \over \beta }\right).

Particular values[edit]

Some particular values of the gamma function are:

\begin{alignat}{3}
\Gamma(-1) & = (-2)! && = \infty \\
\Gamma(0) & = (-1)! && = \infty \\
\Gamma(1) & = 0! && = 1 \\
\Gamma(2) & = 1! &&= 1 \\
\Gamma(3) & = 2! &&= 2 \\
\Gamma(4) & = 3! &&= 6 \\
\Gamma(-\tfrac{3}{2}) & = \tfrac{4}{3} \sqrt{\pi} &&\approx 2.363271801207 \\
\Gamma(-\tfrac{1}{2}) & = -2\sqrt{\pi} &&\approx -3.544907701811 \\
\Gamma(\tfrac{1}{2}) & = \sqrt{\pi} &&\approx 1.772453850905 \\
\Gamma(\tfrac{3}{2}) & = \tfrac{1}{2}\sqrt{\pi} &&\approx 0.88622692545 \\
\Gamma(\tfrac{5}{2}) & = \tfrac{3}{4}\sqrt{\pi} &&\approx 1.32934038818 \\
\Gamma(\tfrac{7}{2}) & = \tfrac{15}{8}\sqrt{\pi} &&\approx  3.32335097045
\end{alignat}

Approximations[edit]

Complex values of the gamma function can be computed numerically with arbitrary precision using Stirling's approximation or the Lanczos approximation.

The gamma function can be computed to fixed precision for Re(z) ∈ [1, 2] by applying integration by parts to Euler's integral. For any positive number x the gamma function can be written

\begin{align}
\Gamma(z) &= \int_0^x e^{-t} t^{z-1}\, \frac{dt}{t} + \int_x^\infty e^{-t} t^{z+1}\, \frac{dt}{t} \\
&= x^z e^{-x} \sum_{n=0}^\infty \frac{x^n}{z(z+1) \cdots (z+n)} + \int_x^\infty e^{-t} t^{z}\, \frac{dt}{t}.
\end{align}

When Re(z) ∈ [1, 2] and x ≥ 1, the absolute value of the last integral is smaller than (x + 1) e−x. By choosing a large enough x, this last expression can be made smaller than 2N for any desired value N. Thus, the gamma function can be evaluated to N bits of precision with the above series.

The only fast algorithm for calculation of the Euler gamma function for any algebraic argument (including rational) was constructed by E.A. Karatsuba,[7][8][9]

For arguments that are integer multiples of 1/24 the gamma function can also be evaluated quickly using arithmetic-geometric mean iterations (see particular values of the gamma function).

Because the Gamma and factorial functions grow so rapidly for moderately large arguments, many computing environments include a function that returns the natural logarithm of the gamma function (often given the name lngamma in programming environments or gammaln in spreadsheets); this grows much more slowly, and for combinatorial calculations allows adding and subtracting logs instead of multiplying and dividing very large values. The digamma function, which is the derivative of this function, is also commonly seen. In the context of technical and physical applications, e.g. with wave propagation, the functional equation

 \ln (\Gamma(z)) = \ln (\Gamma(z+1)) - \ln(z)

is often used since it allows one to determine function values in one strip of width 1 in z from the neighbouring strip. In particular, starting with a good approximation for a z with large real part one may go step by step down to the desired z. Following an indication of Carl Friedrich Gauss, Rocktaeschel (1922) proposed for ln(Γ(z)) an approximation for large Re(z):

 \ln (\Gamma(z)) \approx (z - \tfrac{1}{2}) \ln(z) - z + \tfrac{1}{2}\ln(2\pi).

This can be used to accurately approximate ln(Γ(z)) for z with a smaller Re(z) via (P.E.Böhmer, 1939)

 \ln(\Gamma(z-m)) = \ln(\Gamma(z)) - \sum_{k=1}^{m} \ln(z-k).

A more accurate approximation can be obtained by using more terms from the asymptotic expansions of ln(Γ(z)) and Γ(z), which are based on Stirling's approximation.

\Gamma(z)\sim z^{z - \frac{1}{2}} e^{-z} \sqrt{2\pi} \left( 1 + \frac{1}{12z} + \frac{1}{288z^2} - \frac{139}{51840 z^3} - \frac{571}{2488320 z^4}
        \right) \qquad \qquad \text{as }|z|\to\infty\text{ at constant}\quad |\arg(z)| < \pi

In a more "natural" presentation:

\ln \Gamma(z) \sim z \ln (z) - z - \tfrac{1}{2} \ln \left (\frac{z}{2\pi} \right ) + \frac{1}{12z} - \frac{1}{360z^3} +\frac{1}{1260 z^5}\qquad \qquad \text{as }|z|\to\infty\text{ at constant}\quad |\arg(z)| < \pi

The coefficients of the terms with k > 1 of zk+1 in the last expansion are simply

\frac{B_k}{k(k-1)}

where the Bk are the Bernoulli numbers.

Applications[edit]

Opening a random page in an advanced table of formulas, one may be as likely to spot the gamma function as a trigonometric function. One author describes the gamma function as "Arguably, the most common special function, or the least 'special' of them. The other transcendental functions listed below are called 'special' because you could conceivably avoid some of them by staying away from many specialized mathematical topics. On the other hand, the gamma function y = Γ(x) is most difficult to avoid."[10]

Integration problems[edit]

The gamma function finds application in such diverse areas as quantum physics, astrophysics and fluid dynamics.[11] The gamma distribution, which is formulated in terms of the gamma function, is used in statistics to model a wide range of processes; for example, the time between occurrences of earthquakes.[12]

The primary reason for the gamma function's usefulness in such contexts is the prevalence of expressions of the type f(t)\,e^{-g(t)} which describe processes that decay exponentially in time or space. Integrals of such expressions can occasionally be solved in terms of the gamma function when no elementary solution exists. For example, if f is a power function and g is a linear function, a simple change of variables gives the evaluation

\int_0^\infty t^b e^{-at} \,dt = \frac{\Gamma(b+1)}{a^{b+1}}.

The fact that the integration is performed along the entire positive real line might signify that the gamma function describes the cumulation of a time-dependent process that continues indefinitely, or the value might be the total of a distribution in an infinite space.

It is of course frequently useful to take limits of integration other than 0 and ∞ to describe the cumulation of a finite process, in which case the ordinary gamma function is no longer a solution; the solution is then called an incomplete gamma function. (The ordinary gamma function, obtained by integrating across the entire positive real line, is sometimes called the complete gamma function for contrast).

An important category of exponentially decaying functions is that of Gaussian functions

ae^{-\frac{(x-b)^2}{c^2}}

and integrals thereof, such as the error function. There are many interrelations between these functions and the gamma function; notably, the square root of π we obtained by evaluating Γ(1/2) is the "same" as that found in the normalizing factor of the error function and the normal distribution.

The integrals we have discussed so far involve transcendental functions, but the gamma function also arises from integrals of purely algebraic functions. In particular, the arc lengths of ellipses and of the lemniscate, which are curves defined by algebraic equations, are given by elliptic integrals that in special cases can be evaluated in terms of the gamma function. The gamma function can also be used to calculate "volume" and "area" of n-dimensional hyperspheres.

Another important special case is that of the beta function

\mathrm{\Beta}(x,y) = \int_0^1 t^{x-1}(1-t)^{y-1}\,dt = \frac{\Gamma(x)\,\Gamma(y)}{\Gamma(x+y)}.

Calculating products[edit]

The gamma function's ability to generalize factorial products immediately leads to applications in many areas of mathematics; in combinatorics, and by extension in areas such as probability theory and the calculation of power series. Many expressions involving products of successive integers can be written as some combination of factorials, the most important example perhaps being that of the binomial coefficient

{n \choose k} = \frac{n!}{k!(n-k)!}.

The example of binomial coefficients motivates why the properties of the gamma function when extended to negative numbers are natural. A binomial coefficient gives the number of ways to choose k elements from a set of n elements; if k > n, there are of course no ways. If k > n, (nk)! is the factorial of a negative integer and hence infinite if we use the gamma function definition of factorials — dividing by infinity gives the expected value of 0.

We can replace the factorial by a gamma function to extend any such formula to the complex numbers. Generally, this works for any product wherein each factor is a rational function of the index variable, by factoring the rational function into linear expressions. If P and Q are monic polynomials of degree m and n with respective roots p_1 \ldots p_m and q_1 \ldots q_n, we have

\prod_{i=a}^b \frac{P(i)}{Q(i)} = \left( \prod_{j=1}^m \frac{\Gamma(b-p_j+1)}{\Gamma(a-p_j)} \right) \left( \prod_{k=1}^n \frac{\Gamma(a-q_k)}{\Gamma(b-q_k+1)} \right).

If we have a way to calculate the gamma function numerically, it is a breeze to calculate numerical values of such products. The number of gamma functions in the right-hand side depends only on the degree of the polynomials, so it does not matter whether ba equals 5 or 105. Moreover, due to the poles of the gamma function, the equation also holds (in the sense of taking limits) when the left-hand product contain zeros or poles.

By taking limits, certain rational products with infinitely many factors can be evaluated in terms of the gamma function as well. Due to the Weierstrass factorization theorem, analytic functions can be written as infinite products, and these can sometimes be represented as finite products or quotients of the gamma function. We have already seen one striking example: the reflection formula essentially represents the sine function as the product of two gamma functions. Starting from this formula, the exponential function as well as all the trigonometric and hyperbolic functions can be expressed in terms of the gamma function.

More functions yet, including the hypergeometric function and special cases thereof, can be represented by means of complex contour integrals of products and quotients of the gamma function, called Mellin-Barnes integrals.

Analytic number theory[edit]

An elegant and deep application of the gamma function is in the study of the Riemann zeta function. A fundamental property of the Riemann zeta function is its functional equation:

\Gamma\left(\frac{s}{2}\right)\zeta(s)\pi^{-\frac{s}{2}} = \Gamma\left(\frac{1-s}{2}\right)\zeta(1-s)\pi^{-\frac{1-s}{2}}.

Among other things, this provides an explicit form for the analytic continuation of the zeta function to a meromorphic function in the complex plane and leads to an immediate proof that the zeta function has infinitely many so-called "trivial" zeros on the real line. Borwein et al. call this formula "one of the most beautiful findings in mathematics".[13] Another champion for that title might be

\zeta(s) \; \Gamma(s) = \int_0^\infty \frac{t^{s}}{e^t-1} \; \frac{dt}{t}.

Both formulas were derived by Bernhard Riemann in his seminal 1859 paper "Über die Anzahl der Primzahlen unter einer gegebenen Grösse" ("On the Number of Prime Numbers less than a Given Quantity"), one of the milestones in the development of analytic number theory — the branch of mathematics that studies prime numbers using the tools of mathematical analysis. Factorial numbers, considered as discrete objects, are an important concept in classical number theory because they contain many prime factors, but Riemann found a use for their continuous extension that arguably turned out to be even more important.

History[edit]

The gamma function has caught the interest of some of the most prominent mathematicians of all time. Its history, notably documented by Philip J. Davis in an article that won him the 1963 Chauvenet Prize, reflects many of the major developments within mathematics since the 18th century. In the words of Davis, "each generation has found something of interest to say about the gamma function. Perhaps the next generation will also."[14]

18th century: Euler and Stirling[edit]

Daniel Bernoulli's letter to Goldbach, 1729-10-06

The problem of extending the factorial to non-integer arguments was apparently first considered by Daniel Bernoulli and Christian Goldbach in the 1720s, and was solved at the end of the same decade by Leonhard Euler. Euler gave two different definitions: the first was not his integral but an infinite product,

n! = \prod_{k=1}^\infty \frac{\left(1+\frac{1}{k}\right)^n}{1+\frac{n}{k}}\,,

of which he informed Goldbach in a letter dated October 13, 1729. He wrote to Goldbach again on January 8, 1730, to announce his discovery of the integral representation

n!=\int_{0}^{1}(-\ln s)^{n}\, ds\,,

which is valid for n > 0. By the change of variables t = −ln s, this becomes the familiar Euler integral. Euler published his results in the paper "De progressionibus transcendentibus seu quarum termini generales algebraice dari nequeunt" ("On transcendental progressions, that is, those whose general terms cannot be given algebraically"), submitted to the St. Petersburg Academy on November 28, 1729.[15] Euler further discovered some of the gamma function's important functional properties, including the reflection formula.

James Stirling, a contemporary of Euler, also attempted to find a continuous expression for the factorial and came up with what is now known as Stirling's formula. Although Stirling's formula gives a good estimate of n!, also for non-integers, it does not provide the exact value. Extensions of his formula that correct the error were given by Stirling himself and by Jacques Philippe Marie Binet.

19th century: Gauss, Weierstrass and Legendre[edit]

DE PROGRESSIONIBVS TRANSCENDENTIBVS, SEV QVARUM TERMINI GENERALES ALGEBRAICAE DARI NEQVEVNT
The first page of Euler's paper

Carl Friedrich Gauss rewrote Euler's product as

\Gamma(z) = \lim_{m\to\infty}\frac{m^{z}m!}{z(z+1)(z+2)\cdots(z+m)}

and used this formula to discover new properties of the gamma function. Although Euler was a pioneer in the theory of complex variables, he does not appear to have considered the factorial of a complex number, as instead Gauss first did.[16] Gauss also proved the multiplication theorem of the gamma function and investigated the connection between the gamma function and elliptic integrals.

Karl Weierstrass further established the role of the gamma function in complex analysis, starting from yet another product representation,

\Gamma(z) = \frac{e^{-\gamma z}}{z} \prod_{k=1}^\infty \left(1 + \frac{z}{k}\right)^{-1} e^{\frac{z}{k}},

where γ is the Euler–Mascheroni constant. Weierstrass originally wrote his product as one for 1/Γ, in which case it is taken over the function's zeros rather than its poles. Inspired by this result, he proved what is known as the Weierstrass factorization theorem—that any entire function can be written as a product over its zeros in the complex plane; a generalization of the fundamental theorem of algebra.

The name gamma function and the symbol Γ were introduced by Adrien-Marie Legendre around 1811; Legendre also rewrote Euler's integral definition in its modern form. Although the symbol is an upper-case Greek gamma, there is no accepted standard for whether the function name should be written "gamma function" or "Gamma function" (some authors simply write "Γ-function"). The alternative "Pi function" notation Π(z) = z! due to Gauss is sometimes encountered in older literature, but Legendre's notation is dominant in modern works.

It is justified to ask why we distinguish between the "ordinary factorial" and the gamma function by using distinct symbols, and particularly why the gamma function should be normalized to Γ(n+1) = n! instead of simply using "Γ(n) = n!". Consider that the notation for exponents, xn, has been generalized from integers to complex numbers xz without any change. Legendre's motivation for the normalization does not appear to be known, and has been criticized as cumbersome by some (the 20th-century mathematician Cornelius Lanczos, for example, called it "void of any rationality" and would instead use z!).[17] Legendre's normalization does simplify a few formulas, but complicates most others. From a modern point of view, the Legendre normalization of the Gamma function is the integral of the additive character e−x against the multiplicative character xz with respect to the Haar measure dx/x on the Lie group R+. Thus this normalization makes it clearer that the Gamma function is a continuous analogue of a Gauss sum.

19th-20th centuries: characterizing the gamma function[edit]

It is somewhat problematic that a large number of definitions have been given for the gamma function. Although they describe the same function, it is not entirely straightforward to prove the equivalence. Stirling never proved that his extended formula corresponds exactly to Euler's gamma function; a proof was first given by Charles Hermite in 1900.[18] Instead of finding a specialized proof for each formula, it would be desirable to have a general method of identifying the gamma function.

One way to prove would be to find a differential equation that characterizes the gamma function. Most special functions in applied mathematics arise as solutions to differential equations, whose solutions are unique. However, the gamma function does not appear to satisfy any simple differential equation. Otto Hölder proved in 1887 that the gamma function at least does not satisfy any algebraic differential equation by showing that a solution to such an equation could not satisfy the gamma function's recurrence formula. This result is known as Hölder's theorem.

A definite and generally applicable characterization of the gamma function was not given until 1922. Harald Bohr and Johannes Mollerup then proved what is known as the Bohr–Mollerup theorem: that the gamma function is the unique solution to the factorial recurrence relation that is positive and logarithmically convex for positive z and whose value at 1 is 1 (a function is logarithmically convex if its logarithm is convex).

The Bohr–Mollerup theorem is useful because it is relatively easy to prove logarithmic convexity for any of the different formulas used to define the gamma function. Taking things further, instead of defining the gamma function by any particular formula, we can choose the conditions of the Bohr–Mollerup theorem as the definition, and then pick any formula we like that satisfies the conditions as a starting point for studying the gamma function. This approach was used by the Bourbaki group.

Reference tables and software[edit]

Although the gamma function can be calculated virtually as easily as any mathematically simpler function with a modern computer—even with a programmable pocket calculator—this was of course not always the case. Until the mid-20th century, mathematicians relied on hand-made tables; in the case of the gamma function, notably a table computed by Gauss in 1813 and one computed by Legendre in 1825.

A hand-drawn graph of the absolute value of the complex gamma function, from Tables of Higher Functions by Jahnke and Emde.

Tables of complex values of the gamma function, as well as hand-drawn graphs, were given in Tables of Higher Functions by Jahnke and Emde, first published in Germany in 1909. According to Michael Berry, "the publication in J&E of a three-dimensional graph showing the poles of the gamma function in the complex plane acquired an almost iconic status."[19]

There was in fact little practical need for anything but real values of the gamma function until the 1930s, when applications for the complex gamma function were discovered in theoretical physics. As electronic computers became available for the production of tables in the 1950s, several extensive tables for the complex gamma function were published to meet the demand, including a table accurate to 12 decimal places from the U.S. National Bureau of Standards.[14]

Abramowitz and Stegun became the standard reference for this and many other special functions after its publication in 1964.

Double-precision floating-point implementations of the gamma function and its logarithm are now available in most scientific computing software and special functions libraries, for example TK Solver, Matlab, GNU Octave, and the GNU Scientific Library. The gamma function was also added to the C standard library (math.h). Arbitrary-precision implementations are available in most computer algebra systems, such as Mathematica and Maple. PARI/GP, MPFR and MPFUN contain free arbitrary-precision implementations.

See also[edit]

Notes[edit]

  1. ^ Kingman, J.F.C. 1961. A convexity property of positive matrices. Quart. J. Math. Oxford (2) 12,283-284.
  2. ^ Waldschmidt, M. (2006). "Transcendence of Periods: The State of the Art". Pure and Applied Mathematics Quarterly, Volume 2, Number 2, 435—463 (PDF copy published by the author)
  3. ^ This can be derived by differentiating the integral form of the gamma function with respect to x, and using the technique of differentiation under the integral sign.
  4. ^ Harry Bateman and Arthur Erdélyi Higher Transcendental Functions [in 3 volumes]. Mc Graw-Hill Book Company, 1955.
  5. ^ H.M. Srivastava and J. Choi Series Associated with the Zeta and Related Functions. Kluwer Academic Publishers. The Netherlands, 2001
  6. ^ Iaroslav V. Blagouchine Rediscovery of Malmsten’s integrals, their evaluation by contour integration methods and some related results. The Ramanujan Journal, 2013.
  7. ^ E.A. Karatsuba, Fast evaluation of transcendental functions. Probl. Inf. Transm. Vol.27, No.4, pp.339-360 (1991).
  8. ^ E.A. Karatsuba, On a new method for fast evaluation of transcendental functions. Russ. Math. Surv. Vol.46, No.2, pp.246-247 (1991).
  9. ^ E.A. Karatsuba "Fast Algorithms and the FEE Method".
  10. ^ Michon, G. P. "Trigonometry and Basic Functions". Numericana. Retrieved May 5, 2007.
  11. ^ Chaudry, M. A. & Zubair, S. M. (2001). On A Class of Incomplete Gamma Functions with Applications. p. 37
  12. ^ Rice, J. A. (1995). Mathematical Statistics and Data Analysis (Second Edition). p. 52–53
  13. ^ Borwein, J., Bailey, D. H. & Girgensohn, R. (2003). Experimentation in Mathematics. A. K. Peters. p. 133. ISBN 1-56881-136-5. 
  14. ^ a b Davis, P. J. (1959). "Leonhard Euler's Integral: A Historical Profile of the Gamma Function", The American Mathematical Monthly, Vol. 66, No. 10 (Dec., 1959), pp. 849–869 [1]
  15. ^ Euler's paper was published in Commentarii academiae scientiarum Petropolitanae 5, 1738, 36–57. See E19 -- De progressionibus transcendentibus seu quarum termini generales algebraice dari nequeunt, from The Euler Archive, which includes a scanned copy of the original article. An English translation by S. Langton is also available.
  16. ^ Remmert, R., Kay, L. D. (translator) (2006). Classical Topics in Complex Function Theory. Springer. ISBN 0-387-98221-3. 
  17. ^ Lanczos, C. (1964). "A precision approximation of the gamma function." J. SIAM Numer. Anal. Ser. B, Vol. 1.
  18. ^ Knuth, D. E. (1997). The Art of Computer Programming, volume 1 (Fundamental Algorithms). Addison-Wesley. 
  19. ^ Berry, M. "Why are special functions special?". Physics Today, April 2001

References[edit]

External links[edit]