On the uniqueness of minimizers for a class of variational problems with polyconvex integrand.
Romeo Awi
Department of Mathematics, Hampton University, Hampton, Virginia 23668
[email protected]
and
Marc Sedjro
African Institute for Mathematical Sciences(AIMS), Tanzania,
Plot 288 No 288, Makwahiya Street, Regent Estate, P.O. Box 106077, Dar Es Salaam, Tanzania.
[email protected]
Abstract.
We prove existence and uniqueness of minimizers for a family of energy
functionals that arises in Elasticity and involves polyconvex
integrands over a certain subset of displacement maps. This work
extends previous results by Awi and Gangbo to a larger class of
integrands. We are interested in Lagrangians of the form L(A,u)=f(A)+H(detA)−F⋅u. Here the strict convexity condition
on f and H have been relaxed merely to a convexity condition.
Meanwhile, we have allowed the map F to be non-degenerate.
First, we study these variational problems over displacements for which
the determinant is positive. Second, we consider a limit case in which
the functionals are degenerate. In that case, the set of admissible
displacements reduces to that of incompressible displacements which are
measure preserving maps. Finally, we establish that the minimizer over
the set of incompressible maps may be obtained as a limit of minimizers
corresponding to a sequence of minimization problems over general
displacements provided we have enough regularity on the dual problems.
We point out that these results do not rely on the direct methods of the calculus
of variations.
Key words and phrases:
Duality, Euler-Lagrange Equations, Elasticity Theory, Pseudo–Projected Gradient, Relaxations, Polyconvexity.
2000 Mathematics Subject Classification:
Primary 35B27; 39J40
Most of the work presented in this paper was carried out while R.A. was a postdoctoral fellow at the Institute for Mathematics and its Applications during the IMA’s annual program on Control Theory and its Applications.
M.S. gratefully acknowledges the support of the King Abdullah University of Science and Technology.
1. Introduction
We are interested in Euler-Lagrange equations, existence and uniqueness of minimizers for some problems in the vectorial calculus of variations emanating from elasticity theory. These variational problems are related to an open problem in Partial Differential Equations that we describe as follows : let T>0 and let Ω and Λ be two open subsets of Rd; suppose that u0 is a diffeomorphism between Ω and Λ; we seek u:Ω×(0,T)⟶Rd such that u(⋅,t)(Ω)=Λ for each t and
[TABLE]
in the sense of distributions. In (1.1), we assume that the map Rd×d∋ξ↦L(ξ) is quasiconvex. We refer the reader to [2], [5], [6], [10], and [12] for further details on these gradient flows.
Understanding variational problems associated to the time-discretization of (1.1) is arguably an important step toward the construction of a solution. In that regard, several partial results are available in the literature (See for instance
[5] and [6]).
In [2], the authors have focused on a class of Lagrangians that arises in elastic materials. More precisely, they have considered polyconvex Lagrangians of the form ξ↦L(ξ)=f(ξ)+H(detξ). Here f is a C1(Rd) strictly convex function with p-th order growth, and the map H is a C1(0,∞) convex function that satisfies
[TABLE]
As a result, a variational problem emerges from the time discretization and has a relaxation that takes the general form :
[TABLE]
where F∈L1(Ω,Rd) and
[TABLE]
Although the existence of minimizers in (1.3) follows from the direct methods in the calculus of variations, the uniqueness is a rather challenging problem. Indeed, because of (1.2) and the non-convexity of the integrand, standard techniques in calculus of variations do not apply.
To bypass these difficulties, the authors of [2] have introduced a pseudo-projected gradient operator US∋u↦∇Su defined as follows : for a given u∈US, the map ∇Su is the unique minimizer of
[TABLE]
over
[TABLE]
Here, S is a finite-dimensional subspace of W01,q(Ω,Rd×d), q is the conjugate of p, US is the set of all u:Ω→Λˉ measurable such that there exists a c=c(u,Ω,Λ)>0 satisfying :
[TABLE]
We point out that the pseudo-projected gradient operator depends also on f, though the dependence is not exhibited in its notation.
As a first step to approaching (1.3), they have considered the following perturbed problem:
[TABLE]
The choice of problem (1.6) is justified by the construction of a family of finite dimensional subspaces {Sn}n dense in W01,q(Ω,Rd×d) such that for u∈W1,p(Ω,Rd), one has
[TABLE]
We note that a Lp(Ω,Rd)−bounded subset of US whose image by the operator ∇S is bounded in Lp(Ω,Rd×d) is not in general strongly pre-compact with respect to the Lp(Ω,Rd) topology. As a result, compactness of level subsets of the functional in (1.6) can not be guaranteed. Nevertheless,
the authors of [2] have successfully shown existence and, more importantly, uniqueness in (1.6) under the assumption that
F is non-degenerate (see definition below). This condition of non-degeneracy for uniqueness is crucial in a similar problem, the so-called Brenier polar factorization, and more generally, in optimal transport problems.
Confer [1], [3], [11], [8], [9] and
[14].
In this paper,
we investigate the respective roles played by the strict convexity of f, the convexity and smoothness of H, and the non-degeneracy of F in problem (1.6). More precisely, we impose less stringent conditions so that either the map F is allowed to be degenerate or f is allowed to be merely convex or H is neither smooth nor strictly-convex.
These considerations are not just technicalities. Indeed we note that a prominent case of mere convexity, f(ξ)=∣ξ∣, is typical for the study of minimal surfaces as well as for the study of functionals involving the total variation
(see for instance [4])
Furthermore, we observe that cases where H is taken to be the characteristic function of a singleton of R arise in the study of incompressible deformations in Elasticity theory
(see for instance [12] and [14]).
Finally, the non degeneracy condition tests the extent to which one can hope for uniqueness in the variational problem we considered.
To deal with these weaker assumptions, we introduce a family of operators {VSf:S⊂W01,q(Ω,Rd),fconvex} defined by
[TABLE]
We note that the operator VSf is actually well defined on the set of measurable functions u defined from Ω to Λˉ when the set S is a finite dimensional nonempty set and
the function f satisfies appropriate growth conditions.
As a family, these operators extend the pseudo- projected gradient operators and the distributional gradient. Indeed, VSf[u]=∫Ωf(∇Su) if S is a finite dimensional subspace of W01,q(Ω,Rd×d) and u∈US and furthermore VSf[u]=∫Ωf(∇u) if S=W01,q(Ω,Rd×d) and u∈W1,p(Ω,Rd). These extensions are only valid under appropriate conditions on
f. It is worth pointing out that if f(ξ)=∣ξ∣ and S=W01,q(Ω,Rd×d) then VSf(u) is nothing
but the total variation of u on the set Ω. We show that for a collection of sets {Sn}n=1∞ of W01,q(Ω,Rd) satisfying Hypothesis (H1) or Hypothesis (H2) (see section 2), we have a convergence result in the same spirit as (1.7):
[TABLE]
for any u∈W1,p(Ω,Rd×d) and appropriate conditions on f. We thus proceed to study a more general problem :
[TABLE]
where S is an element of a collection of sets satisfying Hypothesis (H1) or Hypothesis (H2), and
[TABLE]
Sublevel sets of the integrand in (1.10) are not compact. Nor is f necessarily strictly convex. However, we show existence and uniqueness in Problem
(1.10). In fact, this result holds for F non-degenerate as well as for a class of degenerate F
provided that the set S is chosen
accordingly ( see Corollaries 3.6 and 3.7).
Unlike
optimal transport theory,
this analysis suggests that the non-degeneracy condition is not essential for a uniqueness result in (1.3).
Existence and uniqueness results for Problem (1.10) are established thanks to the discovery
of suitable dual problems. Indeed, call C the set of all functions (k,l)
with
k,l:Rd→R∪{∞} Borel measurable, finite at least at one point, and satisfying the relation l≡∞ on Rd∖Λˉ and such that
[TABLE]
Let A be the set of (k,l,φ) such that (k,l)∈C
and φ∈S.
Define the following functional over the set A:
[TABLE]
Next, assume that the map F and the set S are such that for all φ∈S,
[TABLE]
Then −J admits a maximizer (k0,l0,φ0) with k0 convex and
diam(Λ)-Lipschitz. As a consequence,
Problem (1.10) admits a
unique minimizer (u0,β0) and u0 satisfies
[TABLE]
Here, we have denoted by ΦS(u0), the non-empty set of maximizers of problem (1.8) (see Proposition 2.8).
In order to obtain condition (1.12), we consider two distinct situations.
First, we assume that F has a countable range, thus degenerate. If S is an element of a collection of sets satisfying hypothesis (H2) then it holds that F+divφ is non degenerate.
Second, we assume F non-degenerate and
S is a finite dimensional vector space, as in [2]. It holds again that F+divφ is non degenerate.
However, unlike the hypotheses in [2], we have allowed the map f to be as singular
as the map Rd×d∋ξ↦∣ξ∣.
We have also studied (1.10)
when H is replaced by
H0:(0,∞)→R∪{∞} defined by H0(1)=0 and H0(t)=∞ if t=1.
This case corresponds to the case of measure preserving maps.
Note that H0 is not even continuous. However, it may be obtained as a limit of functions Hn which are C1(0,∞) convex functions and satisfy (1.2).
We show that for such singular H0, the corresponding problem
[TABLE]
with
[TABLE]
admits a unique minimizer. (See Theorem 4.3).
To obtain existence and uniqueness results in
problem (1.14), we exploit a dual formulation
and maximize −J over the set that consists of
(k,l,φ) such that
φ∈S and k,l:Rd→R∪{∞} are Borel measurable, finite at least at one point, and satisfy the relations l≡∞ on Rd∖Λˉ and
[TABLE]
One shows that −J
admits a maximizer (k0,l0,φ0) with k0 convex and Lipschitz and the unique minimizer of
problem (1.14) is u0 given by
[TABLE]
Finally, we show convergence of a sequence of problems of the form (1.10) to (1.14).
More precisely, we show
that the minimizer of problem (1.14) may be obtained as
limit of minimizers of problems of the form
(1.10) provided that the dual problems admit regular enough maximizers.
In fact, suppose the map F and the set S are such that for all φ∈S, the map F+divφ is non-degenerate.
For (u,β)∈US, define
[TABLE]
and set
[TABLE]
Thanks to Theorem 3.5, the problem
[TABLE]
admits a unique minimizer that we denote
(un,βn) with un=∇kn(F+divφn) for some kn:Rd→R
convex and φn∈S.
Denote u0 the unique minimizer of (1.14).
If for all n∈N∗ the map kn is differentiable then
the sequence {un}n∈N∗
converges almost everywhere to u0 and in addition, the minima {In(un,βn)}n∈N∗
converge to I0(u0) (Cf. Theorem 4.7).
2. Preliminaries
2.1. Notation and definitions.
Throughout this manuscript, Ω and Λ⊂Rd are two bounded open convex sets;
r∗>1 is such
that B(0,1/r∗)⊂Λ⊂B(0,r∗/2); p∈(1,∞) and q is its conjugate, that is,
p−1+q−1=1.
Given A⊂Rd, the indicator function of A is defined as
[TABLE]
For any subset S of W01,q(Ω,Rd×d), we denote by span(S) the linear subspace of
W01,q(Ω,Rd×d) generated by S.
We denote by f∗ the Legendre transform of the map f:Rd×d⟶R so that
[TABLE]
If h:Rd⟶R∪{∞} is convex then the subdifferential ∂h(x) of h at x∈Dom(h) is closed and convex. If ∂h(x) is non-empty
we denote by grad[h](x) the element of ∂h(x) with minimum norm :
[TABLE]
Let S⊂W01,q(Ω,Rd×d). We
denote by Sf the set
[TABLE]
Let F:Rd⟶Rd be measurable. We say that F is non-degenerate if for any N⊂Rd such that Ld(N)=0 we have Ld(F−1(N))=0.
2.2. Assumptions.
We additionally assume that
there exists a strictly convex function that is C1(Ωˉ) and vanishes on the boundary of Ω.
The set
S is a subset of W01,q(Ω,Rd×d). In addition, the map f:Rd×d→R is convex and satisfies the following three properties:
There exist a,b,c>0 such that for all ξ∈Rd×d,
[TABLE]
and
for all ξ∗∈∂f(ξ),
[TABLE]
The set Sf is non empty.
One of the following two conditions holds:
- (a)
The map f is such that ∂f∗(x∗) is non-empty and grad[f∗](x∗)=0
for each x∗∈Domf∗.
2. (b)
The map f is
strictly convex and there exist aˉ,bˉ>0 such that for all ξ∗∈Rd×d,
one has
[TABLE]
The map H is C1(0,∞), strictly convex, and such that
[TABLE]
The function F is measurable and belongs to L1(Ω).
Let S be a subset of W01,q(Ω,Rd×d). We say that F satisfies the condition (ND)S if
[TABLE]
for all φ∈S.
Remark 2.1**.**
As f satisfies (2.2), we have
[TABLE]
for all ξ∗∈Rd×d.
If f satisfies case (b) in (iii) of Assumption (A1),
then f∗ is continuously differentiable. In that case, grad[f∗]=∇f∗.
If f satisfies case (a) of Assumption (A1)(iii) then 0∈∂f∗(x∗) for every element x∗∈Dom(f∗). Consequently, the map f∗ is constant on Dom(f∗) and the following equalities are satisfied for all x∗ and y∗ in Dom(f∗):
[TABLE]
The assumption (A0) is satisfied by Ω=B(0,1)⊂Rd with the strictly convex function being the map Rd∋x↦∣x∣2−1.
The map f:Rd×d→R
defined by f(ξ)=∣ξ∣
satisfies case (a) in (iii) of Assumption (A1).
The map f:Rd×d→R
defined by f(ξ)=∣ξ∣p
satisfies case (b) in (iii) of Assumption (A1).
The following Lemma summarizes some elementary properties of H. We refer the reader to Remark 2.1 in [2].
Lemma 2.2**.**
Assume
(A2)
holds. Then,
- (i)
The map H′:(0,∞)→R is a strictly increasing bijection.
2. (ii)
The Legendre transform H∗ of H is a strictly increasing bijection from R to R.
3. (iii)
Let g:R→Rˉ
be defined by g(s)=αs−βH∗(s), with α,β>0.
Then
[TABLE]
Define H0 by
[TABLE]
and, for n≥1,
[TABLE]
The following Lemma is straightforward.
Lemma 2.3**.**
Assume
(A2)
holds. Then,
There exists Hˉ∈R such that
[TABLE]
The collection {Hn}n=1∞ is a non decreasing sequence of functions that converges pointwise to H0. In addition, for all n∈N∗, the map Hn is a C1(0,∞) strictly convex function that satisfies
[TABLE]
Let t>0. If {Hn(t)}n=1∞ is uniformly bounded above by a constant c0 then
[TABLE]
and t=1.
2.3. **Hypothesis on the underlying sets of pseudo-gradients. **
We recall that in [2], the construction of ∇Sτu has relied on hypothesis on
the underlying sets Sτ that we summarize in Hypothesis (H1) below.
Hypothesis (H1).
A collection
{An}n=1∞ of subsets of W01,q(Ω,Rd×d) satisfies Hypothesis (H1) if
An of a finite dimensional subspace of W01,q(Ω,Rd×d) for each n∈N∗.
The map ∇φ has a countable range whenever
φ∈An, for any n∈N∗.
The set ∪n∈N∗An is dense in
W01,q(Ω,Rd×d).
For i≤j, we have the inclusion
Ai⊂Aj.
An explicit construction of sets satisfying Hypothesis (H1) is provided in [2]. Here, we build on the conditions of Hypothesis (H1) and we relax conditions on the underlying sets:
Hypothesis (H2).
A collection
{Qn}n=1∞ of subsets of W01,q(Ω,Rd×d) satisfies Hypothesis (H2) if
Span(Qn) is of finite dimension and Qn is a non-empty closed and convex subset of W01,q(Ω,Rd×d).
The map divφ is non-degenerate whenever
φ∈Qn, for any n∈N∗.
The set ∪n∈N∗Qn is dense in
W01,q(Ω,Rd×d).
For i≤j, the inclusion
Qi⊂Qj holds.
The next lemma asserts that a collection of sets can be constructed to satisfy Hypothesis (H2).
Lemma 2.4**.**
*Assume (A0) holds. Then, there exists a collection of sets
{Qn}n=1∞ satisfying the requirements of Hypothesis (H2).*
Remark 2.5**.**
The condition (A0) in Lemma 2.4 is only needed for requirement (ii) of Hypothesis (H2).
Proof.
Suppose that
ψ is a strictly convex function that is C1(Ωˉ) and vanishes on the boundary of Ω as given by Assumption (A0).
Let φ0:Ω→Rd×d be defined by
[TABLE]
As ψ is C1(Ωˉ), we have φ0∈W01,q(Ω,Rd×d)
and it follows that divφ0=∇ψ. Thus, for almost every x in Ω, we have
[TABLE]
Thanks to Lemma 5.5.3 in [1], the map
divφ0 is non-degenerate.
Let {An}n=1∞ be a collection of sets satisfying Hypothesis (H1).
One readily checks that
the family of sets defined by
[TABLE]
for n∈N∗, satisfies hypothesis (H2).
□
2.4. Special displacements.
To S⊂W01,q(Ω,Rd×d) we associate US, the set of all
u:Ω→Λˉ measurable such that there exists cˉ=cˉ(u,Ω,Λ)>0 satisfying :
[TABLE]
Remark that if u∈US, then u belongs to L∞(Ω,Rd) since u has values in Λˉ which is bounded.
If span(S) is of finite dimension then US is the set of all measurable maps u:Ω→Λˉ.
In fact, the linear map span(S)∋φ↦∫Ωudivφ is continuous with respect to the Lq- norm as in finite dimension, all norms are equivalent. Therefore, we may find c
for which Equation (2.9) holds for all
φ∈span(S) and in particular
for all
φ∈S.
At any rate, US contains W1,p(Ω,Rd). Indeed, notice that for a fixed
u∈W1,p(Ω,Rd), we have, for all
φ∈S:
[TABLE]
We introduce the following set
[TABLE]
and
[TABLE]
Notice that US1={u∈US:(u,1)∈US∗}. This corresponds to measure preserving displacements.
2.5. Extended pseudo-projected gradient
Let S⊂W01,q(Ω,Rd×d) and u∈US. Define
[TABLE]
Consider the operator
[TABLE]
We denote by ΦS(u) the set of maximizers of Problem (2.10).
Lemma 2.6**.**
Let S⊂W01,q(Ω,Rd×d) and u∈US.
- (1)
We have
[TABLE]
2. (2)
If span(S)
is finite dimensional, then
GS(u) is
nonempty.
Proof. Set
[TABLE]
As S⊂span(S),
we have
GˉS(u)⊂GS(u).
Next, let G∈GS(u). Assume that
φ∈span(S).
We may find n∈N, λ1,…,λn∈R
and φ1,…,φn∈S
such that
φ=i=1∑nλiφi.
Then
[TABLE]
and
[TABLE]
Thus G∈GˉS(u). We deduce that GS(u)⊂GˉS(u).
It follows that part 1.) holds. To obtain part 2.), we use part 1.) and the Riesz Representation Theorem.
□
The following results are essentially found in Proposition 3.1 in [2].
Proposition 2.7**.**
*Suppose that the set S is a finite dimensional subspace of
W01,q(Ω,Rd×d) and f is C1
and strictly convex. Suppose, in addition that there exist constants c1,c2,c3>0 such that*
[TABLE]
for all ξ∈Rd×d. Then, there exists a unique map denoted ∇Su that minimizes
[TABLE]
Moreover, ∇Su uniquely satisfies
G∈GS(u) and Df(G)∈S.
In the next Proposition, we establish similar results as in Proposition 2.7 but under weaker assumptions on S and f (except in part 4).
Proposition 2.8**.**
Assume (A1) holds. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d) and let u∈US.
- (1)
For all G∈GS(u), φ∈S, we have
[TABLE]
2. (2)
The supremum in problem
(2.10)
is attained.
3. (3)
A map φˉ belongs to ΦS(u) if and only if φˉ belongs to Sf
and
[TABLE]
for all φ∈Sf.
4. (4)
Suppose that the hypotheses of Proposition 2.7 are satisfied.
Then we have
[TABLE]
and ΦS(u)={Df(∇Su)}.
Proof.
1.) Let φ∈S and G∈GS(u), By using the Legendre transformation,
[TABLE]
2.) Let φ∈S. We use (2.9) and (2.5) to get
[TABLE]
In light of (2.11), q>1 implies that
the map
[TABLE]
is Lq− coercive.
Moreover, the convexity of f∗ guarantees that T is lower semi-continuous.
The direct methods of the calculus of variations thus yield the existence of a
maximizer in problem (2.10).
3.)
Let φˉ∈ΦS(u) so that φˉ∈Sf. Let φ∈Sf and ϵ∈(0,1). The convexity of f∗ ensures that φˉ+ϵ(φ−φˉ)∈Sf and the maximality property of φˉ implies that
[TABLE]
We rewrite (2.12), in turn, as
[TABLE]
Note that grad[f∗](φˉ+ϵ(φ−φˉ)) belongs to the set
∂f∗((φˉ+ϵ(φ−φˉ))) whenever (φˉ+ϵ(φ−φˉ)) is in the domain of f∗. It follows that
[TABLE]
that is,
[TABLE]
We combine (2.13) and (2.14) to get
[TABLE]
First, we assume that (A1)(iii)(a) holds. In light of (2.6), we have grad[f∗](φˉ+ϵ(φ−φˉ)=grad[f∗](φˉ). Equation
(2.15)
becomes
[TABLE]
Second, we assume that (A1)(iii)(b) holds.
In light of Remark 2.1 (ii),
we use the growth condition on ∇f∗ in (2.4), the Lebesgue dominated convergence theorem and let ϵ go to 0 in (2.15) to obtain that:
[TABLE]
We next show the converse implication. Let φ∈Sf such that
[TABLE]
for all φ∈Sf. We notice that, as f∗ is convex, the range
of the map grad[f∗](φˉ) lies in the sub-differential of f∗ so that f∗(φ)−f∗(φˉ)≥grad[f∗](φˉ)(φ−φˉ) for all φ∈Sf. Then, the inequality (2.16) implies that
[TABLE]
for all φ∈Sf, that is,
[TABLE]
for all φ∈Sf. We conclude that φˉ∈ΦS(u).
4.) Thanks to Proposition 2.7, Df(∇Su)∈S. Next, we set φ0:=Df(∇Su). By definition of f∗,
[TABLE]
for all φ∈S. As f is convex and φ0=Df(∇Su),
we have
[TABLE]
Thus,
[TABLE]
and
[TABLE]
We deduce that φ0∈ΦS(u).
Since f∗ is strictly convex, we conclude that ΦS(u)={Df(∇Su)}
and moreover, ∫Ωf(∇Su)=VSf(u).
□
In the next Proposition, we establish a convergence result in the spirit of (1.7). We also connect the operator VSf with the usual notions of gradient and total variation.
Proposition 2.9**.**
Assume (A1) holds. Assume that Sn is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d) for each n≥1. The following holds.
- (1)
If {Sn}n=1∞ is a monotonically increasing family of subsets of some set S0 and ∪n∈N∗Sn is dense in S0 with respect to the W01,q(Ω,Rd×d) norm then
[TABLE]
for any
u∈US0.
2. (2)
If S=W01,q(Ω,Rd×d) and u∈W1,p(Ω,Rd) then VSf[u]=∫Ωf(∇u)dx.
3. (3)
Assume u∈BV(Ω,Rd×d) and f(ξ)=∣ξ∣ for all ξ∈Rd×d. If
S=W01,q(Ω,Rd×d)*
then
VSf[u] is the total variation of u.*
Remark 2.10**.**
A consequence of Proposition 2.9 is the following : If the sequence of sets {Sn}n∈N∗ is monotonically increasing to W01,q(Ω,Rd×d) and u∈W1,p(Ω,Rd) we have
[TABLE]
Proof.
1.) Recall that
[TABLE]
As {Sn}n=1∞ is a monotonically increasing, n→∞limVSnf[u] exists. Moreover, since Sn⊂S0 for all n≥1,
[TABLE]
Let ϵ>0 and choose
φϵ∈S0 such that
[TABLE]
Let {φnϵ}n∈N∗ be a sequence converging to φϵ in W01,q(Ω,Rd×d)
and such that φnϵ∈Sn for all n∈N∗.
Then,
we use the growth conditions on f∗ in (2.4) and (2.5),
the continuity of f∗ on its domain and the Lebesgue dominated convergence theorem to obtain that
[TABLE]
It follows that
[TABLE]
As ϵ is arbitrary, we have
[TABLE]
From (2.17) and (2.18), we conclude that
n→∞limVSnf[u]=VS0f[u].
2.) One has
[TABLE]
The inequality above is obtained by using the definition of the Legendre transform f∗ of f. Let φˉ∈∂f(∇u). Then f∗(φˉ)+f(∇u)=∇u⋅φˉ.
Thanks to the growth conditions (2.2) and (2.3)
on f, it holds that φˉ∈Lq(Ω,Rd×d).
Since W01,q(Ω,Rd×d)
is dense in Lq(Ω,Rd×d) for the Lq(Ω,Rd×d) norm, we get
[TABLE]
We conclude that
VSf[u]=∫Ωf(∇u)dx.
3.)
The total variation of u∈BV(Ω,Rd×d)
is
[TABLE]
while, using the Legendre transform of f(ξ)=∣ξ∣, we obtain
[TABLE]
It follows directly from (2.19) and (2.20) that ∥Du∥(Ω)≤VSf[u]. The converse inequality ∥Du∥(Ω)≥VSf[u] follows from the density of Cc1(Ω,Rd×d) in
W01,q(Ω,Rd×d) and an argument similar to the one made in the proof of (2) in the proposition.
□
3. Minimization with general displacements.
We consider the following :
[TABLE]
This problem will be studied via a dual problem that we will formulate next.
We assume in this section that Assumption (A2) holds.
3.1. An auxiliary problem
For l,k:Rd→(−∞,∞], define for u,v∈Rd
[TABLE]
and
[TABLE]
Under Assumption (A2), it is known that ((l#)#)#=l# and ((k#)#)#=k#
(see for instance Lemma A1 of [10] ).
Call C the set of all functions (k,l)
with
k,l:Rd→R∪{∞} Borel measurable, finite at least at one point, and satisfying
l≡∞ on Rd∖Λˉ
and such that
[TABLE]
Call C′ the set of all functions (k,l)∈C
such that
l=k# and k=l#.
The set C′ is nonempty. Indeed, (χΛˉ#,(χΛˉ#)#)∈C′ as ((χΛˉ#)#))#=χΛˉ#.
Let A be the set of (k,l,φ) such that (k,l)∈C
and φ∈S.
Consider the following functional defined on A:
[TABLE]
The following problem
will play an important role in this section:
[TABLE]
The value in Equation (3.5)
is the opposite of the value in the following
equation:
[TABLE]
Let
A′
denote
the subset of A consisting of all (k,l,φ)∈A that satisfy
(k,l)∈C′.
It
holds that
[TABLE]
Indeed, the key observation to this end is that
for (k,l,φ)∈A, one has
l≥k# and k≥(k#)# so that
[TABLE]
For R>0, we set
[TABLE]
Lemma 3.1**.**
Assume (A1), (A2) and (A3) hold. Let (k,l,φ)∈AR. Set
sl:=−u∈Λˉinfl(u). Then,
[TABLE]
Moreover, there exists M:=M(R,F,f,Ω,Λ)>0 such that
[TABLE]
Proof.
As Λ is bounded and l is convex, we choose ul∈Λ such that −l(ul)=sl. Since k:=l#, in view of (3.2), we have
[TABLE]
Using the last inequality in
(3.9), one gets
[TABLE]
We have used the fact that ul is a constant vector and φ∈W01,q(Ω,Rd×d) to obtain the equality in
(3.11). Hence,
[TABLE]
Thus,
[TABLE]
Thanks to Lemma 2.2 (iii), sl is bounded uniformly in l.
□
Lemma 3.2**.**
Assume (A1), (A2) and (A3) hold.
- (1)
There exists M>0 such that for all (k,l,φ)∈AR one has
[TABLE]
2. (2)
There exist a0,b0,c0>0 such that for all (k,l,φ)∈AR, the map k is r∗-Lipschitz, and one has for all v∈Rd
[TABLE]
Proof.
1.)
Recall that for (k,l,φ)∈AR, one has
[TABLE]
By Lemma 3.1, for all (k,l,φ)∈AR, if we define sl:=−u∈Λˉinfl(u), we get
[TABLE]
Rearranging the terms, we get:
[TABLE]
By definition of sl we also have −slLd(Ω)≤∫Λl(y)dy
and thus
[TABLE]
Lemma 3.1 also ensures that.
We consider the negative part of l defined by
l−:=max{−l,0} and note that
[TABLE]
Observe that, by the definition of sl, we have l−≤∣sl∣. This, combined with (3.14), (3.15) and (3.8) yields (3.12).
2.) Let
(k,l,φ)∈AR. Since k=l#,
by equation (3.2), k is a r∗-Lipschitz
as Λ has diameter less or equal to r∗.
Next
[TABLE]
As sl is uniformly bounded, the growth condition
on H ensures that ∣k(0)∣ is uniformly bounded say by some
b0>0. We get then the inequality
k(v)≤b0+r∗∣v∣ for all v∈Rd.
Because of the hypothesis on the domain Λ, we take a0>0 such that B(0,a0)⊂Λ.
As (k,l,φ)∈AR, we use relation
(3.4)
to obtain for v=0
[TABLE]
Thanks to
equation (3.12), ∫Λ∣l∣dy is
uniformly bounded in
l.
We use in addition the
fact that l
is bounded to
deduce
that
y∈Bˉ(0,a0)sup∣l∣(y)
is bounded by a constant independent of l (see for instance Theorem 1, p. 236 in
[7]). Thus equation
(3.16) implies that there exists c0>0
such that
k(v)≥a0∣v∣−c0 for all v∈Rd.
□
Proposition 3.3**.**
Assume (A1), (A2), and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d).
Then, the functional J admits a minimizer (k0,l0,φ0) in A′.
Proof.
Let (kˉ,lˉ,φˉ)∈A. Set R=J(kˉ,lˉ,φˉ). Take a minimizing sequence
{(kn,ln,φn)}n∈N∗ of Problem (3.5) that is in AR. By Lemma 3.1 and the growth condition on f∗ we may assume without
loss
of generality that
{φn}n=1∞ converges to some φ0∈S weakly in Lq(Ω,Rd×d).
Since Span(S) is finite dimensional, {φn}n=1∞ converges to some φ0∈S strongly in the Lq(Ω,Rd×d) norm. We deduce
[TABLE]
From Lemma 3.2, as ln is convex, we use Ascoli-Arzéla Theorem together with Theorem 1, p. 236 in
[7] to deduce that up to a subsequence, we may assume that (kn,ln) converges locally uniformly Rd×Λ to (k0,l0)∈C′ on .
The Lebesgue dominated convergence together with
inequality
(3.13) yield
[TABLE]
Since {ln}n=1∞ is uniformly bounded below (thanks to Lemma
3.1 ), by Fatou’s Lemma we get
[TABLE]
By inequalities (3.17), (3.18)
and (3.19), we get
[TABLE]
and (k0,l0,φ0) is a minimizer of J over A′.
□
3.2. A uniqueness result
Here, we prove the main result of this section. We will need the
following lemma which is in the spirit of Lemma 4.3 and
Lemma 4.4 in
[2]. A proof of Lemma 3.4 is given in
subsection 5.1.
Lemma 3.4**.**
Assume assumption (A2) holds.
Consider a lower semicontinuous function
l0:Rd→Rˉ
such that Λˉinfl0>−∞; l0 is finite on Λ and l0≡+∞ on Rd∖Λˉ. Set k0=(l0)#.
Let v∈Rd be such that k0 is differentiable at v.
- (1)
There exist unique u0∈Λˉ and t0>0 such that
k0(v)=−t0l0(u0)−H(t0)−u0⋅v.
In addition, u0 and t0 are characterized by u0=∇k0(v) and H′(t0)+l(u0)=0.
2. (2)
Let l^∈Cb(Rd) and let 1≥ϵ>0. Define lϵ=l0+ϵl^ and kϵ=(lϵ)#.
- (a)
There exists a constant M independent of v and ϵ
such that
[TABLE]
2. (b)
We have
[TABLE]
Next, we give the main result of this section.
Theorem 3.5**.**
Assume (A1), (A2), and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d). Assume F satisfies the condition (ND)S. Then,
Problems (3.1)
and (3.6) are dual.
Problem (3.6) admits a maximizer (k0,l0,φ0) with k0=l0# and l0=(k0)#.
Problem (3.1) admits a
unique minimizer (u0,β0). Moreover u0 satisfies
[TABLE]
Proof.
Step 1.
For
(u,β)∈US∗ and (k,l,φ)∈A, one has
[TABLE]
Thus I(u,β)≥−J(k,l,φ) with equality
if and only if
φ∈ΦS(u) and
[TABLE]
Note that if k is convex, the map ∇k(F+divφ) is well defined as the map F+divφ is non-degenerate.
Using Lemma 3.4(i), it follows that if k is convex, then
I(u,β)=−J(k,l,φ) if and only if
[TABLE]
Step 2.
Thanks to equation
(3.7),
we may find
a maximizer (k0,l0,φ0) of Problem (3.5)
satisfying k0=l0# and l0=(k0)#.
The
function
u0=∇k0(F+divφ0) is well defined
as k0 is convex and we set β0=(H′)−1(−l(u0)). We are to show that
(u0,β0) ∈US∗ and φ0∈ΦS(u0).
Step 3.
Let lˉ∈Cc(Rd). For ϵ∈(0,1), define lϵ=l0+ϵlˉ and kϵ=(lϵ)#. Using Lemma 3.4, one has
[TABLE]
Since J(k0,l0,φ0)≤J(kϵ,lϵ,φ0),
we deduce that
−∫Λlˉdy+∫Ωβ0lˉ(u0)dx≤0. As we can replace lˉ by −lˉ, one deduces
that
∫Λlˉdy=∫Ωβ0lˉ(u0)dx.
Therefore (u0,β0)∈US∗.
Step 4.
Let φ∈S. For ϵ∈(0,1), set φϵ=ϵφ+(1−ϵ)φ0.
By the convexity of S, the map φϵ belongs to S.
As J(k0,l0,φ0)≤J(k0,l0,φϵ), we have
[TABLE]
Thanks to Lemma 3.4, Inequality (3.22) implies
[TABLE]
It follows from Proposition 2.8 that φ0∈ΦS(u0).
Step 5. Since (u0,β0) ∈US∗, φ0∈ΦS(u0), u0=∇k0(F+divφ0), and β0=(H′)−1(−l(u0)),
we deduce that I(u0,β0)=J(k0,l0,φ0) and
u0 is a minimizer of Problem (3.1) thanks to relation (3.20). Suppose (u1,β1) ∈US∗ is another minimizer
of Problem (3.1). Then we have I(u1,β1)=J(k0,l0,φ0)
and by relation (3.20), we get u1=∇k0(F+divφ0) which implies
u1=u0. Next the strict convexity of H yields that β0=β1. We conclude that (u0,β0) is the unique minimizer of Problem (3.1)
and u0 is characterized by
[TABLE]
□
Corollary 3.6**.**
Assume (A0), (A1), (A2), and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d) and ∇φ is non-degenerate whenever φ∈S. Suppose F has a countable range (thus degenerate) Then, F satisfies the condition (ND)S and
problem (3.1) admits a unique solution.
Corollary 3.7**.**
Assume (A1), (A2), and (A3) hold. Assume S is a finite dimensional subspace of W01,q(Ω,Rd×d) and ∇φ has a countable range whenever φ∈S. Suppose F is non-degenerate. Then, F satisfies the condition (ND)S and
problem (3.1) admits a unique solution.
4. The incompressible case
Throughout this section, we assume that S is a subset of W01,q(Ω,Rd×d). We consider the following problem:
[TABLE]
and we recall that the set US1 is defined as
[TABLE]
We assume Ld(Ω)=Ld(Λ) so that US1 is non-empty.
4.1. Existence and uniqueness via duality
We study Problem
(4.1) via duality.
Let u∈US1, φ∈S, l∈C(Λ) and k:Rd→R
satisfy k(v)+l(u)≥u⋅v for all u∈Λ and all v∈Rd.
One has
[TABLE]
This suggests that we consider the dual problem
[TABLE]
with A0 being the set of all (k,l,φ) such that φ∈S, l∈C(Λ), Λinfl=0 and k:Rd→R
satisfies k(v)+l(u)≥u⋅v for all u∈Λˉ, and all v∈Rd.
Remark that we have
[TABLE]
4.1.1. Existence and regularity of minimizers of Problem (4.5)
Denote by C the set
of all (k,l) such that
k:Rd→R and l:Rd→R∪{∞} satisfy
[TABLE]
and l≡∞ on Rd∖Λˉ.
Consider the subset C0 of C consisting of (k,l)∈C such that l∈C(Λ) and Λinfl=0.
The following lemma is standard:
Lemma 4.1**.**
Let (k,l)∈C. It holds that (l∗,l∗∗)∈C,
l∗≤k, 0≤l∗∗≤l and l∗∗∗=l∗.
If (k,l)∈C0 then l∗(0)=0.
Let us denote by C0′ the set of all (k,l)∈C0
such that l∗=k, k∗=l, k(0)=0, and l≥0, and by A0′
the set of all (k,l,φ) with (k,l)∈C0′
and φ∈S.
Remark that an element in C0′ is the couple (χΛˉ,(χΛˉ)∗). Hence
A0′ is nonempty when S is nonempty.
One readily checks that, in light of Lemma 4.1,
Problem (4.5)
has the same infimum value as
[TABLE]
We recall that
r∗ is such
that B(0,1/r∗)⊂Λ⊂B(0,r∗/2);
Lemma 4.2**.**
Assume (A1) and (A3) hold. Assume that the set S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d). Then, problem
(4.8) admits a minimizer (k0,l0,φ0)∈A0′
with k0 convex and r∗-Lipschitz and k0(0)=0.
Proof.
Consider a minimizing sequence
{(kn,ln,φn)}n=1∞
of Problem (4.8).
Since kn=ln∗ and ln=(kn)∗, kn is r∗-Lipschitz. As kn(0)=0, we use Ascoli-Arzéla theorem to deduce that a subsequence of
{kn}n=1∞ converges locally uniformly to some k0.
Next, using the growth condition (2.5) on f∗ as well as the facts that kn
is r∗-Lipschitz, kn(0)=0, we establish the following estimate :
[TABLE]
As the left hand side of (4.9) is bounded, ln≥0 and S is finite dimensional,
we deduce from (4.9) that a subsequence of {φn}n=1∞ converges strongly to some
φ0 in W01,q(Ω,Rd×d). Invoking (4.9) again, we show that {∫Λln(y)dy}n=1∞ is bounded. This, combined with the fact that ln is non negative and convex, yields the existence of a subsequence of
{ln}n=1∞ that converges locally uniformly to some l0 (see for instance Theorem 1, p. 236 in
[7]).
One readily checks that (k0,l0,φ0)∈A0′.
We next exploit lower semi-continuity
properties of the functional J to conclude that
(k0,l0,φ0) is a minimizer of J over A0′.
□
4.1.2. A duality result
We have the following theorem.
Theorem 4.3**.**
Assume (A1) and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d). Suppose that the map F satisfies the condition (ND)S.
Then
Problems (4.1)
and (4.6) are dual.
Problem (4.6) admits a maximizer (k0,l0,φ0) with k0=l0∗ and l0=(k0)∗.
Problem (4.1) admits a
unique minimizer u0. Moreover u0 satisfies
[TABLE]
Proof.
Suppose u∈US1 and (k,l,φ)∈A0.
Using
(4.3)
and
(4.4),
we see that
I0(u)≥−J(k,l,φ)
with equality
if and only if
φ∈ΦS(u) and
l(u)+k(F+divφ)=u⋅(F+divφ) for almost every x∈Ω.
The latter condition reduces to
u(x)=∇k(F(x)+divφ(x)) if k is convex, under the assumption F+divφ is non-degenerate. Now, let (k0,l0,φ0)∈A0′ be a minimizer of J over A0.
Since F+divφ0 is non-degenerate and k0 is convex, the map u0=∇k0(F+divφ0) is well defined.
Variation around l0.
Let lˉ∈Cc(Rd). For ϵ∈(0,1), set lϵ=l0+ϵlˉ and kϵ=(lϵ)∗. Let v∈Rd be a point where k0 is differentiable.
Using the measurable selection theorem, one deduces that there
exists
Tϵ:Rd→Rd measurable such that
for all ϵ∈[0,1)
[TABLE]
Then, for ϵ∈(0,1), we have
[TABLE]
and
[TABLE]
Moreover,
[TABLE]
We refer the reader to Lemma 5.3
for (4.10)- (4.12). Hence, as
[TABLE]
using again (4.12),
one has
[TABLE]
Since J(k0,l0,φ0)≤J(kϵ,lϵ,φ0),
we deduce from (LABEL:eq:lim_intom_k_epsilon_bis_bis) that
−∫Λlˉ+∫Ωlˉ(u0)≤0.
By replacing l by −l in the above argument,
one deduces
that
∫Λlˉ=∫Ωlˉ(u0).
As a result, u0∈US1.
Variation around φ0.
Let φ∈S.
For ϵ∈(0,1), by convexity of S, we have
φϵ:=ϵφ+(1−ϵ)φ0∈S.
Then J(k0,l0,φ0)≤J(k0,l0,φϵ).
This implies that
[TABLE]
As ϵ tends to 0+, the above equation yields
[TABLE]
It follows from Proposition 2.8 that φ0∈ΦS(u0).
□
Corollary 4.4**.**
Assume (A0), (A1), and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d) and ∇φ is non-degenerate whenever φ∈S.
Suppose F has a countable range (thus degenerate). Then, F satisfies the condition (ND)S and
problem (4.1) admits a unique solution.
Corollary 4.5**.**
Assume
(A1)
and (A3) hold. Assume S is a finite dimensional
subspace of W01,q(Ω,Rd×d) and
∇φ has a countable range whenever φ∈S. Suppose F is non-degenerate. Then, F satisfies the condition (ND)S and
problem (4.1) admits a unique solution.
4.2. A Link between Problem (3.1) and Problem (4.1)
Here, we explore the relationships between
problem (3.1) and problem (4.1). For this purpose, we make a further assumption of the domains Ω and Λ by requiring that Ω=Λ. Assume (A1) holds and recall {Hn}n=0∞ as defined in (2.7) and (2.8). Then, Lemma 2.3 ensures that
(A2)holds for Hn for all n≥1.
Define
[TABLE]
and
[TABLE]
Recall that C0 is the set of all (k,l)
such that l∈C(Λˉ),
infl=0
and k:Rd→R satisfies
for all u∈Λ and all v∈Rd:
[TABLE]
Let Cn be the set of all (k,l)
such that l∈C(Λˉ) and k:Rd→R
satisfy:
[TABLE]
We denote
by A0 the set of all (k,l,φ) satisfying (k,l)∈C0
and φ∈S. Similarly An denotes
the set of all (k,l,φ) satisfying (k,l)∈Cn
and φ∈S.
If
(k,l,φ)∈A0∪An, we still set
[TABLE]
Lemma 4.6**.**
Assume (A1), (A2), and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d).
For each n∈N, let (un,βn) be the unique minimizer of In over US∗ as given by Theorem 3.5 and let (kn,ln,φn) be a minimizer of J over
An with
kn convex
and r∗-Lipschitz as ensured by Proposition 3.3 and Lemma 4.2.
Then,
- (1)
The sequence {In(un,βn)}n∈N∗
is bounded.
2. (2)
The sequence {βn}n∈N∗
converges to 1 in L2(Ω).
3. (3)
The sequence {φn}n∈N∗
admits a subsequence that
converges to some φˉ in S with respect to the W01,q(Ω,Rd×d)− norm.
Proof.
Step 1.
Let uˉ∈US1. We have
(uˉ,1)∈US∗ and thus In(un,βn)≤In(uˉ,1) for all n≥1.
As Hn(1)=0, it holds that In(uˉ,1)=VSf(uˉ)−∫Ωuˉ⋅Fdx which is finite.
Hence
[TABLE]
On the other hand, we use growth condition (2.5) to get
[TABLE]
Finally, we use (4.16) and (4.17) to prove (1).
Step 2. Let φ0∈S. As un has values in Λ, it holds that
[TABLE]
and
[TABLE]
We combine (4.16), (4.17), (4.18), (4.19) to get
[TABLE]
Setting c0Ld(Ω):=R0−R2+r∗∥F∥L1(Ω,Rd), we use lemma 2.3 and
(4.20) to obtain
[TABLE]
This establishes (2).
Step 3. As {Hn}n=1∞ is a non decreasing sequence that converges to H0, it holds that Cn+1⊂Cn⊂C0 for all n∈N.
Thus, as (kn,ln)∈Cn, we have (kn,ln)∈C0 so that
[TABLE]
Since −J(kn,ln,φn)=In(un,βn), we have J(kn,ln,φn)≤R1 for all n∈N∗. This, combined with Ω=Λ, and (4.21) yields
[TABLE]
In view of the growth condition (2.5) and boundedness of Ω, (4.22) implies
[TABLE]
As, S is of finite dimension and the div operator is continuous on S, we conclude that {φn}n=1∞ is convergent up to a subsequence in W01,q(Ω,Rd×d) which
allows us to conclude (3).
□
Theorem 4.7**.**
Assume (A1), (A2), and (A3) hold. Assume S is a finite dimensional non-empty closed and convex subset of W01,q(Ω,Rd×d).
Assume F satisfies the condition (ND)S. For each n∈N, let (un,βn) be the unique minimizer of In over US∗ as given by Theorem 3.5 and let (kn,ln,φn) be a minimizer of J over
Anwith kn is convex and r∗-Lipschitz as ensured by Proposition 3.3 and Lemma 4.2.
Suppose that kn is differentiable for all n∈N∗.
Then, the sequence {un}n∈N∗
converges almost everywhere to the unique minimizer u0 of
I0 over
US1. In addition, the minima {In(un,βn)}n=1∞
converge to I0(u0).
Proof.
Step 1.
For n∈N∗, set
kˉn=kn−kn(0). Note that
we have kˉn(0)=0.
Since the functions kn are r∗-Lipschitz, so are the
functions kˉn and
we obtain that, up to a subsequence,
the sequence
{kˉn}n=1∞ converges locally uniformly to
a certain
function
kˉ.
Since F+divφn is non-degenerate, we have that ∇kˉn(F+divφn)
is well-defined. Furthermore, Lemma 4.6 ensures that {φn}n=1∞ converges
up to a subsequence
to some φˉ∈S with respect to
the
W1,q(Ω,Rd)−
norm. As a result, {divφn}n=1∞ converges to divφˉ in Lq(Ω,Rd). Since S is of finite dimension, the Lq convergence of {divφn}n=1∞ reduces to a pointwise convergence. Next, using the convexity of the
kˉn and the pointwise convergence of {divφn}n=1∞ to
divφ, we deduce that up to a subsequence {∇kˉn(F+divφn)}n=1∞ converges a.e to ∇kˉ(F+divφˉ) ( cf. [13] Theorem 25.7).
As a duality result, Theorem 3.5 ensures that ∇kˉn(F+divφn)=un. If we denote uˉ:=∇kˉ(F+divφˉ), then, up to a subsequence, the sequence {un}n∈N converges a.e to uˉ.
Step 2. Let l∈Cb(Rd). The strong convergence in L2(Ω) of {βn}n=1∞ to 1 established in Lemma 4.6 and the almost everywhere convergence of {un}n∈N to uˉ obtained in Step 1 ensure that n→∞lim∫Ωβnl(un)dx=∫Ωl(uˉ(x))dx. As (un,βn)∈US∗, ∫Ωβn(x)l(un)dx=∫Ωl(y)dy for all l∈Cb(Rd). It follows that in the limit ∫Ωl(uˉ)dx=∫Ωl(y)dy for all l∈Cb(Rd) and thus uˉ∈US1.
Step 3. We recall that
[TABLE]
Since u↦VSf(u) is lower-semicontinuous as a supremun
of affine functions, by applying the Fatou’s Lemma, we have
[TABLE]
Let u0 be the unique minimizer of I0 over US1 as given by Theorem 4.3. Then,
[TABLE]
Meanwhile, as Cn⊂C0 and (k0,l0,φ0) is a minimizer of J over C0, we have
[TABLE]
This, along with the duality established in Theorem 3.5 imply that
[TABLE]
We combine (4.25) and (4.26) to obtain I0(uˉ)=I0(u0). As u0 is the unique minimizer of I0 over
US1 we have u0=uˉ. We note that the limit uˉ does not depend on the subsequence of {un}n chosen. Thus, the whole sequence {un}n converges a.e. to u0.
In addition, {In(un,βn)}n
converges
to I0(u0).
□
5. Appendix
5.1. Proof of Lemma 3.4
We will prove Lemma 3.4 through
two lemmas. The
results of the first lemma can be found in Lemma 4.3 of
[2]. We give here a sketch of the proof for the
convenience of the reader.
Lemma 5.1**.**
Assume (A2) holds.
Consider a lower semicontinuous function
l:Rd→Rˉ
such that Λˉinfl>−∞; l is finite on Λ and l≡+∞ on Rd∖Λˉ. Set k=l# and let w∈Rd. Then:
- (1)
There exist uˉ∈Λˉ and tˉ>0 such that
[TABLE]
Moreover, uˉ and tˉ satisfy uˉ∈∂k(w) and H′(tˉ)+l(uˉ)=0.
2. (2)
If
k is differentiable at w then uˉ and tˉ are uniquely determined by
uˉ=∇k(w) and tˉ=(H′)−1(−l(uˉ)).
Proof. 1) We have
[TABLE]
Consider a maximizing sequence
{(un,tn)}n=1∞ in (5.2). As 0∈Λ,
we may assume without loss of generality that
[TABLE]
for n≥1. It follows that
[TABLE]
for n≥1. In light of the growth condition on H in (A2) there exists positive real numbers α such that {tn}n=1∞⊂[α,α−1]. As Λ is bounded, we may assume without loss of generality that the sequence
{(un,tn)}n=1∞ converges to some (uˉ,tˉ)∈Λˉ×[α,α−1].
We next use the lower semicontinuity of H and l to deduce that
[TABLE]
Note that k(w)≥uˉ⋅w−l(uˉ)t−H(t) for all t>0. In view of (5.3), it follows that g:(0,∞)→R defined by g(t)=uˉ⋅w−l(uˉ)t−H(t) admits a maximum at tˉ. As g is differentiable at tˉ, we have g′(tˉ)=0, that is, l(uˉ)+H′(tˉ)=0. Next, observe that k(z)≥uˉ⋅z−l(uˉ)tˉ−H(tˉ) for all z∈Rd. In light of the convexity of k we have that uˉ∈∂k(w).
- Assume that k is differentiable at w. Then, uˉ is uniquely determined as uˉ=∇k(w). As H′(tˉ)=−l0(uˉ) and H′ is a bijection, we obtain that tˉ is also uniquely determined as tˉ=(H′)−1(−l(uˉ)).
∎
The second lemma which is inspired by Lemma 4.4 in [2] is the following:
Lemma 5.2**.**
Assume assumption (A2) holds.
Consider a lower semicontinuous function
l0:Rd→Rˉ
such that Λˉinfl0>−∞; l0 is finite on Λ and l0≡+∞ on Rd∖Λˉ. Set k0=(l0)#.
Let l^∈Cb(Rd) and let 1≥ϵ>0. Define lϵ=l0+ϵl^ and kϵ=(lϵ)#. Let v∈Rd be such that k0 is differentiable at v.
- (1)
There exists a constant M independent of v and ϵ
such that
[TABLE]
2. (2)
We have
[TABLE]
Proof. Note that the map lϵ=l0+ϵl^ is bounded below by m−∣l^∣∞. As kϵ=(lϵ)# and k0=(l0)#, lemma 5.1 ensures that there exist t0,tϵ>0 and u0,uϵ∈Λˉ such that
[TABLE]
and
[TABLE]
We then have
[TABLE]
and
[TABLE]
We combine (5.6) and (5.7) to get
[TABLE]
Using again lemma 5.1 we have
[TABLE]
As lδ is bounded below by m−∣l∣∞, we use the fact that H′ is a continuous and strictly increasing bijection from (0,∞) to R to deduce that tδ is bounded above by M1>0 given by M1:=(H′)−1(−m+∣l^∣∞). This bound on tδ combined with (5.8) yields a constant M:=∣l^∣∞(H′)−1(−m+∣l^∣∞) such that (5.4) holds. As a result
ϵ→0+limkϵ(v)=k0(v).
Next, let {en}n=1∞⊂(0,1] converging to 0 such that ϵ→0limsupl^(uϵ)tϵ=n→∞liml^(uen)ten. Without loss of generality, we may assume that {uen}n=1∞ converges to some uˉ∈Λˉ and {ten}n=1∞ converges to tˉ∈[0,M1].
Exploiting the lower semicontinuity of l0, l^ and H, we get:
[TABLE]
It follows that k0(v)=uˉv−l0(uˉ)tˉ−H(tˉ). As k0 is differentiable at v, we have t0=tˉ and u0=uˉ.
We use (5.8), the definition of {en}n=1∞, the convergence of {uen}n=1∞ and {ten}n=1∞ to obtain
[TABLE]
As a result, ϵ→0lim−tϵl^(uϵ)=−t0l^(u0). We invoke one more time equation (5.8) to obtain (5.5).
5.2. Some properties of the Legendre transform.
We have the following Lemma which is similar to
Lemma 3.4 but uses the Legendre transform instead of the (⋅)# operator.
Lemma 5.3**.**
Consider a lower semicontinuous function
l0:Rd→Rˉ
such that Λˉinfl0>−∞; l0 is finite on Λ and l0≡+∞ on Rd∖Λˉ. Set k0=(l0)∗.
- (1)
There exists a measurable map T0:Rd→Rd such that
k0(v)=v⋅T0(v)−l0(T0(v))
for all v∈Rd
and T0(v)=∇k0(v) whenever k0 is differentiable at v∈Rd.
2. (2)
Let l^∈Cb(Rd) and let 1≥ϵ>0. Define lϵ=l0+ϵl^ and kϵ=(lϵ)∗.
- (a)
For all v∈Rd we have :
[TABLE]
2. (b)
For ϵ∈(0,1), there exists a
map Tϵ:Rd→Rd satisfying
for all v∈Rd:
kϵ(v)=vTϵ(v)−lϵ(Tϵ(v)).
When k0 is differentiable at v∈Rd, we have
ϵ→0limTϵ(v)=∇k0(v) and
[TABLE]
Proof. 1.) Let v∈Rd.
We have
[TABLE]
We use the lower semicontinuity of l0 and the compactness of Λˉ to deduce that there exists uˉ∈Λ such that k0(v)=uˉv−l0(uˉ).
We have k0(w)−(uˉw−l0(uˉ))≥0 for all w∈Rd while k0(v)−(uˉv−l0(uˉ))=0.
Since
k0 is convex, we deduce that uˉ∈∂k0(v).
Next, for
v∈Rd, define
[TABLE]
Assume {un}n∈N⊂Rd converges to u; {vn}n∈N⊂Rd converges to v and for all n∈N, one has un∈Γ(vn). Then u∈Γ(v). Indeed, one has
[TABLE]
Therefore, uv−l0(u)=k0(v)
and u∈Γ(v). As a result, the multifunction Γ:Rd⇉Rd is closed and nonempty valued.
By the Measurable Selection Theorem [Corollary 14.6, [15]], there exists a measurable map T0:Rd→Rd such that for all v∈Rd, one has T0(v)∈Γ(v). That is k0(v)=vT0(v)−l0(T0(v)). As T(v)∈Γ(v)⊂∂k0(v), we also have T0=∇k0 almost everywhere.
2.) For ϵ>0, lϵ is bounded below
and satisfies the
hypothesis on l0. Let
kϵ=lϵ∗ and consider a map Tϵ satisfying
for all v∈Rd:
kϵ(v)=vTϵ(v)−lϵ(Tϵ(v))
as given by part 1.).
We have for v∈Rd:
[TABLE]
Similarly, for v∈Rd we have
[TABLE]
We combine (5.10) and (5.11) to get
[TABLE]
which leads to
[TABLE]
Consider a sequence
{ϵn}n converging to 0. The sequence
{Tϵn(v)}n is bounded so we may find a subsequence {ϵn′}n of {ϵn}n such that the sequence {Tϵn′(v)}n converges to u∈Λˉ. We then have:
[TABLE]
We use (5.14) to obtain k0(v)=vu−l0(u) and thus u=∇k0(v) as k0 is differentiable at v.
It follows that ϵ→0limTϵ(v)=∇k0(v).
We use Equation (5.12) and the continuity of l^ to obtain
[TABLE]
∎