ScalingStacks

6.1. Bounding the values on vertices [01G8]

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

6.1. Bounding the values on vertices

We first prove

(6.1) maxi∈I⁡|φ⁡(ei)|≤C.\max_{i\in I}|\varphi(e_{i})|\leq C.

Recall that we have normalized φ\varphi so that maxi∈I⁡φ⁡(ei)=0\max_{i\in I}\varphi(e_{i})=0. We may therefore assume that 𝒳0\mathcal{X}_{0} has at least two components. Note that π∗​G=∑jbj​φ​(ej)​Ej\pi_{*}G=\sum_{j}b_{j}\varphi(e_{j})E_{j} by definition. For each component EiE_{i} the projection formula shows that

(θ𝒳+π∗​G)⋅Ei⋅𝒜n−1=(π∗​θ𝒳+G)⋅π∗​Ei⋅π∗​𝒜n−1,(\theta_{\mathcal{X}}+\pi_{*}G)\cdot E_{i}\cdot\mathcal{A}^{n-1}=(\pi^{*}\theta_{\mathcal{X}}+G)\cdot\pi^{*}E_{i}\cdot\pi^{*}\mathcal{A}^{n-1},

which is non-negative since π∗​θ𝒳+G\pi^{*}\theta_{\mathcal{X}}+G and π∗​𝒜\pi^{*}\mathcal{A} are nef and π∗​Ei∈Div0⁡(𝒴)\pi^{*}E_{i}\in\Div_{0}(\mathcal{Y}) is effective. It follows that

(6.2) ∑jbj​φ​(ej)​(Ei⋅Ej⋅𝒜n−1)≥−C\sum_{j}b_{j}\varphi(e_{j})(E_{i}\cdot E_{j}\cdot\mathcal{A}^{n-1})\geq-C

for all ii. Note that Ei⋅Ej⋅𝒜n−1≥0E_{i}\cdot E_{j}\cdot\mathcal{A}^{n-1}\geq 0 for all i≠ji\neq j, and

biEi⋅Ei⋅𝒜n−1=Ei⋅(biEi−𝒳0)⋅𝒜n−1=−∑j≠ibjEi⋅Ej⋅𝒜n−1<0b_{i}E_{i}\cdot E_{i}\cdot\mathcal{A}^{n-1}=E_{i}\cdot(b_{i}E_{i}-\mathcal{X}_{0})\cdot\mathcal{A}^{n-1}=-\sum_{j\neq i}b_{j}\,E_{i}\cdot E_{j}\cdot\mathcal{A}^{n-1}<0

for all ii, since 𝒳0\mathcal{X}_{0} has connected support and contains at least two components.

Now pick i0,…,iMi_{0},\dots,i_{M} such that φ⁡(ei0)=0\varphi(e_{i_{0}})=0, φ⁡(eiM)=mini∈I⁡φ⁡(ei)\varphi(e_{i_{M}})=\min_{i\in I}\varphi(e_{i}), and eime_{i_{m}} and eim+1e_{i_{m+1}} are connected by a 11-dimensional face, so that Eim⋅Eim+1⋅𝒜n−1≥1E_{i_{m}}\cdot E_{i_{m+1}}\cdot\mathcal{A}^{n-1}\geq 1. Writing

λ=maxi∈I{−biEi2⋅𝒜n−1}>0\lambda=\max_{i\in I}\left\{-b_{i}E_{i}^{2}\cdot\mathcal{A}^{n-1}\right\}>0

and applying (6.2) to i0,i1,…,iM−1i_{0},i_{1},\dots,i_{M-1}, we get by induction

0≥φ(eiM)≥−C∑m=1Mλm,0\geq\varphi(e_{i_{M}})\geq-C\sum_{m=1}^{M}\lambda^{m},

which proves (6.1).

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