A Dedekind criterion for arbitrary valuation rings (Q2477490)

From MaRDI portal
Revision as of 19:56, 14 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A Dedekind criterion for arbitrary valuation rings
scientific article

    Statements

    A Dedekind criterion for arbitrary valuation rings (English)
    0 references
    13 March 2008
    0 references
    The starting point of the paper is the following Problem. Let \((K,R)\) a valued field, \(L\) a finite extension of degree \(n\) suppose \(L=K[\theta]\), \(\theta \in S\) where \(S\) is the integral closure of \(R\) in \(L\). When does \(S\) coincide with \(R[\theta]\)? This is indeed a quite natural question. The author answers in the most general case. Notations. Let \(f\in R[X]\) be the minimal polynomial of \(\theta\) over \(K\) and let \[ \overline{f}=g_0^{e_0}g_1^{e_1}\cdots g_{r-1}^{e_{r-1}} \] be the decomposition of the image \(\overline{f}\) of \(f\) in \(F_R[X]\) (\(F_R\) is the residual field of \(R\)) such that \(g_0,g_1\cdots g_{r-1}\) are pairwise different unitary polynomials irreducible over \(F_R\), we assume \(e_i \geq 1\), for \(0 \leq i \leq r-1\). Let \(h_0,h_1\cdots h_{r-1}\in R[X]\) be unitary polynomials such that \(\overline{h_i}=g_i\), for \(0 \leq i \leq r-1\) and \(h:=h_0^{e_0}h_1^{e_1}\cdots h_{r-1}^{e_{r-1}}\). We define \(M\) by \(f-h=\pi M\) where \(\pi \in R\), \(M\in R[X]\) and \(\overline{M}\not=0\). Theorem. The equality \[ S=R[\theta] \] holds if and only if we have one of the following cases: (i) either \(e_0=e_1=....=e_{r-1}=1\) (ii) or there exists an \(i_1\), then \(\Gamma^+_R \) (the set of strictly positive elements of the group of the valuation \(v_R\)) has a minimal element which is \(v_R(\pi)\) and \(g_i\) does not divide \(\overline{M}\) for all \(i_1\). We recall that a non \(\{0\}\) group of values has a minimal element if and only the minimal convex subgroup is \(\mathbb Z\). The necessity condition is proved by basic commutative algebra, the sufficiency is much deeper and more technical (the notions of ultrapower, ultrafilter are used). Reviewer's remark: This paper is a translation of a Russian article. This translation is a true disaster. We are pretty confident that the original was clear and correct and that the ambiguities of the statements, the numerous misprints, the strange symbols of this version are not due to the author.
    0 references
    0 references

    Identifiers