ScalingStacks

Theorem 1.11 . [01XS]

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

(Transformation theorem) For every ϵ>0\epsilon>0 there exists δ=δ⁡(n,ϵ)>0\delta=\delta(n,\epsilon)>0 such that if RicMn≥−(n−1)​δ2{\rm Ric}_{M^{n}}\geq-(n-1)\delta^{2} and u:B2​(p)→ℝku:B_{2}(p)\to\mathds{R}^{k} is a δ2\delta^{2}-splitting map, then for each x∈B1​(p)x\in B_{1}(p) and r≥sxδr\geq s^{\delta}_{x} there exists a lower triangular matrix A=A⁡(x,r)A=A(x,r) such that A∘u:Br​(x)→ℝkA\circ u:B_{r}(x)\to\mathds{R}^{k} is a ϵ\epsilon-splitting map.

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