Gamma function

Uses your system voice; voice and rate in settings.

Snapshot

≈ 42 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the gamma function, denoted by (capital Greek letter gamma), is the most common extension of the factorial function to complex numbers. First studied by Daniel Bernoulli, the gamma function is defined for all complex numbers z except non-positive integers, and satisfies \Gamma(n) = (n-1)! for every positive integer .

The gamma function can be defined via a convergent improper integral for complex numbers with positive real part: \Gamma(z) = \int_0^\infty t^{z-1} e^{-t} \, dt, \ \qquad \Re(z) > 0. The gamma function then is defined in the complex plane as the analytic continuation of this integral function: it is a meromorphic function which is holomorphic except at zero and the negative integers, where it has simple poles.

Since the gamma function has no zeros, its reciprocal 1/\Gamma is an entire function. In fact, the gamma function corresponds to the Mellin transform of exponential decay: \Gamma(z) = \mathcal M \{e^{-x} \} (z). Other extensions of the factorial function do exist, but the gamma function is the most popular and useful.

It appears as a factor in various probability-distribution functions and other formulas in the fields of probability, statistics, analytic number theory, and combinatorics.

In mathematics, the gamma function, denoted by (capital Greek letter gamma), is the most common extension of the factorial function to complex numbers. First studied by Daniel Bernoulli, the gamma function is defined for all complex numbers z except non-positive integers, and satisfies \Gamma(n) = (n-1)! for every positive integer .

The gamma function can be defined via a convergent improper integral for complex numbers with positive real part: \Gamma(z) = \int_0^\infty t^{z-1} e^{-t} \, dt, \ \qquad \Re(z) > 0. The gamma function then is defined in the complex plane as the analytic continuation of this integral function: it is a meromorphic function which is holomorphic except at zero and the negative integers, where it has simple poles.

Since the gamma function has no zeros, its reciprocal 1/\Gamma is an entire function. In fact, the gamma function corresponds to the Mellin transform of exponential decay: \Gamma(z) = \mathcal M \{e^{-x} \} (z). Other extensions of the factorial function do exist, but the gamma function is the most popular and useful.

It appears as a factor in various probability-distribution functions and other formulas in the fields of probability, statistics, analytic number theory, and combinatorics. The gamma function can be seen as a solution to the interpolation problem of finding a smooth curve y=f(x) that connects the points of the factorial sequence: (x,y) = (n, n!) for all positive integer values of .

The simple formula for the factorial, x! = 1 \cdot 2 \cdot 3 \cdots x is only valid when x is a positive integer, and no elementary function has this property, but a good solution is the gamma function . The gamma function is not only smooth but analytic (except at the non-positive integers), and it can be defined in several explicit ways.

However, it is not the only analytic function that extends the factorial, as one may add any analytic function that is zero on the positive integers, such as k\sin(m\pi x) for an integer . Such a function is known as a pseudogamma function, the most famous being the Hadamard function.

A more restrictive requirement is the functional equation that interpolates the shifted factorial : f(x+1) = x f(x)\ \text{ for all } x>0, \qquad f(1) = 1. But this still does not give a unique solution, since it allows for multiplication by any periodic function g(x) with g(x) = g(x+1) and , such as for any integer .

One way to resolve the ambiguity is the Bohr–Mollerup theorem, which shows that f(x) = \Gamma(x) is the unique interpolating function for the factorial, defined over the positive reals, which is logarithmically convex, meaning that y = \log f(x) is convex. \Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\, dt converges absolutely, and is known as the Euler integral of the second kind. (Euler's integral of the first kind is the beta function. ) The relationship to the factorial can be shown by induction.

The value \Gamma(1) can be calculated as \begin{align} \Gamma(1) & = \int_0^\infty t^{1-1} e^{-t}\,dt \\[6pt] & = \int_0^\infty e^{-t} \, dt = 1. \end{align} Integrating by parts, one sees that \begin{align} \Gamma(z+1) & = \int_0^\infty t^{z} e^{-t} \, dt \\[6pt] &= \Bigl[-t^z e^{-t}\Bigr]_0^\infty + \int_0^\infty z \, t^{z-1} e^{-t}\, dt. \end{align} Recognizing that -t^z e^{-t}\to 0 when either (if ) or , \begin{align} \Gamma(z+1) & = z\int_0^\infty t^{z-1} e^{-t}\, dt \\[6pt] &= z\, \Gamma(z). \end{align} Thus we have shown that \Gamma(n) = (n-1)! for any positive integer by induction. The identity z \Gamma(z) = \Gamma(z + 1) can be used (or, yielding the same result, analytic continuation can be used) to uniquely extend the integral formulation for \Gamma (z) to a meromorphic function defined for all complex numbers , except integers less than or equal to zero.

It is this extended version that is commonly referred to as the gamma function. \lim_{n \to \infty} \frac{n! \, \left(n+1\right)^m}{(n+m)!} = 1\,. If m is not an integer then this equation is meaningless since, in this section, the factorial of a non-integer has not been defined yet.

However, in order to define the Gamma function for non-integers, let us assume that this equation continues to hold when m is replaced by an arbitrary complex number : \lim_{n \to \infty} \frac{n! \, \left(n+1\right)^z}{(n+z)!} = 1\,. Multiplying both sides by (z-1)! gives \begin{align} (z-1)! &= \frac{1}{z} \lim_{n \to \infty} n!\frac{z!}{(n+z)!} (n+1)^z \\[6pt] &= \frac{1}{z} \lim_{n \to \infty} (1 \cdot2\cdots n)\frac{1}{(1+z) \cdots (n+z)} \left(\frac{2}{1} \cdot \frac{3}{2} \cdots \frac{n+1}{n}\right)^z \\[6pt] &= \frac{1}{z} \prod_{n=1}^\infty \left[ \frac{1}{1+\frac{z}{n}} \left(1 + \frac{1}{n}\right)^z \right]. \end{align} This infinite product, which is due to Euler, converges for all complex numbers z except the non-positive integers, which fail because of a division by zero.

In fact, the above assumption produces a unique definition of \Gamma(z) as . Intuitively, this formula indicates that \Gamma(z) is approximately the result of computing \Gamma(n+1)=n! for some large integer , multiplying by (n+1)^z to approximate , and then using the relationship \Gamma(x+1) = x \Gamma(x) backwards n+1 times to get an approximation for , and furthermore that this approximation becomes exact as increases to infinity.

The infinite product for the reciprocal \frac{1}{\Gamma(z)} = z \prod_{n=1}^\infty \left[ \left(1+\frac{z}{n}\right) / {\left(1 + \frac{1}{n}\right)^z} \right] is an entire function, converging for every complex number . \Gamma(z) = \frac{e^{-\gamma z}} z \prod_{n=1}^\infty \left(1 + \frac{z}{n} \right)^{-1} e^{z/n}, where \gamma \approx 0.577216 is the Euler–Mascheroni constant. This is the Hadamard product of \textstyle \frac{1}{\Gamma(z)} in a rewritten form.

Equivalence of the integral definition and Weierstrass definition By the integral definition, the relation \Gamma (z+1)=z\Gamma (z) and Hadamard factorization theorem, \frac{1}{\Gamma (z)}=ze^{c_1 z+c_2}\prod_{n=1}^\infty e^{-\frac{z}{n}}\left(1+\frac{z}{n}\right) for some constants , since 1/\Gamma is an entire function of order . Since z\Gamma (z)\to 1 as , c_2=0 (or an integer multiple of ) and since , \begin{align}e^{-c_1} &=\prod_{n=1}^\infty e^{-\frac{1}{n}}\left(1+\frac{1}{n}\right)\\ &=\exp\left(\lim_{N\to\infty}\sum_{n=1}^N \left(\log\left(1+\frac{1}{n}\right)-\frac{1}{n}\right)\right)\\ &=\exp\left(\lim_{N\to\infty}\left(\log (N+1)-\sum_{n=1}^N \frac{1}{n}\right)\right).\end{align} where c_1=\gamma+2\pi i k for some integer .

Since \Gamma (z)\in\mathbb{R} for , we have k=0 and \frac{1}{\Gamma (z)}=ze^{\gamma z}\prod_{n=1}^\infty e^{-\frac{z}{n}}\left(1+\frac{z}{n}\right) Equivalence of the Weierstrass definition and Euler definition \begin{align}\Gamma (z)&=\frac{e^{-\gamma z}}{z}\prod_{n=1}^{\infty}\left(1+\frac{z}{n}\right)^{-1}e^{z/n}\\ &=\frac1z\lim_{n\to\infty}e^{z\left(\log (n+1)-1-\frac{1}{2}-\frac{1}{3}-\cdots-\frac{1}{n}\right)}\frac{e^{z\left(1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{n}\right)}}{\left(1+z\right)\left(1+\frac{z}{2}\right)\cdots\left(1+\frac{z}{n}\right)}\\ &=\frac1z\lim_{n\to\infty}\frac{1}{\left(1+z\right)\left(1+\frac{z}{2}\right)\cdots\left(1+\frac{z}{n}\right)}e^{z\log\left(n+1\right)}\\ &=\lim_{n\to\infty}\frac{n!(n+1)^z}{z(z+1)\cdots (z+n)},\quad z\in\mathbb{C}\setminus\mathbb{Z}_0^-\end{align} \Gamma(z+1) = z\ \Gamma(z). Other important functional equations for the gamma function are Euler's reflection formula, \Gamma(1-z) \Gamma(z) = \frac{\pi}{\sin \pi z}, \qquad z \not\in \Z , which implies \Gamma(z - n) = (-1)^{n-1} \; \frac{\Gamma(-z) \Gamma(1+z)}{\Gamma(n+1-z)}, \qquad n \in \Z and the Legendre duplication formula \Gamma(z) \Gamma\left(z + \frac12\right) = 2^{1-2z} \, \sqrt{\pi} \, \Gamma(2z). Proof 1 With Euler's infinite product \Gamma(z) = \frac1z \prod_{n=1}^{\infty} \frac{(1+1/n)^z}{1 + z/n} compute \frac{1}{\Gamma(1-z)\Gamma(z)} = \frac{1}{(-z)\Gamma(-z)\Gamma(z)} = z \prod_{n=1}^{\infty} \frac{(1-z/n)(1+z/n)}{(1+1/n)^{-z}(1+1/n)^{z}} = z \prod_{n=1}^{\infty} \left(1 - \frac{z^2}{n^2}\right) = \frac{\sin \pi z}{\pi}\,, where the last equality is a known result. A similar derivation begins with Weierstrass's definition.

Proof 2 First prove that I=\int_{-\infty}^\infty \frac{e^{ax}}{1+e^x}\, dx=\int_0^\infty \frac{v^{a-1}}{1+v}\, dv=\frac{\pi}{\sin\pi a},\quad a\in (0,1). Consider the positively oriented rectangular contour C_R with vertices at , , R+2\pi i and -R+2\pi i where . Then by the residue theorem, \int_{C_R}\frac{e^{az}}{1+e^z}\, dz=-2\pi ie^{a\pi i}.

Let I_R=\int_{-R}^R \frac{e^{ax}}{1+e^x}\, dx and let I_R' be the analogous integral over the top side of the rectangle. Then I_R\to I as R\to\infty and .

If A_R denotes the right vertical side of the rectangle, then \left|\int_{A_R} \frac{e^{az}}{1+e^z}\, dz\right|\le \int_0^{2\pi}\left|\frac{e^{a(R+it)}}{1+e^{R+it}}\right|\, dt\le Ce^{(a-1)R} for some constant C and since , the integral tends to 0 as . Analogously, the integral over the left vertical side of the rectangle tends to 0 as .

Therefore I-e^{2\pi ia}I=-2\pi ie^{a\pi i}, from which I=\frac{\pi}{\sin \pi a},\quad a\in (0,1). Then \Gamma (1-z)=\int_0^\infty e^{-u}u^{-z}\, du=t\int_0^\infty e^{-vt}(vt)^{-z}\, dv,\quad t>0 and \begin{align}\Gamma (z)\Gamma (1-z)&=\int_0^\infty\int_0^\infty e^{-t(1+v)}v^{-z}\, dv\, dt\\ &=\int_0^\infty \frac{v^{-z}}{1+v}\, dv\\&=\frac{\pi}{\sin \pi (1-z)}\\&=\frac{\pi}{\sin \pi z},\quad z\in (0,1).\end{align} Proving the reflection formula for all z\in (0,1) proves it for all z\in\mathbb{C}\setminus\mathbb{Z} by analytic continuation.

The beta function can be represented as \Beta (z_1,z_2)=\frac{\Gamma (z_1)\Gamma (z_2)}{\Gamma (z_1+z_2)}=\int_0^1 t^{z_1-1}(1-t)^{z_2-1} \, dt. Setting z_1=z_2=z yields \frac{\Gamma^2(z)}{\Gamma (2z)}=\int_0^1 t^{z-1}(1-t)^{z-1} \, dt. After the substitution : \frac{\Gamma^2(z)}{\Gamma (2z)}=\frac{1}{2^{2z-1}}\int_{-1}^1 \left(1-u^{2}\right)^{z-1} \, du.

The function (1-u^2)^{z-1} is even, hence 2^{2z-1}\Gamma^2(z)=2\Gamma (2z)\int_0^1 (1-u^2)^{z-1} \, du. Now \Beta \left(\frac{1}{2},z\right)=\int_0^1 t^{\frac{1}{2}-1}(1-t)^{z-1} \, dt, \quad t=s^2. Then \Beta \left(\frac{1}{2},z\right)=2\int_0^1 (1-s^2)^{z-1} \, ds = 2\int_0^1 (1-u^2)^{z-1} \, du.

This implies 2^{2z-1}\Gamma^2(z)=\Gamma (2z)\Beta \left(\frac{1}{2},z\right). Since \Beta \left(\frac{1}{2},z\right)=\frac{\Gamma \left(\frac{1}{2}\right)\Gamma (z)}{\Gamma \left(z+\frac{1}{2}\right)}, \quad \Gamma \left(\frac{1}{2}\right)=\sqrt{\pi}, the Legendre duplication formula follows: \Gamma (z)\Gamma \left(z+\frac{1}{2}\right)=2^{1-2z}\sqrt{\pi} \; \Gamma (2z). The duplication formula is a special case of the multiplication theorem (see  Eq.

5.5.6): \prod_{k=0}^{m-1}\Gamma\left(z + \frac{k}{m}\right) = (2 \pi)^{\frac{m-1}{2}} \; m^{\frac12 - 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 \mathbb{R} .

In particular, with , this product is |\Gamma(a+bi)|^2 = |\Gamma(a)|^2 \prod_{k=0}^\infty \frac{1}{1+\frac{b^2}{(a+k)^2}} If the real part is an integer or a half-integer, this can be finitely expressed in closed form: \begin{align} |\Gamma(bi)|^2 & = \frac{\pi}{b\sinh \pi b} \\[6pt] \left|\Gamma\left(\tfrac{1}{2}+bi\right)\right|^2 & = \frac{\pi}{\cosh \pi b} \\[6pt] \left|\Gamma\left(1+bi\right)\right|^2 & = \frac{\pi b}{\sinh \pi b} \\[6pt] \left|\Gamma\left(1+n+bi\right)\right|^2 & = \frac{\pi b}{\sinh \pi b} \prod_{k=1}^n \left(k^2 + b^2 \right), \quad n \in \N \\[6pt] \left|\Gamma\left(-n+bi\right)\right|^2 & = \frac{\pi}{b \sinh \pi b} \prod_{k=1}^n \left(k^2 + b^2 \right)^{-1}, \quad n \in \N \\[6pt] \left|\Gamma\left(\tfrac{1}{2} \pm n+bi\right)\right|^2 & = \frac{\pi}{\cosh \pi b} \prod_{k=1}^n \left(\left( k-\tfrac{1}{2}\right)^2 + b^2 \right)^{\pm 1}, \quad n \in \N \\[-1ex]& \end{align} First, consider the reflection formula applied to . \Gamma(bi)\Gamma(1-bi)=\frac{\pi}{\sin \pi bi} Applying the recurrence relation to the second term: -bi \cdot \Gamma(bi)\Gamma(-bi)=\frac{\pi}{\sin \pi bi} which with simple rearrangement gives \Gamma(bi)\Gamma(-bi)=\frac{\pi}{-bi\sin \pi bi}=\frac{\pi}{b\sinh \pi b} Second, consider the reflection formula applied to . \Gamma(\tfrac{1}{2}+bi)\Gamma\left(1-(\tfrac{1}{2}+bi)\right)=\Gamma(\tfrac{1}{2}+bi)\Gamma(\tfrac{1}{2}-bi)=\frac{\pi}{\sin \pi (\tfrac{1}{2}+bi)}=\frac{\pi}{\cos \pi bi}=\frac{\pi}{\cosh \pi b} Formulas for other values of z for which the real part is integer or half-integer quickly follow by induction using the recurrence relation in the positive and negative directions. Perhaps the best-known value of the gamma function at a non-integer argument is \Gamma\left(\tfrac12\right)=\sqrt{\pi}, which can be found by setting z = \frac{1}{2} in the reflection formula, by using the relation to the beta function given below with , or simply by making the substitution t = u^2 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(\frac 1 2 + n\right) &= {(2n)! \over 4^n n!} \sqrt{\pi} = \frac{(2n-1)!!}{2^n} \sqrt{\pi} = \binom{n-\frac{1}{2}}{n} \, n! \, \sqrt{\pi} \\[6pt] \Gamma\left(\frac 1 2 - n\right) &= {(-4)^n n! \over (2n)!} \sqrt{\pi} = \frac{(-2)^n}{(2n-1)!!} \sqrt{\pi} = \frac{\sqrt{\pi}}{\binom{-1/2}{n} \, n!} \end{align} where the double factorial . See Particular values of the gamma function for calculated values.

It might be tempting to generalize the result that \Gamma \left( \frac{1}{2} \right) = \sqrt\pi by looking for a formula for other individual values \Gamma(r) where r is rational, especially because according to Gauss's digamma theorem, it is possible to do so for the closely related digamma function at every rational value. However, these numbers \Gamma(r) are not known to be expressible by themselves in terms of elementary functions.

It has been proved that \Gamma (n + r) is a transcendental number and algebraically independent of \pi for any integer n and each of the fractions . In general, when computing values of the gamma function, we must settle for numerical approximations.

The derivatives of the gamma function are described in terms of the polygamma function, : \Gamma'(z)=\Gamma(z)\psi^{(0)}(z). For a positive integer m the derivative of the gamma function can be calculated as follows: \Gamma'(m+1) = m! \left( - \gamma + \sum_{k=1}^m\frac{1}{k} \right)= m! \left( - \gamma + H(m) \right)\,, where H(m) is the th harmonic number and \gamma is the Euler–Mascheroni constant. For \Re(z) > 0 the th derivative of the gamma function is: \frac{d^n}{dz^n}\Gamma(z) = \int_0^\infty t^{z-1} e^{-t} (\log t)^n \, dt.

(This can be derived by differentiating the integral form of the gamma function with respect to .) Using the identity \Gamma^{(n)}(1)=(-1)^n B_n(\gamma, 1! \zeta(2), \ldots, (n-1)! \, \zeta(n)), where \zeta(z) is the Riemann zeta function, and B_n is the th Bell polynomial, we have in particular the Laurent series expansion of the gamma function \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). \Gamma(tx_1 + (1 - t)x_2) \le \Gamma(x_1)^t\Gamma(x_2)^{1 - t}.

For any two positive real numbers x_1 and , and x_2 > x_1 \left(\frac{\Gamma(x_2)}{\Gamma(x_1)}\right)^{\frac{1}{x_2 - x_1}} > \exp\left(\frac{\Gamma'(x_1)}{\Gamma(x_1)}\right). For any positive real number , \Gamma(x) \Gamma(x) > \Gamma'(x)^2.

The last of these statements is, essentially by definition, the same as the statement that , where \psi^{(1)} is the polygamma function of order 1. To prove the logarithmic convexity of the gamma function, it therefore suffices to observe that \psi^{(1)} has a series representation which, for positive real , consists of only positive terms.

Logarithmic convexity and Jensen's inequality together imply, for any positive real numbers and , \Gamma\left(\frac{a_1x_1 + \cdots + a_nx_n}{a_1 + \cdots + a_n}\right) \le \bigl(\Gamma(x_1)^{a_1} \cdots \Gamma(x_n)^{a_n}\bigr)^{\frac{1}{a_1 + \cdots + a_n}}. There are also bounds on ratios of gamma functions.

The best-known is Gautschi's inequality, which says that for any positive real number and any , x^{1 - s} \Gamma(x+1)\sim\sqrt{2\pi x}\left(\frac{x}{e}\right)^x, where the symbol \sim means asymptotic convergence: the ratio of the two sides converges to in the limit . This growth is faster than exponential, , for any fixed value of .

Another useful limit for asymptotic approximations for x \to + \infty is: {\Gamma(x+\alpha)}\sim{\Gamma(x)x^\alpha}, \qquad \alpha \in \C . When writing the error term as an infinite product, Stirling's formula can be used to define the gamma function: \Gamma(x) = \sqrt{\frac{2\pi}{x}} \left(\frac{x}{e}\right)^x \prod_{n=0}^{\infty} \left[\frac{1}{e}\left(1+\frac{1}{x+n}\right)^{x+n+\frac{1}{2}} \right] . \Gamma(-x) = \frac{1}{\Gamma(x+1)}\frac{\pi}{\sin\big(\pi(x+1)\big)}, or the fundamental property, \Gamma(-x):=\frac{\, 1}{-x}\,\Gamma(-x+1) , when . For example, \Gamma\!\left(\!-\frac12\right)=-2\,\Gamma\!\left(\frac12\right) . \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n)}, choosing n such that z + n is positive.

The product in the denominator is zero when z equals any of the integers . Thus, the gamma function must be undefined at those points to avoid division by zero; it is a meromorphic function with simple poles at the non-positive integers.

For a function f of a complex variable , at a simple pole , the residue of f is given by: \operatorname{Res}(f,c)=\lim_{z\to c}(z-c)f(z). For the simple pole , the recurrence formula can be rewritten as: (z+n) \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n-1)}. The numerator at , is \Gamma(z+n+1) = \Gamma(1) = 1 and the denominator z(z+1)\cdots(z+n-1) = -n(1-n)\cdots(n-1-n) = (-1)^n n!. So the residues of the gamma function at those points are: \operatorname{Res}(\Gamma,-n)=\frac{(-1)^n}{n!}.

The gamma function is non-zero everywhere along the real line, although it comes arbitrarily close to zero as . There is in fact no complex number z for which , and hence the reciprocal gamma function \dfrac {1}{\Gamma (z)} is an entire function, with zeros at . \Gamma (z)=\int_{-\infty}^\infty e^{zt-e^t}\, dt and \Gamma(z) = \int_0^1 \left(\log \frac{1}{t}\right)^{z-1}\,dt, \Gamma(z) = 2c^z\int_{0}^{\infty}t^{2z-1}e^{-ct^{2}}\,dt \,,\; c>0 where the three integrals respectively follow from the substitutions , t=-\log x and t=cx^2 in Euler's second integral.

The last integral in particular makes clear the connection between the gamma function at half integer arguments and the Gaussian integral: if z=1/2,\; c=1 we get \Gamma(1/2)=2\int_{0}^{\infty}e^{-t^{2}}\,dt=\sqrt{\pi} \;. Binet's first integral formula for the gamma function states that, when the real part of is positive, then: \operatorname{log\Gamma}(z) = \left(z - \frac{1}{2}\right)\log z - z + \frac{1}{2}\log (2\pi) + \int_0^\infty \left(\frac{1}{2} - \frac{1}{t} + \frac{1}{e^t - 1}\right)\frac{e^{-tz}}{t}\,dt.

The integral on the right-hand side may be interpreted as a Laplace transform. That is, \log\left(\Gamma(z)\left(\frac{e}{z}\right)^z\sqrt{\frac{z}{2\pi}}\right) = \mathcal{L}\left(\frac{1}{2t} - \frac{1}{t^2} + \frac{1}{t(e^t - 1)}\right)(z). Binet's second integral formula states that, again when the real part of is positive, then: \operatorname{log\Gamma}(z) = \left(z - \frac{1}{2}\right)\log z - z + \frac{1}{2}\log(2\pi) + 2\int_0^\infty \frac{\arctan(t/z)}{e^{2\pi t} - 1}\,dt.

Let be a Hankel contour, meaning a path that begins and ends at the point on the Riemann sphere, whose unit tangent vector converges to at the start of the path and to at the end, which has winding number 1 around , and which does not cross . Fix a branch of \log(-t) by taking a branch cut along [0, \infty) and by taking \log(-t) to be real when t is on the negative real axis.

If z is not an integer, then Hankel's formula for the gamma function is: \Gamma(z) = -\frac{1}{2i\sin \pi z}\int_C (-t)^{z-1}e^{-t}\,dt, where (-t)^{z-1} is interpreted as . The reflection formula leads to the closely related expression \frac{1}{\Gamma(z)} = \frac{i}{2\pi}\int_C (-t)^{-z}e^{-t}\,dt, which is valid whenever . \begin{aligned} \Gamma (z) &= \cfrac{e^{-1}}{ 2 + 0 - z + 1\cfrac{z-1}{ 2 + 2 - z + 2\cfrac{z-2}{ 2 + 4 - z + 3\cfrac{z-3}{ 2 + 6 - z + 4\cfrac{z-4}{ 2 + 8 - z + 5\cfrac{z-5}{ 2 + 10 - z + \ddots } } } } } } \\ &+\ \cfrac{e^{-1}}{ z + 0 - \cfrac{z+0}{ z + 1 + \cfrac{1}{ z + 2 - \cfrac{z+1}{ z + 3 + \cfrac{2}{ z + 4 - \cfrac{z+2}{ z + 5 + \cfrac{3}{ z + 6 - \ddots } } } } } } } \end{aligned} where . \operatorname{log\Gamma}(z) = \left(\frac{1}{2} - z\right)(\gamma + \log 2) + (1 - z)\log\pi - \frac{1}{2}\log\sin(\pi z) + \frac{1}{\pi}\sum_{n=1}^\infty \frac{\log n}{n} \sin (2\pi n z), which was for a long time attributed to Ernst Kummer, who derived it in 1847.

However, Iaroslav Blagouchine discovered that Carl Johan Malmsten first derived this series in 1842. \int_a^{a+1}\log\Gamma(z)\, dz = \tfrac12\log2\pi + a\log a - a,\quad a>0. In particular, if a = 0 then \int_0^1\log\Gamma(z)\, dz = \frac{1}{2} \log (2\pi).

The latter can be derived taking the logarithm in the above multiplication formula, which gives an expression for the Riemann sum of the integrand. Taking the limit for a \to \infty gives the formula. \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 .

Using the pi function, the reflection formula is: \Pi(z) \Pi(-z) = \frac{\pi z}{\sin( \pi z)} = \frac{1}{\operatorname{sinc}(z)} using the normalized sinc function; while the multiplication theorem becomes: \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-\frac12} \Pi(z)\ . The shifted reciprocal gamma function is sometimes denoted , an entire function.

The volume of an -ellipsoid with radii 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. \Gamma(z,x) = \int_x^\infty t^{z-1} e^{-t} dt. There is a similar lower incomplete gamma function.

The gamma function is related to Euler's beta function by the formula \Beta(z_1,z_2) = \int_0^1 t^{z_1-1}(1-t)^{z_2-1}\,dt = \frac{\Gamma(z_1)\,\Gamma(z_2)}{\Gamma(z_1+z_2)}. The logarithmic derivative of the gamma function is called the digamma function; higher derivatives are the polygamma functions.

The analog of the gamma function over a finite field or a finite ring is the Gaussian sums, a type of exponential sum. The reciprocal gamma function is an entire function and has been studied as a specific topic.

The gamma function also shows up in an important relation with the Riemann zeta function, . \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). It also appears in the following formula: \zeta(z) \Gamma(z) = \int_0^\infty \frac{u^{z}}{e^u - 1} \, \frac{du}{u}, which is valid only for . The logarithm of the gamma function satisfies the following formula due to Lerch: \operatorname{log\Gamma}(z) = \zeta_H'(0,z) - \zeta'(0), where \zeta_H is the Hurwitz zeta function, \zeta is the Riemann zeta function and the prime ( ) denotes differentiation in the first variable.

The gamma function is related to the stretched exponential function. For instance, the moments of that function are \langle\tau^n\rangle \equiv \int_0^\infty t^{n-1}\, e^{ - \left( \frac{t}{\tau} \right)^\beta} \, \mathrm{d}t = \frac{\tau^n}{\beta}\Gamma \left({n \over \beta }\right). \begin{array}{rcccl} \Gamma\left(-\frac{3}{2}\right) &=& \frac{4\sqrt{\pi}}{3} &\approx& +2.36327\,18012\,07354\,70306 \\[6pt] \Gamma\left(-\frac{1}{2}\right) &=& -2\sqrt{\pi} &\approx& -3.54490\,77018\,11032\,05459 \\[6pt] \Gamma\left(\frac{1}{2}\right) &=& \sqrt{\pi} &\approx& +1.77245\,38509\,05516\,02729 \\[6pt] \Gamma(1) &=& 0! &=& +1 \\[6pt] \Gamma\left(\frac{3}{2}\right) &=& \frac{\sqrt{\pi}}{2} &\approx& +0.88622\,69254\,52758\,01364 \\[6pt] \Gamma(2) &=& 1! &=& +1 \\[6pt] \Gamma\left(\frac{5}{2}\right) &=& \frac{3\sqrt{\pi}}{4} &\approx& +1.32934\,03881\,79137\,02047 \\[6pt] \Gamma(3) &=& 2! &=& +2 \\[6pt] \Gamma\left(\frac{7}{2}\right) &=& \tfrac{15\sqrt{\pi}}{8} &\approx& +3.32335\,09704\,47842\,55118 \\[6pt] \Gamma(4) &=& 3! &=& +6 \end{array} (These numbers can be found in the OEIS.

The values presented here are truncated rather than rounded.) The complex-valued gamma function is undefined for non-positive integers, but in these cases the value can be defined in the Riemann sphere as .

The reciprocal gamma function is well defined and analytic at these values (and in the entire complex plane): \frac{1}{\Gamma(-3)} = \frac{1}{\Gamma(-2)} = \frac{1}{\Gamma(-1)} = \frac{1}{\Gamma(0)} = 0. \operatorname{log\Gamma}(z) = - \gamma z - \log z + \sum_{k = 1}^\infty \left[ \frac z k - \log \left( 1 + \frac z k \right) \right]. 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 \operatorname{log\Gamma}(z) = \operatorname{log\Gamma}(z+1) - \log 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 .

Following an indication of Carl Friedrich Gauss, Rocktaeschel (1922) proposed for \log \Gamma (z) an approximation for large : \operatorname{log\Gamma}(z) \approx (z - \tfrac{1}{2}) \log z - z + \tfrac{1}{2}\log(2\pi). This can be used to accurately approximate \log \Gamma (z) for z with a smaller \Re (z) via (P.E.Böhmer, 1939) \operatorname{log\Gamma}(z-m) = \operatorname{log\Gamma}(z) - \sum_{k=1}^m \log(z-k). A more accurate approximation can be obtained by using more terms from the asymptotic expansions of \log \Gamma (z) and , which are based on Stirling's approximation. \Gamma(z)\sim z^{z - \frac12} e^{-z} \sqrt{2\pi} \left( 1 + \frac{1}{12z} + \frac{1}{288z^2} - \frac{139}{51\,840 z^3} - \frac{571}{2\,488\,320 z^4} \right) as |z| \rightarrow \infty at constant .

(See sequences and in the OEIS.) In a more "natural" presentation, \log \Gamma(z) = z \log z - z - \frac{1}{2} \log z + \frac{1}{2} \log 2\pi + \frac{1}{12z} - \frac{1}{360z^3} +\frac{1}{1260 z^5} + O\left(\frac1{z^5}\right) as |z| \rightarrow \infty at constant . (See sequences and in the OEIS.)

The coefficients of the terms with k > 1 of z^{1-k} in the last expansion are simply \frac{B_k}{k(k-1)}, where the B_k are the Bernoulli numbers. The gamma function also has Stirling Series (derived by Charles Hermite in 1900) equal to \operatorname{log\Gamma}(1+x)=\frac{x(x-1)}{2!} \log(2)+\frac{x(x-1)(x-2)}{3!} (\log(3)-2\log(2))+\cdots,\quad\Re (x)> 0. \Gamma(z+1) = z \Gamma(z) for all complex numbers z except the non-positive integers, and, for integer , \lim_{n \to \infty} \frac{\Gamma(n+z)}{\Gamma(n)\;n^z} = 1 for all complex numbers .

In a certain sense, the log-gamma function is the more natural form; it makes some intrinsic attributes of the function clearer. A striking example is the Taylor series of around 1: \operatorname{log\Gamma}(z+1)= -\gamma z +\sum_{k=2}^\infty \frac{\zeta(k)}{k} \, (-z)^k \qquad \forall\; |z| with denoting the Riemann zeta function at .

So, using the following property: \zeta(s) \Gamma(s) = \int_0^\infty \frac{t^s}{e^t-1} \, \frac{dt}{t} an integral representation for the log-gamma function is: \operatorname{log\Gamma}(z+1)= -\gamma z + \int_0^\infty \frac{e^{-zt} - 1 + z t}{t \left(e^t - 1\right)} \, dt or, setting to obtain an integral for , we can replace the term with its integral and incorporate that into the above formula, to get: \operatorname{log\Gamma}(z+1)= \int_0^\infty \frac{e^{-zt} - ze^{-t} - 1 + z}{t \left(e^t -1\right)} \, dt\,. There also exist special formulas for the logarithm of the gamma function for rational .

For instance, if k and n are integers with k and , then \begin{align} \operatorname{log\Gamma} \left(\frac{k}{n}\right) = {} & \frac{\,(n-2k)\log2\pi\,}{2n} + \frac{1}{2}\left\{\,\log\pi-\log\sin\frac{\pi k}{n} \,\right\} + \frac{1}{\pi}\!\sum_{r=1}^{n-1}\frac{\,\gamma+\log r\,}{r}\cdot\sin\frac{\,2\pi r k\,}{n} \\ & {} - \frac{1}{2\pi}\sin\frac{2\pi k}{n}\cdot\!\int_0^\infty \!\!\frac{\,e^{-nx}\!\cdot\log x\,}{\,\cosh x -\cos( 2\pi k/n )\,}\,{\mathrm d}x. \end{align} This formula is sometimes used for numerical computation, since the integrand decreases very quickly. \int_0^z \operatorname{log\Gamma} (x) \, dx can be expressed in terms of the Barnes -function (see Barnes -function for a proof): \int_0^z \operatorname{log\Gamma}(x) \, dx = \frac{z}{2} \log (2 \pi) + \frac{z(1-z)}{2} + z \operatorname{log\Gamma}(z) - \log G(z+1) where . It can also be written in terms of the Hurwitz zeta function: \int_0^z \operatorname{log\Gamma}(x) \, dx = \frac{z}{2} \log(2 \pi) + \frac{z(1-z)}{2} - \zeta'(-1) + \zeta'(-1,z) . When z=1 it follows that \int_0^1 \operatorname{log\Gamma}(x) \, dx = \frac 1 2 \log(2\pi), and this is a consequence of Raabe's formula as well.

Espinosa and Moll derived a similar formula for the integral of the square of : \int_{0}^{1} \log ^{2} \Gamma(x) d x=\frac{\gamma^{2}}{12}+\frac{\pi^{2}}{48}+\frac{1}{3} \gamma L_{1}+\frac{4}{3} L_{1}^{2}-\left(\gamma+2 L_{1}\right) \frac{\zeta^{\prime}(2)}{\pi^{2}}+\frac{\zeta^{\prime \prime}(2)}{2 \pi^{2}}, where L_1 is . D. H. Bailey and his co-authors gave an evaluation for L_n:=\int_0^1 \log^n \Gamma(x) \, dx when n=1,2 in terms of the Tornheim–Witten zeta function and its derivatives.

In addition, it is also known that \lim_{n\to\infty} \frac{L_n}{n!}=1. \Gamma(z) \sim \sqrt{2\pi}z^{z-1/2}e^{-z}\quad\hbox{as }z\to\infty\hbox{ in } \left|\arg(z)\right| The gamma function can be computed to fixed precision for \Re (z) \in [1, 2] by applying integration by parts to Euler's integral. For any positive number  the gamma function can be written \begin{align} \Gamma(z) &= \int_0^x e^{-t} t^z \, \frac{dt}{t} + \int_x^\infty e^{-t} t^z\, \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 and , the absolute value of the last integral is smaller than .

By choosing a large enough , this last expression can be made smaller than 2^{-N} for any desired value . Thus, the gamma function can be evaluated to N bits of precision with the above series. A similar derivation leads to the Lanczos approximation, which can also be computed to any given precision.

A fast algorithm for calculation of the Euler gamma function for any algebraic argument (including rational) was constructed by E.A. Karatsuba. For arguments that are integer multiples of , the gamma function can also be evaluated quickly using arithmetic–geometric mean iterations (see particular values of the gamma function).

Unlike many other functions, such as a normal distribution, no obvious fast, accurate implementation that is easy to implement for the gamma function \Gamma(z) is easily found. Therefore, it is worth investigating potential solutions.

For the case that speed is more important than accuracy, published tables for \Gamma(z) are easily found in an Internet search, such as the Online Wiley Library. Such tables may be used with linear interpolation. Greater accuracy is obtainable with the use of cubic interpolation at the cost of more computational overhead.

Since \Gamma(z) tables are usually published for argument values between 1 and 2, the property \Gamma(z+1) = z\ \Gamma(z) may be used to quickly and easily translate all real values z and z>2 into the range , such that only tabulated values of z between 1 and 2 need be used. If interpolation tables are not desirable, then the Lanczos approximation mentioned above works well for 1 to 2 digits of accuracy for small, commonly used values of , or to any arbitrary precision by evaluating more terms of its series A. When the precision is not clearly known beforehand, the Stirling's formula for the Gamma Function may be used.

Reasonably accurate implementations may be found in language standard libraries and other software libraies. The C++ Boost library provides a well=documented implementation of the both \Gamma(z) ( tgamma ) and \operatorname{log\Gamma}(z) ( lgamma ). Lanczos approximation is used for lgamma and tgamma when the target precision is known.

Otherwise Stirling's approximation is used. 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 u:=a\cdot t gives the evaluation \int_0^\infty t^b \, e^{-at} \,dt = \frac{1}{a^b} \int_0^\infty u^b \, e^{-u} \, d\left(\frac{u}{a}\right) = \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 \infty 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 factor \sqrt{\pi} obtained by evaluating \Gamma \left( \frac{1}{2} \right) is the "same" as that found in the normalizing factor of the error function and the normal distribution.

The integrals 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 -dimensional hyperspheres. (1 + z)^n = \sum_{k=0}^\infty \frac{\Gamma(n+1)}{k!\Gamma(n-k+1)} z^k, which closely resembles the binomial coefficient when n is a non-negative integer, (1 + z)^n = \sum_{k=0}^n \frac{n!}{k!(n-k)!} z^k = \sum_{k=0}^n \binom{n}{k} z^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 , there are of course no ways. If , then (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 .

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, \cdots, p_m and , 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 very simple 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 . By taking the appropriate limits, the equation can also be made to hold even when the left-hand product contains 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. \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.

Another powerful formula is \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 "Ueber die Anzahl der Primzahlen unter einer gegebenen Größe" ("On the Number of Primes Less Than a Given Magnitude"), 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. x!=\lim_{n\to\infty}\left(n+1+\frac{x}{2}\right)^{x-1}\prod_{k=1}^{n}\frac{k+1}{k+x}, which is well defined for real values of other than the negative integers.

Leonhard Euler later gave two different definitions: the first was not his integral but an infinite product that is well defined for all complex numbers other than the negative integers, 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 13 October 1729. He wrote to Goldbach again on 8 January 1730, to announce his discovery of the integral representation n!=\int_0^1 (-\log s)^n \, ds, which is valid when the real part of the complex number is strictly greater than -1 (i.e., ).

By the change of variables , 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 28 November 1729.

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 , 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. \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. 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 \gamma is the Euler–Mascheroni constant. Weierstrass originally wrote his product as one for , 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 \Gamma 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 \Pi (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 \Gamma (n + 1) = n! instead of simply using . Consider that the notation for exponents, , has been generalized from integers to complex numbers x^z without any change.

Legendre's motivation for the normalization is not 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 ). Legendre's normalization does simplify some formulae, but complicates 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 x^z with respect to the Haar measure \frac{dx}{x} on the Lie group . Thus this normalization makes it clearer that the gamma function is a continuous analogue of a Gauss sum.

Examples of problems involving the gamma function can be found at Exampleproblems.com. Wolfram gamma function evaluator (arbitrary precision) Volume of n-Spheres and the Gamma Function at MathPages

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378860495 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

26 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.