2. Preliminaries [04TN]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
2. Preliminaries
We first recall the precise definition of Alexandrov solutions. Any convex function has an associated Borel measure , called the Monge-Ampère measure, defined by
where represents the Lebesgue measure of the image of the subgradients of in (see [Gut]). If then
Given a Borel measure , we say that is an Alexandrov solution to
if .
For a convex function defined on , we define a section by
for some subgradient at . We now present some results on the geometry of the sections.
Lemma 2.1.
(John’s Lemma). If is a bounded convex set with nonempty interior, and is the center of mass of , then there exists an ellipsoid and a dimensional constant such that
We call the John ellipsoid of . There is some linear transformation such that , and we say that normalizes .
The next lemma is an important observation about the volume growth of sections which may not be compactly contained in :
Lemma 2.2.
Assume that in . Then if is any section of , we have
for some constant depending only on .
Proof.
Assume by translation that is the center of mass of . By subtracting a linear function we can assume that
By John’s Lemma, there is a linear transformation that normalizes . Let
It is easy to check that
where . Then is an upper barrier for , so
Since , the conclusion follows. ∎
Caffarelli proved the next proposition in [C3]. We provide a short proof using a technique related to our proof of the main theorem.
Lemma 2.3.
Assume
in . Then cannot vanish on a subspace of dimension or higher.
Proof.
Suppose vanishes on
By subtracting a linear function of the form we may assume that . Then has length in the direction, where as . Furthermore, has length exceeding in the directions, where is the Lipschitz constant of in . Finally, contains the unit ball in the subspace spanned by . We conclude that
which contradicts Lemma 2.2 as for . ∎
In particular, every solution to in two dimensions is strictly convex.
We conclude the section with the following variant of Alexandrov’s maximum principle. In the following denote small and large constants depending only on , and their values may change from line to line.
Lemma 2.4.
Let be any convex function on with . Then
Proof.
By translation assume that the center of mass of is . Let normalize and let
Then
with .
The maximum of is achieved at some point . Let be the function whose graph is the cone generated by and . By convexity,
Since is a ball of radius at least , we have
Finally, so the conclusion follows. ∎