Closed

Balanced pushforward

Theorem 5.17.2. (Balanced pushforward). Let CC be a finite balanced real dd-cycle in NRN_{\mathbf R} and let f:NR→NR′f:N_{\mathbf R}\to N'_{\mathbf R} be an integral affine map. There is a well-defined balanced dd-cycle f∗Cf_*C. After subdivision so that images are cells, its weight on a dd-dimensional target cell σ′\sigma' is wf∗C(σ′)=∑dim⁡σ=d, f(σ)=σ′wC(σ)[Nσ′′:f(Nσ)].(P)w_{f_*C}(\sigma')= \sum_{\substack{\dim\sigma=d\,,\ f(\sigma)=\sigma'}} w_C(\sigma)[N'_{\sigma'}:f(N_\sigma)]. \tag{P} Facets on which the dimension drops contribute zero. Pushforward is linear and functorial under composition of integral affine maps.

Proof

Proof. Images of rational polyhedra are rational polyhedra: eliminate one coordinate at a time from their finite systems of affine inequalities, pairing a lower and an upper bound for that coordinate. Equalities are eliminated by substitution. This finite elimination also permits real constants. Choose a common target subdivision of all images and pull its defining hyperplanes back to the source. On every facet where ff is injective, source cells correspond bijectively to the target cells lying in its image. Formula ({P}) therefore defines a finite weighted complex. Adding more hyperplanes merely subdivides it with the same generic weights; two choices are compared by their combined hyperplanes. This also proves invariance under a source subdivision.

Fix a target face τ′\tau' of dimension d−1d-1 and sum over all source faces τ\tau of dimension d−1d-1 with f(τ)=τ′f(\tau)=\tau'. Multiply the balancing equation at τ\tau, after applying the linear part of ff, by aτ=[Nτ′′:f(Nτ)]a_\tau=[N'_{\tau'}:f(N_\tau)]. For an incident full-rank facet σ\sigma, Lemma 5.17.1 replaces its term by wC(σ)aσuf(σ)/τ′w_C(\sigma)a_\sigma u_{f(\sigma)/\tau'}. If ff has rank less than dd on σ\sigma, its normal maps into Nτ′,R′N'_{\tau',\mathbf R} and gives zero in the normal quotient. Each full-rank σ\sigma with f(σ)⊃τ′f(\sigma)\supset\tau' occurs exactly once: the inverse image of the target facet is its unique facet mapping to τ′\tau'. The sum is consequently the balancing equation for the weights ({P}). This proves balancedness, including faces bordering a zero-weight region.

Linearity follows from the sum. For a second map gg, a facet contributing to (g∘f)∗C(g\circ f)_*C has full rank at both stages, while a dimension drop cannot be reversed. On a contributing facet the two finite indices multiply, since gg is injective on the relevant direction space. After a common subdivision, summing these products proves (g∘f)∗=g∗f∗(g\circ f)_*=g_*f_*. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002188, 5.17.2.

Proof in chapter · Fixed-edition record