# Gamma function

The **gamma function** is a mathematical function that extends the domain of factorials to non-integers. The factorial of a positive integer *n*, written *n*!, is the product 1·2·3···*n*. The gamma function, denoted by Γ, is defined to satisfy Γ(*n*) = (*n* − 1)! for all positive integers *n* and to smoothly interpolate the factorial between the integers. The gamma function is one of the most commonly occurring examples of a nonelementary function; that is, a function that cannot be expressed in finite terms using algebraic operations, exponentials, and logarithms. Its study dates back to Leonhard Euler, who gave a formula for its calculation in 1729.

## Contents |

## [edit] Motivation

The gamma function can be seen as a solution to the following interpolation problem: find a smooth curve that connects the points given by at the positive integers. A plot of the first few factorials makes clear that such a curve can be drawn (for example by hand), but it would be preferable to have a formula that precisely describes the curve. The formula for the factorial *n*! cannot be used directly for fractional values of *n* since the number of factors depends on *n* and only is valid when *n* is an integer. The solution would have to be a closed-form expression, in which the number of operations does not depend on the size of *n*.

There is a quite analogous problem for which the solution is simple. A famous anecdote goes that Carl Friedrich Gauss, as a child, found that the sum 1 + 2 + ... + *n* can be calculated as *n*(*n* + 1) / 2 and that he thereby was able to quickly sum all the integers between 1 and 100, to the astonishment of his teacher. The formula *y* = *x*(*x* + 1) / 2 is of course valid for fractional values of *x* and describes the simple shape known as a parabola.

The analogy is that simply changing the "+" sign in 1 + 2 + ... + *n* to a "" gives the factorial interpolation problem; however, Gauss's closed-form solution to the one problem cannot be translated to the other. There is in fact no such simple solution for factorials. Any combination of sums, products, powers, exponential functions or logarithms with a fixed number of terms will not suffice to express *n*!: with more precise terminology, the factorial is not an elementary function. But it is possible to find a general formula for factorials with some more work, by deploying tools such as integrals and limits from calculus. It is this non-elementary solution that is called the gamma function.

It must be noted that there are actually infinitely many extensions of the factorial to non-integers (each of them non-elementary): infinitely many curves can be drawn through any set of isolated points. The gamma function is distinguished by uncontestedly being the most useful solution in practice. The question of the gamma function's uniqueness will be discussed in more detail later on; we will first give the exact definition of the gamma function and state its fundamental properties.

## [edit] Basic properties of the gamma function

### [edit] Euler's integral definition

The gamma function is commonly defined by a definite integral due to Leonhard Euler,

where *t*^{z − 1} is interpreted as *e*^{(z − 1)logt} if *z* is not an integer.^{[1]} Using standard theorems from mathematical analysis, it can be shown that Euler's integral defines Γ to be a continuous function if *z* is positive. In fact, Euler's integral is valid for any complex number *z* with a positive real part and defines the gamma function to be an analytic function in the positive complex half-plane.^{[2]}

To see that the gamma function corresponds to the factorial at integers, we can insert *z* + 1 instead of *z* and perform an integration by parts to obtain

This relation is called the *recurrence formula* or *recurrence relation* of the gamma function. The equation *f*(*z* + 1) = *z**f*(*z*) is an example of a functional equation — an equation to be solved for the function *f* for all values of *z*. It is analogous to the recurrence satisfied by factorials, *n*! = *n*(*n* − 1)!, the only difference being that the function argument has been shifted by 1. A repeated application of the gamma function's recurrence formula gives

which together with the initial value establishes that

for positive integers *n*. We can of course equivalently write Γ(*n* + 1) = *n*!. We may use these formulas to explicitly calculate Γ(*n*) or, conversely, to define *z*! for non-integers in terms of the gamma function.

### [edit] Real and complex numbers

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

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

The behavior for nonpositive *z* is more intricate. Euler's integral does not converge for *z* ≤ 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,

choosing *n* such that *z* + *n* is positive. The product in the denominator is zero when *z* equals any of the integers 0, −1, −2,... . Thus, the gamma function must be undefined at those points due to division by zero; it is a meromorphic function with poles at the nonpositive integers. The following image shows the graph of the gamma function along the real line:

The gamma function is nonzero everywhere along the real line, although it comes arbitrarily close as . There is in fact no complex number *z* for which Γ(*z*) = 0, and hence the *reciprocal gamma function* 1 / Γ is an entire function, with zeros at *z* = 0, −1, −2,.... We see that the gamma function has a local minimum at where it attains the value . 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 *z* and *z* + *n* is odd, and an even number if the number of poles is even.

Plotting the gamma function in the complex plane yields beautiful graphs:

### [edit] Reflection and rational arguments

The recurrence relation is not the only functional equation satisfied by the gamma function. Another important property is the *reflection formula*

which gives a concise relation between the gamma function of positive and negative numbers. The division by a sine, which is periodically zero, again indicates the existence of the gamma function's periodically occurring poles. Further, inserting *z* = 1/2 reveals the surprising fact that

Hence, by the recurrence formula, the gamma function or factorial of any half-integer is a rational multiple of .

There are many cases in which products or quotients of the gamma function can be evaluated. For example, it follows from the recurrence relation that Γ(*r* + *n*) / Γ(*r*) is a rational function of *r* whenever *n* is an integer, and a rational number whenever *r* is rational.^{[3]} A third functional equation is the *multiplication theorem*

of which the *duplication formula*

is a special case.

From the multiplicative properties of the gamma function, it is possible to derive exotic-looking results such as

It might be tempting to generalize the result that 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.^{[4]} In general, when computing values of the gamma function, we must settle for numerical approximations.

### [edit] Numerical methods

It is easy to approximate the gamma function given a known approximation that holds on some interval of unit width, say for ; the value anywhere else can then be computed via the recurrence and reflection formulas, using only a few multiplications or an evaluation of the sine in the reflection formula. Listings of polynomials and rational functions that approximate the gamma function in a unit interval are available in various reference works.^{[5]}

For large arguments, say | *z* | > 10, it is best to use an asymptotic expansion; the most popular is *Stirling's series*

This is Stirling's formula multiplied by a series that corrects the error. The series coefficients can be calculated in terms of Bernoulli numbers. The "∼" sign denotes an asymptotic equality: the series diverges for every *z*, but yields arbitrarily accurate approximations of the gamma function as if the series is truncated at the smallest term. We can use Stirling's series to calculate the gamma function for small numbers as well, using the recurrence relation. Taking *n* = 10 and calculating Γ(*z*) from Γ(*z* + *n*), using the three first terms in Stirling's series, we obtain Γ(1) ≈ 1.000003 and Γ(2) ≈ 1.000002; this particular approximation is good to five decimal places on the interval . With larger *n* and more terms, Stirling's series permits calculating the gamma function with arbitrary precision.

Other practical methods for high-precision calculation include the Lanczos approximation and Spouge's approximation, which are both similar in form to Stirling's series but have different convergence characteristics.

It should be noted that it may be convenient to work with the logarithm of the gamma function instead of the gamma function itself, since the raw gamma function grows quickly and can cause overflow in computer arithmetic. It is common to encounter a quotient of two large gamma function values, which is most safely computed by subtracting two logarithms. Stirling's, Lanczos's and Spouge's approximations can all be calculated directly in logarithmic form.

## [edit] Applications

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."^{[6]}

### [edit] Integration problems

The gamma function finds application in such diverse areas as quantum physics, astrophysics and fluid dynamics.^{[7]} 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.^{[8]}

The primary reason for the gamma function's usefulness in such contexts is the prevalence of expressions of the type 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

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 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

### [edit] Calculating products

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

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*, (*n* − *k*)! 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 and , we have

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 *b* − *a* equals 5 or 10^{5}. 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.

### [edit] Analytic number theory

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:

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".^{[9]} Another champion for that title might be

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.

## [edit] History

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."^{[10]}

### [edit] 18th century: Euler and Stirling

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,

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

which is valid for *n* > 0. By the change of variables *t* = − log*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.^{[11]} 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.

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

Carl Friedrich Gauss rewrote Euler's product as

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.^{[12]} 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,

where is Euler's 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*!". 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*!^{[13]}). The normalization does simplify some formulas, but complicates others.

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

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.^{[14]} 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.

### [edit] Reference tables and software

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.

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."^{[15]}

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.^{[10]}

Like for many other special functions, *Abramowitz and Stegun* became the standard reference 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 Matlab, GNU Octave, and the GNU Scientific Library. The gamma function was also added to the C mathematics library (math.h) as part of the C99 standard, but is not implemented by all C compilers. 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.

## [edit] Notes and references

- ↑ Everywhere in this article, "log" denotes the natural logarithm.
- ↑ In the remainder of this article, "positive" will be understood to mean either a positive real number or a complex number with positive real part.
- ↑ Assuming that no poles are encountered
- ↑ 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) - ↑ For instance,
*Abramowitz & Stegun*, page 257 - ↑ Michon, G. P. "Trigonometry and Basic Functions".
*Numericana*. Retrieved May 5, 2007. - ↑ Chaudry, M. A. & Zubair, S. M. (2001).
*On A Class of Incomplete Gamma Functions with Applications*. p. 37 - ↑ Rice, J. A. (1995).
*Mathematical Statistics and Data Analysis*(Second Edition). p. 52–53 - ↑ Borwein, J., Bailey, D. H. & Girgensohn, R. (2003).
*Experimentation in Mathematics*. A. K. Peters, 133. ISBN 1-56881-136-5. - ↑
^{10.0}^{10.1}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 - ↑ 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. - ↑ Remmert, R., Kay, L. D. (translator) (2006).
*Classical Topics in Complex Function Theory*. Springer. ISBN 0387982213. - ↑ Lanczos, C. (1964). "A precision approximation of the gamma function." J. SIAM Numer. Anal. Ser. B, Vol. 1.
- ↑ Knuth, D. E. (1997).
*The Art of Computer Programming, volume 1 (Fundamental Algorithms)*. Addison-Wesley. - ↑ Berry, M. "Why are special functions special?".
*Physics Today*, April 2001

Some content on this page may previously have appeared on Citizendium. |