Historical Context & Motivation
Long before computers could evaluate transcendental functions like sin(x), eˣ, or ln(x) with the press of a button, mathematicians faced a fundamental challenge: how does one compute the value of a function that cannot be expressed through finite algebraic operations? The answer—one of the most elegant ideas in all of analysis—is to replace difficult functions with polynomials that mimic their behavior near a chosen point. This idea, now formalized as the Taylor polynomial approximation, grew out of centuries of effort to reconcile the infinite with the finite, and it remains indispensable in modern engineering, physics, and numerical computation.
The central question driving this theory is deceptively simple: given a smooth function f(x), can we construct a polynomial Pn(x) of degree n that agrees with f not only in value at some point a but also in its first n derivatives? If so, how good is the approximation, and how far from a can we trust it? These are the questions that Taylor polynomial approximations answer with remarkable precision.
Core Principles & Definitions
A Taylor polynomial is constructed so that it matches a target function's behavior—its value and the values of its successive derivatives—at a single point called the center of expansion. The more derivative information we encode into the polynomial, the better it tends to approximate the function near that center. Understanding the construction requires a few foundational ideas that connect derivatives, factorials, and polynomial algebra.
Derivative Matching
Factorial Scaling
Center of Expansion
Degree vs. Order
Remainder & Error
Visualizing Taylor Approximations
The power of Taylor polynomials becomes most vivid when you see successive approximations layered over the original function. The following diagram shows the function f(x) = eˣ alongside its first-, second-, third-, and fourth-degree Taylor polynomials centered at a = 0. Notice how each additional degree extends the region over which the polynomial closely follows the exponential curve.
Several important features emerge from the diagram. First, observe that all four polynomials pass through the point (0, 1), since they are all centered at a = 0 and f(0) = e⁰ = 1. Second, the tangent-line approximation P1(x) = 1 + x captures only the slope at the origin and diverges quickly. The quadratic P2 adds curvature, matching the concavity of eˣ. By the time we reach P4, the polynomial is nearly indistinguishable from eˣ on the interval (−2, 2). This progressive tightening illustrates the fundamental trade-off: higher degree yields better accuracy but requires more derivative information.
Mathematical Framework
The construction of a Taylor polynomial is driven by a single organizing principle: choose the coefficients of a polynomial so that its derivatives at the center a match those of the target function f. We begin with the general formula and then examine the remainder that quantifies the error incurred by truncation.
To verify that derivative matching holds, differentiate Pₙ(x) term by term. The kth derivative of (x − a)ᵏ / k! evaluated at x = a yields exactly 1, while every other term vanishes. Hence Pₙ(k)(a) = f(k)(a) for 0 ≤ k ≤ n, which is precisely the requirement. When the center of expansion is a = 0, the formula simplifies to the Maclaurin polynomial: Pₙ(x) = Σ [ f(k)(0) / k! ] xᵏ.
Error Behavior & Convergence
Understanding how quickly the error decreases as the degree n increases is essential for practical applications. The Lagrange remainder provides a worst-case bound, but examining actual error values for concrete functions reveals the remarkable efficiency of Taylor polynomials. The following diagram and table illustrate the error |eˣ − Pₙ(x)| at x = 1 for increasing polynomial degree.
| Degree n | Pₙ(1) | |e − Pₙ(1)| | Lagrange Bound |
|---|---|---|---|
| 0 | 1 | 1.71828 | e ≈ 2.718 |
| 1 | 2 | 0.71828 | e/2 ≈ 1.359 |
| 2 | 2.5 | 0.21828 | e/6 ≈ 0.453 |
| 3 | 2.6667 | 0.05161 | e/24 ≈ 0.113 |
| 4 | 2.7083 | 0.00994 | e/120 ≈ 0.023 |
| 5 | 2.7167 | 0.00161 | e/720 ≈ 0.004 |
The table reveals two important patterns. First, the actual error is always smaller than the Lagrange bound, confirming that the bound is conservative but reliable. Second, the error decreases roughly by a factor of 1/(n+1) with each additional degree—a consequence of the factorial growth in the denominator of each successive term. This factorial growth is the mathematical engine behind the remarkable accuracy of Taylor approximations: even for modest values of n, the factorial dominates the power (x − a)ⁿ⁺¹, driving the remainder toward zero.
Worked Example
Let us construct the third-degree Taylor polynomial for f(x) = ln(x) centered at a = 1, and then use it to approximate ln(1.2).
Strengths & Limitations
Taylor polynomials are an extraordinarily versatile tool, but they are not without limitations. Understanding when to deploy them—and when alternative methods may be preferable—is as important as knowing how to construct them.
| Strengths | Limitations |
|---|---|
| Polynomials are trivial to evaluate—only addition, multiplication, and exponentiation are needed, making them ideal for numerical computation. | Accuracy degrades as x moves away from the center a; the approximation is inherently local. |
| The Lagrange remainder provides rigorous, computable error bounds, enabling engineers and scientists to certify approximation quality. | High-degree polynomials require computing many higher-order derivatives, which can be algebraically complex or computationally expensive. |
| Widely applicable: any function that is sufficiently differentiable admits a Taylor expansion. | Not all Taylor series converge to their generating function. The classic counterexample is f(x) = e^(−1/x²), whose Maclaurin series is identically zero despite f being nonzero for x ≠ 0. |
| Taylor expansions facilitate symbolic manipulation: integrating, differentiating, or composing power series is often easier than working with the original function. | Convergence may be limited to a finite radius. For instance, the Taylor series for 1/(1 + x²) about a = 0 converges only on (−1, 1). |
From Taylor Polynomials to Taylor Series
A Taylor polynomial of degree n is a finite approximation. The natural question is: what happens as n → ∞? If the infinite sum converges, we obtain the Taylor series of f centered at a. The Taylor series represents f(x) exactly (not approximately) within a region called the interval of convergence. This transition from polynomial to series is the bridge connecting this lesson to power series theory and, ultimately, to the full machinery of analytic functions.
| Feature | Taylor Polynomial Pₙ(x) | Taylor Series |
|---|---|---|
| Number of terms | Finite (n + 1 terms) | Infinite (Σ from k = 0 to ∞) |
| Relationship to f | Approximation with computable error Rₙ(x) | Exact representation (when convergent) |
| Convergence concern | No convergence issue—always a finite sum | Must verify convergence; may diverge outside a radius R |
| Typical use | Numerical evaluation, linearization, error estimation | Exact symbolic representation, proof techniques, generating functions |
| Key formula | Pₙ(x) = Σ_{k=0}^{n} f⁽ᵏ⁾(a)/k! × (x−a)ᵏ | f(x) = Σ_{k=0}^{∞} f⁽ᵏ⁾(a)/k! × (x−a)ᵏ, |x−a| < R |
The transition to infinite series introduces new mathematical questions that form the core of the next several topics in this course: Does the series converge? If so, for which x? Does convergence actually mean the series equals f(x), or could the series converge to something else? These questions lead to the ratio and root tests for determining the radius of convergence, and to the concept of analytic functions—functions that equal their Taylor series everywhere within the interval of convergence. For now, the key insight is that every Taylor polynomial is a partial sum of the Taylor series, and the quality of the polynomial approximation is governed by how quickly the series converges.
Practice Problems
Lesson Summary
A Taylor polynomial Pₙ(x) = Σ_{k=0}^{n} f⁽ᵏ⁾(a)/k! × (x − a)ᵏ is the unique polynomial of degree ≤ n that matches a function f and its first n derivatives at a single point a, called the center of expansion. When a = 0 the result is called a Maclaurin polynomial. The factorial in each denominator arises from the differentiation rule for power functions and ensures perfect derivative matching. The most important Maclaurin expansions—for eˣ, sin x, and cos x—converge for all real x.
The Lagrange remainder Rₙ(x) = f⁽ⁿ⁺¹⁾(c)/(n+1)! × (x − a)ⁿ⁺¹ provides a rigorous error bound that enables practitioners to certify approximation quality. As the degree n increases, the factorial growth in the denominator generally forces the error toward zero, extending the region of accurate approximation. In the limit n → ∞, the Taylor polynomial becomes the Taylor series, which represents f exactly within its interval of convergence—a topic explored in depth through power series and convergence tests later in this course.