Lemma 11.19.3. (Finite support inequalities). The set is a closed convex polyhedral cone in , and contains all constants with either sign. Its defining real coefficients need not be rational. More precisely, if and only if for every nonempty face there is an affine function satisfying
Argument in the manuscript
Proof. Choose . A lower support at agrees with on , since their affine difference has a local minimum there. For any , apply the local inequality at and divide by ; this extends it to . Conversely, (11.19.3) gives a support on each coface of , and a sufficiently small neighbourhood of 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 , write each inequality as . Keep the inequalities with , and require each lower bound from to be no larger than each upper bound from . 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. ◻