Closed

The three cell cases; F8GP-6

Proposition. (The three cell cases; F8GP-6). The coefficients before common refinement are as follows.

  1. If J=∅J=\varnothing, the image is bounded, has dimension nn, and has coefficient δ(Lσ)\delta(L_\sigma).

  2. If J={j}J=\{j\}, let Mj^M_{\widehat j} be MM with its jj-th column removed and put δj=[ span⁡R(Mj^)∩Zr:Mj^Zn−1 ].\delta_j= [\,\operatorname{span}_{\mathbb R}(M_{\widehat j})\cap\mathbb Z^r: M_{\widehat j}\mathbb Z^{n-1}\,]. The image has dimension nn, is unbounded, and has coefficient mjδjm_j\delta_j. For n=1n=1, the empty-lattice index is one.

  3. If ∣J∣≥2|J|\geq2, the image has rank n−∣J∣+1<nn-|J|+1<n; it contributes zero to C0C_0.

Coincident image pieces are counted by summing their coefficients. Moreover, one may take H=λ+max⁡x∈Qb⋅x+1(4.2)H=\lambda+\max_{x\in Q}b\cdot x+1 \tag{4.2} as a common strict upper bound for all bounded image cells and a cylindrical-tail threshold for the unbounded image cells.

Proof

Proof. When J=∅J=\varnothing, MM is injective over R\mathbb R, so (4.1) has rank nn, and the definition of pushforward gives its index. All coordinates of the source cell are bounded.

For J={j}J=\{j\}, the base coordinate yjy_j is zero and the source variable sjs_j is free in [0,∞)[0,\infty). The target tangent space is span⁡R(Mj^)⊕Ret,\operatorname{span}_{\mathbb R}(M_{\widehat j})\oplus\mathbb Re_t, with saturated lattice (span⁡R(Mj^)∩Zr)⊕Zet(\operatorname{span}_{\mathbb R}(M_{\widehat j})\cap\mathbb Z^r) \oplus\mathbb Ze_t. Projection of the image lattice to the first factor has image Mj^Zn−1M_{\widehat j}\mathbb Z^{n-1}, of index δj\delta_j. Its intersection with the vertical lattice is exactly mjZetm_j\mathbb Ze_t: independence of the remaining columns of MM forces all their coefficients to vanish in a vertical combination. Counting cosets first in the base and then vertically gives index mjδjm_j\delta_j.

For general JJ, the base has n−∣J∣n-|J| independent directions. All ∣J∣|J| vertical source directions map into the same line, and at least one maps nontrivially since all mi>0m_i>0. The rank is therefore n−∣J∣+1n-|J|+1.

On every bounded cell, si≤0s_i\leq0, so t≤λ+max⁡Qb⋅xt\leq\lambda+\max_Q b\cdot x. On a cell with unique vertical branch jj, its image lies above the lower graph t=λ+∑i≠jϵimiyi+b⋅x,t=\lambda+\sum_{i\ne j}\epsilon_i m_i y_i+b\cdot x, where yi≤0y_i\leq0 whenever ϵi=1\epsilon_i=1. This lower graph is everywhere at most λ+max⁡Qb⋅x\lambda+\max_Q b\cdot x. Above (4.2), any tt is obtained by choosing sj≥0s_j\geq0. 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. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002574.

Proof in chapter · Fixed-edition record