research

Key polynomials for simple extensions of valued fields

Abstract

Let ι:KLK(x)\iota:K\hookrightarrow L\cong K(x) be a simple transcendental extension of valued fields, where KK is equipped with a valuation ν\nu of rank 1. That is, we assume given a rank 1 valuation ν\nu of KK and its extension ν\nu' to LL. Let (Rν,Mν,kν)(R_\nu,M_\nu,k_\nu) denote the valuation ring of ν\nu. The purpose of this paper is to present a refined version of MacLane's theory of key polynomials, similar to those considered by M. Vaqui\'e, and reminiscent of related objects studied by Abhyankar and Moh (approximate roots) and T.C. Kuo. Namely, we associate to ι\iota a countable well ordered set Q={Qi}iΛK[x]; \mathbf{Q}=\{Q_i\}_{i\in\Lambda}\subset K[x]; the QiQ_i are called {\bf key polynomials}. Key polynomials QiQ_i which have no immediate predecessor are called {\bf limit key polynomials}. Let βi=ν(Qi)\beta_i=\nu'(Q_i). We give an explicit description of the limit key polynomials (which may be viewed as a generalization of the Artin--Schreier polynomials). We also give an upper bound on the order type of the set of key polynomials. Namely, we show that if char kν=0\operatorname{char}\ k_\nu=0 then the set of key polynomials has order type at most ω\omega, while in the case char kν=p>0\operatorname{char}\ k_\nu=p>0 this order type is bounded above by ω×ω\omega\times\omega, where ω\omega stands for the first infinite ordinal.Comment: arXiv admin note: substantial text overlap with arXiv:math/060519

    Similar works

    Full text

    thumbnail-image

    Available Versions