Closed

The real polyhedral integration calculation

Lemma 5.46.2. (The real polyhedral integration calculation). Lattice-normalized integration of smooth top superforms with compact support is well-defined and additive under finite polyhedral subdivision. Let F:σ→τF:\sigma\to\tau be an affine isomorphism of dd-dimensional polyhedra whose linear part maps the tangent lattice NσN_\sigma into NτN_\tau. If that lattice map is injective, then ∫σF∗α=[Nτ:F(Nσ)]∫τα.\int_\sigma F^*\alpha =[N_\tau:F(N_\sigma)]\int_\tau\alpha. A linear map of rank less than dd has zero pullback in bidegree (d,d)(d,d).

Suppose d≥1d\geq1, and let β\beta have bidegree (d−1,d)(d-1,d) near a dd-polyhedron σ\sigma, with compact tangential support on σ\sigma. For each facet τ\tau choose a basis v1,…,vd−1v_1,\ldots,v_{d-1} of NτN_\tau and a primitive lift uσ/τ∈Nσu_{\sigma/\tau}\in N_\sigma pointing into σ\sigma. Write dμτd\mu_\tau for the real measure giving this basis covolume one. Then ∫σd′β=(−1)d(d+1)/2∑τ≺σ∫τβ(v1′,…,vd−1′;v1′′,…,vd−1′′,uσ/τ′′) dμτ.\begin{equation} \int_\sigma d'\beta =(-1)^{d(d+1)/2}\sum_{\tau\prec\sigma} \int_\tau \beta(v_1',\ldots,v_{d-1}'; v_1'',\ldots,v_{d-1}'',u_{\sigma/\tau}'') \,d\mu_\tau. \end{equation} The facet expression is independent of the chosen basis and of the lift modulo NτN_\tau.

Proof

Proof. We first give the elementary real integration facts used in the calculation. A closed bounded box in Rr\mathbb R^r is sequentially compact: repeatedly bisect its sides, retain a closed subbox containing infinitely many terms of a sequence, and choose terms with increasing indices in the nested boxes. Their diameters tend to zero, so completeness of the real coordinates gives a convergent subsequence in the original box. A continuous function on a compact subset is bounded and uniformly continuous. Otherwise a sequence witnessing failure of either assertion has a convergent subsequence; in the second case take pairs at distance tending to zero. Continuity at the common limit is a contradiction.

Let PP be a bounded polytope in Rr\mathbb R^r, and let cc be continuous on a neighbourhood of PP. In a fixed bounding box use a cubical grid of side length hh. The grid boxes meeting a given affine hyperplane have total volume at most ChC h. To see this, choose a nonzero coordinate coefficient in an equation for the hyperplane. For each box in the other r−1r-1 coordinates, the possible remaining coordinate ranges over an interval of length at most a constant times hh, so only boundedly many of the remaining grid intervals are met. There are at most C′h−(r−1)C' h^{-(r-1)} such boxes in the fixed bounding region. The boundary of PP is contained in finitely many such hyperplanes. Its grid boxes therefore have total volume tending to zero.

The upper and lower grid sums for cc on the boxes wholly inside PP differ by at most the bounding volume times the modulus of continuity of cc at distance rh\sqrt r h. The boundary boxes add an error bounded by Chsup⁡∣c∣C h\sup|c|. Both errors tend to zero. Refining two grids gives the same limit, which defines the integral. The same bounds allow signed functions and prove additivity under a finite polyhedral dissection: its additional faces lie in finitely many hyperplanes and contribute zero. They also prove that lower-dimensional polyhedra have zero rr-dimensional integral. For unbounded polyhedra, intersect with a box containing the compact support in its interior; a larger box gives the same value.

We will use iterated integration in these coordinates. The same construction proves it for the functions just considered. On each line parallel to a coordinate axis, the characteristic function of a polytope times a continuous function is piecewise continuous on finitely many intervals. The upper and lower step functions of a rectangular grid bound its one-dimensional integrals. Integrating these step functions in the remaining variables gives exactly their rectangular grid sums. Their difference tends to zero by the preceding estimates. Thus both orders of integration have the same limit. This argument also proves existence of the required outer integrals; it does not assume an interchange theorem.

One-dimensional translation and scaling follow directly by translating or scaling interval subdivisions. Interchanging coordinates follows from the equality of iterated integrals. A shear xi↦xi+cxjx_i\mapsto x_i+c x_j preserves the integral, because after fixing all other coordinates it is a translation in xix_i. Every invertible real matrix is a product of shears, coordinate interchanges and nonzero diagonal scalings, by Gaussian elimination. Hence ordinary real change of variables for an invertible affine map with linear matrix LL has factor ∣det⁡L∣|\det L|. All the intermediate regions are polyhedra, so the preceding integral constructions apply at every step.

In integral bases, pullback of a top superform contributes (det⁡L)2(\det L)^2, one determinant from each exterior factor. The scalar change of variables contributes ∣det⁡L∣−1|\det L|^{-1}. Their product is ∣det⁡L∣|\det L|. For a full-rank integral lattice map this is [Nτ:F(Nσ)][N_\tau:F(N_\sigma)], by the integer basis calculation in Lemma 5.14.1. A change of integral basis has determinant ±1\pm1, proving independence of the normalization. If the rank is less than dd, the pullback on ⋀d\bigwedge^d is zero. This proves the first assertions.

For completeness, the one-dimensional derivative formula also follows from the same integral. If gg is continuous, the difference quotient of G(t)=∫atg(s) dsG(t)=\int_a^t g(s)\,ds lies between the minimum and maximum of gg on the intervening interval; hence G′=gG'=g. A function with zero derivative is constant by the mean value argument: a continuous function on a closed interval attains its extrema by the compactness just proved, an interior extremum of a differentiable function has derivative zero, and subtraction of the line through the endpoint values gives Rolle’s argument. Applying this to a C1C^1 function minus the primitive of its derivative gives ∫abh′(s) ds=h(b)−h(a).\int_a^b h'(s)\,ds=h(b)-h(a).

Apply this identity on the coordinate lines through a polyhedron, followed by the established iterated integration. For a coordinate xjx_j, almost every such line meets a bounded convex polytope in an interval. Its endpoints lie on facets; the projections of intersections of distinct facets have dimension at most r−2r-2 and have zero (r−1)(r-1)-dimensional integral by the grid estimate. On a facet written xj=ℓ(x^j)x_j=\ell(\widehat x_j) the endpoint sign is the sign of the jj-th outward normal component. Give the facet its Euclidean measure in orthonormal affine coordinates; the proved linear change of variables computes this measure in any other affine parametrization. The graph’s Euclidean area factor is 1+∣∇ℓ∣2\sqrt{1+|\nabla\ell|^2}, obtained by taking the determinant of the Gram matrix I+∇ℓ ∇ℓtI+\nabla\ell\,\nabla\ell^{\mathsf t}. The absolute value of the corresponding unit-normal component is its reciprocal. Thus the endpoint integral is exactly the facet integral of that normal component times the coefficient. Facets parallel to these lines have zero normal component and give no term. Summing over jj proves the divergence formula on a polytope for a C1C^1 vector field. The argument applies to an unbounded polyhedron with compact support by cutting with a box outside the support; all the new facet terms vanish.

We now apply this coefficient formula to β\beta. Put sd=(−1)d(d−1)/2s_d=(-1)^{d(d-1)/2}. In coordinates for any integral basis of NσN_\sigma, write its tangential restriction uniquely as β=sd∑j=1d(−1)j−1bj d′x1∧⋯d′xj^⋯∧d′xd∧d′′x1∧⋯∧d′′xd.\beta=s_d\sum_{j=1}^d(-1)^{j-1}b_j\, d'x_1\wedge\cdots\widehat{d'x_j}\cdots\wedge d'x_d \wedge d''x_1\wedge\cdots\wedge d''x_d. Direct differentiation gives d′β=(∑j∂jbj)ωNσd'\beta=(\sum_j\partial_j b_j)\omega_{N_\sigma}. At a facet, the chosen basis of NτN_\tau followed by uσ/τu_{\sigma/\tau} is an integral basis of NσN_\sigma: the quotient is free of rank one and its indicated element is primitive. This is again Lemma 5.14.1. Use its affine coordinates (t1,…,td−1,s)(t_1,\ldots,t_{d-1},s), with the facet in s=0s=0 and the polyhedron locally in s≥0s\geq0. The divergence contribution of this facet is −bd(t,0) dt1⋯dtd−1-b_d(t,0)\,dt_1\cdots dt_{d-1}. On the other hand, β(v1′,…,vd−1′;v1′′,…,vd−1′′,uσ/τ′′)=sd(−1)d−1bd(t,0).\beta(v_1',\ldots,v_{d-1}'; v_1'',\ldots,v_{d-1}'',u_{\sigma/\tau}'') =s_d(-1)^{d-1}b_d(t,0). The ratio of these two expressions is (−1)dsd=(−1)d(d+1)/2(-1)^d s_d=(-1)^{d(d+1)/2}. A unimodular change of cell coordinates has absolute determinant one; the two exterior factors and the scalar change of variables above therefore preserve this facet calculation. This proves (5.46.1) for all facets with one common sign. A basis change in NτN_\tau contributes its determinant twice, and a change of the lift by a tangent vector gives a repeated vector in the double-primed alternating factor. These observations prove the last assertion. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002389, 5.46.2.

Proof in chapter · Fixed-edition record