Math 2.0

Approximations and expansions Asymptotic approximations and expansions Lemma

Watson's lemma

Builds on Asymptotic expansionLaplace transformGamma function

Statement

Let 0<T≤∞0 < T \le \infty, let λ>−1\lambda > -1, and let f ⁣:(0,T)→ℂf \colon (0, T) \to \C be measurable. Assume that:

  1. ff has the asymptotic expansion f(t)∼∑n≥0antn+λf(t) \sim \sum_{n \ge 0} a_n t^{n + \lambda} as t→0+t \to 0^+, with complex ana_n.
  2. There is a real number x0x_0 such that ∫0Te−x0t∣f(t)∣ dt<∞\int_0^T e^{-x_0 t} \abs{f(t)} \, dt < \infty.

Then the integral F(x)=∫0Te−xtf(t) dtF(x) = \int_0^T e^{-xt} f(t) \, dt converges absolutely for every x≥x0x \ge x_0, and F(x)∼∑n≥0anΓ(n+λ+1)xn+λ+1as x→+∞,F(x) \sim \sum_{n \ge 0} a_n \frac{\Gamma(n + \lambda + 1)}{x^{n + \lambda + 1}} \quad \text{as } x \to +\infty, where Γ\Gamma is the gamma function.

Remarks

Idea of the proof: for xx large, the factor e−xte^{-xt} makes the integral over [δ,T)[\delta, T) exponentially small in xx, for any fixed δ>0\delta > 0. On (0,δ)(0, \delta), replace ff by its first NN terms plus an error bounded by CtN+λC t^{N + \lambda}. Each term gives ∫0∞e−xttn+λ dt=Γ(n+λ+1)x−n−λ−1\int_0^\infty e^{-xt} t^{n + \lambda} \, dt = \Gamma(n + \lambda + 1) x^{-n-\lambda-1}, up to an exponentially small change, and the error contributes O(x−N−λ−1)O(x^{-N-\lambda-1}). Example: ∫0∞e−xt1+t dt∼∑n≥0(−1)nn!xn+1\int_0^\infty \frac{e^{-xt}}{1 + t} \, dt \sim \sum_{n \ge 0} (-1)^n \frac{n!}{x^{n+1}}, a divergent series obtained from 11+t=∑(−1)ntn\frac{1}{1+t} = \sum (-1)^n t^n near 00. The condition λ>−1\lambda > -1 is needed: if λ≤−1\lambda \le -1 and a0≠0a_0 \ne 0, then ∣f(t)∣\abs{f(t)} is of order tλt^{\lambda} near 00 and the integral diverges at t=0t = 0.

Going deeper

For a student

The lemma gives the large-xx behaviour of the Laplace transform F(x)F(x) of ff from the small-tt behaviour of ff. Together with a change of variables it yields Laplace's method and the method of steepest descent for integrals ∫exϕ(t)g(t) dt\int e^{x \phi(t)} g(t) \, dt. The resulting series often diverge, and Borel summation can be seen as the inverse process that recovers FF from its series.

Reading path

To understand this page from the ground up, read these 27 pages in order. The foundations come first.

Show the path as a graph
Big O notation, definition, no evidence levelBig O notationdefinitionFunction, concept, no evidence levelFunctionconceptLimit point of a set, definition, no evidence levelLimit point of a setdefinitionPartition of an interval, definition, no evidence levelPartition of an inter…definitionSequence, definition, no evidence levelSequencedefinitionLittle o notation, definition, no evidence levelLittle o notationdefinitionLaplace transform, definition, no evidence levelLaplace transformdefinitionLimit of a function, definition, no evidence levelLimit of a functiondefinitionMesh of a partition, definition, no evidence levelMesh of a partitiondefinitionRiemann sum, definition, no evidence levelRiemann sumdefinitionReal sequence, definition, no evidence levelReal sequencedefinitionAsymptotic expansion, definition, no evidence levelAsymptotic expansiondefinitionLimit at infinity, definition, no evidence levelLimit at infinitydefinitionOne-sided limit, definition, no evidence levelOne-sided limitdefinitionRiemann integrable function, definition, no evidence levelRiemann integrable fu…definitionBounded sequence, definition, no evidence levelBounded sequencedefinitionLimit of a sequence, definition, no evidence levelLimit of a sequencedefinitionMonotone sequence, definition, no evidence levelMonotone sequencedefinitionRiemann integral, definition, no evidence levelRiemann integraldefinitionMonotone convergence theorem for sequences, statement, no evidence levelMonotone convergence …statementDefinite integral, definition, no evidence levelDefinite integraldefinitionImproper integral, definition, no evidence levelImproper integraldefinitionOne-sided limits of a monotone function exist, statement, no evidence levelOne-sided limits of a…statementMonotonicity of the integral, statement, no evidence levelMonotonicity of the i…statementComparison test for improper integrals, statement, no evidence levelComparison test for i…statementGamma function, definition, no evidence levelGamma functiondefinitionWatson's lemma, statement, no evidence levelWatson's lemmastatement
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Big O notation definition
  2. Function concept
  3. Limit point of a set definition
  4. Partition of an interval definition
  5. Sequence definition
  6. Little o notation definition
  7. Laplace transform definition
  8. Limit of a function definition
  9. Mesh of a partition definition
  10. Riemann sum definition
  11. Real sequence definition
  12. Asymptotic expansion definition
  13. Limit at infinity definition
  14. One-sided limit definition
  15. Riemann integrable function definition
  16. Bounded sequence definition
  17. Limit of a sequence definition
  18. Monotone sequence definition
  19. Riemann integral definition
  20. Monotone convergence theorem for sequences statement
  21. Definite integral definition
  22. Improper integral definition
  23. One-sided limits of a monotone function exist statement
  24. Monotonicity of the integral statement
  25. Comparison test for improper integrals statement
  26. Gamma function definition
  27. Watson's lemma statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Watson%27s_lemma
About this page
TagBW830VCE98
URIm2://BW830VCE98
Kindstatement, lemma
WritingW0 stub
MSC41A60, 44A10, 30E15
StatusThis copy of the site has no build data. Run m2 status BW830VCE98.
AboutAsymptotic expansion, Laplace transform
UsesAsymptotic expansion, Laplace transform, Gamma function
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.