Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Local maximum and local minimum
Get link
Facebook
X
Pinterest
Email
Other Apps
-
Derivatives can be used to find a function's local extremal values (i.e., local maximum or minimum values).
If \(f(x)\) is a continuous function defined on a closed interval \([a,b]\), then it always has a maximum value and a minimum value (c.f. the Extreme Value Theorem). Finding a maximum or minimum of a function on its entire domain is a global problem.
On the other hand, examining continuity or differentiability around \(x=a\) is a local problem in the sense that it only concerns the neighbor of the point \(x = a\). We may also define the notions of local maxima and local minima.
Definition (Local maximum and local minimum)
Let \(f(x)\) be a function defined on an interval \(I\) and let \(a \in I\).
\(f(a)\) is said to be a local maximum value of the function \(f(x)\) if there exists \(\delta > 0\) such that, for all \(x\in (a - \delta, a + \delta) \cap I\), \(x \neq a\) implies \(f(x) < f(a)\). \(x= a\) is said to be a local maximum point if \(f(a)\) is a local maximum value.
\(f(a)\) is said to be a local minimum value of the function \(f(x)\) if there exists \(\delta > 0\) such that, for all \(x\in (a - \delta, a + \delta) \cap I\), \(x \neq a\) implies \(f(x) > f(a)\). \(x= a\) is said to be a local minimum point if \(f(a)\) is a local minimum value.
We use the term extreme value to mean either a local maximum value or a local minimum value.
Remark. If a local maximum value is actually a maximum value, then the maximum value is called a global maximum value. A global minimum value is similarly defined. Note that a global maximum (minimum) value is a local maximum (minimum) value, but not vice versa. □
Example. The constant function \(f(x) = c\) (\(c\) is a constant) has the maximum value \(c\) and the minimum value \(c\), but it does not have a local maximum value or local minimum value. □
Example. Let \(f(x) = (x^2 - 1)(x^2 - 4)\) (draw the graph!). \(f(0) = 4\) is a local maximum value. In fact, take \(\delta = \sqrt{5} > 0\), then for all \(x\) such that \(0 < |x| < \delta\), we have
\[0 < x^2 < \delta^2\]
(i.e., \(x^2\) is strictly positive) and
\[-5 < x^2 - 5 < \delta^2 - 5 = 0\]
(i.e., \(x^2 - 5\) is strictly negative) so that
\[f(x) = x^2(x^2 - 5) + 4 < 4 = f(0).\]
This means that \(f(0) > f(x)\) for all \(x \in (-\delta, +\delta), x \neq 0\). That is, \(f(0)\) is a local maximum value (check the above definition again!). □
Definition (Stationary/critical point)
Let \(f(x)\) be a differentiable function. \(x=a\) is said to be a critical point or stationary point if \(f'(a) = 0\). In this case, \(f(a)\) is called a critical value or stationary value.
Theorem
If a differentiable function \(f(x)\) has a local extremum value (i.e., either a local maximum or a local minimum value) at \(x = a\), then \(x = a\) is a stationary point.
Proof. We prove only for the local maximum case (the local minimum case is similar).
Suppose \(f(x)\) takes a local maximum value at \(x=a\). Then there exists \(\delta > 0\) such that, for all \(x\in (a - \delta, a + \delta)\), \(f(x) \leq f(a)\). Since \(f(x)\) is differentiable at \(x = a\) (by assumption), we have
If \(0 < a - x < \delta\) (i.e., \(x \in (a - \delta, a)\)), then \(\frac{f(x) - f(a)}{x - a} \geq 0\) so, by taking the limit as \(x \to a-0\), we have \(f'(a)\geq 0\).
If \(0 < x - a < \delta\) (i.e., \(x\in (a, a+\delta)\)), then \(\frac{f(x) - f(a)}{x - a} \leq 0\) so, by taking the limit as \(x \to a+0\), we have \(f'(a) \leq 0\).
Therefore, we have \(f'(a) = 0\). ■
Remark. The converse of this theorem is not true. That is, \(f'(a) = 0\) does not imply \(f(a)\) is an extremum. For example, \(f(x) = x^3\) has \(f'(0) = 0\), but \(f(0)\) is neither a local maximum value nor a local minimum value (draw the graph!). □
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}...
In mathematics, we must prove (almost) everything and the proofs must be done logically and rigorously. Therefore, we need some understanding of basic logic. Here, I will informally explain some rudimentary formal logic. Definitions (Proposition): A proposition is a statement that is either true or false. "True" and "false" are called the truth values, and are often denoted \(\top\) and \(\bot\). Here is an example. "Dr. Akira teaches at UBD." is a statement that is either true or false (we understand the existence of Dr. Akira and UBD), hence a proposition. The following statement is also a proposition, although we don't know if it's true or false (yet): Any even number greater than or equal to 4 is equal to a sum of two primes. See also: Goldbach's conjecture Next, we define several operations on propositions. Note that propositions combined with these operations are again propositions. (Conjunction, logical "and"): Let \(P\)...
Defining sets Set theory is the foundation of modern mathematics. Every mathematical notion is built on some set. What is a set? This is a very deep question beyond the scope of this lecture. Instead, we give the following very rough, informal definition. Definition (very informal) A set is a collection of distinct objects. Objects of a set are called elements of the set. To denote a set, we can enumerate its elements, enclosed by curly brackets. For example, \[\{1, 2, 3\}\] denotes a set consisting of three elements that are 1, 2, and 3. We may give a set a name as in \[S = \{1, 2, 3\},\] and say, for example, "the set \(S\) contains the elements 1, 2, and 3. Suppose \(S\) is any set. To denote that an object \(x\) is an element of \(S\), we write \[x \in S\] and say "\(x\) is in \(S\)" and so on. To denote that \(x\) is not in \(S\), we write \[x \not\in S.\] It is important that the elements of a set are distinct. For example, \[\{a, a, b, c\}\] is not a set beca...
Comments
Post a Comment