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
Hence replacing by and by , we can assume that by Proposition 3.5(b).
Step 2. Let denote the skeleton of . By Propositions 3.5 and 3.8, we get that
| (3.2) |
for the set of non-positive piecewise linear functions on such that is integral -affine for some and such that is -psh. Note that the piecewise linear functions are not assumed to be affine on the edges of . Since is a smooth projective curve and the de Rham class is nef, it is clear that is non-empty. We introduce the function defined by
By (3.2), we get that . Hence we can reduce (i) to prove that is affine on each edge of .
Step 3. For , let be the function which is affine on the edges of and which agrees with on the set of vertices of . As , we deduce immediately . Since is -psh, Proposition 3.7 shows that is convex on each edge of and hence .
By passing from to , the slopes do not decrease in the vertices and using that is -psh, it follows from Proposition 3.7 that is -psh as well.
The slopes of the function might be non-rational. However, we can approximate the slopes of in a rational way at any vertex and thus for any we find a piecewise linear function on such that
- (i)
agrees with on .
- (ii)
has rational slopes.
- (iii)
is convex on the edges of .
- (iv)
.
- (v)
We claim that . It follows from (ii) that is integral -affine for some . Since and agree on , it is clear from (i) and (iii) that . To show that is -psh, we use the slope criterion from Proposition 3.7. Note that (3.1) is fulfilled in the interior of each edge of by (iii). In a vertex of , the inequality (3.1) is satisfied by using the corresponding inequality for , (i) and (iv). This proves . As a consequence we find
| (3.3) |
Step 4. We claim . First note that since the of convex functions in convex, is convex on each edge of , thus .
We pick an . For any , there is with . It follows from [GM16, Prop. 3.12] that the maximum of two -psh model functions is again a -psh model function. Using 2.5, we conclude that is closed under the operation . Thus is in -distance to at every vertex of and hence at every point of . As can be chosen arbitrarily small, (3.3) yields and hence we get Step 4. Note that Step 4 proves (i).
Step 5. In the case , we have for . Indeed, we note that in this special case the edges have rational lengths and takes rational values at . We deduce from Proposition 3.5 that is a model function. Let be the set of such that is affine on every edge of . For we thus have which shows via (3.3) that we might restrict the to in the definition of . Recall that is the set of vertices of . Since the edge lengths of are rational, the map defined by identifies with the rational points of a rational polyhedron in 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 is bounded from above on a rational polyhedron , then achieves its maximum in a rational point. Hence there exists such that
| (3.4) |
We claim that . Considering , we get by Step 4 and hence . Hence , and . But by (3.4) we deduce that for we have . Since functions in are determined by their values on , we have . Hence , whence . It follows that is a -psh function proving (ii). ∎