Lecture 32 - Generalized MVT

Review from last time:

Mean value Theorem

Let f:[a,b]R be continuous on [a,b] and differentiable on at least on (a,b). Then c(a,b) such that f(c)=f(b)f(a)ba.

Drawing canvas

Proof

Create the function h(x) defined as:
h(x)=f(a)+f(b)f(a)ba(xa)
(you can think of h as the secant line between a,b). Notice that h is differentiable by Algebraic Differentiability Theorem, where:

  • h(a)=f(a)
  • h(b)=f(b)
  • h(x)=f(b)f(a)ba for all x[a,b].

Then for x[a,b] define:
g(x)=f(x)h(x)
Then g(a)=0=g(b) so by Rolle's Theorem (Baby MVT) then c(a,b) such that g(c)=0, namely:
g(c)=0=f(c)h(c)=f(c)f(b)f(a)baf(c)=f(b)f(a)ba
as desired.

What's cool here is that for:
f(c)=f(b)f(a)ba
on the RHS we only have a constant, but on the left hand side we have information about f(c). Thinking, we could try different a,b values to learn more information about f at points within those intervals (however, you don't know the exact value of c though).

Let's apply the MVT!

Examples

Let f be differentiable on the interval I. If f(x)=0 for all xI then x is constant. We use this idea of anti-derivation all the time, but using the Mean Value Theorem (MVT) we get that for free.

Proof

Take any x1,x2I and WLOG x1<x2. Now since f is differentiable on I then it satisfies the properties for Mean Value Theorem (MVT). As such then c[x1,x2] such that:
f(c)=f(x2)f(x1)x2x1
But we know that f(c)=0 (per our given) so then:
f(x2)f(x1)=0f(x2)=f(x1)
so since x1,x2 were arbitrary then all points of the function must be equal, so f is constant.

See this again in Derivative is Zero Implies Constant Function.

But in general there's a generalized version:

Theorem

If f,g are continuous on the closed interval [a,b] and differentiable on the open interval (a,b) then c(a,b) where:
[f(b)f(a)]g(c)=[g(b)g(a)]f(c)
If g0 over (a,b) then the conclusion can be stated as:
f(c)g(c)=f(b)f(a)g(b)g(a)

Proof

Apply Rolle's Theorem (Baby MVT) (or just Mean Value Theorem (MVT)) to the function h(x)=[f(b)f(a)]g(x)[g(b)g(a)]f(x). This is just the linear combination of f(x),g(x). Notice that h(a)=h(b) so then by Rolle's Theorem (Baby MVT) then c(a,b) such that h(c)=0. Taking the derivative gives:
h(x)=[f(b)f(a)]g(x)[g(b)g(a)]f(x)
Thus:
h(c)=[f(b)f(a)]g(c)[g(b)g(a)]f(x)

Application

Remember in Calculus the following limit problem:
limx1ln(x)x1
(we know we haven't formally constructed ln but just roll with it). Normally we'd use L'Hopital's Rule(s). We'd say:
=LHlimx11x1=1
See the L'Hopital's Rule(s) for more on where this comes into play.

The idea here is that x=f(t),y=g(t) gives some parametric curve:

Drawing canvas

That the line connecting two points (f(a),g(a)) and (f(b),g(b)) exists with the same slope somewhere else on the line. This allows for vertical slopes, by the way. Notice that we could generalize this to finitely many functions f1,f2,,fn.

L'Hopital's Rule: 00 case

Let f,g be continuous on an interval containing a and suppose f,g are differentiable on this interval with the possible exception of the point a. If limxaf(x)=limxag(x)=0 and g(x)0 for all xa, then:
limxaf(x)g(x)=LRlimxaf(x)g(x)=L

Proof

Apply the Generalized Mean Value Theorem via the following method. For argument let (b,c) be our interval.

  1. Consider the case that a=b. Let ε>0. Supposing limxaf(x)g(x)=L, choose δ>0 such that 0<|xb|<δ implies that |f(x)g(x)L|<ε2. Let x(b,b+δ). Let y(b,x). By the Generalized Mean Value Theorem, then t(y,x) such that:
    f(t)(g(x)g(y))=g(t)(f(x)f(y))
    and because g(x)g(y) and g(t)0:
    f(t)g(t)=f(x)f(y)g(x)g(y)
    Now since b<t<b+δ then our implication we started with gives:
    Lε2<f(x)f(y)g(x)g(y)<L+ε2
    for all y(a,x). Let yb+ then by the Algebraic Limit Theorem for Functional Limits and Limits and Order (Order Limit Theorem) then taking a limit and using limxaf(x)=0=limxag(x) then:
    Lε<f(x)g(x)<L+ε
  2. Doing the cases for a=c and ca,b are done very similarly.

L'Hopital's Rule: case

Suppose f,g are differentiable on (a,b) and that g(x)0 for all x(a,b). If limxag(x)= (defined here) (or ), then:
limxaf(x)g(x)=Llimxaf(x)g(x)=L

Notice that we only need the denominator to go to in this case. This is different than the 00 case.

Proof

Let ε>0. Because limxaf(x)g(x)=L then δ1>0 such that:
|f(x)g(x)L|<ε2
for all a<x<a+δ1. For convenience of notation, let t=a+δ1 and note that t is fixed for the remainder of the argument.

Our functions are not defined at a, but for any x(a,t) we can apply the Generalized Mean Value Theorem on the interval [x,t] to get:
f(x)f(t)g(x)g(t)=f(c)g(c)
for some c(x,t). Our choice of t then implies that:
Lε2<f(x)f(t)g(x)g(t)<L+ε2
for all x(a,t).

In an effort to isolate the fraction f(x)g(x), the strategy is to multiply the inequality by g(x)g(t)g(x). We need to be sure, however, that this quantity is positive, which amounts to insisting that 1g(t)g(x). Now, because t is fixed and limxag(x)= then we can choose δ2>0 so that g(x)g(t) for all a<x<a+δ2 (because t is fixed, so eventually we pass g(t) as g(x)). Carrying out the desired multiplication results in:
(Lε2)(1g(t)g(x))<f(x)f(t)g(x)<(L+ε2)(1g(t)g(x))
which after some manipulation becomes:
Lε2+Lg(t)+ε2g(t)+f(t)g(x)<f(x)g(x)<L+ε2+Lg(t)ε2g(t)+f(t)g(x)
Notice the $g(x)

Definition

Given g:AR and a Limit Point c of A, we say that limxcg(x)= if, M>0 then δ>0 such that when 0<|xc|<δ then g(x)M.
We define limxcg(x)= in a similar way by considering only M<0 instead.

We use this to prove the case of L'Hopital's Rule(s).s in the denominator. Again, because t is fixed then limxag(x)=. Thus, we can choose a δ3 such that x(a,a+δ3) implies that g(x) is large enough to ensure that the terms:
Lg(t)+ε2g(t)+f(t)g(x),Lg(t)ε2g(t)+f(t)g(x)
are less than ε2 in absolute value (because the numerators are fixed, and g(x)), so using that in our original inequality and choosing δ=min{δ1,δ2,δ3} guarantees that:
Lε2+ε2<f(x)g(x)<L+ε2+ε2
Thus:
|f(x)g(x)L|<ε
for all a<x<a+δ.

!Infinity

We use this to prove the case of L'Hopital's Rule(s).