In abstract algebra, a valuation ring is an integral domain D such that for every element x of its field of fractions F, at least one of x or x−1 belongs to D. Given a field F, if D is a subring of F such that either x or x−1 belongs to D for every nonzero x in F, then D is said to be a valuation ring for the field F or a place of F. Since F in this case is indeed the field of fractions of D, a valuation ring for a field is a valuation ring. Another way to characterize the valuation rings of a field F is that valuation rings D of F have F as their field of fractions, and their ideals are totally ordered by inclusion; or equivalently their principal ideals are totally ordered by inclusion. In particular, every valuation ring is a local ring. The valuation rings of a field are the maximal elements of the set of the local subrings in the field partially ordered by dominance or refinement, where dominates if and . Every local ring in a field K is dominated by some valuation ring of K. An integral domain whose localization at any prime ideal is a valuation ring is called a Prüfer domain. There are several equivalent definitions of valuation ring (see below for the characterization in terms of dominance). For an integral domain D and its field of fractions K, the following are equivalent: For every nonzero x in K, either x is in D or x−1 is in D. The ideals of D are totally ordered by inclusion. The principal ideals of D are totally ordered by inclusion (i.e. the elements in D are, up to units, totally ordered by divisibility.) There is a totally ordered abelian group Γ (called the value group) and a valuation ν: K → Γ ∪ {∞} with D = { x ∈ K | ν(x) ≥ 0 }. The equivalence of the first three definitions follows easily. A theorem of states that any ring satisfying the first three conditions satisfies the fourth: take Γ to be the quotient K×/D× of the unit group of K by the unit group of D, and take ν to be the natural projection. We can turn Γ into a totally ordered group by declaring the residue classes of elements of D as "positive".

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.