Multivariate ultrametric root counting
Abstract
Let K be a field, complete with respect to a discrete non-archimedian valuation and let k be the residue field. Consider a system F of n polynomial equations in K. Our first result is a reformulation of the classical Hensel's Lemma in the language of tropical geometry: we show sufficient conditions (semiregularity at w) that guarantee that the first digit map δ:(K)n(k)n is a one to one correspondence between the solutions of F in (K)n with valuation w and the solutions in (k)n of the initial form system inw(F). Using this result, we provide an explicit formula for the number of solutions in (K)n of a certain class of systems of polynomial equations (called regular), characterized by having finite tropical prevariety, by having initial forms consisting only of binomials, and by being semiregular at any point in the tropical prevariety. Finally, as a consequence of the root counting formula, we obtain the expected number of roots in (K) of univariate polynomials with given support and random coefficients.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.