Suppose that f(x) is a function all of whose differential coefficients are continuous in an interval [aη,a+η] surrounding the point x=a. Then, if h is numerically less than η, we have f(a+h)=f(a)+hf(a)++hn1(n1)!f(n1)(a)+hnn!f(n)(a+θnh), where 0<θn<1, for all values of n. Or, if Sn=0n1hνν!f(ν)(a),Rn=hnn!f(n)(a+θnh), we have f(a+h)Sn=Rn.

Now let us suppose, in addition, that we can prove that Rn0 as n. Then f(a+h)=limnSn=f(a)+hf(a)+h22!f(a)+.

This expansion of f(a+h) is known as Maclaurin’s Series. When a=0 the formula reduces to f(h)=f(0)+hf(0)+h22!f(0)+, which is known as . The function Rn is known as Lagrange’s form of the remainder.

The reader should be careful to guard himself against supposing that the continuity of all the derivatives of f(x) is a sufficient condition for the validity of Taylor’s series. A direct discussion of the behaviour of Rn is always essential.

Example LVI

1. Let f(x)=sinx. Then all the derivatives of f(x) are continuous for all values of x. Also |fn(x)|1 for all values of x and n. Hence in this case |Rn|hn/n!, which tends to zero as n (Ex. XXVII 12) whatever value h may have. It follows that sin(x+h)=sinx+hcosxh22!sinxh33!cosx+h44!sinx+, for all values of x and h. In particular sinh=hh33!+h55!, for all values of h. Similarly we can prove that cos(x+h)=cosxhsinxh22!cosx+h33!sinx+,cosh=1h22!+h44!.

2. The Binomial Series. Let f(x)=(1+x)m, where m is any rational number, positive or negative. Then f(n)(x)=m(m1)(mn+1)(1+x)mn and Maclaurin’s Series takes the form (1+x)m=1+(m1)x+(m2)x2+.

When m is a positive integer the series terminates, and we obtain the ordinary formula for the Binomial Theorem with a positive integral exponent. In the general case Rn=xnn!f(n)(θnx)=(mn)xn(1+θnx)mn, and in order to show that Maclaurin’s Series really represents (1+x)m for any range of values of x when m is not a positive integer, we must show that Rn0 for every value of x in that range. This is so in fact if 1<x<1, and may be proved, when 0x<1, by means of the expression given above for Rn, since (1+θnx)mn<1 if n>m, and (mn)xn0 as n (Ex. XXVII. 13). But a difficulty arises if 1<x<0, since 1+θnx<1 and (1+θnx)mn>1 if n>m; knowing only that 0<θn<1, we cannot be assured that 1+θnx is not quite small and (1+θnx)mn quite large.

In fact, in order to prove the Binomial Theorem by means of Taylor’s Theorem, we need some different form for Rn, such as will be given later (§ 162).


147. Taylor’s Theorem Main Page 149. Applications of Taylor’s Theorem to maxima and minima