1. Introduction
A fundamental problem in thermodynamics is proving the convexity of minimizers to the free-energy minimization with mass constraint. The free energy
of a set of finite perimeter
with a reduced boundary
is defined via the surface energy
and the potential energy
where
f (i.e., the surface tension) is a convex positively 1-homogeneous
with
if
,
,
:
The following problem is historically attributed to Almgren.
Problem: If the potential
g is convex (or, more generally, if the sub-level sets
are convex), are the minimizers convex or, at least, connected? [
1] (p. 146).
Mathematically, the central purpose is to investigate the minimization problem
Historically, this is one of the most complex problems to analyze and one of the most important problems in physics. The physical principle connecting minimizers
to crystals was independently discovered by Gibbs in 1878 [
2] and Curie in 1885 [
3]. When the energy minimization is the surface-area minimization, the solution is the convex set
called the Wulff shape. Only a handful of convexity results exist with a potential energy for all
, even in two dimensions. In two recent papers, Indrei (i) proved that in one dimension, assuming solely that the sub-level sets
are convex, there exist minimizers for all masses
and all minimizers are intervals [
4]; (ii) proved that if
, there are convex functions
,
, so that there are no minimizers for
[
5] (the figure in the paper illustrates the main idea: the potential energy is reduced via translation). Observe the general partition of the convexity problem into coercive (e.g., the monotone radial potential) and non-coercive potentials (e.g., the gravitational potential). Supposing
, under additional assumptions, the first author proved convexity for all
[
5] (cf. [
6]). The tools include geometric results in the plane related to convex hulls, the first variation formula for the anisotropic surface energy, a perturbation technique, and density estimates. In the argument, the planar context is crucial; some of the theorems do not have higher dimensional extensions. Recently, the authors proved a sharp quantitative inequality for the isotropic radial Almgren problem (
) in
[
7]. One thus has additional information on the geometry of almost-minimizers. The theorem we obtained in [
7] is the first positive result for all
on the stability and convexity for a large class of potentials in higher dimension.
For
, the stability appeared in [
8] with an explicit modulus; in [
9] for
and the isotropic case with a semi-explicit modulus; and, in [
5] for
m small with a semi-explicit modulus and a locally bounded potential.
Naturally, in physics, the most important dimension is . We introduce a new method to prove:
Theorem 1. If is convex, is elliptic, and admit minimizers with , then exactly one of the following is true:
- (i)
is convex for all ;
- (ii)
there exists & for all , is convex and there is a modulus and two constants , such that for all ,
Our theorem implies convexity for a large collection of potentials; our argument is also inclusive of non-convex potentials. The main element of this involves estimating the modulus. One class of
where the convexity holds is:
,
,
is increasing,
. The main reason is that then for any
,
,
ref. [
7] and therefore, for all
,
which precludes (ii) in Theorem 1. Therefore, if
,
,
is increasing,
, then (i) is true.
Our new idea for the three-dimensional Almgren problem is to utilize a stability theorem when
m is small [
5] (see Theorem A1), convexity when
m is small, and the first variation in the free-energy PDE with a new maximum principle approach. The maximum principle argument is to show that if
u is a convex function which encodes a convex minimizer in a neighborhood and
for some
, then
for all
. The first variation PDE (
2) connects the function
u with a partial differential equation via the potential and mean curvature.
Assuming
g is coercive, the existence of a minimizer
is true. Nevertheless, in certain configurations, one may prove the existence result for non-coercive potentials, e.g., the gravitational potential. In a gravitational field, the equilibrium for liquids was studied by Laplace [
10]. Supposing the surface tension is isotropic, uniqueness and convexity were obtained by Finn [
11] and Wente [
12]. Assuming
, under a wetting condition, the anisotropic tension was investigated by Avron, Taylor, and Zia, employing quadrature [
13]. The research was motivated by low-temperature experiments on helium crystals in equilibrium with a superfluid [
14]. Also, various phase-transition experiments were conducted in [
15].
The stability result contains an invariance collection. Define
An invariance map of the free energy is a transformation
. The uniqueness of minimizers can only be true mod sets of measure zero and an invariance map generated by the mass, potential, and tension. In many classes of potentials, assuming
m is small,
is a translation
,
. For example, suppose
g is zero on a ball
B. If
m is small, note that uniqueness can only be shown up to a translation:
,
is such that
when
(
is the Wulff shape, such that
[
5]). The three transformations, reflection, rotation, and translation, always satisfy closure under convexity:
is convex if
E is convex.
2. Proof of Theorem 1
Define
Theorem A1 and Theorem 2 in Figalli and Maggi [
1] imply
. Hence,
. In addition, one may assume the invariance maps are closed under convexity. If
, for
,
is unique and convex. Therefore, either (a) there exists a non-convex minimizer with the mass
; (b) there exist two convex minimizers not mod an invariance map equal, with the mass
; or (c) for all
,
is unique, convex, and for
, there exists
such that either convexity or uniqueness fails for minimizers with mass
a. If
,
, along a subsequence,
, with
,
as a convex minimizer. Set
where if (a) is valid,
is the non-convex minimizer, and if (b) is true,
is a convex minimizer not (mod invariance transformations) equal to
. If
, the uniqueness of convex minimizers implies that there exists
such that for all
, if
,
, and
then, there exists
R such that
Let
be the sequence such that
and define
via
, i.e.,
. Note
Moreover,
and similarly, thanks to
, (e.g, via [
1] (Lemma 4)) this implies
.
In particular,
where
.
Suppose
then, for
k large
and this implies the existence of
such that
However, if
k is large,
, which implies
a contradiction. Therefore, (
1) is not true and
for
Thus, this yields
,
observe that the bound in (ii) is proven. One can consider general invariance maps closed under convexity to preclude (b). The last part is to preclude (c).
Claim 1: A convex minimizer at mass is uniformly convex.
Proof of Claim 1. The anisotropic mean curvature is
where
is the matrix of second tangential derivatives and
A is the second fundamental form. The formula for the first variation implies
where
The convexity of
and (
2) imply that, locally, there is a convex function
, so that
where
, is a uniformly elliptic matrix given in terms of the second-order derivatives of
f and depending on
, with
g being a convex function of
and ∇ the gradient; see Chapter 16.4 [
16]. Recall that for the classical case
, we have
Note
Indeed, let us choose a smoothly changing coordinate system so that
is diagonal. Then, the mean curvature takes the form
After differentiating, we obtain
Then,
and consequently
where
is the negative part of
. Hence, the result follows from the strong minimum principle. □
Subclaim: If for some , then for all .
Proof of Subclaim. Observe that under our assumptions
, thanks to Corollary 16.7 [
16]. The proof is based on the observation that
satisfies an inequality of the form
near
, with
.
Let us write the equation in the form
and let
; then, the equation takes the form
Differentiate twice in
to obtain
Now, we have that
where
is the cofactor matrix.
On the other hand,
where we use the notation with dummy variable
.
Since the Weingarten mapping is self-adjoint, then at each point
x, near
, we have
in a continuously changing coordinate system. Moreover,
. By (
3),
. Suppose
, then
and without loss of generality
for
, in some neighborhoods
,
is small. Using these observations, we can make the following explicit computations
The second-order derivatives appearing in
, after contracting with the cofactor matrix
, and using (
4), can be simplified as follows
Consequently,
for some fixed
and
.
Next, let us compute the expression
We need to simplify the last term
. It can be written in a more explicit form, as follows
Using the explicit forms of
, we obtain
since
From (
11)
plugging this into (
11) yields
If
, then
, and from the above computation
Similarly, for
, we obtain
Combining the last two equations, we obtain a system of equations for the remaining third-order derivatives
and
;
Note that the determinant of the coefficient matrix is
and, moreover,
for some bounded function
h in view of (
5).
Solving the system, we find
and
Therefore, combining this with (
13) and (
5), we infer that
and
can be estimated in terms of the lower-order derivatives of
u; hence, we conclude that
Returning to
where the last line follows from (
14) and (
5).
For the third-order derivatives in
, after a contraction with
, we have
From here and our estimates for the third-order derivatives, we conclude that
for some fixed
and
.
Using this and (
9), we obtain
To finish the proof, note that
since we assume that
g is convex. Summarizing, it follows from the last inequality and (
16) that
Writing
, and using
, we obtain
Applying the strong minimum principle, we see that
in
. Therefore, the proof of the Subclaim is finished. □
Next, we prove Claim 1: if the Gauss curvature of
vanishes at some point,
, then the Gauss curvature is zero everywhere on
(Subclaim). By Theorem 2.8 [
17],
u is the lower boundary of the convex hull of the set of points
for any strictly convex
. For such
, if we pick a point
, then there is a line segment passing through
x. These line segments cannot intersect, since otherwise that mean the curvature vanishes at the intersection. Thus, the graph of
u over
is a ruled surface. If we take a hyperplane perpendicular to the one containing the domain
; then, for
lying on this hyperplane, the same conclusion will hold. However, the line segments generated by
and
must intersect, which will contradict the
regularity of the surface. This yields the proof of Claim 1.
Suppose for
, there is
with
a non-convex minimizer. Via Claim 1,
is uniformly convex. In particular, the two curvatures are uniformly positive. Via the smoothness, up to a subsequence,
in
. Observe that for sufficiently large
k, the regularity implies that the principal curvatures of
are near the ones of
, and thus this contradicts non-convexity. In particular,
To show uniqueness, the next fact is sufficient:
The uniqueness fact: There exists
and a modulus of continuity
such that for all
there exists
, such that for all
& for all minimizers
,
,
, if
there exists an invariance map
A, such that
Assume the uniqueness is false. Then, for all
, for all moduli
q, there exists
such that for a fixed
there exists
&, and there exist
,
such that
and
Let
,
,
be a modulus of continuity and define
hence, there exists
such that for a fixed
there exists
&, and there exist minimizers
; in addition, some sets
,
such that
and
Set
,
. Also, define
such that
Next, observe that thanks to the compactness,
, this yields
, where
E is a minimizer,
. In addition,
also implies that, along a subsequence,
is a minimizer. The aforementioned
therefore yields a contradiction: initially, the uniqueness at mass
yields
, so that
; thus
Hence, (
18), together with uniqueness, precludes (c).