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) |
|
|
|
Recall that we have normalized so that . We may therefore assume that has at least two components.
Note that by definition.
For each component the projection formula shows that
|
|
|
which is non-negative since and are nef and is effective.
It follows that
| (6.2) |
|
|
|
for all .
Note that for all
, and
|
|
|
for all , since has
connected support and contains at least two components.
Now pick
such that , , and
and are connected by a -dimensional face, so that
.
Writing
|
|
|
and applying (6.2) to , we get by induction
|
|
|
which proves (6.1).