ScalingStacks

Theorem 1.1 . [02AU]

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.1.

Given n,V,Cn,V,C there is an integer k0k_{0} and b>0b>0 such that ρ¯​(k0,X)≥b2\underline{\rho}(k_{0},X)\geq b^{2} for all XX in 𝒦⁡(n,c,V){\mathcal{K}}(n,c,V).

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