WEAK LOWER SEMICONTINUITY FOR NON COERCIVE POLYCONVEX INTEGRALS

19  Download (0)

Full text

(1)

WEAK LOWER SEMICONTINUITY FOR NON COERCIVE POLYCONVEX INTEGRALS

M. AMAR  V. DE CICCO  P. MARCELLINI  E. MASCOLO

Abstract. We prove a lower semicontinuity theorem for a polyconvex functional of integral form, related to maps u : Ω ⊂ Rn → Rmin W1,n(Ω; Rm)with n ≥ m ≥ 2, with respect to the weak W1,p-convergence for p > m − 1, without assuming any coercivity condition.

Keywords: Vector-valued maps, Jacobian determinants, polyconvex integrals, lower semicontinuity, chain rule.

AMS-MSC: 49J45 - 49K20

1. Introduction

Direct methods of calculus of variations are a rigorous framework to treat mathematically interesting problems arising in science or engineering related to optimality conditions such as the minimization of the energy (or minimization of time, or of space, etc...), expressed in integral form such as, for instance,

(1.1) Z

g(x, u, Du) dx .

The mathematical theory of direct methods, rougly speaking, is based on the lower semi- continuity of the energy functional in (1.1) in a certain topology and on the relative compactness of bounded sets of functions u which compete for a minimum. These two properties are the main ingredients in order to assure the existence of equilibrium solu- tions. Compactness has been a main motivation for the introduction of theory of Func- tional Analysis in the last century. Lower semicontinuity, either in Lp or in the weak topology of W1,p (the Sobolev space of Lp-functions with rst partial derivatives in Lp), classically is based on the convexity of the function g in (1.1) with respect to the gradi- ent variable Du. However, motivated by the applications to nonlinear elasticity, in 1977 J. Ball pointed out in [4] that convexity is completely unrealistic in the vectorial case.

Indeed, it conicts, for instance, with the natural requirement that the elastic energy is frame-indierent. Hence, it must be replaced by dierent and more general conditions, named quasiconvexity and polyconvexity, properties already introduced theoretically by Morrey in [25]. These new convexity conditions are now considered fundamental ones in nonlinear elasticity. In particular, polyconvexity takes into account a natural constitutive hypothesis which is the invariance of the energy under the transformation g 7→ g + φ, for every null Lagrangian φ.

1

(2)

The aim of this research is to consider the polyconvexity condition, to achieve new lower semicontinuity results useful for applications in this eld. We describe below in more details the mathematical problem.

Dealing with vector-valued maps, still it is not completely known a set of minimal as- sumptions for lower semicontinuity of integrals of the Calculus of Variations of the form

(1.2) I (u) =

Z

g(x, u, Du) dx ,

where u : Ω → Rm is a vector-valued map dened in an open set Ω ⊂ Rn and Du is the m × n Jacobian matrix of its partial derivatives

u ≡ u1, u2, . . . , um , Du = ∂uα

∂xi

α=1,2,...,m i=1,2,...,n

.

On the contrary, in the so-called scalar case (corresponding to m = 1) Serrin in 1961, in the pioneering paper [27], pointed out the convexity of g = g (x, s, ξ) with respect to the gradient variable ξ as a main (necessary and) sucient condition for the lower semicontinuity of the integral I (u) in (1.2). Serrin himself pointed out the special role of the x variable to obtain the lower semicontinuity of I (u) with respect to the L1loc(Ω)- convergence. In fact, among his assumptions we mention either the coercivity of g , i.e.,

g (x, s, ξ) ≥ c |ξ|

for some positive constant c and for every (x, s, ξ) ∈ Ω × R × Rn, or the continuity of the partial derivatives

(1.3) gx(x, s, ξ) , gξ(x, s, ξ) , gξx(x, s, ξ) .

Some extensions of Serrin's results have been recently obtained by Gori-Marcellini [19]

and by several other authors, also in the context of BV -functions (see [18], [15], [9], [10], [3]).

In the vector-valued case m > 1 either the quasiconvexity or the polyconvexity of g with respect to the gradient variable ξ play a role. These convexity conditions are due to Morrey [25]; a reference paper is Ball [4]. In particular the function g(x, s, ξ) is said polyconvex with respect to the gradient variable ξ if it can be represented under the form (1.4) g (x, s, ξ) = f (x, s, M (ξ)) ,

where f is a convex function with respect to its last variable and, for every m × n matrix ξ ∈ Mm×n, M(ξ) denotes the vector

M (ξ) = ξ, adj2ξ, . . . , adjiξ, . . . , adjmin{m,n}ξ .

Here adjiξ, for i = 2, . . . , min {m, n}, stands as the vector of the determinants of the i × i minors of the matrix ξ ∈ Mm×n. Thus M(ξ) is a vector in Rτ, with

τ = τ (n, m) =

min(m,n)

X

i=1

n i

 m i

 .

(3)

We assume that f : Ω × Rm× Rτ → [0, +∞)is a nonnegative function, convex in Rτ with respect to the last variable.

The lower semicontinuity for polyconvex integrals have been investigated by several au- thors in the past years, starting from the results by Morrey and Ball cited above. In the quoted papers the weak topology of W1,p(Ω; Rm)is considered, for some p > min {m, n}.

A more recent counterexample by Maly [22] shows that the semicontinuity in the weak topology of W1,p(Ω; Rm) is generically not true if p < min {m, n} − 1. Marcellini [23], [24] and Dacorogna-Marcellini [7] proved a lower semicontinuity result when p > n − 1, m = n and f = f (M(ξ)) or f = f (x, M(ξ)). The limit case p = n − 1 has been studied in the same context by Acerbi-Dal Maso [2], Dal Maso-Sbordone [8], Celada-Dal Maso [5]

and Fusco-Hutchinson [16]. See also Acerbi-Buttazzo-Fusco [1] for lower semicontinuity with respect to the L-topology.

The situation changes considerably when a dependence on s is also allowed, since the presence of the (x, s)-variables cannot be treated as a simple perturbation. A result in this more general context is due to Gangbo [17] under the following structure assumptions:

f (x, s, M (ξ)) = a(x, s)h (x, M (ξ)). More recently Fonseca-Leoni [14], by using a blow-up argument, proved a semicontinuity result under the coercivity condition

f (x, s, M (ξ)) ≥ c |M (ξ)| ,

valid for some positive constant c and for every (x, s, ξ) ∈ Ω × Rm× Rm×n. They consider the weak topology of W1,p(Ω; Rn) in the limit case p = n − 1 too, with f depending only on the Jacobian determinant detξ = adjnξ of the n × n matrix ξ, i.e., f = f (x, s, detξ) and the coercivity condition f (x, s, detξ) ≥ c |detξ| holds.

In the spirit of Serrin's work, where either the coercivity or the continuity of the partial derivatives in (1.3) were assumed, in this paper we consider the vector-valued case m > 1 and we study the lower semicontinuity of the integral in (1.2) related to general polyconvex integrands; the lack of coercivity and the general form of the dependence on the (x, s)- variables force additional regularity assumptions on the integrand. In particular we prove the following result (for more general assumptions see Theorems 4.2 and 4.3).

Theorem Let us consider the vector-valued case m ≥ 2 and let n ≥ m. Let f be a nonnegative convex function with respect to the last variable, such that f and fx are continuous in Ω×Rm× Rτ. Then, for every uk, u ∈ W1,m(Ω, Rm), such that uk converges to u in the weak topology of W1,p(Ω, Rm) for some p > m − 1, we have

(1.5) lim inf

k→+∞

Z

f (x, uk, M (Duk)) dx ≥ Z

f (x, u, M (Du)) dx .

We explicitly note that the condition uk, u ∈ W1,m(Ω; Rm) is necessary to make non ambiguous the denition of the integral functional. The conclusion (1.5) makes possible to extend the integral functional I (u) in (1.2), a-priori uniquely dened in W1,m(Ω; Rm), to functions in W1,p(Ω; Rm) for p > m − 1. See details for instance in [24].

(4)

We emphasize that in fact in this paper we give some lower semicontinuity results under more general assumptions than those stated above (see details in Theorems 3.6 and 4.5).

Relevant aspects, in particular, are: (i) we deal with integrands f depending on (x, u) and on all the minors of the matrix Du; (ii) coercivity of f is not assumed; (iii) we consider the weak convergence in W1,p(Ω, Rm) for p > m − 1; i.e., below the natural exponent p = m which guarantee a non ambiguous denition of the integrals. We also notice that our results hold in the limit case p = m − 1 = 1, if m = n = 2 (see Proposition 3.7).

The proof of the theorem stated above is based on an interesting combination of two principal ingredients, which reect the basic role respectively of the convexity of f and the polyconvexity of g in (1.4). The rst one is the original approximation argument for a convex function f(x, s, ·) introduced by De Giorgi in [12]. In these notes f is approximated from below by a sequence of linear functions whose coecients, which depend on (x, s), are explicitly represented in terms of f, allowing us to deduce regularity properties of the coecients from the corresponding ones of f.

The second ingredient is a chain rule formula for determinants (see Lemmas 2.1 and 2.3 in Section 2). In the smooth case, for m = n, the chain rule has the following form: let B = B(x, s) be a function of class C1 dened in Ω × Rn, and let u ∈ W1,n(Ω, Rn); under the notations





v(x) = B(x, u(x)) b(x, s) = ∂B/∂s1 DxB(x, s) =

∂B

∂x1,∂x∂B

2, . . . ,∂x∂B

n

 with x ≡ (xi)i=1,...,n and s ≡ (si)i=1,...,n, we have

det Dv, Du2, . . . , Dun

= b(x, u) det Du + det DxB(x, u), Du2, . . . , Dun ,

where (Dv, Du2, . . . , Dun) represents the n × n matrix whose columns are the n vectors Dv, Du2, . . . , Dun and similarly for the other matrix (DxB(x, u), Du2, . . . , Dun). The role and properties of determinants are crucial here. This formula (which admits a proper generalization to the case m < n) allows us to represent a term of the type b(x, u) det Du as an algebraic sum of Jacobian determinants, which are continuous in the weak topology of W1,p(Ω, Rn)for p > n−1. This allows us to pass to the limit as k → +∞ in expressions of the type

k→+∞lim Z

b(x, uk) det Dukdx = Z

b(x, u) det Du dx .

Let us nally mention that some recent lower semicontinuity results have been obtained, in the scalar case, using a chain rule formula for gradients (see [19], [18], [9], [10], [20], see also [21] for convex functionals in the vector-valued case).

Acknowledgments: The authors are grateful to Giovanni Leoni for helpful discussions during his visit in July 2006 to the Department of Mathematics of the University of Florence, Italy. The present work has been partially supported by GNAMPA-INdAM

(5)

(Gruppo Nazionale per l'Analisi Funzionale e Applicazioni - Istituto Nazionale di Alta Matematica), project Singolarità e semicontinuità nel Calcolo delle Variazioni.

2. Chain rule formulas for determinants

In this section we study some chain rule formulas involving determinants. The rst one is a pointwise formula and it is proved in a regular context, from which we derive an integral form under weaker assumptions.

In the following for a matrix ξ = (ξαi)α=1,2,...,n

i=1,2,...,n we also use the notation det ξ = det (ξ1, ξ2, . . . , ξn), where, for α = 1, 2, . . . , n, the vector ξα = (ξ1α, ξα2, . . . , ξnα).

Lemma 2.1 (Pointwise chain rule). Let B = B(x, s) be a function belonging to C1(Ω×Rn). Then, for every u ∈ W1,n(Ω; Rn) ∩ Lloc(Ω; Rn), the function v : Ω → R, dened by

v(x) := B(x, u(x)) for a.e. x ∈ Ω belongs to Wloc1,n(Ω) and, for almost every x ∈ Ω, we have (2.1) Ds1B x, u1(x), . . . , un(x) det Du(x) =

det Dv(x), Du2(x), . . . , Dun(x) −det DxB(x, u(x)), Du2(x), . . . , Dun(x) . Proof. Let Ω0 ⊂⊂ Ω. First of all we note that by the usual chain rule formula, for j = 1, . . . , n and for almost every x ∈ Ω0, we obtain

Dxjv(x) = DxjB(x, u(x)) +

n

X

i=1

DsiB(x, u(x)) Dxjui(x) . Hence

Dv(x) = DxB(x, u(x)) +

n

X

i=1

DsiB(x, u(x)) Dui(x) for a.e. x ∈ Ω0. Therefore, by using the multilinearity properties of the determinants, it follows

det Dv(x), Du2(x), . . . , Dun(x)

= det DxB(x, u(x)) +

n

X

i=1

DsiB(x, u(x)) Dui(x), Du2(x), . . . , Dun(x)

!

= det DxB(x, u(x)), Du2(x), . . . , Dun(x) +

n

X

i=1

DsiB(x, u(x)) det Dui(x), Du2(x), . . . , Dun(x) .

Since det (Dui(x), Du2(x), . . . , Dun(x)) = 0, for i = 2, . . . , n, (2.1) follows for almost every x ∈ Ω0. Letting Ω0 → Ω, the thesis is accomplished.  Remark 2.2. Formula (2.1) can be proved also for a general Borel function B at every point (x, s), with s = u(x), in which B is dierentiable.

Moreover, we note that if B = B(x, s) is a locally Lipschitz continuous function on Ω × Rn, then equality (2.1) holds provided that Ds1B x, u1(x), . . . , un(x) det Du(x) and

(6)

det (Dv(x), Du2(x), . . . , Dun(x)) are interpreted to be zero whenever Du(x) = 0, irrespec- tive of whether Ds1B x, u1(x), . . . , un(x)

and Dv(x) are dened.

Finally, observe that (2.1) holds also with s1 replaced with si, i = 1, . . . , n:

DsiB x, u1(x), . . . , un(x) det Du(x) =

det Du1(x), . . . , Dui−1(x), Dv(x), Dui+1(x), . . . Dun(x) − det Du1(x), . . . , Dui−1(x), DxB(x, u(x)), Dui+1(x), . . . Dun(x) .

Lemma 2.3 (Integral chain rule). Let (x, s) ∈ Ω × Rn and s = (s1, s0) ∈ R × Rn−1. Let B = B(x, s) be a continuous function such that, for every compact set K ⊂ Ω × Rn there exists a proper positive constant CK, depending on K, such that

(2.2) |B(x, s1, s0) − B(y, t1, s0)| ≤ CK(|x − y| + |s1− t1|) ,

for every (x, s1, s0), (y, t1, s0) ∈ K. Then, for every u ∈ W1,n(Ω; Rn) ∩ Lloc(Ω; Rn), we have

(2.3)

Z

ψ Ds1B x, u1, . . . , un det Du dx =

− Z

B x, u det Dψ, Du2, . . . , Dun dx

− Z

ψ det DxB(x, u), Du2, . . . , Dun dx .

for every ψ ∈ C01(Ω).

Remark 2.4. We observe that, in the previous lemma, the assumption u ∈ Lloc(Ω; Rn) can be removed if B(x, s) = 0 for |s| ≥ L, for some L > 0.

Proof. Let u ∈ W1,n(Ω; Rn) ∩ Lloc(Ω; Rn), the function dened by

Ω 3 x 7→ B(x, u(x))

belongs to Wloc1,n(Ω). Let Ω0 ⊂⊂ Ωand ρε= ρε(s0)be a standard C-mollier in Rn−1. In what follows we will use the notation Bε to denote the convolution of B with ρε, i.e.

Bε(x, s) = Bε(x, s1, s0) = Z

Rn−1

ρε(s0− τ0) B(x, s1, τ0) dτ0,

for x ∈ Ω0 and s ∈ Rn, where 0 < ε < dist(Ω0, ∂Ω).

(7)

The function vε(x) = Bε(x, u(x)) belongs to W1,n(Ω0)and, by multiplying (2.1) for every ψ ∈ C01(Ω0)and integrating by parts, we obtain

(2.4)

Z

ψDs1Bε x, u1, . . . , un det Du dx =

− Z

Bε x, u det Dψ, Du2, . . . , Dun dx

− Z

ψ det DxBε(x, u), Du2, . . . , Dun dx .

Set kuk = kukL(Ω0;Rm). We observe that, by assumptions, for a proper compact set K ⊂ Ω × Rn such that Ω0 × B(0, kuk+ 1) ⊂ K and (x, s) ∈ suppψ × B(0, kuk) and for every ε > 0 we have

|Ds1Bε(x, s)| ≤ Z

Rn−1

ρε(s0− τ0) |Ds1B(x, s1, τ0)| dτ0 ≤ CK,

|Bε(x, s)| ≤ Z

Rn−1

ρε(s0− τ0) |B(x, s1, τ0)| dτ0 ≤ CK,

|DxBε(x, s)| ≤ Z

Rn−1

ρε(s0 − τ0) |DxBε(x, s1, τ0)| dτ0 ≤ CK,

where we denote by CK also the positive constant such that |B(x, s)| ≤ CK, for (x, s) ∈ K.

The previuos estimates and standard properties of convolution imply

Ds1Bε* Ds1B weakly in L(suppψ × B(0, kuk+ 1)) ,

Bε* B weakly in L(suppψ × B(0, kuk+ 1)) ,

DxBε * DxB weakly in L(suppψ × B(0, kuk)) ,

and hence, since det Du belongs to L1(Ω), the thesis follows, once we pass to the limit for ε → 0+ in (2.4).

 3. Lower semicontinuity in the model case m = n

In this section we prove the lower semicontinuity result in the model case m = n, when the function g (x, s, ξ) appearing in the integral functional in (1.2) explicitly depends only on (x, s) and the determinant det ξ = adjnξ of the n × n matrix ξ; i.e., g can be represented under the form

g (x, s, ξ) = f (x, s, det ξ) , the general case being considered in the next section.

(8)

In the following we use two results, which are classical tools in the framework of lower semicontinuity problems. Firstly, we recall the approximation theorem for convex func- tions due to De Giorgi (see [12]). This result states that any convex function f : Rν → R, ν ≥ 1, is approximated by mean of a sequence of ane functions aj + bj· ξ, aj ∈ R and bj ∈ Rν, where

aj :=

Z

Rν

f (η) (ν + 1)αj(η) + ∇αj(η) · ηdη , (3.1)

bj := − Z

Rν

f (η)∇αj(η)dη, (3.2)

with αj ∈ C01(Rν), j ∈ N, a nonnegative function such that RRναj(η)dη = 1.

Lemma 3.1. Let f : Rν → R be a convex function and aj, bj be dened as in (3.1) and (3.2). Then the following property holds:

f (ξ) = sup

j∈N

[aj + bj · ξ] ∀ξ ∈ Rν.

Remark 3.2. The main feature of this approximation is that the coecients aj and bj

depend explicitly on f. In particular, when f depends also on (x, s) we have that (3.1) and (3.2) become

aj(x, s) :=

Z

Rν

f (x, s, η) (ν + 1)αj(η) + ∇αj(η) · ηdη , (3.3)

bj(x, s) := − Z

Rν

f (x, s, η)∇αj(η)dη, (3.4)

which permit to deduce regularity properties with respect to (x, s) of the coecients aj, bj from proper hypotheses satised by f. Hence, if f satises some continuity or Lipschitz continuity assumptions with respect to (x, s), then aj and bj inherit the same properties, too.

Now we recall the following localization lemma proven in [13].

Lemma 3.3. Let µ be a positive Radon measure dened on an open set Ω ⊂ Rn. Consider a sequence {φj} of Borel positive functions dened on Ω. Then

Z

sup

j∈N

φj dµ = sup

j∈N

j

X

i=1

Z

Ai

φi dµ : Ai ⊂⊂ Ω open and pairwise disjoint

.

In order to approach our lower semicontinuity problem for polyconvex integrals, we rstly deal with functionals of the following type:

u ∈ W1,n(Ω; Rn) 7→

Z

a x, u + b x, udet Du+dx ,

(9)

which, in view of the previous Lemma 3.1, will be the ane approximations of the general polyconvex functionals.

Lemma 3.4. Let a = a(x, s) and b = b(x, s) be two continuous functions. Assume that, for every compact set K ⊂ Ω × Rn and for every (x, s), (y, s) ∈ K, b satises

(3.5) |b(x, s) − b(y, s)| ≤ CK|x − y|

for a proper positive constant CK, depending on the compact set K. Moreover we assume that Dxb is a Carathéodory function. Then for every uk, u ∈ W1,n(Ω; Rn) with uk * u weakly in W1,p(Ω; Rn), p > n − 1, we have

Z

a x, u + b x, udet Du+dx

≤ lim inf

k→+∞

Z

a x, uk + b x, ukdet Duk+

dx .

Proof. We split the proof in two steps.

Step 1: First we assume that a(x, s) = 0 and b(x, s) = 0 for |s| ≥ L for some L > 0. By Lemma 3.3, it is easy to check that for every u ∈ W1,n(Ω; Rn) we have

Z

ψ [a(x, u) + b(x, u)det Du]+ dx

= sup

 Z

ψ[a(x, u) + b(x, u)det Du] dx : ψ ∈ C01(Ω), 0 ≤ ψ ≤ 1

 .

Fix ψ ∈ C01(Ω) with 0 ≤ ψ ≤ 1 and let K := supp ψ × [−L, L]. By Fatou's Lemma, since a is locally bounded, we obtain that

(3.6) Z

ψa(x, u) dx ≤ lim inf

k→∞

Z

ψa(x, uk) dx .

Dene now

(3.7) B(x, s) = B(x, s1, s0) :=

s1

Z

0

b(x, τ, s0) dτ k ∈ N ,

(10)

so that Ds1B(x, s) = b(x, s). By applying Lemma 2.3 and Remark 2.4, it follows Z

ψb(x, uk) det Dukdx

= Z

ψDs1B x, u1k, . . . , unk det Dukdx

= − Z

B(x, uk) det Dψ, Du2k, . . . , Dunk dx

− Z

ψ det DxB(x, uk), Du2k, . . . , Dunk dx .

Since p > n − 1, for q = p−n+1p = n−1p 0

, we have that ( B(x, uk) → B(x, u)

DxB(x, uk) → DxB(x, u) strongly in Lqloc(Ω) ,

and that all minors of order n − 1 of the n × (n − 1) matrix (Du2k, . . . , Dunk) weakly converges in Ln−1p (Ω) (see [26]), therefore we get

(3.8)

lim inf

k→+∞

Z

ψb(x, uk) det Dukdx

= − Z

B(x, u) det Dψ, Du2, . . . , Dun dx

− Z

ψ det DxB(x, u), Du2, . . . , Dun dx

= Z

ψDs1B x, u1, . . . , un det Du dx

= Z

ψb(x, u) det Du dx .

By collecting (3.6) and (3.8) we obtain

(3.9)

lim inf

n→∞

Z

ψ[a(x, uk) + b(x, uk)det Duk] dx

≥ Z

ψ[a(x, u) + b(x, u)det Du] dx and by taking the supremum over all ψ, we get the desired result.

Step 2: We now remove the extra assumption that a (x, u) = 0 and b(x, u) = 0 for

|u| ≥ L.

(11)

For every j ∈ N dene

(3.10) σj(s) :=





1 |s| ≤ j − 1,

−|s| + j j − 1 < |s| ≤ j, 0 |s| > j.

Then, for every xed j ∈ N, we have

(3.11)

lim inf

k→∞

Z

[a(x, uk) + b(x, uk)det Duk]+ dx

≥ lim inf

k→∞

Z

σj(uk) [a(x, uk) + b(x, uk)det Duk]+ dx.

Since the functions

aj(x, s) := σj(s) a(x, s), bj(x, s) := σj(s) b(x, s) satisfy the hypotheses of Step 1, (3.9) and (3.11) imply

lim inf

k→∞

Z

[a(x, uk) + b(x, uk)det Duk]+ dx

≥ Z

σj(u) [a(x, u) + b(x, u)det Du]+ dx

Z

{x∈Ω: |u(x)|≤j−1}

[a(x, u) + b(x, u)det Du]+ dx.

Letting j → ∞, the conclusion follows by Beppo Levi's Lemma.  Remark 3.5. Note that, if n = 2, the previous result continues to hold also in the limit case p = n − 1 = 1. Indeed, following the idea of Dacorogna and Marcellini [7, Lemma 2], we have the equality

lim

k→+∞

 Z

B(x, uk) det Dψ, Du2k dx + Z

ψ det DxB(x, uk), Du2k dx

= Z

B(x, u) det Dψ, Du2 dx + Z

ψ det DxB(x, u), Du2 dx , and then (3.8) still holds true for uk converging to u weakly in W1,1(Ω; R2).

Now we are in the position to prove a lower semicontinuity inequality for polyconvex integrals of the form

Z

f x, u, det Du dx

along sequences {uk} ⊂ W1,n(Ω; Rn) weakly converging in W1,p(Ω; Rn), for p > n − 1, without requiring any growth conditions on the integrand f.

(12)

Theorem 3.6. Let f : Ω × Rn× R → [0, +∞) be a continuous function such that for a.e. x ∈ Ω and for all s ∈ Rn f (x, s, ·) is convex ;

(3.12)

( ∀K ⊂⊂ Ω × Rn× R ∃CK > 0 such that

|f (x, s, t) − f (y, s, t)| ≤ CK|x − y| ∀(x, s, t), (y, s, t) ∈ K ; (3.13)

for every (x, t) ∈ Ω × R Dxf (x, ·, t) is a continuous function . (3.14)

Then for every uk, u ∈ W1,n(Ω; Rn) with uk * u weakly in W1,p(Ω; Rn), p > n − 1, we have

Z

f x, u, det Du dx ≤ lim inf

k→∞

Z

f x, uk, det Duk dx .

Proof. Let {uk}be a sequence in W1,n(Ω; Rn)converging to u ∈ W1,n(Ω; Rn), with respect to the w − W1,p convergence, with p > n − 1. Since by Lemma 3.1 and Remark 3.2

f (x, s, t) = sup

j∈N

[aj(x, s) + bj(x, s)t]+,

where aj and bj are dened as in (3.3) and (3.4), for every xed j ∈ N, we have lim inf

k→+∞

Z

f x, uk, det Duk dx ≥

lim inf

k→+∞

Z

aj(x, uk) + bj(x, uk)det Duk

+

dx .

By our assumptions, for every j ∈ N the functions aj and bj satisfy all the assumptions of Lemma 3.4. Therefore, we obtain

lim inf

k→+∞

Z

f x, uk, det Duk dx

≥ Z

aj(x, u) + bj x, u det Du)+dx .

Hence

lim inf

k→+∞

Z

f x, uk, det Duk dx

≥ sup

j∈N

Z

aj(x, u) + bj x, u det Du+dx .

The thesis follows by the localization Lemma 3.3. 

We note that, as in [7], in the special case n = 2 the previous result holds also in the limit case p = n − 1 = 1, as stated in the following proposition, which can be proved by using Remark 3.5.

(13)

Theorem 3.7. Let n = 2 and p = 1. Assume that Ω ⊂ R2 is an open set and f : Ω × R2× R → [0, +∞) is a continuous function satisfying (3.12), (3.13) and (3.14). Then for every uk, u ∈ W1,2(Ω; R2) with uk* u weakly in W1,1(Ω; R2), we have

Z

f x, u, det Du dx ≤ lim inf

k→+∞

Z

f x, uk, det Duk dx .

4. Lower semicontinuity in more general cases In this section we extend Theorem 3.6, to more general contexts.

4.1. Dependence on all minors: the case m = n. In this section we extend Theorem 3.6 to the case generally considered in the literature, where f depends on all the minors of the Jacobian matrix Du.

Let

σ =

n−1

X

k=1

n k

2

and for any matrix ξ ∈ MIn×n, we denote by Mn−1 ξ

the vector in Rσ, whose components are given by the determinants of all minors of ξ up to the order n − 1; i.e.,

M ξ = (ξ, adj2ξ, . . . , adjiξ, . . . , adjnξ) = (Mn−1 ξ, det ξ) . As above, we rstly deal with functionals of the form:

u ∈ W1,n(Ω; Rn) 7→

Z

a x, u + b0 x, u ·Mn−1 Du + bσ+1 x, udet Du+dx ,

where a : Ω × Rn→ R and b = (b0, bσ+1) : Ω × Rn→ Rσ× R.

Lemma 4.1. Let a : Ω × Rn → R and b = (b0, bσ+1) : Ω × Rn → Rσ × R be continuous functions. Assume that, for every compact set K ⊂ Ω×Rnand for every (x, s), (y, s) ∈ K, bσ+1 satisfy

(4.1) |bσ+1(x, s) − bσ+1(y, s)| ≤ CK|x − y|

for a proper positive constant CK, depending on the compact set K. Moreover we assume that Dxbσ+1 is a Carathéodory function. Then for every uk, u ∈ W1,n(Ω; Rn) with uk * u weakly in W1,p(Ω; Rn), p > n − 1, we have

(4.2)

Z

a x, u + b0 x, u ·Mn−1 Du + bσ+1 x, udet Du+dx ≤

lim inf

k→+∞

Z

a x, uk + b0 x, uk ·Mn−1 Duk + bσ+1 x, ukdet Duk+

dx .

(14)

Proof. We can assume that a(x, s) = 0 and b(x, s) = 0 for |s| ≥ L for some L > 0, since the general case follows by using the same truncation arguments as in the proof of Lemma 3.4. Recalling that for every u ∈ W1,n(Ω; Rn) we have

Z

a(x, u) + b0(x, u) · Mn−1 Du + bσ+1(x, u)det Du+

dx

= sup (Z

ψ[a(x, u) + b0(x, u) · Mn−1 Du + bσ+1(x, u)det Du] dx :

ψ ∈ C01(Ω), 0 ≤ ψ ≤ 1 )

,

and taking into account the localization Lemma 3.3, in order to achieve the conclusion, it is enough to prove that for all ψ ∈ C01(Ω):

Z

ψ[a(x, u) + b0(x, u) · Mn−1 Du + bσ+1(x, u)det Du] dx

≤ lim inf

k→+∞

Z

ψ[a(x, uk) + b0(x, uk) · Mn−1 Duk + bσ+1(x, uk)det Duk] dx for uk, u ∈ W1,n(Ω; Rn) with uk* u weakly in W1,p(Ω; Rn).

By proceeding as in the proof of Lemma 3.4, since (3.9) holds with b replaced by bσ+1, we have only to check that

(4.3)

k→+∞lim Z

ψb0(x, uk) · Mn−1 Duk dx

= Z

ψb0(x, u) · Mn−1 Du dx .

Formula (4.3) is a direct consequence of the fact that b0(x, uk) → b0(x, u) strongly in Lq(Ω, Rσ), for q = p−n+1p = n−1p 0

and all minors up to order n − 1 of the n × n matrix

Duk weakly converges in Ln−1p (Ω) (see [26]). 

Theorem 4.2. Let f : Ω × Rn× Rσ × R → [0, +∞) be a continuous function such that for a.e. x ∈ Ω and for all s ∈ Rn f (x, s, ·, ·) is convex ;

(4.4)

( ∀K ⊂⊂ Ω × Rn× Rσ × R ∃CK > 0 such that

|f (x, s, η, t) − f (y, s, η, t)| ≤ CK|x − y| ∀(x, s, η, t), (y, s, η, t) ∈ K ; (4.5)

∀(x, η, t) ∈ Ω × Rσ × R Dxf (x, ·, η, t) is a continuous function . (4.6)

Then for every uk, u ∈ W1,n(Ω; Rn) with uk * u weakly in W1,p(Ω; Rn), p > n − 1, we have

Z

f

x, u, Mn−1 Du, det Du

dx ≤ lim inf

k→+∞

Z

f

x, uk, Mn−1 Duk, det Duk dx .

(15)

Proof. Let {uk}be a sequence in W1,n(Ω; Rn)converging to u ∈ W1,n(Ω; Rn), with respect to the w − W1,p convergence. By Lemma 3.1 with ν = σ + 1 and ξ = (η, t), we have

f (x, s, η, t) = sup

j∈N

[aj(x, s) + (b0)j(x, s) · η + (bσ+1)j(x, s)t]+

where, for every j ∈ N, aj and bj = ((b0)j, (bσ+1)j) ∈ Rσ× R are dened as in (3.3) and (3.4). Hence, for every j ∈ N, we have

lim inf

k→+∞

Z

f x, uk, Mn−1 Duk, det Duk dx ≥

lim inf

k→+∞

Z

aj(x, uk) + (b0)j x, uk · Mn−1 Duk + (bσ+1)j x, uk det Duk+

dx . Since for every xed j ∈ N the functions aj and bj satisfy the assumptions of Lemma 4.1, we get that inequality (4.2) holds and the conclusion follows by proceeding as in the proof

of Theorem 3.6. 

4.2. Dependence on all minors: the case m < n. In this subsection we assume u : Ω ⊆ Rn→ Rm with m < n and set

σ0 =

m−1

X

j=1

 n j

  m j



and d =n m

 . For any matrix ξ ∈ MIm×n, we denote by Mm−1 ξ

the vector in Rσ0, whose components are given by the determinants of all minors of ξ up to the order m − 1 and by adjmξ the vector in Rd, whose components are given by the determinants of all minors of ξ of the maximum order m.

Theorem 4.3. Let f : Ω × Rm× Rσ0× Rd → [0, +∞)be a continuous function such that for a.e. x ∈ Ω and for all s ∈ Rm f (x, s, ·, ·) is convex ;

(4.7)

( ∀K ⊂⊂ Ω × Rm× Rσ0× Rd ∃CK > 0 such that

|f (x, s, η, ζ) − f (y, s, η, ζ)| ≤ CK|x − y| ∀(x, s, η, ζ), (y, s, η, ζ) ∈ K ; (4.8)

∀(x, η, ζ) ∈ Ω×Rσ0×Rd, Dxf (x, ·, η, ζ) is a continuous function . (4.9)

Then for every uk, u ∈ W1,m(Ω; Rm) with uk * u weakly in W1,p(Ω; Rm), p > m − 1, we have

Z

f

x, u, Mm−1 Du, adjmDu

dx ≤ lim inf

k→+∞

Z

f

x, uk, Mm−1 Duk, adjmDuk dx .

Proof. Let {uk} be a sequence in W1,m(Ω; Rm) converging to u ∈ W1,m(Ω; Rm), with respect to the w − W1,p convergence, p > m − 1. By Lemma 3.1, here ν = σ0 + d and ξ = (η, ζ), we have that

f (x, s, η, ζ) = sup

j∈N

[aj(x, s) + b0j(x, s) · η + ¯bj(x, s) · ζ]+

(16)

where, for every j ∈ N, aj and bj = (b0j, (bσ+1)j, . . . , (bσ+d)j) = (b0j, ¯bj) ∈ Rσ0 × Rd are dened in (3.3) and (3.4). Hence, for every xed j ∈ N, we have

lim inf

k→+∞

Z

f x, uk, Mm−1 Duk, adjmDuk dx ≥

lim inf

k→+∞

Z

aj(x, uk) + b0j x, uk · Mm−1 Duk + ¯bj x, uk · adjmDuk

+

dx .

As in Lemma 3.4 we can assume that aj(x, s) = 0 and bj(x, s) = 0 for |s| ≥ L for some L > 0, since the general case follows by the same truncation argument. Moreover, we recall that for every j ∈ N and every u ∈ W1,m(Ω; Rm) we have

Z

aj(x, u) + b0j(x, u) · Mm−1 Du + ¯bj(x, u) · adjmDu+

dx

= sup (Z

ψ[aj(x, u) + b0j(x, u) · Mm−1 Du + ¯bj(x, u) · adjmDu] dx :

ψ ∈ C01(Ω), 0 ≤ ψ ≤ 1 )

.

Taking into account the localization Lemma 3.3, in order to achieve the thesis, it is enough to prove that for every uk, u ∈ W1,m(Ω; Rm) with uk* u weakly in W1,p(Ω; Rm),

Z

ψ[a(x, u) + b0(x, u) · Mm−1 Du + ¯b(x, u) · adjmDu] dx

≤ lim inf

k→+∞

Z

ψ[a(x, uk) + b0(x, uk) · Mm−1 Duk + ¯b(x, uk) · adjmDuk] dx

where for the sake of simplicity we omitted the subscript index j. By proceeding as in Lemmas 3.4 and 4.1 we get that (3.6) holds and it is easy to check that (4.3) continues to be true with Mn−1 replaced by Mm−1. Hence, we have only to check that

(4.10)

lim

k→+∞

Z

ψ¯b(x, uk) · adjmDuk dx

=

d

X

i=1

 lim

k→+∞

Z

ψbσ+i(x, uk) (adjmDuk)i dx

=

d

X

i=1

Z

ψbσ+i(x, u) (adjmDu)i dx

= Z

ψ¯b(x, u) · adjmDu dx ,

(17)

where ¯b = (bσ+1, . . . , bσ+d) ∈ Rd. Formula (4.10) is a consequence of the chain rule formula applied to adjmDu

i, for every i = 1, . . . , d. Indeed, xed i = 1, . . . , d and dene the C1-function

i(x, s) = ¯Bi(x, s1, s0) =

s1

Z

0

bσ+i(x, τ, s0) dτ

(here s0 ∈ Rm−1) and for u ∈ W1,m(Ω; Rm) let ¯vi(x) = ¯Bi(x, u(x)). Taking into account that m < n, with a proof similar to that of Lemma 2.1, we obtain:

(4.11) bσ+i(x, u1, . . . , um) adjmDu

i = Ds1i x, u1, . . . , um

adjmDu

i = adjm(D¯vi, Du2, . . . , Dum)

i− adjm(Dxi(x, u), Du2, . . . , Dum)

i. The corresponding integral formulation is given by

(4.12)

Z

ψ Ds1i x, u1, . . . , un

adjmDu

idx =

− Z

i x, u

adjm(Dψ, Du2, . . . , Dun)

idx

− Z

ψ adjm(Dxi(x, u), Du2, . . . , Dun)

idx ,

for every ψ ∈ C01(Ω). Finally, taking into account (4.12) and the fact that p > m−1, (4.10) can be obtained reasoning as in the proof of Lemma 3.4 (see in particular (3.8)).  4.3. Weakening of the regularity of the integrand. In this subsection we consider the case where the integrand admits a Sobolev dependence (with an exponent q >> 1) with respect to the x-variable instead of the Lipschitz continuity condition. To this purpose, we rstly need a proper new chain rule, under a Sobolev type dependence. For the sake of simplicity, we consider only the model case m = n and g(x, s, ξ) = f(x, s, det ξ).

Lemma 4.4. Let p > n − 1, q = p−n+1p = n−1p 0

and B = B(x, s) be a function such that B is a Carathéodory function s.t. B ∈ Lloc(Ω × Rn) ;

(4.13)





∀s ∈ Rn B(·, s) ∈ W1,q(Ω) , DxB is a Carathéodory function and

∀K ⊂⊂ Ω × Rn ∃ aK ∈ Lq(Ω) s.t. for every s ∈ Rn and a.e. x ∈ Ω

|DxB(x, s)| ≤ aK(x) ; (4.14)

for a.e. x ∈ Ω B(x, ·) ∈ C0(Rn) ; (4.15)

( B(x, ·, s0) ∈ C1(R) for a.e. x ∈ Ω and for every s0 ∈ Rn−1

and Ds1B is a Carathéodory function s.t. Ds1B ∈ Lloc(Ω × Rn) . (4.16)

Then, the same conclusions of Lemma 2.3 hold.

Proof. It is sucient to follows the arguments in the proof of Lemma 2.3, by remarking that assumption (4.14) permits to pass to the limit, as ε → 0+, in (2.4). 

(18)

By using previous lemma we obtain the following lower semicontinuity theorem.

Theorem 4.5. Let p > n − 1, q = p−n+1p = n−1p 0

and f : Ω × Rn× R → [0, +∞) be a Borel function belonging to Lloc(Ω × Rn× R) such that

for a.e. x ∈ Ω and for all s ∈ Rn f (x, s, ·) is convex ; (4.17)

for a.e. x ∈ Ω and for all t ∈ R f(x, ·, t) ∈ C0(Rn) ; (4.18)





∀(s, t) ∈ Rn× R f(·, s, t) ∈ W1,q(Ω) and

∀K ⊂⊂ Ω × Rn× R ∃ aK ∈ Lq(Ω) s.t.

for a.e. x ∈ Ω and for every (s, t) ∈ Rn× R |Dxf (x, s, t)| ≤ aK(x) ; (4.19)

for a.e. x ∈ Ω and for every t ∈ R Dxf (x, ·, t) is a continuous function . (4.20)

Then for every uk, u ∈ W1,n(Ω; Rn) with uk → u weakly in W1,p(Ω; Rn), we have Z

f x, u, det Du dx ≤ lim inf

k→+∞

Z

f x, uk, det Duk dx .

Remark 4.6. Under the same assumptions of Theorem 4.5, when n = 2, the result still holds in the limit case p = 1, by proceeding as in Theorem 3.7.

Moreover, condition (4.20) can be dropped if

f (x, s, t) = g(x, s1, t)h(s2, . . . , sn) , with h continuous and g satisfying (4.17)(4.19).

References

[1] E. Acerbi, G. Buttazzo, N. Fusco, Semicontinuity and relaxation for integrals depending on vector valued functions, J. Math. Pures Appl., 62(1983), pp. 371-387.

[2] E. Acerbi, G. Dal Maso, New lower semicontinuity result for polyconvex integrals, Calc. Var. Partial Dierential Equations, 2(1994), pp. 329-371.

[3] M. Amar, V. De Cicco, N. Fusco, Lower semicontinuity and relaxation results in BV for inte- gral functionals with BV integrands, ESAIM Control Optim. Calc. Var., Published Online DOI:

10.1051/cocv:2007061(2007).

[4] J.M. Ball, Convexity conditions and existence theorems in nonlinear elasticity, Arch. Ration. Mech.

Anal., 63(1977), pp. 337-403.

[5] P. Celada, G. Dal Maso, Further remarks on the lower semicontinuity of polyconvex integrals, Ann.

Inst. H. Poincaré, Anal. Non Linéaire, 11(1994), pp. 661-691.

[6] B. Dacorogna, Direct methods in the Calculus of Variations, Appl. Math. Sci. 78, Springer, Berlin, 1989.

[7] B. Dacorogna, P. Marcellini, Semicontinuité pour des intégrandes polyconvexes sans continuité des déterminants, C.R. Math. Acad. Sci. Paris, 311(1990), pp. 393-396.

[8] G. Dal Maso, C. Sbordone, Weak lower semicontinuity of polyconvex integrals: a borderline case, Math. Z., 218(1995), pp. 603-609.

[9] V. De Cicco, N. Fusco, A. Verde, On L1-lower semicontinuity in BV (Ω), J. Convex Anal., 12(2005), pp. 173185.

[10] V. De Cicco, N. Fusco, A. Verde, A chain rule formula in BV (Ω) and its applications to lower semicontinuity, Calc. Var. Partial Dierential Equations, 28(2007), pp. 427447.

(19)

[11] V. De Cicco, G. Leoni, A chain rule in L1(div; Ω)and its applications to lower semicontinuity, Calc.

Var. Partial Dierential Equations, 19(2004), pp. 2351.

[12] E. De Giorgi, Teoremi di semicontinuità nel Calcolo delle Variazioni, Corso INDAM, (1968/1969).

[13] E. De Giorgi, G. Buttazzo, G. Dal Maso, On the lower semicontinuity of certain integral functions, Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei (9) Mat. Appl., 74(1983), pp. 274-282.

[14] I. Fonseca, G. Leoni, Some remarks on lower semicontinuity, Indiana Univ. Math. J., 49(2000), pp.

617-635.

[15] N. Fusco, M. Gori, F. Maggi, A remark on Serrin's Theorem, NoDEA Nonlinear Dierential Equa- tions Appl., 28(2007), pp. 427447.

[16] N. Fusco, J.E. Hutchinson, A direct proof for lower semicontinuity of polyconvex functionals, Manuscripta Math., 87(1995), pp. 35-50.

[17] W. Gangbo, On the weak lower semicontinuty of energies with polyconvex integrands, J. Math.

Pures Appl., 73(1994), pp. 455-469.

[18] M. Gori, F. Maggi, P. Marcellini, On some sharp conditions for lower semicontinuity in L1, Dier.

Integral Equ. Appl., 16(2003), pp. 5176.

[19] M. Gori, P. Marcellini, An extension of the Serrin's lower semicontinuity theorem, J. Convex Anal., 9(2002), pp. 475502.

[20] D. Graziani, A new L1-lower semicontinuity result, Boll. Unione Mat. Ital. Sez. B Artic. Ric. Mat.

(8), (to appear).

[21] D. Graziani, On the L1-lower semicontinuity and relaxation in BV (Ω; Rm)for integral functionals with discontinuous integrand, Ph.D. Thesis, Univ. La Sapienza - Roma, (2007).

[22] J. Maly, Weak lower semicontinuity of polyconvex integrals, Proc. Edinb. Math. Soc. (2), 123(1993), pp. 681-691.

[23] P. Marcellini, Approximation of quasiconvex functions and lower semicontinuity of multiple integrals, Manuscripta Math., 51(1985), pp. 1-28.

[24] P. Marcellini, On the denition and the lower semicontinuity of certain quasiconvex integrals, Ann.

Inst. H. Poincaré Anal. Non Linéaire, 3(1986), pp. 391-409.

[25] C.B. Morrey, Multiple integrals in the Calculus of Variations, Springer, Berlin, 1966.

[26] Y. Reshetnyak, Stability theorems for mappings with bounded distortion, Sibirsk. Mat. Zh., 9(1968), pp. 667-684.

[27] J. Serrin, On the denition and properties of certain variational integrals, Trans. Amer. Math. Soc., 161(1961), pp. 139-167.

M. Amar  V. De Cicco, Dipartimento di Metodi e Modelli Matematici, Università di Roma La Sapienza, Via A. Scarpa 16, 00161 Roma, Italy

P. Marcellini  E. Mascolo, Dipartimento di Matematica U. Dini, Università di Firenze, Viale Morgagni 67/A, 50134 Firenze, Italy

Figure

Updating...

References

Related subjects :