Hemicontinuity


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 when a convergent sequence of points in the domain maps to a sequence of sets in the range which 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 Γ : A → B is said to be upper hemicontinuous at the point a if for any open neighbourhood V of Γ there exists a neighbourhood U of a such that for all x in U, Γ is a subset of V.

Sequential characterization

For a correspondence Γ : A → B with closed values,
if Γ : A → B is upper hemicontinuous at then, and
If B is compact, the converse is also true.

Closed Graph Theorem

The graph of a correspondence Γ : A → B is the set defined by.
If Γ : A → B is an upper hemicontinuous correspondence with closed domain and closed values, then Gr is closed. If B is compact, then the converse is also true.

Lower hemicontinuity

A correspondence Γ : A → B is said to be lower hemicontinuous at the point a
if for any open set V intersecting Γ there exists a neighbourhood U of a such that Γ intersects V for all x in U..

Sequential characterization

Γ : A → B is lower hemicontinuous at a if and only if

Open Graph Theorem

A correspondence Γ : A → B have open lower sections if the set
is open in A for every b ∈ B. If Γ values are all open sets in B, then Γ is said to have open upper sections.
If Γ has an open graph Gr, then Γ has open upper and lower sections and if Γ has open lower sections then it is lower hemicontinuous.
The open graph theorem says that if Γ : A → P is a convex-valued correspondence with open upper sections, then Γ has an open graph in A × Rn if and only if Γ is lower hemicontinuous.

Properties

Set-theoretic, algebraic and topological operations on multivalued maps
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 are the investigation of single-valued selections and approximations to multivalued maps. Typically lower hemicontinuous correspondences admit single-valued selections. Likewise, upper hemicontinuous maps admit approximations.

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:
.
Using lower and upper Hausdorff uniformity we can also define the so-called upper and lower semicontinuous maps in the sense of Hausdorff.