110 3 Minimization Techniques: Lack of Compactness
careful analysis of the minimizing sequences, much more precise than the ones seen
so far. We will try to classify the possible behaviors of minimizing sequences, and
from this we will first rule out some possibilities, and then show that in the remain-
ing cases there is enough compactness to conclude the proof.
This kind of argument is a first (and simplified) example of the application of a
highly refined theory aimed at classifying all the possible behaviors of sequences of
“approximate solutions”, like minimizing sequences. The theory, beyond the scopes
of this book, was developed by P.-L. Lions in a series of papers [31–34], and cul-
minates with the “Concentration–Compactness Principle”, a largely used tool in
problems with lack of compactness.
We will find another example of application of this principle in the next section.
For the analysis of the minimizing sequence {u
k
}that we need here it is sufficient
to consider three cases: l =β, l =0, and l ∈(0,β).
It is quite useful, in this and in many other cases where compactness is the prob-
lem, to visualize intuitively the minimizing sequence {u
k
} as made of number of
“bumps” in R
N
, changing their shape and moving around as k →∞. One says that
the “mass” of u
k
, for example some integral of |u
k
|
p
, is concentrated where the
bumps are located. Following this image, one can easily realize that if at least one
bump escapes to infinity, then u
k
will not be compact (in the weak limit some mass
is lost, and there is no strong convergence in L
p
for instance). This is of course
not the only possible reason for a failure of compactness, but it certainly helps in
following the technical parts of the argument.
For example, keeping in mind the definition of β and l, it is reasonable to visual-
ize the case l =β as a situation where no mass is lost, and hence compactness should
be expected. The case l =0 corresponds to a total loss of mass (all the bumps of u
k
escape to infinity); if this happens, the key will be the analysis of an auxiliary prob-
lem, where q(x) is replaced by α =lim
|x|→∞
q(x). The hardest case is l ∈(0,β)
which means that only some of the mass is lost in the limit.
We now make all this rigorous, beginning from the simplest case and confirming
our initial guess that compactness can be recovered.
Lemma 3.3.6 If l =β, then u ∈N and I(u)=m.
Proof If l =β, in addition to u
k
uin L
p
(R
N
) we also have |u
k
|
p
→|u|
p
, and
this implies u
k
→ u in L
p
(R
N
) (see [11]). By the same interpolation argument of
the previous lemma, this yields also u
k
→ u in L
r
(R
N
). Hence, by weak conver-
gence, we obtain
I(u)≤liminf
k
I(u
k
) =m,
while the relation u
k
2
=|u
k
|
p
p
+λ|u
k
|
r
r
implies
u
2
≤|u|
p
p
+λ|u|
r
r
.
If equality holds, then u ∈ N (recall that l = β>0, so u = 0) and the lemma is
proved.