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)\).
Let \(\mathbf{X} = (X_1, X_2, \cdots, X_n)^\top\) be a vector of random variables. We say it follows the multivariate normal (Gaussian) distribution if its density is given by \[f(\mathbf{x}) = \frac{1}{\sqrt{(2\pi)^n|\Sigma|}}\exp\left(-\frac{1}{2}(\mathbf{x} - \boldsymbol{\mu})^\top\Sigma^{-1}(\mathbf{x} - \boldsymbol{\mu})\right)\tag{Eq:density}\] where \(\boldsymbol{\mu} = (\mu_1, \mu_2, \cdots, \mu_n)^\top \in \mathbb{R}^n\) is a vector, \(\Sigma\) is a symmetric positive definite \(n\times n\) matrix, and \(\Sigma^{-1}\) and \(|\Sigma|\) are the inverse and determinant of \(\Sigma\), respectively. It turns out that \(\boldsymbol{\mu}\) and \(\Sigma\) are the mean vector and covariance matrix of \(\mathbf{X}\), respectively. But we will not prove that here. In this post, we will show this density (Eq:density) is normalized (of course). That is, we prove that \[\int_{\mathbb{R}^n}f(\mathbf{x})d\mathbf{x} = 1.\] We assume that you already know how to prove the univariate nor...
We show some basic properties of differentiation, such as linearity, the product rule, the quotient rule, the chain rule, etc. We also introduce higher-order derivatives and differentiability classes. Theorem (Properties of differentiation) Let \(f(x)\) and \(g(x)\) be differentiable functions on an open interval \(I\). (Linearity) \[\frac{d}{dx}[kf(x) + lg(x)] = kf'(x) + lg'(x)\] where \(k, l\) are constants. (Product rule) \[\frac{d}{dx}[f(x)g(x)] = f'(x)g(x) + f(x)g'(x).\] (Quotient rule) \(\frac{f(x)}{g(x)}\) is differentiable on \(\{x \mid g(x) \neq 0, x\in I\}\) and \[\frac{d}{dx}\left[\frac{f(x)}{g(x)}\right] = \frac{f'(x)g(x) - f(x)g'(x)}{[g(x)]^2}.\] Proof . Exercise. Since \(f(x)\) is differentiable at \(x=a\), it is continuous at \(x=a\) so \(f(x) \to f(a)\) as \(x \to a\). For any \(a\in I\), \[\begin{eqnarray*} \frac{f(x)g(x) - f(a)g(a)}{x - a} &=& \frac{f(x)g(x) - f(x)g(a) + f(x)g(a) - f(a)g(a)}{x - a}\\ &=& f(x)\cdot\frac{g(x) ...
Let \(\mathbf{X} = (X_1, X_2, \cdots, X_n)^\top \in \mathbb{R}^n\) be a vector of random variables. The covariance matrix \(\Sigma\) of \(\mathbf{X}\) is a square (\(n\times n\)) matrix whose elements are covariances between the components of \(\mathbf{X}\). That is, \[\Sigma_{ij} = \mathrm{Cov}(X_i,X_j)\] where \(\mathrm{Cov}(X_i,X_j)\) is the covariance between \(X_i\) and \(X_j\) , \(i,j = 1, 2, \cdots, n\): \[\mathrm{Cov}(X_i, X_j) = \mathbb{E}[(X_i - \mathbb{E}[X_i])(X_j - \mathbb{E}[X_j])].\] Here, \(\mathbb{E}[\cdot]\) indicates the expectation value of a random variable . Any covariance matrix has the following properties: Symmetric. That is, \[\Sigma = \Sigma^\top.\] Positive semi-definite. That is,\[\forall \mathbf{v} \in \mathbb{R}^n, \mathbf{v}^\top\Sigma\mathbf{v} \geq 0.\] See also : Positive definite matrix (Wolfram MathWorld) The symmetry is obvious from the definition of the covariance matrix. Now, let us prove that the covariance matrix is positive semi-...
Comments
Post a Comment