ProofComplete

Proof of Taylor's Theorem

We provide a complete proof of Taylor's theorem with the Lagrange remainder, establishing the rigorous foundation for Taylor series approximations.


Proof

Theorem: Let ff be (n+1)(n+1) times differentiable on an open interval containing aa and xx. Then f(x)=k=0nf(k)(a)k!(xa)k+f(n+1)(c)(n+1)!(xa)n+1f(x) = \sum_{k=0}^{n} \frac{f^{(k)}(a)}{k!}(x-a)^k + \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1} for some cc between aa and xx.

Step 1: Setup.

Define Tn(x)=k=0nf(k)(a)k!(xa)kT_n(x) = \sum_{k=0}^{n} \frac{f^{(k)}(a)}{k!}(x-a)^k and Rn(x)=f(x)Tn(x)R_n(x) = f(x) - T_n(x). We need to show that Rn(x)=f(n+1)(c)(n+1)!(xa)n+1R_n(x) = \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1} for some cc between aa and xx.

Fix xax \neq a and define the constant MM by the equation Rn(x)=M(xa)n+1(n+1)!R_n(x) = M \cdot \frac{(x-a)^{n+1}}{(n+1)!}

We need to show M=f(n+1)(c)M = f^{(n+1)}(c) for some cc between aa and xx.

Step 2: Construct an auxiliary function.

Define g(t)=f(t)Tn(t)M(ta)n+1(n+1)!g(t) = f(t) - T_n(t) - M \cdot \frac{(t-a)^{n+1}}{(n+1)!}

where Tn(t)=k=0nf(k)(a)k!(ta)kT_n(t) = \sum_{k=0}^n \frac{f^{(k)}(a)}{k!}(t-a)^k is viewed as a function of tt.

We observe that g(a)=0g(a) = 0 because Tn(a)=f(a)T_n(a) = f(a) and the last term vanishes at t=at = a. Also g(x)=0g(x) = 0 by our choice of MM.

Step 3: Apply the generalized Rolle's theorem.

Since g(a)=g(x)=0g(a) = g(x) = 0 and gg is differentiable, Rolle's theorem gives c1c_1 between aa and xx with g(c1)=0g'(c_1) = 0.

Now compute g(t)g'(t): g(t)=f(t)k=1nf(k)(a)(k1)!(ta)k1M(ta)nn!g'(t) = f'(t) - \sum_{k=1}^n \frac{f^{(k)}(a)}{(k-1)!}(t-a)^{k-1} - M \cdot \frac{(t-a)^n}{n!}

We have g(a)=f(a)f(a)=0g'(a) = f'(a) - f'(a) = 0 (the sum at t=at=a gives f(a)f'(a) from the k=1k=1 term). So g(a)=g(c1)=0g'(a) = g'(c_1) = 0, and Rolle's theorem gives c2c_2 between aa and c1c_1 with g(c2)=0g''(c_2) = 0.

Continuing this process: at each stage, g(j)(a)=0g^{(j)}(a) = 0 (since the Taylor polynomial was chosen to match ff up to order nn) and g(j)(cj)=0g^{(j)}(c_j) = 0 from the previous step. By Rolle's theorem, there exists cj+1c_{j+1} between aa and cjc_j with g(j+1)(cj+1)=0g^{(j+1)}(c_{j+1}) = 0.

Step 4: The (n+1)(n+1)-th derivative.

After n+1n+1 applications of Rolle's theorem, we obtain cn+1c_{n+1} (call it cc) between aa and xx with g(n+1)(c)=0g^{(n+1)}(c) = 0.

Now compute g(n+1)(t)g^{(n+1)}(t):

  • dn+1dtn+1f(t)=f(n+1)(t)\frac{d^{n+1}}{dt^{n+1}} f(t) = f^{(n+1)}(t)
  • dn+1dtn+1Tn(t)=0\frac{d^{n+1}}{dt^{n+1}} T_n(t) = 0 (since TnT_n is a polynomial of degree n\leq n)
  • dn+1dtn+1[M(ta)n+1(n+1)!]=M\frac{d^{n+1}}{dt^{n+1}} \left[M \cdot \frac{(t-a)^{n+1}}{(n+1)!}\right] = M

Therefore g(n+1)(t)=f(n+1)(t)Mg^{(n+1)}(t) = f^{(n+1)}(t) - M.

Setting g(n+1)(c)=0g^{(n+1)}(c) = 0 gives f(n+1)(c)=Mf^{(n+1)}(c) = M.

Step 5: Conclusion.

Substituting back: Rn(x)=M(xa)n+1(n+1)!=f(n+1)(c)(n+1)!(xa)n+1R_n(x) = M \cdot \frac{(x-a)^{n+1}}{(n+1)!} = \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1}. \square


RemarkOther remainder forms

The Cauchy form of the remainder, Rn(x)=f(n+1)(c)n!(xc)n(xa)R_n(x) = \frac{f^{(n+1)}(c)}{n!}(x-c)^n(x-a), is obtained by a different application of the mean value theorem. The integral form Rn(x)=axf(n+1)(t)n!(xt)ndtR_n(x) = \int_a^x \frac{f^{(n+1)}(t)}{n!}(x-t)^n\,dt follows from repeated integration by parts and is often the most useful for sharp error bounds.