Gamma and Beta Functions

⚡ Key Takeaways

The Gamma function Γ(z)\Gamma(z) extends the factorial to complex arguments via Γ(n)=(n−1)!\Gamma(n)=(n-1)!; the Beta function B(x,y)B(x,y) is a closely related two-variable integral satisfying B(x,y)=Γ(x)Γ(y)/Γ(x+y)B(x,y)=\Gamma(x)\Gamma(y)/\Gamma(x+y). They appear everywhere: probability distributions, special-function identities, fractional calculus, and physics integrals. Introduced by Euler (1729–1730), refined by Legendre, Gauss, and Weierstrass.

💡 The Core Insight

Factorials are defined by the recursion n!=n⋅(n−1)!n! = n\cdot(n-1)!. The Gamma integral satisfies the same recursion Γ(z+1)=z Γ(z)\Gamma(z+1)=z\,\Gamma(z) but for continuous and complex zz. Demanding this recursion plus logarithmic convexity (Bohr–Mollerup) pins down a unique extension. The Beta function is simply what you get when two such integrals are multiplied and re-parameterized — the appearance of Γ(x+y)\Gamma(x+y) in its denominator is the signature of this convolution structure.

Formal Statement

DefinitionGamma Function (Euler integral of the second kind)

For Re⁡(z)>0\operatorname{Re}(z)>0,

1
Γ(z)=∫0∞tz−1e−t dt.\quad \Gamma(z)=\int_0^\infty t^{z-1}e^{-t}\,dt.

Derivation hint: convergence at 00 needs Re⁡(z)>0\operatorname{Re}(z)>0 (integrand ∼tz−1\sim t^{z-1}); convergence at ∞\infty is guaranteed by e−te^{-t} for all zz. Here z∈Cz\in\mathbb{C}, tt is the real integration variable, tz−1=e(z−1)ln⁡tt^{z-1}=e^{(z-1)\ln t} uses the principal logarithm, and e−te^{-t} provides exponential decay. The integral defines a holomorphic function on the right half-plane.

DefinitionBeta Function (Euler integral of the first kind)

For Re⁡(x)>0, Re⁡(y)>0\operatorname{Re}(x)>0,\ \operatorname{Re}(y)>0,

2
B(x,y)=∫01tx−1(1−t)y−1 dt.\quad B(x,y)=\int_0^1 t^{x-1}(1-t)^{y-1}\,dt.

Derivation hint: convergence at t=0t=0 requires Re⁡(x)>0\operatorname{Re}(x)>0, at t=1t=1 requires Re⁡(y)>0\operatorname{Re}(y)>0. The variables x,y∈Cx,y\in\mathbb{C} are the two parameters; tt ranges over [0,1][0,1]. The integrand is symmetric under t↦1−tt\mapsto 1-t, which forces B(x,y)=B(y,x)B(x,y)=B(y,x).

TheoremFundamental Properties

The Gamma function satisfies:

3
Γ(z+1)=z Γ(z),Γ(n)=(n−1)!  (n∈Z+).\quad \Gamma(z+1)=z\,\Gamma(z),\qquad \Gamma(n)=(n-1)!\ \ (n\in\mathbb{Z}^+).

Derivation hint: integrate [1][1] by parts with u=tzu=t^{z}, dv=e−tdtdv=e^{-t}dt; the boundary term vanishes for Re⁡(z)>0\operatorname{Re}(z)>0.

4
Γ(z) Γ(1−z)=πsin⁡(πz)(z∉Z).\quad \Gamma(z)\,\Gamma(1-z)=\frac{\pi}{\sin(\pi z)}\qquad (z\notin\mathbb{Z}).

Derivation hint: reflection formula — evaluate B(z,1−z)=∫0∞uz−11+u du=π/sin⁡(πz)B(z,1-z)=\int_0^\infty \frac{u^{z-1}}{1+u}\,du=\pi/\sin(\pi z) by contour integration.

5
B(x,y)=Γ(x) Γ(y)Γ(x+y).\quad B(x,y)=\frac{\Gamma(x)\,\Gamma(y)}{\Gamma(x+y)}.

Derivation hint: multiply two Gamma integrals, switch to polar/affine coordinates, and split the radial and angular parts (see proof below).

6
Γ ⁣(12)=π.\quad \Gamma\!\left(\tfrac12\right)=\sqrt{\pi}.

Derivation hint: set z=12z=\tfrac12 in [4][4], or evaluate the Gaussian integral after substituting t=u2t=u^2 in [1][1].

Why It Holds / Derivation

ProofRecursion Γ(z+1)=zΓ(z)\Gamma(z+1)=z\Gamma(z)

Step 1. Start from the definition:

7
Γ(z+1)=∫0∞tze−t dt.\quad \Gamma(z+1)=\int_0^\infty t^{z}e^{-t}\,dt.

Derivation hint: just replace zz by z+1z+1 in [1][1].

Step 2. Integrate by parts with u=tzu=t^{z} (so du=z tz−1dtdu=z\,t^{z-1}dt) and dv=e−tdtdv=e^{-t}dt (so v=−e−tv=-e^{-t}):

8
Γ(z+1)=[−tze−t]0∞+z∫0∞tz−1e−t dt.\quad \Gamma(z+1)=\Big[-t^{z}e^{-t}\Big]_0^\infty+z\int_0^\infty t^{z-1}e^{-t}\,dt.

Derivation hint: standard ∫u dv=uv−∫v du\int u\,dv = uv-\int v\,du.

Step 3. The boundary term vanishes: as t→∞t\to\infty, e−te^{-t} dominates; as t→0+t\to 0^+, tz→0t^z\to 0 for Re⁡(z)>0\operatorname{Re}(z)>0. Hence

9
Γ(z+1)=z Γ(z).\quad \Gamma(z+1)=z\,\Gamma(z).

Derivation hint: the surviving integral is exactly Γ(z)\Gamma(z) from [1][1].

Step 4. Since Γ(1)=∫0∞e−tdt=1\Gamma(1)=\int_0^\infty e^{-t}dt=1, induction gives Γ(n)=(n−1)!\Gamma(n)=(n-1)!. ■\blacksquare

∎

:::proof[Beta–Gamma relation [5][5]] Step 1. Write the product using independent variables:

10
Γ(x)Γ(y)=∫0∞ ⁣ ⁣∫0∞ux−1vy−1e−(u+v) du dv.\quad \Gamma(x)\Gamma(y)=\int_0^\infty\!\!\int_0^\infty u^{x-1}v^{y-1}e^{-(u+v)}\,du\,dv.

Derivation hint: product of two single integrals becomes a double integral over the first quadrant.

Step 2. Substitute u=stu=st, v=s(1−t)v=s(1-t) with s∈(0,∞)s\in(0,\infty), t∈(0,1)t\in(0,1). Then u+v=su+v=s and the Jacobian is ∣∂(u,v)/∂(s,t)∣=s|\partial(u,v)/\partial(s,t)|=s:

11
Γ(x)Γ(y)=∫0∞ ⁣ ⁣∫01(st)x−1(s(1−t))y−1e−s s dt ds.\quad \Gamma(x)\Gamma(y)=\int_0^\infty\!\!\int_0^1 (st)^{x-1}\big(s(1-t)\big)^{y-1}e^{-s}\,s\,dt\,ds.

Derivation hint: compute the Jacobian determinant det⁡(ts1−t−s)=−s\det\begin{pmatrix}t & s\\ 1-t & -s\end{pmatrix}=-s, take absolute value.

Step 3. Collect powers of ss: the exponent is (x−1)+(y−1)+1=x+y−1(x-1)+(y-1)+1=x+y-1. Factor the integral:

12
Γ(x)Γ(y)=∫0∞sx+y−1e−s ds⏟=Γ(x+y)⋅∫01tx−1(1−t)y−1 dt⏟=B(x,y).\quad \Gamma(x)\Gamma(y)=\underbrace{\int_0^\infty s^{x+y-1}e^{-s}\,ds}_{=\Gamma(x+y)}\cdot\underbrace{\int_0^1 t^{x-1}(1-t)^{y-1}\,dt}_{=B(x,y)}.

Derivation hint: the integrand separates into an ss-only factor and a tt-only factor.

Step 4. Divide by Γ(x+y)\Gamma(x+y) to obtain B(x,y)=Γ(x)Γ(y)/Γ(x+y)B(x,y)=\Gamma(x)\Gamma(y)/\Gamma(x+y). ■\blacksquare

ProofAnalytic continuation to C∖{0,−1,−2,… }\mathbb{C}\setminus\{0,-1,-2,\dots\}

Step 1. Rearranging [3][3] gives Γ(z)=Γ(z+1)/z\Gamma(z)=\Gamma(z+1)/z. The right side is defined for Re⁡(z)>−1\operatorname{Re}(z)>-1 (except z=0z=0). Derivation hint: Γ(z+1)\Gamma(z+1) is holomorphic for Re⁡(z+1)>0\operatorname{Re}(z+1)>0, i.e. Re⁡(z)>−1\operatorname{Re}(z)>-1.

Step 2. Iterating,

13
Γ(z)=Γ(z+n+1)z(z+1)⋯(z+n).\quad \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n)}.

Derivation hint: apply [3][3] repeatedly n+1n+1 times.

Step 3. This is valid for Re⁡(z)>−(n+1)\operatorname{Re}(z)>-(n+1) except at z=0,−1,…,−nz=0,-1,\dots,-n, where simple poles occur. The residue at z=−nz=-n is

14
Res⁡z=−nΓ(z)=(−1)nn!.\quad \operatorname{Res}_{z=-n}\Gamma(z)=\frac{(-1)^n}{n!}.

Derivation hint: in [13][13] near z=−nz=-n, only the factor (z+n)(z+n) vanishes; substitute z=−nz=-n in the rest and use Γ(1)=1\Gamma(1)=1. ■\blacksquare

∎
LE
Leonhard Euler
1707–1783

Euler discovered both functions while solving the interpolation problem posed by Goldbach and Daniel Bernoulli: find a smooth function passing through the factorial values. In a 1729 letter he gave an infinite-product form, and in 1730 the integral [1][1] (then written with different conventions). His genius was recognizing that n!n! is not an isolated arithmetic object but a sampled value of a single analytic curve — a viewpoint that seeded the entire theory of Special Functions and laid groundwork for Complex Analysis.

Building Intuition

🧠 Intuition

Think of Γ(z)\Gamma(z) as a weighted "area" machine: ∫0∞tz−1e−tdt\int_0^\infty t^{z-1}e^{-t}dt measures how the bump e−te^{-t} is reshaped by the monomial weight tz−1t^{z-1}. Larger zz pushes the weight to bigger tt, fattening the integral — exactly the growth captured by factorial. The recursion Γ(z+1)=z Γ(z)\Gamma(z+1)=z\,\Gamma(z) is the continuous analogue of "to advance one step, multiply by the current value." Between integers, the curve is forced to dip: Γ\Gamma has a minimum near z≈1.4616z\approx 1.4616 where Γ≈0.8856\Gamma\approx 0.8856 — the factorial "interpolation" is not monotone on (0,1)(0,1). The Beta function is best pictured as the shape factor of the region {u,v>0, u+v=const}\{u,v>0,\ u+v=\text{const}\}. When you slice the joint Gamma density along constant-sum lines, the angular distribution is exactly the Beta density — which is why Beta governs proportions and the Dirichlet Distribution.

Figure
The Gamma function on the real axis, showing poles at non-positive integers
z Γ(z) 1 2 3 -1 -2 Γ(1)=1 Γ(3)=2 simple poles at z = 0, -1, -2, …

Worked Examples

ExampleEvaluating a Gaussian-type integral

Given: Compute I=∫0∞t5e−t dtI=\int_0^\infty t^{5}e^{-t}\,dt and J=∫0∞x4e−x2 dxJ=\int_0^\infty x^{4}e^{-x^2}\,dx.

Step 1. For II, match to [1][1]: tz−1=t5⇒z=6t^{z-1}=t^5\Rightarrow z=6. So I=Γ(6)=5!=120I=\Gamma(6)=5!=120.

Step 2. For JJ, substitute u=x2u=x^2, x=u1/2x=u^{1/2}, dx=12u−1/2dudx=\tfrac12 u^{-1/2}du:

15
J=∫0∞u2e−u⋅12u−1/2 du=12∫0∞u3/2e−u du=12 Γ ⁣(52).\quad J=\int_0^\infty u^{2}e^{-u}\cdot\tfrac12 u^{-1/2}\,du=\tfrac12\int_0^\infty u^{3/2}e^{-u}\,du=\tfrac12\,\Gamma\!\left(\tfrac52\right).

Derivation hint: x4=u2x^4=u^2 and combine u2⋅u−1/2=u3/2u^{2}\cdot u^{-1/2}=u^{3/2}.

Step 3. Use the recursion: Γ(52)=32⋅12⋅Γ(12)=34π\Gamma(\tfrac52)=\tfrac32\cdot\tfrac12\cdot\Gamma(\tfrac12)=\tfrac34\sqrt\pi. So J=12⋅34π=38πJ=\tfrac12\cdot\tfrac34\sqrt\pi=\tfrac{3}{8}\sqrt\pi.

I=120 (dimensionless),J=38π≈0.6647\boxed{I=120\ \text{(dimensionless)},\qquad J=\tfrac{3}{8}\sqrt{\pi}\approx 0.6647}
ExampleA Beta-function integral

Given: Compute K=∫0π/2sin⁡4θ cos⁡6θ dθK=\int_0^{\pi/2}\sin^4\theta\,\cos^6\theta\,d\theta.

Step 1. Use the trigonometric form of Beta (from t=sin⁡2θt=\sin^2\theta):

16
∫0π/2sin⁡2a−1θ cos⁡2b−1θ dθ=12B(a,b).\quad \int_0^{\pi/2}\sin^{2a-1}\theta\,\cos^{2b-1}\theta\,d\theta=\tfrac12 B(a,b).

Derivation hint: substitute t=sin⁡2θt=\sin^2\theta, dt=2sin⁡θcos⁡θ dθdt=2\sin\theta\cos\theta\,d\theta, into [2][2].

Step 2. Match exponents: 2a−1=4⇒a=522a-1=4\Rightarrow a=\tfrac52; 2b−1=6⇒b=722b-1=6\Rightarrow b=\tfrac72. Thus K=12B(52,72)K=\tfrac12 B(\tfrac52,\tfrac72).

Step 3. Apply [5][5]: B(52,72)=Γ(5/2)Γ(7/2)Γ(6)B(\tfrac52,\tfrac72)=\dfrac{\Gamma(5/2)\Gamma(7/2)}{\Gamma(6)}. With Γ(52)=34π\Gamma(\tfrac52)=\tfrac34\sqrt\pi, Γ(72)=158π\Gamma(\tfrac72)=\tfrac{15}{8}\sqrt\pi, Γ(6)=120\Gamma(6)=120:

17
B ⁣(52,72)=34π⋅158π120=4532π120=45π3840=3π256.\quad B\!\left(\tfrac52,\tfrac72\right)=\frac{\tfrac34\sqrt\pi\cdot\tfrac{15}{8}\sqrt\pi}{120}=\frac{\tfrac{45}{32}\pi}{120}=\frac{45\pi}{3840}=\frac{3\pi}{256}.

Derivation hint: multiply the half-integer Gamma values, keep π\pi exact, simplify the fraction.

Step 4. Therefore K=12⋅3π256=3π512K=\tfrac12\cdot\tfrac{3\pi}{256}=\tfrac{3\pi}{512}.

K=3π512≈0.01841 (dimensionless)\boxed{K=\dfrac{3\pi}{512}\approx 0.01841\ \text{(dimensionless)}}

Common Misconceptions

⚠️ Common mistake

Γ(n)=n!\Gamma(n)=n! is FALSE. The shift is essential: Γ(n)=(n−1)!\Gamma(n)=(n-1)!. So Γ(5)=24\Gamma(5)=24, not 120120. The mismatch comes from the integrand tz−1t^{z-1}, not tzt^z. To get a true factorial extension with Π(n)=n!\Pi(n)=n!, some authors use the Pi function Π(z)=Γ(z+1)\Pi(z)=\Gamma(z+1) — but this is non-standard; always check conventions.

The Gamma integral [1][1] is only the definition for Re⁡(z)>0\operatorname{Re}(z)>0. For Re⁡(z)≤0\operatorname{Re}(z)\le 0 the integral diverges; one must use the continuation [13][13]. Plugging negative arguments directly into the integral is meaningless.

Counterexample

A tempting but wrong belief: "Γ\Gamma is defined everywhere because factorials of negative numbers should just be large." In fact Γ\Gamma has simple poles at 0,−1,−2,…0,-1,-2,\dots, so quantities like Γ(−2)\Gamma(-2) are undefined (∞\infty). Concretely, attempting Γ(0)\Gamma(0) via the recursion: Γ(0)=Γ(1)/0=1/0\Gamma(0)=\Gamma(1)/0=1/0, undefined. And Γ(−12)\Gamma(-\tfrac12) does exist (it is −2π-2\sqrt\pi) because −12-\tfrac12 is not an integer — so "negative argument" is not the issue; "non-positive integer" is. This subtlety routinely trips up students.

Connections

connection

The Gamma function is the hub of the special-function universe. It appears in Stirling's Approximation Γ(z+1)∼2πz (z/e)z\Gamma(z+1)\sim\sqrt{2\pi z}\,(z/e)^z, controls the normalization of the Gamma Distribution and Beta Distribution in probability, and defines the Riemann Zeta Function through its functional equation ζ(s)=Γ(1−s) …\zeta(s)=\Gamma(1-s)\,\dots relation. The Beta function provides closed forms for volumes of nn-balls (linking to Multiple Integrals) and underlies the Dirichlet Distribution. Via the Mellin Transform, Γ\Gamma is literally the Mellin transform of e−te^{-t}, tying it to Laplace and Fourier Transforms. The reflection formula [4][4] is a gateway into Complex Analysis and contour integration.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1729–1730 — Euler. Solves the factorial-interpolation problem; gives both an infinite product and the integral form, establishing Γ\Gamma and BB.
- 1768 — Euler. Publishes the reflection-type and product relations connecting the two integrals.
- 1809 — Legendre. Introduces the notation Γ\Gamma and the symbol; proves the duplication formula Γ(z)Γ(z+12)=21−2zπ Γ(2z)\Gamma(z)\Gamma(z+\tfrac12)=2^{1-2z}\sqrt\pi\,\Gamma(2z).
- 1812 — Gauss. Gives the limit/product definition Γ(z)=lim⁡n→∞n! nzz(z+1)⋯(z+n)\Gamma(z)=\lim_{n\to\infty}\frac{n!\,n^z}{z(z+1)\cdots(z+n)}, valid for all non-pole zz.
- 1854 — Weierstrass. Produces the canonical product 1/Γ(z)=zeγz∏n(1+z/n)e−z/n1/\Gamma(z)=z e^{\gamma z}\prod_n(1+z/n)e^{-z/n} with the Euler–Mascheroni constant γ\gamma, displaying the zeros of 1/Γ1/\Gamma.
- 1856 — Riemann. Uses Γ\Gamma in the functional equation of ζ(s)\zeta(s), embedding it in analytic number theory.
- 1922 — Bohr & Mollerup. Prove that log-convexity plus f(1)=1f(1)=1 and the recursion uniquely characterize Γ\Gamma, finally justifying it as the factorial extension.
- 1931 — Artin. Publishes The Gamma Function, a definitive modern treatment streamlining the Bohr–Mollerup approach.
- 1970s — QFT era. Dimensional regularization ('t Hooft–Veltman) turns Gamma functions into everyday tools of particle physics.

Subtleties & Limits

open-problem

The Gamma function is never zero (1/Γ1/\Gamma is entire), and its only singularities are the simple poles at non-positive integers — but the deep questions concern its arithmetic nature. Whether Γ(1/3)\Gamma(1/3), Γ(1/4)\Gamma(1/4) are algebraically independent of π\pi involves transcendence theory; Chudnovsky proved Γ(1/4)\Gamma(1/4) and π\pi are algebraically independent, while the status of Γ(1/5)\Gamma(1/5) relative to known constants is more delicate. More broadly, period theory (Kontsevich–Zagier) seeks to classify exactly which Gamma values are "periods" and what relations they satisfy — a largely open program. On the analytic side, the asymptotic Stirling's Approximation is divergent (asymptotic, not convergent), and controlling its error terms in the complex plane near the negative real axis remains technically subtle.

See Also

Special Functions · Stirling's Approximation · Beta Distribution · Gamma Distribution · Riemann Zeta Function · Mellin Transform · Fractional Calculus · Complex Analysis · Dirichlet Distribution · Improper Integrals