Closed

A proper finite polyhedral pushforward; F8GP-5

Lemma. (A proper finite polyhedral pushforward; F8GP-5). The map F:P→Rr+1F:P\to\mathbb R^{r+1} is proper. The chain C0=F∗PC_0=F_*\mathcal P has a finite polyhedral presentation, and for every real SS, F∗(P∣{t∘F≤S})=C0∣{t≤S}.(3.3)F_*\bigl(\mathcal P|_{\{t\circ F\leq S\}}\bigr) =C_0|_{\{t\leq S\}}. \tag{3.3}

Proof

Proof. The vv-coordinates range over one fixed compact box. On the inverse image of a compact target set, its tt-coordinate has an upper bound SS. Equation (3.1) bounds each sis_i above, while si≥−Ais_i\geq-A_i. Thus the inverse image is a closed subset of a bounded box, hence compact. Positivity of every mim_i is used in these separate upper bounds.

There are only 3k3^k product nn-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 nn. The finitely many image faces admit a common finite polyhedral refinement. On a full-rank cell, FF 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 t≤St\leq S is exactly the image of its intersection with t∘F≤St\circ F\leq S. The tangent lattice and index are unchanged on surviving nn-dimensional pieces. If the whole cell is at t=St=S, 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. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002573.

Proof in chapter · Fixed-edition record