ScalingStacks

Proof. [025D]

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.

We prove it by induction on dimkV\dim_{k}V. If dimkV=1\dim_{k}V=1, then the assertion is obvious. By the hypothesis of induction, there is a α\sqrt{\alpha}-orthogonal basis (e1,…,er−1)(e_{1},\ldots,e_{r-1}) of V′:=k​e1′+⋯+k​er−1′V^{\prime}:=ke^{\prime}_{1}+\cdots+ke^{\prime}_{r-1} with respect to ‖.‖\|\raisebox{1.72218pt}{.}\| such that

k​e1+⋯+k​ei=k​e1′+⋯+k​ei′ke_{1}+\cdots+ke_{i}=ke^{\prime}_{1}+\cdots+ke^{\prime}_{i}

for i=1,…,r−1i=1,\ldots,r-1. Choose v∈V∖V′v\in V\setminus V^{\prime}. As

dist⁡(v,V′):=inf{‖v−x‖:x∈V′}>0,\mathrm{dist}(v,V^{\prime}):=\inf\{\|v-x\|:x\in V^{\prime}\}>0,

there is y∈V′y\in V^{\prime} such that ‖v−y‖≤(α)−1​dist​(v,V′)\|v-y\|\leq(\sqrt{\alpha})^{-1}\mathrm{dist}(v,V^{\prime}). We set er=v−ye_{r}=v-y. Clearly (e1,…,er−1,er)(e_{1},\ldots,e_{r-1},e_{r}) forms a basis of VV. It is sufficient to see that

‖a1​e1+⋯+ar−1​er−1+er‖≥α​max⁡{|a1|​‖e1‖,…,|ar−1|​‖er−1‖,‖er‖}\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}+e_{r}\|\geq\alpha\max\{|a_{1}|\|e_{1}\|,\ldots,|a_{r-1}|\|e_{r-1}\|,\|e_{r}\|\}

for all a1,…,ar−1∈ka_{1},\ldots,a_{r-1}\in k. Indeed, as ‖er‖≤(α)−1​‖a1​e1+⋯+ar−1​er−1+er‖\|e_{r}\|\leq(\sqrt{\alpha})^{-1}\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}+e_{r}\|, we have

α​‖er‖≤α​‖er‖≤‖a1​e1+⋯+ar−1​er−1+er‖.\alpha\|e_{r}\|\leq\sqrt{\alpha}\|e_{r}\|\leq\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}+e_{r}\|.

If ‖a1​e1+⋯+ar−1​er−1‖≤‖er‖\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}\|\leq\|e_{r}\|, then

‖a1​e1+⋯+ar−1​er−1+er‖\displaystyle\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}+e_{r}\| ≥α​‖er‖≥α​‖a1​e1+⋯+ar−1​er−1‖\displaystyle\geq\sqrt{\alpha}\|e_{r}\|\geq\sqrt{\alpha}\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}\|
≥α​(α​max⁡{|a1|​‖e1‖,…,|ar−1|​‖er−1‖})\displaystyle\geq\sqrt{\alpha}\left(\sqrt{\alpha}\max\{|a_{1}|\|e_{1}\|,\ldots,|a_{r-1}|\|e_{r-1}\|\}\right)
=α​max⁡{|a1|​‖e1‖,…,|ar−1|​‖er−1‖}.\displaystyle=\alpha\max\{|a_{1}|\|e_{1}\|,\ldots,|a_{r-1}|\|e_{r-1}\|\}.

Otherwise,

‖a1​e1+⋯+ar−1​er−1+er‖\displaystyle\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}+e_{r}\| =‖a1​e1+⋯+ar−1​er−1‖\displaystyle=\|a_{1}e_{1}+\cdots+a_{r-1}e_{r-1}\|
≥α​max⁡{|a1|​‖e1‖,…,|ar−1|​‖er−1‖}\displaystyle\geq\sqrt{\alpha}\max\{|a_{1}|\|e_{1}\|,\ldots,|a_{r-1}|\|e_{r-1}\|\}
≥α​max⁡{|a1|​‖e1‖,…,|ar−1|​‖er−1‖},\displaystyle\geq\alpha\max\{|a_{1}|\|e_{1}\|,\ldots,|a_{r-1}|\|e_{r-1}\|\},

as required.

For the second assertion, it is sufficient to show the following lemma because it implies that the set {‖v−x‖∣x∈V′}\{\|v-x\|\mid x\in V^{\prime}\} has the minimal value. ∎

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