ScalingStacks

1.3.1. Orthogonality of norms [025B]

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

1.3.1. Orthogonality of norms

For α∈(0,1]\alpha\in(0,1], a basis (e1,…,er)(e_{1},\ldots,e_{r}) of VV is called an α\alpha-orthogonal basis of VV with respect to ‖.‖\|\raisebox{1.72218pt}{.}\| if

α​max⁡{|a1|​‖e1‖,…,|ar|​‖er‖}≤‖a1​e1+⋯+ar​er‖(∀a1,…,ar∈k).\alpha\max\{|a_{1}|\|e_{1}\|,\ldots,|a_{r}|\|e_{r}\|\}\leq\|a_{1}e_{1}+\cdots+a_{r}e_{r}\|\quad(\forall a_{1},\ldots,a_{r}\in k).

If α=1\alpha=1 (resp. α=1\alpha=1 and ‖e1‖=⋯=‖er‖=1\|e_{1}\|=\cdots=\|e_{r}\|=1), then the above basis is called an orthogonal basis of VV (resp. an orthonormal basis of VV). Let (e1′,…,er′)(e^{\prime}_{1},\ldots,e^{\prime}_{r}) be another basis of VV. We say that (e1,…,er)(e_{1},\ldots,e_{r}) is compatible with (e1′,…,er′)(e^{\prime}_{1},\ldots,e^{\prime}_{r}) if k​e1+⋯+k​ei=k​e1′+⋯+k​ei′ke_{1}+\cdots+ke_{i}=ke^{\prime}_{1}+\cdots+ke^{\prime}_{i} for i=1,…,ri=1,\ldots,r.

Proposition 1.3.

Fix a basis (e1′,…,er′)(e^{\prime}_{1},\ldots,e^{\prime}_{r}) of VV. For any α∈(0,1)\alpha\in(0,1), there exists an α\alpha-orthogonal basis (e1,…,er)(e_{1},\ldots,e_{r}) of VV with respect to ‖.‖\|\raisebox{1.72218pt}{.}\| such that (e1,…,er)(e_{1},\ldots,e_{r}) is compatible with (e1′,…,er′)(e^{\prime}_{1},\ldots,e^{\prime}_{r}). Moreover, if the absolute value |.||\raisebox{1.72218pt}{.}| is discrete, then there exists an orthogonal basis (e1,…,er)(e_{1},\ldots,e_{r}) of VV compatible with (e1′,…,er′)(e^{\prime}_{1},\ldots,e^{\prime}_{r}).

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

Lemma 1.4.

If |.||\raisebox{1.72218pt}{.}| is discrete, then the set {‖v‖∣v∈V∖{0}}\{\|v\|\mid v\in V\setminus\{0\}\} is discrete in ℝ>0\mathbb{R}_{>0}.

Proof.

Let us consider a map β:V∖{0}→ℝ>0/|k×|\beta:V\setminus\{0\}\to{\mathbb{R}}_{>0}/|k^{\times}| given by

β⁡(v)=the class of ‖v‖ in ℝ>0/|k×|.\beta(v)=\text{the class of $\|v\|$ in ${\mathbb{R}}_{>0}/|k^{\times}|$}.

It is sufficient to see that β⁡(V∖{0})\beta(V\setminus\{0\}) is finite. Let β1,…,βl\beta_{1},\ldots,\beta_{l} be distinct elements of β⁡(V∖{0})\beta(V\setminus\{0\}). We choose v1,…,vl∈V∖{0}v_{1},\ldots,v_{l}\in V\setminus\{0\} with β⁡(vi)=βi\beta(v_{i})=\beta_{i} for i=1,…,li=1,\ldots,l. If i≠ji\not=j, then ‖ai​vi‖≠‖aj​vj‖\|a_{i}v_{i}\|\not=\|a_{j}v_{j}\| for all ai,aj∈k×a_{i},a_{j}\in k^{\times}. Therefore, we obtain

‖a1​v1+⋯+al​vl‖=max⁡{‖a1​v1‖,…,‖a1​vl‖}\|a_{1}v_{1}+\cdots+a_{l}v_{l}\|=\max\{\|a_{1}v_{1}\|,\ldots,\|a_{1}v_{l}\|\}

for all a1,…,al∈ka_{1},\ldots,a_{l}\in k. In particular, v1,…,vlv_{1},\ldots,v_{l} are linearly independent. Therefore, we have #⁡(β⁡(V∖{0}))≤dimkV\#(\beta(V\setminus\{0\}))\leq\dim_{k}V. ∎

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