Semicontinuous maps #
A function f
from a topological space α
to an ordered space β
is lower semicontinuous at a
point x
if, for any y < f x
, for any x'
close enough to x
, one has f x' > y
. In other
words, f
can jump up, but it can not jump down.
Upper semicontinuous functions are defined similarly.
This file introduces these notions, and a basic API around them mimicking the API for continuous functions.
Main definitions and results #
We introduce 4 definitions related to lower semicontinuity:
LowerSemicontinuousWithinAt f s x
LowerSemicontinuousAt f x
LowerSemicontinuousOn f s
LowerSemicontinuous f
We build a basic API using dot notation around these notions, and we prove that
- constant functions are lower semicontinuous;
indicator s (λ _, y)
is lower semicontinuous whens
is open and0 ≤ y
, or whens
is closed andy ≤ 0
;- continuous functions are lower semicontinuous;
- composition with a continuous monotone functions maps lower semicontinuous functions to lower semicontinuous functions. If the function is anti-monotone, it instead maps lower semicontinuous functions to upper semicontinuous functions;
- a sum of two (or finitely many) lower semicontinuous functions is lower semicontinuous;
- a supremum of a family of lower semicontinuous functions is lower semicontinuous;
- An infinite sum of
ℝ≥0∞
-valued lower semicontinuous functions is lower semicontinuous.
Similar results are stated and proved for upper semicontinuity.
We also prove that a function is continuous if and only if it is both lower and upper semicontinuous.
Implementation details #
All the nontrivial results for upper semicontinuous functions are deduced from the corresponding
ones for lower semicontinuous functions using OrderDual
.
Main definitions #
A real function f
is lower semicontinuous at x
within a set s
if, for any ε > 0
, for all
x'
close enough to x
in s
, then f x'
is at least f x - ε
. We formulate this in a general
preordered space, using an arbitrary y < f x
instead of f x - ε
.
Equations
- LowerSemicontinuousWithinAt f s x = ∀ y < f x, ∀ᶠ (x' : α) in nhdsWithin x s, y < f x'
Instances For
A real function f
is lower semicontinuous on a set s
if, for any ε > 0
, for any x ∈ s
,
for all x'
close enough to x
in s
, then f x'
is at least f x - ε
. We formulate this in
a general preordered space, using an arbitrary y < f x
instead of f x - ε
.
Equations
- LowerSemicontinuousOn f s = ∀ x ∈ s, LowerSemicontinuousWithinAt f s x
Instances For
A real function f
is lower semicontinuous at x
if, for any ε > 0
, for all x'
close
enough to x
, then f x'
is at least f x - ε
. We formulate this in a general preordered space,
using an arbitrary y < f x
instead of f x - ε
.
Equations
- LowerSemicontinuousAt f x = ∀ y < f x, ∀ᶠ (x' : α) in nhds x, y < f x'
Instances For
A real function f
is lower semicontinuous if, for any ε > 0
, for any x
, for all x'
close
enough to x
, then f x'
is at least f x - ε
. We formulate this in a general preordered space,
using an arbitrary y < f x
instead of f x - ε
.
Equations
- LowerSemicontinuous f = ∀ (x : α), LowerSemicontinuousAt f x
Instances For
A real function f
is upper semicontinuous at x
within a set s
if, for any ε > 0
, for all
x'
close enough to x
in s
, then f x'
is at most f x + ε
. We formulate this in a general
preordered space, using an arbitrary y > f x
instead of f x + ε
.
Equations
- UpperSemicontinuousWithinAt f s x = ∀ (y : β), f x < y → ∀ᶠ (x' : α) in nhdsWithin x s, f x' < y
Instances For
A real function f
is upper semicontinuous on a set s
if, for any ε > 0
, for any x ∈ s
,
for all x'
close enough to x
in s
, then f x'
is at most f x + ε
. We formulate this in a
general preordered space, using an arbitrary y > f x
instead of f x + ε
.
Equations
- UpperSemicontinuousOn f s = ∀ x ∈ s, UpperSemicontinuousWithinAt f s x
Instances For
A real function f
is upper semicontinuous at x
if, for any ε > 0
, for all x'
close
enough to x
, then f x'
is at most f x + ε
. We formulate this in a general preordered space,
using an arbitrary y > f x
instead of f x + ε
.
Equations
- UpperSemicontinuousAt f x = ∀ (y : β), f x < y → ∀ᶠ (x' : α) in nhds x, f x' < y
Instances For
A real function f
is upper semicontinuous if, for any ε > 0
, for any x
, for all x'
close enough to x
, then f x'
is at most f x + ε
. We formulate this in a general preordered
space, using an arbitrary y > f x
instead of f x + ε
.
Equations
- UpperSemicontinuous f = ∀ (x : α), UpperSemicontinuousAt f x
Instances For
Lower semicontinuous functions #
Basic dot notation interface for lower semicontinuity #
Constants #
Indicators #
Relationship with continuity #
Composition #
Addition #
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
The sum of two lower semicontinuous functions is lower semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
Supremum #
Infinite sums #
Upper semicontinuous functions #
Basic dot notation interface for upper semicontinuity #
Constants #
Indicators #
Relationship with continuity #
Composition #
Addition #
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with an
explicit continuity assumption on addition, for application to EReal
. The unprimed version of
the lemma uses [ContinuousAdd]
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.
The sum of two upper semicontinuous functions is upper semicontinuous. Formulated with
[ContinuousAdd]
. The primed version of the lemma uses an explicit continuity assumption on
addition, for application to EReal
.