HOME

TheInfoList



OR:

In mathematics, the notion of the continuity of functions is not immediately extensible to multivalued mappings or correspondences between two sets ''A'' and ''B''. The dual concepts of upper hemicontinuity and lower hemicontinuity facilitate such an extension. A correspondence that has both properties is said to be continuous in an analogy to the property of the same name for functions. Roughly speaking, a function is upper hemicontinuous if when (1) a convergent sequence of points in the domain maps to a sequence of sets in the range which (2) contain another convergent sequence, then the image of the limiting point in the domain must contain the limit of the sequence in the range. Lower hemicontinuity essentially reverses this, saying if a sequence in the domain converges, given a point in the range of the limit, then you can find a sub-sequence whose image contains a convergent sequence to the given point.


Upper hemicontinuity

A correspondence \Gamma : A \to B is said to be upper hemicontinuous at the point a if, for any open V \subset B with \Gamma(a) \subset V, there exists a neighbourhood U of a such that for all x \in U, \Gamma(x) is a subset of V.


Sequential characterization

For a correspondence \Gamma : A \to B with closed values, if \Gamma : A \to B is upper hemicontinuous at a \in A then for all sequences a_ = \left(a_m\right)_^ in A, for all b \in B, all sequences \left(b_m\right)_^ such that b_m \in \Gamma\left(a_m\right), :if \lim_ a_m = a and \lim_ b_m = b then b \in \Gamma(a). If B is compact, the converse is also true.


Closed graph theorem

The graph of a correspondence \Gamma : A \to B is the set defined by Gr(\Gamma) = \. If \Gamma : A \to B is an upper hemicontinuous correspondence with closed domain (that is, the set of points a \in A where \Gamma(a) is not the empty set is closed) and closed values (i.e. \Gamma(a) is closed for all a \in A), then \operatorname(\Gamma) is closed. If B is compact, then the converse is also true.Proposition 1.4.8 of


Lower hemicontinuity

A correspondence \Gamma : A \to B is said to be lower hemicontinuous at the point a if for any open set V intersecting \Gamma(a) there exists a neighbourhood U of a such that \Gamma(x) intersects V for all x \in U. (Here V S means nonempty intersection V \cap S \neq \varnothing).


Sequential characterization

\Gamma : A \to B is lower hemicontinuous at a if and only if for every sequence a_ = \left(a_m\right)_^ in A such that a_ \to a in A and all b \in \Gamma(a), there exists a subsequence \left(a_\right)_^ of a_ and also a sequence b_ = \left(b_k\right)_^ such that b_ \to b and b_k \in \Gamma\left(a_\right) for every k.


Open graph theorem

A correspondence \Gamma : A \to B have if the set \Gamma^(b) = \ is open in A for every b \in B. If \Gamma values are all open sets in B, then \Gamma is said to have . If \Gamma has an open graph \operatorname(\Gamma), then \Gamma has open upper and lower sections and if \Gamma has open lower sections then it is lower hemicontinuous. The open graph theorem says that if \Gamma : A \to P\left(\R^n\right) is a convex-valued correspondence with open upper sections, then \Gamma has an open graph in A \times \R^n if and only if \Gamma is lower hemicontinuous.


Properties

Set-theoretic, algebraic and topological operations on multivalued maps (like union, composition, sum, convex hull, closure) usually preserve the type of continuity. But this should be taken with appropriate care since, for example, there exists a pair of lower hemicontinuous correspondences whose intersection is not lower hemicontinuous. This can be fixed upon strengthening continuity properties: if one of those lower hemicontinuous multifunctions has open graph then their intersection is again lower hemicontinuous. Crucial to set-valued analysis (in view of applications) are the investigation of single-valued selections and approximations to multivalued maps. Typically lower hemicontinuous correspondences admit single-valued selections (
Michael selection theorem In functional analysis, a branch of mathematics, Michael selection theorem is a selection theorem named after Ernest Michael. In its most popular form, it states the following: : Let ''X'' be a paracompact space and ''Y'' a Banach space. :Let F\ ...
, Bressan–Colombo directionally continuous selection theorem, Fryszkowski decomposable map selection). Likewise, upper hemicontinuous maps admit approximations (e.g. Ancel–Granas–Górniewicz–Kryszewski theorem).


Implications for continuity

If a correspondence is both upper hemicontinuous and lower hemicontinuous, it is said to be continuous. A continuous function is in all cases both upper and lower hemicontinuous.


Other concepts of continuity

The upper and lower hemicontinuity might be viewed as usual continuity: :\Gamma : A \to B is lower esp. upperhemicontinuous if and only if the mapping \Gamma : A \to P(B) is continuous where the hyperspace ''P(B)'' has been endowed with the lower esp. upper
Vietoris topology In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called poi ...
. (For the notion of hyperspace compare also power set and function space). Using lower and upper Hausdorff uniformity we can also define the so-called upper and lower semicontinuous maps in the sense of Hausdorff (also known as metrically lower / upper semicontinuous maps).


See also

* * * *


Notes


References

* * * * * * {{Convex analysis and variational analysis Theory of continuous functions Mathematical analysis Variational analysis