7.3 Higher Derivatives

If the derivative of a differentiable function can be considered a function in its own right, then we can investigate the differentiability of it as well. If the derivative f of a function f is differentiable, then we can define another function f′′ or d2fdx2 as the second derivative, and we say that f is twice differentiable. We can carry on this way if the derivatives carry on being differentiable, and once the prime notation becomes unwieldy, we can write the nth derivative of f as f(n) or dnfdxn.

7.3.1 Operations on Derivatives

Theorem 7.6

Let I and let f,g:I be two functions which are twice differentiable at some point cI.

  1. (i)

    (f+g)′′(c)=f′′(c)+g′′(c).

  2. (ii)

    Given λ, (λf)′′(c)=λf′′(c).

  3. (iii)

    (fg)′′(c)=f′′(c)g(c)+2f(c)g(c)+f(c)g′′(c).

Proof.
  1. (i)

    By theorem 7.2 (i), (f+g)(c)=f(c)+g(c). Therefore,

    (f+g)′′(c)=(f+g)(c)=f′′(c)+g′′(c). (7.39)
  2. (ii)

    By theorem 7.2 (ii), (λf)(c)=λf(c). So,

    (λf)′′(c)=(λf)(c)=λf′′(c). (7.40)
  3. (iii)

    By theorem 7.2 (iii), (fg)(c)=f(c)g(c)+f(c)g(c). So,

    (fg)′′(c) =(f(c)g(c)+f(c)g(c)) (7.41)
    =(f(c)g(c))+(f(c)g(c)) (7.42)
    =(f(c)g′′(c)+f(c)g(c))+(f(c)g(c)+f′′(c)g(c)) (7.43)
    =f′′(c)g(c)+2f(c)g(c)+f(c)g′′(c). (7.44)

The first two parts of this theorem generalise very easily by induction to all higher derivatives. The final part is more involved.

Theorem 7.7 (General Leibniz Rule)

Let I and let f,g:I be two n-times differentiable functions at some point cI. Then the nth derivative of the product (fg):I at c takes the value

(fg)(n)(c)=k=0n(nk)f(nk)(c)g(k)(c). (7.45)

7.3.2 Taylor’s Theorem

The last theorem of this chapter is a generalisation of the Mean Value theorem. It allows us to approximate the value of a function at a point as a polynomial with the derivatives of the function as coefficients.

Theorem 7.8 (Taylor’s Theorem)

Let I be some open interval and let a,bI. Let f:I be a continuous function which is (n+1)-times differentiable at a. Then there exists θ between a and b such that

f(b)=f(a)+(ba)f(a)+(ba)22!f′′(a)++(ba)nn!f(n)(a)+(ba)n+1(n+1)!f(n+1)(θ). (7.46)
Proof.

First we define F:[a,b] to be given by

F(t)=f(b)f(t)(bt)f(t)(bt)22!f′′(t)(bt)nn!f(n)(t). (7.47)

Since the first n derivatives of f are continuous on [a,b] and differentiable on (a,b), F inherits these properties by theorem 7.2. The derivative of F is then

F(t) =f(t)+[f(t)(bt)f′′(t)]+[(bt)f′′(t)(bt)22!f′′′(t)] (7.48)
++[(bt)n1(n1)!f(n)(t)(bt)nn!f(n+1)(t)] (7.49)
=(bt)nn!f(n+1)(t). (7.50)

Now, define G:[a,b] to be given by

G(t)=F(t)(btba)n+1F(a). (7.51)

Notice that G(a)=G(b)=0, so by Rolle’s theorem (7.4) there exists θ(a,b) such that G(θ)=0. Specifically,

G(θ) =F(θ)+(n+1)(bθ)n(ba)n+1F(a) (7.52)
=(bθ)nn!f(n+1)(θ)+(n+1)(bθ)n(ba)n+1F(a) (7.53)
=(n+1)(bθ)n(ba)n+1[F(a)(ba)n+1(n+1)!f(n+1)(θ)]=0. (7.54)

The prefactor is never zero, hence the term in square brackets must be zero, so

F(a)=(ba)n+1(n+1)!f(n+1)(θ), (7.55)
f(b)= f(a)+(ba)f(a)+(ba)22!f′′(a) (7.56)
++(ba)nn!f(n)(a)+(ba)n+1(n+1)!f(n+1)(θ). (7.57)

7.3.3 Approximating Functions

Taylor’s theorem allows us to make approximations that are much better than linear ones. If, like before, we replace b any point x in the interior of the domain of f, we get

f(x) =f(a)+(xa)f(a)+(xa)22!f′′(a) (7.58)
++(xa)nn!f(n)(a)+(xa)n+1(n+1)!f(n+1)(θ), (7.59)

where θ is now between x and a. This polynomial representation of f is known as the nth Taylor Polynomial of f about a and the last term is known as the error or remainder, sometimes denoted Rn(x). The idea is that for well-behaved functions, the remainder will get smaller as n gets larger.

Corollary 7.8.1 (Maclaurin’s Theorem)

Suppose 0I. Let xI, then if f:I is an (n+1)-times differentiable function at 0, then there exists θ between x and 0 such that

f(x)=f(0)+xf(0)+x22!f′′(0)++xnn!f(n)(0)+Rn(x), (7.60)

where Rn(x)=xn+1(n+1)!f(n+1)(θ).

Proof.

This is easily shown by using Taylor’s theorem with a=0. ∎

Taylor’s theorem and Maclaurin’s theorem have very important consequences that we will explore in more detail in later chapters.