Real Valued Functions
Contents
3.9. Real Valued Functions#
In this section, we discuss results related
to real valued functions on metric spaces.
It is suggested to review the material from
Real Valued Functions on arbitrary sets.
We assume
When the codomain of a function is
We can introduce the notion of local and global maximum or minimum values (local and global extrema).
We can construct the epigraphs, hypographs, sublevel sets, superlevel sets and contours of a function. This allows us to think about the properties of these sets. Of particular interest are functions whose epigraphs are closed or all sublevel sets are closed.
When we discuss limits at some point
, we can think in terms of whether the nearby values are above or below . For each deleted neighborhood of , we can find out the largest (supremum) or the smallest (infimum) values. This enables us to introduce the notions of limit superior and limit inferior. Naturally, the limit exists when the limit superior and limit inferior agree.Similarly, the idea of continuity can be split into continuity from above or below. Accordingly, the functions can be classified into lower and upper continuous functions. Continuous functions are both lower and upper continuous.
All of these notions easily carry over to extended valued functions (with signatures
).
This section introduces these concepts and focuses on the interplay of these concepts. For example closedness of functions (the notion that all sublevel sets are closed) is equivalent to closed epigraphs or lower semicontinuity.
When we discuss the closedness of the sublevel sets
and epigraphs of a function, the closedness is with
respect to the subspace topology of
Recall from Subspace Topology that
for a metric space
is open as well as closed in the subspace topology .A set
is open in if and only if for some set which is open in .A set
is closed in if and only if for some set which is closed in .If a sequence
of is convergent w.r.t. the subspace topology , then its limit .
3.9.1. Extreme Values#
Definition 3.59 (Local extreme value)
We say that
More specifically,
is a local maximum value of if for some : is a local minimum value of if for some :
The point
Definition 3.60 (Global maximum)
We say that
Definition 3.61 (Global minimum)
We say that
Definition 3.62 (Strict global maximum)
We say that
Definition 3.63 (Strict global minimum)
We say that
Theorem 3.91 (Extreme value theorem)
Let
i.e.,
Proof. Recall from Theorem 3.78
that continuous image of a compact set is compact.
Hence,
But the compact subsets of
Since
Let
Let
Extreme value theorem is useful in optimization problems. If it is possible to identify the feasible set of input values as a closed and bounded set, then it is possible to indicate if the optimization problem has a solution or not. Although, the theorem doesn’t help in identifying the solution as such.
Example 3.26
Consider the optimization problem of maximizing the volume of a box with the constraints:
where
We can define volume as a function
where each input vector
Now, note the implicit assumption that width, height and depth cannot be negative.
Thus, we have the following constraints:
These constraints define a simplex in
3.9.2. Closed Functions#
Definition 3.64 (Closed function)
A real valued function
In other words, the sublevel set
3.9.2.1. Closed Functions on Non-Closed Domains#
Although every sublevel set of a closed function is closed, it doesn’t imply that the domain of the function itself is closed. We can very well have functions which are closed but their domain is open or semi-open or neither open nor closed.
Example 3.27 (A closed function need not have closed domain)
Let
The domain of
is an open set.Let
denote the sublevel set for .Then,
for every . Thus, it is closed. for every since is always positive. Thus, it is closed.Thus,
is closed for every .Thus,
is a closed function.
We have shown a counter example where the function is closed but its domain is not closed.
While the domain of a closed function may not be closed, its epigraph indeed is closed.
3.9.2.2. Epigraphs#
Theorem 3.92 (Closed function = closed epigraph)
The epigraph of a function
Proof. Let
By
Assume that
Pick any
.Let
be the corresponding sublevel set.Let
be a convergent sequence of .Let
. We need to show that .By definition of
, for every , we have .Thus,
.Now, we see that the sequence
of is convergent andSince
is closed, hence .Thus,
.Also, by definition,
and .Thus,
and .Thus,
.This, every convergent sequence of
converges in .Thus,
is closed.Since
was arbitrary, hence every sublevel set of is closed.Thus,
is a closed function.
Assume that
Thus, every sublevel set of
is closed.Let
be a convergent sequence of .Let
.Then,
for all .Let
. Let .Then,
and .We need to show that
.Recall from Theorem 2.5 that every convergent sequence of real numbers is bounded.
Since
is convergent, hence it is bounded.Let
such that for all .Then,
for all .Consider the sublevel set
.Then,
for all .Then
is a convergent sequence of .But every sublevel set of
is closed. Hence is closed.Every convergent sequence of a closed set converges in the set. Hence,
.Thus,
.To show that
, we need to show that .Let
.Then, by Theorem 2.24, for any
, there exists such thatThus,
for every where is the sublevel set for .Since
(after dropping the finite terms) is a convergent sequence of and is closed, hence .Thus,
.Since, this is true for every
, hence .Recall that
for all .Then, by Theorem 2.29,
Thus,
.Thus,
.Thus,
converges in .Since
was an arbitrary convergent sequence, hence every convergent sequence of converges in .Thus,
is closed.
A nice application of this result is the fact that pointwise supremum of closed functions is closed.
Theorem 3.93 (Pointwise supremum of closed functions)
Let
The function
with
Proof. Recall from Theorem 2.34 that the epigraph of maximum of two functions is the intersection of epigraphs.
Since
are closed, hence are closed for every .The epigraph of
is given bySince
are closed, hence is closed due to Theorem 3.9.Since
is closed, hence is closed due to Theorem 3.92.
3.9.2.3. Nonnegative Scaling#
Theorem 3.94 (Nonnegative scaling of closed function)
Let
is closed.
Proof. Note that
Then
for every .Thus for any
, .And for
, .Both
and are closed set w.r.t. the subspace topology of .Hence
is closed.
Now consider the case where
Pick any
.Then
Since
is closed, hence is closed, hence is closed.Since this is true for every
, hence is closed.
3.9.2.4. Sum Rule#
Theorem 3.95 (Sum of closed functions)
Let
Proof. We make use of the fact that closed functions are lower semicontinuous. See later in Theorem 3.119.
Since
and are closed, hence due to Theorem 3.119 they are l.s.c..By Theorem 3.113,
is l.s.c..Again due to Theorem 3.119,
is closed.
3.9.2.5. Continuous Functions#
Theorem 3.96 (Continuity + closed domain implies closedness)
If
Proof. We shall prove this by showing that the sublevel sets are closed.
Let
.Pick
.Let
.By definition,
.Let
be a convergent sequence of .Let
.Since
is closed, hence converges in .Hence
and is well defined.Since
and is continuous, hence due to Theorem 3.42 (3), .By sublevel property of
, for every every .Consequently,
Since
, hence .Thus every convergent sequence of
converges in .Hence
is closed.Since
was arbitrarily chosen, hence every sublevel set of is closed.Hence
is a closed function.
Theorem 3.97 (Closedness conditions for continuity + open domain)
If
Proof. To show that a function is closed, we need to show that all its sublevel sets are closed. To show that a sublevel set is closed we need to show that every convergent sequence of a sublevel set converges in the set itself.
Let
.Let
.It is given that
is open. Hence .Let
.Then
. In other words, .Let
be a convergent sequence of .Then
.So either
or .If
then is well defined. If then is not defined.
Assume that
Pick
.Let
.Suppose
is a convergent sequence of with .Then
for every .For contradiction, assume that
.Then
.But then there exists
such that for every , .This contradicts the assumption that
for every .Hence
.But then
is well defined.By continuity of
, .Hence
.Hence
is closed.Since every sublevel set is closed, hence
is closed.
Now for the converse, assume that
Let
be such a convergent sequence such that and .Pick some
.Then there exists
such that for all , $| r - f(x_n)| < \epsilon.Thus for all
, .Consider the sublevel set
.By dropping the first
points of , the remaining sequence where belongs to .Thus we have a convergent sequence of
which doesn’t converge in since , and .Thus
is not closed.Since there are sublevel sets of
which are not closed, hence is not closed.
TODO, is it possible that for a convergent sequence
3.9.3. Limit Superiors and Inferiors#
Definition 3.65 (Limit superior and limit inferior for functions)
Let
For some
Then, the limit superior of the function
Similarly, let
Then, the limit inferior of the function
We note that limit superior and inferior is also defined
for points which are not necessarily in
It is clear that as
If we define a function
then
Definition 3.66 (Locally bounded function)
Let
We say that
We say that
Remark 3.11 (Locally bounded functions and limit superior and inferior)
Let
If
Similarly, if
3.9.3.1. Limit Superior#
Theorem 3.98 (Characterization of function limit superior)
Let
For every
, there exists such thatFor every
and for every , there exists such that
Proof. Let
Suppose that
Then,
.Then, for ever
, there exists such thatOtherwise,
won’t be the infimum of .Thus, for ever
, there exists such thatwhich proves condition (1).
Now, for every
and every , we haveBy definition of the supremum, there exists
such thatOtherwise,
would be smaller than . This proves condition (2).
For the converse, we assume that conditions (1) and (2) are satisfied.
Let
. Choose that satisfies condition (1).Then, we get
Consequently,
Since
can be arbitrarily small, henceAgain, fix any
and pick any . From condition (2), there exists such thatBut,
Thus,
.Taking infimum on the R.H.S., over all
,Since
can be arbitrarily small, hence
Combining, these inequalities, we get
Theorem 3.99 (Existence of convergent sequence to the limit superior of a function)
Let
Moreover, if
In other words, for any sequence
Proof.
Let
be a sequence of such that and converges.Let
.Then, due to Theorem 3.98, there exists
such thatSince
is convergent, hence there exists such that for every , .Thus, for every
, .Thus, for every
, .Thus,
Since this is true for any
and can be made arbitrarily small, hence
Construction of
Let
.Then, due to Theorem 3.98 (1), there exists
such thatNow, let
. Clearly, .Due to Theorem 3.98 (2), there exists
such thatConsider the sequence so constructed
.Since
, henceFor every
, . .Thus, by squeeze theorem,
Theorem 3.100 (Divergence of limit superior of a function)
Let
if and only if there exists a sequence
Proof. Let
Assume that
Then,
.Thus,
for every .For each
, let .We have
Thus, there exists
such that .We note that
converges to since .At the same time
as is unbounded.
For the converse, assume that
there exists a sequence
Let
.Since
is convergent, hence there exists such that for all , we have .Since
, hence for every , there exists such that for all .Let
.Then, for all
, and .Thus,
Since
can be made arbitrarily large, hence .Since
for every , hence
3.9.3.2. Limit Inferior#
Theorem 3.101 (Characterization of function limit inferior)
Let
For every
, there exists such thatFor every
and for every , there exists such that
Theorem 3.102 (Existence of convergent sequence to the limit inferior of a function)
Let
Moreover, if
In other words, for any sequence
Theorem 3.103 (Divergence of limit inferior of a function)
Let
if and only if there exists a sequence
3.9.3.3. Existence of Function Limit#
Theorem 3.104 (Function limit = limit superior = limit inferior)
Let
Then,
if and only if
Proof. Suppose
For every
, there exists such thatNote that this holds true for every
.Thus, for every
Recall that
is a nondecreasing function.Thus, taking infimum over
Since,
can be made arbitrarily small, henceAn identical reasoning shows that
.
For the converse, assume that
Let
.From Theorem 3.98, there exists
such thatFrom Theorem 3.101, there exists
such thatLet
. Then,Thus, for every
, there exists such thatThus,
.
3.9.4. Semicontinuity#
The concept of semicontinuity is useful for the study of extreme values of some discontinuous functions.
We start with the notion of limit superior and limit inferior at a point for functions. We then proceed to define the notion of semicontinuity.
It is conventional to abbreviate “lower semicontinuous” as “l.s.c.” and “upper semicontinuous” as “u.s.c.”. We will use these abbreviations liberally.
Definition 3.67 (Lower and upper semicontinuity)
A (partial) function
Similarly,
We say that
Similarly, we say that
Example 3.28 (Semicontinuous functions)
Consider the function
We have
.Let
.For any
. .
Thus, we can pick any
and for any , .Thus,
is upper semicontinuous at .
We can easily show that
Let
. .For any
, .thus, for this choice of
, there is no satisfying the lower semicontinuity inequality.
Consider the function
The ceiling function
The floor function
Theorem 3.105 (Semicontinuity at isolated points)
Let
Let
Proof. Recall from Definition 3.23 that
We are given that
is isolated.Let
.Choose
such thatSince
, hence and .Thus,
is l.s.c. as well as u.s.c. at .
3.9.4.1. Continuity#
Theorem 3.106 (Lower + upper semicontinuity = Continuity)
A (partial) function
Proof. Assume that
Let
.There exists
such that for every , .Consequently,
means that for every .Thus,
is upper semicontinuous at .Similarly,
means that for every .Thus,
is lower semicontinuous at .
Assume
Let
.There exists
such that for every .There exists
such that for every .Let
.Then, for every
, as well as .Thus, for every
, .Thus,
is continuous at .
3.9.4.2. Limit Superior and Inferior#
Theorem 3.107 (Semicontinuity and function limits)
Let
Similarly,
For a function
Similarly, we define a function
We note that
Proof. Let
Let
.Since
is l.s.c. at , hence there exists such thatTaking infimum in the R.H.S. over the set
,Thus,
Since
is arbitrary, hence
For the converse, assume that
We can write this as
Let
.Then,
Thus, there exists
such that .Thus,
Also,
trivially.Thus, for every
, there exists such thatThus,
is l.s.c. at .
The proof for upper semicontinuity is analogous.
3.9.4.3. Converging Sequences#
Recall from Definition 2.39 that the limit superior and limit inferior of a sequence of real numbers is defined as
and
Theorem 3.108 (Semicontinuity and converging sequences)
Let
Similarly,
Proof. If
Also, due to Theorem 3.105,
We are now left with the case
where
Let
Let
.Since
is l.s.c. at , hence there exists such thatLet
be a sequence of that converges to .Then, there exists
such that for all , .Thus, for all
, .It follows that
.Since
can be arbitrarily small, hence .
For the converse, we assume that
if
By way of contradiction, assume that
is not l.s.c. at .Then, there exists
such that for every , there exists such thatLet
.We can construct a sequence
such that for every , such thatThis implies that
This is a contradiction.
A similar argument can be used for limit superior.
3.9.5. Extended Real Valued Functions#
Often, it is easier to work with extended real valued
functions
We don’t have to think in terms of subspace topology
w.r.t.
3.9.5.1. Proper Functions#
Definition 3.68 (Proper function)
Let
Putting another way, a proper function
is obtained by taking a real valued function
It is easy to see that the codomain for a proper
function can be changed from
Definition 3.69 (Improper function)
Let
For an improper function
may be empty. might take a value of at some .
Definition 3.70 (Indicator function)
Let
The extended value extension of an indicator function is given by:
3.9.5.2. Extreme Values#
Let
For some
, is a local maximum value of if for some :For some
, is a local minimum value of if for some :We say that
attains a global maximum at some , if:We say that
attains a global minimum at some , if:We say that
attains a strict global maximum at some , if:We say that
attains a strict global minimum at some , if:
Let
i.e.,
3.9.5.3. Closed Functions#
Definition 3.71 (Closed Extended Real Valued Functions)
We note that
3.9.5.4. Limits#
Definition 3.72 (Limit superior and limit inferior)
Let
For some
Then, the limit superior of the function
Similarly, let
Then, the limit inferior of the function
Even if
, the and may still be finite as long as there is a deleted neighborhood of which is entirely contained in .If there is a deleted neighborhood at
such that , then both limits will diverge.
Theorem 3.109 (Characterization of function limit superior)
Let
For every
, there exists such thatFor every
and for every , there exists such that
Theorem 3.110 (Characterization of function limit inferior)
Let
For every
, there exists such thatFor every
and for every , there exists such that
3.9.5.5. Semicontinuity#
Definition 3.73 (Lower and upper semicontinuity)
A function
Similarly,
We say that
Similarly, we say that
Theorem 3.111 (Semicontinuity and function limits)
Let
Similarly,
Theorem 3.112 (Semicontinuity and converging sequences)
Let
Similarly,
3.9.6. Lower Semicontinuity#
The topological properties of convex sets can be studied in terms of lower semicontinuity. In this subsection, we study the implications of lower semicontinuity under the subspace topology.
3.9.6.1. Sum Rules#
Theorem 3.113 (Sum of lower semicontinuous functions)
Let
Similarly, if
Proof. We proceed as follows.
Let
, and .Then
.Let
.Since
and hence both and are l.s.c. at .Choose
.Since
is l.s.c. at , there exists such that for every , .Since
is l.s.c. at , there exists such that for every , .Let
.Then for every
In other words,
for every .Hence
is l.s.c. at .Since
is arbitrary, hence is l.s.c..
The argument for extended valued functions is similar.
Let
.We are given that both
and are l.s.c. at .Let
such that .Then there exist
such that and .Since
is l.s.c. at , there exists such that for every , .Since
is l.s.c. at , there exists such that for every , .Let
.Then for every
In other words,
for every .Hence
is l.s.c. at .Since
is arbitrary, hence is l.s.c..
Theorem 3.114 (Positive combinations)
Let
If
Proof. We proceed as follows.
Pick some
.For every sequence
converging to , we havefor every
.Hence
This is valid since
for every .Hence
is l.s.c. at .Since
is arbitrarily chosen, hence is l.s.c..
3.9.6.2. Composition Rules#
Theorem 3.115 (Composition with a continuous function)
Let
Proof. .
Let
be a sequence of points of converging to some .Since
, hence for every and .By continuity of
, the sequence converges to (Theorem 3.43).Note that
is a sequence of converging to .Since
is l.s.c., hence due to Theorem 3.111Hence
is l.s.c..
Theorem 3.116 (Composition with a real function)
Let
Proof. Assume for contradiction that
Then there exists a sequence
of converging to such thatLet
be a subsequence of achieving this limit inferior; i.e.Without loss of generality, we can assume that
We can achieve this by simply dropping the finitely many terms from the sequence for which this condition doesn’t hold.
Since
is monotonically nondecreasing, hence implies that for every .Taking limit superior, we have
Since
, hence due to lower semicontinuity ofThus
since limit superior and limit inferior must be identical and equal to .Since
is lower semicontinuous and henceThis contradicts our earlier claim that
.Hence
must be lower semicontinuous.
3.9.6.3. Convergent Dominating Sequences#
Theorem 3.117 (Lower semicontinuity and convergent dominating sequence)
Let
Then,
Proof. Assume that
Then, due to Theorem 3.108,
We are given that
for every .By Theorem 2.29,
Since
is convergent, hence
For the converse, we are given that
for any sequence
Pick a sequence
such that .Pick a convergent sequence
such that .By hypothesis
.By way of contradiction, assume that
is not l.s.c. at .Then
due to Theorem 3.107.Let
for some .Since
is convergent, hence it is bounded (see Theorem 2.5).Since
, hence is bounded from above. cannot be unbounded from below.For contradiction, assume
is unbounded below.We can choose a subsequence
such that .Let
and .Then,
and even though .This contradicts the assumption that
.Thus,
must be bounded from below.
Since
is bounded, hence there is a subsequence that converges to the limit inferior . (see Remark 2.12).Let
be a subsequence of such that .Let
.Then,
is a subsequence of .Since
converges to , hence converges to .Now, choose
. This is by definition a convergent sequence satisfying .But then,
.This contradicts the hypothesis that
.Thus,
must be l.s.c. at .
3.9.6.4. Epigraphs#
Theorem 3.118 (Lower semicontinuity = closed epigraph)
Let
Proof. Recall that
Suppose that
Let
and let .Let
.Then,
.Since
is closed, hence, there is an open ball around and an such thatBy structure of epigraph,
for any . Thus,Thus,
for all .Thus,
for all .Thus, for every
, there exists such that for every , .Thus,
is l.s.c. at .Since
was arbitrary, hence is l.s.c.
For the converse, assume that
Let
be a convergent sequence of .Let
.Let
.Then,
and .Also,
.Since
is l.s.c. at , hence by Theorem 3.108But then,
implies thatBut then,
implies that .Thus, every convergent sequence of
converges in .Thus, by Theorem 3.33,
is closed.
3.9.6.5. Closed Functions#
Theorem 3.119 (Lower semicontinuity = closed function)
Let
Proof. We shall denote the sublevel sets for
Also, define
Note that
Assume that
Let
and .Let
.Consider the set
.Since sublevel sets of
are closed, hence is open.We note that
.Thus,
.Since
is open, hence is an interior point of .Thus, there exists an open ball
around .Thus, for every
, .Thus, for every
, there exists such that for every .Thus,
is l.s.c. at .Since
was arbitrary, hence is l.s.c.
For the converse, assume that
Let
.Let
be the corresponding sublevel set.Let
be a convergent sequence of .Let
with (subspace topology).Then,
for every .We need to show that
.Since
is l.s.c. at , henceBut
.Hence,
.Thus,
.Thus,
.Since the sequence
was arbitrary, hence is closed.
3.9.6.6. Lower Semicontinuous Hull#
Definition 3.74 (Lower semicontinuous hull of a function)
Let
3.9.7. Compact Subsets#
Theorem 3.120 (Upper semicontinuity and absolute maximum on a compact set)
Let
Proof. We are given that
We first establish that
For contradiction, assume that
is not bounded above.Thus,
.Then, for every
, there exists such that .Consider the sequence
. We have .Since
is compact, hence due to Theorem 3.75, has a convergent subsequence .Since
is closed, hence .Since
is u.s.c. at , henceSince
is real valued, hence is finite.But then,
A contradiction.
Thus,
must be bounded from above.
We now show that
Suppose that
.Then, for each
, there exists such thatThus, we obtain a sequence
such that .Since
is bounded, hence contains a convergent subsequence .Since
is closed, hence .Also
.Thus,
.Thus,
attains a maximum value of at .
Theorem 3.121 (Lower semicontinuity and absolute minimum on a compact set)
Let