Mathwords logoMathwords

Lagrange Error Bound — Definition, Formula & Examples

The Lagrange Error Bound is the maximum possible error when you use a Taylor polynomial of degree nn to approximate a function. It tells you how far off your polynomial approximation can be from the true value of the function.

If ff has n+1n+1 continuous derivatives on an interval containing aa and xx, then the remainder Rn(x)=f(x)Pn(x)R_n(x) = f(x) - P_n(x) satisfies Rn(x)M(n+1)!xan+1|R_n(x)| \leq \frac{M}{(n+1)!}|x - a|^{n+1}, where M=maxf(n+1)(c)M = \max|f^{(n+1)}(c)| for all cc between aa and xx. This is also called the Taylor Remainder Theorem or Lagrange Remainder.

Key Formula

Rn(x)M(n+1)!xan+1|R_n(x)| \leq \frac{M}{(n+1)!}\,|x - a|^{n+1}
Where:
  • Rn(x)R_n(x) = The error (remainder) when approximating f(x) by its degree-n Taylor polynomial
  • MM = An upper bound for |f^{(n+1)}(c)| on the interval between a and x
  • nn = The degree of the Taylor polynomial
  • aa = The center of the Taylor polynomial
  • xx = The point where you are approximating f

How It Works

To use the Lagrange Error Bound, you need three things: the degree nn of your Taylor polynomial, the center aa, and the value xx where you are approximating. Then you find the maximum value MM of the absolute value of the (n+1)(n+1)th derivative on the interval between aa and xx. Plug these into the formula to get an upper bound on the error. On the AP Calculus BC exam, you are often asked either to compute this bound for a given nn, or to find the smallest nn that guarantees the error is below a specified tolerance. Finding MM is usually the trickiest part — for functions like sinx\sin x, cosx\cos x, and exe^x, the derivatives cycle or grow predictably, which simplifies the bound.

Worked Example

Problem: Use the Lagrange Error Bound to find the maximum error when approximating e1e^1 using the 4th-degree Taylor polynomial for exe^x centered at a=0a = 0.
Identify the values: We have n=4n = 4, a=0a = 0, and x=1x = 1. We need the 5th derivative of exe^x.
f(5)(x)=exf^{(5)}(x) = e^x
Find M: We need the maximum of ec|e^c| for cc between 0 and 1. Since exe^x is increasing, the maximum occurs at c=1c = 1. We use M=e13M = e^1 \approx 3 (a common AP technique is to overestimate with M=3M = 3).
M=e13M = e^1 \leq 3
Apply the formula: Substitute into the Lagrange Error Bound formula.
R4(1)35!105=3120=0.025|R_4(1)| \leq \frac{3}{5!}\cdot|1-0|^5 = \frac{3}{120} = 0.025
Interpret: The 4th-degree Taylor polynomial for exe^x at a=0a=0 approximates e1e^1 with an error of at most 0.0250.025.
Answer: The maximum error is at most 0.0250.025.

Another Example

Problem: Find the smallest nn so that the nnth-degree Maclaurin polynomial for sinx\sin x approximates sin(0.5)\sin(0.5) with error less than 0.00010.0001.
Set up the bound: All derivatives of sinx\sin x satisfy f(n+1)(c)1|f^{(n+1)}(c)| \leq 1, so M=1M = 1. With a=0a = 0 and x=0.5x = 0.5, we need:
1(n+1)!(0.5)n+1<0.0001\frac{1}{(n+1)!}\,(0.5)^{n+1} < 0.0001
Test n = 3: Substitute n=3n = 3.
(0.5)44!=0.0625240.0026\frac{(0.5)^4}{4!} = \frac{0.0625}{24} \approx 0.0026
Test n = 5: Substitute n=5n = 5.
(0.5)66!=0.0156257200.0000217\frac{(0.5)^6}{6!} = \frac{0.015625}{720} \approx 0.0000217
Conclusion: Since 0.0000217<0.00010.0000217 < 0.0001, a 5th-degree polynomial is sufficient.
Answer: The smallest nn is 55.

Why It Matters

The Lagrange Error Bound appears on nearly every AP Calculus BC exam, typically in the free-response section on Taylor series. Engineers and scientists rely on the same idea when they replace complicated functions with polynomial approximations and need to guarantee their result is accurate to a certain number of decimal places. Mastering this bound also builds intuition for how quickly Taylor series converge — a foundation for numerical methods courses in college.

Common Mistakes

Mistake: Using the (n)(n)th derivative instead of the (n+1)(n+1)th derivative to find MM.
Correction: The error bound uses one derivative beyond the degree of the polynomial. For a degree-nn polynomial, evaluate the (n+1)(n+1)th derivative.
Mistake: Choosing MM at the center aa instead of maximizing f(n+1)(c)|f^{(n+1)}(c)| over the entire interval between aa and xx.
Correction: You must find the maximum of f(n+1)|f^{(n+1)}| on the whole interval [a,x][a, x] (or [x,a][x, a]). Evaluating only at aa can underestimate the true bound.

Related Terms