Asymptotic expansion (Taylor approximation)

-

In many situations, the remainder term in the finite Taylor (Maclaurin) expansion is unimportant. To denote that some terms are not as important as others, we introduce a new notation of great convenience called the "little o." Using this little o notation, we define the asymptotic expansion, which is (almost) the same as the finite Taylor expansion except that the remainder term is replaced by the little o term.



See also: Taylor's theorem

Definition (Landau's asymptotic (``little \(o\)'') notation)

Let \(f(x)\) and \(g(x)\) be functions defined in the neighbor of \(x=a\). If
\[\lim_{x\to a}\frac{f(x)}{g(x)} = 0,\]
then, we write
\[f(x) = o(g(x)) ~~ (x \to a).\]
This ``\(o\)'' is called Landau's symbol} (or ``little o''), and this notation is called Landau's notation (or little-o notation).
Remark. When an equation involves Landau's symbol, it does not represent exact equality. □

Example. 
  1. \(f(x) = o(1) ~ (x \to a)\) means \(\lim_{x\to a}\frac{f(x)}{1} = \lim_{x\to a}f(x) = 0\).
  2. \(f(x) = 2x^2 + o(x^2) ~ (x \to 0)\) means that there exists some function \(h(x)\) such that \(f(x) = 2x^2 + h(x)\) and \(\lim_{x\to 0}\frac{h(x)}{x^2} = 0\).
□

Theorem (Asymptotic expansion)

Let \(f(x)\) be a \(C^n\) function defined on an open interval containing \(a\). Then
\[f(x) = f(a) + f'(a)(x-a) + \frac{f''(a)}{2}(x-a)^2 + \cdots + \frac{f^{(n)}(a)}{n!}(x-a)^n + o((x-a)^n) ~~ (x \to a).\]
The above expansion is called the asymptotic expansion of \(f(x)\) at \(x=a\).
Proof. For simplicity, we prove the case when \(a = 0\).
The finite Taylor expansion gives
\[ \begin{eqnarray*} f(x) &=& f(0) + f'(0)x + \frac{f''(0)}{2}x^2 + \cdots + \frac{f^{(n-1)}(0)}{(n-1)!}x^{n-1} + \frac{f^{(n)}(\theta x)}{n!}x^{n}\\ &=& f(0) + f'(0)x + \frac{f''(0)}{2}x^2 + \cdots + \frac{f^{(n-1)}(0)}{(n-1)!}x^{n-1} + \frac{f^{(n)}(0)}{n!}x^{n} + g(x) \end{eqnarray*} \]
where \(\theta \in (0,1)\) is a real number dependent on \(x\), and
\[g(x) = \frac{f^{(n)}(\theta x)}{n!}x^{n} - \frac{f^{(n)}(0)}{n!}x^{n} = \frac{f^{(n)}(\theta x) - f^{(n)}(0)}{n!}x^n.\]
Since \(f(x)\) is of class \(C^n\), \(f^{(n)}(x)\) is continuous, which implies that \({f^{(n)}(\theta x) - f^{(n)}(0)} \to 0\) as \(x\to 0\). Therefore
\[\lim_{x\to 0}\frac{g(x)}{x^n} = 0,\]
 and hence \(g(x) = o(x^n) ~ (x\to 0)\). ■

Lemma

As \(x \to 0\), the following hold.
  1. \(x^mo(x^n) = o(x^{m+n})\), \(o(x^m)o(x^n) = o(x^{m+n})\).
  2. \(o(x^m) + o(x^n) = o(x^l)\) where \(l = \min\{m, n\}\).
Proof. 
  1. As \(x \to 0\), \[\frac{x^mo(x^n)}{x^{m+n}} = \frac{o(x^n)}{x^{n}},\] and \[\frac{o(x^m)o(x^n)}{x^{m+n}} = \frac{o(x^m)}{x^{m}}\frac{o(x^n)}{x^{n}} \to 0.\]
  2. Without losing generality, we may assume \(m \leq n\). As \(x\to 0\), \[\frac{o(x^m) + o(x^n)}{x^m} = \frac{o(x^m)}{x^m} + x^{n-m}\frac{o(x^n)}{x^n} \to 0.\]
■

Example. Let us find the 4-th order asymptotic expansion of \((1 + x^2)e^x\) at \(x= 0\). As \(x\to 0\),
\[e^x = 1 + x + \frac{1}{2}x^2 + \frac{1}{6}x^3 + \frac{1}{24}x^4 + o(x^4). \tag{eq:ex1}\]
Since \(e^x = 1 + x + \frac{1}{2}x^2 + o(x^2)\),
\[x^2e^x = x^2 + x^3 + \frac{1}{2}x^4 + o(x^4)\tag{eq:ex2}\]
where we applied the above lemma to have \(x^2o(x^2) = o(x^4)\). Adding both sides of Eqs. (eq:ex1) and (eq:ex2) yields the asymptotic expansion of \((1 + x^2)e^x\)
\[(1 + x^2)e^x = 1 + x + \frac{3}{2}x^2 + \frac{7}{6}x^3 + \frac{13}{24}x^4 + o(x^4)\]
where we applied the above lemma to have \(o(x^4) + o(x^4) = o(x^4)\). □

Example. We can find the limit \(\lim_{x\to 0}\frac{\sin x}{x}\) by asymptotic expansion. Since
\[\sin x = x + o(x)\]
we have
\[\lim_{x\to 0}\frac{\sin x}{x} = \lim_{x\to 0}\frac{x + o(x)}{x} = \lim_{x\to 0}\left(1 + \frac{o(x)}{x}\right) = 1.\]
□


Comments

Post a Comment

Popular posts from this blog

Open sets and closed sets in \(\mathbb{R}^n\)

-
Image
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an  open set  if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is  not  an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
Read more

Euclidean spaces

-
Image
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
Read more

Newton's method

-
Image
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.  Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,  \[\lim_{n\to\infty}c_n = \alpha,\] and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\). Theorem (Newton's method) Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions: \(f(a) < 0\) and \(f(b) > 0\); For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\). Let us define the sequence \(\{c_n\}\) by \[ \begin{eqnarray} c_1 &
Read more