In mathematics, a mathematical object is said to satisfy a property locally, if the property is satisfied on some limited, immediate portions of the object (e.g., on some sufficiently small or arbitrarily small neighborhoods of points). Perhaps the best-known example of the idea of locality lies in the concept of local minimum (or local maximum), which is a point in a function whose functional value is the smallest (resp., largest) within an immediate neighborhood of points. This is to be contrasted with the idea of global minimum (or global maximum), which corresponds to the minimum (resp., maximum) of the function across its entire domain. A topological space is sometimes said to exhibit a property locally, if the property is exhibited "near" each point in one of the following ways: Each point has a neighborhood exhibiting the property; Each point has a neighborhood base of sets exhibiting the property. Here, note that condition (2) is for the most part stronger than condition (1), and that extra caution should be taken to distinguish between the two. For example, some variation in the definition of locally compact can arise as a result of the different choices of these conditions. Locally compact topological spaces Locally connected and Locally path-connected topological spaces Locally Hausdorff, Locally regular, Locally normal etc... Locally metrizable Given some notion of equivalence (e.g., homeomorphism, diffeomorphism, isometry) between topological spaces, two spaces are said to be locally equivalent if every point of the first space has a neighborhood which is equivalent to a neighborhood of the second space. For instance, the circle and the line are very different objects. One cannot stretch the circle to look like the line, nor compress the line to fit on the circle without gaps or overlaps. However, a small piece of the circle can be stretched and flattened out to look like a small piece of the line. For this reason, one may say that the circle and the line are locally equivalent.

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