ScalingStacks

Remark 3.13 . [00A4]

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

Remark 3.13.

Given an NA norm ‖⋅‖V\left\lVert\cdot\right\rVert_{V} on the KK-vector space V=ℂN+1⊗ℂKV=\mathbb{C}^{N+1}\otimes_{\mathbb{C}}K, finding an orthogonal basis in general requires access to formal Laurent series. If we only use sections which are finite Laurent polynomials in tt, then for any given ϵ>0\epsilon>0, we can find a KK-basis s0,…​sNs_{0},\ldots s_{N} such that ‖a0​s0+…+aN​sN‖V′=max⁡{|a0|​‖s0‖V,…,|aN|​‖sN‖V}\left\lVert a_{0}s_{0}+\ldots+a_{N}s_{N}\right\rVert_{V}^{\prime}=\max\{|a_{0}|\left\lVert s_{0}\right\rVert_{V},\ldots,|a_{N}|\left\lVert s_{N}\right\rVert_{V}\} satisfies

(1−ϵ)​‖⋅‖V′≤‖⋅‖V≤‖⋅‖V′,(1-\epsilon)\left\lVert\cdot\right\rVert_{V}^{\prime}\leq\left\lVert\cdot\right\rVert_{V}\leq\left\lVert\cdot\right\rVert_{V}^{\prime},

by [13, Prop. 1.3]. The upshot is that in the approximation theorem we may assume sis_{i} to be finite Laurent polynomials.

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