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 (X,d) to be an arbitrary metric space in this section. Unless otherwise specified, f:Xβ†’R is a partial real valued function from X to R with domfβŠ†X.

When the codomain of a function is R, it provides an additional structure of total order on the range of possible values of f.

  1. We can introduce the notion of local and global maximum or minimum values (local and global extrema).

  2. 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.

  3. When we discuss limits at some point a∈domf, we can think in terms of whether the nearby values are above or below f(a). For each deleted neighborhood of a, 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.

  4. 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.

  5. All of these notions easily carry over to extended valued functions (with signatures f:Xβ†’R―).

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 (S,d) where S=domf.

Recall from Subspace Topology that for a metric space (S,d)

  1. S is open as well as closed in the subspace topology (S,d).

  2. A set A is open in (S,d) if and only if A=S∩B for some set B which is open in (X,d).

  3. A set A is closed in (S,d) if and only if A=S∩B for some set B which is closed in (X,d).

  4. If a sequence {xn} of S is convergent w.r.t. the subspace topology (S,d), then its limit x=limxn∈S.

3.9.1. Extreme ValuesΒΆ

Definition 3.59 (Local extreme value)

We say that f(a) is a local extreme value of f at a∈domf if there exists Ξ΄>0 such that f(x)βˆ’f(a) doesn’t change sign on B(a,Ξ΄)∩domf.

More specifically,

  1. f(a) is a local maximum value of f if for some Ξ΄>0:

    f(x)≀f(a)βˆ€x∈B(a,Ξ΄)∩domf.
  2. f(a) is a local minimum value of f if for some Ξ΄>0:

    f(x)β‰₯f(a)βˆ€x∈B(a,Ξ΄)∩domf.

The point x=a is called a local extreme point of f or more specifically, a local maximum or a local minimum point of f.

Definition 3.60 (Global maximum)

We say that f:Xβ†’R attains a global maximum at some a∈domf, if:

f(x)≀f(a)βˆ€x∈domf.

Definition 3.61 (Global minimum)

We say that f:Xβ†’R attains a global minimum at some a∈domf, if:

f(x)β‰₯f(a)βˆ€x∈domf.

Definition 3.62 (Strict global maximum)

We say that f:Xβ†’R attains a strict global maximum at some a∈domf, if:

f(x)<f(a)βˆ€x∈domf,xβ‰ a.

Definition 3.63 (Strict global minimum)

We say that f:Xβ†’R attains a strict global minimum at some a∈domf, if:

f(x)>f(a)βˆ€x∈domf,xβ‰ a.

Theorem 3.91 (Extreme value theorem)

Let f:X→R be continuous. Let A be a nonempty compact subset of domf. Then, the set f(A) is closed and bounded. Also, there exists a and b in A such that

f(a)=inff(A) and f(b)=supf(A);

i.e., f attains its supremum and infimum over the values in f(A).

Proof. Recall from Theorem 3.78 that continuous image of a compact set is compact. Hence, f(A) is compact.

But the compact subsets of R are closed and bounded. Hence, f(A) is closed and bounded.

Since f(A) is closed and bounded, hence it contains a supremum and an infimum.

Let y=inff(A). Since y∈f(A), hence there exists a∈domf such that f(a)=y.

Let z=supf(A). Since z∈f(A), hence there exists b∈domf such that f(b)=z.

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:

w+h+d≀6

where w indicates the width, h indicates the height and d indicates the depth of the box.

We can define volume as a function v:R3β†’R as

v=whd

where each input vector x∈R3 is a triplet (w,h,d).

Now, note the implicit assumption that width, height and depth cannot be negative.

Thus, we have the following constraints:

wβ‰₯0,hβ‰₯0,dβ‰₯0,w+h+d≀6.

These constraints define a simplex in R3 which is a closed and bounded set (thus compact). Hence, the range of function values is also closed and bounded. Hence, it is possible to choose a configuration which maximizes the volume.

3.9.2. Closed FunctionsΒΆ

Definition 3.64 (Closed function)

A real valued function f:Xβ†’R with S=domf is closed if for each α∈R, the corresponding sublevel set is closed with respect to the subspace topology (S,d).

In other words, the sublevel set {x∈S|f(x)≀α} is closed for every α∈R in the subspace topology (S,d).

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 f:Rβ†’R be defined as f(x)=1x with S=domf=(0,∞).

  1. The domain of f is an open set.

  2. Let sublevel(f,Ξ±)={x∈S|f(x)≀α} denote the sublevel set for Ξ±.

  3. Then, sublevel(f,α)=[1α,∞) for every α>0. Thus, it is closed.

  4. sublevel(f,Ξ±)=βˆ… for every α≀0 since f(x) is always positive. Thus, it is closed.

  5. Thus, sublevel(f,α) is closed for every α∈R.

  6. Thus, f 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 f:X→R with S=domf is closed if and only if f is closed.

Proof. Let f:X→R with S=domf. The epigraph of f is given by

epif={(x,r)∈XΓ—R|x∈S,f(x)≀r}.

By TΞ±, we shall denote the sublevel set given as

TΞ±={x∈S|f(x)≀α}.

Assume that epif is closed.

  1. Pick any α∈R.

  2. Let TΞ±={x∈S|f(x)≀α} be the corresponding sublevel set.

  3. Let {xn} be a convergent sequence of TΞ±.

  4. Let x=limnβ†’βˆžxn. We need to show that x∈TΞ±.

  5. By definition of TΞ±, for every xn, we have f(xn)≀α.

  6. Thus, pn=(xn,α)∈epif.

  7. Now, we see that the sequence {pn} of epif is convergent and

    p=limpn=lim(xn,Ξ±)=(limxn,Ξ±)=(x,Ξ±).
  8. Since epif is closed, hence (x,α)∈epif.

  9. Thus, x∈S.

  10. Also, by definition, (x,f(x))∈epif and f(x)≀α.

  11. Thus, x∈S and f(x)≀α.

  12. Thus, x∈Tα.

  13. This, every convergent sequence of TΞ± converges in TΞ±.

  14. Thus, TΞ± is closed.

  15. Since Ξ± was arbitrary, hence every sublevel set of f is closed.

  16. Thus, f is a closed function.

Assume that f is closed.

  1. Thus, every sublevel set of f is closed.

  2. Let {pn} be a convergent sequence of epif.

  3. Let pn=(xn,rn).

  4. Then, f(xn)≀rn for all n∈N.

  5. Let p=limpn. Let p=(x,r).

  6. Then, limxn=x and limrn=r.

  7. We need to show that p∈epif.

  8. Recall from Theorem 2.4 that every convergent sequence of real numbers is bounded.

  9. Since {rn} is convergent, hence it is bounded.

  10. Let M∈R such that rn≀M for all n∈N.

  11. Then, f(xn)≀rn≀M for all n∈N.

  12. Consider the sublevel set TM={x∈S|f(x)≀M}.

  13. Then, xn∈TM for all n∈N.

  14. Then {xn} is a convergent sequence of TM.

  15. But every sublevel set of f is closed. Hence TM is closed.

  16. Every convergent sequence of a closed set converges in the set. Hence, x=limxn∈TM.

  17. Thus, (x,f(x))∈epif.

  18. To show that p=(x,r)∈epif, we need to show that f(x)≀r.

  19. Let lim supnβ†’βˆžf(xn)=u.

  20. Then, by Theorem 2.23, for any ϡ>0, there exists n0∈N such that

    f(xn)<u+Ο΅βˆ€nβ‰₯n0.
  21. Thus, xn∈Tu+Ο΅ for every nβ‰₯n0 where Tu+Ο΅ is the sublevel set for u+Ο΅.

  22. Since {xn} (after dropping the finite n0 terms) is a convergent sequence of Tu+ϡ and Tu+ϡ is closed, hence x∈Tu+ϡ.

  23. Thus, f(x)≀u+Ο΅.

  24. Since, this is true for every Ο΅>0, hence f(x)≀u=lim supnβ†’βˆžf(xn).

  25. Recall that f(xn)≀rn for all n∈N.

  26. Then, by Theorem 2.28,

    f(x)≀lim supf(xn)≀lim suprn=r.
  27. Thus, f(x)≀r.

  28. Thus, p=(x,r)∈epif.

  29. Thus, {pn} converges in epif.

  30. Since {pn} was an arbitrary convergent sequence, hence every convergent sequence of epif converges in epif.

  31. Thus, epif 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 fi:Xβ†’R for i∈I with Si=domfi be a family of closed functions where I is an index set.

The function

f(x)=supi∈Ifi(x)

with domf=β‹‚i∈ISi is closed.

Proof. Recall from Theorem 2.33 that the epigraph of maximum of two functions is the intersection of epigraphs.

  1. Since fi are closed, hence epifi are closed for every i∈I.

  2. The epigraph of f is given by

    epif=β‹‚i∈Iepifi.
  3. Since epifi are closed, hence epif is closed due to Theorem 3.9.

  4. Since epif is closed, hence f is closed due to Theorem 3.92.

3.9.2.3. Nonnegative ScalingΒΆ

Theorem 3.94 (Nonnegative scaling of closed function)

Let f:Xβ†’R be a closed function. Let tβ‰₯0. Then a function g:Xβ†’R given by

g(x)=tf(x)

is closed.

Proof. Note that domg=domf. Consider first the case of t=0.

  1. Then g(x)=0 for every x∈domf.

  2. Thus for any sβ‰₯0, sublevel(g,s)=domf.

  3. And for s<0, sublevel(g,s)=βˆ….

  4. Both domf and βˆ… are closed set w.r.t. the subspace topology of domf.

  5. Hence g is closed.

Now consider the case where t>0.

  1. Pick any s∈R.

  2. Then

    sublevel(g,s)={x∈domg|g(x)≀s}={x∈domf|tf(x)≀s}={x∈domf|f(x)≀st}=sublevel(f,st).
  3. Since f is closed, hence sublevel(f,st) is closed, hence sublevel(g,s) is closed.

  4. Since this is true for every s∈R, hence g is closed.

3.9.2.4. Sum RuleΒΆ

Theorem 3.95 (Sum of closed functions)

Let f,g:Xβ†’R be closed functions. Then h=f+g with domh=domf∩domg is also a closed function.

Proof. We make use of the fact that closed functions are lower semicontinuous. See later in Theorem 3.119.

  1. Since f and g are closed, hence due to Theorem 3.119 they are l.s.c..

  2. By Theorem 3.113, h=f+g is l.s.c..

  3. Again due to Theorem 3.119, h is closed.

3.9.2.5. Continuous FunctionsΒΆ

Theorem 3.96 (Continuity + closed domain implies closedness)

If f:X→R is continuous and domf is closed, then f is closed.

Proof. We shall prove this by showing that the sublevel sets are closed.

  1. Let S=domf.

  2. Pick t∈R.

  3. Let T=sublevel(f,t).

  4. By definition, TβŠ†S.

  5. Let {xn} be a convergent sequence of T.

  6. Let x=limxn.

  7. Since S is closed, hence {xn} converges in S.

  8. Hence x∈S and f(x) is well defined.

  9. Since limxn=x and f is continuous, hence due to Theorem 3.42 (3), limf(xn)=f(x).

  10. By sublevel property of T, f(xn)≀t for every every n.

  11. Consequently,

    f(x)=limnβ†’βˆžf(xn)≀t.
  12. Since f(x)≀t, hence x∈T.

  13. Thus every convergent sequence of T converges in T.

  14. Hence T is closed.

  15. Since t was arbitrarily chosen, hence every sublevel set of f is closed.

  16. Hence f is a closed function.

Theorem 3.97 (Closedness conditions for continuity + open domain)

If f:Xβ†’R is continuous and domf is open, then f is closed if and only if f converges to ∞ along every sequence converging to a boundary point of domf.

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.

  1. Let S=domf.

  2. Let C=clS.

  3. It is given that S is open. Hence S=intC.

  4. Let B=bdS=Cβˆ–intC.

  5. Then B=Cβˆ–S. In other words, B∩S=βˆ….

  6. Let {xn} be a convergent sequence of S.

  7. Then x=limxn∈C.

  8. So either x∈S or x∈B.

  9. If x∈S then f(x) is well defined. If x∈B then f(x) is not defined.

Assume that f converges to infinity along any sequence converging to B.

  1. Pick t∈R.

  2. Let T=sublevel(f,t).

  3. Suppose {xn} is a convergent sequence of T with x=limxn.

  4. Then f(xn)≀t for every n.

  5. For contradiction, assume that x∈B.

  6. Then limf(xn)=∞.

  7. But then there exists n0 such that for every n>n0, f(xn)>t.

  8. This contradicts the assumption that f(xn)≀t for every n.

  9. Hence x∈S.

  10. But then f(x) is well defined.

  11. By continuity of f, f(x)=limf(xn)≀t.

  12. Hence x∈T.

  13. Hence T is closed.

  14. Since every sublevel set is closed, hence f is closed.

Now for the converse, assume that f does not converge to infinity along some sequence converging to B.

  1. Let {xn} be such a convergent sequence such that x=limxn∈B and limf(xn)=r∈R.

  2. Pick some Ο΅>0.

  3. Then there exists n0 such that for all n>n0, $| r - f(x_n)| < \epsilon.

  4. Thus for all n>n0, f(xn)<r+Ο΅.

  5. Consider the sublevel set R=sublevel(f,r+Ο΅).

  6. By dropping the first n0 points of {xn}, the remaining sequence {yn} where yn=xn+n0 belongs to R.

  7. Thus we have a convergent sequence of R which doesn’t converge in R since RβŠ†S, x=limyn∈B and Bβˆ–R=βˆ….

  8. Thus R is not closed.

  9. Since there are sublevel sets of f which are not closed, hence f is not closed.

TODO, is it possible that for a convergent sequence {xn}, the corresponding sequence f(xn) doesn’t converge to anything?

3.9.3. Limit Superiors and InferiorsΒΆ

Definition 3.65 (Limit superior and limit inferior for functions)

Let f:X→R with S=domf. Let a be an accumulation point of S.

For some Ξ΄>0, let

uδ=supx∈Bd(a,r)∩Sf(x).

Then, the limit superior of the function f at a is defined by

lim supxβ†’af(x)β‰œinfΞ΄>0uΞ΄=infΞ΄>0supx∈Bd(a,r)∩Sf(x).

Similarly, let

lδ=infx∈Bd(a,r)∩Sf(x).

Then, the limit inferior of the function f at a is defined by

lim infxβ†’af(x)β‰œsupΞ΄>0lΞ΄=supΞ΄>0infx∈Bd(a,r)∩Sf(x).

We note that limit superior and inferior is also defined for points which are not necessarily in S but are on the boundary of S as some accumulation points of S may be on its boundary outside S. E.g., tan⁑(x) is not defined at x=Ο€2 but Ο€2 is an accumulation point for domtan. Hence, lim sup and lim inf can be computed there.

Bd(a,r)∩S is simply the part of deleted neighborhood at a of radius r which intersects with the domain of f. Since a is an accumulation point of S, hence Bd(a,r)∩S is not empty. Thus, we are evaluating f only at points at which it is defined.

uδ is the supremum value of f in the deleted neighborhood Bd(a,δ)∩S.

It is clear that as Ξ΄ increases, uΞ΄ also increases.

If we define a function g:(0,∞)β†’(βˆ’βˆž,∞] as

g(δ)=uδ=supx∈Bd(a,δ)∩Sf(x),

then g is a nondecreasing function. Then,

lim supxβ†’af(x)=infΞ΄>0g(Ξ΄).

Definition 3.66 (Locally bounded function)

Let f:X→R with S=domf. Let a be an accumulation point of S.

We say that f is locally bounded above around a if there exists r>0 and M∈R such that

f(x)≀Mβˆ€x∈B(x,r)∩S.

We say that f is locally bounded below around a if there exists r>0 and m∈R such that

f(x)β‰₯mβˆ€x∈B(x,r)∩S.

Remark 3.11 (Locally bounded functions and limit superior and inferior)

Let f:Xβ†’R with S=domf. Let a∈S.

If f is locally bounded above at a, then lim supxβ†’af(x) is finite. Otherwise, lim supxβ†’af(x)=∞.

Similarly, if f is locally bounded below at a, then lim infxβ†’af(x) is finite. Otherwise, lim infxβ†’af(x)=βˆ’βˆž.

3.9.3.1. Limit SuperiorΒΆ

Theorem 3.98 (Characterization of function limit superior)

Let f:Xβ†’R with S=domf. Let a be an accumulation point of S. Then, u=lim supxβ†’af(x) if and only if the following two conditions hold:

  1. For every Ο΅>0, there exists Ξ΄>0 such that

    f(x)<u+Ο΅βˆ€x∈Bd(a,Ξ΄)∩S.
  2. For every ϡ>0 and for every δ>0, there exists xδ∈Bd(a,δ)∩S such that

    uβˆ’Ο΅<f(xΞ΄).

Proof. Let g:(0,∞)β†’(βˆ’βˆž,∞] be defined as

g(δ)=supx∈Bd(a,δ)∩Sf(x).

Suppose that u=lim supxβ†’af(x).

  1. Then, u=infΞ΄>0g(Ξ΄).

  2. Then, for ever Ο΅>0, there exists Ξ΄>0 such that

    u≀g(Ξ΄)<u+Ο΅.

    Otherwise, u won’t be the infimum of g(Ξ΄).

  3. Thus, for ever Ο΅>0, there exists Ξ΄>0 such that

    f(x)<u+Ο΅βˆ€x∈Bd(a,Ξ΄)∩S

    which proves condition (1).

  4. Now, for every Ο΅>0 and every Ξ΄>0, we have

    uβˆ’Ο΅<u≀g(Ξ΄)=supx∈Bd(a,Ξ΄)∩Sf(x).
  5. By definition of the supremum, there exists x∈Bd(a,δ)∩S such that

    uβˆ’Ο΅<f(xΞ΄).

    Otherwise, g(Ξ΄) would be smaller than u. This proves condition (2).

For the converse, we assume that conditions (1) and (2) are satisfied.

  1. Let Ο΅>0. Choose Ξ΄>0 that satisfies condition (1).

  2. Then, we get

    g(Ξ΄)=supx∈Bd(a,Ξ΄)∩Sf(x)≀u+Ο΅.
  3. Consequently,

    lim supxβ†’af(x)=infΞ΄>0g(Ξ΄)≀u+Ο΅.
  4. Since Ο΅>0 can be arbitrarily small, hence

    lim supxβ†’af(x)≀u.
  5. Again, fix any ϡ>0 and pick any δ>0. From condition (2), there exists xδ∈Bd(a,δ)∩S such that

    uβˆ’Ο΅<f(xΞ΄).
  6. But,

    f(xΞ΄)≀supx∈Bd(a,Ξ΄)∩Sf(x)=g(Ξ΄).
  7. Thus, uβˆ’Ο΅<g(Ξ΄).

  8. Taking infimum on the R.H.S., over all Ξ΄>0,

    uβˆ’Ο΅β‰€infΞ΄>0g(Ξ΄)=lim supxβ†’af(x).
  9. Since Ο΅>0 can be arbitrarily small, hence

    u≀lim supxβ†’af(x).

Combining, these inequalities, we get u=lim supxβ†’af(x).

Theorem 3.99 (Existence of convergent sequence to the limit superior of a function)

Let f:Xβ†’R with S=domf. Let a be an accumulation point of S. If u=lim supxβ†’af(x), then there exists a sequence {xn} of S converging to a with xnβ‰ a for every n such that

limnβ†’βˆžf(xn)=u.

Moreover, if {yn} is any sequence of S converging to a with yn≠a for every n, and the sequence {f(yn)} converges, then

limnβ†’βˆžf(yn)=u′≀u.

In other words, for any sequence {xn} of Sβˆ–{a} converging to a, u is the least upper bound on limnβ†’βˆžf(yn) if {f(yn)} converges.

Proof. u as the least upper bound.

  1. Let {yn} be a sequence of Sβˆ–{a} such that limnβ†’βˆžyn=a and {f(yn)} converges.

  2. Let Ο΅>0.

  3. Then, due to Theorem 3.98, there exists Ξ΄>0 such that

    f(x)<u+Ο΅βˆ€x∈Bd(a,Ξ΄)∩S.
  4. Since {yn} is convergent, hence there exists n0∈N such that for every n>n0, d(a,yn)<δ.

  5. Thus, for every n>n0, yn∈Bd(a,δ)∩S.

  6. Thus, for every n>n0, f(yn)<u+Ο΅.

  7. Thus,

    limnβ†’βˆžf(yn)≀u+Ο΅.
  8. Since this is true for any Ο΅>0 and Ο΅ can be made arbitrarily small, hence

    limnβ†’βˆžf(yn)≀u=lim supxβ†’af(x).

Construction of {xn} such that limnβ†’βˆžf(xn)=u.

  1. Let Ο΅n=1n.

  2. Then, due to Theorem 3.98 (1), there exists Ξ΄n>0 such that

    f(x)<u+Ο΅nβˆ€x∈Bd(a,Ξ΄n)∩S.
  3. Now, let Ξ΄nβ€²=min{Ξ΄n,1n}. Clearly, Ξ΄nβ€²>0.

  4. Due to Theorem 3.98 (2), there exists xn∈Bd(a,Ξ΄nβ€²)∩S such that

    uβˆ’Ο΅n<f(xn).
  5. Consider the sequence so constructed {xn}.

  6. Since Ξ΄n′≀1n, hence

    limnβ†’βˆžxn=a.
  7. For every n, uβˆ’Ο΅n<f(xn)<u+Ο΅n.

  8. limnβ†’βˆžΟ΅n=0.

  9. Thus, by squeeze theorem,

    limnβ†’βˆžf(xn)=u.

Theorem 3.100 (Divergence of limit superior of a function)

Let f:X→R with S=domf. Let a be an accumulation point of S. Then,

lim supxβ†’af(x)=∞

if and only if there exists a sequence {xn} of Sβˆ–{a} such that limxn=a and limf(xn)=∞.

Proof. Let g:(0,∞)β†’(βˆ’βˆž,∞] be defined as

g(δ)=supx∈Bd(a,δ)∩Sf(x).

Assume that lim supxβ†’af(x)=∞.

  1. Then, infδ>0g(δ)=∞.

  2. Thus, g(δ)=∞ for every δ>0.

  3. For each n∈N, let δn=1n.

  4. We have

    g(δn)=supx∈Bd(a,δn)∩Sf(x)=∞.
  5. Thus, there exists xn∈Bd(a,δn)∩S such that f(xn)>n.

  6. We note that {xn} converges to a since d(xn,a)<1n.

  7. At the same time limf(xn)=∞ as {f(xn)} is unbounded.

For the converse, assume that there exists a sequence {xn} of Sβˆ–{a} such that limxn=a and limf(xn)=∞.

  1. Let Ξ΄>0.

  2. Since {xn} is convergent, hence there exists m∈N such that for all nβ‰₯m, we have xn∈Bd(a,Ξ΄)∩S.

  3. Since limf(xn)=∞, hence for every M>0, there exists k∈N such that f(xn)β‰₯M for all nβ‰₯k.

  4. Let p=max(k,m).

  5. Then, for all nβ‰₯p, xn∈Bd(a,Ξ΄)∩S and f(xn)β‰₯M.

  6. Thus,

    g(Ξ΄)=supx∈Bd(a,Ξ΄)∩Sf(x)β‰₯M.
  7. Since M can be made arbitrarily large, hence g(δ)=∞.

  8. Since g(δ)=∞ for every δ>0, hence

    lim supxβ†’af(x)=infΞ΄>0g(Ξ΄)=∞.

3.9.3.2. Limit InferiorΒΆ

Theorem 3.101 (Characterization of function limit inferior)

Let f:Xβ†’R with S=domf. Let a be an accumulation point of S. Then, l=lim infxβ†’af(x) if and only if the following two conditions hold:

  1. For every Ο΅>0, there exists Ξ΄>0 such that

    lβˆ’Ο΅<f(x)βˆ€x∈Bd(a,Ξ΄)∩S.
  2. For every ϡ>0 and for every δ>0, there exists xδ∈Bd(a,δ)∩S such that

    f(xΞ΄)<l+Ο΅.

Theorem 3.102 (Existence of convergent sequence to the limit inferior of a function)

Let f:Xβ†’R with S=domf. Let a be an accumulation point of S. If l=lim infxβ†’af(x), then there exists a sequence {xn} of S converging to a with xnβ‰ a for every n such that

limnβ†’βˆžf(xn)=l.

Moreover, if {yn} is any sequence of S converging to a with yn≠a for every n, and the sequence {f(yn)} converges, then

limnβ†’βˆžf(yn)=lβ€²β‰₯l.

In other words, for any sequence {xn} of Sβˆ–{a} converging to a, l is the greatest lower bound on limnβ†’βˆžf(yn) if {f(yn)} converges.

Theorem 3.103 (Divergence of limit inferior of a function)

Let f:X→R with S=domf. Let a be an accumulation point of S. Then,

lim infxβ†’af(x)=βˆ’βˆž

if and only if there exists a sequence {xn} of Sβˆ–{a} such that limxn=a and limf(xn)=βˆ’βˆž.

3.9.3.3. Existence of Function LimitΒΆ

Theorem 3.104 (Function limit = limit superior = limit inferior)

Let f:X→R with S=domf. Let a be an accumulation point of S.

Then,

limx→af(x)=l

if and only if

lim supxβ†’af(x)=lim infxβ†’af(x)=l.

Proof. Suppose limx→af(x)=l.

  1. For every Ο΅>0, there exists r>0 such that

    lβˆ’Ο΅<f(x)<l+Ο΅βˆ€x∈Bd(a,r)∩S.
  2. Note that this holds true for every δ∈(0,r].

  3. Thus, for every δ∈(0,r]

    lβˆ’Ο΅<g(Ξ΄)=supx∈Bd(a,Ξ΄)∩Sf(x)≀l+Ο΅.
  4. Recall that g(Ξ΄) is a nondecreasing function.

  5. Thus, taking infimum over Ξ΄>0

    lβˆ’Ο΅β‰€infΞ΄>0g(Ξ΄)≀l+Ο΅.
  6. Since, Ο΅ can be made arbitrarily small, hence

    lim supxβ†’af(x)=infΞ΄>0g(Ξ΄)=l.
  7. An identical reasoning shows that lim infxβ†’af(x)=l.

For the converse, assume that lim supxβ†’af(x)=lim infxβ†’af(x)=l.

  1. Let Ο΅>0.

  2. From Theorem 3.98, there exists Ξ΄1>0 such that

    f(x)<l+Ο΅βˆ€x∈Bd(a,Ξ΄1)∩S.
  3. From Theorem 3.101, there exists Ξ΄2>0 such that

    lβˆ’Ο΅<f(x)βˆ€x∈Bd(a,Ξ΄2)∩S.
  4. Let Ξ΄=min{Ξ΄1,Ξ΄2}. Then,

    lβˆ’Ο΅<f(x)<l+Ο΅βˆ€x∈Bd(a,Ξ΄)∩S.
  5. Thus, for every Ο΅>0, there exists Ξ΄>0 such that

    |f(x)βˆ’l|<Ο΅βˆ€x∈Bd(a,Ξ΄)∩S.
  6. Thus, limx→af(x)=l.

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 f:Xβ†’R with S=domfβŠ†X is said to be lower-semicontinuous at a∈S if for every Ο΅>0, there exists Ξ΄>0 such that

f(a)βˆ’Ο΅<f(x) for every x∈B(a,Ξ΄)∩S.

Similarly, f is said to be upper-semicontinuous at a∈S if for every ϡ>0, there exists δ>0 such that

f(x)<f(a)+Ο΅ for every x∈B(a,Ξ΄)∩S.

We say that f is lower semicontinuous (l.s.c.) if f is l.s.c. at every point of S.

Similarly, we say that f is upper semicontinuous (u.s.c.) if f is u.s.c. at every point of S.

Example 3.28 (Semicontinuous functions)

Consider the function f:R→R defined as

f(x)={0,x<01,xβ‰₯0.

f is upper semicontinuous at x=0.

  1. We have f(0)=1.

  2. Let Ο΅>0.

  3. For any Ξ΄>0

    1. f(Ξ΄)=1<1+Ο΅.

    2. f(βˆ’Ξ΄)=0<1+Ο΅.

  4. Thus, we can pick any Ξ΄>0 and for any x∈(βˆ’Ξ΄,Ξ΄), f(x)<f(0)+Ο΅.

  5. Thus, f is upper semicontinuous at x=0.

We can easily show that f is not lower semicontinuous at x=0.

  1. Let Ο΅=12.

  2. f(0)βˆ’Ο΅=12.

  3. For any Ξ΄>0, f(0βˆ’Ξ΄)=0β‰―12=f(0)βˆ’Ο΅.

  4. thus, for this choice of Ο΅, there is no Ξ΄>0 satisfying the lower semicontinuity inequality.

Consider the function g:R→R defined as

g(x)={0,x≀01,x>0.

g is lower semicontinuous at x=0.

The ceiling function f(x)=⌈xβŒ‰ is lower semicontinuous.

The floor function f(x)=⌊xβŒ‹ is upper semicontinuous.

Theorem 3.105 (Semicontinuity at isolated points)

Let f:Xβ†’R with S=domfβŠ†X.

Let a∈S be an isolated point of S. Then, f is lower semicontinuous as well as upper semicontinuous at a.

Proof. Recall from Definition 3.23 that a is isolated if there exists δ>0 such that B(a,r)∩S={a}.

  1. We are given that a is isolated.

  2. Let Ο΅>0.

  3. Choose δ>0 such that B(a,r)∩S={a}

  4. Since Ο΅>0, hence f(a)βˆ’Ο΅<f(a) and f(a)<f(a)+Ο΅.

  5. Thus, f is l.s.c. as well as u.s.c. at a.

3.9.4.1. ContinuityΒΆ

Theorem 3.106 (Lower + upper semicontinuity = Continuity)

A (partial) function f:Xβ†’R with S=domfβŠ†X is continuous at a∈S if and only if f is both lower semicontinuous and upper semicontinuous at a.

Proof. Assume that f is continuous at a∈S.

  1. Let Ο΅>0.

  2. There exists Ξ΄>0 such that for every x∈B(a,Ξ΄)∩S, |f(x)βˆ’f(a)|<Ο΅.

  3. Consequently, f(x)βˆ’f(a)<Ο΅ means that f(x)<f(a)+Ο΅ for every x∈B(a,Ξ΄)∩S.

  4. Thus, f is upper semicontinuous at a.

  5. Similarly, f(a)βˆ’f(x)<Ο΅ means that f(a)βˆ’Ο΅<f(x) for every x∈B(a,Ξ΄)∩S.

  6. Thus, f is lower semicontinuous at a.

Assume f is lower and upper semicontinuous at a∈S.

  1. Let Ο΅>0.

  2. There exists Ξ΄1>0 such that f(a)βˆ’Ο΅<f(x) for every x∈B(a,Ξ΄1)∩S.

  3. There exists δ2>0 such that f(x)<f(a)+ϡ for every x∈B(a,δ2)∩S.

  4. Let Ξ΄=min(Ξ΄1,Ξ΄2).

  5. Then, for every x∈B(a,Ξ΄)∩S, f(a)βˆ’f(x)<Ο΅ as well as f(x)βˆ’f(a)<Ο΅.

  6. Thus, for every x∈B(a,Ξ΄)∩S, |f(x)βˆ’f(a)|<Ο΅.

  7. Thus, f is continuous at a.

3.9.4.2. Limit Superior and InferiorΒΆ

Theorem 3.107 (Semicontinuity and function limits)

Let f:Xβ†’R with S=domf. Let a∈S be an accumulation point of S. Then, f is lower semicontinuous at a if and only if

lim infxβ†’af(x)β‰₯f(a).

Similarly, f is upper semicontinuous at a if and only if

lim supxβ†’af(x)≀f(a).

For a function f and at an accumulation point a∈domf, we define a function g:(0,∞)β†’(βˆ’βˆž,∞] as

g(δ)=supx∈Bd(a,δ)∩Sf(x).

g is a nondecreasing function of Ξ΄.

Similarly, we define a function h:(0,∞)β†’[βˆ’βˆž,∞) as

h(δ)=infx∈Bd(a,δ)∩Sf(x).

h is a nonincreasing function of Ξ΄.

We note that

lim supxβ†’af(x)=infΞ΄>0g(Ξ΄) and lim infxβ†’af(x)=supΞ΄>0h(Ξ΄).

Proof. Let f be lower semicontinuous at a.

  1. Let Ο΅>0.

  2. Since f is l.s.c. at a, hence there exists Ξ΄0>0 such that

    f(a)βˆ’Ο΅<f(x)βˆ€x∈B(a,Ξ΄0)∩S.
  3. Taking infimum in the R.H.S. over the set Bd(a,δ0)∩S,

    f(a)βˆ’Ο΅β‰€h(Ξ΄0).
  4. Thus,

    lim infxβ†’af(x)=supΞ΄>0h(Ξ΄)β‰₯h(Ξ΄0)β‰₯f(a)βˆ’Ο΅.
  5. Since Ο΅ is arbitrary, hence

    lim infxβ†’af(x)β‰₯f(a).

For the converse, assume that lim infxβ†’af(x)β‰₯f(a).

  1. We can write this as

    lim infxβ†’af(x)=supΞ΄>0h(Ξ΄)β‰₯f(a).
  2. Let Ο΅>0.

  3. Then,

    supΞ΄>0h(Ξ΄)>f(a)βˆ’Ο΅.
  4. Thus, there exists Ξ΄>0 such that h(Ξ΄)>f(a)βˆ’Ο΅.

  5. Thus,

    f(x)>f(a)βˆ’Ο΅βˆ€x∈Bd(a,Ξ΄)∩S.
  6. Also, f(a)>f(a)βˆ’Ο΅ trivially.

  7. Thus, for every Ο΅>0, there exists Ξ΄>0 such that

    f(x)>f(a)βˆ’Ο΅βˆ€x∈B(a,Ξ΄)∩S.
  8. Thus, f is l.s.c. at a.

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

lim supnβ†’βˆžxn=limnβ†’βˆžsup{xk|kβ‰₯n}

and

lim infnβ†’βˆžxn=limnβ†’βˆžinf{xk|kβ‰₯n}.

Theorem 3.108 (Semicontinuity and converging sequences)

Let f:Xβ†’R with S=domf. Let a∈S. Then, f is l.s.c. at a if and only if for every sequence {xn} of S that converges to a,

lim infnβ†’βˆžf(xn)β‰₯f(a).

Similarly, f is upper semicontinuous at a if and only if every sequence {xk} of S that converges to a,

lim supnβ†’βˆžf(xn)≀f(a).

Proof. If a∈S is an isolated point of S, then the only sequence that converges to a is {xn} where xn=a for all terms after a finitely many terms. For such sequences,

lim infnβ†’βˆžf(xn)=lim supnβ†’βˆžf(xn)=f(a).

Also, due to Theorem 3.105, f is l.s.c. as well as u.s.c. at isolated points. Thus, this result holds trivially at isolated points.

We are now left with the case where a∈S is an accumulation point of S.

Let f be lower semicontinuous at a.

  1. Let Ο΅>0.

  2. Since f is l.s.c. at a, hence there exists Ξ΄>0 such that

    f(a)βˆ’Ο΅<f(x)βˆ€x∈B(a,Ξ΄)∩S.
  3. Let {xn} be a sequence of S that converges to a.

  4. Then, there exists n0∈N such that for all n>n0, xn∈B(a,δ)∩S.

  5. Thus, for all n>n0, f(a)βˆ’Ο΅<f(xn).

  6. It follows that f(a)βˆ’Ο΅β‰€lim infnβ†’βˆžf(xn).

  7. Since Ο΅ can be arbitrarily small, hence f(a)≀lim infnβ†’βˆžf(xn).

For the converse, we assume that if limxn=a, then lim infnβ†’βˆžf(xn)β‰₯f(a).

  1. By way of contradiction, assume that f is not l.s.c. at a.

  2. Then, there exists ϡ>0 such that for every δ>0, there exists xδ∈B(a,δ)∩S such that

    f(a)βˆ’Ο΅β‰₯f(xΞ΄).
  3. Let Ξ΄n=1n.

  4. We can construct a sequence {xn} such that for every n, xn∈B(a,1n)∩S such that

    f(a)βˆ’Ο΅β‰₯f(xn).
  5. This implies that

    f(a)βˆ’Ο΅β‰₯lim infnβ†’βˆžf(xn).
  6. 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 f:Xβ†’R―. In this case, f is defined at every x∈X with f taking the value of ∞ or βˆ’βˆž outside its effective domain.

domf={x∈X|f(x)∈R}.

We don’t have to think in terms of subspace topology w.r.t. (S,d) where S is the effective domain. All the definitions and results can be presented w.r.t. the topology of (X,d) itself.

3.9.5.1. Proper FunctionsΒΆ

Definition 3.68 (Proper function)

Let (X,d) be a metric space. An extended real-valued function f:Xβ†’R― is called proper if its domain is nonempty, it never takes the value βˆ’βˆž and is not identically equal to ∞.

βˆƒx∈X such that f(x)<∞ and f(x)>βˆ’βˆžβˆ€x∈X.

Putting another way, a proper function is obtained by taking a real valued function f defined on a nonempty set CβŠ†X and then extending it to all of X by setting f(x)=+∞ for all xβˆ‰C.

It is easy to see that the codomain for a proper function can be changed from R― to (βˆ’βˆž,∞] to clarify that it never takes the value βˆ’βˆž.

Definition 3.69 (Improper function)

Let (X,d) be a metric space. An extended real-valued function f:Xβ†’R― is called improper if it is not proper.

For an improper function f:

  • domf may be empty.

  • f might take a value of βˆ’βˆž at some x∈X.

Definition 3.70 (Indicator function)

Let (X,d) be a metric space. Let CβŠ†X. Then, its indicator function is given by IC(x)=0βˆ€x∈C. Here, domIC=C.

The extended value extension of an indicator function is given by:

IC~(x)β‰œ{0forx∈C∞forxβˆ‰C.

3.9.5.2. Extreme ValuesΒΆ

Let f:Xβ†’R― be an extended real valued function with S=domf.

  1. For some a∈domf, f(a) is a local maximum value of f if for some δ>0:

    f(x)≀f(a)βˆ€x∈B(a,Ξ΄).
  2. For some a∈domf, f(a) is a local minimum value of f if for some δ>0:

    f(x)β‰₯f(a)βˆ€x∈B(a,Ξ΄).
  3. We say that f attains a global maximum at some a∈domf, if:

    f(x)≀f(a)βˆ€x∈X.
  4. We say that f attains a global minimum at some a∈domf, if:

    f(x)β‰₯f(a)βˆ€x∈X.
  5. We say that f attains a strict global maximum at some a∈domf, if:

    f(x)<f(a)βˆ€x∈X,xβ‰ a.
  6. We say that f attains a strict global minimum at some a∈domf, if:

    f(x)>f(a)βˆ€x∈X,xβ‰ a.

Let f:Xβ†’R― be continuous. Let K be a nonempty compact subset of X. Then, the set f(K) is closed and bounded. Also, there exists a and b in K such that

f(a)=inff(K) and f(b)=supf(K);

i.e., f attains its supremum and infimum over the values in f(K).

3.9.5.3. Closed FunctionsΒΆ

Definition 3.71 (Closed Extended Real Valued Functions)

f:Xβ†’R― is closed if for each α∈R, the sublevel set TΞ±={x∈X|f(x)≀α} is closed.

We note that T∞=X is closed.

3.9.5.4. LimitsΒΆ

Definition 3.72 (Limit superior and limit inferior)

Let f:Xβ†’R―. Let a be an accumulation point of X.

For some Ξ΄>0, let

uδ=supx∈Bd(a,r)f(x).

Then, the limit superior of the function f at a is defined by

lim supxβ†’af(x)=infΞ΄>0uΞ΄=infΞ΄>0supx∈Bd(a,r)f(x).

Similarly, let

lδ=infx∈Bd(a,r)f(x).

Then, the limit inferior of the function f at a is defined by

lim infxβ†’af(x)β‰œsupΞ΄>0lΞ΄=supΞ΄>0infx∈Bd(a,r)f(x).
  • Even if aβˆ‰domf, the lim supxβ†’af(x) and lim infxβ†’af(x) may still be finite as long as there is a deleted neighborhood of a which is entirely contained in domf.

  • If there is a deleted neighborhood at a such that Bd(a,Ξ΄)∩domf=βˆ…, then both limits will diverge.

Theorem 3.109 (Characterization of function limit superior)

Let f:Xβ†’R―. Let a be an accumulation point of X. Then, u=lim supxβ†’af(x) if and only if the following two conditions hold:

  1. For every Ο΅>0, there exists Ξ΄>0 such that

    f(x)<u+Ο΅βˆ€x∈Bd(a,Ξ΄).
  2. For every ϡ>0 and for every δ>0, there exists xδ∈Bd(a,δ) such that

    uβˆ’Ο΅<f(xΞ΄).

Theorem 3.110 (Characterization of function limit inferior)

Let f:Xβ†’R―. Let a be an accumulation point of X. Then, l=lim infxβ†’af(x) if and only if the following two conditions hold:

  1. For every Ο΅>0, there exists Ξ΄>0 such that

    lβˆ’Ο΅<f(x)βˆ€x∈Bd(a,Ξ΄).
  2. For every ϡ>0 and for every δ>0, there exists xδ∈Bd(a,δ) such that

    f(xΞ΄)<l+Ο΅.

3.9.5.5. SemicontinuityΒΆ

Definition 3.73 (Lower and upper semicontinuity)

A function f:Xβ†’R― is said to be lower-semicontinuous at a∈X if for every real t<f(a), there exists Ξ΄>0 such that

t<f(x) for every x∈B(a,Ξ΄).

Similarly, f is said to be upper-semicontinuous at a∈X if for every real t>f(a), there exists δ>0 such that

f(x)<t for every x∈B(a,Ξ΄).

We say that f is lower semicontinuous (l.s.c.) if f is l.s.c. at every point of X.

Similarly, we say that f is upper semicontinuous (u.s.c.) if f is u.s.c. at every point of X.

Theorem 3.111 (Semicontinuity and function limits)

Let f:Xβ†’R―. Let a∈X be an accumulation point of X. Then, f is lower semicontinuous at a if and only if

lim infxβ†’af(x)β‰₯f(a).

Similarly, f is upper semicontinuous at a if and only if

lim supxβ†’af(x)≀f(a).

Theorem 3.112 (Semicontinuity and converging sequences)

Let f:Xβ†’R―. Let a∈X. Then, f is l.s.c. at a if and only if for every sequence {xn} that converges to a,

lim infnβ†’βˆžf(xn)β‰₯f(a).

Similarly, f is upper semicontinuous at a if and only if every sequence {xk} that converges to a,

lim supnβ†’βˆžf(xn)≀f(a).

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 f,g:Xβ†’R be lower semicontinuous functions. Then their sum h=f+g with domh=domf∩domg is lower semicontinuous.

Similarly, if f,g:Xβ†’R― are l.s.c., then their sum h=f+g is l.s.c. if h is well defined at every x∈X (i.e., the sum doesn’t take any indeterminate form).

Proof. We proceed as follows.

  1. Let F=domf, G=domg and H=domh.

  2. Then H=F∩G.

  3. Let a∈H.

  4. Since a∈F and x∈G hence both f and g are l.s.c. at a.

  5. Choose Ο΅>0.

  6. Since f is l.s.c. at a, there exists r1>0 such that for every x∈B(a,r1), f(a)βˆ’Ο΅<f(x).

  7. Since g is l.s.c. at a, there exists r2>0 such that for every x∈B(a,r2), g(a)βˆ’Ο΅<g(x).

  8. Let r=min(r1,r2).

  9. Then for every x∈B(a,r)

    f(a)+g(a)βˆ’2Ο΅<f(x)+g(x).
  10. In other words, h(a)βˆ’2Ο΅<h(x) for every x∈B(a,r).

  11. Hence h is l.s.c. at a.

  12. Since a∈H is arbitrary, hence h is l.s.c..

The argument for extended valued functions is similar.

  1. Let a∈X.

  2. We are given that both f and g are l.s.c. at a.

  3. Let t∈R such that t<h(a)=f(a)+g(a).

  4. Then there exist t1,t2∈R such that t=t1+t2 and t1<f(a),t2<g(a).

  5. Since f is l.s.c. at a, there exists r1>0 such that for every x∈B(a,r1), t1<f(x).

  6. Since g is l.s.c. at a, there exists r2>0 such that for every x∈B(a,r2), t2<g(x).

  7. Let r=min(r1,r2).

  8. Then for every x∈B(a,r)

    t=t1+t2<f(x)+g(x)=h(x).
  9. In other words, t<h(x) for every x∈B(a,r).

  10. Hence h is l.s.c. at a.

  11. Since a∈X is arbitrary, hence h is l.s.c..

Theorem 3.114 (Positive combinations)

Let fi:Xβ†’(βˆ’βˆž,∞], i=1,…,m be given functions. Let t1,…,tm be positive scalars. Consider the function g:Xβ†’(βˆ’βˆž,∞] given by

g(x)=t1f1(x)+β‹―+tmfm(x)βˆ€x∈X.

If f1,…,fm are l.s.c., then g is l.s.c.

Proof. We proceed as follows.

  1. Pick some x∈X.

  2. For every sequence {xk} converging to x, we have

    fi(x)≀lim infkβ†’βˆžfi(xk)

    for every i.

  3. Hence

    g(x)=t1f1(x)+β‹―+tmfm(x)β‰€βˆ‘i=1mtilim infkβ†’βˆžfi(xk)≀lim infkβ†’βˆžβˆ‘i=1mtifi(xk)=lim infkβ†’βˆžg(xk).

    This is valid since ti>0 for every i.

  4. Hence g is l.s.c. at x.

  5. Since x is arbitrarily chosen, hence g is l.s.c..

3.9.6.2. Composition RulesΒΆ

Theorem 3.115 (Composition with a continuous function)

Let (X,d1) and (Y,d2) be metric spaces. Let f:Xβ†’Y be a continuous function and let g:Yβ†’R be a lower semicontinuous function. Then their composition h=g∘f is lower semicontinuous.

Proof. .

  1. Let {xk} be a sequence of points of domh converging to some x∈domh.

  2. Since h=g∘f, hence f(xk)∈domg for every k and f(x)∈domg.

  3. By continuity of f, the sequence {f(xk)} converges to f(x) (Theorem 3.43).

  4. Note that {f(xk)} is a sequence of Y converging to f(x).

  5. Since g is l.s.c., hence due to Theorem 3.111

    lim infkβ†’βˆžg(f(xk))β‰₯g(f(x)).
  6. Hence h is l.s.c..

Theorem 3.116 (Composition with a real function)

Let (X,d) be a metric space. Let f:Xβ†’R be a lower semicontinuous function. Let g:Rβ†’R be a lower semicontinuous and monotonically nondecreasing function. Then their composition h=g∘f is lower semicontinuous.

Proof. Assume for contradiction that h is not l.s.c..

  1. Then there exists a sequence {xn} of domh converging to x∈domh such that

    lim infkβ†’βˆžg(f(xk))<g(f(x)).
  2. Let {xl} be a subsequence of {xk} achieving this limit inferior; i.e.

    limlβ†’βˆžg(f(xl))=lim infkβ†’βˆžg(f(xk))<g(f(x)).
  3. Without loss of generality, we can assume that

    g(f(xl))<g(f(x))βˆ€l.

    We can achieve this by simply dropping the finitely many terms from the sequence for which this condition doesn’t hold.

  4. Since g is monotonically nondecreasing, hence g(f(xl))<g(f(x)) implies that f(xl)<f(x) for every l.

  5. Taking limit superior, we have

    lim suplβ†’βˆžf(xl)≀f(x).
  6. Since xl→x, hence due to lower semicontinuity of f

    f(x)≀lim inflβ†’βˆžf(xl)≀lim suplβ†’βˆžf(xl)≀f(x).
  7. Thus limlβ†’βˆžf(xl)=f(x) since limit superior and limit inferior must be identical and equal to f(x).

  8. Since g is lower semicontinuous and f(xl)β†’f(x) hence

    limlβ†’βˆžg(f(xl))=lim inflβ†’βˆžg(f(xl))β‰₯g(f(x)).
  9. This contradicts our earlier claim that limlβ†’βˆžg(f(xl))<g(f(x)).

  10. Hence h must be lower semicontinuous.

3.9.6.3. Convergent Dominating SequencesΒΆ

Theorem 3.117 (Lower semicontinuity and convergent dominating sequence)

Let f:Xβ†’R with S=domf. Let a∈S. Let {an} be a sequence of S. Let {ΞΌn} be a sequence of real numbers such that ΞΌnβ‰₯f(an).

Then, f is l.s.c. at a if and only if ΞΌβ‰₯f(a) whenever ΞΌ=limΞΌn and a=liman.

Proof. Assume that f is l.s.c. at a and ΞΌ=limΞΌn and a=liman.

  1. Then, due to Theorem 3.108,

    lim infnβ†’βˆžf(an)β‰₯f(a).
  2. We are given that ΞΌnβ‰₯f(an) for every n.

  3. By Theorem 2.28,

    lim infnβ†’βˆžΞΌnβ‰₯lim infnβ†’βˆžf(an).
  4. Since ΞΌn is convergent, hence

    limnβ†’βˆžΞΌn=lim infnβ†’βˆžΞΌnβ‰₯lim infnβ†’βˆžf(an)β‰₯f(a).

For the converse, we are given that for any sequence {xn} converging to a, and any sequence {ΞΌn} with ΞΌnβ‰₯f(xn) converging to ΞΌ, we have ΞΌβ‰₯f(a).

  1. Pick a sequence {an} such that liman=a.

  2. Pick a convergent sequence {sn} such that snβ‰₯f(an).

  3. By hypothesis s=limsnβ‰₯f(a).

  4. By way of contradiction, assume that f is not l.s.c. at a.

  5. Then lim infnβ†’βˆžf(an)<f(a) due to Theorem 3.107.

  6. Let lim infnβ†’βˆžf(an)=f(a)βˆ’r for some r>0.

  7. Since {sn} is convergent, hence it is bounded (see Theorem 2.4).

  8. Since snβ‰₯f(an), hence {f(an)} is bounded from above.

  9. {f(an)} cannot be unbounded from below.

    1. For contradiction, assume {f(an)} is unbounded below.

    2. We can choose a subsequence {f(akn)} such that limnβ†’βˆžf(akn)=βˆ’βˆž.

    3. Let bn=akn and tn=f(bn).

    4. Then, limbn=a and limtn=βˆ’βˆž even though tnβ‰₯f(bn).

    5. This contradicts the assumption that limtnβ‰₯f(a).

    6. Thus, {f(an)} must be bounded from below.

  10. Since {f(an)} is bounded, hence there is a subsequence that converges to the limit inferior f(a)βˆ’r. (see Remark 2.12).

  11. Let {f(akn)} be a subsequence of {f(an)} such that limf(akn)=f(a)βˆ’r.

  12. Let bn=akn.

  13. Then, {bn} is a subsequence of {an}.

  14. Since {an} converges to a, hence {bn} converges to a.

  15. Now, choose tn=f(bn). This is by definition a convergent sequence satisfying tnβ‰₯f(bn).

  16. But then, t=limtn=f(a)βˆ’r<f(a).

  17. This contradicts the hypothesis that tβ‰₯f(a).

  18. Thus, f must be l.s.c. at a.

3.9.6.4. EpigraphsΒΆ

Theorem 3.118 (Lower semicontinuity = closed epigraph)

Let f:X→R with S=domf. f is lower semicontinuous if and only if epif is closed.

Proof. Recall that epif is a subset of XΓ—R given by

epif={(x,y)|f(x)≀y}.

Suppose that epif is closed.

  1. Let a∈S and let ϡ>0.

  2. Let b=f(a)βˆ’Ο΅.

  3. Then, (a,b)βˆ‰epif.

  4. Since epif is closed, hence, there is an open ball B(a,Ξ΄) around a and an r>0 such that

    B(a,Ξ΄)Γ—(bβˆ’r,b+r)∩epif=βˆ….
  5. By structure of epigraph, (a,c)βˆ‰epif for any c≀b. Thus,

    B(a,Ξ΄)Γ—(βˆ’βˆž,b+r)∩epif=βˆ….
  6. Thus, f(x)β‰₯b+r for all x∈B(a,Ξ΄)∩S.

  7. Thus, f(x)>b=f(a)βˆ’Ο΅ for all x∈B(a,Ξ΄)∩S.

  8. Thus, for every Ο΅>0, there exists Ξ΄>0 such that for every x∈B(a,Ξ΄)∩S, f(x)>f(a)βˆ’Ο΅.

  9. Thus, f is l.s.c. at a.

  10. Since a was arbitrary, hence f is l.s.c.

For the converse, assume that f is l.s.c.

  1. Let {pn} be a convergent sequence of epif.

  2. Let pn=(an,bn).

  3. Let limpn=p=(a,b).

  4. Then, liman=a and limbn=b.

  5. Also, f(an)≀bn.

  6. Since f is l.s.c. at a, hence by Theorem 3.108

    lim infnβ†’βˆžf(an)β‰₯f(a).
  7. But then, bnβ‰₯f(an) implies that

    b=limbnβ‰₯lim infnβ†’βˆžf(an)β‰₯f(a).
  8. But then, f(a)≀b implies that (a,b)∈epif.

  9. Thus, every convergent sequence of epif converges in epif.

  10. Thus, by Theorem 3.33, epif is closed.

3.9.6.5. Closed FunctionsΒΆ

Theorem 3.119 (Lower semicontinuity = closed function)

Let f:X→R with S=domf. f is lower semicontinuous if and only if f is closed.

Proof. We shall denote the sublevel sets for α∈R by

TΞ±={x∈S|f(x)≀α}.

Also, define

Uα={x∈S|f(x)>α}.

Note that UΞ±=Sβˆ–TΞ±. Thus, TΞ± is closed if and only if UΞ± is open with respect to the subspace topology (S,d).

Assume that f is closed.

  1. Let a∈S and ϡ>0.

  2. Let r=f(a)βˆ’Ο΅.

  3. Consider the set Ur={x∈S|f(x)>r}.

  4. Since sublevel sets of f are closed, hence Ur is open.

  5. We note that f(a)=r+Ο΅>r.

  6. Thus, a∈Ur.

  7. Since Ur is open, hence a is an interior point of Ur.

  8. Thus, there exists an open ball B(a,Ξ΄)∩SβŠ†Ur around a.

  9. Thus, for every x∈B(a,Ξ΄)∩S, f(x)>r=f(a)βˆ’Ο΅.

  10. Thus, for every Ο΅>0, there exists Ξ΄>0 such that f(x)>f(a)βˆ’Ο΅ for every x∈B(a,Ξ΄)∩S.

  11. Thus, f is l.s.c. at a.

  12. Since a∈S was arbitrary, hence f is l.s.c.

For the converse, assume that f is l.s.c.

  1. Let r∈R.

  2. Let Tr={x∈S|f(x)≀r} be the corresponding sublevel set.

  3. Let {xn} be a convergent sequence of Tr.

  4. Let x=limxn with x∈S (subspace topology).

  5. Then, f(xn)≀r for every n.

  6. We need to show that f(x)≀r.

  7. Since f is l.s.c. at x, hence

    f(x)≀lim infnβ†’βˆžf(xn).
  8. But f(xn)≀r.

  9. Hence, lim infnβ†’βˆžf(xn)≀r.

  10. Thus, f(x)≀r.

  11. Thus, x∈Tr.

  12. Since the sequence {xn} was arbitrary, hence Tr is closed.

3.9.6.6. Lower Semicontinuous HullΒΆ

Definition 3.74 (Lower semicontinuous hull of a function)

Let f:X→R with S=domf be a function. There exists a greatest l.s.c. function g, majorized by f, namely the function whose epigraph is the closure of the epigraph of f. This function is known as the lower semicontinuous hull of f.

epig=clepif.

3.9.7. Compact SubsetsΒΆ

Theorem 3.120 (Upper semicontinuity and absolute maximum on a compact set)

Let f:Xβ†’R with S=domf. Assume that f is upper semicontinuous on S. Let A be a compact subset of S. Then f attains a maximum on A; i.e., there exists a∈A such that

f(x)≀f(a)βˆ€x∈A.

Proof. We are given that A is a compact subset of S=domf. Recall from Theorem 3.76 that compact sets are closed and bounded.

We first establish that f(A) is bounded above.

  1. For contradiction, assume that f(A) is not bounded above.

  2. Thus, supx∈Af(x)=∞.

  3. Then, for every n∈N, there exists xn∈A such that f(xn)β‰₯n.

  4. Consider the sequence {xn}. We have limnβ†’βˆžf(xn)=∞.

  5. Since A is compact, hence due to Theorem 3.75, {xn} has a convergent subsequence {yn}.

  6. Since A is closed, hence y=limyn∈A.

  7. Since f is u.s.c. at y, hence

    lim supnβ†’βˆžf(yn)≀f(y).
  8. Since f is real valued, hence f(y) is finite.

  9. But then,

    ∞=limnβ†’βˆžf(xn)≀lim supnβ†’βˆžf(yn)≀f(y).

    A contradiction.

  10. Thus, f(A) must be bounded from above.

We now show that f attains a maximum at some point in A.

  1. Suppose that supx∈Af(x)=M.

  2. Then, for each n, there exists xn∈A such that

    Mβˆ’1n≀f(xn)≀M.
  3. Thus, we obtain a sequence {xn} such that limnβ†’βˆžf(xn)=M.

  4. Since A is bounded, hence {xn} contains a convergent subsequence {yn}.

  5. Since A is closed, hence y=limyn∈A.

  6. Also limf(yn)=M.

  7. Thus, f(y)=M.

  8. Thus, f attains a maximum value of M at y∈A.

Theorem 3.121 (Lower semicontinuity and absolute minimum on a compact set)

Let f:Xβ†’R with S=domf. Assume that f is lower semicontinuous on S. Let A be a compact subset of S. Then f attains a minimum on A; i.e., there exists a∈A such that

f(x)β‰₯f(a)βˆ€x∈A.