Concept

Kolmogorov's normability criterion

In mathematics, Kolmogorov's normability criterion is a theorem that provides a necessary and sufficient condition for a topological vector space to be ; that is, for the existence of a norm on the space that generates the given topology. The normability criterion can be seen as a result in same vein as the Nagata–Smirnov metrization theorem and Bing metrization theorem, which gives a necessary and sufficient condition for a topological space to be metrizable. The result was proved by the Russian mathematician Andrey Nikolayevich Kolmogorov in 1934. Because translation (that is, vector addition) by a constant preserves the convexity, boundedness, and openness of sets, the words "of the origin" can be replaced with "of some point" or even with "of every point". It may be helpful to first recall the following terms: A (TVS) is a vector space equipped with a topology such that the vector space operations of scalar multiplication and vector addition are continuous. A topological vector space is called if there is a norm on such that the open balls of the norm generate the given topology (Note well that a given normable topological vector space might admit multiple such norms.) A topological space is called a if, for every two distinct points there is an open neighbourhood of that does not contain In a topological vector space, this is equivalent to requiring that, for every there is an open neighbourhood of the origin not containing Note that being T1 is weaker than being a Hausdorff space, in which every two distinct points admit open neighbourhoods of and of with ; since normed and normable spaces are always Hausdorff, it is a "surprise" that the theorem only requires T1.

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