ScalingStacks

Verified tagged author-source HTML · 1904.03696v1 · cited publication edition alignment unverified.

00KJ

Lemma 3.10. Let ∥⋅∥\lVert\mathord{\cdot}\rVert and ∥⋅∥′\lVert\mathord{\cdot}\rVert^{\prime} be two norms on V1​(L)V_{1}(L), then

dist⁡(FS⁡(∥⋅∥),FS⁡(∥⋅∥′))≤dist⁡(∥⋅∥,∥⋅∥′).\dist(\mathrm{FS}(\lVert\mathord{\cdot}\rVert),\mathrm{FS}(\lVert\mathord{\cdot}\rVert^{\prime}))\leq\dist(\lVert\mathord{\cdot}\rVert,\lVert\mathord{\cdot}\rVert^{\prime}).

(see also [BE18, Equation (6.2)])

00KK

Proof. For any x∈Xanx\in X^{\mathrm{an}}, let e⁡(x)∈Lan​(x)∖{0}e(x)\in L^{\mathrm{an}}(x)\setminus\{0\}. Let s,s′∈V1​(L)s,s^{\prime}\in V_{1}(L) and λ,λ′∈κ^​(x)\lambda,\lambda^{\prime}\in\hat{\kappa}(x) be elements such that

s⁡(x)=λ⋅e⁡(x),∥e⁡(x)∥X|x=|λ|−1​∥s∥,s(x)=\lambda\cdot e(x),\ \lVert e(x)\rVert_{X|x}=\lvert\lambda\rvert^{-1}\lVert s\rVert,
s′​(x)=λ′⋅e⁡(x),∥e⁡(x)∥X|x=|λ′|−1​∥s′∥′.s^{\prime}(x)=\lambda^{\prime}\cdot e(x),\ \lVert e(x)\rVert_{X|x}=\lvert\lambda^{\prime}\rvert^{-1}\lVert s^{\prime}\rVert^{\prime}.

If ∥e⁡(x)∥X|x>∥e⁡(x)∥X|x′\lVert e(x)\rVert_{X|x}>\lVert e(x)\rVert^{\prime}_{X|x}, one has

dist⁡(∥e⁡(x)∥X|x,∥e⁡(x)∥X|x′)=|log⁡|λ|−1​∥s∥|λ′|−1​∥s′∥′|≤|log⁡|λ|−1​∥s∥|λ|−1​∥s∥′|≤dist⁡(∥⋅∥,∥⋅∥′).\begin{split}\dist(\lVert e(x)\rVert_{X|x},\lVert e(x)\rVert^{\prime}_{X|x})&=\Big|\log\frac{\lvert\lambda\rvert^{-1}\lVert s\rVert}{\lvert\lambda^{\prime}\rvert^{-1}\lVert s^{\prime}\rVert^{\prime}}\Big|\\ &\leq\Big|\log\frac{\lvert\lambda\rvert^{-1}\lVert s\rVert}{\lvert\lambda\rvert^{-1}\lVert s\rVert^{\prime}}\Big|\leq\dist(\lVert\mathord{\cdot}\rVert,\lVert\mathord{\cdot}\rVert^{\prime}).\end{split}

Otherwise, one has

dist⁡(∥e⁡(x)∥X|x,∥e⁡(x)∥X|x′)=|log⁡|λ|−1​∥s∥|λ′|−1​∥s′∥′|≤|log⁡|λ′|−1​∥s′∥|λ′|−1​∥s′∥′|≤dist⁡(∥⋅∥,∥⋅∥′).\begin{split}\dist(\lVert e(x)\rVert_{X|x},\lVert e(x)\rVert^{\prime}_{X|x})&=\Big|\log\frac{\lvert\lambda\rvert^{-1}\lVert s\rVert}{\lvert\lambda^{\prime}\rvert^{-1}\lVert s^{\prime}\rVert^{\prime}}\Big|\\ &\leq\Big|\log\frac{\lvert\lambda^{\prime}\rvert^{-1}\lVert s^{\prime}\rVert}{\lvert\lambda^{\prime}\rvert^{-1}\lVert s^{\prime}\rVert^{\prime}}\Big|\leq\dist(\lVert\mathord{\cdot}\rVert,\lVert\mathord{\cdot}\rVert^{\prime}).\end{split}

Varying xx and taking the supremum, one gets the desired inequality. ∎

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.