This paper establishes the existence and properties of a weak global mean curvature flow for space partitions using minimizing movements, extending to driven forces and connecting with classical solutions.
Contribution
It introduces a new weak solution framework for mean curvature flow of partitions via minimizing movements, including stability and consistency results.
Findings
01
Existence of weak global mean curvature flow for partitions.
02
Extension to flows with driving forces.
03
Consistency with classical and viscosity solutions.
Abstract
We prove the existence of a weak global in time mean curvature flow of a bounded partition of space using the method of minimizing movements. The result is extended to the case when suitable driving forces are present. We also prove some consistency results for a minimizing movement solution with smooth and viscosity solutions when the evolution starts from a partition made by a union of bounded sets at a positive distance. In addition, the motion starting from the union of convex sets at a positive distance agrees with the classical mean curvature flow and is stable with respect to the Hausdorff convergence of the initial partitions.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Minimizing movements for mean curvature flow
of partitions
Giovanni
Bellettini1,2, Shokhrukh Kholmatov2,3,4
1Universitá degli studi di Siena,
Dipartimento di Ingegneria
dell’Informazione e Scienze Matematiche,
via Roma 56,
53100 Siena, Italy
We prove the existence of a weak global in time mean curvature flow
of a bounded partition of
space using the method of minimizing movements.
The result is extended to the case
when suitable driving forces are present.
We also prove some consistency results for a
minimizing movement solution with smooth and
viscosity solutions when the evolution
starts from a partition made by a union of bounded
sets at a positive distance. In addition, the
motion starting from the union of convex sets at a positive distance
agrees with the classical mean curvature flow and is stable with respect to
the Hausdorff convergence of the initial partitions.
Key words and phrases:
Mean curvature flow, partitions, minimizing movements
1. Introduction
Mean curvature evolution of partitions became popular in
recent years because of its applications in material science and
physics, especially evolutions of grain boundaries and
motion of immiscible fluid systems,
see e.g. [5, 9, 32, 41]
and references therein.
Behaviour of the motion in the two phase case, i.e.
in the case of classical motion by mean curvature of a boundary
as a gradient flow of the area functional,
is rather well-understood,
see for instance [6, 14, 20, 26, 27, 29, 40]
and references therein.
Mean curvature evolution of interfaces in the multiphase case in general involves
motion of surface junctions in Rn, or triple and multiple points in the plane,
an already nontrivial problem.
We refer to the survey [41] and references therein for
recent results on curvature evolution of planar networks.
Not much seems to be known in higher space dimensions;
short time existence of the motion of subgraph-type partitions
has been derived in [24, 25] and
well-posedness and short time existence
of the motion by mean curvature of three surface clusters have
been recently shown in [19].
Even in the two phase case,
the classical flow describes the motion only up to the
appearance of the first singularity. In order to continue the
motion through singularities, several notions of generalized solutions
have been suggested: Brakke varifold-solution [9],
the viscosity solution (see [27] and references therein),
the Almgren-Taylor-Wang [1]
and Luckhaus-Sturzenhecker
[38] solutions, the minimal barrier solution
(see [6] and references therein); we also
refer to [22, 30] for other types of solutions.
At the moment the lack of the comparison principle in the multiphase case
results in a lot of difficulties to extend
such notions as viscosity and barrier solutions, while besides Brakke solution,
some
other generalized solutions have been successfully extended
to partitions. For example, the authors
of [34] have proved
the existence of a distributional solution of mean curvature evolution of
partitions on the torus using the time thresholding method introduced in
[42], see also [21, 43]; furthermore the authors
of [31] showed the existence of a Brakke
flow.
In [17] De Giorgi generalized the Almgren-Taylor-Wang and
Luckhaus-Sturzenhecker approach
to what he called the minimizing movements method.
In the present paper, we prove the existence of a generalized minimizing
movement solution in Pb(N+1), the collection of all
partitions of Rn,n≥2, having N+1≥2 components,
with the first N-components
bounded. This is the multiphase generalization
of the evolution of a compact boundary in the two-phase case
(N=1), for which
the generalized minimizing movement solution has
been introduced and studied in [1, 38].
Let us recall the definition (see [17, 18],
also [2, 4]).
Definition 1.1** **(**Generalized minimizing
movement for partitions).**
Let Pb(N+1) be the set of all bounded (N+1)-partitions
of Rn (Definition 3.9)
endowed with the L1(Rn)-convergence, and let
F:Pb(N+1)×Pb(N+1)×[1,+∞)→[−∞,+∞] be defined as
[TABLE]
where Per(A)=21j=1∑N+1P(Aj) is the
perimeter of the partition A=(A1,…,AN+1) and
d(⋅,E) is the distance function from
E⊆Rn. We say that a map M:[0,+∞)→Pb(N+1)
is a generalized minimizing movement (shortly a GMM)
associated to F starting from
G∈Pb(N+1) and we write M∈GMM(F,G), if there exist
L:[1,+∞)×N0→Pb(N+1) and a
diverging sequence {λh} such that
[TABLE]
where the bounded partitions L(λ,k),λ≥1,k∈N0,
are defined inductively as L(λ,0)=G and
[TABLE]
When GMM(F,G) is a singleton, it is called the minimizing movement
starting from G and denoted by MM(F,G).
We shall also consider GMM associated to the functional
[TABLE]
for suitable driving forces Hi,i=1,…,N+1
(see Section 5).
Our main result is the following (see Theorems
4.9 and 5.1
for the precise
statements):
Theorem 1.2**.**
For any G∈Pb(N+1),GMM(F,G) is nonempty, i.e.
there exists a generalized minimizing movement starting
from G. Moreover,
any such movement M(t)=(M1(t),…,MN+1(t)) is locally
n+11-Hölder continuous in time;
2)
j=1⋃NMj(t)* is contained in the closed convex envelope of
the union j=1⋃NGj of the bounded components of G for any t>0.*
Finally, similar results are valid for FH.
To prove Theorem 1.2
we establish uniform density estimates for minimizers of
F and FH. A lower-type density estimate
for minimizers of F
could be proven using the slicing method for currents as
in the thesis [10], or also using the infiltration technique of
[36, Lemma 4.6] (see also [39, Section 30.2]).
In Section 3 we prove that (Λ,r0)-minimizers
of Per in Rn (Definition 3.5) satisfy uniform
density estimates using
the method of cutting out and filling in with balls,
an argument of [38].
Some consistency results of GMM starting from disjoint partitions
(Definition 6.7) with other notions of solutions
are shown in Section 6. In particular we have:
Theorem 1.3**.**
a) Let G∈Pb(N+1) be a disjoint partition and
suppose that for each i=1,…,N there exists a family of smooth sets
Li(t),t∈[0,to),
whose boundaries evolve smoothly by mean curvature in [0,to) such that
Li(0)=Gi. Then for any M∈GMM(F,G) we have
[TABLE]
b) Let G∈Pb(N+1) be a disjoint partition such that
for each i=1,…,N,∣∂Gi∣=0,
and suppose that the viscosity solution vi [11] of
[TABLE]
starting from χGic−χGi is unique. Then
GMM(F,G)={M} is a singleton and
[TABLE]
In Theorem 6.10
we also show the following stability result.
Theorem 1.4**.**
Suppose that
C=(C1,…,CN+1)∈Pb(N+1),
where C1,…,CN are convex sets whose closures are disjoint.
Then the GMM associated to F and starting from C
is the minimizing movement {M}=MM(F,C), and writing
[TABLE]
we have that each Mi(t)
agrees with the classical mean curvature flow starting from Ci,
up to the extinction time. Moreover, if a sequence {G(k)}⊂Pb(N+1)
converges to C∈Pb(N+1) in the Hausdorff distance,
then any M(k)∈GMM(F,G(k))
converges to {M}=MM(F,C) in the Hausdorff distance at
every time t≥0.
The proof of the consistency with the classical mean curvature flow
relies on the results of
[7], while for the stability in the Hausdorff distance
we employ the comparison results from [8, 12].
Our results do not apply to the case when at least two components of
a partition are unbounded, since in this case they have infinite
perimeter, and it also may happen that the right hand side of
(4.1), which allows to replace
∫EiΔFid(x,∂Fi)dx with the signed
distance function, is not well-defined.
The plan of the paper is the following.
In Section 2 we set the notation and recall some results from
the theory of finite perimeter sets. Section 3
is devoted to the definitions of partitions and
density estimates for (Λ,r0)-minimizers.
In Section 4 we prove the existence of minimizers
of F in Pb(N+1) (Theorem 4.2),
the density estimates (Theorem 4.6),
and – one of our main results – the existence of GMM for F
(Theorem 4.9).
The existence of GMM for FH is shown in
Section 5.
Finally, in Section 6
we show that any GMM starting from a disjoint partition is also disjoint
and prove Theorem 1.3 –
the consistency result with smooth mean curvature flow.
As a nontrivial application
of these facts, we show the consistency and stability
results stated in Theorem 1.4.
2. Notation and preliminaries
In this section we introduce the notation
and collect
some important properties of sets of
locally finite perimeter. The standard references
for BV-functions and sets of finite perimeter are
[3, 28].
We use N0 to denote the set of all nonnegative integers.
Given a finite subset I⊂N0, we write ∣I∣ for
the number of elements of I.
The symbol Br(x) stands for the open ball in
Rn centered at x∈Rn
of radius r>0. The characteristic function
of a Lebesgue measurable set F
is denoted by χF and its Lebesgue measure
by ∣F∣; we set also ωn:=∣B1(0)∣.
We denote by Ec the complement of E in Rn.
Op(Rn) (resp. Opb(Rn)) is the collection of all
open (resp. open and bounded) subsets of Rn.
The set of Lloc1(Rn)-functions
having locally bounded total variation in Rn is denoted by
BVloc(Rn) and the elements of
[TABLE]
are called locally finite perimeter sets.
Given a E∈BVloc(Rn,{0,1}) we denote by
a)
P(E,Ω):=∫Ω∣DχE∣ the perimeter of E
in Ω∈Op(Rn);
b)
∂E the measure-theoretic boundary of E:
[TABLE]
c)
∂∗E the reduced boundary of E;
d)
νE the outer generalized unit normal to ∂∗E.
For simplicity, we set P(E):=P(E,Rn) provided E∈BV(Rn,{0,1}).
Further, given a Lebesgue measurable set E⊆Rn and
α∈[0,1] we define
[TABLE]
Unless otherwise stated, we always suppose that any locally finite perimeter
set E we consider coincides
with E(1) (so that by [28, Proposition 3.1]
∂E coincides with the topological boundary). We recall that ∂∗E=∂E and
DχE=νEdHn−1\vruleheight=7.0pt,width=0.5pt,depth=0.0pt\vruleheight=0.5pt,width=6.0pt,depth=0.0pt∂∗E, where Hn−1 is the (n−1)-dimensional
Hausdorff measure in Rn and \vruleheight=7.0pt,width=0.5pt,depth=0.0pt\vruleheight=0.5pt,width=6.0pt,depth=0.0pt is the symbol of restriction.
Given a nonempty set E⊆Rn,d(⋅,E) stands for the distance function from E
and
[TABLE]
is the signed distance function from ∂E, negative inside E.
We also write d(A,B) to denote the distance between
A,B⊂Rn.
Given E∈BVloc(Rn,{0,1}) the map
Ω∈Op(Rn)↦P(E,Ω) extends to a Borel measure in Rn,
so that P(E,B)=Hn−1(B∩∂∗E) for every Borel set B⊆Rn.
Theorem 2.4**.**
[39, Theorem 16.3]**
If E and F are sets of locally finite perimeter, and we let
[TABLE]
[TABLE]
then E∩F,E∖F and E∪F are locally finite perimeter sets
with
[TABLE]
[TABLE]
[TABLE]
where A≈B means Hn−1(AΔB)=0.
Moreover, for every Borel set B⊆Rn
[TABLE]
[TABLE]
[TABLE]
Finally, recall that for every E,F∈BVloc(Rn,{0,1}) and Ω∈Op(Rn)
[TABLE]
3. Partitions
Now we give the notions of partition,
(Λ,r0)-minimizer and bounded partition.
The main result of this section is represented by the
density estimates for (Λ,r0)-minimizers
(Theorem 3.6).
Definition 3.1** **(Partition).
Given an integer N≥2, an N-tuple C=(C1,…,CN)
of subsets of Rn is called an N-partition*
of Rn (a partition, for short) if*
(a)
Ci∈BVloc(Rn,{0,1})* for every i=1,…,N,*
(b)
i=1∑N∣Ci∩K∣=∣K∣* for each
compact K⊂Rn.*
The collection of all N-partitions of Rn
is denoted by P(N).
Our assumptions Ci=Ci(1) implies Ci∩Cj=∅
for i=j.
Notice also that we do not exclude the case Ci=∅.
The elements of P(N) are denoted by calligraphic
letters A,B,C,… and the
components of A∈P(N) by the
corresponding roman letters
(A1,…,AN).
The functional
[TABLE]
is called the perimeter of the partition A in Ω. For simplicity,
we write Per(A):=Per(A,Rn).
We set
[TABLE]
and
[TABLE]
where Δ is the symmetric difference of sets, i.e.
EΔF=(E∖F)∪(F∖E).
We say that the sequence {A(k)}⊆P(N)converges to A∈P(N) in Lloc1(Rn) if
[TABLE]
for every compact set K⊆Rn.
Since E∈BVloc(Rn,{0,1})↦P(E,Ω)
is Lloc1(Rn)-lower semicontinuous
for any Ω∈Op(Rn), the map A∈P(N)↦Per(A,Ω)
is Lloc1(Rn)-lower semicontinuous.
The following compactness result can be proven
using [3, Theorem 3.39] and a diagonal argument.
Theorem 3.2** **(Compactness).
Let {A(l)}⊂P(N) be a sequence of partitions such that
[TABLE]
Then there exist a partition A∈P(N) and a subsequence
{A(lk)} converging
to A in Lloc1(Rn) as k→+∞.
The next result is proven for the convenience of the reader.
Proposition 3.3** **(Boundaries of “neighboring” sets).
Let A∈P(N). Then
[TABLE]
Proof.
If N=2, then
[TABLE]
hence we suppose N≥3.
There is no loss of generality in assuming i=1.
By virtue of (2.3),
there exists an Hn−1-negligible set
Z2;3⊂∂A2∪∂A3 such that
[TABLE]
Therefore,
[TABLE]
and by an induction argument, for any j∈{3,…,N}
there exists an Hn−1-negligible set
Z_{2,\ldots,j-1;j}\subset\partial\Big{(}\bigcup\limits_{h=2}^{j-1}A_{h}\Big{)}\cup\partial A_{j} such that
Since Hn−1(Ω∩∂∗Aj∩∂∗Ai) is the (n−1)-dimensional
area of the interface
between the phases Ai and Aj,Per(A,Ω) measures the total perimeter of the
interfaces in Ω.
3.1. (Λ,r0)-minimizers
In order to prove Theorem 4.6 it is
convenient to give the following definition.
Definition 3.5** ((Λ,r0)-minimizers).**
Given Λ≥0 and r0∈(0,+∞]
we say that a partition A∈P(N) is a (Λ,r0)-minimizer
of Per in Rn (a (Λ,r0)-minimizer, for short)
if
[TABLE]
whenever x∈Rn,B∈P(N),AΔB⊂⊂Br(x), and r∈(0,r0).
The crucial technical tool is the following.
Theorem 3.6** **(**Density estimates for (Λ,r0)-
minimizers).**
Let A∈P(N) be a (Λ,r0)-minimizer,
i∈{1,…,N} and
r^0:=min{r0,4(N−1)Λn} if Λ>0
and r^0:=r0 if Λ=0.
Then for any x∈∂Ai and r∈(0,r^0)
the following density estimates hold:
[TABLE]
[TABLE]
where
[TABLE]
Moreover,
[TABLE]
Proof.
We may suppose i=1. Moreover,
since ∂∗A1=∂A1, it suffices to show
(3.5)-(3.6) whenever
x∈∂∗A1. Writing Bρ:=Bρ(x) for ρ>0,
we will show that for a.e. r∈(0,r^0) one has
[TABLE]
Choose r∈(0,r^0) satisfying
[TABLE]
and define the competitor B∈P(N) as
[TABLE]
Then AΔB⊂⊂Bs for every s∈(r,r^0)
and thus, by (Λ,r0)-minimality,
[TABLE]
By the disjointness of the Aj’s we have
[TABLE]
Moreover, recalling that Aj(1)=Aj,
from the relation (2.5), (3.10) and
Hn−1(Bs∩{νAj=−νBr})=0,
we get
[TABLE]
Thus,
[TABLE]
By the disjointness of the Aj’s, Theorem 2.2
and the choice of r in (3.10),
[TABLE]
Therefore,
[TABLE]
Finally, since Hn−1(Bs∩{νA1=νBr})=0
by (3.10), from (2.6) we deduce
Set m(ρ):=∣(Rn∖A1)∩Bρ∣,ρ>0.
Since x∈∂A1, one has m(ρ)>0 for any ρ>0
and by the coarea formula (see e.g. [39, Example 13.4])
m(⋅) is absolutely continuous and
m′(ρ):=Hn−1((Rn∖A1)∩∂Bρ)
for a.e. ρ>0. Now by (3.19)
[TABLE]
Integrating this differential inequality we get
[TABLE]
i.e.
[TABLE]
which is the upper volume density estimate in (3.5).
for a.e. r∈(0,r^0). Now the left-continuity of ρ↦P(A1,Bρ)
implies the upper perimeter density estimate in (3.6).
Let us prove the lower volume density estimate. As above we may suppose
i=1 and take x∈∂∗A1. Writing Bρ:=Bρ(x) for ρ>0,
we will show that for a.e. r∈(0,r^0) one has
[TABLE]
Set
[TABLE]
Since x∈∂A1, one has I=∅.
Let r∈(0,r^0) satisfy (3.10).
By virtue of Proposition 3.3 and Remark
3.4,
[TABLE]
For every j∈I let us define the competitor B(j)∈P(N) as
[TABLE]
By the (Λ,r0)-minimality of A, for every s∈(r,r^0) one has
By (3.10), Hn−1(A1∩{νAj∩νBr})=0.
On the other hand, since Aj∩A1=∅, one has
νAj(x)=−νA1(x) for Hn−1-a.e.
x∈∂∗Aj∩∂∗A1,
and hence Hn−1(Br∩{νAj=νA1})=0.
for every E∈BVloc(Rn,{0,1}).
Hence, applying (3.26) with E=A1∩Br=E(1),
in view of
Hn−1(A1∩Br∩∂∗Aj)=0,Hn−1(A1∩∂Br∩∂∗Aj)=0 (see (3.10))
and (3.23) we have
[TABLE]
Similarly, since Aj∩A1=∅ and Aj∩∂∗A1=∅
we have Hn−1(Aj∩∂Br∩∂∗(A1∩Br))=0
for any j∈I and hence
From (3.8) it follows that Hn−1\vruleheight=7.0pt,width=0.5pt,depth=0.0pt\vruleheight=0.5pt,width=6.0pt,depth=0.0pt∂∗Ai=Hn−1\vruleheight=7.0pt,width=0.5pt,depth=0.0pt\vruleheight=0.5pt,width=6.0pt,depth=0.0pt∂Ai
for every i=1,…,N.
Remark 3.8**.**
Let x∈Rn and let Br:=Br(x),r∈(0,r^0) be any
ball such that
[TABLE]
(x not necessarily lies on j=1⋃N∂Aj).
Then comparing A with
B:=(A1∪Br,A2∖Br,…,AN∖Br)
as in the proof of Theorem 3.6 we get
The multiphase analog of a bounded phase in Rn is the following.
Definition 3.9** **(Bounded partition).
*A partition C=(C1,…,CN+1)∈P(N+1) is called
**bounded *** if Ci is bounded for each i=1,…,N.
Therefore, CN+1 is the only unbounded component of C.
We denote by Pb(N+1) the collection of all bounded partitions of Rn.
Given A∈Pb(N+1),
we denote by
[TABLE]
the closed convex hull of
i=1⋃NAi.
Since AΔB⊂⊂Rn
for every A,B∈Pb(N+1),
[TABLE]
is the L1(Rn)-distance in Pb(N+1).
The following compactness result can be proven
similarly to Theorem 3.2.
Theorem 3.10** **(Compactness).
Let {A(l)}⊂Pb(N+1)
and Ω∈Opb(Rn) be such that
[TABLE]
Then there exist A∈Pb(N+1) and a subsequence
{A(lk)} converging to A in L1(Rn) as k→+∞. Moreover,
i=1⋃NAj⊆Ω.
4. Existence of GMM
Given E,F⊆Rn set
[TABLE]
Note that σˉ(E,F)=0 if ∣EΔF∣=0 whereas σˉ(E,F)=+∞
if ∂F=∅ and ∣EΔF∣>0.
Moreover, if X,Y⊆Rn are measurable
and ∂Y=∅,
[TABLE]
Now the nonsymmetric distance between A,B∈Pb(N+1) is
defined as
[TABLE]
where N+1≥2.
Observe that for every B∈Pb(N+1) the map
σ(⋅,B) is L1(Rn)-lower semicontinuous.
Definition 4.1** **(The functional F).
We let F:Pb(N+1)×Pb(N+1)×[1,+∞)→[0,+∞]
be the functional
defined as
[TABLE]
The domain of F is independent of Z, and F
is the natural generalization of the Almgren-Taylor-Wang functional [1]
to the case of partitions [10, 18].
One can readily check that the map B∈Pb(N+1)↦F(B,A;λ)
is L1(Rn)-lower semicontinuous.
Theorem 4.2** **(Existence of minimizers of F).
Given A∈Pb(N+1) and λ≥1 the problem
[TABLE]
has a solution. Moreover, every minimizer A(λ)=(A1(λ),…,AN+1(λ))
satisfies the bound
[TABLE]
Proof.
Given a partition B∈Pb(N+1) define the competitor B′∈Pb(N+1) as
[TABLE]
Since co(A) is convex and closed, by the comparison theorem of
[2, page 152] we have
P(Bi)≥P(Bi∩co(A)) for i=1,…,N,
and
[TABLE]
with equality if and only if
∣i=1⋃NBi∖co(A)∣=0.
In addition, for i=1,…,N,
[TABLE]
where we used the nonnegativity of the distance function and
Ai∖Bi=Ai∖(Bi∩co(A)).
The equality in (4.4) holds if and only if
\Big{|}\bigcup\limits_{i=1}^{N}B_{i}\setminus\mathrm{co}(\mathcal{A})\Big{|}=0.
For the same reason, since AN+1c=i=1⋃NAi⊆co(A),
[TABLE]
So we have
[TABLE]
and the inequality is strict whenever
\Big{|}\bigcup\limits_{i=1}^{N}B_{i}\setminus\mathrm{co}(\mathcal{A})\Big{|}>0.
Let {B(k)}⊆Pb(N+1) be a minimizing sequence, which
can be supposed so that co(B(k))⊆co(A)
and F(B(k),A;λ)≤F(T,A;λ),T:=(∅,…,∅,Rn) being the trivial partition, so that
[TABLE]
By Theorem 3.10 there exists A(λ)∈Pb(N+1)
such that (passing to a not relabelled subsequence)
B(k)→A(λ) in L1(Rn) as k→+∞.
Then the L1(Rn)-lower semicontinuity
of F(⋅,A;λ)
implies that A(λ) is a solution to (4.2).
Now let A(λ) be a minimizer of F(⋅,A;λ).
If \big{|}\bigcup\limits_{j=1}^{N}A_{j}(\lambda)\setminus\mathrm{co}(\mathcal{A})\big{|}>0
then, as shown above,
F(A(λ),A;λ)>F(A(λ)′,A;λ),
where A(λ)′ is defined as
in (4.3), which contradicts the minimality of A(λ).
∎
Remark 4.3**.**
Let C⊆Rn be a compact convex set. Suppose that
G∈Pb(N+1) satisfies j=1⋃NGj⊆C;
from Theorem 4.2 it follows that
every minimizer A(λ)∈Pb(N+1) of F(⋅,G;λ)
satisfies co(A(λ))⊆C.
This gives an a priori bound
for minimizers of F(⋅,G;λ) just from a
bound for the initial partition and will be
used in the proofs of Theorems 4.9 and
5.1.
Remark 4.4**.**
Suppose that G∈Pb(N+1) and Gi=∅ for some
i∈{1,…,N}. Then by definition of σˉ
every minimizer A(λ)∈Pb(N+1) of F(⋅,G;λ)
satisfies Ai(λ)=∅. In particular, for
G=(G,∅,…,∅,Rn∖G),
the GMM problem for F(⋅,G;λ) agrees with the
GMM problem for the Almgren-Taylor-Wang functional
[TABLE]
Proposition 4.5** **(**Behaviour of A(λ) as time
goes to [math]).**
Let A∈Pb(N+1) be such that j=1∑N+1∣Aj∖Aj∣=0, and A(λ)
be a minimizer of F(⋅,A;λ).
Then:
a)
λ→+∞lim∣A(λ)ΔA∣=0,**
b)
λ→+∞limPer(A(λ))=Per(A),**
c)
λ→+∞limλσ(A(λ),A)=0.**
Proof.
a) Choose any sequence λk→+∞.
Since F(A(λk),A;λk)≤F(A,A;λk)=Per(A),
we have Per(A(λ))≤Per(A) and
[TABLE]
Moreover, by Theorem 4.2co(A(λ))⊆co(A), therefore Proposition
3.10 yields the existence of a subsequence
{λkl}l and of B∈Pb(N+1) such that
A(λkl)→B in L1(Rn) as l→+∞.
Now the lower semicontinuity of σ(⋅,A) and (4.6)
imply σ(B,A)=0. Then from the assumption on A we get
A=B. Since λk is arbitrary, a) follows.
b) Since Per(A(λ))≤Per(A), from a) we obtain
[TABLE]
c) From b) we have
[TABLE]
∎
Theorem 4.6** **(Density estimates).
Suppose that A∈Pb(N+1) and let A(λ)∈Pb(N+1)
be a minimizer of
F(⋅,A;λ). Then for every i∈{1,…,N+1}
[TABLE]
[TABLE]
for any x∈∂Ai(λ) and r∈(0,min{1,2λN(diamco(A)+2)n}), where
cn,N+1 is defined in (3.7) (with N+1 in place of N).
Moreover
[TABLE]
Proof.
Without loss of generality, we may suppose ∂Ai=∅ for every
i=1,…,N+1.
Fix r0>0. Then for every x∈Rn
and C∈Pb(N+1) such that CΔA(λ)⊂⊂Bρ(x) with
ρ∈(0,r0), by Theorem 4.2 one has
[TABLE]
Therefore the minimality of A(λ) implies
[TABLE]
i.e.
[TABLE]
Now application of Theorem 3.6 to A(λ)
with r0=1 finishes the proof.
∎
Remark 4.7**.**
The density estimates show that the components of A(λ) are
Lebesgue-equivalent to open sets. Indeed, since
using E∖E⊂∂E, and
E∖E˚⊂∂E
(G˚ being the interior of G),
we have
[TABLE]
Now by the density estimates j=1∑N+1∣∂Aj(λ)∣=0,
and therefore j=1∑N+1∣Aj(λ)ΔAj(λ)˚∣=0.
To prove the existence of GMM, we need the following
corollary of Theorem 4.6.
Corollary 4.8**.**
Let ε>0 and suppose that
the components of A∈Pb(N+1) satisfy the density estimates
(4.7)-(4.8) for all
r∈(0,ε].
Then for every minimizer A(λ) of F(⋅,A;λ)
in Pb(N+1) one has
[TABLE]
Proof.
Fix ℓ≥ε and i∈{1,…,N+1} and
set
[TABLE]
By the Chebyshev inequality,
[TABLE]
We cover the set F with a family
{Bℓ(x):x∈∂Ai}
of closed balls. By the Vitali lemma, there exists
a finite subset {Bℓ(xj)}j of the covering,
consisting of disjoint balls, such that
F⊂j⋃B5ℓ(xj). Since
by assumption
Ai satisfies the lower perimeter density estimate in
(4.8) with r=ε,
[TABLE]
Thus,
[TABLE]
Now (4.9) follows summing (4.10)
with respect to i.
∎
One of the main results of the present paper reads as follows.
Theorem 4.9** **(Existence of GMM).
Let G∈Pb(N+1). Then GMM(F,G) is non empty. Moreover,
there exists a constant c=c(N,n,G)>0 such that
for any M∈GMM(F,G),
[TABLE]
and
[TABLE]
In addition, if j=1∑N+1∣Gj∖Gj∣=0, then (4.11) holds for any
t,t′≥0 and ∣t−t′∣<1.
Proof.
Set 2R:=diamco(G).
Let L(λ,k)=(L1(λ,k),…,LN+1(λ,k)),λ≥1,k∈N0 be defined as follows:
L(λ,0):=G, and for k≥1
[TABLE]
recall that the existence of minimizers follows from
Theorem 4.2 and also
Therefore, the sequence k∈N0↦Per(L(λ,k))
is nonincreasing, and
Per(L(λ,k))≤Per(G)
for all k∈N0 and λ≥1, since L(λ,0)=G.
For every t,t′>0,0<t−t′<1 let us prove
[TABLE]
provided that λ is sufficiently large depending on ∣t−t′∣,n,N and R,
where
[TABLE]
Set
k0:=[λt′],m0:=[λt].
Let λ≥max{4(R+1)Nn,∣t−t′∣1} be so large
that m0≥k0+3≥4 and
4λN(R+1)∣t−t′∣αn<1,α:=n+11.
Since each L(λ,k),k≥1, satisfies the density
estimates (4.7)-(4.8)
(Theorem 4.6) for
r∈(0,4λN(R+1)n),
we may apply Corollary 4.8 with
ℓ=4λN(R+1)∣t−t′∣αn
and ε=4λN(R+1)n,
the inequality Per(L(λ,k))≤Per(G)
and (4.14) to get
[TABLE]
Since
[TABLE]
from the choice of α and
the bound Per(L(λ,k))≤Per(G),
we establish
Now we prove the assertions of the theorem.
Using the inclusion (4.13), the inequality
Per(L(λ,k))≤Per(G),
Proposition 3.10 and a diagonal argument we obtain
the existence of a diverging sequence {λh} and
M(t)∈Pb(N+1) such that
[TABLE]
for every rational t>0 and also (4.12) holds.
By (4.15) M(t) satisfies
[TABLE]
Hence this map extends uniquely to a map {M(t):t>0}⊆Pb(N+1)
satisfying (4.11) and (4.12).
To show that M∈GMM(F,G) it remains
only to prove (4.17) for any t≥0.
Case t=0 is trivial: M(0)=G.
Fix t>0.
For every ε∈(0,1)
take tε∈Q∩(0,+∞)
such that ∣t−tε∣<εn+1 (recall that
(4.17) holds with tε).
Since M satisfies (4.11), from (4.15)
and (4.17) (applied with tε) we deduce
[TABLE]
and the assertion is obtained letting ε→0+.
Finally, let j=1∑N+1∣Gj∖Gj∣=0. Given t∈(0,1), choosing
λ sufficiently large, from (4.15) we get
[TABLE]
Now letting λ→+∞ and
using Proposition 4.5 a) we establish
[TABLE]
∎
In order to improve the Hölder exponent n+11 to the value 21
in (4.11) we expect to be useful,
for minimizers A(λ) of F(⋅,A;λ),
an estimate of the form
[TABLE]
We miss the proof of such an estimate; however,
a partial result in this direction is given in Lemma 6.9.
5. Existence of GMM in the
presence of external forces
In this section we consider the problem of
the mean curvature evolution of bounded partitions with
forcing terms.
Given A∈Pb(N+1) and measurable functions
Hi:Rn→R,i=1,…,N+1,
consider the functional
[TABLE]
When N=1 and H2=0, we get the
Almgren-Taylor-Wang functional with an external
force H1.
We suppose:
[TABLE]
in particular FH(⋅,A;λ) is well-defined and
L1(Rn)-lower semicontinuous.
In the two-phase case (N=1), evolutions with a
forcing term H depending on both
position and time have been studied
for example in [35, 38]
(with H∈C∞(Ω×[0,T]) and
Ω⊂Rn bounded),
in [13] (with discontinuous H and
∫0tH(x,s)ds locally
Lipschitz in x and continuous in t);
see also references therein.
The aim of this section is to prove the following result,
generalizing Theorem 4.9.
Theorem 5.1**.**
Suppose that Hi:Rn→R,i=1,…,N+1, satisfy (5.1) and
let G∈Pb(N+1). Then GMM(FH,G) is non empty. Moreover,
there exists a constant C=C(N,n,G,p,H1,…,HN+1)>0
such that for any M∈GMM(FH,G)
[TABLE]
and
[TABLE]
In addition, if j=1∑N+1∣Gj∖Gj∣=0, then (5.2) holds for any
t,t′≥0 and ∣t−t′∣<1.
Proof.
Step 1. Given A∈Pb(N+1), the problem
[TABLE]
has a solution.
Let D stand for the closed convex hull of co(A)∪BR(0)
and for every B∈Pb(N+1) define the competitor B′∈Pb(N+1) as
[TABLE]
Observe that
[TABLE]
By Remark 4.3 we have
F(B,A;λ)≥F(B′,A;λ),
with the equality if and only if \big{|}\bigcup\limits_{j=1}^{N}B_{j}\setminus D\big{|}=0.
Since Hj≥HN+1 a.e. in Rn∖D, one has also
[TABLE]
Therefore, (5.4) implies
FH(B,A;λ)≥FH(B′,A;λ) with
the strict inequality when \big{|}\bigcup\limits_{j=1}^{N}B_{j}\setminus D\big{|}>0.
Now proceeding as in the proof of Theorem 4.2
we can show that there exists a minimizer of FH(⋅,A;λ).
Moreover, every minimizer A(λ) satisfies
[TABLE]
Now we prove the density estimates for A(λ).
Step 2.
Let us fix r0∈(0,R) and take any B∈Pb(N+1) with
A(λ)ΔB⊂⊂Br,r∈(0,r0).
We show
Now the proofs of (5.2) and (5.3) are
exactly the same as in
the proof of Theorem 4.9.
Step 4. Finally, let us show that if j=1∑N+1∣Gj∖Gj∣=0, then (5.2) holds for any
t,t′≥0,∣t−t′∣<1. We need just to show that
∣L(λ,1)ΔG∣→0 as λ→+∞, and then we proceed
as in the proof of the final assertion of Theorem 4.9.
Using the minimality of L(λ,1) we have
FH(L(λ,1),G;λ)≤FH(G,G;λ), i.e.
[TABLE]
Choose an arbitrary diverging sequence {λk}.
By (5.8) it follows Per(L(λk,1))≤κ for any k≥1
and since j=1⋃NLj(λk,1)⊆K,
by Theorem 3.10 there exists a (not relabelled) subsequence
and A∈Pb(N+1) such that L(λk,1)→A in L1(Rn)
as k→+∞. Then the L1(Rn)-lower semicontinuity of
σ and (5.10) yield
[TABLE]
Hence σ(A,G)=0 and by the assumption of G we have A=G.
Since {λk} is arbitrary, L(λ,1)→G in L1(Rn)
as λ→+∞.
∎
6. Evolution of disjoint partitions
In this section we study the evolution of disjoint partitions
and the compatibility results of GMM starting from the disjoint
initial partition with other notions of solution.
6.1. Some comparison results for the 2-phase case (N=1)
Let us start with recalling some comparison arguments
for the Almgren-Taylor-Wang functional
A(⋅,⋅;λ) in
(4.5) from
[8, Section 6] and [12, Section 6].
Define
[TABLE]
[TABLE]
Notice that A(⋅,⋅;λ) is well-defined
for both Mb and Mu.
The following result is well-known, and is a particular case of Theorem
4.2 (applied with N=1).
Proposition 6.1**.**
Given G∈Mb (resp. G∈Mu) and λ≥1
the problem
[TABLE]
has a solution.
Moreover, any minimizer G(λ) satisfies the inclusion
[TABLE]
Proposition 6.2** **(**Maximal and minimal minimizers
Given E∈Mb (resp. E∈Mu) and
λ≥1 there exist the
maximal and the minimal minimizer E(λ)∗ and
E(λ)∗ of A(⋅,E;λ), in the sense that
any other minimizer E(λ) satisfies
[TABLE]
Given a set E⊂Rn and ε>0 we write
[TABLE]
We recall the following comparison principles for the minimizers of
A from [12, section 6], see also [8, Section 6].
Theorem 6.3** **(Comparison principles).
Let ε>0,E,F∈Mb (or E,F∈Mu or
E∈Mb and F∈Mu) be such that
[TABLE]
Then
[TABLE]
for every λ≥1 and every minimizer E(λ) and F(λ) of
A(⋅,E;λ) and A(⋅,F;λ), respectively.
Moreover,
[TABLE]
Corollary 6.4**.**
Suppose that E,F∈Mb are such that
[TABLE]
Then for any λ≥1,
every minimizer E(λ) (resp. F(λ)) of
A(⋅,E;λ) (resp. A(⋅,F;λ))
satisfies
[TABLE]
Definition 6.5** **(Minimal and maximal GMM associated with a sequence).
For E∈Mb,{E∗(t)}∈GMM(A,E)
(resp. {E∗(t)}∈GMM(A,E)) is called the minimal
(resp. the maximal) GMM associated with a sequence {λk}
if
[TABLE]
where E(λ,0)∗=E(λ,0)∗=E, and
E(λ,l)∗ (resp. E(λ,l)∗),
λ≥1 and l∈N, is the minimal (resp. maximal)
minimizer of A(⋅,E(λ,l−1)∗;λ)
(resp. A(⋅,E(λ,l−1)∗;λ)).
The minimal and maximal GMM satisfy the following comparison theorem
[8, Theorem 7.3].
Theorem 6.6** **(Comparison for minimal and maximal GMM).
Let E,F∈Mb,E⊆F and let {E(t)∗}
(resp. {E(t)∗}) be the minimal (resp. maximal) GMM associated with
a same sequence {λk}. Then
[TABLE]
6.2. Evolution of disjoint partitions
Now we study the evolution of disjoint partitions.
Definition 6.7** **(Disjoint partitions).
A partition A∈Pb(N+1) is called disjoint provided
[TABLE]
Notice that if A∈Pb(N+1) is disjoint, then
Per(A)=j=1∑NP(Aj).
Moreover, if A and G are disjoint and satisfy
[TABLE]
then σ(A,G)=2j=1∑N∫AjΔGjd(x,∂Gj)dx
and
[TABLE]
In the next two lemmas, no disjointness hypothesis is assumed.
The proof of the following lemma is an adaptation of the proof
of Theorem 3.6.
Lemma 6.8**.**
Given G∈Pb(N+1), let G(λ)∈Pb(N+1) be a
minimizer of F(⋅,G;λ). Fix i∈{1,…,N+1}.
If x∈Gi(λ)c∩Gi and
d(x,∂Gi)≥ρ>0, then
[TABLE]
Proof.
Without loss of generality
we suppose i=1. As usual, write Br:=Br(x) and set
[TABLE]
Clearly, if I=∅, then
Bρ⊆G1(λ)c and (6.9) is satisfied,
hence we can suppose I=∅.
Fix any r∈(0,ρ) such that
[TABLE]
For each j∈I define the competitor C(j)∈Pb(N+1) as
[TABLE]
Fix s∈(r,ρ). Arguing as in
the proofs of (3.27) and (3.13),
Hence the inequality F(G(λ),G;λ)≤F(C(j),G;λ) due to the minimality of
G(λ) and (4.1)
imply
[TABLE]
Since by assumption Bρ⊆G1 (and hence Bρ∩Gj=∅) we have
[TABLE]
and therefore
[TABLE]
Then summation of (6.14) over j∈I and the
use of Remark 3.4
yield
[TABLE]
Now adding Hn−1(G1(λ)c∩∂Br) to both sides
we get
[TABLE]
From the isoperimetric inequality, for a.e. r∈(0,ρ) we obtain
[TABLE]
Since x∈G1(λ)c, one has ∣G1(λ)c∩Br∣>0 for any r>0,
therefore integrating (6.15) in (0,ρ),
we get (6.9).
∎
Lemma 6.9**.**
Given G∈Pb(N+1) let G(λ)∈Pb(N+1)
be a minimizer of F(⋅,G;λ).
Then for any i∈{1,…,N+1},
[TABLE]
Proof.
Without loss of generality we suppose i=1.
By contradiction, let x∈G1(λ)c∩G1 be such that
d(x,∂G1)≥ρ:=λ2n+2n+ε
for some ε>0. We may suppose that
x∈∂G1(λ) and ε are such that
[TABLE]
where Bρ:=Bρ(x). Then the set
[TABLE]
is nonempty. By assumption on x and ρ,Bρ/2(y)⊂G1 for every y∈Bρ/2,
and hence
[TABLE]
Therefore, for each j∈J,
defining the competitor as in (6.11) with r=ρ/2,
from the minimality of G(λ), (4.1)
and (6.12)
we get
[TABLE]
since d~(y,∂Gj)=d(y,∂Gj) and
d~(y,∂G1)=−d(y,∂G1) for any y∈Bρ/2.
Summing these inequalities over j∈J and using
j=1⋃N+1(Gj(λ)∩Bρ/2)=j∈J⋃(Gj(λ)∩Bρ/2)=G1(λ)c∩Bρ/2
(up to a negligible set), we get
and clearly, \mathcal{H}^{n-1}(G_{1}(\lambda)^{c}\cap\partial B_{\rho/2})\leq n\omega_{n}\Big{(}\frac{\rho}{2}\Big{)}^{n-1}.
Therefore,
ρ=λ2n+2n+ε≤λ2n+2n,
a contradiction, since ε>0.
∎
The following theorem shows that if
the components of the initial partition
G are far from each other, then so are the components of minimizers of
F(⋅,G;λ), provided λ is large enough.
Theorem 6.10** **(**Minimizers of F for a
disjoint initial partition).**
Suppose that G∈Pb(N+1) is disjoint and set
[TABLE]
Then for λ>2n+6nε0−2 any minimizer G(λ)
of F(⋅,G;λ) satisfies
[TABLE]
Proof.
We claim that the choice of λ implies
[TABLE]
Indeed, obviously GN+1(λ)c∩GN+1c⊆(GN+1c)ε0/4+.
Now if x∈GN+1(λ)c∩GN+1, then
d(x,GN+1c)=d(x,∂GN+1) and therefore
by Lemma 6.9
We prove (6.17) arguing by contradiction.
Suppose for example j=1 and G1(λ) is not contained in
(G1)ε0/4+. In view of (6.18)
and (6.16)
[TABLE]
Since G1(λ)∖(G1)ε0/4+=∅,
(6.19) implies
G1(λ)∩(Gj)ε0/4+=∅
for some j∈{2,…,N}.
By virtue of Remark 4.7 the set
G1(λ) can be supposed to be open so that there exists
a ball Br of radius r>0 whose closure is
contained in G1(λ)∩(Gj)ε0/4+.
For shortness, let j=2.
Thus setting B:=(G1(λ)∖Br,G2(λ)∪Br,G3(λ),…,GN+1(λ)), and using
P(G1(λ))−P(G1(λ)∖Br)=P(Br),
we obtain
[TABLE]
Now,
[TABLE]
In addition, by the definition of ε0,d(⋅,G1)≥43ε0 in Br
(thus d~(⋅,∂G1)=d(⋅,∂G1) in Br);
moreover, since Br⊆(G2)ε0/4+,
one has
[TABLE]
and therefore
[TABLE]
This implies that G(λ) is not a minimizer of F(⋅,G;λ).
∎
Corollary 6.11**.**
Suppose that G∈Pb(N+1) is disjoint and let ε0
be as in (6.16).
Then for λ sufficiently large (depending only on
ε0 and n),
G(λ) is a minimizer of F(⋅,G;λ) if and only if
each bounded component Gj(λ),j=1,…,N, of G(λ)
is a minimizer of A(⋅,Gj;λ).
Moreover, every minimizer G(λ) satisfies
[TABLE]
Proof.
By [38, Lemma 2.1]
there exists c(n)>0 (depending only on n) such that
for every λ≥1 and every minimizer
Aj(λ),j=1,…,N,
of A(⋅,Gj;λ) one has
[TABLE]
Therefore, taking
[TABLE]
we deduce
Aj(λ)⊆(Gj)ε0/4+,j=1,…,N.
Set A(λ)=(A1(λ),…,AN(λ),Rn∖j=1⋃NAj(λ)).
Let us show that for
λ as in (6.21),
A(λ) minimizes F(⋅,G;λ). Indeed, take any
minimizer G(λ) of F(⋅,G;λ).
By Theorem 6.10 we have
Gj(λ)⊆(Gj)ε0/4+, therefore
both (A(λ),G) and (G(λ),G) satisfy (6.7).
Hence, (6.8) and the minimality of Aj(λ) yield
[TABLE]
This implies that A(λ) is also a minimizer F(⋅,G;λ).
Conversely, suppose that λ satisfies (6.21) and
G(λ) minimizes F(⋅,G;λ)
and let Aj(λ),j=1,…,N, be a
minimizer of A(⋅,Gj;λ).
By (6.17), Aj(λ)⊆(Gj)ε0/4+,j=1,…,N. Set A(λ)=(A1(λ),…,AN(λ),Rn∖j=1⋃NAj(λ)).
Then from the minimality of Aj(λ) and G(λ), as well as
(6.8), we deduce
[TABLE]
Thus all inequalities are in fact equalities, which is possible
if and only if
[TABLE]
for any j=1,…,N.
Hence, Gj(λ) is a minimizer of A(⋅,Gj;λ).
Finally, (6.20) directly follows from
Corollary 6.4.
∎
Theorem 6.12** **(Evolution of disjoint partitions).
Assume that G∈Pb(N+1) is disjoint,
and {M}={(M1,…,MN+1)}∈GMM(F,G).
Then Mi∈GMM(A,Gi) for any i=1,…,N. In particular,
there exists C(n)>0 such that
[TABLE]
Proof.
Let εo>0 be defined as in (6.16)
and take co:=co(n,εo)
so that Corollary 6.11 holds for λ>co.
Let M∈GMM(F,G) and let
[TABLE]
where L(λ,k) is defined as L(λ,0):=G, and
L(λ,k),k≥1, is a solution of
[TABLE]
and {λl}l∈N is a diverging sequence.
By induction on k≥1, and by Corollary 6.11,
one can show that
[TABLE]
for all λ>co and k≥1.
Therefore, by virtue of Corollary 6.11, for every k≥1
and λ>co, each Li(λ,k),i=1,…,N,
minimizes A(⋅,Li(λ,k−1);λ). Moreover,
from (6.23) we obtain
[TABLE]
Since Li(λ,0)=Gi,
from Definition 1.1 we obtain Mi∈GMM(A,Gi).
Finally, by [8, 38], there exists
C(n)>0 such that each Mi∈GMM(A,Gi),i=1,…,N,
satisfies
[TABLE]
Now (6.22) follows summing (6.25)
in i=1,…,N, and using
∣AΔB∣≤2i=1∑N∣AiΔBi∣.
∎
Remark 6.13**.**
Let Mi∈GMM(A,Gi),i=1,…,N, and
{λl} be a diverging sequence such that
[TABLE]
where Li(λ,k) is defined as Li(λ,0):=Gi and Li(λ,k),k≥1,
is a solution of
[TABLE]
Applying an induction argument on
k and Corollary 6.4,
we establish (6.24) for all λ≥co and k≥1.
Therefore, again an induction argument on k≥1
and Corollary 6.11 imply that the partition
L(λ,k) defined for such λ and k as
[TABLE]
minimizes F(⋅,L(λ,k);λ).
Finally, if we denote by M the partition whose bounded
components are Mi,i=1,…,N, then
by (6.26),
a) follows combining [1, Theorem 7.4]
and Theorem 6.12,
whereas b) is a consequence of Theorem 6.12 and
[11, Theorem 4].
∎
One can say more about the evolution of convex disjoint partitions.
Definition 6.14** **(Convex disjoint partitions).
A disjoint partition A∈Pb(N+1) is called convex if the bounded
components of A are convex.
We define the Hausdorff distance between two
partitions A,B∈Pb(N+1) as
[TABLE]
where HD(Ai,Bi) denotes the Hausdorff
distance between Ai and Bi.
Theorem 6.15** **(**Evolution and stability of convex
disjoint partitions).**
Assume that C∈Pb(N+1) is disjoint and convex.
Then
[TABLE]
is a singleton.
In particular, for any i,j∈{1,…,N},i=j, the function
[TABLE]
is nondecreasing.
Moreover, for any i=1,…,N,Mi(⋅)
agrees with the classical mean curvature flow starting from
Ci up to its extinction time ti† [29].
Finally, if the sequence {G(h)}⊂Pb(N+1)
converges to C in the Hausdorff distance HD as h→+∞, then
for any M(h)∈GMM(F,G(h)),
[TABLE]
Proof.
The first part of the theorem follows
from Theorem 6.12
and [7, Corollary 5].
Before proving the second part of the theorem,
we show the following stability property of convex sets.
Claim. Let C⊂Rn be a nonempty
bounded convex set and let
{G(h)} be a sequence of sets of finite perimeter
converging to C in the Hausdorff distance as
h→+∞. Then
[TABLE]
where G(h)(t) and C(t) are Almgren-Taylor-Wang solutions
starting from G(h) and C respectively (recall that C(⋅) is
unique [7, Corollary 5]), and tC† is
the extinction time of C.
Indeed, consider arbitrary
sequences {A(l)},{B(l)} of nonempty bounded
convex sets such that
A(l)⊂⊂C⊂⊂B(l),l≥1,
and A(l),B(l)→HDC as l→+∞.
Then for any l≥1, there exists hl∈N such that
A(l)⊆G(h)⊆B(l) for any h>hl.
We may suppose that hl→+∞ as l→+∞.
Let A(l)(t) (resp. B(l)(t)) be the minimizing movement
starting from A(l) (resp. B(l)) for the
Almgren-Taylor-Wang functional (4.5)
and G(h)(t)∗ and G(h)(t)∗
be the maximal and minimal GMMs (Definition 6.5)
for (4.5) starting from G(h),
so that G(h)(t)∗⊆G(h)(t)⊆G(h)(t)∗
for all t≥0. By Theorem 6.6,
A(l)(t)⊆G(h)(t)∗ and
G(h)(t)∗⊆B(l)(t) for any t≥0 and h>hl.
Moreover, from [7, Theorem 12]
we have A(l)(t),B(l)(t)→HDC(t)
as l→+∞ for any t∈[0,tC), and since hl→+∞,
(6.28) follows.
Now we prove the second part of Theorem 6.15.
Since the partition C is disjoint and HD(G(h),C)→0
as h→+∞, one has that G(h) is also disjoint provided
h is large enough. Let M(h)∈GMM(F,G(h));
by Theorem 6.12Mi(h)∈GMM(A,Gi(h)),i=1,…,N, and
therefore by virtue of Gi(h)→HDCi and
the previous claim,
Mi(h)(t)→HDMi(t),i=1,…,N, as h→+∞
for any t∈[0,ti†).
∎
Acknowledgements
The first author is partially supported by GNAMPA of INdAM.
Bibliography43
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] F. Almgren, J. Taylor, L. Wang: Curvature-driven flows: a variational approach. SIAM J. Control Optim. 31 (1993), 387-438.
3[3] L. Ambrosio, N. Fusco, D. Pallara: Functions of Bounded Variation and Free Discontinuity Problems. Oxford University Press, New York, 2000.
4[4] L. Ambrosio, N. Gigli, G. Savaré: Gradient Flows in Metric Spaces and in the Space of Probability Measures. Birkhäuser-Verlag, Basel, 2008.
5[5] J. Ball, D. Kinderlehrer, P. Podio-Guidugli, M. Slemrod: Fundamental Contributions to the Continuum Theory of Evolving Phase Interfaces in Solids. Springer-Verlag, Berlin, 1999.
6[6] G. Bellettini: Lecture Notes on Mean Curvature Flow, Barriers and Singular Perturbations. Publications of the Scuola Normale Superiore di Pisa, Vol. 12, 2013.
7[7] G. Bellettini, V. Caselles, A. Chambolle, M. Novaga: Crystalline mean curvature flow of convex sets. Arch. Ration. Mech. Anal. 179 (2006), 109-152.
8[8] G. Bellettini, Sh. Kholmatov: Minimizing movements for mean curvature flow of droplets with prescribed contact angle. J. Math. Pures Appl., to appear.