Lemma. (A proper finite polyhedral pushforward; F8GP-5). The map is proper. The chain has a finite polyhedral presentation, and for every real ,
Proof
Proof. The -coordinates range over one fixed compact box. On the inverse image of a compact target set, its -coordinate has an upper bound . Equation (3.1) bounds each above, while . Thus the inverse image is a closed subset of a bounded box, hence compact. Positivity of every is used in these separate upper bounds.
There are only product -cells before subdivision. The image of each is a polyhedron: eliminate the finitely many linear inequalities, or use the injective affine map on its span when the rank is . The finitely many image faces admit a common finite polyhedral refinement. On a full-rank cell, is an affine isomorphism onto its image, with the fixed finite index (2.1). Sum these indices over all cells above each image cell. Rank-deficient cells contribute zero. This constructs a finite nonnegative integral chain.
On a full-rank cell, intersecting its image with is exactly the image of its intersection with . The tangent lattice and index are unchanged on surviving -dimensional pieces. If the whole cell is at , both operations retain the whole cell. Rank-deficient pieces remain rank-deficient after cutting. These facts prove (3.3) coefficient by coefficient, after finite refinement. ◻