Review pending

Lemma 11.19.3 · Finite support inequalities

Lemma 11.19.3. (Finite support inequalities). The set C(Π)C(\Pi) is a closed convex polyhedral cone in V(Π)V(\Pi), and contains all constants with either sign. Its defining real coefficients need not be rational. More precisely, F∈C(Π)F\in C(\Pi) if and only if for every nonempty face ρ\rho there is an affine function aρa_\rho satisfying aρ(v)=F(v)(v a vertex of ρ),aρ(v)≤F(v)(v a vertex of σ, σ⊇ρ).\begin{equation} \begin{aligned} a_\rho(v)&=F(v)&& (v\text{ a vertex of }\rho),\\ a_\rho(v)&\leq F(v)&& (v\text{ a vertex of }\sigma,\ \sigma\supseteq\rho). \end{aligned} \end{equation}

Argument in the manuscript

Proof. Choose x∈relint⁡(ρ)x\in\operatorname{relint}(\rho). A lower support at xx agrees with FF on aff⁡(ρ)\operatorname{aff}(\rho), since their affine difference has a local minimum there. For any y∈σ⊇ρy\in\sigma\supseteq\rho, apply the local inequality at x+t(y−x)x+t(y-x) and divide by t>0t>0; this extends it to yy. Conversely, (11.19.3) gives a support on each coface of ρ\rho, and a sufficiently small neighbourhood of xx meets no other cells. This proves the equivalence.

The system is finite and homogeneous linear in the vertex values and support coefficients. Eliminating the latter preserves polyhedrality. For completeness, to eliminate a variable yy, write each inequality as aiy+bi(z)≥0a_i y+b_i(z)\geq 0. Keep the inequalities with ai=0a_i=0, and require each lower bound from ai>0a_i>0 to be no larger than each upper bound from ai<0a_i<0. If one type is absent there is no additional restriction. Equalities may be written as pairs of inequalities. Repeating this elimination gives finitely many weak linear inequalities in the vertex values alone, proving closedness as well. Addition, nonnegative scaling and constant shifts preserve the support condition directly. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-900207.

Proof in chapter