Concept

Locally compact field

In algebra, a locally compact field is a topological field whose topology forms a locally compact Hausdorff space. These kinds of fields were originally introduced in p-adic analysis since the fields are locally compact topological spaces constructed from the norm on . The topology (and metric space structure) is essential because it allows one to construct analogues of algebraic number fields in the p-adic context. One of the useful structure theorems for vector spaces over locally compact fields is that the finite dimensional vector spaces have only an equivalence class of norm: the sup norm pg. 58-59. Given a finite field extension over a locally compact field , there is at most one unique field norm on extending the field norm ; that is,for all which is in the image of . Note this follows from the previous theorem and the following trick: if are two equivalent norms, andthen for a fixed constant there exists an such thatfor all since the sequence generated from the powers of converge to . If the index of the extension is of degree and is a Galois extension, (so all solutions to the minimal polynomial of any is also contained in ) then the unique field norm can be constructed using the field norm pg. 61. This is defined asNote the n-th root is required in order to have a well-defined field norm extending the one over since given any in the image of its norm issince it acts as scalar multiplication on the -vector space . All finite fields are locally compact since they can be equipped with the discrete topology. In particular, any field with the discrete topology is locally compact since every point is the neighborhood of itself, and also the closure of the neighborhood, hence is compact. The main examples of locally compact fields are the p-adic rationals and finite extensions . Each of these are examples of local fields. Note the algebraic closure and its completion are not locally compact fields pg. 72 with their standard topology. Field extensions can be found by using Hensel's lemma.

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