Generalized Hypergeometric Functions

Almost every "special function" a physicist meets — Bessel, Legendre, Laguerre, Hermite, the error function, the Coulomb wavefunction — arrives as an infinite power series, and it is easy to feel that each is its own creature with its own book of identities. The generalized hypergeometric function dissolves that impression. Ask a sharp structural question of a power series ∑tnzn\sum t_n z^n: when is the ratio tn+1/tnt_{n+1}/t_n a rational function of the index nn? Factor that rational function into linear pieces, and the roots of its numerator become upper parameters a1,…,apa_1,\dots,a_p, the roots of its denominator become lower parameters b1,…,bqb_1,\dots,b_q, and an unavoidable factor (n+1)(n+1) supplies the 1/n!1/n! every well-behaved series carries. The entire zoo collapses into one notation, pFq(a1,…,ap;b1,…,bq;z){}_pF_q(a_1,\dots,a_p;b_1,\dots,b_q;z), and one differential equation. The payoff is not just tidy bookkeeping; it is predictive. Convergence is decided by nothing more than counting pp against q+1q+1. A single upper parameter set to a negative integer snaps the infinite series shut into a polynomial — and that is exactly where the classical orthogonal polynomials and, physically, energy quantization come from. Merging two parameters (confluence) turns the algebra of 2F1{}_2F_1 into the transcendence of Bessel and Airy functions. This article builds the definition, the Pochhammer–Gamma backbone (recalled from the prerequisite Gamma articles), the defining ODE, Euler's integral representation, and the confluence and termination mechanisms that generate every named function downstream.

Key takeaways
  • pFq{}_pF_q is the power series whose consecutive-term ratio is a fixed rational function of nn, encoded by pp numerator parameters aia_i and qq denominator parameters bjb_j: tn=(a1)n⋯(ap)n(b1)n⋯(bq)nznn!t_n=\dfrac{(a_1)_n\cdots(a_p)_n}{(b_1)_n\cdots(b_q)_n}\dfrac{z^n}{n!}.
  • The Pochhammer symbol (x)n=Γ(x+n)/Γ(x)(x)_n=\Gamma(x+n)/\Gamma(x) is the analytic backbone; the poles of Γ\Gamma fix every parameter restriction and make pFq{}_pF_q meromorphic in its parameters.
  • Convergence is decided by pp versus q+1q+1 alone: entire for p≤qp\le q, radius 11 for p=q+1p=q+1, divergent (asymptotic only) for p>q+1p>q+1.
  • Setting an upper parameter ai=−ma_i=-m terminates the series into a degree-mm polynomial — the origin of every classical orthogonal-polynomial family and of energy quantization.
  • Gauss's 2F1{}_2F_1, Kummer's 1F1{}_1F_1, Bessel's 0F1{}_0F_1, and the exponential 0F0=ez{}_0F_0=e^z are all the same object at fixed parameters, linked by confluence.
  • pFq{}_pF_q solves one ODE of order max⁡(p,q+1)\max(p,q+1) built from the Euler operator θ=z d/dz\theta=z\,\mathrm{d}/\mathrm{d}z, which unifies the singularity structure of the whole special-function catalogue.
  • Key idea: a power series is hypergeometric precisely when the term ratio tn+1/tnt_{n+1}/t_n is a rational function of nn; writing that ratio as (n+a1)⋯(n+ap)(n+b1)⋯(n+bq)(n+1) z\dfrac{(n+a_1)\cdots(n+a_p)}{(n+b_1)\cdots(n+b_q)(n+1)}\,z reads off the parameter lists and defines pFq{}_pF_q.
The core insight

A power series is hypergeometric precisely when the term ratio tn+1/tnt_{n+1}/t_n is a rational function of nn; writing that rational function as (n+a1)⋯(n+ap)(n+b1)⋯(n+bq)(n+1) z\dfrac{(n+a_1)\cdots(n+a_p)}{(n+b_1)\cdots(n+b_q)(n+1)}\,z reads off the parameter lists and defines pFq{}_pF_q.

Where this lives today

The hypergeometric framework is live computational infrastructure. In quantum mechanics the radial Coulomb problem and the isotropic oscillator both reduce to 1F1{}_1F_1, and the bound-state spectrum is nothing but the termination condition — energy is quantized precisely when an upper parameter becomes a non-positive integer, producing the associated Laguerre polynomials, and the same object gives the Coulomb scattering wavefunctions of collision theory. In high-energy physics, dimensional regularization turns one- and multi-loop Feynman integrals into pFq{}_pF_q (and their cousins, the Appell and Lauricella functions) of mass and momentum ratios, with the spacetime dimension dd a parameter; the ϵ=(4−d)/2\epsilon=(4-d)/2 expansion rides on the Gamma structure of those parameters. Computer-algebra systems carry pFq{}_pF_q as a primitive and use Zeilberger's algorithm — creative telescoping — to prove hypergeometric identities automatically, a field grown out of the term-ratio structure in equation (3). And every numerical library that evaluates Bessel, Legendre, Coulomb, or error functions is, under the hood, evaluating a specialization of this one series.

The physical picture

Picture the coefficient tnt_n as the output of a product machine: it starts at t0=1t_0=1 and every step multiplies by the same template, (n+a1)⋯(n+ap)(n+b1)⋯(n+bq)(n+1)z\frac{(n+a_1)\cdots(n+a_p)}{(n+b_1)\cdots(n+b_q)(n+1)}z. The parameters are knobs — each upper aia_i pushes terms up, each lower bjb_j (and the hidden (n+1)(n+1) always present) pulls them down. Whether the series converges, terminates, or explodes is a tug-of-war between the numerator (growing like npn^p) and the denominator (growing like nq+1n^{q+1}), settled by a single integer p−q−1p-q-1. The first figure shows the three outcomes side by side.

Figure
Term size on a log scale for three regimes of ₚFq: ₀F₀ entire radius ∞ green plunges as 1/n!, ₂F₁ marginal radius 1 blue declines geometrically like (0.7)ⁿ, ₂F₀ divergent radius 0 red turns up as n!·(0.5)ⁿ — the sign of p−q−1 alone decides the fate
Convergence is decided by one integer: sign of p − (q+1) 10² 10⁰ 10⁻² 10⁻⁴ 0 2 4 6 8 term index n term magnitude |tₙ| ₂F₀ p−q−1 = 1 → R = 0 ₂F₁ p−q−1 = 0 → R = 1 ₀F₀ = eᶻ p−q−1 = −1 → R = ∞ |tₙ₊₁/tₙ| ∼ n^(p−q−1) |z|

Termination is the mechanism that matters most for physics. Set any upper parameter to a non-positive integer ai=−ma_i=-m and the factor (ai)n(a_i)_n hits zero at n=m+1n=m+1, so the infinite series collapses to a polynomial of degree mm — precisely the quantization condition in the Coulomb and oscillator problems, and the birthplace of every classical orthogonal polynomial. Confluence is the second mechanism: sending a parameter to infinity while rescaling zz merges two singular points of the underlying ODE, carrying the algebraic 2F1{}_2F_1 into the transcendental 1F1{}_1F_1 and then 0F1{}_0F_1. The second figure lays out the family tree — every named function is one pFq{}_pF_q at fixed parameters, joined by confluence.

Figure
The special-function family tree: every classical function is a ₚFq at fixed parameters, linked by confluence ₂F₁ →(b→∞) ₁F₁ →(a→∞) ₀F₁, with Bessel Jν(z) = (z/2)^ν⁄Γ(ν+1) · ₀F₁(;ν+1;−z²/4) sitting on the ground floor
Every special function is one ₚFq — confluence links the branches ₚFq(a;b;z) ₂F₁ ₁F₁ ₀F₁ ₀F₀ = eᶻ b→∞ a→∞ Legendre Pₙ Jacobi, Chebyshev Gegenbauer Laguerre Lₙ Hermite Hₙ Coulomb, erf Bessel Jν spherical jℓ exponential growth / decay ground floor — the Bessel identity Jν(z) = (z/2)^ν ⁄ Γ(ν+1) · ₀F₁(;ν+1;−z²/4)

The core equations

The definition is a bookkeeping statement: assemble each coefficient from rising factorials in the upper and lower parameters, divided by n!n!. Everything else here is a consequence of this one series. An empty parameter list (as in 0F1{}_0F_1) is written with nothing before its semicolon.

pFq ⁣(a1,…,apb1,…,bq;z)=∑n=0∞(a1)n⋯(ap)n(b1)n⋯(bq)n znn!(1){}_pF_q\!\left(\begin{matrix}a_1,\dots,a_p\\ b_1,\dots,b_q\end{matrix};z\right)=\sum_{n=0}^{\infty}\frac{(a_1)_n\cdots(a_p)_n}{(b_1)_n\cdots(b_q)_n}\,\frac{z^n}{n!} \qquad (1)

where: aia_i — upper (numerator) parameters, i=1,…,pi=1,\dots,p; bjb_j — lower (denominator) parameters, j=1,…,qj=1,\dots,q, none a non-positive integer; (x)n(x)_n — Pochhammer rising factorial x(x+1)⋯(x+n−1)x(x+1)\cdots(x+n-1), (x)0=1(x)_0=1; zz — complex argument; n!=(1)nn!=(1)_n — the hidden lower parameter every series carries. Reading: pp rising factorials on top, qq on the bottom, always one extra 1/n!1/n!. The Pochhammer symbol is a ratio of Gamma functions, which makes pFq{}_pF_q analytic in its parameters and pins its poles to the poles of Γ\Gamma — the analytic engine of the whole subject, inherited from the prerequisite Gamma articles.

(x)n=Γ(x+n)Γ(x),(1)n=n!(2)(x)_n=\frac{\Gamma(x+n)}{\Gamma(x)},\qquad (1)_n=n! \qquad (2)

where: Γ\Gamma — the Gamma function, with simple poles at x=0,−1,−2,…x=0,-1,-2,\dots. Reading: a lower parameter bj=−mb_j=-m would put a zero of (bj)n(b_j)_n in the denominator and blow the series up — the origin of the parameter restriction. The defining property — the reason the function earns its own name — is that the term ratio is a rational function of nn, and comparing the highest powers of nn in it is the entire convergence theory in one line.

tn+1tn=(n+a1)⋯(n+ap)(n+b1)⋯(n+bq) (n+1)  z(3)\frac{t_{n+1}}{t_n}=\frac{(n+a_1)\cdots(n+a_p)}{(n+b_1)\cdots(n+b_q)\,(n+1)}\;z \qquad (3)

where: tnt_n — the nn-th term. Reading: the numerator has pp linear factors, the denominator q+1q+1 (including the hidden n+1n+1), so as n→∞n\to\infty the ratio behaves like n p−(q+1)∣z∣n^{\,p-(q+1)}|z| — why the sign of p−q−1p-q-1 decides everything. Two specializations dominate the applications: Gauss's (p=2,q=1p=2,q=1) and Kummer's confluent function (p=1,q=1p=1,q=1) — the workhorses from which Legendre, Laguerre, Coulomb, and the rest descend.

2F1(a,b;c;z)=∑n=0∞(a)n(b)n(c)nznn!,1F1(a;c;z)=∑n=0∞(a)n(c)nznn!=M(a,c,z)(4){}_2F_1(a,b;c;z)=\sum_{n=0}^{\infty}\frac{(a)_n(b)_n}{(c)_n}\frac{z^n}{n!},\qquad {}_1F_1(a;c;z)=\sum_{n=0}^{\infty}\frac{(a)_n}{(c)_n}\frac{z^n}{n!}=M(a,c,z) \qquad (4)

where: a,ba,b — upper parameters (symmetric in 2F1{}_2F_1); cc — lower parameter, c∉Z≤0c\notin\mathbb{Z}_{\le0}; MM — Kummer's notation for 1F1{}_1F_1. Reading: 2F1{}_2F_1 has radius 11 (p=q+1p=q+1); 1F1{}_1F_1 is entire and is the confluent limit of 2F1{}_2F_1. The whole family solves one differential equation of order max⁡(p,q+1)\max(p,q+1), cleanest in the Euler operator θ=z d/dz\theta=z\,\mathrm{d}/\mathrm{d}z, which acts diagonally as θzn=nzn\theta z^n=nz^n. Derivation A builds it and checks that it reduces to the classical Gauss equation.

[θ∏j=1q(θ+bj−1)−z∏i=1p(θ+ai)]w=0,θ=zddz(5)\Big[\theta\prod_{j=1}^{q}(\theta+b_j-1)-z\prod_{i=1}^{p}(\theta+a_i)\Big]w=0,\qquad \theta=z\frac{\mathrm{d}}{\mathrm{d}z} \qquad (5)

where: w(z)=pFq(a;b;z)w(z)={}_pF_q(a;b;z) — the solution analytic at z=0z=0; θ\theta — the Euler (homogeneity) operator. Reading: the bjb_j block acts at power znz^n while the z∏(θ+ai)z\prod(\theta+a_i) block shifts the index by one; matching the two reproduces the term ratio (3). Euler's integral packages 2F1{}_2F_1 as a single Beta-type integral — the standard route to analytic continuation, monodromy, and the connection formulae.

2F1(a,b;c;z)=Γ(c)Γ(b)Γ(c−b)∫01t b−1(1−t)c−b−1(1−zt)−a dt(6){}_2F_1(a,b;c;z)=\frac{\Gamma(c)}{\Gamma(b)\Gamma(c-b)}\int_0^1 t^{\,b-1}(1-t)^{c-b-1}(1-zt)^{-a}\,\mathrm{d}t \qquad (6)

where: the integral converges for Re⁡c>Re⁡b>0\operatorname{Re}c>\operatorname{Re}b>0. Reading: the prefactor is 1/B(b,c−b)1/B(b,c-b), so the integral is a Beta average of (1−zt)−a(1-zt)^{-a} — Derivation B expands that binomial series to recover (1). Evaluated at z=1z=1, the series sums in closed form — Gauss's theorem, the single most-used hypergeometric identity, controlling endpoint behaviour and normalizations throughout special-function theory.

2F1(a,b;c;1)=Γ(c) Γ(c−a−b)Γ(c−a) Γ(c−b),Re⁡(c−a−b)>0(7){}_2F_1(a,b;c;1)=\frac{\Gamma(c)\,\Gamma(c-a-b)}{\Gamma(c-a)\,\Gamma(c-b)},\qquad \operatorname{Re}(c-a-b)>0 \qquad (7)

where: c−a−bc-a-b — the parameter excess ss that sets convergence on ∣z∣=1|z|=1. Reading: the sum is finite exactly when the excess is positive — the same ss that appears in the limiting-cases table.

The core derivations

Derivation AThe differential equation satisfied by the generalized hypergeometric series

The goal is to show that the single series pFq{}_pF_q is annihilated by one differential operator of order max⁡(p,q+1)\max(p,q+1), built with almost no computation from the Euler operator θ=z d/dz\theta=z\,\mathrm{d}/\mathrm{d}z. The strategy exploits one fact: θ\theta is diagonal on powers, θzn=nzn\theta z^n=nz^n, so any polynomial in θ\theta multiplies znz^n by that polynomial evaluated at nn. We act with the two parameter blocks, match coefficients of znz^n, and recover the defining term ratio (3) — proving the analytic solution at the origin is exactly pFq{}_pF_q and that the classical Gauss equation is the case p=2,q=1p=2,q=1.

Step 1. Act with the upper-parameter block on a single monomial: ∏i=1p(θ+ai) zn=∏i=1p(n+ai) zn\prod_{i=1}^{p}(\theta+a_i)\,z^n=\prod_{i=1}^{p}(n+a_i)\,z^n. Why: each factor (θ+ai)(\theta+a_i) replaces θ\theta by its eigenvalue nn, so the operator becomes multiplication by the numerator of the term ratio.

Step 2. Act with the lower-parameter block: θ∏j=1q(θ+bj−1) zn=n∏j=1q(n+bj−1) zn\theta\prod_{j=1}^{q}(\theta+b_j-1)\,z^n=n\prod_{j=1}^{q}(n+b_j-1)\,z^n. Why: the leading θ\theta supplies the factor nn that becomes the hidden 1/n!1/n!, and each (θ+bj−1)(\theta+b_j-1) supplies (n+bj−1)(n+b_j-1) — the denominator of the term ratio.

Step 3. Impose annihilation. The z∏(θ+ai)z\prod(\theta+a_i) piece of (5) carries an explicit factor zz, so it acts on the previous term tn−1zn−1t_{n-1}z^{n-1} and lands on znz^n. Equating the coefficient of znz^n from both blocks gives tn n∏j(n+bj−1)=tn−1∏i(n−1+ai)t_n\,n\prod_j(n+b_j-1)=t_{n-1}\prod_i(n-1+a_i). Why: annihilating the whole series means the net coefficient of every power znz^n vanishes — a recurrence linking tnt_n to tn−1t_{n-1}.

Step 4. Solve for the ratio: tntn−1=∏i(n−1+ai)n∏j(n−1+bj)\dfrac{t_n}{t_{n-1}}=\dfrac{\prod_i(n-1+a_i)}{n\prod_j(n-1+b_j)}, and shift n→n+1n\to n+1 to read off exactly the defining ratio (3), with the bjb_j and the nn (the hidden (1)n=n!(1)_n=n!) as lower parameters. Why: the recurrence has a one-dimensional space of solutions analytic at the origin, generated term-by-term by pFq{}_pF_q — so pFq{}_pF_q is the solution, not merely a solution. *Why it works for p=2,q=1p=2,q=1: the operator [θ(θ+c−1)−z(θ+a)(θ+b)][\theta(\theta+c-1)-z(\theta+a)(\theta+b)] expands directly to the classical Gauss equation z(1−z)w′′+[c−(a+b+1)z]w′−ab w=0z(1-z)w''+[c-(a+b+1)z]w'-ab\,w=0, confirming that the general construction (5) reduces correctly in this central case.*

Go deeper · Derivation B · 1 minEuler's integral representation of the Gauss function
Derivation BEuler's integral representation of the Gauss function

The aim is to turn the 2F1{}_2F_1 series into a single definite integral over [0,1][0,1] — the gateway to its analytic continuation beyond the unit disc, its monodromy, and Gauss's summation theorem. The engine is the Beta function: every ratio (b)n/(c)n(b)_n/(c)_n is, up to a constant, a Beta integral ∫01tb+n−1(1−t)c−b−1dt\int_0^1 t^{b+n-1}(1-t)^{c-b-1}\mathrm{d}t. We rewrite that ratio, pull the nn-independent constant out, sum the remaining series under the integral sign, and recognize the sum as the binomial series — the simplest hypergeometric identity of all.

Step 1. Express the ratio through Beta: (b)n(c)n=Γ(b+n)Γ(c)Γ(b)Γ(c+n)=Γ(c)Γ(b)Γ(c−b) B(b+n,c−b)\dfrac{(b)_n}{(c)_n}=\dfrac{\Gamma(b+n)\Gamma(c)}{\Gamma(b)\Gamma(c+n)}=\dfrac{\Gamma(c)}{\Gamma(b)\Gamma(c-b)}\,B(b+n,c-b), using (x)n=Γ(x+n)/Γ(x)(x)_n=\Gamma(x+n)/\Gamma(x) and B(p,q)=Γ(p)Γ(q)/Γ(p+q)B(p,q)=\Gamma(p)\Gamma(q)/\Gamma(p+q). Why: this trades the awkward discrete Pochhammer ratio for a continuous integral whose nn-dependence sits in a single power tnt^{n}.

Step 2. Insert the Beta integral explicitly: (b)n(c)n=Γ(c)Γ(b)Γ(c−b)∫01t b+n−1(1−t)c−b−1 dt\dfrac{(b)_n}{(c)_n}=\dfrac{\Gamma(c)}{\Gamma(b)\Gamma(c-b)}\int_0^1 t^{\,b+n-1}(1-t)^{c-b-1}\,\mathrm{d}t, valid for Re⁡c>Re⁡b>0\operatorname{Re}c>\operatorname{Re}b>0. Why: the convergence condition keeps both endpoint singularities of the integrand integrable — the price of the representation.

Step 3. Substitute into 2F1{}_2F_1 and interchange sum and integral: 2F1=Γ(c)Γ(b)Γ(c−b)∫01t b−1(1−t)c−b−1∑n=0∞(a)nn!(zt)n dt {}_2F_1=\dfrac{\Gamma(c)}{\Gamma(b)\Gamma(c-b)}\int_0^1 t^{\,b-1}(1-t)^{c-b-1}\sum_{n=0}^{\infty}\dfrac{(a)_n}{n!}(zt)^n\,\mathrm{d}t. Why: for ∣z∣<1|z|<1 the series converges uniformly in t∈[0,1]t\in[0,1], so Fubini permits the interchange and the tnt^n fuses with znz^n into (zt)n(zt)^n.

Step 4. Recognize the inner sum as the binomial series: ∑n=0∞(a)nn!(zt)n=1F0(a;;zt)=(1−zt)−a\sum_{n=0}^{\infty}\dfrac{(a)_n}{n!}(zt)^n={}_1F_0(a;;zt)=(1-zt)^{-a}, which closes the integral into (6). Why: 1F0{}_1F_0 is the generalized binomial theorem, the ground-level hypergeometric identity, and its appearance here makes the whole representation elementary. *Why this yields Gauss's theorem: setting z=1z=1 in the integral leaves ∫01tb−1(1−t)c−a−b−1dt=B(b,c−a−b)\int_0^1 t^{b-1}(1-t)^{c-a-b-1}\mathrm{d}t=B(b,c-a-b), and multiplying by the prefactor Γ(c)/[Γ(b)Γ(c−b)]\Gamma(c)/[\Gamma(b)\Gamma(c-b)] reproduces exactly the closed form (7).*

Go deeper · Derivation C · 1 minConfluence: from Gauss to Kummer to Bessel
Derivation CConfluence: from Gauss to Kummer to Bessel

The purpose is to make precise the sense in which the confluent 1F1{}_1F_1 and the Bessel-type 0F1{}_0F_1 are limits of the Gauss function, obtained by pushing a parameter to infinity while shrinking the argument to compensate. Physically this merges two of the three regular singular points of the Gauss equation into one irregular point at infinity — the transition from algebraic behaviour (powers, logarithms) to transcendental behaviour (exponential, oscillatory, Bessel). We track the parameter dependence of a single term, take the limit factor by factor, and repeat the trick to strip down to 0F1{}_0F_1.

Step 1. In 2F1(a,b;c;z/b){}_2F_1(a,b;c;z/b) isolate the bb-dependence of the general term: (a)n(b)n(c)n n!(zb)n=(a)n(c)n n! zn⋅(b)nbn\dfrac{(a)_n(b)_n}{(c)_n\,n!}\left(\dfrac{z}{b}\right)^n=\dfrac{(a)_n}{(c)_n\,n!}\,z^n\cdot\dfrac{(b)_n}{b^n}. Why: rescaling by 1/b1/b cancels the growth of (b)n(b)_n, so the whole limit hinges on the single factor (b)n/bn(b)_n/b^n.

Step 2. Take the limit: (b)nbn=b(b+1)⋯(b+n−1)bn=∏k=0n−1b+kb→ b→∞ 1\dfrac{(b)_n}{b^n}=\dfrac{b(b+1)\cdots(b+n-1)}{b^n}=\prod_{k=0}^{n-1}\dfrac{b+k}{b}\xrightarrow{\,b\to\infty\,}1. Why: each of the finitely many factors tends to 11, so the product tends to 11 term-by-term — and the surviving series is Kummer's.

Step 3. Read off the confluent function: lim⁡b→∞2F1(a,b;c;z/b)=∑n=0∞(a)n(c)n n!zn=1F1(a;c;z)\lim_{b\to\infty}{}_2F_1(a,b;c;z/b)=\sum_{n=0}^{\infty}\dfrac{(a)_n}{(c)_n\,n!}z^n={}_1F_1(a;c;z). Why: the regular singular points at z=1z=1 and z=∞z=\infty have coalesced into a single irregular point at infinity — the analytic source of the exponential and oscillatory asymptotics that 2F1{}_2F_1 never has.

Step 4. Confluence again: lim⁡a→∞1F1(a;c;z/a)=0F1(;c;z)\lim_{a\to\infty}{}_1F_1(a;c;z/a)={}_0F_1(;c;z), and with c=ν+1c=\nu+1 and argument −z2/4-z^2/4 this is Bessel up to a power prefactor, Jν(z)=(z/2)νΓ(ν+1)0F1(;ν+1;−z2/4)J_\nu(z)=\dfrac{(z/2)^\nu}{\Gamma(\nu+1)}{}_0F_1(;\nu+1;-z^2/4). Why: repeating the limit removes the last upper parameter, landing on the entire function 0F1{}_0F_1 — the ground floor of the family tree. *Why the chain is geometrically meaningful: the successive limits 2F1→1F1→0F1{}_2F_1\to{}_1F_1\to{}_0F_1 mirror the degeneration of the three regular singular points at 0,1,∞0,1,\infty to one regular plus one irregular point — the analytic source of the exponential and oscillatory behaviour that 2F1{}_2F_1 never exhibits.*

Limiting cases

The qualitative character of pFq(z){}_pF_q(z) is fixed by comparing pp with q+1q+1 — the same integer p−q−1p-q-1 that labels the three curves in the first figure — plus a separate line for termination.

CaseResultMeaning
Entire (p≤qp\le q)radius R=∞R=\inftyDenominator outgrows numerator; e.g. 0F0(;;z)=ez{}_0F_0(;;z)=e^z and 0F1(;b;z){}_0F_1(;b;z) (Bessel-type) converge for all zz.
Unit disc (p=q+1p=q+1)R=1R=1, boundary set by s=∑jbj−∑iais=\sum_j b_j-\sum_i a_iThe canonical Gauss case 2F1{}_2F_1; converges on ∣z∣=1|z|=1 iff Re⁡s>0\operatorname{Re}s>0, absolutely iff Re⁡s>1\operatorname{Re}s>1 (Gauss/Raabe criteria).
Divergent (p>q+1p>q+1)R=0R=0Terms grow factorially; the series is asymptotic only, e.g. 2F0{}_2F_0 encoding error-function and exponential-integral tails.
Termination (ai=−m∈Z≤0a_i=-m\in\mathbb{Z}_{\le0})pFq=∑n=0mtn{}_pF_q=\sum_{n=0}^{m}t_nA degree-mm polynomial; convergence is then automatic, giving every classical orthogonal-polynomial family.

Worked examples

1 · Gauss summation by telescoping (confidence builder)

Evaluate 2F1(1,2;4;1){}_2F_1(1,2;4;1) two ways — directly from Gauss's theorem, and by summing the series — and confirm they agree.

Step 1. Check the theorem applies: the excess is c−a−b=4−1−2=1>0c-a-b=4-1-2=1>0, so (7) is valid and the boundary series converges — the whole content of "does the sum exist at z=1z=1".

Step 2. Apply Gauss's theorem (7): 2F1(1,2;4;1)=Γ(4) Γ(1)Γ(3) Γ(2)=6⋅12⋅1=3{}_2F_1(1,2;4;1)=\dfrac{\Gamma(4)\,\Gamma(1)}{\Gamma(3)\,\Gamma(2)}=\dfrac{6\cdot1}{2\cdot1}=\mathbf{3}.

Step 3. Cross-check by summing the series. With (1)n=n!(1)_n=n!, (2)n=(n+1)!(2)_n=(n+1)!, (4)n=(n+3)!/6(4)_n=(n+3)!/6, the term is tn=n! (n+1)![(n+3)!/6] n!=6(n+1)!(n+3)!=6(n+2)(n+3)t_n=\dfrac{n!\,(n+1)!}{[(n+3)!/6]\,n!}=\dfrac{6(n+1)!}{(n+3)!}=\dfrac{6}{(n+2)(n+3)}. The messy factorials collapse to a simple rational term.

Step 4. Telescope: 6(n+2)(n+3)=6 ⁣(1n+2−1n+3)\dfrac{6}{(n+2)(n+3)}=6\!\left(\dfrac{1}{n+2}-\dfrac{1}{n+3}\right), so ∑n=0∞tn=6⋅12=3\sum_{n=0}^{\infty}t_n=6\cdot\dfrac{1}{2}=\mathbf{3}, matching Step 2. Both routes give 2F1(1,2;4;1)=3{}_2F_1(1,2;4;1)=3, a clean check that the closed form and the raw series are the same object.

2 · A Legendre polynomial as a terminating ₂F₁

Show that the Legendre polynomial identity Pn(x)=2F1 ⁣(−n,n+1;1;1−x2)P_n(x)={}_2F_1\!\big(-n,n+1;1;\tfrac{1-x}{2}\big) reproduces P2(x)=12(3x2−1)P_2(x)=\tfrac12(3x^2-1), illustrating termination.

Step 1. Set n=2n=2 and u=1−x2u=\tfrac{1-x}{2}, so we evaluate 2F1(−2,3;1;u){}_2F_1(-2,3;1;u). Because the upper parameter −2-2 is a non-positive integer, (−2)k=0(-2)_k=0 for k>2k>2: the series terminates after three terms — this is termination in action.

Step 2. Compute the three coefficients. k=0k=0: 11. k=1k=1: (−2)(3)1=−6\dfrac{(-2)(3)}{1}=-6. k=2k=2: (−2)2(3)2(1)2 2!=(2)(12)(2)(2)=6\dfrac{(-2)_2(3)_2}{(1)_2\,2!}=\dfrac{(2)(12)}{(2)(2)}=6. So 2F1(−2,3;1;u)=1−6u+6u2{}_2F_1(-2,3;1;u)=1-6u+6u^2.

Step 3. Substitute u=1−x2u=\tfrac{1-x}{2}: 1−3(1−x)+32(1−x)2=−12+32x2=12(3x2−1)1-3(1-x)+\tfrac32(1-x)^2=-\tfrac12+\tfrac32x^2=\mathbf{\tfrac12(3x^2-1)}. This is exactly P2(x)P_2(x), and spot-checks confirm it: P2(1)=1P_2(1)=1, P2(0)=−12P_2(0)=-\tfrac12, P2(−1)=1P_2(-1)=1 — the correct normalization and parity.

Step 4. The general lesson: every classical orthogonal polynomial is a terminating hypergeometric function, so its coefficients, recurrence, and generating function all descend from the single machinery of pFq{}_pF_q.

Physics of the portrait

The generalized hypergeometric function is where two centuries of special-function theory converge on one notation — a through-line from Euler's manipulations of series, to Gauss's rigorous convergence theory, to the confluent and multi-parameter completions of the twentieth century.

Origins · 1 minCarl Friedrich Gauss and how this was discovered
CF
Carl Friedrich Gauss
1777–1855 · the hypergeometric series and its convergence theory

Gauss did not invent the hypergeometric series — Euler had written down 2F1{}_2F_1 and its integral in the 1700s, and the name traces to Wallis — but it was Gauss who, in his 1812 memoir Disquisitiones generales circa seriem infinitam, made it a rigorous object. He introduced the notation F(a,b;c;z)F(a,b;c;z), proved the summation theorem that still bears his name, and gave one of the first genuinely careful convergence analyses in the history of analysis, at a time when infinite series were routinely manipulated on faith. His motivation was practical: the series interpolates an enormous range of functions relevant to celestial mechanics and geodesy, and a single set of identities (the contiguous relations he catalogued) let him compute them all. The generalization came afterward — Kummer analyzed the confluent 1F1{}_1F_1 in 1836, Riemann recast the theory via monodromy in 1857, Barnes and Pochhammer built the contour-integral machinery around 1900, and the notation pFq{}_pF_q crystallized in the twentieth century. But the conceptual spine — that a vast catalogue of functions is one series governed by its parameters, and that convergence is to be proved rather than assumed — is Gauss's, and it is why his name still labels both the central function and its most-used identity.

History
1769
— Euler writes ₂F₁ and derives its integral representation
1812
— Gauss proves the summation theorem and gives a rigorous convergence analysis
1836
— Kummer develops the confluent function ₁F₁ and its transformations
1857
— Riemann recasts the theory via monodromy and the P-symbol
1907
— Barnes and Pochhammer build the contour-integral representations of ₚFq

Going further

Texts. Arfken & Weber, Mathematical Methods for Physicists, ch. 13–14 (hypergeometric and confluent hypergeometric functions) · Hassani, Mathematical Physics, chapters on complex analysis and ODEs with regular singular points · Stone & Goldbart, Mathematics for Physics, on the hypergeometric equation and special functions · Byron & Fuller, Mathematics of Classical and Quantum Physics, on series solutions and special functions · Nakahara, Geometry, Topology and Physics (for the monodromy viewpoint on the hypergeometric equation) · Abramowitz & Stegun, Handbook of Mathematical Functions, ch. 15 · NIST Digital Library of Mathematical Functions, ch. 16. Key anchor results: 2F1(1,2;4;1)=3{}_2F_1(1,2;4;1)=3 (confirmed both from Gauss's theorem and by telescoping the series ∑6/[(n+2)(n+3)]\sum 6/[(n+2)(n+3)]); P2(x)=12(3x2−1)P_2(x)=\tfrac12(3x^2-1) from the terminating 2F1(−2,3;1;1−x2){}_2F_1(-2,3;1;\tfrac{1-x}{2}); the convergence trichotomy follows from the ratio test on (3), consistent with the term-magnitude curves in the first figure. No nonstandard numerical values are asserted.

Prerequisites. The Gamma Function · Analytic Continuation and Poles of the Gamma Function · The Beta Function. Leads to. Bessel Functions of the First and Second Kind · Legendre Polynomials · Orthogonal Polynomials: General Theory · Recurrence Relations for Special Functions.

Ask the tutor: Ask me to specialize pFq{}_pF_q to any function you name — Bessel, Legendre, Coulomb, or your own series — and I will read off its parameters, tell you where it converges, and show you which mechanism (termination or confluence) produced it.

What actually makes a series "hypergeometric" rather than just any power series?

The single defining test is on the ratio of consecutive terms. Form tn+1/tnt_{n+1}/t_n; if it is a rational function of nn — a polynomial in nn over a polynomial in nn — the series is hypergeometric, full stop. Factor top and bottom into linear pieces (n+ai)(n+a_i) and (n+bj)(n+b_j), remember the factor (n+1)(n+1) that is always present (it makes the 1/n!1/n!), and read the parameter lists straight off. The geometric series (tn+1/tn=t_{n+1}/t_n= const) and the exponential (tn+1/tn=z/(n+1)t_{n+1}/t_n=z/(n+1)) are the simplest cases, 1F0{}_1F_0 and 0F0{}_0F_0. A series whose term ratio is sin⁡n\sin n or 2n2^{n} is not hypergeometric and does not fit the framework.

Why does convergence depend only on p versus q, and not on the parameter values?

Because convergence is about how fast terms shrink as n→∞n\to\infty, and in that limit only the leading power of nn survives. Each numerator factor (n+ai)(n+a_i) contributes one power of nn, and each denominator factor — including the always-present (n+1)(n+1) — contributes one power. So ∣tn+1/tn∣|t_{n+1}/t_n| behaves like n p−(q+1)∣z∣n^{\,p-(q+1)}|z|, and the constants ai,bja_i,b_j affect only subleading corrections, not the exponent. If p<q+1p<q+1 the ratio drives to zero for every zz (entire); if p=q+1p=q+1 it tends to ∣z∣|z| (radius 11); if p>q+1p>q+1 it diverges (radius 00). The parameters do control the boundary behaviour on ∣z∣=1|z|=1 through the excess s=∑bj−∑ais=\sum b_j-\sum a_i, but the radius itself is pure counting.

What is confluence, and why does it turn algebra into transcendence?

Confluence is letting a parameter run to infinity while rescaling the argument to keep terms finite — for example lim⁡b→∞2F1(a,b;c;z/b)=1F1(a;c;z)\lim_{b\to\infty}{}_2F_1(a,b;c;z/b)={}_1F_1(a;c;z). Geometrically, the Gauss equation has three regular singular points at z=0,1,∞z=0,1,\infty; the limit slides the singularity at z=1z=1 out to infinity, where it merges with the one already there. Two regular singular points colliding produce an irregular one — and that is the whole difference: solutions near a regular singular point behave algebraically (powers, logarithms), while near an irregular point they can behave transcendentally, growing or decaying exponentially or oscillating like Bessel functions. Confluence is the analytic bridge from the algebraic world of 2F1{}_2F_1 to the transcendental world of Bessel, Airy, and Kummer functions.

How does the hypergeometric ODE relate to "regular singular points" from series-solution theory?

When you solve a second-order linear ODE by Frobenius series, you classify its singular points as ordinary, regular-singular, or irregular-singular. The remarkable fact is that every second-order linear ODE with exactly three regular singular points can be mapped, by a change of variable and an elementary prefactor, onto the Gauss equation with singular points at 0,1,∞0,1,\infty. That is why Legendre's, Chebyshev's, and Jacobi's equations are all 2F1{}_2F_1 in disguise: each has three regular singular points. The generalized equation (5) extends this to order max⁡(p,q+1)\max(p,q+1), and its singularity structure — one regular point at the origin, and a point at infinity that is regular or irregular depending on pp vs q+1q+1 — is precisely what the convergence trichotomy reflects analytically.

Why does energy quantization show up as "termination" of a series?

Solving the radial Schrödinger equation for the Coulomb or oscillator problem by a power series, the physical solution is a confluent function 1F1(a;c;ρ){}_1F_1(a;c;\rho) whose upper parameter aa depends on the energy EE. For a generic energy the series does not terminate, and its large-ρ\rho behaviour grows like eρe^{\rho}, overwhelming the bound state's decaying prefactor and making the wavefunction non-normalizable. The only escape is to force the series to terminate — to become a polynomial — which happens exactly when aa is a non-positive integer −nr-n_r. That condition, solved for EE, is the quantization rule, and the terminating 1F1{}_1F_1 is a multiple of an associated Laguerre polynomial. So the discrete spectrum and the orthogonal polynomials are the same fact: the demand that an upper parameter be a negative integer.

Is ₂F₀ useless because it has zero radius of convergence?

Not at all — it is one of the most useful divergent series in physics, read as an asymptotic expansion rather than a convergent sum. 2F0{}_2F_0 appears in the large-argument expansions of the error function, the exponential integral, and 1F1{}_1F_1; its partial sums approximate those functions extremely well before the terms, which eventually grow factorially, turn around and diverge. The art is optimal truncation: stop at the smallest term, and the error is roughly that term. This is how special functions are computed for large real arguments in practice, and it is the same structure behind the far-field expansions of Hankel functions. "Zero radius of convergence" is a warning about how to use the series, not a verdict that it is worthless.

Before this

Where this leads