Sum of Lower Semicontinuous Function and Continuous Function is Lsc
Stationary Partial Differential Equations
Thomas Bartsch , ... Michel Willem , in Handbook of Differential Equations: Stationary Partial Differential Equations, 2005
Proof
By Theorem 1.1 and lower semicontinuity, it is easy to verify that
(1.3)
is achieved by some . After replacing by | |, we may assume that . It follows from the Lagrange multiplier rule that
A solution of (1.1) is then given by . Indeed, on Ω by the strong maximum principle. □
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874573305800099
Nonlinearity and Functional Analysis
In Pure and Applied Mathematics, 1977
6.5A A sharpening of the steepest descent method
For any general study of critical points, it is necessary to supplement the notions of weak lower semicontinuity and coerciveness by more refined analytic and topological considerations. To this end, we first reconsider the method of steepest descent, introduced in Section 3.2. Suppose F(x) is a smooth C 2 functional defined on a real Hilbert space H, and bounded from below on H. Then in Section 3.2 it was shown that the solutions x(t, x 0) of the initial value problem
(6.5.1)
,exist for all t ⩾ 0, with lim x(t, x 0) as t → ∞ a critical point of F(x) provided that the critical points of F(x) are isolated and that F(x) satisfies the following compactness condition (mentioned earlier in (6.1.1′)).
(6.5.2) Condition (C) Any sequence {xn } in H with |F(xn )| bounded and ||F′(xn )|| → 0 has a convergent subsequence.
Under hypothesis (6.2.2), the discussion of Section 3.2 shows that F(x) clearly attains its infimum on H. The following result shows the utility of (6.5.2) for the study of other types of critical points.
(6.5.3) Theorem Suppose that a C 2 functional F(x) defined on H is bounded from below and satisfies (6.5.2), and has only isolated critical points. If F(x) possesses two isolated relative minima y 1, y 2, then the functional F(x) must possess a third critical point y 3, distinct from y 1 and y 2, which is not an isolated relative minimum.
Proof: Suppose that F(x) does not have a third critical point. Then we shall show that H can be represented as the union of two open, disjoint subsets U 1 and U 2; which obviously contradicts the connectedness of H. To construct the sets Ui , suppose that x(t, x 0) is the solution of (6.5.1). By (6.5.2), x(t, x 0) exists for all t ⩾ 0 and lim x(t, x 0) as t → ∞ is yi (i = 1, 2). Let Ui = {x 0 | lim x(t, x 0) = yi as t → ∞} (i = 1, 2). Clearly H = U 1 ∪ U 2, while U 1 and U 2 are disjoint. To show that the sets Ui are open in H, we first note that each yi , being a strict relative minimum, has a neighborhood Wi such that any solution x(t, x 0) which enters Wi remains in Wi and, in fact, converges to yi as t → ∞. Indeed, for x 0 sufficiently near yi , since F(x(t, x 0)) is a decreasing function of t, x(t, x 0) → yi . Thus, by virtue of the continuity of x(t, x 0) with respect to the initial condition x 0, if z 0 ∈ Ui , then for ɛ > 0 sufficiently small with , there is a T such that both x(T, z 0) and lie in Wi . Consequently if z 0 is. Therefore each Ui is open, and we have obtained the desired contradiction.
It is also immediate that the third critical point y 3 shown to exist by the above argument cannot be another relative minimum, for if it were and if F(x) had no other critical points, then the argument just given would again lead to a contradiction.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S0079816908607588
Stationary Partial Differential Equations
F. Brock , in Handbook of Differential Equations: Stationary Partial Differential Equations, 2007
Proof
(1) Assume U ∈ (BR ) for some R > 0, and
where
Furthermore, let δ = inf{‖v − u ★‖2: v ∈ B ★(u )}. In view of the weak lower semicontinuity of the functional J and the nonexpansivity of the Schwarz symmetrization, B ★(u) is weakly closed in (BR ). Hence there exists some U ∈ B ★(u) with δ = ‖U − u ★‖2. Since J(UH ) = J(U) ∀H ∈ H ★, we may then argue as in the proof of Theorem 4.1 to obtain that δ = 0, and thus U = u ★. This shows (4.8).
(2) Let u ∈ (ℝ N ) for some p ∈ (1, ∞). We choose a sequence {u n} ⊂ (ℝ N ) which converges to u in W 1,p (ℝ N ). By (4.8) with G(v, z) = zp we then have that ‖∇un ‖ p ⩾ ‖∇(un )★‖ p, n = 1, 2,…. Hence we find a subsequence { } and a function v ∈ W 1,p (ℝ N ) such that ⇀ν weakly in W 1,p (ℝ N ). But by the nonexpansivity of the Schwarz symmetrization in Lp we have that (un )★ → u ★ in Lp (ℝ N ), so that v = u ★. Finally, the weak lower semicontinuity of the norm gives ‖∇u ★‖ p ⩽ lim inf ‖∇ ‖ p ⩽ lim ‖∇un ‖ p = ‖∇u‖ p .
(3) Let u ∈ W 1,∞ (ℝ N ) ∩ S +. By Rademacher's Theorem, there is a version u ∈ C 0,1 (ℝ N ) ∩ L ∞ (ℝ N ) ∩ S +. By Theorem 4.1 this implies ω u ★ ⩽ ω u and u ★ ∈ C 0,1(ℝ N ). Since also ‖∇ u ‖∞ = lim t ↘ω u (t)/t, (4.9) follows for p = ∞.
(4) Let u ∈ (ℝ N ). We choose a sequence {un } ⊂ (ℝ N ) with un → u in W 1,1(Ω). Then have that for every Young function G,
By a result of [5] this implies that
Due to a well-known weak compactness criterion in L 1 this implies that there is a function v ∈ L 1 (Ω) and a subsequence {(un′ )★} such that |∇(un′ )★)| ⇀ ν weakly in L 1 (ℝ N ). Since (un )★ → u in L 1 (ℝ N ) this implies that |∇u ★| = v and u ★ ∈W 1,1(ℝ N ). Finally, the inequality (4.9) for p = 1 follows from the weak lower semicontinuity of the norm.
The inequalities (4.10) and (4.11) in Theorem 4.4 below are well-known (see [72,101,18] and [37]), while experts seem to be familiar with (4.10), although we could not find a reference.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874573307800040
Image Processing: Mathematics
G. Aubert , P. Kornprobst , in Encyclopedia of Mathematical Physics, 2006
Examples of Functional Spaces
In this section, we revisit some possible choices of functional spaces summarized in Table 1 .
Table 1. Examples of functional spaces and their norm (see model [8]).
| Model | E and |u| E | ϕ(t) | G and |u| G | ψ(t) |
|---|---|---|---|---|
| (a) | t 2 | L 2(Ω) with its usual norm | t 2 | |
| (b) | t | L 2(Ω) with its usual norm | t 2 | |
| (c) | t | t |
The first case (a) was inspired by the classical Tikhonov regularization. The functional space is the space of functions in L 2(Ω) such that the distributional gradient Du is in L 2(Ω). Unfortunately, functions in H 1(Ω) do not admit discontinuities across curves and this is a major problem with respect to image analysis since images are made of smooth patches separated by sharp variations.
Considering the problem reported in (a), Rudin et al. (1992) proposed to work on BV(Ω), the space of bounded variations (BV) Ambrosio et al. (2000) defined by
[9]
It is equivalent to define BV(Ω) as the space of L 1(Ω) functions whose distributional gradient Du is a bounded measure and [9] is its total variation. The space BV(Ω) has some interesting properties:
- 1.
-
lower semicontinuity of the total variation ∫ Ω|Du| with respect to the L1(Ω) topology,
- 2.
-
if u∈BV(Ω), we can define, for almost everywhere x∈S u , the complement of Lebesgue points (i.e., the jump set of u), a normal n u (x) and two approximate "right" and "left" limits u +(x) and u −(x), and
- 3.
-
Du can be decomposed as a sum of a regular measure, a jump measure, and a Cantor measure:
where ∇u is the approximate gradient and the one-dimensional Hausdorff measure.
This ability to describe functions with discontinuities across a hypersurface S u makes BV(Ω) very convenient to describe images with edges. In this context, the image restoration problem is well posed and suitable numerical tools can be proposed (Chambolle and Lions 1997).
One criticism of the model (b) in Table 1 pointed out by Meyer (2001) is that if f is a characteristic function and if f is sufficiently small with respect to a suitable norm, then the model (Rudin et al. 1992) gives u=0 and η=f contrary to what one should expect (u=f and η=0). In fact, the main reason of this phenomenon is that the L 2-norm for the η component is not the right one since very oscillating functions can have large L 2-norm (e.g., fn (x)=cos(nx)). To better describe such oscillating functions, Meyer (2001) introduced the space of functions which can be expressed as a divergence of L ∞-fields. This work was developed in RN and this framework was adapted to bounded 2D domains by Aubert and Aujol (2005) (see (c) in Table 1 ). An example of image decomposition is shown in Figure 3 .
Figure 3. Example of image decomposition (see Aubert and Aujol (2005)).
In this section, we have shown how the choice of the functional spaces is closely related to the definition of a variational formulation. The functionals are written in a continuous setting and they can usually be minimized by solving the discretized Euler equations iteratively, until convergence. These PDEs and the differential operators are constrained by the energy definition but it is also possible to work directly on the equations, forgetting the formal link with the energy. Such an approach has also been much developed in the computer vision community and it is illustrated in the next section.
We refer the reader to Aubert and Kornprobst (2002) for a general review of variational approaches and PDEs as applied to image analysis.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/B0125126662003679
Handbook of Dynamical Systems
Alexander Mielke , in Handbook of Dynamical Systems, 2002
Theorem 5.2
Under the above assumptions for each ɛ > 0 there exists an ℓ > 0 such that for all domains Ω ⊂ ℝ d with {x: |x| < ℓ} and all bc ∈ {Dir, Neu, Per} we have .
The remaining open problem is under what conditions we also have lower semicontinuity of the attractor, i.e., for suitably large domains Ω. In the next subsection we give a simple example showing that lower semicontinuity is in general false. In our example the limit of for ℓ → ∞ exists for each bc ∈ {Dir, Neu, Per}, but it depends on bc and is strictly contained in A ℝ.
The problem of convergence of is a problem of interchanging the limit t → ∞ in the definition of the attractors with the limit Ω n → ℝ d . The interchange of such limits would only be possible, if the attraction rates for the attractors are uniform in n; however, this is in general not the case. In [65] a generalized limit attractor was introduced which allows for double limits where t n → ∞ simultaneously with the parameter ɛ n → 0. In our situation this leads to the following definition. Consider a sequence (bc n , Ω n ) n∈ℕ of boundary conditions and domains which approach ℝ d in the sense that {x: |x| < ℓ n } ⊂ Ω n with ℓ n → ∞. Now set
The motivation to consider A* rather than w-lime is that for practical purposes (e.g., in experiments or numerics) we always have to consider finite time and bounded domains. Thus, one should neither prescribe the limit t → ∞ before n → ∞ nor the opposite, see [65] for a further discussion.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874575X02800364
Reliable Methods for Computer Simulation
In Studies in Mathematics and Its Applications, 2004
5.4.1 Lower semicontinuous functionals
Recall that the functional J:V→R is called continuous at v 0if for any sequence converging to v 0 in V, we have
(5.4.3)
Also, J is said to be continuous at v 0if for any α and β such that α <J(v 0) <β there exists a number ɛ > 0 such that
Let be a sequence of real numbers. By we denote the lower limit of this sequence, which may be finite or infinite.
Definition 5.4.1
We say that J:V→ is lower semicontinuous at v 0∈V if
(5.4.4)
for any sequence converging to v 0 in V.
Another definition of lower semicontinuous functionals is as follows.
Definition 5.4.2
A functional J is said to be lower semicontinuous at v 0∈V if the inequality J(v 0) > αimplies that this inequality also holds in a ball centered at v 0,i.e.,
where ɛ is a positive number.
The relationship between these definitions is quite transparent. Indeed, assume that J is lower semicontinuous in the sense of Definition 5.4.2 and v k →v 0 in V. Take α such that J(v 0) > α and choose a respective B(v 0, ɛ). Then,v k ∈ B(v 0, ɛ), provided that k is greater than a certain positive integer N(ɛ). Consequently, J(v k ) > α and lim J(v k ) ≥J(v 0). If V is a space with a countable base, then both definitions are equivalent. In general topological spaces, Definition 5.4.2 should be used.
Definition 5.4.3
A functional that is lower semicontinuous at any point is called lower semicontinuous or an l.s.c. functional.
Definition 5.4.4
A functional G is called upper semicontinuous if G=-J, where J is a lower semicontinuous functional.
Note that a functional is continuous if and only if it is simultaneously lower and upper semicontinuous.
Proposition 5.4.1
The sets
are closed if and only if J is an l.s.c. functional.
Proof
Let J be a lower semicontinuous functional. Then the set
is open. Indeed, this fact follows from Definition 5.4.2, which says that any point v 0belongs to V\V αwith a certain neighborhood. Therefore,V α is a closed set. If V α is closed for any α, then V\V αis open and, consequently, any v 0∈V\V αhas a neighborhood B(v 0, ɛ) ⊂V\V α. This means that J(v) > α for all v∈ B(v 0, ɛ), i.e., J is a lower semicontinuous functional.
The theorem below shows the meaning of lower semicontinuity in proving existence theorems for variational problem.
Proposition 5.4.2
Assume that J:V→ is an l.s.c. functional, the set V α is compact for someα > inf P,and
Then there exists an element u∈V such that J(u) = inf P.
Proof
Let be a minimizing sequence. Then,v k ∈V α for k>N(α). Since V α is compact, we can extract a subsequence {v ks } such that v ks →u∈V α. Then
which shows that J(u) = inf P.
However, this theorem is difficult to use, because in the majority of variational models that are of practical importance, the sets V α are not compact. This suggests to impose stronger conditions on J with less demanding conditions for V α . Along this way, the lower semicontinuity condition is replaced by the weak lower semicontinuity condition.
Definition 5.4.5
A functional J:V→ is said to be weakly lower semicontinuous at v 0∈V if
for any sequence that weakly converges to v 0.
The concept of weak lower semicontinuity plays an important role in the calculus of variations. First, we need a suitable criterion for verifying whether or not a functional possesses such a property. In general, this is not an easy task. However, the weak lower semicontinuity of convex functionals is found to follow from the lower semicontinuity, which makes the verification of it rather simple. Below we prove this fact for Hilbert spaces.
Proposition 5.4.3 (Banach, Saks, and Mazur)
Let{v k }be a sequence of elements in the Hilbert space H, which weakly converges to v 0∈H. Then one can find a subsequence{v ki }such that the sequence strongly converges to v 0 in H.
Proof
Without loss of generality, we may consider only the case v 0= 0. Let us construct a subsequence {v ki } by the following procedure. Set v k 1 =v 1. Since (v k 1 ,v) → 0 as k→ ∞, we find v k 2 such that |(v k 1 ,v k 2 )| < 1. Assume that v k 1 , …,v k i are determined. Find v k i+1 such that
The sequence {v k } is bounded and, therefore, ||v k i || ≤c< +∞. Note that the amount of products (v k i ,v k i ), where i<j, is 2(j- 1) (the multiplier 2arises due to the symmetry) and the value of such a product is no greater than 1/(j- 1). In view of this fact, we have
The right-hand side of this estimate tends to zero as m→ +∞. Hence, the required statement is proved.
Remark 5.4.1
Proposition 5.4.3 implies the following result: any convex closed set K is weakly closed. Indeed, if {v k } ∈ K and v k weakly converges to v 0∈H(i.e.,v k ⇀v 0), then one can find a sequence of "averaged" elements {w k } that converges to v 0. Since K is closed, we see that v 0∈K and, therefore, K is weakly closed.
Proposition 5.4.4
Let J:H→ be a lower semicontinuous functional. If J is convex, then it is weakly lower semicontinuous.
Proof
Our aim is to show that
for any sequence {v k } such that v k ⇀v 0. By the definition of the lower limit, the sequence {v k } contains a subsequence { } such that
Obviously,v k s weakly converges to v 0. Thus, we may apply Proposition 5.4.3, which shows that {v k s } contains a subsequence {v i } such that strongly converges to v 0. By the convexity of J, we obtain
Since J is lower semicontinuous,
we see that
Remark 5.4.2
Propositions 5.4.3 and 5.4.4 admit of wide generalizations. They remain valid for reflexive Banach spaces. After the replacement of weak convergence by the so-called *-weak convergence, they are also valid for topological vector spaces (see, e.g., [190]).
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S0168202404800067
Convex Analysis and Duality Methods
G. Bouchitté , in Encyclopedia of Mathematical Physics, 2006
Continuity and Lower-Semicontinuity
A first consequence of the convexity is the continuity on the topological interior of the domain. We refer for instance to Borwein and Lewis (2000) for a proof of
Theorem 1
Let be convex and proper. Assume that , where U is a suitable open subset of X. Then f is continuous and locally Lipschitzian on all int(dom f ).
As an immediate corollary, a convex function on a normed space is continuous provided it is majorized by a locally bounded function. In the finite-dimensional case, it is easily deduced that a finite-valued convex function is locally Lipschitz. Furthermore, by Aleksandrov's theorem, f is almost everywhere twice differentiable and the non-negative Hessian matrix ∇2 f coincides with the absolutely continuous part of the distributional Hessian matrix D 2 f (it is a Radon measure taking values in the non-negative symmetric matrices).
However, in infinite-dimensional spaces, for ensuring compactness properties (as, e.g., in condition (ii) of Theorem 4 below), we need to use weak topologies and the situation is not so simple. A major idea consists in substituting the continuity property with lower-semicontinuity.
Definition 2
A function is τ-l.s.c. at if for all , there exists such that f > α on U. In particular, f will be l.s.c. on all X provided is open for every .
Remark 3
- (i)
-
The following sequential notion can be also used: f is τ-sequentially l.s.c. at x 0 if
It turns out that this notion (weaker in general) is equivalent to the previous one provided x 0 admits a countable basis of neighborhoods. - (ii)
-
A well-known consequence of Hahn–Banach theorem is that, for convex functions, the lower-semicontinuity property with respect to the normed topology of X is equivalent to the weak (or weak sequential) lower-semicontinuity.
Theorem 4
(Existence).Let be proper, such that
- (i)
-
f is τ-l.s.c.,
- (ii)
-
is τ-relatively compact.
In practice, the choice of the topology τ is ruled by the condition (ii) above. For example, if X is a reflexive infinite-dimensional Banach space and if f is coercive (i.e., ), we may take for τ the weak topology (but never the normed topology). This restriction implies in practice that the first condition in Theorem 4 may fail. In this case, it is often useful to substitute f with its lower-semicontinuous (l.s.c.) envelope.
Definition 5
Given a topology τ, the relaxed function is defined as
It is easy to check that f is τ-l.s.c. at x 0 if and only if . Futhermore,
We can now state the relaxed version of Theorem 1.4.
Theorem 6
(Relaxation). Let , then: . Assume further that, for all real r, is -relatively compact; then f attains its minimum and .
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/B0125126662004879
Gradient Flows of Probability Measures
Luigi Ambrosio , Giuseppe Savaré , in Handbook of Differential Equations: Evolutionary Equations, 2007
3.2 Examples ofconvex functionals in 2(ℝd)
In this section we introduce the main classes of geodesically convex functionals.
Example 3.4
(Potential energy). Let V : ℝd → (−∞, +∞] be a proper, lower semicontinuous function whose negative part has a quadratic growth, i.e.,
(3.6)
In 2 (ℝ d ) we define
(3.7)
Evaluating on Dirac's masses we check that is proper; since V− has at most quadratic growth Lemma 1.2 gives that is lower semicontinuous in 2(ℝ d ). If V is bounded from below we have even lower semicontinuity w.r.t. narrow convergence.
The following simple proposition shows that is convex along all interpolating curves induced by admissible plans; choosing optimal plans one obtains in particular that is convex along geodesics.
Proposition 3.5
(Convexity of ). If V is λ-convex then for every μ 1 ,μ 2 ∈ D( ) and μ e Γ(μ 1 , μ 2) we have
(3.8)
In particular is λ-convex along geodesics.
Proof. Since V is bounded from below either by a continuous affine functional (if ) or by a quadratic function (if λ < 0) its negative part satisfies (3.6); therefore the definition (3.7) makes sense.
Integrating (3.3) along any admissible transport plan μ ∈ Γ(μ 1, μ 2) with μ 1, μ 2 ∈ D( ) we obtain (3.8), since
Since (δx ) = V(x), it is easy to check that the conditions on V are also necessary for the validity of the previous proposition.
Example 3.6
(Interaction energy). Let us fix an integer k > 1 and let us consider a lower semicontinuous function W:ℝ kd → (−∞, +∞], whose negative part satisfies the usual quadratic growth condition. Denoting by μ×k the measure μ × μ × … × μ on ℝ kd , we set
(3.9)
If
(3.10)
then Wk is proper; its lower semicontinuity follows from the fact that
(3.11)
Here the typical example is k = 2 and for some with .
Proposition 3.7
(Convexity of W). If W is convex then the functional Wk is convex along the interpolating curve induced by any μ e Γ(μ 1, μ 2), in 2(ℝ d ).
Proof. Observe that Wk is the restriction to the subset
of the potential energy functional on 2(ℝ kd ) given by
We consider the linear permutation of coordinates P : (ℝ2d )k → (ℝ kd )2 defined by
If μ ∈ Γ(μ 1, μ 2) then it is easy to check that and
Therefore all the convexity properties of Wk follow from the corresponding ones of .
Example 3.8
(Internal energy). Let F : [0, +∞) → (−∞, +∞] be a proper, lower semicontinuous convex function such that
(3.12)
We consider the functional ℱ: 2(ℝ d ) → (−∞, +∞] defined by
(3.13)
Remark 3.9
(The meaning of condition (3.12)). Condition (3.12) simply guarantees that the negative part of F (μ) is integrable in ℝ d . For, let us observe that there exist nonnegative constants c 1, c 2 such that the negative part of F satisfies
and it is not restrictive to suppose . Since μ = uℒd ∈ 2(ℝ d ) and 2α/(1 − α) < d we have
and therefore F − (u) ∈ L 1(ℝ d ).
Remark 3.10
(Lower semicontinuity of ℱ). General results on integral functionals (see, for instance, [8]) show that ℱ is narrowly lower semicontinuous if F is nonnegative and has a superlinear growth at infinity. Indeed, under this assumption sequences μn = unℒd on which ℱ is bounded have the property that (un ) is sequentially weakly relatively compact in L 1(ℝ d ), and the convexity of ℱ together with the lower semicontinuity of F ensure the sequential lower semicontinuity with respect to the weak L 1 topology.
In the next proposition we prove the geodesic convexity of the internal energy functional (3.13) by using the change of variable formula (1.24). This was first shown by McCann [66] with a different argument.
Proposition 3.11
(Convexity of ℱ). If F has a superlinear growth at infinity and
(3.14)
then the functional ℱ is convex along geodesics in 2(ℝ d ).
Proof. We consider two measures μi = uiℒd ∈ D(ℱ), i = 1, 2, and the optimal transport map r such that r#μ 1 = μ 2. Setting r t := (1 − t)i + t r, by the characterization of constant speed geodesics we know that r t is the optimal transport map between μ 1 and μ t := r t# μ 1 for any t ∈ [0, 1], and , with
By (1.24) it follows that
Since for a diagonalizable map D with nonnegative eigenvalues
(3.15)
the integrand above may be seen as the composition of the convex and nonincreasing map s ↦ sd F (u 1(x)/sd ) and of the concave map in (3.15), so that the resulting map is convex in [0, 1] for μ 1-a.e. x ∈ ℝ d . Thus we have
and the thesis follows by integrating this inequality in ℝd .
In order to express (3.14) in a different way, we introduce the function
(3.16)
denoting by the modified function F(e−z )e z we have the simple relation
(3.17)
The nonincreasing part of condition (3.14) is equivalent to say that
(3.18)
and it is in fact implied by the convexity of F. A simple computation in the case F ∈ C 2 (0, +∞) shows
and therefore
(3.19)
i.e.,
(3.20)
Observe that the bigger is the dimension d, the stronger are the above conditions, which always imply the convexity of F.
Remark 3.12
(A "dimension free" condition). The weakest condition on F yielding the geodesic convexity of ℱ in any dimension is therefore
(3.21)
Taking into account (3.17), this is also equivalent to ask that
(3.22)
Among the functionals F satisfying (3.14) we quote
(3.23)
(3.24)
Observe that the entropy functional and the power functional with m > 1 have a superlinear growth. In order to deal with the power functional with , due to the failure of the lower semicontinuity property one has to introduce a suitable relaxation ℱ* of it, defined by [24,55]
(3.25)
In this case the functional takes only account of the density of the absolutely continuous part of μ w.r.t. ℒd and the domain of ℱ* is the whole 2(ℝ d ). The functional ℱ* retains the convexity properties of ℱ, see [9].
Example 3.13
(The opposite Wasserstein distance). Let us fix a base measure μ 1 ∈ 2(ℝ d ) and let us consider the functional
(3.26)
Proposition 3.14
For each couple μ 2, μ 3 ∈ 2(ℝ d ) and each transfer plan μ 23 ∈ Γ(μ 2, μ 3) we have
(3.27)
In particular the map is (−1)-convex along geodesics.
Proof. For μ 23 ∈ Γ (μ 2, μ 3), we can find (see Proposition 7.3.1 of [9]) μ ∈ (ℝ d × ℝ d × ℝ d ) whose projection on the second and third variable is μ 23 and such that
(3.28)
with . Therefore
In particular, choosing optimal plans in (3.27), we obtain the semiconcavity inequality of the Wasserstein distance from a fixed measure μ 3 along the constant speed geodesics connecting μ 1 to μ 2:
(3.29)
According to Aleksandrov's metric notion of curvature (see [5,58]), this inequality can be interpreted by saying that the Wasserstein space is a positively curved metric space (in short, a PC-space). This was already pointed out by a formal computation in [74], showing also that generically the inequality is strict. An example where strict inequality occurs can be obtained as follows: let d = 2 and
then, it is immediate to check that and . On the other hand, the unique constant speed geodesic joining μ 1 to μ 2 is given by
and a simple computation gives
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874571707800041
Basic Concepts and Results
Juan Ferrera , in An Introduction to Nonsmooth Analysis, 2014
1.2 Semicontinuity
Definition 1.8
We start by recalling a well-known definition. We say that a real function is continuous at provided that for every there is a such that whenever . If this property holds for every , we say that is continuous on .
It is easy to see that a function is continuous at if and only if for every sequence converging to , converges to .
Continuous functions have many good properties; they attain maxima and minima over compacts for instance. Many of these properties hold under weaker continuity conditions. The aim of this section is to introduce such conditions.
Definition 1.9
We say that a real function is lower semicontinuous ( ), respectively upper semicontinuous ( ), at , provided that , respectively , for every sequence satisfying . If the property holds for every point we say that is respectively, on .
It is not difficult to see that lower semicontinuity at is equivalent to
while upper semicontinuity is characterized by
The following proposition gives us a - characterization of lower semicontinuity.
Proposition 1.10
is at if and only if for every there is a such that whenever . A similar result holds for functions
Proof
Assume that is at . Let then for every there is a such that . For every we have
Conversely, let , choose a positive such that for every . We take a point such that
we have
for every positive . Let us observe also that the left-hand side of the inequality is positive, hence for every positive . We have proved that
The following question arises: have we proved more than lower semicontinuity? Of course not, since we have defined lower limits in such a way that the inequality always holds. The following result is a mere exercise.
Proposition 1.11
is continuous if and only if it is both and .
The following proposition summarizes some elementary properties of semicontinuous functions. We suggest the reader work through the details of the proof.
Proposition 1.12
Let . We have
- (i)
-
is if and only if is
- (ii)
-
If are , respectively , then is , respectively .
- (iii)
-
If is , respectively , then is also , respectively .
One of the goals of this book is to establish the involved ideas in a geometrical form as well as an analytical one. For this we introduce two sets associated to a given function, which will allow us to present the analytical properties that we have just defined as geometric properties.
Definition 1.13
For a given function , we define its epigraph, respectively hypograph,as the following set: , respectively .
Despite its simplicity the next result remarks the relation between analytic and geometrical properties.
Proposition 1.14
Let be a function, we have that is if and only if is a closed set, similarly is if and only if is closed (see Fig. 1.1 ).
Proof
Assume that is , let be a sequence converging to , implies that , hence since is , and consequently .
Conversely we assume that is closed. Fix a point , given a sequence converging to , such that , we have that and consequently belongs to too since it is closed. This implies that , in other words: is at . The proof for is similar.
Figure 1.1. Graphs of semicontinuous functions.
As a consequence of the preceding results, a continuous function satisfies that its graph, which can be represented as , is closed. The converse is not true, consider for instance the function defined as if otherwise. Its graph and epigraph are closed, but does not have this property.
An easy and important consequence of the preceding proposition is the stability of semicontinuous functions under some operations. For instance:
Corollary 1.15
Let be a family of , respectively functions. Then is , respectively is .
Proof
The result is a consequence of the fact that
These results are no longer true for continuous functions.The of the following family of continuous functions is not continuous.
Example
defined by if if , and if (see Fig. 1.2).
Figure 1.2. Continuity is not preserved by sup.
A well-known result establishes that every continuous function attains its minimum in any compact set. The next result extends this property.
Proposition 1.16
Let be a compact subset of . Every function attains its minimum with respect to .
Proof
Let . If , there would be a sequence such that . We may assume without loss of generality that converges to by compactness. Lower semicontinuity of would imply that , which is not possible. Hence , and we take a sequence , that we may consider convergent to a again, such that . Finally, implies , hence is a minimum.
Sometimes we will consider functions defined on a subset instead of on the whole space . The set where the function is defined is called domain of , and we will denote it by . In this case, continuity concepts are defined as above, imposing that all the arguments lie in .
We will sometimes allow our functions to reach the value , in other words: . Many definitions make sense in this new context, since we can calculate limits and do algebraic operations (except for !). Accepting this new value, we may extend functions defined in a subset of to the whole space, assuming that the value of the function is out of its domain. Some properties of the function are stable under this kind of extension, the minimum value for instance. The reason for choosing the value instead of is precisely because we are going to deal with minima, and functions. Replacing function by , minima are maxima, lower semicontinuity transforms into upper semicontinuity, and we extend the function to . Both derivations are trivially equivalent. However we will not admit the function . Even though it is probably clear how to define functions for functions taking values in , we still write it.
Definition 1.17
We say that a function is at a point if .
Let us observe that lower limits are defined exactly as in Definition 1.5 if the range of the function is . If , then implies that , and consequently are . Upper semicontinuity is defined for functions in a similar way.
An extremely useful function in this setting is the function of a set , defined by
It is left as an exercise for the reader to see that is if and only if is closed.
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/B9780128007310000011
Handbook of Dynamical Systems
G. Raugel , in Handbook of Dynamical Systems, 2002
Definition 3.5
Let , where L is a subset of Λ. The ω-limit set of the family of sets , is defined by
(3.11)
Several properties of the set are given in [111]. If and, for each has a compact global attractor, then the upper semicontinuity (respec tively the lower semicontinuity) of the attractors at λ = λ 0 implies that (respectively . If is compact, it follows from the inclusion that the attractors are upper semicontinuous at λ0. We remark that the inclusion does not imply lower semicontinuity of the attractors A λ. Indeed, consider the ODE with , that is . There is no continuity of the attractors at Λ = 0; however, .
We notice that does not involve directly the semigroup . In particular, could be conservative.
The following question then arises: how much information can we obtain about a conservative system by considering the limit of dissipative systems, when the dissipation goes to zero? We cannot hope to obtain too many specific properties of the dynamics of the limit system in this way, but one should be able to obtain some information about the manner in which the orbits of the dissipative systems wander over the level sets of the energy of the limit system.
Consider the ODE , where is a constant, has only simple zeros and f (u) is dissipative (i.e., lim . The energy functional is . For , the ODE is a gradient system and has a global attractor . Let be the set of the saddle equilibrium points of the system. If , for , then, for any interval ,
, where (for details, see [111]).
The limit only uses information about the attractors. As a consequence, the transient behaviour of the semigroups S Λ for initial data not on the attractors is completely ignored. To gain some information about this transient behaviour, one can consider the following concept of ω-limit set:
Read full chapter
URL:
https://www.sciencedirect.com/science/article/pii/S1874575X02800388
Source: https://www.sciencedirect.com/topics/mathematics/lower-semicontinuity
0 Response to "Sum of Lower Semicontinuous Function and Continuous Function is Lsc"
Postar um comentário