A Cauchy-L'Hopital-Taylor hybrid theorem
Last week I was teaching the standard theorems of real analysis (single variable): Rolle's Theorem, the Mean Value Theorem (MVT), Cauchy's Mean Value Theorem, L'Hôpital's rule, and Taylor's Theorem. As I was short of time, I didn't manage to give full proofs of everything live (but they have complete proofs in the printed notes). I did however have a think about the relationships between these results, and what I might say about them.
Along the way, I noticed that there is a particular hybrid Cauchy-L'Hôpital-Taylor result which I don't remember seeing before (though no doubt it is well known).
Let me start by recalling some of the standard statements.
For the rest of this post, a and b are real numbers with a<b, and f and g are real-valued functions on [a,b] which are both continuous on [a,b] and differentiable on (a,b).
Rolle's Theorem
Suppose that f(a)=f(b). Then there exists ξ∈(a,b) such that f′(ξ)=0.
Comment: We proved this using a theorem often credited to Fermat about derivatives (when they exist) at local extrema of a function in the interior of an interval.
Mean Value Theorem (MVT)
Note: here there is no assumption on f(a) and f(b).
There exists ξ∈(a,b) such that
f(b)−f(a)=(b−a)f′(ξ).
Equivalently, there exists ξ∈(a,b) such that
f′(ξ)=f(b)−f(a)b−a.
Comment: This says that the gradient of f at ξ is equal to the average gradient of f over the whole interval [a,b]. Of course, Rolle's Theorem is the special case where this average gradient is 0. However, we use Rolle's Theorem to prove the MVT: subtracting of a suitable linear polynomial from f gives a new function which satisfies the conditions of Rolle's Theorem. Any linear polynomial with gradient f(b)−f(a)b−a will do.
To help prove L'Hôpital's rule we need a more general version of the MVT. This is the first time we bring our second function g into the picture. Remember that both f and g are continuous on [a,b] and differentiable on (a,b).
Cauchy's Mean Value Theorem (CMVT)
There exists ξ∈(a,b) such that
(f(b)−f(a))g′(ξ)=(g(b)−g(a))f′(ξ).
Note: this is the same ξ for f and g, so that we can't just apply the usual MVT separately to f and g.
When proving L'Hôpital's rule, the main case of interest is when we know that g′(t)≠0 for all t∈(a,b) and (hence) that g(b)≠g(a). In this case, the point ξ above gives us
f′(ξ)g′(ξ)=f(b)−f(a)g(b)−g(a)=f(b)−f(a)b−ag(b)−g(a)b−a.
This says that the ratio of the gradients of f and g at ξ is equal to the ratio of the average gradients of f and g over the interval [a,b].
If, in addition to the above assumptions on g we also have f(a)=f(b)=0, then we have f(b)/g(b)=f′(ξ)/g′(ξ), and this helps with the proof one of the main versions of L'Hôpital's rule. However, I don't want to discuss all the different forms of L'Hôpital's rule here.
Note that the usual MVT is just the special case of the CMVT where g(x)=x (or x+c for any constant c.)
At this point, we usually prove some version of Taylor's Theorem with remainder (there are quite a few versions). But I want to look at a more CMVT-style version, based on what I will call a Hybrid Lemma.
Hybrid Lemma
Suppose now (in addition to our initial assumptions) that n∈{0,1,2,…}, and that f and g are n+1 times differentiable on (a,b).
Let x0∈(a,b), and suppose that, for all k∈{0,1,2,…,n}, we have f(k)(x0)=g(k)(x0)=0. Then there exist ξa∈(a,x0) and ξb∈(x0,b) such that
(1)f(a)g(n+1)(ξa)=g(a)f(n+1)(ξa)
and
(2)f(b)g(n+1)(ξb)=g(b)f(n+1)(ξb).
Comments:
Since f(x0)=g(x0)=0, the case n=0 is immediate from CMVT on the intervals [a,x0] and [x0,b].
The main case of interest for us is when g(n+1)(t)≠0 for all t∈(a,b)∖{x0} and (hence) g(a)≠0 and g(b)≠0. In this case the conclusion is that
(3)f(a)g(a)=f(n+1)(ξa)g(n+1)(ξa)
and
(4)f(b)g(b)=f(n+1)(ξb)g(n+1)(ξb).
Because of symmetry, there is no real difference between the results for ξa and for ξb, so we will focus on ξb.
Let's first look at the case we are most interested in, where g(n+1) has no zeros in (a,b)∖{x0}. Since g(n)(x0)=0, Rolle's Theorem then tells us that g(n) also has no zeros in (a,b)∖{x0}. Repeating this argument, we see that for all k∈{0,1,2,…,n}, g(k) has no zeros in (a,b)∖{x0}. Moreover g(a)≠0 and g(b)≠0.
[You can also write this out as a more formal proof by induction, but I think that it is clear enough in this form.]
We now prove the existence of ξb satisfying (4).
We first apply CMVT on the interval [x0,b]. This tells us that there exists ξ1∈(x0,b) with
f(b)g(b)=f′(ξ1)g′(ξ1).
We can now proceed by induction, or by simply repeatedly applying CMVT. By CMVT, applied to f′ and g′ on [x0,ξ1], there is a ξ2∈(x0,ξ1) with
f(b)g(b)=f′(ξ1)g′(ξ1)=f″(ξ2)g″(ξ2).
Repeated application of CMVT gives us b>ξ1>ξ2>⋯>ξn+1>x0 with
f(b)g(b)=f(1)(ξ1)g(1)(ξ1)=f(2)(ξ2)g(2)(ξ2)=⋯=f(n+1)(ξn+1)g(n+1)(ξn+1).
And now we can set ξb=ξn+1.
Essentially the same argument works on [a,x0] to give us ξa satisfying (3).
This proves the Hybrid Lemma in the case where g(n+1) has no zeros in (a,b)∖{x0}.
Otherwise, we have to go back to (1) and (2) instead. Does anything change?
Let's look next at the case where g(b)=0. Then the RHS of (2) is 0. But we can apply Rolle's Theorem repeatedly to g and its derivatives to show that there are ξk (k=1,…,n+1) with b>ξ1>ξ2>⋯>ξn+1>x0 such that g(k)(ξk)=0. We can take ξb=ξn+1, and equality holds in (2) with both sides being 0.
Thus we can assume that g(b)≠0.
By symmetry in f and g, we can also assume that f(b)≠0
Applying CMVT on [x0,b] gives us a ξ1∈(x0,b) with
f(b)g′(ξ1)=g(b)f′(ξ1).
Then there is ξ2∈(x0,ξ1) with f′(ξ1)g″(ξ2)=g′(ξ1)f″(ξ2).
However, if f′(ξ1)=g′(ξ1)=0, this tells us nothing at all about f″(ξ2) and g″(ξ2).
So that approach doesn't work!
So let's just go back to (2) and use Rolle's Theorem repeatedly instead (as in the proof of the CMVT and in some proofs of Taylor's Theorem), starting with a suitable linear combination of f and g.
Define h:[a,b]→R by
h(t)=f(b)g(t)−g(b)f(t).
Then h is continuous on [a,b] and h is n+1 times differentiable on (a,b) with
(∗)h(k)(t)=f(b)g(k)(t)−g(b)f(k)(t)
for all t∈(x0,b) and k∈{0,1,2,…,n+1}.
Our original assumptions on f and g give us that h(k)(x0)=0 for k=0,1,…,n.
We also have h(b)=f(b)g(b)−g(b)f(b)=0.
(This is why we chose these particular coefficients for f and g in the first place!)
Looking back to the argument we gave above in the case when g(b)=0,, but working with h instead, we see that we can find ξk (k=1,…,n+1) with b>ξ1>ξ2>⋯>ξn+1>x0 such that h(k)(ξk)=0.
Set ξb=ξn+1, so that h(n+1)(ξb)=0. By (∗), we have
f(b)g(n+1)(ξb)−g(b)f(n+1)(ξb)=0,
and so (2) follows.
We obtain ξa satisfying (1) in the same way by working with f(a)g(t)−g(a)f(t) on [a,x0].
As a corollary, we now obtain a Hybrid Taylor Theorem (which can also be described as a two-function Taylor Theorem)
Corollary (Hybrid Taylor Theorem)
Suppose that, in addition to our initial assumptions on f and g, that n∈{0,1,2,…}, and that f and g are n+1 times differentiable on (a,b).
Define Rf and Rg to be the nth remainder functions for f and g when looking at the Taylor polynomials for f and g centred at x0. So, for all t∈[a,b], we have
Rf(t)=f(t)−n∑k=0f(k)(x0)k!(t−x0)k
and
Rg(t)=g(t)−n∑k=0g(k)(x0)k!(t−x0)k.
Then there exist ξa∈(a,x0) and ξb∈(x0,b) such that
(1′)Rf(a)g(n+1)(ξa)=Rg(a)f(n+1)(ξa)
and
(2′)Rf(b)g(n+1)(ξb)=Rg(b)f(n+1)(ξb).
If g(n+1)(t)≠0 for all t∈(a,b)∖{x0} and (hence) Rg(a)≠0 and Rg(b)≠0, then we have
(3′)Rf(a)Rg(a)=f(n+1)(ξa)g(n+1)(ξa)
and
(4′)Rf(b)Rg(b)=f(n+1)(ξb)g(n+1)(ξb).
Proof
This is immediate from the Hybrid Lemma, because Rf and Rg satisfy the conditions of that lemma, while R(n+1)f=f(n+1) and R(n+1)g=g(n+1).◻
Note
The usual version of Taylor's Theorem (with Lagrange's form of the remainder) can be obtained immediately from this Hybrid Taylor Theorem by taking g(t)=(t−x0)n+1, in which case Rg=g and R(n+1)g(t)=(n+1)! for all t. Then (1′) gives
(n+1)!Rf(a)=(a−x0)n+1f(n+1)(ξa),
and (2′) gives
(n+1)!Rf(b)=(b−x0)n+1f(n+1)(ξb).
For all x∈[a,b] with x>x0, we can apply this result on [a,x] instead to see that there is a ξ strictly between x0 and x such that
Rf(x)=f(n+1)(ξ)(n+1)!(x−x0)n+1.
The same applies if x∈[a,b] with x<x0, working on [x,b] instead.
An alternative is to work with one-sided derivatives, and then you can allow x0 to be at an end-point of the interval.
Comments
Post a Comment