Taylor's Theorem and Error Bounds

Taylor's Theorem approximates smooth functions with polynomials built from derivatives at a point: $P_{n} (x) = \sum_{k = 0}^{n} \frac{f ^{(k)} ( c )}{k !} (x - c)^{k}$
Error bounds quantify the maximum difference between true function and polynomial approximation, converting qualitative statements into rigorous quantitative tools.
Requires $(n + 1)$ times differentiable functions; higher differentiability allows higher-degree polynomial approximations with smaller errors.
Remainder term formulations (Lagrange, Cauchy forms) provide explicit bounds on approximation error for numerical and theoretical applications.
Bridge between abstract functions and concrete polynomials enables practical computation, theoretical proofs, and analysis throughout mathematics.
Historically developed by Brook Taylor (1715), refined by Lagrange and Cauchy in early 19th-century real analysis foundations.

Taylor's Theorem and Error Bounds

Overview

One of the most fundamental ideas in calculus and mathematical analysis is that smooth functions can be approximated by polynomials. Taylor's Theorem makes this idea precise: it tells us that near any point, a sufficiently differentiable function looks like a polynomial, and it quantifies exactly how good this approximation is. This bridges the gap between the abstract world of general functions and the concrete world of polynomials, where calculations are straightforward.

The power of Taylor's Theorem lies not just in providing polynomial approximations, but in giving us rigorous error bounds—formulas that tell us the maximum possible difference between the true function and its polynomial approximation. This transforms a qualitative statement ("functions are approximately polynomials") into a quantitative tool we can use for numerical computation, theoretical analysis, and proving deeper results throughout mathematics.

Historically, the theorem is named after Brook Taylor, who published a version in 1715, though the ideas trace back to work by James Gregory and Isaac Newton. The modern formulation with precise remainder terms emerged through the work of Joseph-Louis Lagrange, Augustin-Louis Cauchy, and others in the early 19th century, as the foundations of real analysis were being rigorously developed.

Taylor's Theorem states that any sufficiently smooth function equals a polynomial (built from its derivatives at a point) plus a precisely quantifiable error term. The error bounds allow us to control approximation quality and are as important as the polynomial itself.

Taylor's Theorem and Error Bounds: Let

f : [a, b] \to R

be a function that is

(n + 1)

times differentiable on the interval

[a, b]

, and let

c \in [a, b]

. The $n$ -th degree Taylor polynomial of

f

centered at

c

is:

P_{n} (x) = k = 0 \sum n \frac{f ^{(k)} ( c )}{k !} (x - c)^{k}

The Taylor remainder (or error) is $R_{n} (x) = f (x) - P_{n} (x)$ . Taylor's Theorem provides exact formulas for this remainder, the most common being:

Lagrange form: $R_{n} (x) = \frac{f ^{(n + 1)} ( ξ )}{( n + 1 )!} (x - c)^{n + 1}$ for some $ξ$ between $c$ and $x$
Cauchy form: $R_{n} (x) = \frac{f ^{(n + 1)} ( ξ )}{n !} (x - ξ)^{n} (x - c)$ for some $ξ$ between $c$ and $x$
Integral form: $R_{n} (x) = \int_{c}^{x} \frac{f ^{(n + 1)} ( t )}{n !} (x - t)^{n} d t$

Core Theory

Main Result

Theorem (Taylor's Theorem with Lagrange Remainder) [1]: Let

f : [a, b] \to R

be a function such that:

$f$ is $n$ times continuously differentiable on $[a, b]$
$f^{(n + 1)}$ exists on $(a, b)$
$c \in [a, b]$

Then for any $x \in [a, b]$ , there exists a point $ξ$ strictly between $c$ and $x$ (or $ξ = c$ if $x = c$ ) such that:

f (x) = k = 0 \sum n \frac{f ^{(k)} ( c )}{k !} (x - c)^{k} + \frac{f ^{(n + 1)} ( ξ )}{( n + 1 )!} (x - c)^{n + 1}

Corollary (Error Bound) [2]: If

∣ f^{(n + 1)} (t) ∣ \leq M

for all

t

between

c

and

x

, then:

∣ R_{n} (x) ∣ = ∣ f (x) - P_{n} (x) ∣ \leq \frac{M}{( n + 1 )!} ∣ x - c ∣^{n + 1}

We prove the theorem using Cauchy's Mean Value Theorem. Define the auxiliary function:

g (t) = f (x) - k = 0 \sum n \frac{f ^{(k)} ( t )}{k !} (x - t)^{k}

This function is constructed so that $g (x) = 0$ and $g (c) = f (x) - P_{n} (x) = R_{n} (x)$ .

Taking the derivative with respect to $t$ :

g^{'} (t) = - \frac{f ^{(n + 1)} ( t )}{n !} (x - t)^{n}

This follows from the telescoping cancellation: when we differentiate the sum, each term $\frac{f ^{(k)} ( t )}{k !} (x - t)^{k}$ produces a contribution that cancels with part of the next term's derivative.

Now define a second auxiliary function:

h (t) = (x - t)^{n + 1}

Then $h (x) = 0$ , $h (c) = (x - c)^{n + 1}$ , and $h^{'} (t) = - (n + 1) (x - t)^{n}$ .

Both $g$ and $h$ are continuous on $[c, x]$ (or $[x, c]$ if $x < c$ ) and differentiable on the interior. By Cauchy's Mean Value Theorem, there exists $ξ$ strictly between $c$ and $x$ such that:

\frac{g ( x ) - g ( c )}{h ( x ) - h ( c )} = \frac{g ^{'} ( ξ )}{h ^{'} ( ξ )}

Substituting our known values:

\frac{0 - R _{n} ( x )}{0 - ( x - c ) ^{n + 1}} = \frac{- \frac{f ^{(n + 1)} ( ξ )}{n !} ( x - ξ ) ^{n}}{- ( n + 1 ) ( x - ξ ) ^{n}}

Simplifying:

\frac{R _{n} ( x )}{( x - c ) ^{n + 1}} = \frac{f ^{(n + 1)} ( ξ )}{( n + 1 )!}

Therefore:

R_{n} (x) = \frac{f ^{(n + 1)} ( ξ )}{( n + 1 )!} (x - c)^{n + 1}

The error bound corollary follows immediately by taking absolute values and using the bound on $f^{(n + 1)}$ . □

Common Misconception: The value

ξ

in the remainder formula is not computable in general—we only know it exists somewhere between

c

and

x

. Students often try to "find

ξ

" but this misses the point: the theorem is useful because it gives us bounds on

∣ R_{n} (x) ∣

without knowing

ξ

exactly. We use bounds on

∣ f^{(n + 1)} ∣

over the entire interval to control the error. Brook Taylor (1715) — Published "Methodus Incrementorum Directa et Inversa" containing the first general statement of the Taylor series expansion, though without rigorous remainder estimates.

Examples and Applications

1

Approximating $e^{0.1}$ with error bound

Let $f (x) = e^{x}$ and $c = 0$ . We'll use the second-degree Taylor polynomial to approximate $e^{0.1}$ .

First, compute derivatives:

$f (x) = e^{x}$ , so $f (0) = 1$
$f^{'} (x) = e^{x}$ , so $f^{'} (0) = 1$
$f^{''} (x) = e^{x}$ , so $f^{''} (0) = 1$
$f^{'''} (x) = e^{x}$

The Taylor polynomial is:

P_{2} (x) = 1 + x + \frac{x ^{2}}{2}

Therefore:

P_{2} (0.1) = 1 + 0.1 + \frac{( 0.1 ) ^{2}}{2} = 1 + 0.1 + 0.005 = 1.105

For the error bound, we need to bound $∣ f^{'''} (ξ) ∣$ for $ξ \in [0, 0.1]$ . Since $f^{'''} (x) = e^{x}$ is increasing, the maximum occurs at $x = 0.1$ :

∣ f^{'''} (ξ) ∣ \leq e^{0.1} < e^{1} < 3

Thus:

∣ R_{2} (0.1) ∣ \leq \frac{3}{3 !} (0.1)^{3} = \frac{3}{6} (0.001) = 0.0005

Our approximation: $e^{0.1} \approx 1.105 \pm 0.0005$ , i.e., $1.1045 \leq e^{0.1} \leq 1.1055$ .

(The actual value is $e^{0.1} \approx 1.10517$ , well within our bounds!)

2

Finding how many terms are needed for a given accuracy

Suppose we want to approximate $sin (1)$ with error less than $1 0^{- 6}$ using a Taylor polynomial centered at $c = 0$ .

For $f (x) = sin (x)$ , the derivatives cycle: $sin, cos, - sin, - cos, sin, \dots$

The Taylor series is:

sin (x) = x - \frac{x ^{3}}{3 !} + \frac{x ^{5}}{5 !} - \frac{x ^{7}}{7 !} + \dots

For all $k$ , we have $∣ f^{(k)} (x) ∣ \leq 1$ . The Lagrange remainder for degree $n$ satisfies:

∣ R_{n} (1) ∣ \leq \frac{1}{( n + 1 )!}

We need $\frac{1}{( n + 1 )!} < 1 0^{- 6}$ , so $(n + 1)! > 1 0^{6}$ .

Checking: $7! = 5040$ , $8! = 40320$ , $9! = 362880$ , $10! = 3628800 > 1 0^{6}$ .

Thus $n = 9$ suffices. Using $P_{9} (x) = x - \frac{x ^{3}}{6} + \frac{x ^{5}}{120} - \frac{x ^{7}}{5040} + \frac{x ^{9}}{362880}$ :

P_{9} (1) = 1 - \frac{1}{6} + \frac{1}{120} - \frac{1}{5040} + \frac{1}{362880} \approx 0.8414710

This approximates $sin (1) \approx 0.8414709848$ with the required accuracy.

Why differentiability is essential

Consider $f (x) = ∣ x ∣$ centered at $c = 0$ . We might naively write $P_{1} (x) = 0 + 0 \cdot x = 0$ since $f (0) = 0$ and we might think " $f^{'} (0) = 0$ ."

But $f^{'} (0)$ does not exist—the left and right derivatives differ. The function has a corner at $x = 0$ . There is no first-degree polynomial that approximates $∣ x ∣$ well near $0$ with error going to zero faster than $∣ x ∣$ itself.

Indeed, for any linear function $a x + b$ , we have:

∣ ∣ x ∣ - (a x + b) ∣ \neq = o (∣ x ∣) as x \to 0

This shows that without differentiability at $c$ , we cannot even construct the first-degree Taylor polynomial meaningfully, let alone guarantee the error bounds. The smoothness hypotheses in Taylor's Theorem are essential.

Geometric Picture: Imagine zooming in on a smooth curve near a point. As you zoom closer and closer, the curve looks more and more like a straight line (the tangent). Zooming in further, you might notice slight curvature—this is captured by the quadratic term. Each additional Taylor term captures the next level of detail in the curve's shape.

The remainder term $R_{n} (x)$ measures "what's left over" after accounting for polynomial behavior up to degree $n$ . The factor $\frac{( x - c ) ^{n + 1}}{( n + 1 )!}$ explains why the approximation gets better as we take more terms (factorial growth in denominator) and why it's better closer to $c$ (the power $(x - c)^{n + 1}$ gets small).

Think of $P_{n}$ as a "polynomial microscope" with $n$ levels of magnification, and $R_{n}$ as the resolution limit.

Historical Development

Brook Taylor published his treatise Methodus Incrementorum Directa et Inversa in 1715, which contained the first general formulation of what we now call Taylor series. However, Taylor's work lacked rigorous error analysis and was presented in the context of finite differences rather than calculus as we know it today.

The idea of polynomial approximation appeared earlier in the work of James Gregory (1668) and Isaac Newton (1669), particularly in Newton's work on binomial series. Colin Maclaurin (1742) developed the special case centered at $c = 0$ , now called the Maclaurin series, though this is really just Taylor's result at a specific point.

The crucial advancement came in the early 19th century when mathematicians sought to make calculus rigorous. Joseph-Louis Lagrange (1797) introduced the form of the remainder now bearing his name. Augustin-Louis Cauchy (1823) gave a different remainder formula and provided the first essentially complete proof using what is now known as Cauchy's Mean Value Theorem. The integral form of the remainder was developed through work on Fourier series and integration theory.

The modern presentation, with careful attention to hypotheses and the distinction between Taylor polynomials (which always exist for differentiable functions) and Taylor series (which may or may not converge to the function), crystallized in the late 19th century with the work of Karl Weierstrass and the development of rigorous real analysis.

Connections to Other Areas

Numerical Analysis and Computational Mathematics: Taylor's Theorem is the foundation of most numerical differentiation and integration schemes. For instance, the Euler method for solving differential equations is essentially a first-order Taylor approximation:

y (x + h) \approx y (x) + h y^{'} (x)

. Higher-order methods like Runge-Kutta methods use more Taylor terms implicitly. The error bounds allow us to prove convergence rates and choose appropriate step sizes. This connection shows that theoretical analysis directly enables practical computation—the

O (h^{n + 1})

error bound translates into concrete performance guarantees for algorithms.

Taylor's Theorem and Error Bounds