ScalingStacks

Proof. [0260]

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.

For v=a1​e1+⋯+ar​er∈Vv=a_{1}e_{1}+\cdots+a_{r}e_{r}\in V and a∈k×a\in k^{\times},

a​v∈𝒱\displaystyle av\in\mathscr{V} ⟺a​ai∈𝔬k for all i=1,…,r\displaystyle\Longleftrightarrow\text{$aa_{i}\in\mathfrak{o}_{k}$ for all $i=1,\ldots,r$}
⟺|ai|≤|a|−1 for all i=1,…,r\displaystyle\Longleftrightarrow\text{$|a_{i}|\leq|a|^{-1}$ for all $i=1,\ldots,r$}
⟺max⁡{|a1|,…,|ar|}≤|a|−1,\displaystyle\Longleftrightarrow\text{$\max\{|a_{1}|,\ldots,|a_{r}|\}\leq|a|^{-1}$},

so that ‖v‖𝒱=max⁡{|a1|,…,|ar|}\|v\|_{\mathscr{V}}=\max\{|a_{1}|,\ldots,|a_{r}|\}. ∎

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