2.2 Linearizations around standing waves
2.2.2 Convergence of the ground state
It is not difficult to see that L and L0 fulfill the assumptions in definition 1.1.
For >0, we only have to set a:= 1,
Va:=D2W(θ0)|(−a,a), V∞:=D2W(θ0), Ja := 1, J∞:= 1,
and
Ha :=L, H∞ :=L0.
As the limits limz→±∞θ0(z) are attained at an exponential rate, we have λ−= minσ D2W(a)
, and
λ+= minσ D2W(b) . Definition 2.5. 1. Let ≥0. Define
λ1 := minσ(L), and
λ,odd1 := minσ(Lodd ).
We denote normalized eigenfunctions that correspond to L and Lodd byψ1 and ψ,odd1 , respectively.
2. Suppose that φ1, ..., φr and φodd1 , ..., φodds is an orthonormal basis of ker(L0) and ker(Lodd0 −λ0,odd1 ), respectively. Set
(Px) (t) :=
r
X
j=1
hx, φjiL2(I)φj(t), x∈ L2(I,C)m
, t∈I, for ≥0. In the same way, we define Podd with respect to φodd1 , ..., φodds . Let us agree that we always choose real valued eigenfunctions ofLodd and L. Lemma 2.1. The following statements hold:
1. λ1 =O
e−
√
minσe(L0) 4
, →0.
2. Suppose W ◦γ =W, γ ∈O(m), and θ0 is γ-odd.
(a) If λ0,odd1 <minσe(Lodd0 ), then
λ0,odd1 −λ,odd1
=O e−
√
minσe(L0)−λ0,odd 1 4
!
, →0, and if dim ker(L0) = 1, we have λ0,odd1 >0.
(b) If λ0,odd1 = minσe(Lodd0 ), then lim inf
→0 λ,odd1 ≥minσe(L0).
Remark 2.1. The proof of lemma 2.1 is based on lemma 1.2. If there is a sequence that fulfills the assumptions of lemma 1.2, then there exists a subsequence that delivers an eigenvalue and a corresponding eigenfunction. Throughout the proof, we never mention again that we always suppose the subsequence is the sequence itself.
Proof. 1. Set
β := 1 kθ00kL2(I)
, ≥0.
In view of corollary C.1, we have
λ1 ≤β2S[θ00] =β2θ000θ00|∂I.
Differentiation of the Euler Lagrange equation ofEshows thatθ00 ∈ker(L0).
Lemma 1.1 (δ = 3/4) yields
|θ00(z)| ≤Ce−
√
minσe(L0)
4 |z|
for some constant C > 0. Hence λ1 ≤Ce−
√
minσe(L0)
4 , (2.5)
as β →1. Now we prove
∃0 >0 :∃C >0 :∀∈(0, 0) :
∀ψ1 ∈ker (L−λ1), normalzied :hψ1, Pψ1iL2(I)≥C.
If the contrary holds, we obtain a sequence n −→0, and normalized ψ1n ∈ker (Ln −λ1n) such that
m
X
j=1
hψ1n, φjiL2(In)
2
< 1 n. Hence, by (2.5) and lemma 1.2, there exist
ψ := lim
n→∞ψ1n,
and
Due to (2.5), we must have λ ≤ 0. But according to proposition 2.1, we have L0 ≥0. It follows λ= 0 and
ψ ∈ker(L0).
Owing to (2.5) and lemma 1.1, we have the uniform envelopee−
√
minσe(L0)
8 |z|
for each eigenfunction ψ1n, n>0 sufficiently small. Theorem A.1 implies hψ, φjiL2(R) = lim
This is a contradiction. Now we draw the conclusion:
|λ1|C≤
The last step follows from corollary 1.2, where we have proved that φj and φ0j decay with the same rate.
2-(a) The quadratic form that is associated to Lodd is given by the restriction of S to Hodd1 (I). Suppose λ0,odd1 ∈ σd(Lodd0 ). Then λ0,odd1 is in the discrete
spectrum of L0. Due to proposition 2.1 and lemma 1.1, each corresponding eigenfunction ψ0,odd1 has the envelope e−
√
If the contrary holds, there exists a sequence n →0 and normalized ψ1n,odd ∈ker(Loddn −λ1n,odd)
With lemma 2.1, we obtain an eigenvalue
λ ∈σd(L0), λ≤λ0,odd1 <minσe(L0), and a normalized eigenfunction
ψ ∈ker(L0−λ) which is γ-odd. Hence
ψ ∈ker Lodd0 −λ , and
λ=λ0,odd1 .
In view of (2.6), lemma 1.1, and theorem A.1, we conclude ψ, φoddj
This is a contradiction. With partial integration, we obtain λ,odd1
D
ψ1,odd, Poddψ1,odd E
L2(I) =λ0,odd1 D
ψ1,odd, Poddψ1,odd E
L2(I)−
s
X
j=1
D
ψ1,odd, φoddj E
L2(I)ψ1,oddφoddj 0 ∂I
. This implies
λ0,odd1 −λ,odd1
C ≤O e−
√
minσe(L0)−λ0,odd 1 4
!
, →0.
In view of dim ker(L0) = 1, we have ψ10,odd ∈ ker(L0)⊥. Corollary C.1 implies
0< λ0,odd1 .
2-(b) Suppose the contrary holds. Then there existsβ >0 and a sequencen→0 such that λ1n,odd≤minσe(L0)−β. If ψ1n,odd is a corresponding sequence of normalized eigenfunctions, then lemma 1.2 implies that
λ:= lim
n→∞λ1n,odd ∈σp(L0), λ <minσe(L0), and
ψ := lim
n→∞ψ1n,odd fulfill
ψ ∈ker(Lodd0 −λ).
This implies λ0,odd1 <minσe(Lodd0 ), which is a contradiction.
Chapter 3
Spectral analysis at the triple-junction
In this section, we analyze the spectrum of the linearization of the Allen-Cahn equation around a rescaled stationary solution. We always consider Sobolev spaces with complex valued functions.
3.1 Sobolev spaces with symmetry
Let us first define the different notions of symmetry used in this chapter.
Definition 3.1. Let m∈N. Suppose G⊂Gl(m,R) is a subgroup.
1. A subset Ω⊂Rm is called G-invariant if
∀g ∈G:g·Ω = Ω.
2. If u: Ω→ C and v : Ω→Cm are defined on a G-invariant subset Ω, then u is called G-invariant if
∀g ∈G:u◦g =u, and v is called G-equivariant if
∀g ∈G:g◦v =v◦g.
3. Let V : Ω → M(m,C) where Ω ⊂ Rm is G-invariant. The mapping V is called G-normal if
∀g ∈G:∀x∈Ω :V(x) =gV g−1x g−1.
4. If G = hgi is a cyclic subgroup of Gl(m), we write g-normal instead of hgi-normal, etc.
Our aim is to construct the Sobolev spaces that own these symmetries. We define them as the range space of orthogonal projections.
Definition 3.2. Letm∈N. AssumeG⊂O(m)is a finite subgroup, andΩ⊂Rm
Corollary 3.1. Under the assumptions of definition 3.2, the mapping PΩG is the orthogonal projection onto theG-equivariant functions in (L2(Ω,C))m, andQGΩ is the orthogonal projection onto the subspace of G-invariant elements in L2(Ω,C).
Proof. For u∈(L2(Ω,C))m, we have
Hence PΩG is a projection. Let us show that PΩG is self-adjoint. This follows from the transformation lemma. For u, v ∈(L2(Ω,C))m, we have
Now we are able to define the Sobolev spaces that own this symmetry. Later, we will see that this is the natural setting at the triple-junction.
Definition 3.3. Let k ∈N and m∈ N. Suppose G⊂O(m) is a finite subgroup and Ω⊂Rm is G-invariant.
1. Define
C0,G∞ (Ω) :=PΩG((C0∞(Ω,C))m), and
L2G(Ω) :=PΩG L2(Ω,C)m . 2. Set
HGk(Ω) :=PΩG Hk(Ω,C)m ,
and ◦
HGk (Ω) :=PΩG ◦
Hk(Ω,C) m
. 3. Use the notation
◦
HG0 (Ω) =HG0(Ω) :=L2G(Ω).
Later, we often make use of the fact that it suffices to compute the L2-norm of aG-equivariant function on a part of its domain.
Corollary 3.2. Suppose Ω ⊂ Rm is open and G-invariant. Assume U ⊂ Ω is open and γ = (γij)i,j=1,...,m ∈ G. If A is an operator in L2G(Ω), u ∈ DA, and v ∈L2G(Ω), then we have
hAu, viL2(U) =hAu, viL2(γ∗U). Moreover,
kukH1(U) =kukH1(γ∗U), u∈HG1(Ω), and
kukH2(U) =kukH2(γ∗U), u∈HG2(Ω).
Proof. As Au and v are G-equivariant, the transformation lemma implies hAu, viL2(U) =
Z
U
h(Au)(x), v(x)idx= Z
γ∗U
hγ(Au)(x), γv(x)idx = hAu, viL2(γ∗U).
Choose u∈HG1(Ω). Due to γ◦φ=φ◦γ, we have
γDφ(x) =Dφ(γx)γ (3.1)
for a.e. x∈Ω. Together with the first assertion, it follows that In order to prove the last statement, note that we have
γTD2ui(γx)γ =
As the trace is invariant under orthogonal transformations, we obtain with (3.2)
m
As γ ∈O(m), the assertion follows.
Proposition 3.1. Let k ∈ N0 and m ∈ N. Assume G ⊂ O(m) is a finite subgroup, and Ω⊂Rm is open and G-invariant. Suppose that
V ∈Cbk(Ω, M(m,C))
Proof. In order to prove the first statement, we have to show thatV ·u∈HGk(Ω) foru∈HGk(Ω). Clearly, the components of V ·u are contained in Hk(Ω,C). For x∈Ω and g ∈G, we have
(V ·u)(gx) = V(gx)u(gx) = gV(x)g−1gu(x) = gV(x)u(x) = g(V ·u)(x), i.e. V ·u is G-equivariant. In order to prove the second assertion, chooseg ∈E arbitrarily. Then
W(g−1x) =g−1X
e∈E
(ge)W0 (ge)−1x
(ge)−1g =
g−1X
e∈E
(geu)W0 (geu)−1x
(geu)−1g.
As τ :E →E is bijective, we have
W(g−1x) =g−1W(x)g, g ∈E.
For each g ∈G, there exist e1, ..., en ∈E such thatg =e1·...·en. Define Πj :=e1·...·ej, j ∈ {1, ..., n}.
Recursively, we obtain
gW(g−1x)g−1 = Πn−1W(Π−1n−1x)Π−1n−1 =...=W(x).
Let us consider the Laplace operator inL2G.
Definition 3.4. SupposeG⊂O(m) is a finite subgroup,m∈N, and let Ω⊂Rm be a open, bounded, and G-invariant subset such that ∂Ω∈C2. Define
D4 :=
u∈H2(Ω,C) : ∂u
∂ν = 0 on ∂Ω
, and
4u:=
m
X
i=1
∂2
∂x2iu.
Corollary 3.3. The operator ⊗mi=14 commutes with PΩG, i.e.
PΩG◦(⊗mi=14)⊂(⊗mi=14)◦PΩG. Especially, the restriction of ⊗mi=14 on L2G(Ω) is self-adjoint.
Proof. A straightforward calculation yields
⊗mi=14(Au◦B) =A(⊗mi=14u)◦B for A, B ∈O(m) and u∈(D4)m. This implies
PΩG(⊗mi=14)u= 1
|G|
X
g∈G
g(⊗mi=14u)◦g−1 = 1
|G|
X
g∈G
(⊗mi=14)gu◦g−1 = (⊗mi=14)PΩGu
for u ∈ (D4)m. In view of corollary B.1, the restriction of ⊗mi=14 to L2G(Ω) has domain
u∈HG2(Ω) : ∂u
∂ν = 0 on ∂Ω
and is self-adjoint.
In order to simplify the notation, let us write 4 instead of⊗mi=14as long as no confusion occurs.