ScalingStacks

Theorem 1 [057G]

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

Theorem 1

Consider the equation (1.1), and assume that the function f⁡(λ)f(\lambda) satisfies the following structural condition, namely that there exists a constant γ>0\gamma>0 so that

det⁡(∂f⁡(λ⁡[h])∂hi​j)≥γ,for all ​λ∈Γ.\displaystyle\ {\rm det}\big(\frac{\partial f(\lambda[h])}{\partial h_{ij}}\big)\geq\gamma,\quad\mbox{for all }\lambda\in\Gamma. (1.4)

Fix p>np>n. Then for any solution φ∈C2​(X)\varphi\in C^{2}(X), we have the estimate

supX​|φ|≤C\displaystyle{\rm sup}_{X}|\varphi|\leq C (1.5)

where the constant CC depends only on n,p,γn,p,\gamma, ωX\omega_{X}, and the entropy Entp​(F){\rm Ent}_{p}(F).

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