Closed

Initial degenerations describe local stars

Theorem 5.16.6. (Initial degenerations describe local stars). Let X⊂Spec⁡K[M]X\subset\operatorname{Spec}K[M] be a closed subscheme and w∈Trop⁡(X)w\in\operatorname{Trop}(X). Give the residue field of an initial degeneration Y=in⁡w(X)Y=\operatorname{in}_w(X) the trivial absolute value. Then Trop⁡(Y)=Star⁡wTrop⁡(X).\operatorname{Trop}(Y)=\operatorname{Star}_w\operatorname{Trop}(X). Here the right side consists of those uu for which w+εu∈Trop⁡(X)w+\varepsilon u\in\operatorname{Trop}(X) for all sufficiently small positive ε\varepsilon. More precisely, for every fixed uu, the schemes in⁡w+εu(X)\operatorname{in}_{w+\varepsilon u}(X) and in⁡u(Y)\operatorname{in}_u(Y) are equivalent after residue extension and translation for all sufficiently small positive ε\varepsilon.

Proof

Proof. Homogenize as in Theorem 5.16.5, and write ω=(0,w)\omega=(0,w) and υ=(0,u)\upsilon=(0,u). Choose the common degree bound DD of Proposition 5.16.3, also valid for the further initial ideals. In every degree at most DD, minimize the pair (pB(ω), ∑b∈B⟨b,υ⟩).\left(p_B(\omega),\ \sum_{b\in B}\langle b,\upsilon\rangle\right). There are finitely many pairs. Thus a lexicographically minimizing basis is minimizing for pB(ω+ευ)p_B(\omega+\varepsilon\upsilon) whenever ε>0\varepsilon>0 is sufficiently small. Cramer’s rule then says that its surviving row entries are exactly those which first survive at ω\omega and then have minimal υ\upsilon-weight. After the first reduction these rows are a basis of the degree piece of in⁡ω(H)\operatorname{in}_\omega(H); their second reduction is therefore its degree piece at υ\upsilon, by Lemma 5.16.4.

We spell out the coefficient comparison. Fix a complete field LL and tt of value ω\omega. Adjoin Gauss variables qiq_i of values ευi\varepsilon\upsilon_i to LL and complete their fraction field, obtaining EE. Use tqtq for the one-step translation. For a row entry cbmc_{bm} put a=m−ba=m-b. An entry survives both operations precisely when v(cbm)+⟨a,ω⟩=0,⟨a,υ⟩=0.v(c_{bm})+\langle a,\omega\rangle=0, \qquad \langle a,\upsilon\rangle=0. Its coefficient after the first reduction is cbmta‾∈L~\overline{c_{bm}t^a}\in\widetilde L. The ordinary weight initial form over the trivially valued field retains this coefficient. The one-step coefficient in E~\widetilde E is cbmta‾ qa‾\overline{c_{bm}t^a}\,\overline{q^a}. Thus the discrepancy is exactly the character a↦qa‾a\mapsto\overline{q^a} on the subgroup generated by the surviving exponent differences. Extend this character to the whole exponent lattice by the finite root-adjunction argument in the preceding theorem. A single torus translation then compares all the row generators.

For completeness, the ordinary initial ideal obtained by retaining the terms of least υ\upsilon-weight agrees, up to this same kind of translation, with the valued-extension definition of in⁡υ\operatorname{in}_{\upsilon} over a trivially valued field. Indeed, introduce Gauss variables sis_i of values υi\upsilon_i and divide each selected row by its pivot monomial. For a retained exponent difference aa one has ⟨a,υ⟩=0\langle a,\upsilon\rangle=0, so the only new coefficient factor is the character a↦sa‾a\mapsto\overline{s^a}. This also extends after algebraic residue extension. The common degree bound identifies the full homogeneous ideals from the compared rows. Localizing and dehomogenizing gives the claimed scheme equivalence. The nonemptiness criterion of Theorem 5.13.6, over both fields, gives the equality of supports. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-002093, 5.16.6.

Proof in chapter · Fixed-edition record