ScalingStacks

Proof. [026A]

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.

Let (e1,…,er)(e_{1},\ldots,e_{r}) be an e−ϵ/2e^{-\epsilon/2}-orthogonal basis of VV with respect to ‖.‖\|\raisebox{1.72218pt}{.}\| (cf. Proposition 1.3). As ‖.‖=‖.‖𝒱\|\raisebox{1.72218pt}{.}\|=\|\raisebox{1.72218pt}{.}\|_{\mathscr{V}} by Proposition 1.18, we can find λi∈k×\lambda_{i}\in k^{\times} such that ‖ei‖≤|λi|≤eϵ/2​‖ei‖\|e_{i}\|\leq|\lambda_{i}|\leq e^{\epsilon/2}\|e_{i}\| for each ii. We set ωi:=λi−1​ei\omega_{i}:=\lambda_{i}^{-1}e_{i} (i=1,…,ri=1,\ldots,r) and 𝒱′:=𝔬k​ω1+⋯+𝔬k​ωr\mathscr{V}^{\prime}:=\mathfrak{o}_{k}\omega_{1}+\cdots+\mathfrak{o}_{k}\omega_{r}. Note that ωi∈𝒱\omega_{i}\in\mathscr{V} for all ii, that is, 𝒱′\mathscr{V}^{\prime} is a sub-lattice of 𝒱\mathscr{V} and 𝒱′\mathscr{V}^{\prime} is finitely generated over 𝔬k\mathfrak{o}_{k}. For c1,…,cr∈kc_{1},\ldots,c_{r}\in k, by Proposition 1.14,

‖c1​e1+⋯+cr​er‖𝒱′\displaystyle\|c_{1}e_{1}+\cdots+c_{r}e_{r}\|_{\mathscr{V}^{\prime}} =‖c1​λ1​ω1+⋯+cr​λr​ωr‖𝒱′=max⁡{|c1​λ1|,…,|cr​λr|}\displaystyle=\|c_{1}\lambda_{1}\omega_{1}+\cdots+c_{r}\lambda_{r}\omega_{r}\|_{\mathscr{V}^{\prime}}=\max\{|c_{1}\lambda_{1}|,\ldots,|c_{r}\lambda_{r}|\}
≤eϵ/2​{|c1|​‖e1‖,…,|cr|​‖er‖}≤eϵ​‖c1​e1+⋯+cr​er‖,\displaystyle\leq e^{\epsilon/2}\{|c_{1}|\|e_{1}\|,\ldots,|c_{r}|\|e_{r}\|\}\leq e^{\epsilon}\|c_{1}e_{1}+\cdots+c_{r}e_{r}\|,

so that we have ‖.‖𝒱′≤eϵ​‖.‖\|\raisebox{1.72218pt}{.}\|_{\mathscr{V}^{\prime}}\leq e^{\epsilon}\|\raisebox{1.72218pt}{.}\|. ∎

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