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:XR is a partial real valued function from X to R with domfX.

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 adomf, 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:XR).

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=SB for some set B which is open in (X,d).

  3. A set A is closed in (S,d) if and only if A=SB 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=limxnS.

3.9.1. Extreme Values#

Definition 3.59 (Local extreme value)

We say that f(a) is a local extreme value of f at adomf 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)xB(a,δ)domf.
  2. f(a) is a local minimum value of f if for some δ>0:

    f(x)f(a)xB(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:XR attains a global maximum at some adomf, if:

f(x)f(a)xdomf.

Definition 3.61 (Global minimum)

We say that f:XR attains a global minimum at some adomf, if:

f(x)f(a)xdomf.

Definition 3.62 (Strict global maximum)

We say that f:XR attains a strict global maximum at some adomf, if:

f(x)<f(a)xdomf,xa.

Definition 3.63 (Strict global minimum)

We say that f:XR attains a strict global minimum at some adomf, if:

f(x)>f(a)xdomf,xa.

Theorem 3.91 (Extreme value theorem)

Let f:XR 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 yf(A), hence there exists adomf such that f(a)=y.

Let z=supf(A). Since zf(A), hence there exists bdomf 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+d6

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:R3R as

v=whd

where each input vector xR3 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:

w0,h0,d0,w+h+d6.

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:XR 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 {xS|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:RR be defined as f(x)=1x with S=domf=(0,).

  1. The domain of f is an open set.

  2. Let sublevel(f,α)={xS|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:XR with S=domf is closed if and only if f is closed.

Proof. Let f:XR with S=domf. The epigraph of f is given by

epif={(x,r)X×R|xS,f(x)r}.

By Tα, we shall denote the sublevel set given as

Tα={xS|f(x)α}.

Assume that epif is closed.

  1. Pick any αR.

  2. Let Tα={xS|f(x)α} be the corresponding sublevel set.

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

  4. Let x=limnxn. We need to show that xTα.

  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, xS.

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

  11. Thus, xS and f(x)α.

  12. Thus, xTα.

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

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

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

  7. We need to show that pepif.

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

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

  10. Let MR such that rnM for all nN.

  11. Then, f(xn)rnM for all nN.

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

  13. Then, xnTM for all nN.

  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=limxnTM.

  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 supnf(xn)=u.

  20. Then, by Theorem 2.24, for any ϵ>0, there exists n0N such that

    f(xn)<u+ϵnn0.
  21. Thus, xnTu+ϵ for every nn0 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 xTu+ϵ.

  23. Thus, f(x)u+ϵ.

  24. Since, this is true for every ϵ>0, hence f(x)u=lim supnf(xn).

  25. Recall that f(xn)rn for all nN.

  26. Then, by Theorem 2.29,

    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:XR for iI with Si=domfi be a family of closed functions where I is an index set.

The function

f(x)=supiIfi(x)

with domf=iISi is closed.

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

  1. Since fi are closed, hence epifi are closed for every iI.

  2. The epigraph of f is given by

    epif=iIepifi.
  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:XR be a closed function. Let t0. Then a function g:XR 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 xdomf.

  2. Thus for any s0, 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 sR.

  2. Then

    sublevel(g,s)={xdomg|g(x)s}={xdomf|tf(x)s}={xdomf|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 sR, hence g is closed.

3.9.2.4. Sum Rule#

Theorem 3.95 (Sum of closed functions)

Let f,g:XR be closed functions. Then h=f+g with domh=domfdomg 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:XR 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 tR.

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

  4. By definition, TS.

  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 xS 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)=limnf(xn)t.
  12. Since f(x)t, hence xT.

  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:XR 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=CintC.

  5. Then B=CS. In other words, BS=.

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

  7. Then x=limxnC.

  8. So either xS or xB.

  9. If xS then f(x) is well defined. If xB then f(x) is not defined.

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

  1. Pick tR.

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

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

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

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

  12. Hence xT.

  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=limxnB and limf(xn)=rR.

  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 RS, x=limynB and BR=.

  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:XR with S=domf. Let a be an accumulation point of S.

For some δ>0, let

uδ=supxBd(a,r)Sf(x).

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

lim supxaf(x)infδ>0uδ=infδ>0supxBd(a,r)Sf(x).

Similarly, let

lδ=infxBd(a,r)Sf(x).

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

lim infxaf(x)supδ>0lδ=supδ>0infxBd(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δ=supxBd(a,δ)Sf(x),

then g is a nondecreasing function. Then,

lim supxaf(x)=infδ>0g(δ).

Definition 3.66 (Locally bounded function)

Let f:XR 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 MR such that

f(x)MxB(x,r)S.

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

f(x)mxB(x,r)S.

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

Let f:XR with S=domf. Let aS.

If f is locally bounded above at a, then lim supxaf(x) is finite. Otherwise, lim supxaf(x)=.

Similarly, if f is locally bounded below at a, then lim infxaf(x) is finite. Otherwise, lim infxaf(x)=.

3.9.3.1. Limit Superior#

Theorem 3.98 (Characterization of function limit superior)

Let f:XR with S=domf. Let a be an accumulation point of S. Then, u=lim supxaf(x) if and only if the following two conditions hold:

  1. For every ϵ>0, there exists δ>0 such that

    f(x)<u+ϵxBd(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(δ)=supxBd(a,δ)Sf(x).

Suppose that u=lim supxaf(x).

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

  2. Then, for ever ϵ>0, there exists δ>0 such that

    ug(δ)<u+ϵ.

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

  3. Thus, for ever ϵ>0, there exists δ>0 such that

    f(x)<u+ϵxBd(a,δ)S

    which proves condition (1).

  4. Now, for every ϵ>0 and every δ>0, we have

    uϵ<ug(δ)=supxBd(a,δ)Sf(x).
  5. By definition of the supremum, there exists xBd(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(δ)=supxBd(a,δ)Sf(x)u+ϵ.
  3. Consequently,

    lim supxaf(x)=infδ>0g(δ)u+ϵ.
  4. Since ϵ>0 can be arbitrarily small, hence

    lim supxaf(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δ)supxBd(a,δ)Sf(x)=g(δ).
  7. Thus, uϵ<g(δ).

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

    uϵinfδ>0g(δ)=lim supxaf(x).
  9. Since ϵ>0 can be arbitrarily small, hence

    ulim supxaf(x).

Combining, these inequalities, we get u=lim supxaf(x).

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

Let f:XR with S=domf. Let a be an accumulation point of S. If u=lim supxaf(x), then there exists a sequence {xn} of S converging to a with xna for every n such that

limnf(xn)=u.

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

limnf(yn)=uu.

In other words, for any sequence {xn} of S{a} converging to a, u is the least upper bound on limnf(yn) if {f(yn)} converges.

Proof. u as the least upper bound.

  1. Let {yn} be a sequence of S{a} such that limnyn=a and {f(yn)} converges.

  2. Let ϵ>0.

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

    f(x)<u+ϵxBd(a,δ)S.
  4. Since {yn} is convergent, hence there exists n0N such that for every n>n0, d(a,yn)<δ.

  5. Thus, for every n>n0, ynBd(a,δ)S.

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

  7. Thus,

    limnf(yn)u+ϵ.
  8. Since this is true for any ϵ>0 and ϵ can be made arbitrarily small, hence

    limnf(yn)u=lim supxaf(x).

Construction of {xn} such that limnf(xn)=u.

  1. Let ϵn=1n.

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

    f(x)<u+ϵnxBd(a,δn)S.
  3. Now, let δn=min{δn,1n}. Clearly, δn>0.

  4. Due to Theorem 3.98 (2), there exists xnBd(a,δn)S such that

    uϵn<f(xn).
  5. Consider the sequence so constructed {xn}.

  6. Since δn1n, hence

    limnxn=a.
  7. For every n, uϵn<f(xn)<u+ϵn.

  8. limnϵn=0.

  9. Thus, by squeeze theorem,

    limnf(xn)=u.

Theorem 3.100 (Divergence of limit superior of a function)

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

lim supxaf(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(δ)=supxBd(a,δ)Sf(x).

Assume that lim supxaf(x)=.

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

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

  3. For each nN, let δn=1n.

  4. We have

    g(δn)=supxBd(a,δn)Sf(x)=.
  5. Thus, there exists xnBd(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 mN such that for all nm, we have xnBd(a,δ)S.

  3. Since limf(xn)=, hence for every M>0, there exists kN such that f(xn)M for all nk.

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

  5. Then, for all np, xnBd(a,δ)S and f(xn)M.

  6. Thus,

    g(δ)=supxBd(a,δ)Sf(x)M.
  7. Since M can be made arbitrarily large, hence g(δ)=.

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

    lim supxaf(x)=infδ>0g(δ)=.

3.9.3.2. Limit Inferior#

Theorem 3.101 (Characterization of function limit inferior)

Let f:XR with S=domf. Let a be an accumulation point of S. Then, l=lim infxaf(x) if and only if the following two conditions hold:

  1. For every ϵ>0, there exists δ>0 such that

    lϵ<f(x)xBd(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:XR with S=domf. Let a be an accumulation point of S. If l=lim infxaf(x), then there exists a sequence {xn} of S converging to a with xna for every n such that

limnf(xn)=l.

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

limnf(yn)=ll.

In other words, for any sequence {xn} of S{a} converging to a, l is the greatest lower bound on limnf(yn) if {f(yn)} converges.

Theorem 3.103 (Divergence of limit inferior of a function)

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

lim infxaf(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:XR with S=domf. Let a be an accumulation point of S.

Then,

limxaf(x)=l

if and only if

lim supxaf(x)=lim infxaf(x)=l.

Proof. Suppose limxaf(x)=l.

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

    lϵ<f(x)<l+ϵxBd(a,r)S.
  2. Note that this holds true for every δ(0,r].

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

    lϵ<g(δ)=supxBd(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 supxaf(x)=infδ>0g(δ)=l.
  7. An identical reasoning shows that lim infxaf(x)=l.

For the converse, assume that lim supxaf(x)=lim infxaf(x)=l.

  1. Let ϵ>0.

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

    f(x)<l+ϵxBd(a,δ1)S.
  3. From Theorem 3.101, there exists δ2>0 such that

    lϵ<f(x)xBd(a,δ2)S.
  4. Let δ=min{δ1,δ2}. Then,

    lϵ<f(x)<l+ϵxBd(a,δ)S.
  5. Thus, for every ϵ>0, there exists δ>0 such that

    |f(x)l|<ϵxBd(a,δ)S.
  6. Thus, limxaf(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:XR with S=domfX is said to be lower-semicontinuous at aS if for every ϵ>0, there exists δ>0 such that

f(a)ϵ<f(x) for every xB(a,δ)S.

Similarly, f is said to be upper-semicontinuous at aS if for every ϵ>0, there exists δ>0 such that

f(x)<f(a)+ϵ for every xB(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:RR defined as

f(x)={0,x<01,x0.

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δ)=012=f(0)ϵ.

  4. thus, for this choice of ϵ, there is no δ>0 satisfying the lower semicontinuity inequality.

Consider the function g:RR defined as

g(x)={0,x01,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:XR with S=domfX.

Let aS 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:XR with S=domfX is continuous at aS if and only if f is both lower semicontinuous and upper semicontinuous at a.

Proof. Assume that f is continuous at aS.

  1. Let ϵ>0.

  2. There exists δ>0 such that for every xB(a,δ)S, |f(x)f(a)|<ϵ.

  3. Consequently, f(x)f(a)<ϵ means that f(x)<f(a)+ϵ for every xB(a,δ)S.

  4. Thus, f is upper semicontinuous at a.

  5. Similarly, f(a)f(x)<ϵ means that f(a)ϵ<f(x) for every xB(a,δ)S.

  6. Thus, f is lower semicontinuous at a.

Assume f is lower and upper semicontinuous at aS.

  1. Let ϵ>0.

  2. There exists δ1>0 such that f(a)ϵ<f(x) for every xB(a,δ1)S.

  3. There exists δ2>0 such that f(x)<f(a)+ϵ for every xB(a,δ2)S.

  4. Let δ=min(δ1,δ2).

  5. Then, for every xB(a,δ)S, f(a)f(x)<ϵ as well as f(x)f(a)<ϵ.

  6. Thus, for every xB(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:XR with S=domf. Let aS be an accumulation point of S. Then, f is lower semicontinuous at a if and only if

lim infxaf(x)f(a).

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

lim supxaf(x)f(a).

For a function f and at an accumulation point adomf, we define a function g:(0,)(,] as

g(δ)=supxBd(a,δ)Sf(x).

g is a nondecreasing function of δ.

Similarly, we define a function h:(0,)[,) as

h(δ)=infxBd(a,δ)Sf(x).

h is a nonincreasing function of δ.

We note that

lim supxaf(x)=infδ>0g(δ) and lim infxaf(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)xB(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 infxaf(x)=supδ>0h(δ)h(δ0)f(a)ϵ.
  5. Since ϵ is arbitrary, hence

    lim infxaf(x)f(a).

For the converse, assume that lim infxaf(x)f(a).

  1. We can write this as

    lim infxaf(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)ϵxBd(a,δ)S.
  6. Also, f(a)>f(a)ϵ trivially.

  7. Thus, for every ϵ>0, there exists δ>0 such that

    f(x)>f(a)ϵxB(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 supnxn=limnsup{xk|kn}

and

lim infnxn=limninf{xk|kn}.

Theorem 3.108 (Semicontinuity and converging sequences)

Let f:XR with S=domf. Let aS. Then, f is l.s.c. at a if and only if for every sequence {xn} of S that converges to a,

lim infnf(xn)f(a).

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

lim supnf(xn)f(a).

Proof. If aS 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 infnf(xn)=lim supnf(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 aS 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)xB(a,δ)S.
  3. Let {xn} be a sequence of S that converges to a.

  4. Then, there exists n0N such that for all n>n0, xnB(a,δ)S.

  5. Thus, for all n>n0, f(a)ϵ<f(xn).

  6. It follows that f(a)ϵlim infnf(xn).

  7. Since ϵ can be arbitrarily small, hence f(a)lim infnf(xn).

For the converse, we assume that if limxn=a, then lim infnf(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, xnB(a,1n)S such that

    f(a)ϵf(xn).
  5. This implies that

    f(a)ϵlim infnf(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:XR. In this case, f is defined at every xX with f taking the value of or outside its effective domain.

domf={xX|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:XR is called proper if its domain is nonempty, it never takes the value and is not identically equal to .

xX such that f(x)< and f(x)>xX.

Putting another way, a proper function is obtained by taking a real valued function f defined on a nonempty set CX and then extending it to all of X by setting f(x)=+ for all xC.

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:XR 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 xX.

Definition 3.70 (Indicator function)

Let (X,d) be a metric space. Let CX. Then, its indicator function is given by IC(x)=0xC. Here, domIC=C.

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

IC~(x){0forxCforxC.

3.9.5.2. Extreme Values#

Let f:XR be an extended real valued function with S=domf.

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

    f(x)f(a)xB(a,δ).
  2. For some adomf, f(a) is a local minimum value of f if for some δ>0:

    f(x)f(a)xB(a,δ).
  3. We say that f attains a global maximum at some adomf, if:

    f(x)f(a)xX.
  4. We say that f attains a global minimum at some adomf, if:

    f(x)f(a)xX.
  5. We say that f attains a strict global maximum at some adomf, if:

    f(x)<f(a)xX,xa.
  6. We say that f attains a strict global minimum at some adomf, if:

    f(x)>f(a)xX,xa.

Let f:XR 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:XR is closed if for each αR, the sublevel set Tα={xX|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:XR. Let a be an accumulation point of X.

For some δ>0, let

uδ=supxBd(a,r)f(x).

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

lim supxaf(x)=infδ>0uδ=infδ>0supxBd(a,r)f(x).

Similarly, let

lδ=infxBd(a,r)f(x).

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

lim infxaf(x)supδ>0lδ=supδ>0infxBd(a,r)f(x).
  • Even if adomf, the lim supxaf(x) and lim infxaf(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:XR. Let a be an accumulation point of X. Then, u=lim supxaf(x) if and only if the following two conditions hold:

  1. For every ϵ>0, there exists δ>0 such that

    f(x)<u+ϵxBd(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:XR. Let a be an accumulation point of X. Then, l=lim infxaf(x) if and only if the following two conditions hold:

  1. For every ϵ>0, there exists δ>0 such that

    lϵ<f(x)xBd(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:XR is said to be lower-semicontinuous at aX if for every real t<f(a), there exists δ>0 such that

t<f(x) for every xB(a,δ).

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

f(x)<t for every xB(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:XR. Let aX be an accumulation point of X. Then, f is lower semicontinuous at a if and only if

lim infxaf(x)f(a).

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

lim supxaf(x)f(a).

Theorem 3.112 (Semicontinuity and converging sequences)

Let f:XR. Let aX. Then, f is l.s.c. at a if and only if for every sequence {xn} that converges to a,

lim infnf(xn)f(a).

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

lim supnf(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:XR be lower semicontinuous functions. Then their sum h=f+g with domh=domfdomg is lower semicontinuous.

Similarly, if f,g:XR are l.s.c., then their sum h=f+g is l.s.c. if h is well defined at every xX (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=FG.

  3. Let aH.

  4. Since aF and xG 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 xB(a,r1), f(a)ϵ<f(x).

  7. Since g is l.s.c. at a, there exists r2>0 such that for every xB(a,r2), g(a)ϵ<g(x).

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

  9. Then for every xB(a,r)

    f(a)+g(a)2ϵ<f(x)+g(x).
  10. In other words, h(a)2ϵ<h(x) for every xB(a,r).

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

  12. Since aH is arbitrary, hence h is l.s.c..

The argument for extended valued functions is similar.

  1. Let aX.

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

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

  4. Then there exist t1,t2R 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 xB(a,r1), t1<f(x).

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

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

  8. Then for every xB(a,r)

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

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

  11. Since aX 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)xX.

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

Proof. We proceed as follows.

  1. Pick some xX.

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

    fi(x)lim infkfi(xk)

    for every i.

  3. Hence

    g(x)=t1f1(x)++tmfm(x)i=1mtilim infkfi(xk)lim infki=1mtifi(xk)=lim infkg(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:XY be a continuous function and let g:YR be a lower semicontinuous function. Then their composition h=gf is lower semicontinuous.

Proof. .

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

  2. Since h=gf, 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 infkg(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:XR be a lower semicontinuous function. Let g:RR be a lower semicontinuous and monotonically nondecreasing function. Then their composition h=gf 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 xdomh such that

    lim infkg(f(xk))<g(f(x)).
  2. Let {xl} be a subsequence of {xk} achieving this limit inferior; i.e.

    limlg(f(xl))=lim infkg(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 suplf(xl)f(x).
  6. Since xlx, hence due to lower semicontinuity of f

    f(x)lim inflf(xl)lim suplf(xl)f(x).
  7. Thus limlf(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

    limlg(f(xl))=lim inflg(f(xl))g(f(x)).
  9. This contradicts our earlier claim that limlg(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:XR with S=domf. Let aS. Let {an} be a sequence of S. Let {μn} be a sequence of real numbers such that μnf(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 infnf(an)f(a).
  2. We are given that μnf(an) for every n.

  3. By Theorem 2.29,

    lim infnμnlim infnf(an).
  4. Since μn is convergent, hence

    limnμn=lim infnμnlim infnf(an)f(a).

For the converse, we are given that for any sequence {xn} converging to a, and any sequence {μn} with μnf(xn) converging to μ, we have μf(a).

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

  2. Pick a convergent sequence {sn} such that snf(an).

  3. By hypothesis s=limsnf(a).

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

  5. Then lim infnf(an)<f(a) due to Theorem 3.107.

  6. Let lim infnf(an)=f(a)r for some r>0.

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

  8. Since snf(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 limnf(akn)=.

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

    4. Then, limbn=a and limtn= even though tnf(bn).

    5. This contradicts the assumption that limtnf(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 tnf(bn).

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

  17. This contradicts the hypothesis that tf(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:XR 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 aS 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,δ)×(br,b+r)epif=.
  5. By structure of epigraph, (a,c)epif for any cb. Thus,

    B(a,δ)×(,b+r)epif=.
  6. Thus, f(x)b+r for all xB(a,δ)S.

  7. Thus, f(x)>b=f(a)ϵ for all xB(a,δ)S.

  8. Thus, for every ϵ>0, there exists δ>0 such that for every xB(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 infnf(an)f(a).
  7. But then, bnf(an) implies that

    b=limbnlim infnf(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:XR 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α={xS|f(x)α}.

Also, define

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

Note that Uα=STα. 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 aS and ϵ>0.

  2. Let r=f(a)ϵ.

  3. Consider the set Ur={xS|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, aUr.

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

  8. Thus, there exists an open ball B(a,δ)SUr around a.

  9. Thus, for every xB(a,δ)S, f(x)>r=f(a)ϵ.

  10. Thus, for every ϵ>0, there exists δ>0 such that f(x)>f(a)ϵ for every xB(a,δ)S.

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

  12. Since aS was arbitrary, hence f is l.s.c.

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

  1. Let rR.

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

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

  4. Let x=limxn with xS (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 infnf(xn).
  8. But f(xn)r.

  9. Hence, lim infnf(xn)r.

  10. Thus, f(x)r.

  11. Thus, xTr.

  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:XR 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:XR 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 aA such that

f(x)f(a)xA.

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, supxAf(x)=.

  3. Then, for every nN, there exists xnA such that f(xn)n.

  4. Consider the sequence {xn}. We have limnf(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=limynA.

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

    lim supnf(yn)f(y).
  8. Since f is real valued, hence f(y) is finite.

  9. But then,

    =limnf(xn)lim supnf(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 supxAf(x)=M.

  2. Then, for each n, there exists xnA such that

    M1nf(xn)M.
  3. Thus, we obtain a sequence {xn} such that limnf(xn)=M.

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

  5. Since A is closed, hence y=limynA.

  6. Also limf(yn)=M.

  7. Thus, f(y)=M.

  8. Thus, f attains a maximum value of M at yA.

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

Let f:XR 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 aA such that

f(x)f(a)xA.