Approximation Error & Bounds — Approximation Error and Bounds in Series and Numerical Work - Calculus 2

SECTION 1

Historical Context & Motivation

Mathematics has always confronted a fundamental tension: most quantities of genuine interest—definite integrals, solutions to differential equations, values of transcendental functions—cannot be expressed in closed form, yet practitioners in astronomy, physics, and engineering require concrete numerical answers. The resolution of this tension gave rise to the discipline of approximation theory, which does not merely produce estimates but furnishes rigorous guarantees about how far those estimates can stray from the truth. Understanding approximation error and its bounds is therefore not an academic afterthought—it is the mechanism that transforms a guess into a result you can trust.

1715 • Brook Taylor's Series Expansion

Taylor publishes Methodus Incrementorum Directa et Inversa, formalizing the representation of functions as infinite power series and implicitly raising the question of how many terms suffice for a given accuracy.

1768 • Euler & Numerical Quadrature

Leonhard Euler systematically applies trapezoidal and midpoint rules to evaluate integrals, noting that finer subdivisions reduce error and seeking formulas to quantify the improvement.

1823 • Cauchy's Remainder Theorem

Augustin-Louis Cauchy provides a rigorous integral form of the Taylor remainder, giving the first fully justified error bound for polynomial approximations of smooth functions.

1837 • Alternating Series Estimation

Leibniz's alternating series test, refined by Dirichlet and Abel, yields a remarkably simple error bound: the magnitude of the first omitted term. This result remains one of the most elegant in approximation theory.

1950s • Modern Numerical Analysis

With the advent of electronic computers, systematic error analysis for quadrature rules (Simpson's, Gaussian) becomes essential. Rigorous bounds guide algorithm selection and adaptive mesh refinement in scientific computing.

The central question that unifies all of these developments is deceptively simple: if I truncate an infinite process after finitely many steps, how wrong can I possibly be? Answering this question precisely—whether the process is a Taylor series, an alternating series, or a numerical integration rule—is the subject of this lesson.

SECTION 2

Core Principles & Definitions

Before diving into specific error formulas, it is essential to establish a shared vocabulary and the foundational ideas that recur across every approximation context. The concept of approximation error refers to the difference between an exact value and its approximation, while an error bound is a rigorously provable upper limit on the magnitude of that error. The distinction matters: the actual error is typically unknown (if we knew it exactly, we could correct for it), but a bound tells us the worst-case scenario.

Approximation Error

Error Bound

An analytically derived quantity B such that |error| ≤ B. A good bound is both provably correct and reasonably tight—overly conservative bounds are valid but unhelpful in practice.

Order of Convergence

Describes how fast the error shrinks. If doubling the number of terms (or halving the step size h) causes the error to decrease by a factor of 2ᵖ, the method has order p. Higher order means faster convergence.

A Priori vs. A Posteriori Bounds

An a priori bound is computed before performing the approximation (e.g., from knowledge of derivatives). An a posteriori bound uses computed results to estimate the error (e.g., comparing two successive approximations).

Guaranteed vs. Asymptotic Estimates

A guaranteed bound holds for all n (or all h). An asymptotic estimate describes behavior as n → ∞ or h → 0 and may fail for small n or large h. Guaranteed bounds are preferred when safety is paramount.

✦

KEY TAKEAWAY

Think of an error bound like the margin of error in a poll: it does not tell you the exact discrepancy between the poll and the election outcome, but it gives you a worst-case window. A polling margin of ±3% means the true value is within 3 percentage points of the reported number. Likewise, an error bound of 10⁻⁴ means the true mathematical value lies within 0.0001 of your computed approximation—guaranteed.

SECTION 3

Visual Explanation — Taylor Remainder Geometry

The most intuitive way to understand approximation error in a Taylor series is to visualize a function alongside its successive polynomial approximations. The diagram below shows f(x) = eˣ together with its degree-1 (linear) and degree-3 (cubic) Taylor polynomials centered at a = 0. The shaded region between f(x) and the polynomial represents the remainder Rₙ(x), which is precisely the error incurred by using the polynomial instead of the true function.

The solid cyan curve is f(x) = eˣ. The dashed violet line is the first-degree Taylor polynomial T₁(x) = 1 + x, and the dashed green curve is the third-degree polynomial T₃(x). At x = 1, the vertical pink segment shows the large remainder R₁, while the shorter amber segment shows the much smaller remainder R₃. The higher the degree, the smaller the error near the center a = 0.

Several features of this diagram deserve emphasis. First, both Taylor polynomials pass through the point (0, 1)—they agree with f at the center of expansion. Second, the error grows as x moves away from a = 0, which motivates the (x − a)ⁿ⁺¹ factor in the remainder formula. Third, the cubic polynomial T₃ tracks the exponential far more faithfully than T₁, illustrating the power of including additional terms. Quantifying these observations is precisely what the Lagrange and integral remainder formulas accomplish.

SECTION 4

Mathematical Framework

Taylor Remainder (Lagrange Form)

Suppose f is (n+1)-times continuously differentiable on an interval containing a and x. The Lagrange remainder after the nth-degree Taylor polynomial Tₙ(x) centered at a is:

TAYLOR REMAINDER (LAGRANGE FORM)

Rₙ(x) = f⁽ⁿ⁺¹⁾(c) · (x − a)ⁿ⁺¹ / (n + 1)!

where c is some value between a and x (its exact location is unknown). To bound |Rₙ(x)|, replace |f⁽ⁿ⁺¹⁾(c)| with M = max|f⁽ⁿ⁺¹⁾(t)| for t between a and x.

TAYLOR ERROR BOUND

|Rₙ(x)| ≤ M · |x − a|ⁿ⁺¹ / (n + 1)!

M = max of |f⁽ⁿ⁺¹⁾(t)| on [a, x] (or [x, a]). This is the workhorse formula for bounding Taylor series errors.

Alternating Series Estimation Theorem

When a convergent series alternates in sign and its terms decrease in absolute value to zero, truncation after n terms yields an error bounded by the first omitted term. This is the Alternating Series Estimation Theorem (ASET).

ALTERNATING SERIES ERROR BOUND

|S − Sₙ| ≤ |aₙ₊₁|

S is the exact sum of the series, Sₙ is the partial sum of the first n terms, and aₙ₊₁ is the (n+1)th term. This bound is both simple and often quite tight.

Numerical Integration Error Bounds

For the three classical quadrature rules applied to ∫ₐᵇ f(x) dx using n subintervals of width h = (b − a)/n, the error bounds involve higher-order derivatives of f and powers of h.

TRAPEZOIDAL RULE ERROR

|E_T| ≤ (b − a)³ · M₂ / (12n²)

M₂ = max|f″(x)| on [a, b]. The error is O(h²), so doubling n cuts the error by roughly a factor of 4.

SIMPSON'S RULE ERROR

|E_S| ≤ (b − a)⁵ · M₄ / (180n⁴)

M₄ = max|f⁽⁴⁾(x)| on [a, b], and n must be even. The error is O(h⁴), so doubling n cuts the error by roughly a factor of 16.

💡

When to Use Which Bound

Use the Taylor remainder when approximating a function by its Taylor polynomial at a specific point. Use the ASET when summing a convergent alternating series and truncating after n terms. Use the quadrature error formulas when numerically evaluating a definite integral with the trapezoidal or Simpson's rule.

SECTION 5

Detailed Comparison of Error Bounds

A unified view of the major error bound techniques reveals both structural similarities—each involves a derivative bound and a geometric factor—and important differences in applicability and tightness. The diagram below places the three main categories side by side, while the subsequent table provides a concise reference.

Three major error bound frameworks compared: Taylor remainder for polynomial approximations, alternating series estimation for truncated series, and numerical quadrature bounds for integral approximations.

Method	Error Formula	Order	Requires
Taylor Remainder	M\|x − a\|ⁿ⁺¹ / (n+1)!	Depends on n	f⁽ⁿ⁺¹⁾ bound on interval
Alternating Series	\|aₙ₊₁\|	Depends on series	Alternating, decreasing, → 0
Trapezoidal Rule	(b−a)³M₂ / (12n²)	O(h²)	f″ bound on [a,b]
Midpoint Rule	(b−a)³M₂ / (24n²)	O(h²)	f″ bound on [a,b]
Simpson's Rule	(b−a)⁵M₄ / (180n⁴)	O(h⁴)	f⁽⁴⁾ bound on [a,b]; n even

Comparison of major error bound formulas in Calculus 2

SECTION 6

Worked Example — Bounding sin(0.1) Error

We will estimate sin(0.1) using the 3rd-degree Maclaurin polynomial and then rigorously bound the error using the Taylor remainder.

Approximating sin(0.1) with Taylor Error Bound

1
Step 1 — Write the Maclaurin series for sin x

The Maclaurin series for sin x is sin x = x − x³/3! + x⁵/5! − x⁷/7! + ⋯. The nth-degree Taylor polynomial centered at a = 0 truncates this series.
2
Step 2 — Identify the degree and compute T₃(0.1)

Using the 3rd-degree polynomial: T₃(x) = x − x³/6. Substituting x = 0.1: T₃(0.1) = 0.1 − (0.1)³/6 = 0.1 − 0.001/6 = 0.1 − 0.0001666̄ ≈ 0.0998333.

T₃(0.1) ≈ 0.0998333
3
Step 3 — Determine the remainder term order

For f(x) = sin x, the derivatives cycle with period 4: f′(x) = cos x, f″(x) = −sin x, f‴(x) = −cos x, f⁽⁴⁾(x) = sin x, f⁽⁵⁾(x) = cos x, and so on. The 4th-degree Maclaurin polynomial of sin x is identical to T₃(x), because the x⁴ coefficient is f⁽⁴⁾(0)/4! = sin(0)/4! = 0. Therefore R₃ = R₄, and the Lagrange remainder theorem applied at order n = 4 gives |R₄(x)| ≤ M₅ · |x|⁵/5!, where M₅ = max|f⁽⁵⁾(c)| = max|cos c| ≤ 1 for all c. This yields the bound |R₃(0.1)| ≤ (0.1)⁵/5! = 10⁻⁵/120.
4
Step 4 — Compute the error bound

Applying |R₃(0.1)| ≤ (0.1)⁵/5! with M₅ = 1: the bound is (0.1)⁵/120 = 10⁻⁵/120 ≈ 8.33 × 10⁻⁸.

|Error| ≤ 8.33 × 10⁻⁸
5
Step 5 — Verify against the true value

A calculator gives sin(0.1) = 0.0998334166468…, so the actual error is |0.0998334166468 − 0.0998333333| ≈ 8.33 × 10⁻⁸. This confirms that the actual error is consistent with our bound of 8.33 × 10⁻⁸—the bound is not merely satisfied but is in fact quite tight, reflecting that the next series term x⁵/5! = (0.1)⁵/120 captures the dominant contribution to the remainder.

sin(0.1) ≈ 0.0998333 with |error| ≤ 8.33 × 10⁻⁸ ✓

🎯

WHY THIS MATTERS

The factorial in the denominator grows explosively while |x − a|ⁿ⁺¹ stays small for x near a. This factorial dominance is why Taylor polynomials converge so rapidly near the center—and why even a low-degree polynomial can give extraordinary accuracy when x is close to a.

SECTION 7

Strengths and Limitations of Error Bound Methods

No single error bound technique is universally superior. Each has a domain of optimal applicability, and understanding the trade-offs equips you to choose the right tool for each problem. The following table summarizes these considerations.

Criterion	Taylor Remainder	ASET	Quadrature Bounds
Ease of use	Moderate—requires computing and bounding higher derivatives	Very easy—just evaluate the next term	Moderate—requires derivative bounds on entire interval
Tightness	Can be loose if M overestimates f⁽ⁿ⁺¹⁾	Often very tight	Varies—often conservative for smooth f
Applicability	Any sufficiently differentiable function	Only alternating series with decreasing terms	Definite integrals of smooth functions
Common pitfall	Choosing M too large or wrong derivative order	Applying to non-alternating or non-decreasing series	Forgetting that n must be even for Simpson's rule

Strengths and limitations comparison

⚖️

PRACTICAL WISDOM

In engineering and scientific computing, the choice of error bound method is analogous to selecting a measurement instrument: you want the tool whose precision matches the problem's requirements without being unnecessarily expensive. The ASET is like a quick laser measurement—fast and precise but only works in specific geometries. The Taylor remainder is like a coordinate measuring machine—versatile and rigorous but requires more setup. Quadrature bounds are like calibrated load cells—purpose-built for integration tasks.

SECTION 8

Connections to Advanced Theory

The error bound machinery developed in Calculus 2 forms the conceptual foundation for more sophisticated tools encountered in numerical analysis, real analysis, and applied mathematics courses. Understanding how these ideas generalize provides valuable perspective and motivation for further study.

Calculus 2 Concept	Advanced Generalization	Key Idea
Taylor remainder (Lagrange form)	Taylor's theorem with integral remainder; Peano remainder	The integral form Rₙ = ∫ₐˣ (x−t)ⁿ/n! · f⁽ⁿ⁺¹⁾(t) dt is exact and avoids the unknown c.
Alternating series estimation	Euler–Maclaurin summation; acceleration methods (Aitken, Richardson)	Extrapolation techniques combine partial sums to cancel leading error terms, achieving superlinear convergence.
Trapezoidal/Simpson error bounds	Gaussian quadrature; adaptive quadrature; spectral methods	Gaussian quadrature achieves maximal polynomial exactness; adaptive methods automatically refine where the integrand is irregular.
Error as M·hᵖ	Asymptotic error expansions; Richardson extrapolation	If the error has the form c₁h² + c₂h⁴ + ⋯, combining results at different h values eliminates leading terms systematically.

From Calculus 2 to advanced numerical analysis

Perhaps the most important conceptual takeaway is the idea of order of convergence as a classification tool. In advanced courses, you will see that the order p determines how computational effort scales with desired accuracy: to gain one additional decimal digit, an O(hᵖ) method needs roughly $10^{1/p}$ times more work. Simpson's rule with p = 4 is thus dramatically more efficient than the trapezoidal rule with p = 2 for smooth integrands—a fact that the error bound formulas make quantitative. This efficiency analysis extends naturally to computational complexity theory in numerical methods, where the trade-off between accuracy and computational cost is the central concern.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Explain in your own words why the Alternating Series Estimation Theorem provides a bound equal to |aₙ₊₁| rather than, say, the sum of all remaining terms. What geometric or algebraic property of alternating series makes this possible?

Show answer

In a convergent alternating series with decreasing terms, each successive partial sum overshoots or undershoots the true sum S by an amount less than the magnitude of the term just added. After Sₙ, adding aₙ₊₁ moves the partial sum past S, and adding aₙ₊₂ brings it back. Because the terms are decreasing, each overshoot is smaller than the previous one, so the partial sums oscillate around S in a tightening zigzag. The first overshoot past Sₙ is bounded by |aₙ₊₁|, which means |S − Sₙ| ≤ |aₙ₊₁|. This telescoping-oscillation property is unique to alternating series with monotonically decreasing terms and does not hold for arbitrary convergent series.

Question 2: BASIC CALCULATION

Use the Taylor remainder to find an upper bound on the error when cos(0.5) is approximated by its 4th-degree Maclaurin polynomial T₄(x) = 1 − x²/2 + x⁴/24.

Show answer

The next nonzero term after x⁴/24 in the cosine series is −x⁶/720. Using the Lagrange remainder for the 4th-degree polynomial: |R₄(0.5)| ≤ M · |0.5|⁵/5!. Here f⁽⁵⁾(x) = −sin x, so M = max|−sin c| ≤ 1 for c ∈ [0, 0.5]. Thus |R₄(0.5)| ≤ 1 · (0.5)⁵/120 = (1/32)/120 = 1/3840 ≈ 2.60 × 10⁻⁴. However, since the x⁵ coefficient of cos x is 0, a sharper analysis uses f⁽⁶⁾(x) = −cos x with M₆ ≤ 1, giving |R| ≤ (0.5)⁶/720 = (1/64)/720 ≈ 2.17 × 10⁻⁵. Either bound is valid; the sharper one exploits the vanishing odd-order terms of cos x.

Question 3: INTERMEDIATE

How many terms of the series ln 2 = 1 − 1/2 + 1/3 − 1/4 + ⋯ must be summed so that the partial sum approximates ln 2 with error less than 0.001?

Show answer

This is the alternating harmonic series, which satisfies the hypotheses of the ASET (alternating, terms 1/n decreasing to 0). By the ASET, |S − Sₙ| ≤ |aₙ₊₁| = 1/(n+1). We need 1/(n+1) < 0.001, so n+1 > 1000, meaning n ≥ 1000. Therefore, at least 1000 terms must be summed. This illustrates the slow convergence of the alternating harmonic series—despite the elegant error bound, achieving moderate accuracy requires many terms. In practice, series acceleration techniques such as Euler's transform would dramatically reduce the number of terms needed.

Question 4: APPLIED

An engineer needs to approximate ∫₀¹

e^{−x²}

dx with error less than 10⁻⁶ using Simpson's rule. What is the minimum number of subintervals n required? (Hint: for f(x) =

e^{−x²}

, one can show |f⁽⁴⁾(x)| ≤ 12 on [0,1].)

Show answer

The Simpson's rule error bound is |

E_S

| ≤ (b−a)⁵M₄/(180n⁴). With a = 0, b = 1, and M₄ = 12, we get |

E_S

| ≤ (1)⁵ · 12 / (180n⁴) = 12/(180n⁴) = 1/(15n⁴). Setting this less than 10⁻⁶: 1/(15n⁴) < 10⁻⁶, so n⁴ > 10⁶/15 ≈ 66667, giving n >

(66667)^{1/4}

≈ 16.07. Since n must be a positive even integer for Simpson's rule, we need n ≥ 18. This result underscores the power of Simpson's rule: only 18 subintervals (19 function evaluations) suffice for six-decimal-place accuracy, whereas the trapezoidal rule would require on the order of n ≈ 290 subintervals for the same precision.

Question 5: CRITICAL THINKING

Consider the series representation e = Σₙ₌₀^∞ 1/n!. This is not an alternating series, so the ASET does not directly apply. Derive a bound on the error |e − Sₙ| where Sₙ = Σₖ₌₀ⁿ 1/k!, and use it to determine the smallest n for which |e − Sₙ| < 10⁻¹⁰. (Hint: compare the tail to a geometric series.)

Show answer

The tail after n terms is Σₖ₌ₙ₊₁^∞ 1/k!. Factor out 1/(n+1)!: the tail equals [1/(n+1)!][1 + 1/(n+2) + 1/((n+2)(n+3)) + ⋯]. Each factor after the first is less than 1/(n+2), so the bracketed sum is bounded by the geometric series Σⱼ₌₀^∞ (1/(n+2))ʲ = (n+2)/(n+1). Therefore |e − Sₙ| ≤ (n+2)/[(n+1)·(n+1)!]. For n = 13: (15)/(14·14!) ≈ 15/(14 × 87178291200) ≈ 1.23 × 10⁻¹¹ < 10⁻¹⁰. For n = 12: (14)/(13·13!) ≈ 14/(13 × 6227020800) ≈ 1.73 × 10⁻¹⁰ > 10⁻¹⁰. So n = 13 is the smallest value. This problem illustrates how to construct error bounds for non-alternating series by majorizing the tail with a known convergent series—a technique that extends to many practical settings.

SUMMARY

Lesson Summary

Summary

This lesson developed the three principal frameworks for quantifying approximation error in Calculus 2. The Lagrange remainder provides a guaranteed upper bound on the error of a Taylor polynomial approximation by bounding the (n+1)th derivative and exploiting the factor |x − a|ⁿ⁺¹/(n+1)!. The Alternating Series Estimation Theorem offers an elegantly simple bound—the first omitted term—for series that alternate in sign with decreasing terms. The numerical quadrature error formulas for the trapezoidal and Simpson's rules connect derivative bounds to the number of subintervals, with convergence orders of O(h²) and O(h⁴) respectively.

The unifying theme is that every error bound combines three ingredients: a measure of the function's complexity (a derivative bound), a measure of how far the approximation reaches (|x − a| or the interval length), and a combinatorial or geometric factor (a factorial, or a power of n). Mastering these bounds transforms approximation from guesswork into rigorous estimation—you can certify, before consulting a computer, that your answer is within a specified tolerance of the truth. These ideas extend naturally to advanced numerical analysis, where Richardson extrapolation, Gaussian quadrature, and adaptive algorithms build directly on the foundations laid here.