Semi-continuity: Difference between revisions
Undid revision 1240238045 by The-erinaceous-one (talk) |
Partial revert of previous edit. Reason: the function was upper (or lower) semicontinuous on its whole domain |
||
(8 intermediate revisions by 5 users not shown) | |||
Line 6: | Line 6: | ||
A function is continuous if and only if it is both upper and lower semicontinuous. If we take a continuous function and increase its value at a certain point <math>x_0</math> to <math>f\left(x_0\right) + c</math> for some <math>c>0</math>, then the result is upper semicontinuous; if we decrease its value to <math>f\left(x_0\right) - c</math> then the result is lower semicontinuous. |
A function is continuous if and only if it is both upper and lower semicontinuous. If we take a continuous function and increase its value at a certain point <math>x_0</math> to <math>f\left(x_0\right) + c</math> for some <math>c>0</math>, then the result is upper semicontinuous; if we decrease its value to <math>f\left(x_0\right) - c</math> then the result is lower semicontinuous. |
||
[[File:Upper semi.svg|thumb|right|An upper semicontinuous function that is not lower semicontinuous. The solid blue dot indicates <math>f\left(x_0\right).</math>]] [[File:Lower semi.svg|thumb|right|A lower semicontinuous function that is not upper semicontinuous. The solid blue dot indicates <math>f\left(x_0\right).</math>]] |
[[File:Upper semi.svg|thumb|right|An upper semicontinuous function that is not lower semicontinuous at <math>x_0</math>. The solid blue dot indicates <math>f\left(x_0\right).</math>]] [[File:Lower semi.svg|thumb|right|A lower semicontinuous function that is not upper semicontinuous at <math>x_0</math>. The solid blue dot indicates <math>f\left(x_0\right).</math>]] |
||
The notion of upper and lower semicontinuous function was first introduced and studied by [[René Baire]] in his thesis in 1899.<ref>{{cite web |last1=Verry |first1=Matthieu |title=Histoire des mathématiques - René Baire |url=https://www.researchgate.net/publication/351274714}}</ref> |
The notion of upper and lower semicontinuous function was first introduced and studied by [[René Baire]] in his thesis in 1899.<ref>{{cite web |last1=Verry |first1=Matthieu |title=Histoire des mathématiques - René Baire |url=https://www.researchgate.net/publication/351274714}}</ref> |
||
Line 19: | Line 19: | ||
Equivalently, <math>f</math> is upper semicontinuous at <math>x_0</math> if and only if |
Equivalently, <math>f</math> is upper semicontinuous at <math>x_0</math> if and only if |
||
<math display=block>\limsup_{x \to x_0} f(x) \leq f(x_0)</math> |
<math display=block>\limsup_{x \to x_0} f(x) \leq f(x_0)</math> |
||
where lim sup is the [[limit superior (topological space)|limit superior]] of the function <math>f</math> at the point <math>x_0</math> |
where lim sup is the [[limit superior (topological space)|limit superior]] of the function <math>f</math> at the point <math>x_0.</math> |
||
If <math>X</math> is a [[metric space]] with [[distance function]] <math>d</math> and <math>f(x_0)\in\R,</math> this can also be restated using an <math>\varepsilon</math>-<math>\delta</math> formulation, similar to the definition of [[continuous function]]. Namely, for each <math>\varepsilon>0</math> there is a <math>\delta>0</math> such that <math>f(x)<f(x_0)+\varepsilon</math> whenever <math>d(x,x_0)<\delta.</math> |
|||
A function <math>f:X\to\overline{\R}</math> is called '''upper semicontinuous''' if it satisfies any of the following equivalent conditions:<ref name="Stromberg" /> |
A function <math>f:X\to\overline{\R}</math> is called '''upper semicontinuous''' if it satisfies any of the following equivalent conditions:<ref name="Stromberg" /> |
||
Line 33: | Line 35: | ||
Equivalently, <math>f</math> is lower semicontinuous at <math>x_0</math> if and only if |
Equivalently, <math>f</math> is lower semicontinuous at <math>x_0</math> if and only if |
||
<math display=block>\liminf_{x \to x_0} f(x) \ge f(x_0)</math> |
<math display=block>\liminf_{x \to x_0} f(x) \ge f(x_0)</math> |
||
where <math>\liminf</math> is the [[limit inferior (topological space)|limit inferior]] of the function <math>f</math> at point <math>x_0</math> |
where <math>\liminf</math> is the [[limit inferior (topological space)|limit inferior]] of the function <math>f</math> at point <math>x_0.</math> |
||
If <math>X</math> is a [[metric space]] with [[distance function]] <math>d</math> and <math>f(x_0)\in\R,</math> this can also be restated as follows: For each <math>\varepsilon>0</math> there is a <math>\delta>0</math> such that <math>f(x)>f(x_0)-\varepsilon</math> whenever <math>d(x,x_0)<\delta.</math> |
|||
A function <math>f:X\to\overline{\R}</math> is called '''lower semicontinuous''' if it satisfies any of the following equivalent conditions: |
A function <math>f:X\to\overline{\R}</math> is called '''lower semicontinuous''' if it satisfies any of the following equivalent conditions: |
||
Line 39: | Line 43: | ||
:(2) For each <math>y\in\R</math>, the set <math>f^{-1}((y,\infty ])=\{x\in X : f(x)>y\}</math> is [[open (topology)|open]] in <math>X</math>, where <math>(y,\infty ]=\{t\in\overline{\R}:t>y\}</math>. |
:(2) For each <math>y\in\R</math>, the set <math>f^{-1}((y,\infty ])=\{x\in X : f(x)>y\}</math> is [[open (topology)|open]] in <math>X</math>, where <math>(y,\infty ]=\{t\in\overline{\R}:t>y\}</math>. |
||
:(3) For each <math>y\in\R</math>, the <math>y</math>-[[sublevel set]] <math>f^{-1}((-\infty, y]) = \{x\in X : f(x)\le y\}</math> is [[closed (topology)|closed]] in <math>X</math>. |
:(3) For each <math>y\in\R</math>, the <math>y</math>-[[sublevel set]] <math>f^{-1}((-\infty, y]) = \{x\in X : f(x)\le y\}</math> is [[closed (topology)|closed]] in <math>X</math>. |
||
:(4) The [[epigraph (mathematics)|epigraph]] <math>\{(x,t)\in X\times\R : t\ge f(x)\}</math> is closed in <math>X\times\R</math>.<ref name="Kurdila2005">{{cite book | vauthors=((Kurdila, A. J.)), ((Zabarankin, M.)) | date= 2005 | chapter=Convex Functional Analysis | title=Lower Semicontinuous Functionals | publisher=Birkhäuser-Verlag | series=Systems & Control: Foundations & Applications | edition=1st | pages=205–219 | url=http://link.springer.com/10.1007/3-7643-7357-1_7 | doi=10.1007/3-7643-7357-1_7 | isbn=978-3-7643-2198-7}} |
:(4) The [[epigraph (mathematics)|epigraph]] <math>\{(x,t)\in X\times\R : t\ge f(x)\}</math> is closed in <math>X\times\R</math>.<ref name="Kurdila2005">{{cite book | vauthors=((Kurdila, A. J.)), ((Zabarankin, M.)) | date= 2005 | chapter=Convex Functional Analysis | title=Lower Semicontinuous Functionals | publisher=Birkhäuser-Verlag | series=Systems & Control: Foundations & Applications | edition=1st | pages=205–219 | url=http://link.springer.com/10.1007/3-7643-7357-1_7 | doi=10.1007/3-7643-7357-1_7 | isbn=978-3-7643-2198-7}}</ref>{{rp|207}} |
||
</ref>{{rp|207}} |
|||
:(5) The function <math>f</math> is continuous when the [[codomain]] <math>\overline{\R}</math> is given the [[right order topology]]. This is just a restatement of condition (2) since the right order topology is generated by all the intervals <math>(y,\infty ] </math>. |
:(5) The function <math>f</math> is continuous when the [[codomain]] <math>\overline{\R}</math> is given the [[right order topology]]. This is just a restatement of condition (2) since the right order topology is generated by all the intervals <math>(y,\infty ] </math>. |
||
=== Semicontinuity in Metric Spaces === |
|||
When <math>X</math> is a metric space, then upper and lower semicontinuity can be stated using a <math>\delta</math>-<math>\varepsilon</math> formulation, similar to continuity. |
|||
In particular, if <math>X</math> is a metric space, then <math>f : X \to \R \cup\{-\infty\}</math> is upper semi-continuous at <math>x_0 \in X</math> if for all <math>\varepsilon > 0,</math> there exists <math>\delta > 0</math> such that |
|||
<math display="block> |
|||
\forall x \in B\left(x_0, \delta\right), \quad f(x_0) + \varepsilon \geq f(x), |
|||
</math> |
|||
where <math>B\left(x_0, \delta\right)</math> is a ball of radius <math>\delta</math> (relative to the metric) centered at <math>x_0.</math> |
|||
Similarly, <math>f : X \to \R \cup\{+\infty\}</math> is lower semi-continuous at <math>x_0 \in X</math> if for all <math>\varepsilon > 0,</math> there exists <math>\delta > 0</math> such that |
|||
<math display="block> |
|||
\forall x \in B\left(x_0, \delta\right), \quad f(x_0) - \varepsilon \leq f(x), |
|||
</math> |
|||
where <math>B\left(x_0, \delta\right)</math> is a ball of radius <math>\delta</math> (relative to the metric) centered at <math>x_0.</math><ref name="AubinOptima">{{cite book | vauthors=((Aubin, J. P.)) | date= 1993 | title=Optima and equilibria : an introduction to nonlinear analysis | publisher=Berlin ; New York : Springer-Verlag | url=http://archive.org/details/optimaequilibria0000aubi | isbn=978-3-540-52121-1}} |
|||
</ref>{{rp|11}} |
|||
== Examples == |
== Examples == |
||
Line 81: | Line 67: | ||
Let <math>(X,\mu)</math> be a measure space and let <math>L^+(X,\mu)</math> denote the set of positive measurable functions endowed with the |
Let <math>(X,\mu)</math> be a measure space and let <math>L^+(X,\mu)</math> denote the set of positive measurable functions endowed with the |
||
topology of [[convergence in measure]] with respect to <math>\mu.</math> Then by [[Fatou's lemma]] the integral, seen as an operator from <math>L^+(X,\mu)</math> to <math>[-\infty, +\infty]</math> is lower semicontinuous. |
topology of [[convergence in measure]] with respect to <math>\mu.</math> Then by [[Fatou's lemma]] the integral, seen as an operator from <math>L^+(X,\mu)</math> to <math>[-\infty, +\infty]</math> is lower semicontinuous. |
||
⚫ | [[Tonelli's theorem (functional analysis)|Tonelli's theorem]] in [[functional analysis]] characterizes the [[weak topology|weak]] lower semicontinuity of [[Nonlinearity|nonlinear]] [[Functional (mathematics)|functionals]] on [[Lp space|''L''<sup>''p''</sup> spaces]] in terms of the convexity of another function. |
||
== Properties == |
== Properties == |
||
Line 96: | Line 84: | ||
* The function <math>f</math> is lower semicontinuous if and only if <math>-f</math> is upper semicontinuous. |
* The function <math>f</math> is lower semicontinuous if and only if <math>-f</math> is upper semicontinuous. |
||
* If <math>f</math> and <math>g</math> are upper semicontinuous and <math>f</math> is [[Monotonic function|non-decreasing]], then the [[Function composition|composition]] <math>f \circ g</math> is upper semicontinuous. On the other hand, if <math>f</math> is not non-decreasing, then <math>f \circ g</math> may not be upper semicontinuous.<ref>{{cite book|last1=Moore|first1=James C.|title=Mathematical methods for economic theory|url=https://archive.org/details/mathematicalmeth02moor|url-access=limited|date=1999|publisher=Springer|location=Berlin|isbn=9783540662358|page=[https://archive.org/details/mathematicalmeth02moor/page/n150 143]}}</ref> |
* If <math>f</math> and <math>g</math> are upper semicontinuous and <math>f</math> is [[Monotonic function|non-decreasing]], then the [[Function composition|composition]] <math>f \circ g</math> is upper semicontinuous. On the other hand, if <math>f</math> is not non-decreasing, then <math>f \circ g</math> may not be upper semicontinuous.<ref>{{cite book|last1=Moore|first1=James C.|title=Mathematical methods for economic theory|url=https://archive.org/details/mathematicalmeth02moor|url-access=limited|date=1999|publisher=Springer|location=Berlin|isbn=9783540662358|page=[https://archive.org/details/mathematicalmeth02moor/page/n150 143]}}</ref> |
||
⚫ | * If <math>f</math> and <math>g</math> are lower semicontinuous, their (pointwise) maximum and minimum (defined by <math>x \mapsto \max\{f(x), g(x)\}</math> and <math>x \mapsto \min\{f(x), g(x)\}</math>) are also lower semicontinuous. Consequently, the set of all lower semicontinuous functions from <math>X</math> to <math>\overline{\R}</math> (or to <math>\R</math>) forms a [[lattice (order)|lattice]]. The corresponding statements also hold for upper semicontinuous functions. |
||
⚫ | * If <math>f</math> and <math>g</math> are lower semicontinuous, |
||
* The set of all lower semicontinuous functions from <math>X</math> to <math>\overline{\R}</math> (or to <math>\R</math>) forms a [[lattice (order)|lattice]]. This follows directly from the fact that each pair of lower semicontinuous functions <math>f,g : X \to \overline{\R}</math> has a maximum and minimum that is also lower semicontinuous. Similarly, the set of all upper semicontinuous functions also form a lattice. |
|||
=== Optimization of Semicontinuous Functions === |
=== Optimization of Semicontinuous Functions === |
||
Line 114: | Line 99: | ||
=== Other Properties === |
=== Other Properties === |
||
⚫ | * ('''Theorem of Baire''')<ref group="note">The result was proved by René Baire in 1904 for real-valued function defined on <math>\R</math>. It was extended to metric spaces by [[Hans Hahn (mathematician)|Hans Hahn]] in 1917, and [[Hing Tong]] showed in 1952 that the most general class of spaces where the theorem holds is the class of [[perfectly normal space]]s. (See Engelking, Exercise 1.7.15(c), p. 62 for details and specific references.)</ref> Let <math>X</math> be a [[metric space]]. Every lower semicontinuous function <math>f:X\to\overline{\R}</math> is the limit of a point-wise [[monotone increasing|increasing]] sequence of extended real-valued continuous functions on <math>X.</math> In particular, there exists a sequence <math>\{f_i\}</math> of continuous functions <math>f_i : X \to \overline\R</math> such that |
||
{{Math theorem |
|||
⚫ | |||
⚫ | |||
⚫ | |||
|math_statement=Let <math>X</math> be a [[metric space]]. Every lower semicontinuous function <math>f:X\to\overline{\R}</math> is the limit of a point-wise [[monotone increasing|increasing]] sequence of extended real-valued continuous functions on <math>X.</math> |
|||
⚫ | :If <math>f</math> does not take the value <math>-\infty</math>, the continuous functions can be taken to be real-valued.<ref>Stromberg, p. 132, Exercise 4(g)</ref><ref>{{cite web |title=Show that lower semicontinuous function is the supremum of an increasing sequence of continuous functions |url=https://math.stackexchange.com/q/1279763}}</ref> |
||
In particular, there exists a sequence <math>\{f_i\}</math> of continuous functions <math>f_i : X \to \overline\R</math> such that |
|||
⚫ | |||
and |
|||
⚫ | |||
⚫ | If <math>f</math> does not take the value <math>-\infty</math>, the continuous functions can be taken to be real-valued.<ref>Stromberg, p. 132, Exercise 4(g)</ref><ref>{{cite web |title=Show that lower semicontinuous function is the supremum of an increasing sequence of continuous functions |url=https://math.stackexchange.com/q/1279763}}</ref> |
||
Additionally, every upper semicontinuous function <math>f:X\to\overline{\R}</math> is the limit of a [[monotone decreasing]] sequence of extended real-valued continuous functions on <math>X;</math> if <math>f</math> does not take the value <math>\infty,</math> the continuous functions can be taken to be real-valued. |
:Additionally, every upper semicontinuous function <math>f:X\to\overline{\R}</math> is the limit of a [[monotone decreasing]] sequence of extended real-valued continuous functions on <math>X;</math> if <math>f</math> does not take the value <math>\infty,</math> the continuous functions can be taken to be real-valued. |
||
}} |
|||
* Any upper semicontinuous function <math>f : X \to \N</math> on an arbitrary topological space <math>X</math> is locally constant on some [[dense set|dense open subset]] of <math>X.</math> |
* Any upper semicontinuous function <math>f : X \to \N</math> on an arbitrary topological space <math>X</math> is locally constant on some [[dense set|dense open subset]] of <math>X.</math> |
||
⚫ | |||
* If the topological space <math>X</math> is [[Sequential_space|sequential]], then <math>f : X \to \mathbb{R}</math> is upper semi-continuous if and only if it is sequentially upper semi-continuous, that is, if for any <math>x \in X</math> and any sequence <math>(x_n)_n \subset X</math> that converges towards <math>x</math>, there holds <math>\limsup_{n \to \infty} f(x_n) \leqslant f(x)</math>. Equivalently, in a sequential space, <math>f</math> is upper semicontinuous if and only if its superlevel sets <math>\{\, x \in X \,|\, f(x) \geqslant y \,\}</math> are [[Fréchet–Urysohn_space#Sequentially_open%2Fclosed_sets|sequentially closed]] for all <math>y \in \mathbb{R}</math>. In general, upper semicontinuous functions are sequentially upper semicontinuous, but the converse may be false. |
|||
== Semicontinuity of Set-valued Functions == |
== Semicontinuity of Set-valued Functions == |
||
Line 169: | Line 150: | ||
* {{annotated link|Katětov–Tong insertion theorem}} |
* {{annotated link|Katětov–Tong insertion theorem}} |
||
* {{annotated link|Hemicontinuity}} |
* {{annotated link|Hemicontinuity}} |
||
* {{annotated link|Càdlàg}} |
|||
== Notes == |
== Notes == |
Revision as of 07:42, 11 December 2024
In mathematical analysis, semicontinuity (or semi-continuity) is a property of extended real-valued functions that is weaker than continuity. An extended real-valued function is upper (respectively, lower) semicontinuous at a point if, roughly speaking, the function values for arguments near are not much higher (respectively, lower) than
A function is continuous if and only if it is both upper and lower semicontinuous. If we take a continuous function and increase its value at a certain point to for some , then the result is upper semicontinuous; if we decrease its value to then the result is lower semicontinuous.
The notion of upper and lower semicontinuous function was first introduced and studied by René Baire in his thesis in 1899.[1]
Definitions
Assume throughout that is a topological space and is a function with values in the extended real numbers .
Upper semicontinuity
A function is called upper semicontinuous at a point if for every real there exists a neighborhood of such that for all .[2] Equivalently, is upper semicontinuous at if and only if where lim sup is the limit superior of the function at the point
If is a metric space with distance function and this can also be restated using an - formulation, similar to the definition of continuous function. Namely, for each there is a such that whenever
A function is called upper semicontinuous if it satisfies any of the following equivalent conditions:[2]
- (1) The function is upper semicontinuous at every point of its domain.
- (2) For each , the set is open in , where .
- (3) For each , the -superlevel set is closed in .
- (4) The hypograph is closed in .
- (5) The function is continuous when the codomain is given the left order topology. This is just a restatement of condition (2) since the left order topology is generated by all the intervals .
Lower semicontinuity
A function is called lower semicontinuous at a point if for every real there exists a neighborhood of such that for all . Equivalently, is lower semicontinuous at if and only if where is the limit inferior of the function at point
If is a metric space with distance function and this can also be restated as follows: For each there is a such that whenever
A function is called lower semicontinuous if it satisfies any of the following equivalent conditions:
- (1) The function is lower semicontinuous at every point of its domain.
- (2) For each , the set is open in , where .
- (3) For each , the -sublevel set is closed in .
- (4) The epigraph is closed in .[3]: 207
- (5) The function is continuous when the codomain is given the right order topology. This is just a restatement of condition (2) since the right order topology is generated by all the intervals .
Examples
Consider the function piecewise defined by: This function is upper semicontinuous at but not lower semicontinuous.
The floor function which returns the greatest integer less than or equal to a given real number is everywhere upper semicontinuous. Similarly, the ceiling function is lower semicontinuous.
Upper and lower semicontinuity bear no relation to continuity from the left or from the right for functions of a real variable. Semicontinuity is defined in terms of an ordering in the range of the functions, not in the domain.[4] For example the function is upper semicontinuous at while the function limits from the left or right at zero do not even exist.
If is a Euclidean space (or more generally, a metric space) and is the space of curves in (with the supremum distance ), then the length functional which assigns to each curve its length is lower semicontinuous.[5] As an example, consider approximating the unit square diagonal by a staircase from below. The staircase always has length 2, while the diagonal line has only length .
Let be a measure space and let denote the set of positive measurable functions endowed with the topology of convergence in measure with respect to Then by Fatou's lemma the integral, seen as an operator from to is lower semicontinuous.
Tonelli's theorem in functional analysis characterizes the weak lower semicontinuity of nonlinear functionals on Lp spaces in terms of the convexity of another function.
Properties
Unless specified otherwise, all functions below are from a topological space to the extended real numbers Several of the results hold for semicontinuity at a specific point, but for brevity they are only stated for semicontinuity over the whole domain.
- A function is continuous if and only if it is both upper and lower semicontinuous.
- The characteristic function or indicator function of a set (defined by if and if ) is upper semicontinuous if and only if is a closed set. It is lower semicontinuous if and only if is an open set.
- In the field of convex analysis, the characteristic function of a set is defined differently, as if and if . With that definition, the characteristic function of any closed set is lower semicontinuous, and the characteristic function of any open set is upper semicontinuous.
Binary Operations on Semicontinuous Functions
Let .
- If and are lower semicontinuous, then the sum is lower semicontinuous[6] (provided the sum is well-defined, i.e., is not the indeterminate form ). The same holds for upper semicontinuous functions.
- If and are lower semicontinuous and non-negative, then the product function is lower semicontinuous. The corresponding result holds for upper semicontinuous functions.
- The function is lower semicontinuous if and only if is upper semicontinuous.
- If and are upper semicontinuous and is non-decreasing, then the composition is upper semicontinuous. On the other hand, if is not non-decreasing, then may not be upper semicontinuous.[7]
- If and are lower semicontinuous, their (pointwise) maximum and minimum (defined by and ) are also lower semicontinuous. Consequently, the set of all lower semicontinuous functions from to (or to ) forms a lattice. The corresponding statements also hold for upper semicontinuous functions.
Optimization of Semicontinuous Functions
- The (pointwise) supremum of an arbitrary family of lower semicontinuous functions (defined by ) is lower semicontinuous.[8]
- In particular, the limit of a monotone increasing sequence of continuous functions is lower semicontinuous. (The Theorem of Baire below provides a partial converse.) The limit function will only be lower semicontinuous in general, not continuous. An example is given by the functions defined for for
- Likewise, the infimum of an arbitrary family of upper semicontinuous functions is upper semicontinuous. And the limit of a monotone decreasing sequence of continuous functions is upper semicontinuous.
- If is a compact space (for instance a closed bounded interval ) and is upper semicontinuous, then attains a maximum on If is lower semicontinuous on it attains a minimum on
- (Proof for the upper semicontinuous case: By condition (5) in the definition, is continuous when is given the left order topology. So its image is compact in that topology. And the compact sets in that topology are exactly the sets with a maximum. For an alternative proof, see the article on the extreme value theorem.)
Other Properties
- (Theorem of Baire)[note 1] Let be a metric space. Every lower semicontinuous function is the limit of a point-wise increasing sequence of extended real-valued continuous functions on In particular, there exists a sequence of continuous functions such that
- Additionally, every upper semicontinuous function is the limit of a monotone decreasing sequence of extended real-valued continuous functions on if does not take the value the continuous functions can be taken to be real-valued.
- Any upper semicontinuous function on an arbitrary topological space is locally constant on some dense open subset of
- If the topological space is sequential, then is upper semi-continuous if and only if it is sequentially upper semi-continuous, that is, if for any and any sequence that converges towards , there holds . Equivalently, in a sequential space, is upper semicontinuous if and only if its superlevel sets are sequentially closed for all . In general, upper semicontinuous functions are sequentially upper semicontinuous, but the converse may be false.
Semicontinuity of Set-valued Functions
For set-valued functions, several concepts of semicontinuity have been defined, namely upper, lower, outer, and inner semicontinuity, as well as upper and lower hemicontinuity. A set-valued function from a set to a set is written For each the function defines a set The preimage of a set under is defined as That is, is the set that contains every point in such that is not disjoint from .[11]
Upper and Lower Semicontinuity
A set-valued map is upper semicontinuous at if for every open set such that , there exists a neighborhood of such that [11]: Def. 2.1
A set-valued map is lower semicontinuous at if for every open set such that there exists a neighborhood of such that [11]: Def. 2.2
Upper and lower set-valued semicontinuity are also defined more generally for a set-valued maps between topological spaces by replacing and in the above definitions with arbitrary topological spaces.[11]
Note, that there is not a direct correspondence between single-valued lower and upper semicontinuity and set-valued lower and upper semicontinuouty. An upper semicontinuous single-valued function is not necessarily upper semicontinuous when considered as a set-valued map.[11]: 18 For example, the function defined by is upper semicontinuous in the single-valued sense but the set-valued map is not upper semicontinuous in the set-valued sense.
Inner and Outer Semicontinuity
A set-valued function is called inner semicontinuous at if for every and every convergent sequence in such that , there exists a sequence in such that and for all sufficiently large [12][note 2]
A set-valued function is called outer semicontinuous at if for every convergence sequence in such that and every convergent sequence in such that for each the sequence converges to a point in (that is, ).[12]
See also
- Directional continuity – Mathematical function with no sudden changes
- Katětov–Tong insertion theorem – On existence of a continuous function between semicontinuous upper and lower bounds
- Hemicontinuity – Semicontinuity for set-valued functions
- Càdlàg – Right continuous function with left limits
Notes
- ^ The result was proved by René Baire in 1904 for real-valued function defined on . It was extended to metric spaces by Hans Hahn in 1917, and Hing Tong showed in 1952 that the most general class of spaces where the theorem holds is the class of perfectly normal spaces. (See Engelking, Exercise 1.7.15(c), p. 62 for details and specific references.)
- ^ In particular, there exists such that for every natural number . The necessisty of only considering the tail of comes from the fact that for small values of the set may be empty.
References
- ^ Verry, Matthieu. "Histoire des mathématiques - René Baire".
- ^ a b Stromberg, p. 132, Exercise 4
- ^ Kurdila, A. J., Zabarankin, M. (2005). "Convex Functional Analysis". Lower Semicontinuous Functionals. Systems & Control: Foundations & Applications (1st ed.). Birkhäuser-Verlag. pp. 205–219. doi:10.1007/3-7643-7357-1_7. ISBN 978-3-7643-2198-7.
- ^ Willard, p. 49, problem 7K
- ^ Giaquinta, Mariano (2007). Mathematical analysis : linear and metric structures and continuity. Giuseppe Modica (1 ed.). Boston: Birkhäuser. Theorem 11.3, p.396. ISBN 978-0-8176-4514-4. OCLC 213079540.
- ^ Puterman, Martin L. (2005). Markov Decision Processes Discrete Stochastic Dynamic Programming. Wiley-Interscience. pp. 602. ISBN 978-0-471-72782-8.
- ^ Moore, James C. (1999). Mathematical methods for economic theory. Berlin: Springer. p. 143. ISBN 9783540662358.
- ^ "To show that the supremum of any collection of lower semicontinuous functions is lower semicontinuous".
- ^ Stromberg, p. 132, Exercise 4(g)
- ^ "Show that lower semicontinuous function is the supremum of an increasing sequence of continuous functions".
- ^ a b c d e Freeman, R. A., Kokotović, P. (1996). Robust Nonlinear Control Design. Birkhäuser Boston. doi:10.1007/978-0-8176-4759-9. ISBN 978-0-8176-4758-2..
- ^ a b Goebel, R. K. (January 2024). "Set-Valued, Convex, and Nonsmooth Analysis in Dynamics and Control: An Introduction". Chapter 2: Set convergence and set-valued mappings. Other Titles in Applied Mathematics. Society for Industrial and Applied Mathematics. pp. 21–36. doi:10.1137/1.9781611977981.ch2. ISBN 978-1-61197-797-4.
Bibliography
- Benesova, B.; Kruzik, M. (2017). "Weak Lower Semicontinuity of Integral Functionals and Applications". SIAM Review. 59 (4): 703–766. arXiv:1601.00390. doi:10.1137/16M1060947. S2CID 119668631.
- Bourbaki, Nicolas (1998). Elements of Mathematics: General Topology, 1–4. Springer. ISBN 0-201-00636-7.
- Bourbaki, Nicolas (1998). Elements of Mathematics: General Topology, 5–10. Springer. ISBN 3-540-64563-2.
- Engelking, Ryszard (1989). General Topology. Heldermann Verlag, Berlin. ISBN 3-88538-006-4.
- Gelbaum, Bernard R.; Olmsted, John M.H. (2003). Counterexamples in analysis. Dover Publications. ISBN 0-486-42875-3.
- Hyers, Donald H.; Isac, George; Rassias, Themistocles M. (1997). Topics in nonlinear analysis & applications. World Scientific. ISBN 981-02-2534-2.
- Stromberg, Karl (1981). Introduction to Classical Real Analysis. Wadsworth. ISBN 978-0-534-98012-2.
- Willard, Stephen (2004) [1970]. General Topology. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-43479-7. OCLC 115240.
- Zălinescu, Constantin (30 July 2002). Convex Analysis in General Vector Spaces. River Edge, N.J. London: World Scientific Publishing. ISBN 978-981-4488-15-0. MR 1921556. OCLC 285163112 – via Internet Archive.