ScalingStacks

Proof. [04T7]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

Kapranov’s theorem takes care of Log⁡(w⁡(VK))=LogK⁡(VK)\operatorname{Log}(w(V_{K}))=\operatorname{Log}_{K}(V_{K}). We need to prove that the values u⁡(aj)u(a_{j}) take care of the arguments of W⁡(VK)W(V_{K}). Let x∈LogK⁡(VK)x\in\operatorname{Log}_{K}(V_{K}). By Kapranov’s theorem it means that there is a set of indices j1,…,jlj_{1},\dots,j_{l} such that val⁡(aj1)=⋯=val⁡(ajl)≥val⁡(aj)\operatorname{val}(a_{j_{1}})=\dots=\operatorname{val}(a_{j_{l}})\geq\operatorname{val}(a_{j}) for any other index jj. Let z∈(K∗)n+1z\in(K^{*})^{n+1} be a point such that LogK⁡(z)=x\operatorname{Log}_{K}(z)=x. The lowest powers of tt in the Puiseux series f⁡(z)f(z) are contributed by the monomials aj1​zj1,…,ajl​zjla_{j_{1}}z^{j_{1}},\dots,a_{j_{l}}z^{j_{l}}. If f⁡(z)=0f(z)=0 then the coefficients at these lowest powers are such that their sum is zero. Conversely, the higher powers of tt can be arranged to make f⁡(z)=0f(z)=0 without the change of W⁡(z)W(z) as in the proof of Kapranov’s theorem. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.