ScalingStacks

Proof. [038X]

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.

Step 1. By Proposition 2.9(iv), we have

Pθ​(f)=Pθ+d​dc​f​(0)+f.\displaystyle{P}_{\theta}(f)={P}_{\theta+dd^{c}f}(0)+f.

Hence replacing θ\theta by θ+d​dc​f\theta+dd^{c}f and ff by 00, we can assume that f=0f=0 by Proposition 3.5(b).

Step 2. Let Δ≔S⁡(𝒳)\Delta\coloneqq S(\mathscr{X}) denote the skeleton of 𝒳\mathscr{X}. By Propositions 3.5 and 3.8, we get that

(3.2) Pθ​(0)=supF∈𝒜F∘τ{P}_{\theta}(0)=\sup_{F\in\mathcal{A}}F\circ\tau

for the set 𝒜\mathcal{A} of non-positive piecewise linear functions FF on Δ\Delta such that m​FmF is integral Γ\Gamma-affine for some m∈ℕ>0m\in\mathbb{N}_{>0} and such that F∘τF\circ\tau is θ\theta-psh. Note that the piecewise linear functions are not assumed to be affine on the edges of Δ\Delta. Since XX is a smooth projective curve and the de Rham class {θ}\{\theta\} is nef, it is clear that 𝒜\mathcal{A} is non-empty. We introduce the function F0:Δ→ℝF_{0}\colon\Delta\to\mathbb{R} defined by

F0:=supF∈𝒜F.\displaystyle F_{0}:=\sup_{F\in\mathcal{A}}F.

By (3.2), we get that Pθ​(0)=F0∘τ{P}_{\theta}(0)=F_{0}\circ\tau. Hence we can reduce (i) to prove that F0F_{0} is affine on each edge of Δ\Delta.

Step 3. For F∈𝒜F\in\mathcal{A}, let L⁡(F):Δ→ℝL(F)\colon\Delta\to\mathbb{R} be the function which is affine on the edges of Δ\Delta and which agrees with FF on the set VV of vertices of Δ\Delta. As F≤0F\leq 0, we deduce immediately L⁡(F)≤0L(F)\leq 0. Since F∘τF\circ\tau is θ\theta-psh, Proposition 3.7 shows that FF is convex on each edge of Δ\Delta and hence F≤L⁡(F)F\leq L(F).

By passing from FF to L⁡(F)L(F), the slopes do not decrease in the vertices and using that F∘τF\circ\tau is θ\theta-psh, it follows from Proposition 3.7 that L⁡(F)∘τL(F)\circ\tau is θ\theta-psh as well.

The slopes of the function L⁡(F)L(F) might be non-rational. However, we can approximate the slopes of L⁡(F)L(F) in a rational way at any vertex and thus for any ε>0\varepsilon>0 we find a piecewise linear function Lε​(F)L_{\varepsilon}(F) on Δ\Delta such that

  1. (i)

    Lε​(F)L_{\varepsilon}(F) agrees with FF on VV.

  2. (ii)

    Lε​(F)L_{\varepsilon}(F) has rational slopes.

  3. (iii)

    Lε​(F)L_{\varepsilon}(F) is convex on the edges of Δ\Delta.

  4. (iv)

    Lε​(F)≥FL_{\varepsilon}(F)\geq F.

  5. (v)

    sup|Lε​(F)−L⁡(F)|<ε\sup|L_{\varepsilon}(F)-L(F)|<\varepsilon

We claim that Lε​(F)∈𝒜L_{\varepsilon}(F)\in\mathcal{A}. It follows from (ii) that m​Lε​(F)mL_{\varepsilon}(F) is integral Γ\Gamma-affine for some m∈ℕ>0m\in\mathbb{N}_{>0}. Since FF and L⁡(F)L(F) agree on VV, it is clear from (i) and (iii) that Lε​(F)≤L⁡(F)≤0L_{\varepsilon}(F)\leq L(F)\leq 0. To show that Lε​(F)∘τL_{\varepsilon}(F)\circ\tau is θ\theta-psh, we use the slope criterion from Proposition 3.7. Note that (3.1) is fulfilled in the interior of each edge of Δ\Delta by (iii). In a vertex of Δ\Delta, the inequality (3.1) is satisfied by using the corresponding inequality for FF, (i) and (iv). This proves Lε​(F)∈𝒜L_{\varepsilon}(F)\in\mathcal{A}. As a consequence we find

(3.3) F0=supF∈𝒜F=supF∈𝒜Lε​(F)=supF∈𝒜L⁡(F).\displaystyle F_{0}=\sup_{F\in\mathcal{A}}F=\sup_{F\in\mathcal{A}}L_{\varepsilon}(F)=\sup_{F\in\mathcal{A}}L(F).

Step 4. We claim F0=L⁡(F0)F_{0}=L(F_{0}). First note that since the max\max of convex functions in convex, F0F_{0} is convex on each edge of Δ\Delta, thus F0≤L⁡(F0)F_{0}\leq L(F_{0}).

We pick an ε>0\varepsilon>0. For any v∈Vv\in V, there is fv∈𝒜f_{v}\in\mathcal{A} with fv​(v)>L⁡(F0)​(v)−εf_{v}(v)>L(F_{0})(v)-\varepsilon. It follows from [GM16, Prop. 3.12] that the maximum of two θ\theta-psh model functions is again a θ\theta-psh model function. Using 2.5, we conclude that 𝒜\mathcal{A} is closed under the operation max\max. Thus L⁡(max⁡{fv∣v∈V})∈𝒜L(\max\{f_{v}\mid v\in V\})\in\mathcal{A} is in ε\varepsilon-distance to L⁡(F0)L(F_{0}) at every vertex of Δ\Delta and hence at every point of Δ\Delta. As ε>0\varepsilon>0 can be chosen arbitrarily small, (3.3) yields L⁡(F0)≤F0L(F_{0})\leq F_{0} and hence we get Step 4. Note that Step 4 proves (i).

Step 5. In the case Γ⊂ℚ\Gamma\subset\mathbb{Q}, we have L⁡(F)∈𝒜L(F)\in\mathcal{A} for F∈𝒜F\in\mathcal{A}. Indeed, we note that in this special case the edges have rational lengths and FF takes rational values at VV. We deduce from Proposition 3.5 that L⁡(F)∘τL(F)\circ\tau is a model function. Let ℬ\mathcal{B} be the set of F∈𝒜F\in\mathcal{A} such that FF is affine on every edge of Δ\Delta. For F∈𝒜F\in\mathcal{A} we thus have L⁡(F)∈ℬL(F)\in\mathcal{B} which shows via (3.3) that we might restrict the sup\sup to ℬ\mathcal{B} in the definition of F0F_{0}. Recall that VV is the set of vertices of Δ\Delta. Since the edge lengths of Δ\Delta are rational, the map Ψ:ℬ→ℝV\Psi\colon\mathcal{B}\to\mathbb{R}^{V} defined by Ψ⁡(F)=(F⁡(v))v∈V\Psi(F)=(F(v))_{v\in V} identifies ℬ\mathcal{B} with the rational points of a rational polyhedron in ℝV\mathbb{R}^{V} defined by the linear inequalities of Proposition 3.7. Note that by affineness on the edges, we need to check the slope inequalities only at the vertices. If a rational linear form φ\varphi is bounded from above on a rational polyhedron PP, then φ|P\varphi|_{P} achieves its maximum in a rational point. Hence there exists G∈ℬG\in\mathcal{B} such that

(3.4) ∑v∈VG⁡(v)=maxF∈ℬ⁡(∑v∈VF⁡(v)).\displaystyle\sum_{v\in V}G(v)=\max_{F\in\mathcal{B}}\left(\sum_{v\in V}F(v)\right).

We claim that G=F0G=F_{0}. Considering F∈ℬF\in\mathcal{B}, we get max⁡(G,F)∈𝒜\max(G,F)\in\mathcal{A} by Step 4 and hence H′≔L⁡(max⁡(G,F))∈ℬH^{\prime}\coloneqq L(\max(G,F))\in\mathcal{B}. Hence H′≥GH^{\prime}\geq G, H′≥FH^{\prime}\geq F and H′∈ℬH^{\prime}\in\mathcal{B}. But by (3.4) we deduce that for v∈Vv\in V we have H′​(v)=G​(v)H^{\prime}(v)=G(v). Since functions in ℬ\mathcal{B} are determined by their values on VV, we have H′=GH^{\prime}=G. Hence G≥FG\geq F, whence G=F0G=F_{0}. It follows that Pθ​(0)=F0∘τ=G∘τP_{\theta}(0)=F_{0}\circ\tau=G\circ\tau is a θ\theta-psh function proving (ii). ∎

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