Proposition. (The three cell cases; F8GP-6). The coefficients before common refinement are as follows.
If , the image is bounded, has dimension , and has coefficient .
If , let be with its -th column removed and put The image has dimension , is unbounded, and has coefficient . For , the empty-lattice index is one.
If , the image has rank ; it contributes zero to .
Coincident image pieces are counted by summing their coefficients. Moreover, one may take as a common strict upper bound for all bounded image cells and a cylindrical-tail threshold for the unbounded image cells.
Proof
Proof. When , is injective over , so (4.1) has rank , and the definition of pushforward gives its index. All coordinates of the source cell are bounded.
For , the base coordinate is zero and the source variable is free in . The target tangent space is with saturated lattice . Projection of the image lattice to the first factor has image , of index . Its intersection with the vertical lattice is exactly : independence of the remaining columns of forces all their coefficients to vanish in a vertical combination. Counting cosets first in the base and then vertically gives index .
For general , the base has independent directions. All vertical source directions map into the same line, and at least one maps nontrivially since all . The rank is therefore .
On every bounded cell, , so . On a cell with unique vertical branch , its image lies above the lower graph where whenever . This lower graph is everywhere at most . Above (4.2), any is obtained by choosing . The image is thus a vertical cylinder there. Common refinements may be taken after cutting at this same height, without introducing a new larger threshold. ◻