Proposition 11.19.10. (Scale propagation through edges). Let be a finite compact simplicial complex in . Suppose every maximal simplex has dimension at least two, every edge has rational direction, and the graph joining maximal simplices that share an edge is connected. If all vertices belong to , then for some and every vertex lies in . Consequently every has decreasing approximants in , uniformly on .
Argument in the manuscript
Proof. First take one simplex with vertices , . Write , with nonzero . The are linearly independent. The edge is a real multiple of a rational vector. A rational left inverse to the matrix with columns shows that the ratio is rational: its two nonzero coordinates are real multiples of two nonzero rational numbers. Thus all vertex differences of this simplex belong to for one positive real .
If two simplices share an edge, its nonzero vector belongs to both and , forcing . Propagate this relation along the connected graph. Starting from one vertex , shared vertices then show that every vertex lies in for a common positive . A nonzero coordinate of an edge shows after the initial choice of scale; multiplying by a positive integer makes it an element of without changing . Translate by and apply Theorem 11.18.1. Translation preserves rational slopes and changes a rational affine constant by , so the approximants retain the required coefficients. ◻