Taylor's theorem

The exponential function ${\textstyle y=e^{x}}$ (red) and the corresponding Taylor polynomial of degree four (dashed green) around the origin.

In calculus, Taylor's theorem gives an approximation of a ${\textstyle k}$-times differentiable function around a given point by a polynomial of degree ${\textstyle k}$, called the ${\textstyle k}$-th-order Taylor polynomial. For a smooth function, the Taylor polynomial is the truncation at the order ${\textstyle k}$ of the Taylor series of the function. The first-order Taylor polynomial is the linear approximation of the function, and the second-order Taylor polynomial is often referred to as the quadratic approximation. There are several versions of Taylor's theorem, some giving explicit estimates of the approximation error of the function by its Taylor polynomial.

Taylor's theorem is named after the mathematician Brook Taylor, who stated a version of it in 1715, although an earlier version of the result was already mentioned in 1671 by James Gregory.

Taylor's theorem is taught in introductory-level calculus courses and is one of the central elementary tools in mathematical analysis. It gives simple arithmetic formulas to accurately compute values of many transcendental functions such as the exponential function and trigonometric functions. It is the starting point of the study of analytic functions, and is fundamental in various areas of mathematics, as well as in numerical analysis and mathematical physics. Taylor's theorem also generalizes to multivariate and vector valued functions. It provided the mathematical basis for some landmark early computing machines: Charles Babbage's Difference Engine calculated sines, cosines, logarithms, and other transcendental functions by numerically integrating the first 7 terms of their Taylor series.

Motivation

Graph of ${\textstyle f(x)=e^{x}}$ (blue) with its linear approximation ${\textstyle P_{1}(x)=1+x}$ (red) at ${\textstyle a=0}$.

If a real-valued function ${\textstyle f(x)}$ is differentiable at the point ${\textstyle x=a}$, then it has a linear approximation near this point. This means that there exists a function h₁(x) such that

$$f(x)=f(a)+f'(a)(x-a)+h_{1}(x)(x-a),\quad \lim _{x\to a}h_{1}(x)=0.$$

Here

$$P_{1}(x)=f(a)+f'(a)(x-a)$$

is the linear approximation of ${\textstyle f(x)}$ for x near the point a, whose graph ${\textstyle y=P_{1}(x)}$ is the tangent line to the graph ${\textstyle y=f(x)}$ at x = a. The error in the approximation is: $$R_{1}(x)=f(x)-P_{1}(x)=h_{1}(x)(x-a).$$

As x tends to a, this error goes to zero much faster than $f'(a)(x{-}a)$, making $f(x)\approx P_{1}(x)$ a useful approximation.

Graph of ${\textstyle f(x)=e^{x}}$ (blue) with its quadratic approximation $P_{2}(x)=1+x+{\dfrac {x^{2}}{2}}$ (red) at ${\textstyle a=0}$. Note the improvement in the approximation.

For a better approximation to ${\textstyle f(x)}$, we can fit a quadratic polynomial instead of a linear function:

$$P_{2}(x)=f(a)+f'(a)(x-a)+{\frac {f''(a)}{2}}(x-a)^{2}.$$

Instead of just matching one derivative of ${\textstyle f(x)}$ at ${\textstyle x=a}$, this polynomial has the same first and second derivatives, as is evident upon differentiation.

Taylor's theorem ensures that the quadratic approximation is, in a sufficiently small neighborhood of ${\textstyle x=a}$, more accurate than the linear approximation. Specifically,

$$f(x)=P_{2}(x)+h_{2}(x)(x-a)^{2},\quad \lim _{x\to a}h_{2}(x)=0.$$

Here the error in the approximation is

$$R_{2}(x)=f(x)-P_{2}(x)=h_{2}(x)(x-a)^{2},$$

which, given the limiting behavior of $h_{2}$, goes to zero faster than $(x-a)^{2}$ as x tends to a.

Approximation of ${\textstyle f(x)={\dfrac {1}{1+x^{2}}}}$ (blue) by its Taylor polynomials ${\textstyle P_{k}}$ of order ${\textstyle k=1,\ldots ,16}$ centered at ${\textstyle x=0}$ (red) and ${\textstyle x=1}$ (green). The approximations do not improve at all outside $(-1,1)$ and ${\textstyle (1-{\sqrt {2}},1+{\sqrt {2}})}$, respectively.

Similarly, we might get still better approximations to f if we use polynomials of higher degree, since then we can match even more derivatives with f at the selected base point.

In general, the error in approximating a function by a polynomial of degree k will go to zero much faster than $(x-a)^{k}$ as x tends to a. However, there are functions, even infinitely differentiable ones, for which increasing the degree of the approximating polynomial does not increase the accuracy of approximation: we say such a function fails to be analytic at x = a: it is not (locally) determined by its derivatives at this point.

Taylor's theorem is of asymptotic nature: it only tells us that the error ${\textstyle R_{k}}$ in an approximation by a ${\textstyle k}$-th order Taylor polynomial P_k tends to zero faster than any nonzero ${\textstyle k}$-th degree polynomial as ${\textstyle x\to a}$. It does not tell us how large the error is in any concrete neighborhood of the center of expansion, but for this purpose there are explicit formulas for the remainder term (given below) which are valid under some additional regularity assumptions on f. These enhanced versions of Taylor's theorem typically lead to uniform estimates for the approximation error in a small neighborhood of the center of expansion, but the estimates do not necessarily hold for neighborhoods which are too large, even if the function f is analytic. In that situation one may have to select several Taylor polynomials with different centers of expansion to have reliable Taylor-approximations of the original function (see animation on the right.)

There are several ways we might use the remainder term:

1. Estimate the error for a polynomial P_k(x) of degree k estimating ${\textstyle f(x)}$ on a given interval (a – r, a + r). (Given the interval and degree, we find the error.)
2. Find the smallest degree k for which the polynomial P_k(x) approximates ${\textstyle f(x)}$ to within a given error tolerance on a given interval (a − r, a + r) . (Given the interval and error tolerance, we find the degree.)
3. Find the largest interval (a − r, a + r) on which P_k(x) approximates ${\textstyle f(x)}$ to within a given error tolerance. (Given the degree and error tolerance, we find the interval.)

Taylor's theorem in one real variable

Statement of the theorem

The precise statement of the most basic version of Taylor's theorem is as follows:

Taylor's theorem — Let k ≥ 1 be an integer and let the function f : R → R be k times differentiable at the point a ∈ R. Then there exists a function h_k : R → R such that

$$f(x)=f(a)+f'(a)(x-a)+{\frac {f''(a)}{2!}}(x-a)^{2}+\cdots +{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}+h_{k}(x)(x-a)^{k},$$ and $$\lim _{x\to a}h_{k}(x)=0.$$ This is called the Peano form of the remainder.

The polynomial appearing in Taylor's theorem is the ${\textstyle {\boldsymbol {k}}}$-th order Taylor polynomial

$$P_{k}(x)=f(a)+f'(a)(x-a)+{\frac {f''(a)}{2!}}(x-a)^{2}+\cdots +{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}$$

of the function f at the point a. The Taylor polynomial is the unique "asymptotic best fit" polynomial in the sense that if there exists a function h_k : R → R and a ${\textstyle k}$-th order polynomial p such that

$$f(x)=p(x)+h_{k}(x)(x-a)^{k},\quad \lim _{x\to a}h_{k}(x)=0,$$

then p = P_k. Taylor's theorem describes the asymptotic behavior of the remainder term

$$R_{k}(x)=f(x)-P_{k}(x),$$

which is the approximation error when approximating f with its Taylor polynomial. Using the little-o notation, the statement in Taylor's theorem reads as

$$R_{k}(x)=o(|x-a|^{k}),\quad x\to a.$$

Explicit formulas for the remainder

Under stronger regularity assumptions on f there are several precise formulas for the remainder term R_k of the Taylor polynomial, the most common ones being the following.

Mean-value forms of the remainder — Let f : R → R be k + 1 times differentiable on the open interval with f^(k) continuous on the closed interval between ${\textstyle a}$ and ${\textstyle x}$. Then

$$R_{k}(x)={\frac {f^{(k+1)}(\xi _{L})}{(k+1)!}}(x-a)^{k+1}$$

for some real number ${\textstyle \xi _{L}}$ between ${\textstyle a}$ and ${\textstyle x}$. This is the Lagrange form of the remainder.

Similarly,

$$R_{k}(x)={\frac {f^{(k+1)}(\xi _{C})}{k!}}(x-\xi _{C})^{k}(x-a)$$

for some real number ${\textstyle \xi _{C}}$ between ${\textstyle a}$ and ${\textstyle x}$. This is the Cauchy form of the remainder.

Both can be thought of as specific cases of the following result: Consider $p>0$

$$R_{k}(x)={\frac {f^{(k+1)}(\xi _{S})}{k!}}(x-\xi _{S})^{k+1-p}{\frac {(x-a)^{p}}{p}}$$ for some real number ${\textstyle \xi _{S}}$ between ${\textstyle a}$ and ${\textstyle x}$. This is the Schlömilch form of the remainder (sometimes called the Schlömilch-Roche). The choice ${\textstyle p=k+1}$ is the Lagrange form, whilst the choice ${\textstyle p=1}$ is the Cauchy form.

These refinements of Taylor's theorem are usually proved using the mean value theorem, whence the name. Additionally, notice that this is precisely the mean value theorem when ${\textstyle k=0}$. Also other similar expressions can be found. For example, if G(t) is continuous on the closed interval and differentiable with a non-vanishing derivative on the open interval between ${\textstyle a}$ and ${\textstyle x}$, then

$$R_{k}(x)={\frac {f^{(k+1)}(\xi )}{k!}}(x-\xi )^{k}{\frac {G(x)-G(a)}{G'(\xi )}}$$

for some number ${\textstyle \xi }$ between ${\textstyle a}$ and ${\textstyle x}$. This version covers the Lagrange and Cauchy forms of the remainder as special cases, and is proved below using Cauchy's mean value theorem. The Lagrange form is obtained by taking $G(t)=(x-t)^{k+1}$ and the Cauchy form is obtained by taking $G(t)=t-a$.

The statement for the integral form of the remainder is more advanced than the previous ones, and requires understanding of Lebesgue integration theory for the full generality. However, it holds also in the sense of Riemann integral provided the (k + 1)th derivative of f is continuous on the closed interval [a,x].

Integral form of the remainder — Let ${\textstyle f^{(k)}}$ be absolutely continuous on the closed interval between ${\textstyle a}$ and ${\textstyle x}$. Then

$$R_{k}(x)=\int _{a}^{x}{\frac {f^{(k+1)}(t)}{k!}}(x-t)^{k}\,dt.$$

Due to the absolute continuity of f^(k) on the closed interval between ${\textstyle a}$ and ${\textstyle x}$, its derivative f^(k+1) exists as an L¹-function, and the result can be proven by a formal calculation using the fundamental theorem of calculus and integration by parts.

Estimates for the remainder

It is often useful in practice to be able to estimate the remainder term appearing in the Taylor approximation, rather than having an exact formula for it. Suppose that f is (k + 1)-times continuously differentiable in an interval I containing a. Suppose that there are real constants q and Q such that

$$q\leq f^{(k+1)}(x)\leq Q$$

throughout I. Then the remainder term satisfies the inequality

$$q{\frac {(x-a)^{k+1}}{(k+1)!}}\leq R_{k}(x)\leq Q{\frac {(x-a)^{k+1}}{(k+1)!}},$$

if x > a, and a similar estimate if x < a. This is a simple consequence of the Lagrange form of the remainder. In particular, if

$$|f^{(k+1)}(x)|\leq M$$

on an interval I = (a − r,a + r) with some $r>0$ , then

$$|R_{k}(x)|\leq M{\frac {|x-a|^{k+1}}{(k+1)!}}\leq M{\frac {r^{k+1}}{(k+1)!}}$$

for all x∈(a − r,a + r). The second inequality is called a uniform estimate, because it holds uniformly for all x on the interval (a − r,a + r).

Example

Approximation of ${\textstyle e^{x}}$ (blue) by its Taylor polynomials $P_{k}$ of order ${\textstyle k=1,\ldots ,7}$ centered at ${\textstyle x=0}$ (red).

Suppose that we wish to find the approximate value of the function ${\textstyle f(x)=e^{x}}$ on the interval ${\textstyle [-1,1]}$ while ensuring that the error in the approximation is no more than 10⁻⁵. In this example we pretend that we only know the following properties of the exponential function:

$e^{0}=1,\qquad {\frac {d}{dx}}e^{x}=e^{x},\qquad e^{x}>0,\qquad x\in \mathbb {R} .$ (★)

From these properties it follows that ${\textstyle f^{(k)}(x)=e^{x}}$ for all ${\textstyle k}$, and in particular, ${\textstyle f^{(k)}(0)=1}$. Hence the ${\textstyle k}$-th order Taylor polynomial of ${\textstyle f}$ at ${\textstyle 0}$ and its remainder term in the Lagrange form are given by

$$P_{k}(x)=1+x+{\frac {x^{2}}{2!}}+\cdots +{\frac {x^{k}}{k!}},\qquad R_{k}(x)={\frac {e^{\xi }}{(k+1)!}}x^{k+1},$$

where ${\textstyle \xi }$ is some number between 0 and x. Since e^x is increasing by (★), we can simply use ${\textstyle e^{x}\leq 1}$ for ${\textstyle x\in [-1,0]}$ to estimate the remainder on the subinterval $[-1,0]$. To obtain an upper bound for the remainder on $[0,1]$, we use the property ${\textstyle e^{\xi }<e^{x}}$ for ${\textstyle 0<\xi <x}$ to estimate

$$e^{x}=1+x+{\frac {e^{\xi }}{2}}x^{2}<1+x+{\frac {e^{x}}{2}}x^{2},\qquad 0<x\leq 1$$

using the second order Taylor expansion. Then we solve for e^x to deduce that

$$e^{x}\leq {\frac {1+x}{1-{\frac {x^{2}}{2}}}}=2{\frac {1+x}{2-x^{2}}}\leq 4,\qquad 0\leq x\leq 1$$

simply by maximizing the numerator and minimizing the denominator. Combining these estimates for e^x we see that

$$|R_{k}(x)|\leq {\frac {4|x|^{k+1}}{(k+1)!}}\leq {\frac {4}{(k+1)!}},\qquad -1\leq x\leq 1,$$

so the required precision is certainly reached, when

$${\frac {4}{(k+1)!}}<10^{-5}\quad \Longleftrightarrow \quad 4\cdot 10^{5}<(k+1)!\quad \Longleftrightarrow \quad k\geq 9.$$

(See factorial or compute by hand the values ${\textstyle 9!=362880}$ and ${\textstyle 10!=3628800}$.) As a conclusion, Taylor's theorem leads to the approximation

$$e^{x}=1+x+{\frac {x^{2}}{2!}}+\cdots +{\frac {x^{9}}{9!}}+R_{9}(x),\qquad |R_{9}(x)|<10^{-5},\qquad -1\leq x\leq 1.$$

For instance, this approximation provides a decimal expression $e\approx 2.71828$, correct up to five decimal places.

Relationship to analyticity

Taylor expansions of real analytic functions

Let I ⊂ R be an open interval. By definition, a function f : I → R is real analytic if it is locally defined by a convergent power series. This means that for every a ∈ I there exists some r > 0 and a sequence of coefficients c_k ∈ R such that (a − r, a + r) ⊂ I and

$$f(x)=\sum _{k=0}^{\infty }c_{k}(x-a)^{k}=c_{0}+c_{1}(x-a)+c_{2}(x-a)^{2}+\cdots ,\qquad |x-a|<r.$$

In general, the radius of convergence of a power series can be computed from the Cauchy–Hadamard formula

$${\frac {1}{R}}=\limsup _{k\to \infty }|c_{k}|^{\frac {1}{k}}.$$

This result is based on comparison with a geometric series, and the same method shows that if the power series based on a converges for some b ∈ R, it must converge uniformly on the closed interval ${\textstyle [a-r_{b},a+r_{b}]}$, where ${\textstyle r_{b}=\left\vert b-a\right\vert }$. Here only the convergence of the power series is considered, and it might well be that (a − R,a + R) extends beyond the domain I of f.

The Taylor polynomials of the real analytic function f at a are simply the finite truncations

$$P_{k}(x)=\sum _{j=0}^{k}c_{j}(x-a)^{j},\qquad c_{j}={\frac {f^{(j)}(a)}{j!}}$$

of its locally defining power series, and the corresponding remainder terms are locally given by the analytic functions

$$R_{k}(x)=\sum _{j=k+1}^{\infty }c_{j}(x-a)^{j}=(x-a)^{k}h_{k}(x),\qquad |x-a|<r.$$

Here the functions

$${\begin{aligned}&h_{k}:(a-r,a+r)\to \mathbb {R} \\[1ex]&h_{k}(x)=(x-a)\sum _{j=0}^{\infty }c_{k+1+j}\left(x-a\right)^{j}\end{aligned}}$$

are also analytic, since their defining power series have the same radius of convergence as the original series. Assuming that [a − r, a + r] ⊂ I and r < R, all these series converge uniformly on (a − r, a + r). Naturally, in the case of analytic functions one can estimate the remainder term ${\textstyle R_{k}(x)}$ by the tail of the sequence of the derivatives f′(a) at the center of the expansion, but using complex analysis also another possibility arises, which is described below.

Taylor's theorem and convergence of Taylor series

The Taylor series of f will converge in some interval in which all its derivatives are bounded and do not grow too fast as k goes to infinity. (However, even if the Taylor series converges, it might not converge to f, as explained below; f is then said to be non-analytic.)

One might think of the Taylor series

$$f(x)\approx \sum _{k=0}^{\infty }c_{k}(x-a)^{k}=c_{0}+c_{1}(x-a)+c_{2}(x-a)^{2}+\cdots$$

of an infinitely many times differentiable function f : R → R as its "infinite order Taylor polynomial" at a. Now the estimates for the remainder imply that if, for any r, the derivatives of f are known to be bounded over (a − r, a + r), then for any order k and for any r > 0 there exists a constant M_k,r > 0 such that

$|R_{k}(x)|\leq M_{k,r}{\frac {|x-a|^{k+1}}{(k+1)!}}$ (★★)

for every x ∈ (a − r,a + r). Sometimes the constants M_k,r can be chosen in such way that M_k,r is bounded above, for fixed r and all k. Then the Taylor series of f converges uniformly to some analytic function

$${\begin{aligned}&T_{f}:(a-r,a+r)\to \mathbb {R} \\&T_{f}(x)=\sum _{k=0}^{\infty }{\frac {f^{(k)}(a)}{k!}}\left(x-a\right)^{k}\end{aligned}}$$

(One also gets convergence even if M_k,r is not bounded above as long as it grows slowly enough.)

The limit function T_f is by definition always analytic, but it is not necessarily equal to the original function f, even if f is infinitely differentiable. In this case, we say f is a non-analytic smooth function, for example a flat function:

$${\begin{aligned}&f:\mathbb {R} \to \mathbb {R} \\&f(x)={\begin{cases}e^{-{\frac {1}{x^{2}}}}&x>0\\0&x\leq 0.\end{cases}}\end{aligned}}$$

Using the chain rule repeatedly by mathematical induction, one shows that for any order k,

$$f^{(k)}(x)={\begin{cases}{\frac {p_{k}(x)}{x^{3k}}}\cdot e^{-{\frac {1}{x^{2}}}}&x>0\\0&x\leq 0\end{cases}}$$

for some polynomial p_k of degree 2(k − 1). The function $e^{-{\frac {1}{x^{2}}}}$ tends to zero faster than any polynomial as ${\textstyle x\to 0}$, so f is infinitely many times differentiable and f^(k)(0) = 0 for every positive integer k. The above results all hold in this case:

• The Taylor series of f converges uniformly to the zero function T_f(x) = 0, which is analytic with all coefficients equal to zero.
• The function f is unequal to this Taylor series, and hence non-analytic.
• For any order k ∈ N and radius r > 0 there exists M_k,r > 0 satisfying the remainder bound (★★) above.

However, as k increases for fixed r, the value of M_k,r grows more quickly than r^k, and the error does not go to zero.

Taylor's theorem in complex analysis

Taylor's theorem generalizes to functions f : C → C which are complex differentiable in an open subset U ⊂ C of the complex plane. However, its usefulness is dwarfed by other general theorems in complex analysis. Namely, stronger versions of related results can be deduced for complex differentiable functions f : U → C using Cauchy's integral formula as follows.

Let r > 0 such that the closed disk B(z, r) ∪ S(z, r) is contained in U. Then Cauchy's integral formula with a positive parametrization γ(t) = z + re^it of the circle S(z, r) with $t\in [0,2\pi ]$ gives

$$f(z)={\frac {1}{2\pi i}}\int _{\gamma }{\frac {f(w)}{w-z}}\,dw,\quad f'(z)={\frac {1}{2\pi i}}\int _{\gamma }{\frac {f(w)}{(w-z)^{2}}}\,dw,\quad \ldots ,\quad f^{(k)}(z)={\frac {k!}{2\pi i}}\int _{\gamma }{\frac {f(w)}{(w-z)^{k+1}}}\,dw.$$

Here all the integrands are continuous on the circle S(z, r), which justifies differentiation under the integral sign. In particular, if f is once complex differentiable on the open set U, then it is actually infinitely many times complex differentiable on U. One also obtains the Cauchy's estimates

$$|f^{(k)}(z)|\leq {\frac {k!}{2\pi }}\int _{\gamma }{\frac {M_{r}}{|w-z|^{k+1}}}\,dw={\frac {k!M_{r}}{r^{k}}},\quad M_{r}=\max _{|w-c|=r}|f(w)|$$

for any z ∈ U and r > 0 such that B(z, r) ∪ S(c, r) ⊂ U. These estimates imply that the complex Taylor series

$$T_{f}(z)=\sum _{k=0}^{\infty }{\frac {f^{(k)}(c)}{k!}}(z-c)^{k}$$

of f converges uniformly on any open disk ${\textstyle B(c,r)\subset U}$ with ${\textstyle S(c,r)\subset U}$ into some function T_f. Furthermore, using the contour integral formulas for the derivatives f^(k)(c),

$${\begin{aligned}T_{f}(z)&=\sum _{k=0}^{\infty }{\frac {(z-c)^{k}}{2\pi i}}\int _{\gamma }{\frac {f(w)}{(w-c)^{k+1}}}\,dw\\&={\frac {1}{2\pi i}}\int _{\gamma }{\frac {f(w)}{w-c}}\sum _{k=0}^{\infty }\left({\frac {z-c}{w-c}}\right)^{k}\,dw\\&={\frac {1}{2\pi i}}\int _{\gamma }{\frac {f(w)}{w-c}}\left({\frac {1}{1-{\frac {z-c}{w-c}}}}\right)\,dw\\&={\frac {1}{2\pi i}}\int _{\gamma }{\frac {f(w)}{w-z}}\,dw=f(z),\end{aligned}}$$

so any complex differentiable function f in an open set U ⊂ C is in fact complex analytic. All that is said for real analytic functions here holds also for complex analytic functions with the open interval I replaced by an open subset U ∈ C and a-centered intervals (a − r, a + r) replaced by c-centered disks B(c, r). In particular, the Taylor expansion holds in the form

$$f(z)=P_{k}(z)+R_{k}(z),\quad P_{k}(z)=\sum _{j=0}^{k}{\frac {f^{(j)}(c)}{j!}}(z-c)^{j},$$

where the remainder term R_k is complex analytic. Methods of complex analysis provide some powerful results regarding Taylor expansions. For example, using Cauchy's integral formula for any positively oriented Jordan curve ${\textstyle \gamma }$ which parametrizes the boundary ${\textstyle \partial W\subset U}$ of a region ${\textstyle W\subset U}$, one obtains expressions for the derivatives f^(j)(c) as above, and modifying slightly the computation for T_f(z) = f(z), one arrives at the exact formula

$$R_{k}(z)=\sum _{j=k+1}^{\infty }{\frac {(z-c)^{j}}{2\pi i}}\int _{\gamma }{\frac {f(w)}{(w-c)^{j+1}}}\,dw={\frac {(z-c)^{k+1}}{2\pi i}}\int _{\gamma }{\frac {f(w)\,dw}{(w-c)^{k+1}(w-z)}},\qquad z\in W.$$

The important feature here is that the quality of the approximation by a Taylor polynomial on the region ${\textstyle W\subset U}$ is dominated by the values of the function f itself on the boundary ${\textstyle \partial W\subset U}$. Similarly, applying Cauchy's estimates to the series expression for the remainder, one obtains the uniform estimates

$$|R_{k}(z)|\leq \sum _{j=k+1}^{\infty }{\frac {M_{r}|z-c|^{j}}{r^{j}}}={\frac {M_{r}}{r^{k+1}}}{\frac {|z-c|^{k+1}}{1-{\frac {|z-c|}{r}}}}\leq {\frac {M_{r}\beta ^{k+1}}{1-\beta }},\qquad {\frac {|z-c|}{r}}\leq \beta <1.$$

Example

Complex plot of ${\textstyle f(z)={\frac {1}{1+z^{2}}}}$. Modulus is shown by elevation and argument by coloring: cyan = ${\textstyle 0}$, blue = ${\textstyle {\frac {\pi }{3}}}$, violet = ${\textstyle {\frac {2\pi }{3}}}$, red = $\pi$, yellow = ${\textstyle {\frac {4\pi }{3}}}$, green = ${\textstyle {\frac {5\pi }{3}}}$.

The function

$${\begin{aligned}&f:\mathbb {R} \to \mathbb {R} \\&f(x)={\frac {1}{1+x^{2}}}\end{aligned}}$$

is real analytic, that is, locally determined by its Taylor series. This function was plotted above to illustrate the fact that some elementary functions cannot be approximated by Taylor polynomials in neighborhoods of the center of expansion which are too large. This kind of behavior is easily understood in the framework of complex analysis. Namely, the function f extends into a meromorphic function

$${\begin{aligned}&f:\mathbb {C} \cup \{\infty \}\to \mathbb {C} \cup \{\infty \}\\&f(z)={\frac {1}{1+z^{2}}}\end{aligned}}$$

on the compactified complex plane. It has simple poles at ${\textstyle z=i}$ and ${\textstyle z=-i}$, and it is analytic elsewhere. Now its Taylor series centered at z₀ converges on any disc B(z₀, r) with r < |z − z₀|, where the same Taylor series converges at z ∈ C. Therefore, Taylor series of f centered at 0 converges on B(0, 1) and it does not converge for any z ∈ C with |z| > 1 due to the poles at i and −i. For the same reason the Taylor series of f centered at 1 converges on ${\textstyle B(1,{\sqrt {2}})}$ and does not converge for any z ∈ C with ${\textstyle \left\vert z-1\right\vert >{\sqrt {2}}}$.

Generalizations of Taylor's theorem

Higher-order differentiability

A function f: Rⁿ → R is differentiable at a ∈ Rⁿ if and only if there exists a linear functional L : Rⁿ → R and a function h : Rⁿ → R such that

$$f({\boldsymbol {x}})=f({\boldsymbol {a}})+L({\boldsymbol {x}}-{\boldsymbol {a}})+h({\boldsymbol {x}})\lVert {\boldsymbol {x}}-{\boldsymbol {a}}\rVert ,\qquad \lim _{{\boldsymbol {x}}\to {\boldsymbol {a}}}h({\boldsymbol {x}})=0.$$

If this is the case, then ${\textstyle L=df({\boldsymbol {a}})}$ is the (uniquely defined) differential of f at the point a. Furthermore, then the partial derivatives of f exist at a and the differential of f at a is given by

$$df({\boldsymbol {a}})({\boldsymbol {v}})={\frac {\partial f}{\partial x_{1}}}({\boldsymbol {a}})v_{1}+\cdots +{\frac {\partial f}{\partial x_{n}}}({\boldsymbol {a}})v_{n}.$$

Introduce the multi-index notation

$$|\alpha |=\alpha _{1}+\cdots +\alpha _{n},\quad \alpha !=\alpha _{1}!\cdots \alpha _{n}!,\quad {\boldsymbol {x}}^{\alpha }=x_{1}^{\alpha _{1}}\cdots x_{n}^{\alpha _{n}}$$

for α ∈ Nⁿ and x ∈ Rⁿ. If all the ${\textstyle k}$-th order partial derivatives of f : Rⁿ → R are continuous at a ∈ Rⁿ, then by Clairaut's theorem, one can change the order of mixed derivatives at a, so the short-hand notation

$$D^{\alpha }f={\frac {\partial ^{|\alpha |}f}{\partial {\boldsymbol {x}}^{\alpha }}}={\frac {\partial ^{\alpha _{1}+\ldots +\alpha _{n}}f}{\partial x_{1}^{\alpha _{1}}\cdots \partial x_{n}^{\alpha _{n}}}}$$

for the higher order partial derivatives is justified in this situation. The same is true if all the (k − 1)-th order partial derivatives of f exist in some neighborhood of a and are differentiable at a. Then we say that f is k times differentiable at the point a.

Taylor's theorem for multivariate functions

Using notations of the preceding section, one has the following theorem.

Multivariate version of Taylor's theorem — Let f : Rⁿ → R be a k-times continuously differentiable function at the point a ∈ Rⁿ. Then there exist functions h_α : Rⁿ → R, where $|\alpha |=k,$ such that

$${\begin{aligned}&f({\boldsymbol {x}})=\sum _{|\alpha |\leq k}{\frac {D^{\alpha }f({\boldsymbol {a}})}{\alpha !}}({\boldsymbol {x}}-{\boldsymbol {a}})^{\alpha }+\sum _{|\alpha |=k}h_{\alpha }({\boldsymbol {x}})({\boldsymbol {x}}-{\boldsymbol {a}})^{\alpha },\\&{\mbox{and}}\quad \lim _{{\boldsymbol {x}}\to {\boldsymbol {a}}}h_{\alpha }({\boldsymbol {x}})=0.\end{aligned}}$$

If the function f : Rⁿ → R is k + 1 times continuously differentiable in a closed ball $B=\{\mathbf {y} \in \mathbb {R} ^{n}:\left\|\mathbf {a} -\mathbf {y} \right\|\leq r\}$ for some $r>0$, then one can derive an exact formula for the remainder in terms of (k+1)-th order partial derivatives of f in this neighborhood. Namely,

$${\begin{aligned}&f({\boldsymbol {x}})=\sum _{|\alpha |\leq k}{\frac {D^{\alpha }f({\boldsymbol {a}})}{\alpha !}}({\boldsymbol {x}}-{\boldsymbol {a}})^{\alpha }+\sum _{|\beta |=k+1}R_{\beta }({\boldsymbol {x}})({\boldsymbol {x}}-{\boldsymbol {a}})^{\beta },\\&R_{\beta }({\boldsymbol {x}})={\frac {|\beta |}{\beta !}}\int _{0}^{1}(1-t)^{|\beta |-1}D^{\beta }f{\big (}{\boldsymbol {a}}+t({\boldsymbol {x}}-{\boldsymbol {a}}){\big )}\,dt.\end{aligned}}$$

In this case, due to the continuity of (k+1)-th order partial derivatives in the compact set B, one immediately obtains the uniform estimates

$$\left|R_{\beta }({\boldsymbol {x}})\right|\leq {\frac {1}{\beta !}}\max _{|\alpha |=|\beta |}\max _{{\boldsymbol {y}}\in B}|D^{\alpha }f({\boldsymbol {y}})|,\qquad {\boldsymbol {x}}\in B.$$

Example in two dimensions

For example, the third-order Taylor polynomial of a smooth function $f:\mathbb {R} ^{2}\to \mathbb {R}$ is, denoting ${\boldsymbol {x}}-{\boldsymbol {a}}={\boldsymbol {v}}$,

$${\begin{aligned}P_{3}({\boldsymbol {x}})=f({\boldsymbol {a}})+{}&{\frac {\partial f}{\partial x_{1}}}({\boldsymbol {a}})v_{1}+{\frac {\partial f}{\partial x_{2}}}({\boldsymbol {a}})v_{2}+{\frac {\partial ^{2}f}{\partial x_{1}^{2}}}({\boldsymbol {a}}){\frac {v_{1}^{2}}{2!}}+{\frac {\partial ^{2}f}{\partial x_{1}\partial x_{2}}}({\boldsymbol {a}})v_{1}v_{2}+{\frac {\partial ^{2}f}{\partial x_{2}^{2}}}({\boldsymbol {a}}){\frac {v_{2}^{2}}{2!}}\\&+{\frac {\partial ^{3}f}{\partial x_{1}^{3}}}({\boldsymbol {a}}){\frac {v_{1}^{3}}{3!}}+{\frac {\partial ^{3}f}{\partial x_{1}^{2}\partial x_{2}}}({\boldsymbol {a}}){\frac {v_{1}^{2}v_{2}}{2!}}+{\frac {\partial ^{3}f}{\partial x_{1}\partial x_{2}^{2}}}({\boldsymbol {a}}){\frac {v_{1}v_{2}^{2}}{2!}}+{\frac {\partial ^{3}f}{\partial x_{2}^{3}}}({\boldsymbol {a}}){\frac {v_{2}^{3}}{3!}}\end{aligned}}$$

Proofs

Proof for Taylor's theorem in one real variable

Let

$$h_{k}(x)={\begin{cases}{\frac {f(x)-P(x)}{(x-a)^{k}}}&x\not =a\\0&x=a\end{cases}}$$

where, as in the statement of Taylor's theorem,

$$P(x)=f(a)+f'(a)(x-a)+{\frac {f''(a)}{2!}}(x-a)^{2}+\cdots +{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}.$$

It is sufficient to show that

$$\lim _{x\to a}h_{k}(x)=0.$$

The proof here is based on repeated application of L'Hôpital's rule. Note that, for each ${\textstyle j=0,1,...,k-1}$, $f^{(j)}(a)=P^{(j)}(a)$. Hence each of the first ${\textstyle k-1}$ derivatives of the numerator in $h_{k}(x)$ vanishes at $x=a$, and the same is true of the denominator. Also, since the condition that the function ${\textstyle f}$ be ${\textstyle k}$ times differentiable at a point requires differentiability up to order ${\textstyle k-1}$ in a neighborhood of said point (this is true, because differentiability requires a function to be defined in a whole neighborhood of a point), the numerator and its ${\textstyle k-2}$ derivatives are differentiable in a neighborhood of ${\textstyle a}$. Clearly, the denominator also satisfies said condition, and additionally, doesn't vanish unless ${\textstyle x=a}$, therefore all conditions necessary for L'Hôpital's rule are fulfilled, and its use is justified. So

$${\begin{aligned}\lim _{x\to a}{\frac {f(x)-P(x)}{(x-a)^{k}}}&=\lim _{x\to a}{\frac {{\frac {d}{dx}}(f(x)-P(x))}{{\frac {d}{dx}}(x-a)^{k}}}\\[1ex]&=\cdots \\[1ex]&=\lim _{x\to a}{\frac {{\frac {d^{k-1}}{dx^{k-1}}}(f(x)-P(x))}{{\frac {d^{k-1}}{dx^{k-1}}}(x-a)^{k}}}\\[1ex]&={\frac {1}{k!}}\lim _{x\to a}{\frac {f^{(k-1)}(x)-P^{(k-1)}(x)}{x-a}}\\[1ex]&={\frac {1}{k!}}(f^{(k)}(a)-P^{(k)}(a))=0\end{aligned}}$$

where the second-to-last equality follows by the definition of the derivative at ${\textstyle x=a}$.

Alternate proof for Taylor's theorem in one real variable

Let $f(x)$ be any real-valued continuous function to be approximated by the Taylor polynomial.

Step 1: Let ${\textstyle F}$ and ${\textstyle G}$ be functions. Set ${\textstyle F}$ and ${\textstyle G}$ to be

$${\begin{aligned}F(x)=f(x)-\sum _{k=0}^{n-1}{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}\end{aligned}}$$

$${\begin{aligned}G(x)=(x-a)^{n}\end{aligned}}$$

Step 2: Properties of ${\textstyle F}$ and ${\textstyle G}$:

$${\begin{aligned}F(a)&=f(a)-f(a)-f'(a)(a-a)-...-{\frac {f^{(n-1)}(a)}{(n-1)!}}(a-a)^{n-1}=0\\G(a)&=(a-a)^{n}=0\end{aligned}}$$

Similarly,

$${\begin{aligned}F'(a)=f'(a)-f'(a)-{\frac {f''(a)}{(2-1)!}}(a-a)^{(2-1)}-...-{\frac {f^{(n-1)}(a)}{(n-2)!}}(a-a)^{n-2}=0\end{aligned}}$$

$${\begin{aligned}G'(a)&=n(a-a)^{n-1}=0\\&\qquad \vdots \\G^{(n-1)}(a)&=F^{(n-1)}(a)=0\end{aligned}}$$

Step 3: Use Cauchy Mean Value Theorem

Let $f_{1}$ and $g_{1}$ be continuous functions on $[a,b]$. Since $a<x<b$ so we can work with the interval $[a,x]$. Let $f_{1}$ and $g_{1}$ be differentiable on $(a,x)$. Assume $g_{1}'(x)\neq 0$ for all $x\in (a,b)$. Then there exists $c_{1}\in (a,x)$ such that

$${\begin{aligned}{\frac {f_{1}(x)-f_{1}(a)}{g_{1}(x)-g_{1}(a)}}={\frac {f_{1}'(c_{1})}{g_{1}'(c_{1})}}\end{aligned}}$$

Note: $G'(x)\neq 0$ in $(a,b)$ and $F(a),G(a)=0$ so

$${\begin{aligned}{\frac {F(x)}{G(x)}}={\frac {F(x)-F(a)}{G(x)-G(a)}}={\frac {F'(c_{1})}{G'(c_{1})}}\end{aligned}}$$

for some $c_{1}\in (a,x)$.

This can also be performed for $(a,c_{1})$:

$${\begin{aligned}{\frac {F'(c_{1})}{G'(c_{1})}}={\frac {F'(c_{1})-F'(a)}{G'(c_{1})-G'(a)}}={\frac {F''(c_{2})}{G''(c_{2})}}\end{aligned}}$$

for some $c_{2}\in (a,c_{1})$. This can be continued to $c_{n}$.

This gives a partition in $(a,b)$:

$$a<c_{n}<c_{n-1}<\dots <c_{1}<x$$

with

$${\frac {F(x)}{G(x)}}={\frac {F'(c_{1})}{G'(c_{1})}}=\dots ={\frac {F^{(n)}(c_{n})}{G^{(n)}(c_{n})}}.$$

Set $c=c_{n}$:

$${\frac {F(x)}{G(x)}}={\frac {F^{(n)}(c)}{G^{(n)}(c)}}$$

Step 4: Substitute back

$${\begin{aligned}{\frac {F(x)}{G(x)}}={\frac {f(x)-\sum _{k=0}^{n-1}{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}}{(x-a)^{n}}}={\frac {F^{(n)}(c)}{G^{(n)}(c)}}\end{aligned}}$$

By the Power Rule, repeated derivatives of $(x-a)^{n}$, $G^{(n)}(c)=n(n-1)...1$, so:

$${\frac {F^{(n)}(c)}{G^{(n)}(c)}}={\frac {f^{(n)}(c)}{n(n-1)\cdots 1}}={\frac {f^{(n)}(c)}{n!}}.$$

This leads to:

$${\begin{aligned}f(x)-\sum _{k=0}^{n-1}{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}={\frac {f^{(n)}(c)}{n!}}(x-a)^{n}\end{aligned}}.$$

By rearranging, we get:

$${\begin{aligned}f(x)=\sum _{k=0}^{n-1}{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}+{\frac {f^{(n)}(c)}{n!}}(x-a)^{n}\end{aligned}},$$

or because $c_{n}=a$ eventually:

$$f(x)=\sum _{k=0}^{n}{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}.$$

Derivation for the mean value forms of the remainder

Let G be any real-valued function, continuous on the closed interval between ${\textstyle a}$ and ${\textstyle x}$ and differentiable with a non-vanishing derivative on the open interval between ${\textstyle a}$ and ${\textstyle x}$, and define

$$F(t)=f(t)+f'(t)(x-t)+{\frac {f''(t)}{2!}}(x-t)^{2}+\cdots +{\frac {f^{(k)}(t)}{k!}}(x-t)^{k}.$$

For $t\in [a,x]$. Then, by Cauchy's mean value theorem,

${\frac {F'(\xi )}{G'(\xi )}}={\frac {F(x)-F(a)}{G(x)-G(a)}}$ (★★★)

for some ${\textstyle \xi }$ on the open interval between ${\textstyle a}$ and ${\textstyle x}$. Note that here the numerator ${\textstyle F(x)-F(a)=R_{k}(x)}$ is exactly the remainder of the Taylor polynomial for ${\textstyle y=f(x)}$. Compute

$${\begin{aligned}F'(t)={}&f'(t)+{\big (}f''(t)(x-t)-f'(t){\big )}+\left({\frac {f^{(3)}(t)}{2!}}(x-t)^{2}-{\frac {f^{(2)}(t)}{1!}}(x-t)\right)+\cdots \\&\cdots +\left({\frac {f^{(k+1)}(t)}{k!}}(x-t)^{k}-{\frac {f^{(k)}(t)}{(k-1)!}}(x-t)^{k-1}\right)={\frac {f^{(k+1)}(t)}{k!}}(x-t)^{k},\end{aligned}}$$

plug it into (★★★) and rearrange terms to find that

$$R_{k}(x)={\frac {f^{(k+1)}(\xi )}{k!}}(x-\xi )^{k}{\frac {G(x)-G(a)}{G'(\xi )}}.$$

This is the form of the remainder term mentioned after the actual statement of Taylor's theorem with remainder in the mean value form. The Lagrange form of the remainder is found by choosing $G(t)=(x-t)^{k+1}$ and the Cauchy form by choosing $G(t)=t-a$.

Remark. Using this method one can also recover the integral form of the remainder by choosing

$$G(t)=\int _{a}^{t}{\frac {f^{(k+1)}(s)}{k!}}(x-s)^{k}\,ds,$$

but the requirements for f needed for the use of mean value theorem are too strong, if one aims to prove the claim in the case that f^(k) is only absolutely continuous. However, if one uses Riemann integral instead of Lebesgue integral, the assumptions cannot be weakened.

Derivation for the integral form of the remainder

Due to the absolute continuity of $f^{(k)}$ on the closed interval between ${\textstyle a}$ and ${\textstyle x}$, its derivative $f^{(k+1)}$ exists as an $L^{1}$-function, and we can use the fundamental theorem of calculus and integration by parts. This same proof applies for the Riemann integral assuming that $f^{(k)}$ is continuous on the closed interval and differentiable on the open interval between ${\textstyle a}$ and ${\textstyle x}$, and this leads to the same result than using the mean value theorem.

The fundamental theorem of calculus states that

$$f(x)=f(a)+\int _{a}^{x}\,f'(t)\,dt.$$

Now we can integrate by parts and use the fundamental theorem of calculus again to see that

$${\begin{aligned}f(x)&=f(a)+{\Big (}xf'(x)-af'(a){\Big )}-\int _{a}^{x}tf''(t)\,dt\\&=f(a)+x\left(f'(a)+\int _{a}^{x}f''(t)\,dt\right)-af'(a)-\int _{a}^{x}tf''(t)\,dt\\&=f(a)+(x-a)f'(a)+\int _{a}^{x}\,(x-t)f''(t)\,dt,\end{aligned}}$$

which is exactly Taylor's theorem with remainder in the integral form in the case $k=1$. The general statement is proved using induction. Suppose that

$f(x)=f(a)+{\frac {f'(a)}{1!}}(x-a)+\cdots +{\frac {f^{(k)}(a)}{k!}}(x-a)^{k}+\int _{a}^{x}{\frac {f^{(k+1)}(t)}{k!}}(x-t)^{k}\,dt.$ (eq1)

Integrating the remainder term by parts we arrive at

$${\begin{aligned}\int _{a}^{x}{\frac {f^{(k+1)}(t)}{k!}}(x-t)^{k}\,dt=&-\left[{\frac {f^{(k+1)}(t)}{(k+1)k!}}(x-t)^{k+1}\right]_{a}^{x}+\int _{a}^{x}{\frac {f^{(k+2)}(t)}{(k+1)k!}}(x-t)^{k+1}\,dt\\=&\ {\frac {f^{(k+1)}(a)}{(k+1)!}}(x-a)^{k+1}+\int _{a}^{x}{\frac {f^{(k+2)}(t)}{(k+1)!}}(x-t)^{k+1}\,dt.\end{aligned}}$$

Substituting this into the formula in (eq1) shows that if it holds for the value $k$, it must also hold for the value $k+1$. Therefore, since it holds for $k=1$, it must hold for every positive integer $k$.

Derivation for the remainder of multivariate Taylor polynomials

We prove the special case, where $f:\mathbb {R} ^{n}\to \mathbb {R}$ has continuous partial derivatives up to the order $k+1$ in some closed ball $B$ with center ${\boldsymbol {a}}$. The strategy of the proof is to apply the one-variable case of Taylor's theorem to the restriction of $f$ to the line segment adjoining ${\boldsymbol {x}}$ and ${\boldsymbol {a}}$. Parametrize the line segment between ${\boldsymbol {a}}$ and ${\boldsymbol {x}}$ by ${\boldsymbol {u}}(t)={\boldsymbol {a}}+t({\boldsymbol {x}}-{\boldsymbol {a}})$ We apply the one-variable version of Taylor's theorem to the function $g(t)=f({\boldsymbol {u}}(t))$:

$$f({\boldsymbol {x}})=g(1)=g(0)+\sum _{j=1}^{k}{\frac {1}{j!}}g^{(j)}(0)\ +\ \int _{0}^{1}{\frac {(1-t)^{k}}{k!}}g^{(k+1)}(t)\,dt.$$

Applying the chain rule for several variables gives

$${\begin{aligned}g^{(j)}(t)&={\frac {d^{j}}{dt^{j}}}f({\boldsymbol {u}}(t))\\&={\frac {d^{j}}{dt^{j}}}f({\boldsymbol {a}}+t({\boldsymbol {x}}-{\boldsymbol {a}}))\\&=\sum _{|\alpha |=j}\left({\begin{matrix}j\\\alpha \end{matrix}}\right)(D^{\alpha }f)({\boldsymbol {a}}+t({\boldsymbol {x}}-{\boldsymbol {a}}))({\boldsymbol {x}}-{\boldsymbol {a}})^{\alpha }\end{aligned}}$$

where ${\tbinom {j}{\alpha }}$ is the multinomial coefficient. Since ${\tfrac {1}{j!}}{\tbinom {j}{\alpha }}={\tfrac {1}{\alpha !}}$, we get:

$$f({\boldsymbol {x}})=f({\boldsymbol {a}})+\sum _{1\leq |\alpha |\leq k}{\frac {1}{\alpha !}}(D^{\alpha }f)({\boldsymbol {a}})({\boldsymbol {x}}-{\boldsymbol {a}})^{\alpha }+\sum _{|\alpha |=k+1}{\frac {k+1}{\alpha !}}({\boldsymbol {x}}-{\boldsymbol {a}})^{\alpha }\int _{0}^{1}(1-t)^{k}(D^{\alpha }f)({\boldsymbol {a}}+t({\boldsymbol {x}}-{\boldsymbol {a}}))\,dt.$$

See also

• Hadamard's lemma
• Laurent series – Power series with negative powers
• Padé approximant – 'Best' approximation of a function by a rational function of given order
• Newton series – Discrete analog of a derivativePages displaying short descriptions of redirect targets
• Approximation theory – Theory of getting acceptably close inexact mathematical calculations
• Function approximation – Approximating an arbitrary function with a well-behaved one

References

• Apostol, Tom (1967), Calculus, Wiley, ISBN 0-471-00005-1.
• Apostol, Tom (1974), Mathematical analysis, Addison–Wesley.
• Bartle, Robert G.; Sherbert, Donald R. (2011), Introduction to Real Analysis (4th ed.), Wiley, ISBN 978-0-471-43331-6.
• Hörmander, L. (1976), Linear Partial Differential Operators, Volume 1, Springer, ISBN 978-3-540-00662-6.
• Kline, Morris (1972), Mathematical thought from ancient to modern times, Volume 2, Oxford University Press.
• Kline, Morris (1998), Calculus: An Intuitive and Physical Approach, Dover, ISBN 0-486-40453-6.
• Pedrick, George (1994), A First Course in Analysis, Springer, ISBN 0-387-94108-8.
• Stromberg, Karl (1981), Introduction to classical real analysis, Wadsworth, ISBN 978-0-534-98012-2.
• Rudin, Walter (1987), Real and complex analysis (3rd ed.), McGraw-Hill, ISBN 0-07-054234-1.
• Tao, Terence (2014), Analysis, Volume I (3rd ed.), Hindustan Book Agency, ISBN 978-93-80250-64-9.

External links

• Taylor's theorem at ProofWiki
• Taylor Series Approximation to Cosine at cut-the-knot
• Trigonometric Taylor Expansion interactive demonstrative applet
• Taylor Series Revisited at Holistic Numerical Methods Institute