Taylor polynomials
Linearization
A function \(f(x)\) about \(x = a\) may be linearized into
obtaining a polynomial that matches the value and derivative of \(f\) at \(x = a\).
Taylor's theorem
Even better approximations of \(f(x)\) can be obtained by using higher degree polynomials if \(f^{n+1}(t)\) exists for all \(t\) in an interval containing \(a\) and \(x\). Thereby matching more derivatives at \(x = a\),
Then the error \(E_n(x) = f(x) - P_n(x)\) in the approximation \(f(x) \approx P_n(x)\) is given by
where \(s\) is some number between \(a\) and \(x\). The resulting formula
for some \(s\) between \(a\) and \(x\), is called Taylor's formula with Lagrange remainder; the Lagrange is the error term \(E_n(x)\).
Proof:
Observe that the case \(n=0\) of Taylor's formula, namely
is just the Mean-value theorem for some \(s\) between \(a\) and \(x\)
Using induction to prove for \(n > 0\). Suppose \(n = k-1\) where \(k \geq 1\) is an integer, then
where \(s\) is some number between \(a\) and \(x\). Consider the next higher case: \(n=k\). Applying the Generalized Mean-value theorem to the functions \(E_k(t)\) and \((t-a)^{k+1}\) on \([a,x]\). Since \(E_k(a)=0\), a number \(u\) in \((a,x)\) is obtained such that
Since
is just \(E_{k-1}(u)\) for the function \(f'\) instead of \(f\). By the induction assumption it is equal to
for some \(s\) between \(a\) and \(u\). Therefore,
Big-O notation
\(f(x) = O(u(x))\) for \(x \to a\) if and only if there exists a \(k > 0\) such that
For all \(x\) in the open interval around \(x=a\).
The following properties follow from the definition:
- If \(f(x) = O(u(x))\) as \(x \to a\), then \(Cf(x) = O(u(x))\) as \(x \to a\) for any value of the constant \(C\).
- If \(f(x) = O(u(x))\) as \(x \to a\) and \(g(x) = O(u(x))\) as \(x \to a\), then \(f(x) \pm g(x) = O(u(x))\) as \(x \to a\).
- If \(f(x) = O((x-a)^ku(x))\) as \(x \to a\), then \(\frac{f(x)}{(x-a)^k} = O(u(x))\) as \(x \to a\) for any constant \(k\).
If \(f(x) = Q_n(x) + O((x-a)^{n+1})\) as \(x \to a\), where \(Q_n\) is a polynomial of degree at most \(n\), then \(Q_n(x) = P_n(x)\).
Proof: Follows from the properties of the big-O notation
Let \(P_n\) be the Taylor polynomial, then properties 1 and 2 of big-O imply that \(R_n(x) = Q_n(x) - P_n(x) = O((x - a)^{n+1})\) as \(x \to a\). It must be shown that \(R_n(x)\) is identically zero so that \(Q_n(x) = P_n(x)\) for all \(x\). \(R_n(x)\) may be written in the form
If \(R_n(x)\) is not identically zero, then there is a smallest coefficient \(c_k\) \(k \leq n\), such that \(c_k \neq 0\), but \(c_j = 0\) for \(0 \leq j \leq k -1\)
Therefore,
However, by property 3
Since \(n+1-k > 0\), \(\frac{R_n(x)}{(x-a)^k} \to 0\) as \(x \to a\). This contradiction shows that \(R_n(x)\) must be identically zero.
Maclaurin formulas
Some Maclaurin formulas with errors in big-O notation. These may be used in constructing Taylor polynomials from compsite functions. As \(x \to 0\)
-
\[\frac{1}{1-x} = 1 + x + ... + x^n + O(x^{n+1}),\]
-
\[\ln(1+x) = x - \frac{x^2}{2} + \frac{x^3}{3} - ... + (-1)^{n-1}\frac{x^n}{n} + O(x^{n+1}),\]
-
\[e^x = 1 + x + \frac{x^2}{2!} + ... + \frac{x^n}{n!} + O(x^{n+1}),\]
-
\[\sin x = x - \frac{x^3}{3!} + \frac{x^5}{5!} - ... + (-1)^n\frac{x^{2n+1}}{(2n+1)!} + O(x^{2n+3}),\]
-
\[\cos x = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - ... + (-1)^n\frac{x^{2n}}{(2n)!} + O(x^{2n+1}),\]
-
\[\arctan x = x - \frac{x^3}{3} + \frac{x^5}{5} - ... + (-1)^n\frac{x^{2n+1}}{2n+1} + O(x^{2n+3}).\]
Example
Construct \(P_4(x)\) for \(f(x) = e^{\sin x}\) around \(x=0\).
Evaluating limits with Taylor polynomials
Taylor and Macluarin polynomials provide a method for evaluating limits of indeterminate forms.
Example
Determine the limit \(\lim_{x \to 0} \frac{x \arctan x - \ln(1+x^2)}{x \sin x - x^2}\).
L'Hôpital's rule
Suppose the function \(f\) and \(g\) are differentiable on the interval \((a,b)\), and \(g'(x) \neq 0\) there. Also suppose that \(\lim_{x \downarrow a} f(x) = \lim_{x \downarrow a} g(x) = 0\) then
The outcome is exactly the same as using Taylor polynomials.
Proof: using Taylor polynomials around \(x = a\).
If \(f(a)\) and \(g(a)\) are both zero
enzovoort.