Hemicontinuity
In mathematics, upper hemicontinuity and lower hemicontinuity are extensions of the notions of upper and lower semicontinuity of single-valued functions to set-valued functions. A set-valued function that is both upper and lower hemicontinuous is said to be continuous in an analogy to the property of the same name for single-valued functions.
To explain both notions, consider a sequence a of points in a domain, and a sequence b of points in the range. We say that b corresponds to a if each point in b is contained in the image of the corresponding point in a.
- Upper hemicontinuity requires that, for any convergent sequence a in a domain, and for any convergent sequence b that corresponds to a, the image of the limit of a contains the limit of b.
- Lower hemicontinuity requires that, for any convergent sequence a in a domain, and for any point x in the image of the limit of a, there exists a sequence b that corresponds to a subsequence of a, that converges to x.
Examples
[edit]![](http://upload.wikimedia.org/wikipedia/commons/thumb/5/54/Upper_hemicontinuous.svg/220px-Upper_hemicontinuous.svg.png)
![](http://upload.wikimedia.org/wikipedia/commons/thumb/e/e6/Lower_hemicontinuous.svg/220px-Lower_hemicontinuous.svg.png)
The image on the right shows a function that is not lower hemicontinuous at x. To see this, let a be a sequence that converges to x from the left. The image of x is a vertical line that contains some point (x,y). But every sequence b that corresponds to a is contained in the bottom horizontal line, so it cannot converge to y. In contrast, the function is upper hemicontinuous everywhere. For example, considering any sequence a that converges to x from the left or from the right, and any corresponding sequence b, the limit of b is contained in the vertical line that is the image of the limit of a.
The image on the left shows a function that is not upper hemicontinuous at x. To see this, let a be a sequence that converges to x from the right. The image of a contains vertical lines, so there exists a corresponding sequence b in which all elements are bounded away from f(x). The image of the limit of a contains a single point f(x), so it does not contain the limit of b. In contrast, that function is lower hemicontinuous everywhere. For example, for any sequence a that converges to x, from the left or from the right, f(x) contains a single point, and there exists a corresponding sequence b that converges to f(x).
Definitions
[edit]Upper hemicontinuity
[edit]A set-valued function is said to be upper hemicontinuous at a point if, for every open with there exists a neighbourhood of such that for all is a subset of
Lower hemicontinuity
[edit]A set-valued function is said to be lower hemicontinuous at the point if for every open set intersecting there exists a neighbourhood of such that intersects for all (Here intersects means nonempty intersection ).
Continuity
[edit]If a set-valued function is both upper hemicontinuous and lower hemicontinuous, it is said to be continuous.
Properties
[edit]Upper hemicontinuity
[edit]Sequential characterization
[edit]Theorem — For a set-valued function with closed values, if is upper hemicontinuous at then for every sequence in and every sequence such that
- if and then
If is compact, then the converse is also true.
As an example, look at the image at the right, and consider sequence a in the domain that converges to x (either from the left or from the right). Then, any sequence b that satisfies the requirements converges to some point in f(x).
Closed graph theorem
[edit]The graph of a set-valued function is the set defined by The graph of is the set of all such that is not empty.
Theorem — If is an upper hemicontinuous set-valued function with closed domain (that is, the domain of is closed) and closed values (i.e. is closed for all ), then is closed.
If is compact, then the converse is also true.[1]
Lower hemicontinuity
[edit]Sequential characterization
[edit]Theorem — is lower hemicontinuous at if and only if for every sequence in such that in and all there exists a subsequence of and also a sequence such that and for every
Open graph theorem
[edit]A set-valued function is said to have open lower sections if the set is open in for every If values are all open sets in then is said to have open upper sections.
If has an open graph then has open upper and lower sections and if has open lower sections then it is lower hemicontinuous.[2]
Open Graph Theorem — If is a set-valued function with convex values and open upper sections, then has an open graph in if and only if is lower hemicontinuous.[2]
Operations Preserving Hemicontinuity
[edit]Set-theoretic, algebraic and topological operations on set-valued functions (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 set-valued functions 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.
Function Selections
[edit]Crucial to set-valued analysis (in view of applications) are the investigation of single-valued selections and approximations to set-valued functions. Typically lower hemicontinuous set-valued functions admit single-valued selections (Michael selection theorem, Bressan–Colombo directionally continuous selection theorem, Fryszkowski decomposable map selection). Likewise, upper hemicontinuous maps admit approximations (e.g. Ancel–Granas–Górniewicz–Kryszewski theorem).
Other concepts of continuity
[edit]The upper and lower hemicontinuity might be viewed as usual continuity:
Theorem — A set-valued map is lower [resp. upper] hemicontinuous if and only if the mapping is continuous where the hyperspace P(B) has been endowed with the lower [resp. upper] Vietoris topology.
(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
[edit]- Differential inclusion
- Hausdorff distance – Distance between two metric-space subsets
- Semicontinuity – Property of functions which is weaker than continuity
Notes
[edit]- ^ Proposition 1.4.8 of Aubin, Jean-Pierre; Frankowska, Hélène (1990). Set-Valued Analysis. Basel: Birkhäuser. ISBN 3-7643-3478-9.
- ^ a b Zhou, J.X. (August 1995). "On the Existence of Equilibrium for Abstract Economies". Journal of Mathematical Analysis and Applications. 193 (3): 839–858. doi:10.1006/jmaa.1995.1271.
References
[edit]- Aliprantis, Charalambos D.; Border, Kim C. (2006). Infinite Dimensional Analysis: A Hitchhiker's Guide (Third ed.). Berlin: Springer Science & Business Media. ISBN 978-3-540-29587-7. OCLC 262692874.
- Aubin, Jean-Pierre; Cellina, Arrigo (1984). Differential Inclusions: Set-Valued Maps and Viability Theory. Grundl. der Math. Wiss. Vol. 264. Berlin: Springer. ISBN 0-387-13105-1.
- Aubin, Jean-Pierre; Frankowska, Hélène (1990). Set-Valued Analysis. Basel: Birkhäuser. ISBN 3-7643-3478-9.
- Deimling, Klaus (1992). Multivalued Differential Equations. Walter de Gruyter. ISBN 3-11-013212-5.
- Mas-Colell, Andreu; Whinston, Michael D.; Green, Jerry R. (1995). Microeconomic Analysis. New York: Oxford University Press. pp. 949–951. ISBN 0-19-507340-1.
- Ok, Efe A. (2007). Real Analysis with Economic Applications. Princeton University Press. pp. 216–226. ISBN 978-0-691-11768-3.