ScalingStacks

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 v:Ω⊂ℝn→ℝv:\Omega\subset\mathbb{R}^{n}\rightarrow\mathbb{R} has an associated Borel measure M​vMv, called the Monge-Ampère measure, defined by

M​v​(A)=|∇u​(A)|Mv(A)=|\nabla u(A)|

where |∇u​(A)||\nabla u(A)| represents the Lebesgue measure of the image of the subgradients of vv in AA (see [Gut]). If v∈C2,v\in C^{2}, then

|∇v​(A)|=∫AdetD2​v​𝑑x.|\nabla v(A)|=\int_{A}\det D^{2}v\,dx.

Given a Borel measure μ\mu, we say that vv is an Alexandrov solution to

detD2​v=μ\det D^{2}v=\mu

if M​v=μMv=\mu.

For a convex function vv defined on Ω⊂ℝn\Omega\subset\mathbb{R}^{n}, we define a section Sh,p​(x)S_{h,p}(x) by

Sh,p​(x)={y∈Ω:v⁡(y)<v⁡(x)+p⋅(y−x)+h}S_{h,p}(x)=\{y\in\Omega:v(y)<v(x)+p\cdot(y-x)+h\}

for some subgradient pp at xx. We now present some results on the geometry of the sections.

Lemma 2.1.

(John’s Lemma). If K⊂ℝnK\subset\mathbb{R}^{n} is a bounded convex set with nonempty interior, and 00 is the center of mass of KK, then there exists an ellipsoid EE and a dimensional constant C⁡(n)C(n) such that

E⊂K⊂C⁡(n)​E.E\subset K\subset C(n)E.

We call EE the John ellipsoid of KK. There is some linear transformation AA such that A⁡(B1)=EA(B_{1})=E, and we say that AA normalizes KK.

The next lemma is an important observation about the volume growth of sections which may not be compactly contained in Ω\Omega:

Lemma 2.2.

Assume that detD2​u≥1\det D^{2}u\geq 1 in Ω⊂ℝn\Omega\subset\mathbb{R}^{n}. Then if Sh,p​(x)S_{h,p}(x) is any section of uu, we have

|Sh,p​(x)|≤C​hn/2|S_{h,p}(x)|\leq Ch^{n/2}

for some constant CC depending only on nn.

Proof.

Assume by translation that 00 is the center of mass of Sh,p​(x)S_{h,p}(x). By subtracting a linear function we can assume that

p=0,u|∂Sh,0​(x)≤0, and |minSh,0​(x)u|=h.p=0,\quad u|_{\partial S_{h,0}(x)}\leq 0,\text{ and }\quad|\min_{S_{h,0}(x)}u|=h.

By John’s Lemma, there is a linear transformation AA that normalizes Sh,0​(x)S_{h,0}(x). Let

u~(x)=|detA|−2/nu(Ax).\tilde{u}(x)=|\det A|^{-2/n}u(Ax).

It is easy to check that

detD2​u~≥1,u~|∂Ω~≤0\det D^{2}\tilde{u}\geq 1,\quad\tilde{u}|_{\partial\tilde{\Omega}}\leq 0

where B1⊂Ω~⊂BC⁡(n)B_{1}\subset\tilde{\Omega}\subset B_{C(n)}. Then 12​(|x|2−1)\frac{1}{2}(|x|^{2}-1) is an upper barrier for u~\tilde{u}, so

|minΩ~⁡u~|≥12.|\min_{\tilde{\Omega}}\tilde{u}|\geq\frac{1}{2}.

Since |detA|≥c⁡(n)​|Sh,0​(x)||\det A|\geq c(n)|S_{h,0}(x)|, 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

detD2​u≥1\det D^{2}u\geq 1

in B1⊂ℝnB_{1}\subset\mathbb{R}^{n}. Then uu cannot vanish on a subspace of dimension n2\frac{n}{2} or higher.

Proof.

Suppose uu vanishes on

{xk+1=…=xn=0}.\{x_{k+1}=...=x_{n}=0\}.

By subtracting a linear function of the form ak+1​xk+1+…+an​xna_{k+1}x_{k+1}+...+a_{n}x_{n} we may assume that u⁡(t​en)=o⁡(t)u(te_{n})=o(t). Then Sh,0​(0)S_{h,0}(0) has length R⁡(h)​hR(h)h in the ene_{n} direction, where R⁡(h)→∞R(h)\rightarrow\infty as h→0h\rightarrow 0. Furthermore, Sh,0​(0)S_{h,0}(0) has length exceeding 1C​h\frac{1}{C}h in the en−k,…,en−1e_{n-k},...,e_{n-1} directions, where CC is the Lipschitz constant of uu in B1/2B_{1/2}. Finally, Sh,0​(0)S_{h,0}(0) contains the unit ball in the subspace spanned by {e1,…,ek}\{e_{1},...,e_{k}\}. We conclude that

|Sh,0​(0)|≥C−k​R​(h)​hn−k,|S_{h,0}(0)|\geq C^{-k}R(h)h^{n-k},

which contradicts Lemma 2.2 as h→0h\rightarrow 0 for k≥n2k\geq\frac{n}{2}. ∎

In particular, every solution to detD2​u≥1\det D^{2}u\geq 1 in two dimensions is strictly convex.

We conclude the section with the following variant of Alexandrov’s maximum principle. In the following c⁡(n),C⁡(n)c(n),C(n) denote small and large constants depending only on nn, and their values may change from line to line.

Lemma 2.4.

Let vv be any convex function on Ω⊂ℝn\Omega\subset\mathbb{R}^{n} with v|∂Ω=0v|_{\partial\Omega}=0. Then

M​v​(Ω)​|Ω|≥c⁡(n)​|minΩ⁡v|n.Mv(\Omega)\,|\Omega|\geq c(n)|\min_{\Omega}v|^{n}.
Proof.

By translation assume that the center of mass of Ω\Omega is 00. Let AA normalize Ω\Omega and let

v~(x)=(detA)−2/nv(Ax).\tilde{v}(x)=(\det A)^{-2/n}v(Ax).

Then

M​v~​(Ω~)=(detA)−1​M​v​(Ω)M\tilde{v}(\tilde{\Omega})=(\det A)^{-1}Mv(\Omega)

with B1⊂Ω~⊂BC⁡(n)B_{1}\subset\tilde{\Omega}\subset B_{C(n)}.

The maximum of |v~||\tilde{v}| is achieved at some point x~∈Ω~\tilde{x}\in\tilde{\Omega}. Let KK be the function whose graph is the cone generated by (x~,v~​(x))(\tilde{x},\tilde{v}(x)) and ∂BC⁡(n)\partial B_{C(n)}. By convexity,

M​v~​(Ω~)≥|∇K​(x~)|.M\tilde{v}(\tilde{\Omega})\geq|\nabla K(\tilde{x})|.

Since ∇K​(x~)\nabla K(\tilde{x}) is a ball of radius at least c⁡(n)​|minΩ~⁡v~|c(n)|\min_{\tilde{\Omega}}\tilde{v}|, we have

|∇K​(x~)|≥c⁡(n)​|minΩ~⁡v~|n≥c⁡(n)​|detA|−2​|minΩ⁡v|n.|\nabla K(\tilde{x})|\geq c(n)|\min_{\tilde{\Omega}}\tilde{v}|^{n}\geq c(n)|\det A|^{-2}|\min_{\Omega}v|^{n}.

Finally, |detA|≤C⁡(n)​|Ω||\det A|\leq C(n)|\Omega| so the conclusion follows. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.