Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Lecture 11/latex
\setcounter{section}{11}
\zwischenueberschrift{The Intermediate value theorem}
We want to know what happens to an interval \mathl{[a,b]}{} under a continuous function $f \colon \R \rightarrow \R$. The values \mathkor {} {f(a)} {and} {f(b)} {} belong to the image. The Intermediate value theorem tells us that all numbers between \mathkor {} {f(a)} {and} {f(b)} {} do also belong to the image of the interval.
\inputfaktbeweis
{Continuous function/R/Intermediate value theorem/Fact}
{Theorem}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{ a
}
{ \leq }{ b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be
real numbers,
and let
$f \colon [a,b] \rightarrow \R$
be a
continuous function.
Let
\mavergleichskette
{\vergleichskette
{ u
}
{ \in }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be a real number between
\mathkor {} {f(a)} {and} {f(b)} {.}}
\faktfolgerung {Then there exists an
\mavergleichskette
{\vergleichskette
{ x
}
{ \in }{ [a,b]
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that
\mavergleichskette
{\vergleichskette
{f(x)
}
{ = }{u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}}
\faktzusatz {}
}
{
We consider the situation
\mavergleichskette
{\vergleichskette
{f(a)
}
{ \leq }{u
}
{ \leq }{f(b)
}
{ }{
}
{ }{
}
}
{}{}{,}
and show the existence of such an $x$ with the bisection method. For that, we put
\mathkor {} {a_0 \defeq a} {and} {b_0 \defeq b} {,}
we consider the arithmetic mean
\mavergleichskette
{\vergleichskette
{ x_0
}
{ \defeq }{ { \frac{ a_0 + b_0 }{ 2 } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
and we compute
\mathdisp {f { \left( x_0 \right) }} { . }
If
\mavergleichskette
{\vergleichskette
{ f { \left( x_0 \right) }
}
{ \leq }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
then we put
\mathdisp {a_1 \defeq x_0 \text{ and } b_1 \defeq b_0} { }
and if
\mavergleichskette
{\vergleichskette
{ f { \left( x_0 \right) }
}
{ > }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
then we put
\mathdisp {a_1 \defeq a_0 \text{ and } b_1 \defeq x_0} { . }
In each case, the new interval \mathl{[a_1,b_1]}{} is lying inside the initial interval and has half of its length. It fulfills again the condition
\mavergleichskette
{\vergleichskette
{ f { \left( a_1 \right) }
}
{ \leq }{ u
}
{ \leq }{ f { \left( b_1 \right) }
}
{ }{
}
{ }{
}
}
{}{}{,}
therefore we can apply the same defining method again and get recursively a family of
nested intervals.
Let $x$ denote the real number which is determined by these nested intervals. For the lower bounds of the intervals, we have
\mavergleichskette
{\vergleichskette
{ f { \left( a_n \right) }
}
{ \leq }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
and this carries over to the limit $x$, due to the
criterion for continuity in terms of sequences.
Hence,
\mavergleichskette
{\vergleichskette
{ f { \left(x \right) }
}
{ \leq }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
For the upper bounds, we have
\mavergleichskette
{\vergleichskette
{ f { \left( b_n \right) }
}
{ \geq }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
and this again carries over to $x$, so
\mavergleichskette
{\vergleichskette
{ f(x)
}
{ \geq }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.} Therefore,
\mavergleichskette
{\vergleichskette
{ f(x)
}
{ = }{ u
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
The method described in this proof is constructive and can be used to give an explicit numerical method.
\inputfaktbeweis
{Continuous function/R/Intermediate value theorem/0-version/Fact}
{Corollary}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{ a
}
{ \leq }{ b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be
real numbers,
and let
$f \colon [a,b] \rightarrow \R$
be a
continuous function
with
\mavergleichskette
{\vergleichskette
{ f(a)
}
{ \leq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mavergleichskette
{\vergleichskette
{ f(b)
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}}
\faktfolgerung {Then there exists an
\mavergleichskette
{\vergleichskette
{ x
}
{ \in }{ [a,b]
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that
\mavergleichskette
{\vergleichskette
{f(x)
}
{ = }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}}
\faktzusatz {}
}
{
This follows immediately from Theorem 11.1 .
\inputverfahren{}
{
Let
\mavergleichskette
{\vergleichskette
{ a
}
{ \leq }{ b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be
real numbers,
and let
$f \colon [a,b] \rightarrow \R$
denote a
continuous function
such that
\mathkor {} {f(a) \leq 0} {and} {f(b) \geq 0} {.}
Then the function has a zero within the interval, due to
the Intermediate value theorem.
Such a zero can be found by the \stichwort {bisection method} {,} as described in the proof
of the Intermediate value theorem.
We put
\mathkor {} {a_0=a} {and} {b_0=b} {,}
and the other interval bounds are inductively defined in such a way that
\mavergleichskette
{\vergleichskette
{f(a_n)
}
{ \leq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mavergleichskette
{\vergleichskette
{f(b_n)
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
hold. Define
\mavergleichskette
{\vergleichskette
{ x_n
}
{ = }{ { \frac{ a_n+b_n }{ 2 } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and compute $f(x_n)$. If
\mavergleichskette
{\vergleichskette
{ f { \left( x_n \right) }
}
{ \leq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
then we set
\mathdisp {a_{n+1} \defeq x_n \text{ and } b_{n+1} \defeq b_n} { , }
and if
\mavergleichskette
{\vergleichskette
{f { \left( x_n \right) }
}
{ > }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
then we set
\mathdisp {a_{n+1} \defeq a_n \text{ and } b_{n+1} \defeq x_n} { . }
In both cases, the new interval \mathl{[a_{n+1}, b_{n+1}]}{} has half the length of the preceding interval and so we have bisected intervals. The
real number
$x$ defined by these nested intervals is a zero of the function.
}
\inputbeispiel{}
{
We want to determine approximately a zero for the polynomial
\mavergleichskettedisp
{\vergleichskette
{ f(x)
}
{ =} {x^3-4x+2
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
with the help of the method given by the Intermediate value theorem. We have
\mavergleichskette
{\vergleichskette
{f(1)
}
{ = }{-1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mavergleichskette
{\vergleichskette
{f(2)
}
{ = }{2
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
hence by
Corollary 11.2
,
there must be a zero inside the interval \mathl{[1,2]}{.} We compute the value of the function at the arithmetic mean of the interval, which is \mathl{{ \frac{ 3 }{ 2 } }}{,} and get
\mavergleichskettedisp
{\vergleichskette
{f { \left( { \frac{ 3 }{ 2 } } \right) }
}
{ =} { { \frac{ 27 }{ 8 } } - 4 \cdot { \frac{ 3 }{ 2 } } +2
}
{ =} { { \frac{ 27- 48+16 }{ 8 } }
}
{ =} { { \frac{ -5 }{ 8 } }
}
{ <} { 0
}
}
{}{}{.}
Hence, we have to continue with the right half of the interval \mathl{[ { \frac{ 3 }{ 2 } } , 2]}{.} The arithmetic mean thereof is \mathl{{ \frac{ 7 }{ 4 } }}{.} The value of the function at this point is
\mavergleichskettedisp
{\vergleichskette
{ f { \left( { \frac{ 7 }{ 4 } } \right) }
}
{ =} { { \left( { \frac{ 7 }{ 4 } } \right) }^3 - 4 \cdot { \frac{ 7 }{ 4 } } +2
}
{ =} { { \frac{ 343 }{ 64 } } -5
}
{ =} { { \frac{ 343 - 320 }{ 64 } }
}
{ =} { { \frac{ 23 }{ 64 } }
}
}
{
\vergleichskettefortsetzung
{ >} { 0
}
{ } {}
{ } {}
{ } {}
}{}{.}
So now we have to continue with the left part of the interval, namely \mathl{[ { \frac{ 3 }{ 2 } } , { \frac{ 7 }{ 4 } } ]}{.} Its arithmetic mean is \mathl{{ \frac{ 13 }{ 8 } }}{.} The value of the function at this point is
\mavergleichskettedisp
{\vergleichskette
{ f { \left( { \frac{ 13 }{ 8 } } \right) }
}
{ =} { { \left( { \frac{ 13 }{ 8 } } \right) }^3 - 4 \cdot { \frac{ 13 }{ 8 } } +2
}
{ =} { { \frac{ 2197 }{ 512 } } - { \frac{ 13 }{ 2 } } +2
}
{ =} { { \frac{ 2197 -3328+1024 }{ 512 } }
}
{ =} { { \frac{ -107 }{ 512 } }
}
}
{
\vergleichskettefortsetzung
{ <} { 0
}
{ } {}
{ } {}
{ } {}
}{}{.}
Therefore, we know that there is a zero between
\mathkor {} {{ \frac{ 13 }{ 8 } }} {and} {{ \frac{ 7 }{ 4 } } = { \frac{ 14 }{ 8 } }} {.}
}
\inputremark {}
{
The existence of arbitrary roots of nonnegative real numbers follows also from
the Intermediate value theorem,
since, for
\mavergleichskette
{\vergleichskette
{c
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the continuous function \mathl{X^k - c}{} attains negative and positive values and has therefore also a zero. The proof of
Theorem 8.13
rests on the method of the Intermediate value theorem, even though continuity is not explicitly used.
}
\inputbeispiel{}
{
Suppose that a regular quadratic table with four table legs \mathl{A,B,C,D}{} is standing on an uneven but stepfree underground. At the moment, it stands on the legs \mathl{A,B,C}{,} and the leg $D$ does not touch the ground \zusatzklammer {if we leave $B,C$ in their positions and put $D$ down to the ground, then $A$ would sink into the ground} {} {.} We claim that we can bring the table, by turning it around its middle axis, into a position such that it stands on all four legs \zusatzklammer {we do not claim that the table is then horizontal} {} {.} To see this, we consider the function which assigns to the angle of rotation, the height of $D$ above the ground, when the three other legs are \zusatzklammer {or would be} {} {} on the ground. This height might be negative \zusatzklammer {if we are on sand, this can be realized, else think of this \anfuehrung{ideally}{}} {} {.} In degree $0$, the height is positive. In degree \mathl{90}{,} we get a situation which is symmetric to the initial position, but still the legs \mathl{A,B,C}{} are supposed to be on the ground. Hence, the height of $D$ is now negative. The function has, on the interval \mathl{[0 , 90]}{,} positive and also negative values. Since the function is continuous, by the Intermediate value theorem, it also has a zero.
}
\zwischenueberschrift{Continuous bijective functions and their inverse functions}
For a bijective continuous function on a real interval, its inverse function is again continuous.
\inputfaktbeweisnichtvorgefuehrt
{Real closed interval/Strictly increasing/Inverse function/Continuous/Fact}
{Theorem}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{I
}
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be an
interval
and let
\mathdisp {f \colon I \longrightarrow \R} { }
denote a
continuous,
strictly increasing
function.}
\faktfolgerung {Then the
image
\mavergleichskettedisp
{\vergleichskette
{ J
}
{ \defeq} { f(I)
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
is also an interval, and the
inverse function
\mathdisp {f^{-1} \colon J \longrightarrow I} { }
is also continuous.}
\faktzusatz {}
}
{Real closed interval/Strictly increasing/Inverse function/Continuous/Fact/Proof
\zwischenueberschrift{Root functions}
\inputfaktbeweis
{Real numbers/kth root of real number/Intermediate value theorem/Fact}
{Theorem}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{n
}
{ \in }{ \N_+
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}}
\faktvoraussetzung {For $n$ odd,}
\faktfolgerung {the power function
\mathdisp {\R \longrightarrow \R
, x \longmapsto x^n} { , }
is
continuous,
strictly increasing,
bijective,
and the
inverse function
\mathdisp {\R \longrightarrow \R
, x \longmapsto x^{1/n}} { , }
is strictly increasing and continuous.}
\faktzusatz {For $n$ even, the power function
\mathdisp {\R_{\geq 0} \longrightarrow \R_{\geq 0}
, x \longmapsto x^n} { , }
is continuous strictly increasing, bijective, and the
inverse function
\mathdisp {\R_{\geq 0} \longrightarrow \R_{\geq 0}
, x \longmapsto x^{1/n}} { , }
is strictly increasing and continuous.}
}
{
The continuity follows from
Corollary 10.7
.
The increasing behavior for
\mavergleichskette
{\vergleichskette
{x
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
follows from the
Binomial theorem.
For $n$ odd and
\mavergleichskette
{\vergleichskette
{x
}
{ < }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the growth behavior follows from
\mavergleichskette
{\vergleichskette
{x^n
}
{ = }{ - (-x)^n
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
and the behavior in positive part. The growth behavior gives injectivity. For
\mavergleichskette
{\vergleichskette
{x
}
{ \geq }{1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
we have
\mavergleichskette
{\vergleichskette
{x^n
}
{ \geq }{x
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
which shows that there is no upper bound for the image. For $n$ odd, we get that there is no lower bound for the image. Due to the
Intermediate value theorem,
the image is
\mathkor {} {\R} {or} {\R_{\geq 0}} {.}
Hence, the power functions are surjective, and the inverse functions exist. The continuity of the inverse functions follows from
Theorem 11.7
.
\inputbeispiel{}
{
The speed of sound on earth depends on the temperature. If we work with the absolute temperature $T$
\zusatzklammer {measured in Kelvin} {} {,}
then the relation
\mavergleichskette
{\vergleichskette
{ v
}
{ = }{ 20,06 \sqrt{T}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds, where the speed of sound is measured in \mathl{m/s}{.} For
\mavergleichskette
{\vergleichskette
{ T
}
{ = }{ 300K
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the speed of sound is about \mathl{347,5 m/s}{.}
}
\zwischenueberschrift{The theorem of Bolzano-Weierstraß}
The following statement is called \stichwort {theorem of Bolzano-Weierstraß} {.}
\inputfaktbeweis
{Real numbers/Bolzano Weierstraß/Fact}
{Theorem}
{}
{
\faktsituation {Let \mathl{{ \left( x_n \right) }_{n \in \N }}{} denote a
bounded
sequence
of
real numbers.}
\faktfolgerung {Then this sequence has a
convergent
subsequence.}
\faktzusatz {}
}
{
Suppose that the sequence \mathl{{ \left( x_n \right) }_{n \in \N }}{} is bounded by
\mavergleichskettedisp
{\vergleichskette
{a_0
}
{ \leq} { x_n
}
{ \leq} { b_0
}
{ } {
}
{ } {
}
}
{}{}{.}
We define inductively an
interval bisection,
such that in all the intervals, there are infinitely many members of the sequence. The initial interval is
\mavergleichskette
{\vergleichskette
{ I_0
}
{ \defeq }{ [a_0,b_0]
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Suppose that the $k$-th interval \mathl{I_{ k }}{} is already constructed. We consider the two halves
\mathdisp {[a_{ k }, \frac{ a_{ k }+b_{ k } }{2}] \text{ and } [ \frac{a_{ k }+b_{ k } }{2},b_{ k }]} { . }
Al least in one of these, there are infinitely many members of the sequence, and we choose the interval \mathl{I_{ k +1}}{} as one half with infinitely many members. By this method, the lengths of the intervals are bisected, and so we have a sequence of nested intervals. As a subsequence, we choose arbitrary elements
\mavergleichskettedisp
{\vergleichskette
{ x_{n_k}
}
{ \in} { I_k
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
with
\mavergleichskette
{\vergleichskette
{ n_{ k }
}
{ > }{ n_{ k-1 }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
This is possible, as each interval contains infinitely members. This subsequence converges due to
Exercise 8.21
to the number $x$ determined by the
nested intervals.
\zwischenueberschrift{Minima and maxima}
\inputdefinition
{ }
{
Let $M$ denote a set, and
\mathdisp {f \colon M \longrightarrow \R} { }
a
function.
We say that $f$ attains in a point
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{M
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
its \definitionswort {maximum}{,} if
\mathdisp {f(x) \geq f(x') \text { holds for all } x' \in M} { , }
and that $f$ attains in $x$ its \definitionswort {minimum}{,} if
\mathdisp {f(x) \leq f(x') \text { holds for all } x' \in M} { . }
}
The common name for a maximum or a minimum is \stichwort {extremum} {.} In the preceding definition, we also talk about the \stichwort {global maximum} {,} since the property refers to all elements of the domain of the definition. When we are only interested in the behavior on an open, maybe small, neighborhood, then the concept of a local maximum is relevant.
\inputdefinition
{ }
{
Suppose that
\mavergleichskette
{\vergleichskette
{D
}
{ \subseteq }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
is a subset and let
\mathdisp {f \colon D \longrightarrow \R} { }
denote a
function.
We say that $f$ attains a \definitionswort {local maximum}{} in a point
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
if there exists some
\mavergleichskette
{\vergleichskette
{ \epsilon
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
such that for all
\mavergleichskette
{\vergleichskette
{x'
}
{ \in }{ D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
fulfilling
\mavergleichskette
{\vergleichskette
{ \betrag { x-x' }
}
{ \leq }{ \epsilon
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the estimate
\mavergleichskettedisp
{\vergleichskette
{ f(x)
}
{ \geq} { f(x')
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
holds. We say that $f$ attains a \definitionswort {local minimum}{} in a point
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
if there exists some
\mavergleichskette
{\vergleichskette
{ \epsilon
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
such that for all
\mavergleichskette
{\vergleichskette
{x'
}
{ \in }{ D
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
fulfilling
\mavergleichskette
{\vergleichskette
{ \betrag { x-x' }
}
{ \leq }{ \epsilon
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
the estimate
\mavergleichskettedisp
{\vergleichskette
{ f(x)
}
{ \leq} { f(x')
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
}
If
\mavergleichskette
{\vergleichskette
{f(x)
}
{ > }{f(x')
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds for all
\mavergleichskette
{\vergleichskette
{x'
}
{ \neq }{x
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
then we talk about an \stichwort {isolated maximum} {.}
\inputfaktbeweisnichtvorgefuehrt
{Continuous function/Closed bounded interval/Maximum is attained/Fact}
{Theorem}
{}
{
\faktsituation {Let
\mavergleichskette
{\vergleichskette
{ [a,b]
}
{ \subseteq }{ \R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be a closed bounded
interval,
and let
\mathdisp {f \colon [a,b] \longrightarrow \R} { }
denote a
continuous function.}
\faktfolgerung {Then there exists some
\mavergleichskette
{\vergleichskette
{x
}
{ \in }{[a,b]
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that
\mathdisp {f(x) \geq f(x') \text{ for all } x' \in [a,b]} { . }
}
\faktzusatz {This means that the function attains its maximum
(and its minimum).}
}
{Continuous function/Closed bounded interval/Maximum is attained/Fact/Proof
With the help of differential calculus, we will get to know effective methods to determine minima and maxima.