Lemma 11.12.1. (Simultaneous escape). Let be a nonempty closed polyhedron, where , and suppose that its projection to the second factor is bounded. Exactly one of the following alternatives holds:
There is with for every .
There is such that for every .
Argument in the manuscript
Proof. We use the elementary finite-dimensional Farkas alternative in the following form: if a linear functional is nonpositive on , then for some column vector . Here is a brief justification. The cone generated by the rows of is closed: in each nonnegative representation, a linear dependence can eliminate one positive coefficient, until its support is linearly independent. There are finitely many such supports; on a fixed independent support convergence of the represented vectors forces convergence of the coefficients. If were outside this closed convex cone, separation would give with , a contradiction.
It follows that a linear functional unbounded above on a nonempty polyhedron is positive on some recession vector: otherwise gives on . Apply this observation to If alternative (2) fails, is unbounded above on . Hence has a recession vector with . The inequalities give . Boundedness of the -projection forces , proving (1). Conversely, a ray with every makes unbounded. ◻