Overview
In this chapter, we study some of the consequences of the Mean Value Theorem (MVT) for derivatives. We introduced this theorem in , and have already applied it in three different contexts.
-
In , where we proved that a positive (negative) rate of change of a quantity implies that the quantity increases (decreases).
-
In the context of antiderivatives, in we proved the following:
-
if \(f\) is a differentiable function over an open interval \(I\), and if \(f ‘(x) = 0\) for all \(x \in I\), then \(f \) is constant on \(I\).
-
Let \(f\) and \(g\) be differentiable functions on an open interval \(I\). If \(f ‘ (x) = g'(x)\) for all \(x \in I\), then there exists a constant \(C\in \mathbb{R}\) such that \(f (x) =g(x) + C\) for all \(x \in I\).
And, as an immediate consequence, we also proved:
-
-
In , the MVT played a central role in the first proof we gave of TFTCP2.
In this chapter, we do two things: first, prove the MVT, and then, we apply it in several new contexts such as
- To estimate differences of the values of functions.
- To establish an integration formula to compute the arclength of the graph of a function.
- To prove the First Derivative Test, to determine whether a function is increasing or decreasing (similar to (1) above).
- To prove the Test for Concavity for the graph of a function.
- To prove the Second Derivative Test.
- To measure the degree of accuracy of linear approximations.
It is clear that the significance of the MVT cannot be overemphasized.
To prove the MVT, we follow a chain of theorems that includes, among others, Fermat’s Theorem and the Extreme Value Theorem.
-
These theorems in turn will be applied to solve optimization problems.
7.1.1 Statements
Recall the MVT, see for more details.
Theorem 1 (Mean Value Theorem for Derivatives). Let \(f\) be a continuous function on the closed interval \([a,b]\), and differentiable on \((a,b)\). Then there exists at least one number \(c\) in \((a,b)\) such that
\[f'(c) = \frac{f(b)-f(a)}{b-a}\;\;\; \mathrm{ or } \;\;\; f(b)-f(a)= f'(c)(b-a).\]
To prove the MVT, we first prove the following special case.
Theorem 2 (Rolle’s Theorem).
Let \(f\) be a continuous function on the closed interval \([a,b]\), and differentiable on \((a,b)\). Assume that \(f(a) = f(b)\).
Then there exists at least one number \(c\) in \((a,b)\) such that
\(f'(c) = 0\).
Observation. Note that Rolle’s Theorem (RT) is a special case of the MVT because if \(f(a) = f(b)\), then the the secant line connecting the points \(A(a,f(a))\) and \(B(b, f(b))\) is horizontal as in Figure (a), and hence its slope is zero.
The plausibility of RT can be seen from two different viewpoints.
-
– Sliding the secant line connecting the points \(A(a,f(a))\) and \(B(b, f(b))\), we can intuitively see that there will be a point where the line will be tangent to the graph.
-
– It would seem that at a highest/lowest point on the graph of the function (above/below the horizontal line segment \(AB\)), the tangent line would have to be horizontal, as in Figure (b).
Recall that for a continuous function \(f\) defined on a closed interval \([a,b]\), the Extreme Value Theorem (EVT) guarantees the existence of an absolute maximum/minimum value (see ). Furthermore, we have already used the EVT in (see Theorem ) when proving the MVT for Integrals (see the proof of Theorem ).
Theorem 3. (The Extreme Value Theorem.) If \(f\) is a continuous function over a closed interval \([a, b]\), then there exist points \(x_1\) and \(x_2\) in \([a, b]\) such that \(f(x_1)\) is an absolute maximum value and \(f(x_2)\) is an absolute minimum value of \(f\) on \([a, b]\).
In fact, RT is an immediate consequence of the EVT and Fermat’s Theorem (FT).
Theorem 4. (Fermat’s Theorem.) If f is a continuous function over a closed interval \([a, b]\),
\(f(c)\) is an absolute maximum value or an absolute minimum value of \(f\) on \((a, b)\), and \(f\) is differentiable at \(c\), then \(f'(c) = 0\).
Figure (b) shows the plausibility of FT. Note also that \(c\) is not an endpoint of the interval \([a,b]\).
The proof of the EVT relies on the Least Upper Bound Axiom (LUBA) (or Completeness Axiom) for the real numbers. To state this axiom, we need the following.
Definition 1. Let \(S\) be a nonempty set of real numbers.
An upper bound for \(S\) is a number \(M \in \mathbb{R}\) such that
\[x\leq M \;\;\; \forall \; x\in S.\]
If \(S\) has an upper bound, \(S\) is said to be bounded from above.
A least upper bound (or supremum) for \(S\) is a number sup \(S\) such that
- sup \(S\) is an upper bound for \(S\);
- if \(M\) is another upper bound for \(S\), then sup \(S\) ≤ \(M\).
Axiom. (The Least-Upper-Bound Axiom.) Let \(S\) be a nonempty set of real numbers that is bounded from above, then there exists a unique least upper bound sup \(S\) of \(S\).
We now have the following chain.
Least Upper Bound Axiom \(\Longrightarrow\) Extreme Value Theorem
\(\small{{
\begin{cases}
\text{Extreme Value Theorem} \\
\text{Fermat’s Theorem}
\end{cases}}\Longrightarrow \; Rolle’s\; Theorem \; \Longrightarrow \; Mean\; Value\; Theorem.}\)
A generalization of the MVT is readily available, which we will denote by CMVT. This generalization is due to the french mathematician Cauchy.
Theorem 5 (Cauchy Mean Value Theorem) Let \(f\) and \(g\) be continuous functions on the closed interval \([a,b]\) and differentiable on the open interval \((a,b)\). Then, there exists at least one \(c\in (a,b)\) such that
\[(f(b)-f(a))g'(c) = (g(b)-g(a)) f'(c).\]
Observation. This theorem is indeed a generalization of the MVT, since taking \(g(x) =x\), immediately leads to the MVT. We will use CMVT to prove l’Hôpital’s rule.
We will not prove the EVT. For a proof see Apostol, p. 391. We will assume its validity, and then proceed to prove FT, RT, the MVT, and CMVT.
The Intermediate Value Theorem (IVT), see for its plausibility, can be proven using the LUBA. For the sake of completeness, we restate this theorem, and provide a proof of the same in .
Theorem 6 (Intermediate Value Theorem) Let \(f\) be a continuous function on the closed interval \([a,b]\), and assume that \(N\) is a number between \(f(a)\) and \(f(b)\), then there exists a number \(c\) between \(a\) and \(b\) such that \(f(c) = N\).
It is interesting to note that there is an analogous IVT for derivatives. This is Darboux Theorem (DT), which was proven by the French mathematician Jean Gaston Darboux (1842–1917) in 1875. DT can actually be proven as a consequence of the MVT together with the IVT, or as a consequence of EVT and FT, as we shall see in .
Theorem 7 (Darboux Theorem.) Let \(I\) be an open interval, and let \(f\) be a differentiable function on \(I\). If \(a\) and \(b\) are points in \(I\) with \(a < b\) and if \(N\) lies between \(f'(a)\) and \(f'(b)\), then there exists a number \(c \in [a, b]\) such that \(f'(c) = N\).
Remark. This theorem is immediate if \(f’\) is continuous on \(I\). However, the theorem asserts that this assumption is not necessary in the context of the derivative of a function. DT will be particularly useful when studying the shape of the graph of a function (see Proposition in ).
7.1.2 Exercises
- State the following definitions:
- absolute maximum/minimum value of a function;
- for a nonempty set \(S\) of real numbers:
- upper bound;
- least upper bound;
- bounded from above;
- bounded from below (new);
- lower bound (new);
- greatest lower bound (new)
-
- State the Least Upper Bound Axiom;
- Is it necessary to introduce a Greatest Lower Bound Axiom? Why or why not?
- Is the Least Upper Bound Axiom valid if we consider only the set of rational numbers?
-
For each of the theorems in (a)–(f): (i) state the assumptions of the theorem; (ii) state the conclusion of the theorem; (iii) draw a picture that intuitively shows the validity of the theorem.
- The Mean Value Theorem.
- Rolle’s Theorem.
- The Extreme Value Theorem.
- Fermat’s Theorem.
- The Intermediate Value Theorem.
- Cauchy Mean Value Theorem.
- Darboux Theorem.
-
Show that if \(S\) is a nonempty set of real numbers bounded from below, then there exists a greatest lower bound, \(\inf S\) for \(S\). As part of your answer, explicitly state what it meas that the set is bounded from below, and the meaning of \(\inf S\). Hint: Consider the set \(S_1 = \{ -x\,:\, x\in S\}\), and apply the LUBA to \(S_1\).
7.1.3 Chains of Arguments
As pointed out above, we have the following chains.
Least Upper Bound Axiom \(\Longrightarrow\) Extreme Value Theorem
\(\small{{
\begin{cases}
\text{Extreme Value Theorem}\\
\text{Fermat’s Theorem}
\end{cases}} \Longrightarrow \; Rolle’s\; Theorem \Longrightarrow Mean \;Value \;Theorem.}\)
Rolle’s Theorem \(\Longrightarrow\) Cauchy Mean Value Theorem.
Least Upper Bound Axiom \(\Longrightarrow\) Intermediate Value Theorem
and
\(\small{
\begin{cases}
\text{Intermediate Value Theorem}\\
\text{Mean Value Theorem}
\end{cases}\Longrightarrow Darboux\; Theorem
}\)
Remark. It must be pointed out that there are other chains of arguments leading to the same results.
We will not prove that LUBT \(\Longrightarrow\) EVT. For a proof see Apostol, p. 391. We will assume its validity, and then proceed to complete the chains of arguments.
FT.
Proof In the notation of FT, assume that \(f(c)\) is an absolute maximum of \(f\) (the proof for an absolute minimum is analogous, and is left as a exercise see # ). We need to show that
\[\lim_{x\to c}\frac{f(x)-f(c)}{x-c} = 0.\]
Or, alternatively,
\[ \lim_{x\to c^+}\frac{f(x)-f(c)}{x-c} = \lim_{x\to c^-}\frac{f(x)-f(c)}{x-c}= 0.\]
Note that
\[\small{ f(x) \leq f(c) \;\; \forall \; x \in [a,b] \;\; \Longleftrightarrow \;\; f(x) – f(c) \leq 0 \;\; \forall \; x \in [a,b].}\]
Then
\[ \small{ \lim_{x\to c^+}\frac{f(x)-f(c)}{x-c} \leq 0 \;\; \text{and} \;\; \lim_{x\to c^-}\frac{f(x)-f(c)}{x-c} \geq 0 \;\; \text{(why?)}}\]
And, since both limits must be equal, then, they must be equal to zero. Note here, that in the proof it is essential that \(c\) be a point in the open interval \((a,b)\) and not one of the endpoints of the interval.
EVT and FT \(\pmb{\Longrightarrow}\) RT.
Proof In the notation of the statement of RT, if \(f\) is constant on \([a,b]\), then \(f'(c)=0\) for all \(c\in (a,b)\). Thus, assume that \(f\) is not constant. Then, by the EVT, there exist an absolute maximum value \(M\) and an absolute minimum value \(m\) of \(f\) on \([a,b]\) such that
\[m \leq f(x) \leq M\;\;\; \forall \; x\in [a,b].\]
Since \(f\) is nonconstant, then, either \(m \neq f(a) \, (= f(b))\) or \(M \neq f(a) \, (= f(b))\) (otherwise, \(f\) would necessarily be constant). If, say \(M \neq f(a)\), then, there exists \(c\in (a,b)\) such that \(f(c)= M\), and, by FT, \(f'(c) = 0\).
RT \(\pmb{\Longrightarrow}\) MVT.
Proof Here, we apply RT to the function
\[g(x) = f(x) – f(a) -\frac{f(b)-f(a)}{b-a}(x-a), \;\;\; x\in [a,b].\]
Note that \(g\) is continuous on \([a,b]\) and differentiable on \((a,b)\), and, furthermore, \(g(a) = g(b) =0\), that is, \(g\) satisfies the assumptions of RT. Thus, there exists \(c\in (a,b)\) such that \(g'(c)=0\). Since
\[ \scriptsize{g'(x) = f'(x) -\frac{f(b)-f(a)}{b-a} \; \Longrightarrow \; g'(c)=0 \Longleftrightarrow f'(c) = \frac{f(b)-f(a)}{b-a}.}\]
RT \(\pmb{\Longrightarrow}\) CMVT.
Proof Here, we apply RT to the function
\[h(x) = ( f(b) – f(a))g(x) – ( g(b)-g(a))f(x), \;\;\; x\in [a,b].\]
Note that \(h\) is continuous on \([a,b]\) and differentiable on \((a,b)\), and, furthermore, \(h(a) = h(b)\), that is, \(h\) satisfies the assumptions of RT. Thus, there exists \(c\in (a,b)\) such that \(h'(c)=0\). Since \(h'(x) = ( f(b) – f(a))g'(x) -( g(b)-g(a))f'(x) \),
\[h'(c)=0 \; \Longleftrightarrow \; ( f(b) – f(a))g'(c) =( g(b)-g(a))f'(c) .\]