Concept

Ramification group

In number theory, more specifically in local class field theory, the ramification groups are a filtration of the Galois group of a local field extension, which gives detailed information on the ramification phenomena of the extension. In mathematics, the ramification theory of valuations studies the set of extensions of a valuation v of a field K to an extension L of K. It is a generalization of the ramification theory of Dedekind domains. The structure of the set of extensions is known better when L/K is Galois. Let (K, v) be a valued field and let L be a finite Galois extension of K. Let Sv be the set of equivalence classes of extensions of v to L and let G be the Galois group of L over K. Then G acts on Sv by σ[w] = [w ∘ σ] (i.e. w is a representative of the equivalence class [w] ∈ Sv and [w] is sent to the equivalence class of the composition of w with the automorphism σ : L → L; this is independent of the choice of w in [w]). In fact, this action is transitive. Given a fixed extension w of v to L, the decomposition group of w is the stabilizer subgroup Gw of [w], i.e. it is the subgroup of G consisting of all elements that fix the equivalence class [w] ∈ Sv. Let mw denote the maximal ideal of w inside the valuation ring Rw of w. The inertia group of w is the subgroup Iw of Gw consisting of elements σ such that σx ≡ x (mod mw) for all x in Rw. In other words, Iw consists of the elements of the decomposition group that act trivially on the residue field of w. It is a normal subgroup of Gw. The reduced ramification index e(w/v) is independent of w and is denoted e(v). Similarly, the relative degree f(w/v) is also independent of w and is denoted f(v). Ramification groups are a refinement of the Galois group of a finite Galois extension of local fields. We shall write for the valuation, the ring of integers and its maximal ideal for . As a consequence of Hensel's lemma, one can write for some where is the ring of integers of . (This is stronger than the primitive element theorem.

À 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.