Course contentsShow
← Mathematics
Lesson 1789 of 3,12138. Sequences and Series (Calculus)Free lesson

Proving Convergence with the Remainder Term

Using Taylor's theorem to rigorously prove that a Taylor series converges to the original function.

Proving Convergence with the Remainder Term

You'll learn how to use Taylor's theorem to rigorously prove that a Taylor series actually converges to the function it represents.

The Core Idea

Just because we can write down a Taylor series for a function doesn't automatically mean the infinite series equals the function everywhere. To prove convergence, we need to show that the remainder term (the error between the function and its nth-degree Taylor polynomial) approaches zero as n approaches infinity.

Recall Taylor's theorem tells us:

f(x) = Pₙ(x) + Rₙ(x)

where Pₙ(x) is the nth Taylor polynomial and Rₙ(x) is the remainder. The series converges to f(x) if and only if:

lim (n→∞) Rₙ(x) = 0

How to Prove Convergence

Step 1: Choose an appropriate form of the remainder (usually Lagrange form):

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

for some c between a and x.

Step 2: Find an upper bound for |f⁽ⁿ⁺¹⁾(c)|. This often requires analyzing the behavior of higher derivatives.

Step 3: Show that |Rₙ(x)| → 0 as n → ∞, typically by showing the factorial in the denominator dominates.

Example Pattern

For f(x) = eˣ centered at a = 0, all derivatives equal eˣ. For any fixed x:

|Rₙ(x)| ≤ e|ˣ| · |x|ⁿ⁺¹/(n+1)!

Since |x|ⁿ⁺¹/(n+1)! → 0 for any fixed x (factorials grow faster than exponentials), Rₙ(x) → 0, proving the Maclaurin series for eˣ converges to eˣ for all x.

Key Takeaway: A Taylor series converges to its function on an interval if and only if you can prove the remainder term approaches zero there—this transforms series representation from symbolic manipulation into rigorous equality.