arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.0657math.AGmath.AC
收藏

简单域扩张中的关键多项式

Key polynomials for simple extensions of valued fields

Universidad de Sevilla(塞维利亚大学);UMI CNRS 2001 LaSol, UNAM(CNRS-UNAM拉索尔联合国际实验室)

F. J. Herrera Govantes, W. Mahboub, M. A. Olalla Acosta, M. Spivakovsky

AI总结:

本文提出改进的关键多项式理论,用于描述简单域扩张中的关键多项式及其序型上界。

摘要:

设$ι:K\hookrightarrow L\cong K(x)$是赋值域的简单超越扩张,其中$K$配备一个秩为1的赋值$ν$。即,我们假设给定一个秩为1的赋值$ν$及其在$L$上的延伸$ν'$。令$(R_ν,M_ν,k_ν)$表示$ν$的赋值环。本文的目的是提出MacLane的关键多项式理论的改进版本,类似于M.Vaquié考虑的那些,也类似于Abhyankar和Moh研究的相关对象(近似根)以及T.C.Kuo研究的其他对象。具体来说,我们为$ι$关联一个可数良序集$$\mathbf{Q}=\{Q_i\}_{i\inΛ}\subset K[x];$的$Q_i$称为关键多项式。没有直接前驱的关键多项式称为极限关键多项式。令$β_i=ν'(Q_i)$。我们给出了极限关键多项式的显式描述(可视为Artin-Schreier多项式的推广)。我们还给出了关键多项式集合的序型上界。即,我们显示如果$\operatorname{char}\ k_ν=0$,则关键多项式集合的序型至多为$ω$,而在$\operatorname{char}\ k_ν=p>0$的情况下,此序型上界为$ω×ω$,其中$ω$表示第一个无限序数。

英文摘要:

Let $ι:K\hookrightarrow L\cong K(x)$ be a simple transcendental extension of valued fields, where $K$ is equipped with a valuation $ν$ of rank 1. That is, we assume given a rank 1 valuation $ν$ of $K$ and its extension $ν'$ to $L$. Let $(R_ν,M_ν,k_ν)$ denote the valuation ring of $ν$. 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é, and reminiscent of related objects studied by Abhyankar and Moh (approximate roots) and T.C. Kuo. Namely, we associate to $ι$ a countable well ordered set $$ \mathbf{Q}=\{Q_i\}_{i\inΛ}\subset K[x]; $$ the $Q_i$ are called {\bf key polynomials}. Key polynomials $Q_i$ which have no immediate predecessor are called {\bf limit key polynomials}. Let $β_i=ν'(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 $\operatorname{char}\ k_ν=0$ then the set of key polynomials has order type at most $ω$, while in the case $\operatorname{char}\ k_ν=p>0$ this order type is bounded above by $ω\timesω$, where $ω$ stands for the first infinite ordinal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑