ScalingStacks

Proof. [04TV]

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

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.