1.2 Taylor Polynomials

Main Theorem

For some integer n0, suppose f(x) has n+1 derivative on (a,b) and x0(a,b). Then for each x(a,b) there exists a ξ, depending on x, lying between x and x0 such that:

f(x)=f(x0)+j=1n(f(j)(x0)j!(xx0)j)+f(n+1)(ξ)(n+1)!(xx0)n+1

Proof

x=x0 is trivial

assume xx0:
I is an open interval between x and x0. II¯(a,b).
f,f,f,,f(n) are all continuous on I¯ and f(n+1) exists on I.

F(z)=f(x)f(z)j=1nf(j)(z)j!(xz)jF(z)=f(z)j=1n[f(j+1)(z)j!(xz)jf(j)(z)(j1)!(xz)j1]=f(z)[f(n+1)(z)n!(xz)nf(z)]=f(n+1)(z)n!(xz)n.

Define g(z)=F(z)(xzxx0)n+1F(x0). So we have g(x0)=g(x)=0 and since it is continuous and differentiable by Rolle's Theorem there exists and ξI such that g(ξ)=0=F(ξ)+(n+1)(xξ)n(xx0)n1F(x0)

F(x0)=F(ξ)(xx0)n+1(n+1)(xξ)n=f(n+1)(ξ)n!(n+1)(xx0)n+1=f(n+1)(ξ)(n+1)!(xx0)n+1.

Taylor Polynomials

nth Taylor polynomial of f expanded about x0:

Tn(x)=f(x0)+j=1n(f(j)(x0)j!(xx0)j)

Remainder term:

Rn(x)=f(n+1)(ξ)(n+1)!(xx0)n+1

Error

|Tn(x)f(x)|=|Rn(x)|maxξ|f(n+1)(ξ)(n+1)!(xx0)n+1|=|xx0|n+1(n+1)!maxξ|f(n+1)(ξ)|.