Closed

Primitive cuts and determinant recursion

Lemma. (Primitive cuts and determinant recursion). Assume r≥1r\geq1. There is an RR-basis e0,…,ere_0,\ldots,e_r of EE with u(e0)=1u(e_0)=1 and E′=ker⁡u=Re1⊕⋯⊕RerE'=\ker u=Re_1\oplus\cdots\oplus Re_r. The horizontal model cut is P(E′)≃PRr−1\mathbf P(E')\simeq\mathbf P_R^{r-1}. For r≥1r\geq1, a section s=ℓms=\ell^m with metric shift cc and clearing exponent ee as above has normalized model divisor 1ecyc⁡(div⁡O(em)(s⊗e))=m[P(E′)]+(ma+c)[V].\begin{equation} \frac1e\operatorname{cyc}\bigl(\operatorname{div}_{\mathcal O(em)}(s^{\otimes e})\bigr) =m[\mathbf P(E')]+(ma+c)[V]. \end{equation} The generic divisor is m[P(EK′)]m[\mathbf P(E'_K)]. A negative ma+cma+c is allowed as a rational vertical coefficient. All coefficients are computed by ordinary algebraic DVR orders, with actual quotient lengths.

If ℓ=ℓi\ell=\ell_i is a row of an invertible (r+1)(r+1)-row matrix AA, the other rows restrict to an invertible rr-row matrix AiA_i on EK′E'_K, and v(det⁡A)=ai+v(det⁡Ai).\begin{equation} v(\det A)=a_i+v(\det A_i). \end{equation} The restricted standard metric is the standard metric for the lattice E′E', with the same shift cjc_j and exponent mjm_j for every remaining line. No primitivity of these restricted rows is assumed.

Proof

Proof. Permute the coordinates to make a unit coefficient first, divide that coordinate vector by the unit, and subtract multiples of it from the other coordinate vectors. These are invertible RR-operations and give the displayed basis. The content is the fractional ideal generated by the row coefficients, so this ideal and aa are invariant under an invertible RR-basis change. The primitive equation is now z0=0z_0=0. Its model quotient is a polynomial projective hyperplane over RR, which proves the claim about P(E′)\mathbf P(E').

In a model frame, the coefficient of s⊗es^{\otimes e} has a factor πe(ma+c)uem\pi^{e(ma+c)}u^{em}. At the generic point of the horizontal hyperplane its order is emem, and at the generic point of VV its order is e(ma+c)e(ma+c). These are the only components of the divisor. At a DVR with parameter tt, the successive powers in A/(tn)A/(t^n) give length nn; for a rational coefficient one subtracts the lengths of numerator and denominator. Thus no nilpotent layer in uem=0u^{em}=0 is removed. Divide the coefficients by ee to obtain (I.0.2).

Move row ii to the first position and use the constructed basis. The matrix becomes (πai0∗Ai).\begin{pmatrix}\pi^{a_i}&0\\ *&A_i\end{pmatrix}. Row permutation and the basis matrix have determinant a unit up to sign, proving (I.0.3); its nonzero determinant also proves that AiA_i is invertible over KK. Finally, a matrix in GLr+1(R)\mathrm{GL}_{r+1}(R) and its inverse both have operator norm at most one for the maximum norm over every valued extension of KK. Consequently the maximum norm is unchanged. Restriction to the direct summand E′E' gives exactly the standard metric in its basis. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002928.

Proof in chapter · Fixed-edition record