ScalingStacks

Theorem 2 [057H]

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 2

Consider the family of equations (1.7), and assume that f⁡(λ)f(\lambda) satisfies the structural condition (1.4). Let φt\varphi_{t} be C2C^{2} functions on XX satisfying (1.7). Fix p>np>n. Then for any t∈(0,1]t\in(0,1], we have

supX|φt|≤C\displaystyle\sup_{X}|\varphi_{t}|\leq C (1.10)

where CC is a constant depending only on ωX,χ,p,n,γ\omega_{X},\chi,p,n,\gamma, and upper bounds for the following three quantities

ctnVt,Et​(φt),Entp​(Ft).\displaystyle{c_{t}^{n}\over V_{t}},\quad E_{t}(\varphi_{t}),\quad{\rm Ent}_{p}(F_{t}). (1.11)

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