Subdifferential stability and subdifferential sum rules
March 19, 2024
[TABLE]
Dedicated to Alex Ioffe on the occasion of his 80th birthday
Abstract.
In the first part, we discuss the stability of the
strong slope and of the subdifferential of a
lower semicontinuous function with respect
to Wijsman perturbations of the function, i.e. perturbations
described via Wijsman convergence.
In the second part, we show how subdifferential sum rules can be
viewed as special cases of subdifferential stability results.
Keywords:
lower semicontinuity, Wijsman convergence, slope,
subdifferential calculus, trustworthiness.
2010 Mathematics Subject Classification:
49J52, 49J53, 49J45, 26E15.
1 Introduction
In the first part, we study the stability of the
strong slope [5] and of the subdifferential of a
lower semicontinuous function with respect to variational perturbations
of the function. This issue was initiated in our work [8].
There we showed that the slope of the sum f+x∗ of
a lower semicontinuous function f and of a continuous linear functional x∗
is stable under slice perturbations of f,
where the notion of slice convergence for lower semicontinuous,
non necessarily convex, functions was introduced
in [7].
Here we show instead that the slope of f is stable under Wijsman
perturbations of f, a weaker and classical notion of convergence
(see [2, 16]).
Our preceding result can be recovered from the following fact
(see Theorem 3.4):
A sequence (fn)n is slice
convergent to f if and only if the sequence
(fn+x∗)n is Wijsman convergent to f+x∗ for every x∗∈X∗.
Applications to the stability of trustworthy subdifferentials
(see [10]) under Wijsman convergence are adapted from [8].
In the second part, we show how subdifferential sum rules can be
viewed as special cases of subdifferential stability results.
The results of this article were largely announced in [13].
Notation.
Except where otherwise stated, X stands for a real Banach space
and X∗ for its topological dual. All functions are assumed
to be extended-real-valued and lower semicontinuous (lsc);
LSC(X) denotes the space of all such functions on X.
For f∈LSC(X), we denote by domf:={x∈X:f(x)<∞}
the effective domain of f, by
graphf:={(x,α):f(x)=α} the *graph *of f,
by
epif:={(x,α):f(x)≤α} the epigraph of f
and by
hypof:={(x,α):f(x)≥α} the hypograph of f.
We write x→fxˉ to say that x→xˉ and f(x)→f(xˉ).
For any two functions f,g∈LSC(X) we denote by
[TABLE]
the inf-convolution of f and g.
The closed ε-ball centered at point x is written
Bε(x).
For a subset S⊂X and a norm ∥⋅∥ on X,
the distance of a point x∈X to S is given by
[TABLE]
and the closed uniform δ-neighborhood of S (δ≥0) is
defined by
[TABLE]
The diameter of S is given by
diam(S):=sup{∥x−y∥:x,y∈S},
and the indicator of S is the function δS:X→R∪{∞} defined by
[TABLE]
For f:X→R∪{∞} et S⊂X, we write
fS:=f+δS for the ‘restriction’ of f to S,
and infSf:=inff(S).
2 Convergences of sets
We recall (see [2, Definition 5.2.1]) that
the lower and upper limits of a sequence of
sets (Sn)n in a Hausdorff topological space Y are respectively
defined by
[TABLE]
In a metric space Y these formulas reduce to
[TABLE]
Definitions (1b)–(2b) go back to Peano (1887, 1908),
definitions (1)–(2) were popularized by Kuratowski (1948):
see Dolecki-Greco [6] for historical comments.
Lower and upper limits of a sequence of sets
describe two symmetric
behaviors of the sequence with respect to individual points of the space:
a point y is in LiSn if and only if every neighborhood
of y ‘hits’ Sn eventually, while
a point y is not in LsSn if and only if some neighborhood
of y ‘misses’ Sn eventually.
In normed spaces, this hit-and-miss behavior is more conveniently
described by using gap distances. We recall that
the gap distance
between two sets A, B of (Y,∥.∥) is given by
[TABLE]
Proposition 2.1**.**
Let Y be a normed space and let {Sn,S}⊂Y
with S closed. Then:
(a)* \begin{array}[t]{lcl}\displaystyle S\subset\mathrm{Li}\kern 1.49994ptS_{n}&\Longleftrightarrow&\displaystyle\forall y\in Y,\quad\limsup_{n}\,d(y,S_{n})\leq d(y,S)\\
&\Longleftrightarrow&\displaystyle\forall S^{\prime}\subset Y,\quad\limsup_{n}\,{\rm D}(S^{\prime},S_{n})\leq{\rm D}(S^{\prime},S).\end{array}*
(b)* \leavevmode S⊃LsSn\leavevmode ⟺\vskip3.0ptplus1.0ptminus1.0pt∀y∈Y,d(y,S)>0⇒δ>0supnliminfD(Bδ(y),Sn)>0.*
(c)*
\leavevmode d(y,S)≤nliminfd(y,Sn)\leavevmode ⟺\vskip3.0ptplus1.0ptminus1.0pt∀λ≥0,D(Bλ(y),S)>0⇒δ>0supnliminfD(Bλ+δ(y),Sn)>0.*
**Proof. **The above assertions are certainly well known, but we provide a full
proof for completeness.
(a) The first property implies the second one: if
γ>d(y,S),
then the open set V:=intB(y,γ) contains a point z
in S⊂LiSn, and
since V∈N(z), it follows from (1) that
Sn∩V=∅ eventually,
hence limsupnd(y,Sn)≤γ, as required.
The second property implies the third one: if
γ>D(S′,S), then d(z,S)<γ for some z∈S′, so
limsupnD(S′,Sn)≤limsupnd(z,Sn)≤d(z,S)<γ.
The third property implies the first one: if y∈S, then
limsupnd(y,Sn)=0 by the third property, so y∈LiSn
by (1b).
(b) To prove ‘⇒’, let d(y,S)>0.
Then, y is not in S⊃LsSn, so,
according to the definition (2b)
of the upper limit, there exist δ>0 and
N∈N such that d(y,Sn)>δ for all n≥N.
Hence, for any δ′∈(0,δ), we have
D(Bδ′(y),Sn)≥δ−δ′>0, showing that the
property in the second half of (b) holds.
To prove ‘⇐’, let y∈/S. Then,
d(y,S)>0, so, for some δ>0,
D(Bδ(y),Sn)>0 eventually,
which implies that Sn∩Bδ(y)=∅ eventually, that is,
y∈/LsSn.
(c) To prove ‘⇒’, let γ:=D(Bλ(y),S)>0. Then,
d(y,S)≥λ+γ:
indeed, if z∈S, the point y′=y+λ(z−y)/∥z−y∥ is in
Bλ(y), so ∥z−y∥=λ+∥z−y′∥≥λ+γ. It follows
from our assumption that
d(y,Sn)≥λ+γ eventually, hence,
as easily seen,
for any δ∈(0,γ) we have
D(Bλ+δ(y),Sn)≥γ−δ>0 eventually,
showing that the second property in (c) holds.
To prove ‘⇐’, assume d(y,S)>λ.
Then, D(Bλ(y),S)>0, so, D(Bλ(y),Sn)>0 eventually,
hence d(y,Sn)>λ eventually, as required.
A sequence of sets (Sn)n is declared Kuratowski convergent to S
(or Peano-Kuratowski convergent to S)
provided LiSn=LsSn=S [2, Definition 5.2.3], whereas
in a metric space (Y,d),
the sequence is declared Wijsman convergent
to S provided d(y,Sn)→d(y,S) for every y∈Y
[2, Definition 5.2.3].
It readily follows from Proposition 2.1
that, in normed spaces, both convergences can be
characterized by a hit-and-miss criterion using gap distances:
Corollary 2.1.1**.**
Let (Y,∥.∥) be a normed space and let {Sn,S}⊂Y
with S closed. Then:
(a)*
(Sn)n is Wijsman convergent to S
if and only if, for every y∈Y and λ≥0,
(W)\left\{\begin{array}[]{rl}{\rm(i)}&y\in S\Rightarrow\lim_{n}d(y,S_{n})=0;\par\\
{\rm(ii)}&{\rm D}(B_{\lambda}(y),S)>0\Rightarrow\sup_{\delta>0}\liminf_{n}{\rm D}(B_{\lambda+\delta}(y),S_{n})>0.\end{array}\right.*
(b)*
(Sn)n is Kuratowski convergent to S if and only if (W)
holds for every y∈Y and λ=0.*
Since LiSn and LsSn are always closed sets, the limit S of
a Kuratowski or Wijsman convergent sequence is always a closed set.
3 Convergences of functions
A sequence of functions (fn)n⊂LSC(X)
is declared epi-convergent (or Γ-convergent) to
a function f∈LSC(X)
provided the sequence of their epigraphs (epifn)n is Kuratowski convergent
to epif in X×R [2, Definition 5.3.1].
Likewise, the sequence (fn)n
is declared Wijsman convergent to f provided the sequence
(epifn)n is Wijsman convergent to epif in X×R
supplied with the max norm ∥(x,t)∥:=max{∥x∥,∣t∣}.
In view of Corollary 2.1.1, epi-convergence and Wijsman convergence
of functions are characterized by hit-and-miss criteria. The proof uses
the following easy observation:
Fact 3.1** ([7, Lemma 2.2]).**
*For any two functions f,g:X→R∪{∞} one has
D(hypog,epif)=D(hypog,graphf)=D(graphg,epif).
Proposition 3.2**.**
Let X be a normed space and {fn,f}⊂LSC(X).
Then:
(a)* (fn)n is Wijsman convergent to f if and only if
for every x∈X, λ≥0 and α∈R,
{\rm(W_{g})}\left\{\begin{array}[]{rl}{\rm(i)}&\exists\,(x_{n})_{n}\subset X:\;x_{n}\to x,\;f_{n}(x_{n})\to f(x);\par\\
{\rm(ii)}&\displaystyle{\rm D}(B_{\lambda}(x)\times\alpha,{\rm epi}\kern 1.49994ptf)>0\Rightarrow\sup_{\delta>0}\liminf_{n}{\rm D}(B_{\lambda+\delta}(x)\times\alpha,{\rm epi}\kern 1.49994ptf_{n})>0.\end{array}\right.*
(b)* (fn)n is epi-convergent to f if and only if (Wg)
holds for every x∈X, λ=0 and α∈R.*
**Proof. **We have to show that the formulas (Wg) are equivalent to
the corresponding formulas (W) in Corollary 2.1.1
with Sn, S replaced
by epifn, epif and
Bλ(y) replaced by the balls of X×R supplied with
the box norm, namely Bλ(x)×[β,α].
We first observe that (W)(ii) and (Wg)(ii) are equivalent:
this is due to the
fact that for any h, D(Bλ(x)×[β,α],epih)=D(Bλ(x)×α,epih), as
follows from Fact 3.1
with g:=α+δBλ(x):
[TABLE]
Next, we claim that (W)(i) is equivalent to
[TABLE]
Indeed, assume (W)(i) and let
x∈domf. It follows from (W)(i) that
limnd((x,f(x)),epifn)=0, hence
there exists a sequence ((xn,αn))n in epifn
such that xn→x and αn→f(x). This implies that
limsupnfn(xn)≤limsupnαn=f(x).
Conversely, assume that (i’) holds, let (x,α)∈epif and let
ε>0. It follows from (i’) that for some sequence xn→x,
fn(xn)<α+ε eventually. We therefore have
[TABLE]
This shows that limnd((x,α),epifn)=0, as required.
To complete the proof of the proposition,
it suffices to show that (Wg)(ii) implies that
f(x)≤liminfnfn(xn) for every sequence xn→x. Let
α<f(x). Then, d((x,α),epif)>0, so by
(Wg)(ii) with λ=0, for some δ>0 one has
D(Bδ(x)×α,epifn)>0 eventually. Now, let
xn→x. Then xn∈Bδ(x) eventually, so
d((xn,α),epifn)>0 eventually, i.e., α<fn(xn)
eventually, which was to be proved.
Formulas (Wg) suggest possible localizations of
either concept of variational convergence ‘at a given point x’; we
consider only Wijsman convergence:
Definition 1**.**
A sequence of functions (fn)n⊂LSC(X) is
Wijsman convergent to f at x with radius λx∈(0,+∞]
provided (Wg) holds at x for all
λ∈[0,λx) and all α∈R.
Evidently, (global) Wijsman convergence implies
(local) Wijsman convergence at every point. The converse
need not be true.
In [7, 8], a stronger concept of variational convergence
is considered: roughly, it consists in demanding (Wg) to hold
not only for horizontal bounded slices Bλ(x)×α, i.e. graphs of constant maps restricted to balls, but
more generally for all non-vertical bounded slices, i.e. graphs of
continuous affine maps restricted to balls. The localization of this
concept of convergence at an individual point reads as follows:
Definition 2**.**
A sequence of functions (fn)n⊂LSC(X) is slice convergent
to f at x∈X with radius λx∈(0,+∞]
if for all functions φλ:=φ+δBλ(x), with
φ affine continuous and λ∈[0,λx),
{\rm(s)}\left\{\!\!\begin{array}[]{rl}{\rm(i)}&\exists\,(x_{n})_{n}\subset X:\;x_{n}\to x,\;f_{n}(x_{n})\to f(x);\par\\
{\rm(ii)}&\displaystyle{\rm D}({\rm graph}\kern 1.49994pt\varphi_{\lambda},{\rm epi}\kern 1.49994ptf)>0\Rightarrow\sup_{\delta>0}\liminf_{n}{\rm D}({\rm graph}\kern 1.49994pt\varphi_{\lambda+\delta},{\rm epi}\kern 1.49994ptf_{n})>0.\end{array}\right.
The sequence (fn)n is (globally) slice convergent to f if
(s) holds at every point x∈X with λx=+∞.
In [7, 8], this convergence was called ball-affine convergence
and it was proved that both the global and local versions
of this convergence coincide with the well-known slice convergence on the
space of convex lsc functions. This
justifies the use in the present paper of the alternative name ‘slice’ for this
convergence on the space of all lsc functions.
The precise link between Wijsman convergence and slice convergence is described
in the theorem below whose proof is based on the following lemma:
Lemma 3.3**.**
Let X be a normed space, f,g:X→R∪{∞} and
x∗∈X∗. Then, D(graphg,epi(f−x∗))>0 if and
only if D(graph(g+x∗),epif)>0.
**Proof. **It is clearly sufficient to prove that the first condition implies
the second one. So, let ε>0 such that D(graphg,epi(f−x∗))>ε, and then let δ∈(0,ε/(1+∥x∗∥).
Pick (x,α) in epif and (y,β) in epi(g+x∗).
The lemma will be proved by showing that
d((x,α),(y,β))≥δ.
The case ∥y−x∥≥δ being obvious, assume
∥y−x∥<δ<ε. Since
(x,α−⟨x∗,x⟩) is in epi(f−x∗) and
(y,β−⟨x∗,y⟩) is in graphg, our assumption implies
that α−⟨x∗,x⟩>β−⟨x∗,y⟩+ε, hence
α−β>ε+⟨x∗,x−y⟩>ε−δ∥x∗∥>δ.
The proof is complete.
Theorem 3.4**.**
Let X be a normed space and {fn,f}⊂LSC(X).
The sequence (fn)n is slice convergent to f at x with radius λx>0
if and only if
every sequence (fn+x∗)n with x∗∈X∗ is
Wijsman convergent to f+x∗ at x with radius λx.
**Proof. **It suffices to combine
Definition 2,
Proposition 3.2 and Lemma 3.3.
4 Wijsman convergence and uniform infimum
The following analytic characterization of Wijsman convergence of functions
in terms of the lower limit of their infima on balls is an adaptation
of results in [7, 8]:
Theorem 4.1**.**
*Let X be a normed space and {fn,f}⊂LSC(X).
Then, (fn)n is Wijsman convergent to f at x with radius
λx∈(0,+∞]
if and only if for every λ∈[0,λx),
{\rm(W_{a})}\left\{\begin{array}[]{rl}{\rm(i)}&\exists\,(x_{n})_{n}\subset X:\;x_{n}\to x,\;f_{n}(x_{n})\to f(x);\vskip 3.0pt plus 1.0pt minus 1.0pt\\
{\rm(ii)}&\displaystyle r_{B_{\lambda}(x)}(f):=\sup_{\delta>0}\inf_{B_{\lambda+\delta}(x)}f\leq\liminf_{n}\inf_{B_{\lambda}(x)}f_{n}.\end{array}\right.*
**Proof. **It suffices to show that ‘(Wg)(ii) holds
for every λ∈[0,λx)’ is equivalent to
‘(Wa)(ii) holds for every λ∈[0,λx)’.
To prove ‘⇒’, fix λ∈[0,λx),
let α<supδ>0infBλ+δ(x)f,
and take γ>0 and δ∈(0,γ) such that
[TABLE]
We have D(Bλ(x)×α,epif)≥δ>0,
because for
z∈Bλ(x) and (y,β)∈epif with
∥y−z∥<δ, one has ∥y−x∥≤λ+δ, so
β≥f(y)≥α+γ≥α+δ,
whence d((z,α),(y,β))≥β−α≥δ.
Applying (Wg)(ii), we derive that there exists δ>0
such that
D(Bλ+δ(x)×α,epifn)>0 eventually,
so fn(z)>α for every z in Bλ+δ(x)
and large n,
hence
liminfninfBλ+δ(x)fn≥α.
A fortiori, liminfninfBλ(x)fn≥α.
The proof that (Wa)(ii) holds is complete.
To prove ‘⇐’, fix λ∈[0,λx), let α∈R
such that γ:=D(Bλ(x)×α,epif)>0, and
take δ>0 such that
[TABLE]
Let z∈Bλ+δ(x)∩domf.
Since (z,α)∈epif, one has f(z)−α>0.
Therefore,
[TABLE]
so f(z)≥α+ε for every z∈Bλ+δ(x).
Hence, infBλ+δ(x)f>α.
Take δˉ∈(0,δ) such that λˉ:=λ+δˉ<λx.
Then,
[TABLE]
Now, applying (Wa)(ii) with λˉ instead of λ, we find that
infBλˉ(x)fn=infBλ+δˉ(x)fn>α
eventually, hence
epifn∩(Bλ+δˉ(x)×α)=∅
eventually, from which we derive that, for any δ∈(0,δˉ),
D(Bλ+δ(x)×α,epifn)≥δˉ−δ>0
eventually, so that
[TABLE]
as required.
The value rBλ(x)(f):=supδ>0infBλ+δ(x)f
on the left of (Wa)(ii) cannot be replaced by the
usual infimum infBλ(x)f when f is only lsc
(see Example 3 below).
This is not fortuitous.
In problems involving non regular functions f:X→R∪{∞} to be minimized
on a constrained set S, the value that naturally comes to the fore is
[TABLE]
The first explicit mention of (a variant of) this value dates back to
[4].
The value as written in (3) was introduced and used in [1].
Its importance was emphasized in [12], where the concept was generalized
and employed in various situations related to constrained minimization.
In the process, further properties and applications have been developed in
[7, 11].
The notation rS(f) comes from [1], slightly modifying the one in
[4]. The name uniform infimum of f on S for rS(f)
was proposed in [12], arguing that this value
incorporates the behavior of f on uniform neighborhoods of S.
Since then, this concept has been used in the textbooks [3, 15]
and in the survey [10] under different notations and names.
For example, in [15], rS(f) is denoted
∧S(f) (more or less as in [3]) and is called
stabilized infimum; the usual infimum infSf is declared robust when it is equal
to rS(f); a point xˉ achieving this value, i.e. f(xˉ)=rS(f),
is called a robust minimizer (more or less as in [10]).
In general, rS(f)<infSf for arbitrary lsc f:
additional conditions (so-called qualification conditions) are required
to have the equality rS(f)=infSf.
Example 1*.*
A lsc f with rBλ(0)(f)<infBλ(0)f
for arbitrary small λ
(see also [12, Example 2], [11, Exemple 3.7]).
Let X be the Hilbert space ℓ2(N) and let (ei)i∈N
be its canonical basis. Define
[TABLE]
Then f is lsc at every point. For λ=1/n, n∈N,
one has
[TABLE]
So, for every λ>0 there exists λn∈(0,λ)
such that
rBλn(0)(f)<infBλn(0)f.
Example 2*.*
Sufficient conditions for rS(f)=infSf to hold
(see [1, Proposition 3.2]):
-
S=X,
-
f is uniformly continuous on a uniform neighborhood of S,
-
f is lsc on a neighborhood of S
and S is compact, or f is inf-compact and S is closed,
-
X=R+(domf−S), f is convex lsc and S is closed and convex.
Since rS(f) is the natural value bound to the constrained minimization
problem
(P) Minimize f(x) subject to x∈S
it is expected that rS(f) can be obtained as the limiting value of the unconstrained penalized problems associated with (P).
This is indeed the case.
The following proposition was established in [11, Proposition 3.16]
gathering earlier observations
(see also [15, Proposition 1.130]).
For the sake of completeness, we reproduce the proof.
Proposition 4.2**.**
Let X be a normed space, f:X→R∪{∞} bounded from below and
S⊂X such that S∩domf=∅.
Then, for any p>0,
[TABLE]
**Proof. **Let ε>0 and η>0. Choose δ>0 such that
ηδp<ε. Then,
[TABLE]
showing that the first member of (4) is not smaller than
the second one.
Now, let γ<supδ>0infBδ(S)f. Take
δ>0 such that γ<infBδ(S)f and choose η>0
such that
infBδ(S)f≤ηδp+infXf
(this is possible since both infBδ(S)f and infXf
are finite).
We claim that
[TABLE]
This is clear if x belongs to Bδ(S);
otherwise dS(x)≥δ, hence, due to our choice of η,
infBδ(S)f≤infXf+ηδp≤f(x)+ηdSp(x).
It follows that
[TABLE]
showing that the first member of (4) is not greater than
the second one.
The next two propositions provide useful examples of
Wijsman convergent sequences.
Proposition 4.3**.**
Let X be a normed space, f∈LSC(X) and
S⊂X a closed subset such that S∩domf=∅.
Let fn:=f+ndSp with p>0.
The following are equivalent:
(a)* The sequence (fn)n is Wijsman convergent to fS
at every point x∈X,*
(b)* rBλ(x)(fS)≤rS(fBλ(x))
for every x∈X and λ>0 small enough.*
**Proof. **We have to show that the assertions (Wa) in Theorem 4.1
hold if and only if (b) holds.
Assertion (Wa)(i) is always satisfied at
every point x∈X by the constant sequence xn:=x. Indeed,
fn(x)=fS(x) for x∈S and limnfn(x)=+∞
for x∈S since S is closed,
so limnfn(x)=fS(x) for x∈S.
On the other hand,
(Wa)(ii) asserts that for λ>0 small enough,
[TABLE]
Now by lower semicontinuity, fBλ(x) is bounded from below
for λ>0 small enough, so according to Proposition 4.2,
the expression on the right hand side is equal to rS(fBλ(x))
for λ>0 small enough.
Hence, (Wa)(ii) is equivalent to (b).
Proposition 4.4**.**
Let X be a normed space and let f∈LSC(X) be proper and bounded
from below.
Let fn:=f▽n∥.∥.
Then, each fn is Lipschitz continuous on X
and the sequence (fn)n is Wijsman convergent to f with
rBλ(x)(f)=limninfBλ(x)fn for every x∈X and
λ≥0.
**Proof. **We have fn(x)=infy∈X(f(x+y)+n∥y∥).
We first observe that fn(x) is finite for every x∈X and n∈N.
Indeed, f being proper, there is y∈X such that
f(x+y) is finite, so fn(x)<+∞, and f being bounded from below,
−∞<infXf≤fn(x).
Otherwise, for any x,v∈X and n∈N, it holds
[TABLE]
so ∣fn(x)−fn(x+v)∣≤n∥v∥, proving that each fn is n-Lipschitz.
We now prove the second statement. For any λ≥0, one has
[TABLE]
So, taking the limit as n→+∞ on both sides,
we see from Proposition 4.2 that
[TABLE]
For λ=0,
(6) gives limn→∞fn(x)=r{x}f,
where r{x}f=supδ>0infBδ(x)f=f(x)
because f is lsc, so (Wa)(i)
is satisfied at any point x∈X by the constant sequence xn:=x.
On the other hand, (6) clearly implies (Wa)(ii).
This proves that the sequence (fn)n is Wijsman convergent to f.
Example 3*.*
Let f be the lsc function defined in Example 1
and let (fn)n be the sequence given in Proposition 4.4.
This sequence is Wijsman convergent to f with
rBλ(x)(f)=limninfBλ(x)fn for every x∈X and
λ≥0.
Since for every λx>0 there exists λ∈[0,λx)
such that rBλ(x)(f)<infBλ(x)f, we infer that
for every λx>0 there exists λ∈[0,λx)
such that liminfninfBλ(x)fn<infBλ(x)f.
This shows that we cannot replace the value rBλ(x)(f)
by infBλ(x)f in (Wa)(ii).
5 Stability of slopes with respect to Wijsman convergence
From now on, X denotes a Banach space and fn,f:X→R∪{∞} denote
lsc functions.
The slope of f:X→R∪{∞} at x∈domf, introduced in
[5], is defined by
[TABLE]
where α+=max(0,α) for α∈R∪{∞}.
Theorem 5.1**.**
If (fn)n is Wijsman convergent to f at x∈domf, then
there is a sequence (xn)n⊂X such that
xn→x, fn(xn)→f(x), and
[TABLE]
**Proof. **The proof is exactly the same as the one of [8, Theorem 3.1],
where slice convergence was considered instead of Wijsman convergence,
but we reproduce it for the reader’s convenience.
Let σ:=∣∇f∣(x), which we may suppose to be finite.
Let (xn)n⊂X be a sequence verifying (Wa)(i)
and let λx>0 be such that (Wa)(ii) holds for
λ∈[0,λx).
We claim that
for every ε∈(0,λx) there exists Nε∈N such
that for each n≥Nε there exists
xˉn∈X verifying
[TABLE]
Indeed, it follows from the definition of the slope of f at x that
there exists λx′∈(0,ε) such that
for all λ∈(0,λx′),
[TABLE]
hence,
for all λ∈(0,λx′),
[TABLE]
Fix λ∈(0,λx′). Combining the previous inequality with
(Wa)(ii) we get
[TABLE]
while, according to (Wa)(i), for n large enough one has
[TABLE]
[TABLE]
We thus derive that for each n large enough one has
[TABLE]
Then, applying Ekeland’s variational principle, we get a point
xˉn∈X such that
[TABLE]
which implies that ∣∇fn∣(xˉn)≤σ+3ε.
The proof of the claim is therefore complete.
Next, for each ε=1/k<λx, choose an integer Nk and
a sequence (xˉn,k)n in X verifying (7)
for each n≥Nk. Without loss of generality, we may assume
that Nk+1>Nk. The desired sequence is then given by
xˉn:=xˉn,k for n∈N and k such that Nk≤n<Nk+1.
Corollary 5.1.1**.**
Assume ∣∇f∣(xˉ)=0.
If (fn)n is Wijsman convergent to f at xˉ, then
there is a sequence (xn)n such that xn→xˉ, fn(xn)→f(xˉ)
and ∣∇fn∣(xn)→0.
Corollary 5.1.2**.**
Assume infXf>−∞. If (fn)n is Wijsman convergent to f, then
there is a sequence (xn)n such that fn(xn)→infXf
and ∣∇fn∣(xn)→0.
**Proof. **For each positive integer n, let yn∈X such that
f(yn)≤infXf+1/n2. Apply Ekeland’s variational principle
to get zn∈X such that f(zn)≤f(yn)≤infXf+1/n2 and
f(zn)≤f(y)+(1/n)∥y−zn∥ for every y∈X.
This implies that ∣∇f∣(zn)≤1/n. Now, by Theorem 5.1,
we can construct a sequence (xn)n such that for each n,
∣fn(xn)−f(zn)∣≤1/n and ∣∇fn∣(xn)≤∣∇f∣(zn)≤1/n.
This sequence has the required properties.
6 Trustworthiness and stability of subdifferentials
In the sequel, we call subdifferential any operator ∂ that
associates a set ∂f(x)⊂X∗ to any triplet (X,f,x),
where X is Banach space,
f∈LSC(X) and x∈X, in such a way that
the following properties are satisfied:
(A1) If f is convex near x, then
∂f(x)={x∗∈X∗:⟨x∗,y−x⟩+f(x)≤f(y),\leavevmode \leavevmode ∀y∈X};
(A2) If F(x,y)=f(x)+g(y), then
∂F(x,y)⊂∂f(x)×∂g(y);
(A3) For any f and x∗∈X∗, ∂(f+x∗)(x)=∂f(x)+x∗.
There are many other basic properties shared by all interesting
subdifferentials (see [10, Definition 2.1]). But in what follows
we need only the three properties above.
We write
∂f:={(x,x∗)∈X×X∗:x∗∈∂f(x)}
for the graph of ∂f.
As in [10, Definition 2.12], we say that
a subdifferential ∂ is trustworthy on a space X,
or that X is a trustworthy space for ∂,
if the following rule holds:
(R1) Fuzzy minimization rule.
For any f∈LSC(X) and φ convex Lipschitz,
if f+φ admits a finite local minimum at z, then
there are sequences ((xn,xn∗))n⊂∂f and
((yn,yn∗))n⊂∂φ such that
xn→z, yn→z, f(xn)→f(z) and
xn∗+yn∗→0.
Example 4*.*
Main trustworthy spaces
(see [12, 3, 10, 15] and the references therein):
-
X is a Hilbert space, ∂ is the proximal subdifferential;
-
X is an Asplund space, ∂ is
the Fréchet or the limiting Fréchet subdifferential;
-
X is a separable Banach space, ∂ is
the Hadamard subdifferential;
-
X is any Banach space, ∂ is the
subdifferential of Clarke, of Michel-Penot, or of Ioffe.
The rule (R1) for trustworthiness expresses
a subdifferential necessary condition for a point z
to be a local minimizer of the penalized function f+φ
where φ is convex Lipschitz.
In fact, trustworthiness can be characterized by various properties
related to such penalized functions.
For example:
(P1) Necessary condition for an approximate local minimizer.
For any f∈LSC(X), φ convex Lipschitz,
λ>0 and σ>0,
if
(f+φ)(z)<infBλ(z)(f+φ)+λσ,
then
there exist (xˉ,xˉ∗)∈∂f and (yˉ,yˉ∗)∈∂φ
such that
∥xˉ−z∥<λ, ∥yˉ−z∥<λ,
∣f(xˉ)+φ(yˉ)−(f(z)+φ(z)∣<λσ
and ∥xˉ∗+yˉ∗∥<σ.
(P2) Slope control.
For any f∈LSC(X), φ convex Lipschitz and z∈domf,
there are sequences ((xn,xn∗))n⊂∂f and
((yn,yn∗))n⊂∂φ such that
xn→fz, yn→z and
limsupn∥xn∗+yn∗∥≤∣∇(f+φ)∣(z).
(P3) Fréchet subdifferential control.
For any f∈LSC(X), φ convex Lipschitz and
(z,z∗)∈∂F(f+φ),
there are sequences ((xn,xn∗))n⊂∂f and
((yn,yn∗))n⊂∂φ such that
xn→fz, yn→z and xn∗+yn∗→z∗.
We recall that the Fréchet subdifferential of f at xˉ is
given by
[TABLE]
which, as observed in [11, Proposition 4.1],
can be conveniently rewritten as
[TABLE]
Property (P1) was considered for the first time in [7]
(in the special case where φ is a continuous linear form)
and in [14] for the Fréchet subdifferential and φ=0.
The following proposition was established in [11, Théorème 4.2].
We briefly recall the proof for the sake of completeness.
Proposition 6.1**.**
Rule (R1) and Properties (P1)–(P3) are equivalent.
**Proof. **(R1) ⇒ (P1) with φ linear continuous
was already observed in [7, Theorem 3.2].
Let f∈LSC(X), φ convex Lipschitz,
λ>0 and σ>0 such that
(f+φ)(z)<infBλ(z)(f+φ)+λσ.
Apply Ekeland’s variational principle to g:=f+φ+δBλ(z) with 0<σ′<σ such that
g(z)<infXg+λσ′ and with λ′ such that
0<λ′<λ.
We obtain a point zˉ∈Bλ′(z), with
∣(f+φ)(zˉ)−(f+φ)(z)∣≤λσ′, that
is a local minimizer of the function
f+φ+σ′∥.−zˉ∥.
Now we apply (R1) to f and
ψ:=φ+σ′∥.−zˉ∥ at point zˉ
to get (xˉ,xˉ∗)∈∂f and (yˉ,yˉ∗)∈∂ψ
such that ∥xˉ−zˉ∥<λ−λ′,
∣f(xˉ)−f(zˉ)∣<λ(σ−σ′)/2,
φ(yˉ)−φ(z)∣<λ(σ−σ′)/2 and
∥xˉ∗+yˉ∗∥<σ−σ′.
Combining the above inequalities, we infer that
∥xˉ−z∥<λ and ∣f(xˉ)+φ(yˉ)−f(z)−φ(z)∣<λσ.
On the other hand, as yˉ∗∈∂ψ(yˉ),
using (A1) and standard calculus rules of convex analysis,
we derive that yˉ∗=yˉ0∗+σ′ξ∗
where yˉ0∗∈∂φ(yˉ) and ∥ξ∗∥≤1, so
[TABLE]
Thus, (xˉ,xˉ∗)∈∂f and (yˉ,yˉ0∗)∈φ
satisfy the required inequalities of (P1).
(P1) ⇒ (P2). Let ∣∇(f+φ)∣(z)<σ.
We have to show that for any ε>0, there exist
(x,x∗)∈∂f and (y,y∗)∈∂φ such that
∥x−z∥<ε, ∥y−z∥<ε, ∣f(x)−f(z)∣<ε
and ∥x∗+y∗∥<σ.
Fix σ′ such that ∣∇(f+φ)∣(z)<σ′<σ.
From the definition of the strong slope, we derive that there is
λ′>0 such that (f+φ)(x)−(f+φ)(y)<σ′∥x−y∥
for every y∈Bλ′(x), which implies that
for all λ∈]0,λ′], one has
(f+φ)(x)<(f+φ)(y)+σ′λ for every y∈Bλ(x).
Hence, for every λ∈]0,λ′], it holds
[TABLE]
Let ε>0. Apply (P1) with λ=min{λ′,ε,ε/σ}. We obtain
(x,x∗)∈∂f and (y,y∗)∈∂φ such that
∥x−z∥<λ≤ε, ∥y−z∥<λ≤ε,
∣f(x)+φ(y)−f(z)−φ(z)∣<λσ≤ε
and ∥x∗+y∗∥<σ.
Since φ is continuous, we can manage so that the penultimate
inequality induces ∣f(x)−f(z)∣<ε. The proof is complete.
(P2) ⇒ (P3). Let z∗∈∂F(f+φ)(z). By (9),
this amounts to ∣∇(f+φ−z∗)∣(z)=0.
Applying (P2) we get sequences ((xn,xn∗))n⊂∂(f−z∗) and ((yn,yn∗))n⊂∂φ
with
xn→z, yn→z, (f−z∗)(xn)→(f−z∗)(z) and xn∗+yn∗→0.
From (A3), we derive that xˉn∗:=xn∗+z∗∈∂f(xn).
Then, the sequences ((xn,xˉn∗))n and ((yn,yn∗))n
satisfy the required properties.
(P3) ⇒ (R1) is obvious.
The following theorem asserts that Property (P2) is stable with respect
to Wijsman perturbations, the next one that Property (P3) is stable with
respect to slice perturbations.
Theorem 6.2**.**
Assume (P2) holds on the space X. Let (fn)n be a sequence of lsc functions
and (φn)n a sequence of convex Lipschitz functions such that
(fn+φn)n is Wijsman convergent to a function f at zˉ.
Then, there are elements (xn,xn∗)∈∂fn and
(yn,yn∗)∈∂φn
such that xn→zˉ, yn→zˉ,
fn(xn)+φn(yn)→f(zˉ)
and limsupn∥xn∗+yn∗∥≤∣∇f∣(zˉ).
**Proof. **By Theorem 5.1, there is a sequence (zn)n such that
zn→zˉ, (fn+φn)(zn)→f(zˉ) and
limsupn∣∇(fn+φn)∣(zn)≤∣∇f∣(zˉ).
By (P2) applied to fn, φn and zn,
there are sequences (xn)n and (yn)n such that,
for every n∈N, ∥xn−zn∥≤1/n, ∥yn−zn∥≤1/n
∣fn(xn)−fn(zn)∣≤1/n and
[TABLE]
So, for every n∈N, there are elements xn∗∈∂fn(xn)
and yn∗∈∂φn(yn) such that
[TABLE]
Since zn→zˉ, fn(zn)→f(zˉ) and
limsupn∣∇(fn+φn)∣(zn)≤∣∇f∣(zˉ),
the sequences ((xn,xn∗))n and ((yn,yn∗))n
satisfy the required properties.
Theorem 6.3**.**
Assume (P2) holds on the space X.
Let (fn)n be a sequence of lsc functions
and (φn)n a sequence of convex Lipschitz functions such that
(fn+φn)n is slice convergent to a function f. Then,
for each (zˉ,zˉ∗)∈∂F,
there are elements (xn,xn∗)∈∂fn and
(yn,yn∗)∈∂φn
such that xn→z, yn→z,
fn(xn)+φn(yn)→f(z) and xn∗+yn∗→z∗.
**Proof. **Let (zˉ,zˉ∗)∈∂F. So ∣∇(f−zˉ∗)∣(z)=0.
By Theorem 3.4, the sequence ((fn−zˉ∗+φn)n is
Wijsman convergent to f−zˉ∗.
Applying Theorem 6.2 and (A3), we find
sequences ((xn,xn∗))n and ((yn,yn∗))n such that
xn→zˉ, yn→zˉ,
fn(xn)+φn(yn)→f(zˉ)
and ∥xn∗−zˉ∗+yn∗∥→0. The conclusion follows.
Variants of Theorem 6.2 and Theorem 6.3
are considered in [7, Theorem 4.1] and [8, Theorem 5.1]
and several applications are given.
7 Subdifferential Sum Rules
A family of lsc functions {f1,…,fk} is said to be
decouplable at xˉ∈X ([11, Définition 3.5])
provided there is λx>0 such that for any λ∈[0,λx),
[TABLE]
It is said to be X∗-decouplable at xˉ if
{f1,…,fk,x∗} is decouplable at xˉ for every x∗∈X∗.
Example 5*.*
Sufficient conditions for a family {f1,…,fk} to be
decouplable at xˉ:
-
All but at most one of the functions are uniformly continuous near xˉ
[12].
-
At least one of the functions has compact lower level sets near xˉ
[12].
-
The function ∑fi achieves a local uniform (decoupled, robust)
minimum at xˉ [12, 3, 10].
-
k=2 and the inf-convolution
fBλ(xˉ)▽gBλ(xˉ)−
(with f=f1, g=f2) is lsc at [math] [11].
Let F:(x1,…,xk)∈Xk↦∑fi(xi)
be the decoupled sum,
Bλk(xˉ):=Bλ(xˉ)×⋯×Bλ(xˉ)
be the λ-ball of center (xˉ,…,xˉ) in Xk with the max-morm,
and let Δ:={(x,…,x)∈Xk:x∈X} be the diagonal of Xk.
The two expressions in the decoupling’s condition (10) can be written as
δ>0supBλ+δ(xˉ)inf∑fi=rBλ(xˉ)(∑fi)=rBλk(xˉ)(FΔ),
[TABLE]
So the decoupling’s condition (10) amounts to:
[TABLE]
Proposition 7.1**.**
The family {f1,…,fk} is decouplable at xˉ∈X if and only if the
sequence Fn:=F+ndΔ is Wijsman convergent to
FΔ at (xˉ,…,xˉ).
**Proof. **According to the above, the family
{f1,…,fk} is decouplable at xˉ∈X if and only if
(10b) holds for any λ>0 small enough,
and according to Proposition 4.3, this latter condition
means that the sequence Fn:=F+ndΔ is Wijsman convergent to
FΔ at (xˉ,…,xˉ).
We consider generalizations of (P2) and (P3) to
decouplable families of functions:
(R2) Slope control.
Let {f1,…,fk}⊂LSC(X) be decouplable at
xˉ∈X.
If ∣∇(∑fi)∣(xˉ)<∞,
then there are sequences ((xi,n,xi,n∗))n⊂∂fi,
i=1,…,k, such that
xi,n→fixˉ,
limsupn∥∑xi,n∗∥≤∣∇(∑fi)∣(xˉ)
and diam(x1,n,…,xk,n)∥xi,n∗∥→0.
(R3) Fréchet subdifferential control.
Let {f1,…,fk}⊂LSC(X) be X∗-decouplable at
xˉ∈X.
For any xˉ∗∈∂F(∑fi)(xˉ),
there are sequences ((xi,n,xi,n∗))n⊂∂fi,
i=1,…,k, such that
xi,n→fixˉ, ∑xi,n∗→xˉ∗
and diam(x1,n,…,xk,n)∥xi,n∗∥→0.
Theorem 7.2**.**
Let X be a class of Banach spaces which contains Cartesian
products of its elements.
If (R1) holds on every space in X,
then so do (R2) and (R3).
**Proof. **Let X be a space in the class X. We show with some details
that (R2) holds on X.
By Proposition 7.1, the sequence of functions F+ndΔ
defined on Xk is Wijsman convergent to the function
FΔ at (xˉ,…,xˉ).
Since (R1) holds on Xk, we may apply Theorem 6.2
with fn:=F, φn:=ndΔ, f:=FΔ and zˉ:=(xˉ,…,xˉ).
This produces elements (x^n,x^n∗)∈∂F
and (y^n,y^n∗)∈∂(ndΔ)
such that
(a) x^n→(xˉ,…,xˉ), y^n→(xˉ,…,xˉ),
(b) F(x^n)+ndΔ(y^n)→FΔ(xˉ,…,xˉ)=∑fi(xˉ),
(c) limsupn∥x^n∗+y^n∗∥≤∣∇FΔ∣(xˉ,…,xˉ)=∣∇(∑fi)∣(xˉ).
The point x^n can be written as
x^n=(x1,n,…,xk,n). Since by (A2),
[TABLE]
we have x^n∗=(x1,n∗,…,xk,n∗) with
xi,n∗∈∂fi(xi,n) for every i=1,…,k.
We show that the sequences ((xi,n,xi,n∗))n⊂∂fi
satisfy all the requirements.
From (a), we see that xi,n→xˉ for each i. Fix ε>0 and
j∈{1,…,k}.
By lower semicontinuity of the functions fi, for n
sufficiently large it holds
[TABLE]
and by (b) above,
[TABLE]
Combining (11) and (12), we get that, for n
sufficiently large,
[TABLE]
hence, fj(xj,n)≤fj(xˉ)+2ε eventually.
This shows that, for every j, fj(xj,n)→fj(xˉ).
Finally, we have proved that xi,n→fixˉ for every i.
We now show that limsupn∥∑xi,n∗∥≤∣∇(∑fi)∣(xˉ).
Since y^n∗∈∂(ndΔ)(y^n),
we have y^n∗∈Δ⊥ and ∥y^n∗∥≤n.
On the other hand, ∥x^n∗∣Δ∥=∥∑xi,n∗∥ and
(c) implies
[TABLE]
So,
limsupn∥∑xi,n∗∥≤∣∇(∑fi)∣(xˉ).
It remains to show that diam(x1,n,…,xk,n)∥xi,n∗∥→0.
Let ε>0 be fixed. Since for each i=1,…,n, fi(xi,n)→fi(xˉ), we have
∣F(x^n)−FΔ(xˉ,…,xˉ)∣≤ε eventually,
so by (b) dΔ(y^n)≤ε/n eventually, and also
dΔ(x^n)≤ε/n eventually since (y^n)n
and (x^n)n converge to the same point.
Let γ=∣∇(∑fi)∣(xˉ).
It follows from (c) that ∥x^n∗+y^n∗∥≤γ+ε
eventually, so ∥x^n∗∥≤γ+ε+n eventually.
Combining all of this, for n sufficiently large it holds
[TABLE]
The conclusion follows directly from this last inequality.
This completes the proof of (R2).
Proceeding as in Theorem 6.3, it is easy to show that
(R3) follows from (R2); we omit the details.
Rules (R2) and (R3) were considered and proved to be equivalent to (R1)
in [11, Théorème 5.1]. The above approach through Wijsman stability
of subdifferentials is new.
More equivalent properties can be found in
[17, 9, 12]. See [10] for historical comments.