Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Mean Value Theorem
Get link
Facebook
X
Pinterest
Email
Other Apps
-
The mean value theorem (MVT) says that, for a given arc connecting two points of a function, there is at least one point at which the slope of the tangent line is equal to the slope of the arc.
Theorem (Rolle's theorem)
Let \(f(x)\) be a continuous function defined on a closed interval \([a, b]\). Suppose \(f(x)\) is differentiable on the open interval \((a, b)\) and \(f(a) = f(b)\). Then there exists a \(c\in (a,b)\) such that \(f'(c) = 0\).
Proof. If the (global) maximum and minimum are both at \(x=a\) and \(x=b\), then \(f(x)\) is constant since \(f(a) = f(b)\) (= maximum = minimum). In this case, \(f'(x)=0\) at all \(x \in (a,b)\). Otherwise, \(f(x)\) has a maximum or minimum value at some \(c \in (a,b)\) so that \(f'(c) = 0\). ■
Theorem (Mean value theorem)
Let \(f(x)\) be a continuous function on \([a,b]\) such that it is differentiable on \((a,b)\). Then there exists a \(c \in (a,b)\) such that
Then, \(g(x)\) is continuous on \([a, b]\) and differentiable on \((a,b)\), and \(g(a) = g(b) = f(a)\). Hence, by Rolle's theorem, there exists a \(c\in(a,b)\) such that \(g'(c) = 0\). But
\[g'(c) = f'(c) - \frac{f(b) - f(a)}{b - a} = 0\]
so
\[f'(c) = \frac{f(b) - f(a)}{b - a}.\]
■
Let's see some applications of the mean value theorem.
Corollary
Suppose that the function \(f(x)\) is differentiable on the open interval \(I=(a,b)\) and identically \(f'(x) = 0\) on \(I\). Then \(f(x)\) is a constant function on \(I\). That is, \(f(x) = C\) for all \(x \in I\) where \(C\) is a constant.
Proof. Let us pick an arbitrary \(c\in (a,b)\) and let \(C = f(c)\). We show that for all \(x\in(a,b)\), \(f(x) = C\). If \(x=c\), then \(f(x) = C\) by definition of \(C\). Suppose \(x\neq c\). If \(x < c\), consider the closed interval \([x, c]\). Since \(f(x)\) is differentiable on \((a,b)\), it is continuous on \([x, c]\). By the mean value theorem, there is a \(d\in(x,c)\) such that \(f(x) - f(c) = f'(d)(x-c)\). But since \(f'(d) = 0\) (by assumption), \(f(x) = f(c) = C\). If \(x > c\), we consider the closed interval \([c, x]\) and apply a similar argument. ■
Corollary (cor:monotone)
Suppose the function \(f(x)\) is continuous on the closed interval \([a,b]\) and differentiable on the open interval \((a,b)\).
If \(f'(x) > 0\) for all \(x\in (a,b)\), then \(f(x)\) is strictly monotone increasing on \([a,b]\).
If \(f'(x) < 0\) for all \(x\in (a,b)\), then \(f(x)\) is strictly monotone decreasing on \([a,b]\).
Proof. We only show part 1. Part 2 is similar.
It suffices to show that, for any \(c, d\in [a,b]\), if \(c < d\) then \(f(c) < f(d)\).
By assumption, \(f(x)\) is continuous on \([c,d]\) and differentiable on \((c,d)\). By the mean value theorem, there exists a \(t\in(c,d)\) such that \(f(d) - f(c) = f'(t)(d - c)\). But since \(f'(t) > 0\), we have \(f'(t)(d - c) > 0\) so that \(f(d) - f(c) > 0\). ■
Corollary (cor:minmax)
Suppose that the function \(f(x)\) is twice differentiable and that \(f'(c) = 0\) at some \(c\in (a,b)\).
If \(f''(c) > 0\), then \(x = c\) is a local minimum point.
If \(f''(c) < 0\), then \(x = c\) is a local maximum point.
Let \(\varepsilon = f''(c) (> 0)\). There exists a \(\delta > 0\) such that, for all \(x \in (a,b)\), \(0 < |x - c| < \delta\) implies \(\left|\frac{f'(x)}{x - c} - f''(c)\right| < \varepsilon\) or
In particular, if \(c - \delta < x < c\), then \(x - c < 0\) so \(f'(x) < 0\). That is, for all \(x \in (c -\delta, c)\), \(f(x) > f(c)\) (Corollary {cor:monotone}).
If \(c < x < c + \delta\), we have \(f'(x) > 0\) so, by the same argument (Corollary {cor:monotone}), \(f(c) < f(x)\).
In summary, for all \(x \in (c - \delta, c + \delta)\), if \(x \neq c\), then \(f(x) > f(c)\), which shows that \(f(c)\) is a local minimum value. ■
Definition (Convex, concave)
Let \(f(x)\) be a function defined on an open interval \(I\). \(f(x)\) is said to be convex at \(x= c\) if the graph of \(y= f(x)\) is above its tangent line at \(x=c\) in the neighbor of \(x=c\), that is, if there exists a \(\delta > 0\) such that, for all \(x\in I\), \(0 < |x - c| < \delta\) implies \(f(x) > f'(c)(x - c) + f(c)\).
Similarly, \(f(x)\) is said to be concave at \(x = c\) if the graph of \(y = f(x)\) is below its tangent line at \(x=c\) in the neighbor of \(x=c\), that is, there exists a \(\delta > 0\) such that, for all \(x \in I\), \(0 < |x - c| < \delta\) implies \(f(x) < f'(c)(x - c) + f(c)\).
Remark. Recall that \(y = f'(c)(x - c) + f(c)\) is the equation of the tangent line of \(f(x)\) at \(x=c\). □
Corollary
Let \(f(x)\) be a twice differentiable function on an open interval \(I\) and \(c\in I\).
If \(f''(c) > 0\), then \(f(x)\) is convex at \(x=c\).
If \(f''(c) < 0\), then \(f(x)\) is concave at \(x=c\).
Proof. We prove only part 1. Part 2 is similar.
Let us define \(g(x) = f(x) - [f'(c)(x - c) + f(c)]\). \(g(x)\) is twice differentiable on \(I\) and \(g'(x) = f'(x) - f'(c)\) so \(g(c) = g'(c) = 0\). Also, \(g''(x) = f''(x)\) so that \(g''(c) = f''(c) > 0\). Therefore, by Corollary {cor:minmax}, \(x=c\) is a local minimum point of \(g(x)\). By the definition of local minimum, it follows that \(f(x)\) is convex \(x = c\). ■
Example. Consider \(f(x) = e^{-x^2}\). Let us find the range of \(x\) where \(f(x)\) is convex and where it is concave. Let us also find the extrema of \(f(x)\).
We can use multiple integrals to compute areas and volumes of various shapes. Area of a planar region Definition (Area) Let \(D\) be a bounded closed region in \(\mathbb{R}^2\). \(D\) is said to have an area if the multiple integral of the constant function 1 over \(D\), \(\iint_Ddxdy\), exists. Its value is denoted by \(\mu(D)\): \[\mu(D) = \iint_Ddxdy.\] Example . Let us calculate the area of the disk \(D = \{(x,y)\mid x^2 + y^2 \leq a^2\}\). Using the polar coordinates, \(x = r\cos\theta, y = r\sin\theta\), \(dxdy = rdrd\theta\), and the ranges of \(r\) and \(\theta\) are \([0, a]\) and \([0, 2\pi]\), respectively. Thus, \[\begin{eqnarray*} \mu(D) &=& \iint_Ddxdy\\ &=&\int_0^a\left(\int_0^{2\pi}rd\theta\right)dr\\ &=&2\pi\int_0^a rdr\\ &=&2\pi\left[\frac{r^2}{2}\right]_0^a = \pi a^2. \end{eqnarray*}\] □ Volume of a solid figure Definition (Volume) Let \(V\) be a solid figure in the \((x,y,z)\) space \(\mathbb{R}^3\). \(V\) is...
Defining the birth process Consider a colony of bacteria that never dies. We study the following process known as the birth process , also known as the Yule process . The colony starts with \(n_0\) cells at time \(t = 0\). Assume that the probability that any individual cell divides in the time interval \((t, t + \delta t)\) is proportional to \(\delta t\) for small \(\delta t\). Further assume that each cell division is independent of others. Let \(\lambda\) be the birth rate. The probability of a cell division for a population of \(n\) cells during \(\delta t\) is \(\lambda n \delta t\). We assume that the probability that two or more births take place in the time interval \(\delta t\) is \(o(\delta t)\). That is, it can be ignored. Consequently, the probability that no cell divides during \(\delta t\) is \(1 - \lambda n \delta t - o(\delta t)\). Note that this process is an example of the Markov chain with states \({n_0}, {n_0 + 1}, {n_0 + 2}...
Consider integrating a function \(f(x,y)\) over a region \(D\) which may not be bounded or closed. In the case of a univariate function, this corresponds to the improper integral where we took the limits of the endpoints of a closed interval. In the case of multiple integrals, we adopt the notion of a "sequence of regions." Consider a sequence of regions \(\{K_n\}\) where each \(K_n\) is a subset of \(\mathbb{R}^2\) that satisfies the following conditions: (a) \(K_1 \subset K_2\)\(\subset \cdots \subset\) \(K_n \subset K_{n+1} \subset \cdots\). (b) For all \(n\in \mathbb{N}\), \(K_n \subset D\). (c) For all \(n \in\mathbb{N}\), \(K_n\) is bounded and closed. (d) For any bounded closed set \(F\) that is included in \(D\) (i.e., \(F \subset D\)), if \(n\) is sufficiently large, then \(F \subset K_n\). In other words: for all bounded closed \(F \subset D\), there exists some \(N\in \mathbb{N}\) such that, for all \(n\in \mathbb{N}\), if \(n \geq N\) then \(F \subset K_...
Comments
Post a Comment