Math 2.0

Approximations and expansions Definition

Asymptotic expansion

Builds on Little o notation

Definition

Let DD be a subset of ℝ\R or of ℂ\C, and let x0x_0 be a limit point of DD, possibly ∞\infty. An asymptotic sequence at x0x_0 is a sequence of functions φ0,φ1,φ2,…\varphi_0, \varphi_1, \varphi_2, \ldots on DD such that φn+1(x)=o(φn(x))as x→x0 in D\varphi_{n+1}(x) = o(\varphi_n(x)) \quad \text{as } x \to x_0 \text{ in } D for each n≥0n \ge 0, where oo is little o notation. Let ff be a function on DD and let a0,a1,a2,…a_0, a_1, a_2, \ldots be complex numbers. The formal series ∑n≥0anφn\sum_{n \ge 0} a_n \varphi_n is an asymptotic expansion of ff at x0x_0 if for each N≥0N \ge 0 f(x)−∑n=0Nanφn(x)=o(φN(x))as x→x0 in D.f(x) - \sum_{n=0}^{N} a_n \varphi_n(x) = o(\varphi_N(x)) \quad \text{as } x \to x_0 \text{ in } D. This is written f(x)∼∑n≥0anφn(x)f(x) \sim \sum_{n \ge 0} a_n \varphi_n(x) as x→x0x \to x_0.

Remarks

Example: on D=(1,∞)D = (1, \infty) with x0=∞x_0 = \infty and φn(x)=x−n−1\varphi_n(x) = x^{-n-1}, one has 1x−1∼∑n≥0x−n−1\frac{1}{x-1} \sim \sum_{n \ge 0} x^{-n-1}. Check: 1x−1−∑n=0Nx−n−1=x−N−1x−1\frac{1}{x-1} - \sum_{n=0}^{N} x^{-n-1} = \frac{x^{-N-1}}{x-1}, and this is o(x−N−1)o(x^{-N-1}) because 1x−1→0\frac{1}{x-1} \to 0. Non-example: φ0(x)=x−1\varphi_0(x) = x^{-1}, φ1(x)=x−1\varphi_1(x) = x^{-1} is not an asymptotic sequence at ∞\infty, because φ1=o(φ0)\varphi_1 = o(\varphi_0) fails. For a fixed asymptotic sequence, the coefficients are unique: aNa_N is the limit of (f(x)−∑n<Nanφn(x))/φN(x)\big(f(x) - \sum_{n<N} a_n \varphi_n(x)\big)/\varphi_N(x) as x→x0x \to x_0, whenever φN\varphi_N does not vanish near x0x_0. Different functions can have the same expansion: e−xe^{-x} and 00 both have the zero expansion in powers of x−1x^{-1} as x→+∞x \to +\infty. The most common case is the power scale φn(x)=x−n\varphi_n(x) = x^{-n} at ∞\infty or φn(z)=zn\varphi_n(z) = z^n at 00; an equivalent condition is then that the error after NN terms is O(x−N−1)O(x^{-N-1}), respectively O(zN+1)O(z^{N+1}).

Reading path

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

Show the path as a graph
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. Little o notation definition
  3. Asymptotic expansion definition

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Asymptotic_expansion
About this page
TagB53THC8F79
URIm2://B53THC8F79
Kinddefinition
WritingW0 stub
MSC41A60, 30E15, 34E05
DefinesAsymptotic expansion
UsesLittle o notation
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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

Used by