Watson's Lemma

Watson's lemma is the workhorse theorem behind almost every large-parameter asymptotic expansion a physicist ever writes down. Take a Laplace-type integral I(s)=∫0Te−stf(t) dtI(s)=\int_0^T e^{-st}f(t)\,\mathrm{d}t and let s→+∞s\to+\infty. The exponential e−ste^{-st} collapses into an ever-sharper spike pinned at the lower endpoint t=0t=0, so the integral stops caring about the bulk of ff and listens only to how ff behaves as t→0+t\to 0^+. The lemma turns this intuition into an exact recipe: feed in the endpoint expansion f(t)∼∑nantαnf(t)\sim\sum_n a_n t^{\alpha_n}, integrate each monomial against the exponential, and out comes the complete asymptotic series for I(s)I(s), term by term, to all algebraic orders. The engine is localization. Everything past a fixed cutoff, ∫δTe−stf dt\int_\delta^T e^{-st}f\,\mathrm{d}t, is bounded by O(e−sδ)\mathcal{O}(e^{-s\delta}) — exponentially smaller than every power s−ps^{-p}. Such contributions are "beyond all orders": invisible to the power series, yet the seed of the Stokes phenomenon, resurgence, and the exponentially small remainders that make these series asymptotic rather than convergent. That is why Watson's lemma is not a niche trick but the rigorous core shared by Laplace's method for real maxima, the method of steepest descent for complex saddles, and the large-order behaviour of perturbation theory. Each of those methods is, at heart, a change of variables that drags the dominant point to an endpoint and then hands the integral to Watson. The leading term always reproduces the familiar Gaussian estimate; the corrections, and their eventual factorial divergence, are the doorway to optimal truncation and Borel summation.

Key takeaways
  • Watson's lemma gives the full asymptotic expansion as s→∞s\to\infty of Laplace-type integrals ∫0Te−stf(t) dt\int_0^T e^{-st}f(t)\,\mathrm{d}t from the behaviour of ff near the single endpoint t=0t=0.
  • If f(t)∼∑n=0∞antαnf(t)\sim \sum_{n=0}^{\infty} a_n t^{\alpha_n} as t→0+t\to0^+, with −1<α0<α1<α2<⋯-1<\alpha_0<\alpha_1<\alpha_2<\cdots, then I(s)∼∑n=0∞anΓ(αn+1)s−αn−1I(s)\sim \sum_{n=0}^{\infty}a_n\Gamma(\alpha_n+1)s^{-\alpha_n-1}.
  • The recipe: expand the integrand at the endpoint, push the upper limit to ∞\infty, integrate term by term with ∫0∞e−sttα dt=Γ(α+1)/sα+1\int_0^\infty e^{-st}t^\alpha\,\mathrm{d}t=\Gamma(\alpha+1)/s^{\alpha+1}.
  • The output is a Poincaré asymptotic series — generically divergent, because Γ\Gamma grows factorially; only the endpoint enters because the exponential suppresses the interior as O(e−sδ)\mathcal{O}(e^{-s\delta}).
  • It is the rigorous engine inside Laplace's method, steepest descent, Stirling's formula, and the large-argument expansions of the error, Gamma, and Bessel functions.
  • Key idea: For s→∞s\to\infty the factor e−ste^{-st} concentrates the integral at t=0t=0; substitute the endpoint expansion f(t)∼∑antαnf(t)\sim\sum a_n t^{\alpha_n}, integrate each monomial against e−ste^{-st} to get anΓ(αn+1)s−αn−1a_n\Gamma(\alpha_n+1)s^{-\alpha_n-1}, and the sum is the asymptotic expansion of the integral.
The core insight

For s→∞s\to\infty the exponential e−ste^{-st} concentrates the integral at t=0t=0; substitute the endpoint expansion f(t)∼∑antαnf(t)\sim\sum a_n t^{\alpha_n}, integrate each monomial against e−ste^{-st} to get anΓ(αn+1)s−αn−1a_n\Gamma(\alpha_n+1)s^{-\alpha_n-1}, and the sum is the asymptotic expansion of the integral.

Where this lives today

The lemma's descendants run through modern theoretical physics wherever a small parameter meets a large one. In quantum field theory and quantum mechanics, perturbation series are asymptotic, not convergent — Dyson's argument for QED and the Bender–Wu analysis of the anharmonic oscillator both hinge on the factorial growth Watson's lemma predicts — and the program of resurgence and trans-series reads the exponentially small, beyond-all-orders remainders as instanton and renormalon contributions, turning the "invisible" tail into physics. Numerically, the special-function libraries behind the DLMF and arbitrary-precision packages such as Arb use exponentially-improved (hyperasymptotic) expansions — Watson's lemma sharpened past optimal truncation — to compute Bessel, Airy, and Gamma functions to hundreds of digits. In statistics and machine learning, the "Laplace approximation" to a Bayesian posterior is exactly Derivation B, and its 1/N1/N corrections are Watson's lemma corrections; the same saddle-point machinery evaluates partition functions, densities of states, and many other integrals across mathematical physics.

The physical picture

Think of e−ste^{-st} as a probe whose width is 1/s1/s. For modest ss the probe reaches well into the interval and samples a fat slice of ff; as ss grows it retreats onto the endpoint, and by s=20s=20 it has all but forgotten anything beyond t≈0.05t\approx0.05. Whatever ff does away from the endpoint — a bump or a maximum, for example — is multiplied by an exponentially small weight and is invisible to every algebraic order in 1/s1/s, provided ff remains sufficiently regular on the relevant interval. All that survives is the Taylor-or-Puiseux data of ff at the origin: the coefficients ana_n and exponents αn\alpha_n. The first figure shows the probe collapsing and the width relation Δt∼1/s\Delta t\sim1/s that governs it.

Figure
The exponential probe e^(−st) collapses onto the endpoint as s grows: its e-folding width is Δt≈1/s\Delta t \approx 1/s, so at s=5s = 5 it samples out to t≈0.20t \approx 0.20 but at s=20s = 20 only to t≈0.05t \approx 0.05 — the slowly varying amplitude f(t)f(t) is seen only through its value and derivatives at t = 0
Localization: as s grows, e^(−st) shrinks to a spike of width Δt ≈ 1/s at t = 0 t 1 0 f(t) — slowly varying amplitude only f(0), f′(0), … enter s = 5: Δt ≈ 0.20 s = 20: Δt ≈ 0.05

Because only the endpoint matters, the answer is a sum of powers of 1/s1/s, one per term of the endpoint expansion. But there is a sting in the tail: the coefficients carry Γ(αn+1)\Gamma(\alpha_n+1), which grows factorially, so for any fixed ss the terms shrink, reach a smallest term, and then blow up. The series diverges — and yet, truncated at that smallest term, it is spectacularly accurate. The second figure is the honest portrait of that behaviour for the canonical example ∫0∞e−st/(1+t) dt=esE1(s)\int_0^\infty e^{-st}/(1+t)\,\mathrm{d}t=e^s E_1(s) at s=10s=10: the error of the partial sums plunges to a floor near e−se^{-s} at term N=9N=9, then climbs back out.

Figure
The asymptotic signature for ∫e−st/(1+t) dt=esE1(s)\int e^{-st}/(1+t)\,dt = e^{s}E_{1}(s) at s=10s = 10, whose true value is 0.09156330.0915633: the error of the partial sums Σ(−1)ⁿ n!/sⁿ⁺¹ falls to a minimum of 1.8×10⁻⁵ at the optimal truncation N = 9, right at the least-term floor near e⁻¹⁰ = 4.5×10⁻⁵, then diverges — the fingerprint of a Poincaré series
The punchline: error of the partial sums at s = 10 — a valley, minimum at N = 9 10⁻² 10⁻³ 10⁻⁴ 10⁻⁵ truncation order N |error| of partial sum least-term floor ≈ e⁻¹⁰ = 4.5×10⁻⁵ N = 9 optimal min error 1.8×10⁻⁵ terms shrink terms diverge

The core equations

The object of study is a Laplace-type integral: an amplitude ff weighted by a decaying exponential whose rate ss is the large parameter. The upper limit may be finite or infinite; as we will see, that choice affects nothing at any algebraic order.

I(s)=∫0Te−st f(t) dt,s→+∞(1)I(s)=\int_0^{T} e^{-st}\,f(t)\,\mathrm{d}t,\qquad s\to+\infty \qquad (1)

where: ss — large real parameter (or Re⁡s→∞\operatorname{Re}s\to\infty) governing the asymptotics; f(t)f(t) — an amplitude satisfying the regularity, integrability, and growth conditions required for the integral to exist; TT — upper limit, 0<T≤∞0<T\le\infty. For finite TT, the contribution from any fixed region away from t=0t=0 is exponentially suppressed as s→∞s\to\infty. Reading: the answer is decided in a window of width O(1/s)O(1/s) at the origin. The endpoint expansion is the key local input, but it must be supplemented by conditions ensuring that the remainder and the part away from the endpoint are controlled. The powers need not be integers — half-integers appear, for example, after a quadratic change of variables — but must exceed −1-1 so that the endpoint integrals converge.

f(t)∼∑n=0∞an tαn,t→0+,−1<α0<α1<⋯→∞(2)f(t)\sim\sum_{n=0}^{\infty} a_n\,t^{\alpha_n},\qquad t\to 0^+,\quad -1<\alpha_0<\alpha_1<\cdots\to\infty \qquad (2)

where: ana_n — endpoint coefficients of ff; αn\alpha_n — real exponents, strictly increasing, each >−1>-1 for integrability. Reading: this is a local statement about ff near 00, not a convergent global series. Watson's lemma is the term-by-term image of (2) under the Laplace transform. Each monomial tαnt^{\alpha_n} maps to a single power of 1/s1/s, weighted by a Gamma factor.

  I(s)∼∑n=0∞an Γ(αn+1)s αn+1,s→+∞  (3)\boxed{\;I(s)\sim\sum_{n=0}^{\infty} a_n\,\frac{\Gamma(\alpha_n+1)}{s^{\,\alpha_n+1}},\qquad s\to+\infty\;} \qquad (3)

where: Γ\Gamma — Euler's Gamma function, Γ(z)=∫0∞e−ttz−1dt\Gamma(z)=\int_0^\infty e^{-t}t^{z-1}\mathrm{d}t; ∼\sim — asymptotic equality in the Poincaré sense, so the series may diverge. Reading: the leading term is a0Γ(α0+1) s−α0−1a_0\Gamma(\alpha_0+1)\,s^{-\alpha_0-1}, everything else is a correction one power of 1/s1/s smaller. The one integral that powers the entire lemma is the Laplace transform of a pure monomial. Substituting u=stu=st rescales the spike to unit width and exposes a Gamma function.

∫0∞e−st tα dt1sα+1∫0∞e−uuα du=Γ(α+1)sα+1,Re α>−1(4)\int_0^\infty e^{-st}\,t^{\alpha}\,\mathrm{d}t \overset{u=st}{=} \frac{1}{s^{\alpha+1}}\int_0^\infty e^{-u}u^{\alpha}\,\mathrm{d}u=\frac{\Gamma(\alpha+1)}{s^{\alpha+1}},\qquad \mathrm{Re}\,\alpha>-1 \qquad (4)

where: α\alpha — power of the monomial; α=0\alpha=0 gives 1/s1/s, α=−12\alpha=-\tfrac12 gives π/s\sqrt{\pi/s}, α=n\alpha=n integer gives n!/sn+1n!/s^{n+1}. Reading: this one line, applied to every term of (2), is the lemma. Truncating after N+1N+1 terms leaves an error no larger than the first omitted term. This optimal-error property is what makes a divergent series useful.

∣I(s)−∑n=0NanΓ(αn+1)sαn+1∣=O ⁣(s−αN+1−1),s→∞(5)\left| I(s)-\sum_{n=0}^{N} a_n\frac{\Gamma(\alpha_n+1)}{s^{\alpha_n+1}}\right| = \mathcal{O}\!\left(s^{-\alpha_{N+1}-1}\right),\qquad s\to\infty \qquad (5)

where: NN — truncation order; the bound is the size of the first neglected term; O\mathcal{O} — Landau symbol bounding the remainder. Reading: add terms while they shrink, stop at the smallest, and the leftover error is exponentially small in ss. The most instructive example is the one that diverges the loudest: the shifted geometric amplitude 1/(1+t)1/(1+t), whose endpoint expansion produces alternating factorials. It is the exponential integral E1E_1 in disguise and the integral drawn in the second figure.

∫0∞e−st1+t dt=esE1(s)∼∑n=0∞(−1)n n!sn+1(6)\int_0^\infty \frac{e^{-st}}{1+t}\,\mathrm{d}t=e^{s}E_1(s) \sim \sum_{n=0}^{\infty}\frac{(-1)^n\,n!}{s^{n+1}} \qquad (6)

where: E1(s)=∫s∞e−ww−1dwE_1(s)=\int_s^\infty e^{-w}w^{-1}\mathrm{d}w — exponential integral; n!=Γ(n+1)n!=\Gamma(n+1) — the factorial growth that makes the series diverge for every fixed ss. Reading: at s=10s=10 the true value is 0.09156330.0915633, and the series reproduces it to five figures before falling apart.

Derivation AProof of the lemma by localization and remainder control

The goal is to prove (3) rigorously, not by summing a convergent series — it does not converge — but by controlling the remainder after any finite number of terms. We split the integral at a cutoff δ\delta, show the interior tail is beyond all orders, replace each endpoint monomial by its Gamma value at a cost of one more exponentially small term, and bound what is left by the size of the first omitted power. Because the truncation order NN is arbitrary, the finite sums are then asymptotic to I(s)I(s) in the exact sense of Poincaré. Assume f(t)=∑n=0Nantαn+RN(t)f(t)=\sum_{n=0}^N a_n t^{\alpha_n}+R_N(t) with ∣RN(t)∣≤C tαN+1|R_N(t)|\le C\,t^{\alpha_{N+1}} on [0,δ][0,\delta], and a global growth bound ∣f(t)∣≤Mect|f(t)|\le M e^{ct}.

Step 1. Split at a fixed δ>0\delta>0 chosen inside the region where the endpoint expansion holds, I(s)=∫0δe−stf dt+∫δ∞e−stf dtI(s)=\int_0^{\delta}e^{-st}f\,\mathrm{d}t+\int_{\delta}^{\infty}e^{-st}f\,\mathrm{d}t. Why: it isolates the piece that carries the asymptotics (near 00) from the piece that will turn out to be invisible (the interior).

Step 2. Bound the tail with the global growth estimate,

∣∫δ∞e−stf dt∣≤M∫δ∞e−(s−c)tdt=M e−(s−c)δs−c.\left|\int_\delta^\infty e^{-st}f\,\mathrm{d}t\right|\le M\int_\delta^\infty e^{-(s-c)t}\mathrm{d}t=\frac{M\,e^{-(s-c)\delta}}{s-c}.

Why: for s>cs>c this is O(e−sδ)\mathcal{O}(e^{-s\delta}) — smaller than every power s−ps^{-p}, so it never contributes to the algebraic series. This is the precise meaning of "only the endpoint matters."

Step 3. Integrate each leading monomial over the finite window, extending it to ∞\infty,

∫0δe−stantαndt=anΓ(αn+1)sαn+1−an∫δ∞e−sttαndt.\int_0^{\delta}e^{-st}a_n t^{\alpha_n}\mathrm{d}t = a_n\frac{\Gamma(\alpha_n+1)}{s^{\alpha_n+1}}-a_n\int_\delta^\infty e^{-st}t^{\alpha_n}\mathrm{d}t.

Why: equation (4) supplies the Gamma value exactly, and closing the window to infinity again costs only O(e−sδ)\mathcal{O}(e^{-s\delta}) per term — another beyond-all-orders correction.

Step 4. Bound the remainder with its endpoint estimate,

∣∫0δe−stRN(t) dt∣≤C∫0∞e−sttαN+1 dt=C Γ(αN+1+1)sαN+1+1.\left|\int_0^\delta e^{-st}R_N(t)\,dt\right| \le C\int_0^\infty e^{-st}t^{\alpha_{N+1}}\,dt = C\,\frac{\Gamma(\alpha_{N+1}+1)} {s^{\alpha_{N+1}+1}}.

Why: this is exactly the size of the first omitted term, which establishes the error estimate (5), I−∑n≤N=O(s−αN+1−1)I-\sum_{n\le N}=\mathcal{O}(s^{-\alpha_{N+1}-1}).

Step 5. Conclude: collecting Steps 2–4, I(s)=∑n=0NanΓ(αn+1)s−αn−1+O(s−αN+1−1)I(s)=\sum_{n=0}^{N}a_n\Gamma(\alpha_n+1)s^{-\alpha_n-1}+\mathcal{O}(s^{-\alpha_{N+1}-1}) for every NN. Why: an estimate valid at all NN, each one power sharper than the last, is precisely the definition of the asymptotic series (3) — no convergence is asserted or needed.

Go deeper · Derivation B · 1 minLaplace's method recovered as a change of variables
Derivation BLaplace's method recovered as a change of variables

The goal is to show that Laplace's method — the Gaussian estimate for an integral dominated by an interior maximum of a phase — is nothing but Watson's lemma applied after the right substitution. We centre on the maximum, define a new variable that measures the drop of the phase, invert it to expose a square-root endpoint singularity, and let the lemma deliver the 2π/s\sqrt{2\pi/s} prefactor and its corrections automatically. Take I(s)=∫abesϕ(t)g(t) dtI(s)=\int_a^b e^{s\phi(t)}g(t)\,\mathrm{d}t with a single interior maximum at t0t_0, so ϕ′(t0)=0\phi'(t_0)=0, ϕ′′(t0)<0\phi''(t_0)<0, and g(t0)≠0g(t_0)\ne0.

Step 1. Change variables to the phase drop, u=ϕ(t0)−ϕ(t)≥0u=\phi(t_0)-\phi(t)\ge0, so that near the maximum u≈12∣ϕ′′(t0)∣(t−t0)2u\approx\tfrac12|\phi''(t_0)|(t-t_0)^2. Why: this moves the dominant point to the endpoint u=0u=0 and factors out the fixed exponential esϕ(t0)e^{s\phi(t_0)}, turning the integral into Laplace standard form with rate ss.

Step 2. Invert the quadratic. Because t−t0∝ut-t_0\propto\sqrt{u}, the Jacobian is

dtdu=±12∣ϕ′′(t0)∣ u(1+O(u)).\frac{\mathrm{d}t}{\mathrm{d}u}=\pm\frac{1}{\sqrt{2|\phi''(t_0)|\,u}}\bigl(1+\mathcal{O}(\sqrt{u})\bigr).

Why: the square root is the crucial feature — the interior maximum produces a u−1/2u^{-1/2} endpoint singularity, exactly the half-integer power Watson's lemma feeds on.

Step 3. Assemble the standard form, summing the two branches t≷t0t\gtrless t_0,

I(s)=esϕ(t0)∫0Ue−su g~(u) du,g~(u)∼g(t0)2∣ϕ′′(t0)∣ u−1/2+⋯ .I(s)=e^{s\phi(t_0)}\int_0^{U} e^{-su}\,\tilde g(u)\,\mathrm{d}u,\qquad \tilde g(u)\sim\frac{g(t_0)\sqrt2}{\sqrt{|\phi''(t_0)|}}\,u^{-1/2}+\cdots.

Why: both halves of the contour contribute the same u−1/2u^{-1/2} coefficient, so summing them doubles it — the factor 2\sqrt2 that ultimately builds the 2π2\pi.

Step 4. Apply the lemma to the leading half-power via (4),

∫0∞e−suu−1/2du=Γ(1/2)s1/2=πs.\int_0^\infty e^{-su}u^{-1/2}\mathrm{d}u=\frac{\Gamma(1/2)}{s^{1/2}}=\sqrt{\frac{\pi}{s}}.

Why: Γ(1/2)=π\Gamma(1/2)=\sqrt\pi is where the ubiquitous π\sqrt\pi of Gaussian integrals enters — it is not put in by hand, it is the value of the Gamma building block at α=−12\alpha=-\tfrac12.

Step 5. Collect the pieces,

I(s)∼esϕ(t0) g(t0)2∣ϕ′′(t0)∣πs=g(t0) esϕ(t0)2πs ∣ϕ′′(t0)∣.I(s)\sim e^{s\phi(t_0)}\,\frac{g(t_0)\sqrt2}{\sqrt{|\phi''(t_0)|}}\sqrt{\frac{\pi}{s}}=g(t_0)\,e^{s\phi(t_0)}\sqrt{\frac{2\pi}{s\,|\phi''(t_0)|}}.

Why: this is the textbook Laplace formula, and the higher terms of g~(u)\tilde g(u) generate the O(1/s)\mathcal{O}(1/s) corrections with no extra effort — Watson's lemma delivers the whole series, not just the leading term.

Go deeper · Derivation C · 1 minStirling's series from the Gamma integral
Derivation CStirling's series from the Gamma integral

The goal is to earn Stirling's approximation Γ(s+1)∼2πs sse−s\Gamma(s+1)\sim\sqrt{2\pi s}\,s^s e^{-s} as a one-line consequence of the previous derivation, showing that the most famous asymptotic formula in mathematics is a Watson's-lemma calculation in disguise. We write the Gamma function as a Laplace integral, rescale so the large parameter sits in the exponent, read off the maximum data, and apply the Gaussian prefactor. Start from the integral representation Γ(s+1)=∫0∞e−tts dt\Gamma(s+1)=\int_0^\infty e^{-t}t^{s}\,\mathrm{d}t.

Step 1. Rescale t=sτt=s\tau to pull ss into the exponent,

Γ(s+1)=ss+1∫0∞es(ln⁡τ−τ) dτ.\Gamma(s+1)=s^{s+1}\int_0^\infty e^{s(\ln\tau-\tau)}\,\mathrm{d}\tau.

Why: now it is in Laplace form ∫esψ(τ)dτ\int e^{s\psi(\tau)}\mathrm{d}\tau with phase ψ(τ)=ln⁡τ−τ\psi(\tau)=\ln\tau-\tau and unit amplitude, ready for the previous derivation.

Step 2. Locate and characterise the maximum: ψ′(τ)=1/τ−1=0\psi'(\tau)=1/\tau-1=0 at τ=1\tau=1, with ψ(1)=−1\psi(1)=-1 and ψ′′(1)=−1/τ2∣1=−1\psi''(1)=-1/\tau^2\big|_{1}=-1. Why: the curvature ∣ψ′′(1)∣=1|\psi''(1)|=1 is exactly what enters the Gaussian prefactor, and ψ(1)=−1\psi(1)=-1 supplies the e−se^{-s}.

Step 3. Apply the Laplace leading term with g≡1g\equiv1,

∫0∞esψ(τ)dτ∼esψ(1)2πs∣ψ′′(1)∣=e−s2πs.\int_0^\infty e^{s\psi(\tau)}\mathrm{d}\tau\sim e^{s\psi(1)}\sqrt{\frac{2\pi}{s|\psi''(1)|}}=e^{-s}\sqrt{\frac{2\pi}{s}}.

Why: this is Step 5 of the Laplace derivation specialised to this phase — no new work, just substitution of the maximum data.

Step 4. Multiply back the prefactor ss+1s^{s+1},

Γ(s+1)∼ss+1e−s2πs=2πs sse−s(1+112s+⋯ ).\Gamma(s+1)\sim s^{s+1}e^{-s}\sqrt{\frac{2\pi}{s}}=\sqrt{2\pi s}\,s^{s}e^{-s}\left(1+\frac{1}{12s}+\cdots\right).

Why: carrying the full endpoint expansion of g~(u)\tilde g(u) through the lemma produces the 1/(12s)1/(12s) correction and every term beyond it — the famous Stirling series, which is itself divergent, closing the loop with the second figure.

Limiting cases

The shape of the answer is dictated entirely by the endpoint exponent α0\alpha_0 and by whether the exponents are integer or fractional. The four cases below cover essentially every integral a physicist meets.

CaseResultMeaning
Analytic integrand, f(0)≠0f(0)\ne0f∼∑nf(n)(0)n!tn  ⇒  I(s)∼∑nf(n)(0)sn+1f\sim\sum_n \frac{f^{(n)}(0)}{n!}t^n\;\Rightarrow\;I(s)\sim\sum_n\frac{f^{(n)}(0)}{s^{n+1}}Integer powers give Γ(n+1)=n!\Gamma(n+1)=n!, which cancels the Taylor denominator; leading term f(0)/sf(0)/s.
Half-integer endpoint (post-Laplace)f∼t−1/2∑ncntn  ⇒  I(s)∼∑ncnΓ(n+12)sn+1/2f\sim t^{-1/2}\sum_n c_n t^n\;\Rightarrow\;I(s)\sim\sum_n c_n\frac{\Gamma(n+\tfrac12)}{s^{n+1/2}}Arises after a quadratic change of variables; the n=0n=0 term is the π/s\sqrt{\pi/s} Gaussian prefactor.
Algebraic endpoint singularityf∼a tα, −1<α<0  ⇒  I(s)∼a Γ(α+1)sα+1f\sim a\,t^{\alpha},\ -1<\alpha<0\;\Rightarrow\;I(s)\sim a\,\frac{\Gamma(\alpha+1)}{s^{\alpha+1}}An integrable singularity still works; the leading power s−α−1s^{-\alpha-1} decays slower than 1/s1/s.
Finite vs infinite upper limit∫0T=∫0∞+O(e−sT)\int_0^T=\int_0^\infty+\mathcal{O}(e^{-sT})Replacing TT by ∞\infty costs only an exponentially small, beyond-all-orders correction — the algebraic series is identical.

Worked examples

1 · The canonical divergent series, checked against the true value

Evaluate the asymptotics of I(s)=∫0∞e−st/(1+t) dtI(s)=\int_0^\infty e^{-st}/(1+t)\,\mathrm{d}t and test the series numerically at s=10s=10, where the exact value is I(10)=e10E1(10)=0.0915633I(10)=e^{10}E_1(10)=0.0915633.

Step 1. Expand the amplitude at the endpoint: 1/(1+t)=∑n=0∞(−1)ntn1/(1+t)=\sum_{n=0}^\infty(-1)^n t^n for ∣t∣<1|t|<1. Only the local endpoint expansion is needed for the asymptotic series, so the finite radius of convergence does not prevent its use; Watson's lemma uses the endpoint coefficients and the resulting local asymptotic expansion, not the global convergence of the Taylor series.

Step 2. Apply the lemma term by term with ∫0∞e−sttndt=n!/sn+1\int_0^\infty e^{-st}t^n\mathrm{d}t=n!/s^{n+1}, giving I(s)∼∑n=0∞(−1)n n! / sn+1=1s−1s2+2s3−6s4+⋯I(s)\sim\sum_{n=0}^\infty(-1)^n\,n!\,/\,s^{n+1}=\tfrac1s-\tfrac1{s^2}+\tfrac{2}{s^3}-\tfrac{6}{s^4}+\cdots. The alternating factorials guarantee divergence for every fixed ss.

Step 3. Evaluate the partial sums at s=10s=10. The terms are 0.1, −0.01, +0.002, −0.0006, …0.1,\,-0.01,\,+0.002,\,-0.0006,\,\ldots; successive sums are S0=0.1000S_0=0.1000, S2=0.0920S_2=0.0920, S4=0.09164S_4=0.09164, S6=0.091592S_6=0.091592, closing in on 0.09156330.0915633. The term magnitudes n!/10n+1n!/10^{n+1} shrink until n≈9n\approx9, where the least term is ≈3.6×10−5≈e−10\approx3.6\times10^{-5}\approx e^{-10}.

Step 4. Read off the optimal truncation. The smallest error occurs at N=9N=9: S9=0.0915456S_9=0.0915456, an error of 1.8×10−51.8\times10^{-5} — right at the least-term floor, matching the valley in the second figure. Beyond N=9N=9 the sums diverge. As a bonus, averaging the two straddling sums, 12(S9+S10)=0.0915638\tfrac12(S_9+S_{10})=0.0915638, sharpens the error to ≈4×10−7\approx4\times10^{-7} — a first taste of superasymptotics.

Result: the series ∑(−1)nn!/sn+1\sum(-1)^n n!/s^{n+1} is asymptotic to esE1(s)e^s E_1(s); at s=10s=10 optimal truncation at N=9N=9 gives 0.091550.09155 against the true 0.091560.09156, error 1.8×10−5≈e−s1.8\times10^{-5}\approx e^{-s}.

2 · A half-integer endpoint

Find the first three terms of ∫0∞e−st(1+t)−1/2 dt\int_0^\infty e^{-st}(1+t)^{-1/2}\,\mathrm{d}t as s→∞s\to\infty.

Step 1. Expand at the endpoint by the binomial series: (1+t)−1/2=1−12t+38t2−516t3+⋯(1+t)^{-1/2}=1-\tfrac12 t+\tfrac38 t^2-\tfrac{5}{16}t^3+\cdots, so a0=1, a1=−12, a2=38a_0=1,\ a_1=-\tfrac12,\ a_2=\tfrac38 with integer exponents αn=n\alpha_n=n.

Step 2. Apply the lemma, tn↦n!/sn+1t^n\mapsto n!/s^{n+1}: the integral ∼1s−121!s2+382!s3−⋯=1s−12s2+34s3−⋯\sim\dfrac{1}{s}-\dfrac12\dfrac{1!}{s^2}+\dfrac38\dfrac{2!}{s^3}-\cdots=\dfrac1s-\dfrac{1}{2s^2}+\dfrac{3}{4s^3}-\cdots.

Step 3. Read the leading behaviour: I(s)∼1/sI(s)\sim1/s, with a −1/(2s2)-1/(2s^2) first correction. Result: I(s)∼s−1−12s−2+34s−3−⋯I(s)\sim s^{-1}-\tfrac12 s^{-2}+\tfrac34 s^{-3}-\cdots, leading term 1/s1/s. (Had the amplitude been t−1/2(1+t)−1/2t^{-1/2}(1+t)^{-1/2} instead, the exponents would be half-integers and Γ(1/2)=π\Gamma(1/2)=\sqrt\pi would surface, exactly as in Laplace's method.)

Physics of the portrait

Watson's lemma carries the name of a mathematician who spent his life computing the asymptotics of special functions and who distilled, from the theory of Bessel and parabolic-cylinder functions, the single clean statement that now underlies the whole subject.

Origins · 1 minGeorge Neville Watson and how this was discovered
GN
George Neville Watson
1886–1965 · asymptotic analysis and special functions

George Neville Watson was an English mathematician whose work became central to the asymptotic analysis of special functions. With E. T. Whittaker he wrote A Course of Modern Analysis, the book from which generations of physicists first learned contour integration, Gamma and hypergeometric functions, and asymptotics; and alone he wrote A Treatise on the Theory of Bessel Functions, still the definitive reference a century on. The lemma emerged from that world. In studying the large-argument behaviour of Bessel and parabolic-cylinder functions, Watson repeatedly needed to extract the full asymptotic series of a Laplace-type integral from the endpoint behaviour of its integrand, and in 1918 he isolated the general principle as the compact result now taught in every methods course. He was a fellow of Trinity College, Cambridge and later professor at Birmingham, a meticulous calculator famous for filling in the analytical gaps in Ramanujan's notebooks. What makes the lemma his signature is its character: not a deep existence theorem but a rigorous, ruthlessly practical recipe, exactly the kind of tool a master of special functions would forge. Every time a physicist writes down the leading Gaussian of a saddle point, or the divergent tail of a perturbation series, they are running Watson's 1918 argument.

History
1886
— George Neville Watson born in Westward Ho!, Devon
1915
— Whittaker and Watson's A Course of Modern Analysis appears in its combined edition
1918
— Watson states and proves the lemma while analysing parabolic-cylinder functions
1922
— Watson's A Treatise on the Theory of Bessel Functions is published
1965
— Watson dies in Leamington Spa

Going further

Texts. Bender & Orszag, Advanced Mathematical Methods for Scientists and Engineers, §6.4 (Laplace's method and Watson's lemma) · Olver, Asymptotics and Special Functions, ch. 3 (the rigorous statement and error bounds) · Arfken, Weber & Harris, Mathematical Methods for Physicists, asymptotic-series chapter · Stone & Goldbart, Mathematics for Physics, asymptotics chapter · Hassani, Mathematical Physics, integral-asymptotics sections · Wong, Asymptotic Approximations of Integrals (advanced, definitive). The key checkpoints underlying this article are: the monomial integral ∫0∞e−sttαdt=Γ(α+1)/sα+1\int_0^\infty e^{-st}t^\alpha\mathrm{d}t=\Gamma(\alpha+1)/s^{\alpha+1}; the special values Γ(1/2)=π\Gamma(1/2)=\sqrt\pi and Γ(n+1)=n!\Gamma(n+1)=n!; the tail bound O(e−sδ)\mathcal{O}(e^{-s\delta}); the Laplace leading term 2π/(s∣ϕ′′∣)\sqrt{2\pi/(s|\phi''|)}; Stirling's series Γ(s+1)∼2πs sse−s(1+1/(12s))\Gamma(s+1)\sim\sqrt{2\pi s}\,s^s e^{-s}(1+1/(12s)); and the numerical value of the canonical example, e10E1(10)=0.0915633e^{10}E_1(10)=0.0915633, with least-term error ≈1.8×10−5\approx1.8\times10^{-5} at N=9N=9.

Builds on. Asymptotic Series and Poincaré Expansions · Order Symbols and Gauge Functions · Regular Perturbation Theory. Leads to. Laplace's Method for Integrals · Method of Steepest Descent and Saddle Points · Optimal Truncation and Superasymptotics · Stokes Phenomenon and Anti-Stokes Lines.

Ask the tutor: Ask me to run Watson's lemma on your own integral — hand me the integrand and I will expand at the endpoint, generate the asymptotic series, and find the optimal truncation for a given ss.

What is the single hypothesis Watson's lemma really needs?

Just one substantive thing: that the amplitude ff has an asymptotic expansion in real powers at the endpoint, f(t)∼∑antαnf(t)\sim\sum a_n t^{\alpha_n} with each αn>−1\alpha_n>-1, plus a mild global growth bound ∣f∣≤Mect|f|\le M e^{ct} so the integral converges. The powers need not be integers and the expansion need not converge — it only has to be asymptotic as t→0+t\to0^+. Everything else in the lemma follows mechanically. This is why the result is so widely applicable: almost any function you meet, including ones with integrable singularities like t−1/2t^{-1/2}, satisfies it.

Why can I replace the upper limit T by infinity for free?

Because the exponential does the policing. The interior piece ∫δTe−stf dt\int_\delta^T e^{-st}f\,\mathrm{d}t is bounded by O(e−sδ)\mathcal{O}(e^{-s\delta}), and extending the limit from TT (or from δ\delta) out to ∞\infty adds only more of the same exponentially small quantity. Every such term is "beyond all orders" — smaller than s−ps^{-p} for every power pp — so it cannot appear in an algebraic asymptotic series. The power series you get for finite TT and for T=∞T=\infty are therefore identical. The difference is real, but it lives in the exponentially small remainder, which is the province of the Stokes phenomenon, not of Watson's lemma.

How is this different from just Taylor-expanding and integrating?

Operationally it looks the same — expand, integrate term by term — but the justification is completely different, and that difference is the whole point. A Taylor expansion is a statement about a convergent neighbourhood; here the endpoint series usually diverges, and the integrand's Taylor series may even have a smaller radius of convergence than the integration range. Watson's lemma does not require convergence anywhere. It certifies the answer through a remainder bound at each finite order (equation 5), so the divergent series is nonetheless asymptotically correct. Blindly "Taylor expanding and integrating" gives the right terms by luck; the lemma tells you exactly what those terms mean and how big the error is.

What does it mean to "truncate optimally," and why not add more terms?

For a fixed ss, the term magnitudes ∣an∣Γ(αn+1)/sαn+1|a_n|\Gamma(\alpha_n+1)/s^{\alpha_n+1} first decrease, reach a smallest term, and then grow without bound. The best you can do is stop at that smallest term — "optimal truncation" — where the error is roughly the size of the least term, which is exponentially small in ss (of order e−se^{-s} in the canonical example). Adding terms past the minimum makes the approximation strictly worse. If you need still more accuracy you do not sum further; you switch to superasymptotics or Borel summation, which resum the divergent tail and can beat the exponential floor.

How does Watson's lemma connect to Laplace's method and steepest descent?

They are the same computation wearing different clothes. Laplace's method handles ∫esϕ(t)g dt\int e^{s\phi(t)}g\,\mathrm{d}t with ϕ\phi peaked at an interior point; the substitution u=ϕ(t0)−ϕ(t)u=\phi(t_0)-\phi(t) moves that peak to the endpoint and turns the integral into Watson's standard form, where the quadratic maximum shows up as a u−1/2u^{-1/2} endpoint singularity (Derivation B). Steepest descent is the complex-contour version: after deforming a contour integral ∫esh(z)g dz\int e^{s h(z)}g\,\mathrm{d}z onto the path of steepest descent through a saddle z0z_0, the local variable u=h(z0)−h(z)u=h(z_0)-h(z) again produces Laplace standard form, and Watson's lemma generates the full series. In both, subdominant saddles contribute exponentially small terms — the Stokes phenomenon.

Where do the divergent perturbation series of physics fit in?

Right at the heart of it. Many quantities in quantum mechanics and field theory are integrals of Laplace or steepest-descent type in a large parameter (an inverse coupling, an action, a particle number), so their perturbation series are exactly the asymptotic series Watson's lemma produces — divergent, with factorially growing coefficients. The modern theory of resurgence reads the exponentially small remainder — the part Watson's lemma discards — as instanton and renormalon effects, reconstructing non-perturbative physics from the divergence of the perturbative series.

Does the lemma work if the exponent α₀ is negative?

Yes, as long as α0>−1\alpha_0>-1 so the integral converges at the origin. A negative exponent means an integrable endpoint singularity, f(t)∼a tα0f(t)\sim a\,t^{\alpha_0} with −1<α0<0-1<\alpha_0<0, and the leading term is then a Γ(α0+1)/sα0+1a\,\Gamma(\alpha_0+1)/s^{\alpha_0+1}, which decays more slowly than 1/s1/s. The half-integer case α0=−1/2\alpha_0=-1/2 is the most important in practice because it is what a quadratic maximum produces after the Laplace substitution, and it brings in Γ(1/2)=π\Gamma(1/2)=\sqrt\pi. The only forbidden case is α0≤−1\alpha_0\le-1: there the integral diverges at the endpoint and the lemma does not apply until you regularise.

Before this

Where this leads