Concept

Théorème de sélection de Michael

In functional analysis, a branch of mathematics, Michael selection theorem is a selection theorem named after Ernest Michael. In its most popular form, it states the following: Let X be a paracompact space and Y a Banach space. Let be a lower hemicontinuous set-valued function with nonempty convex closed values. Then there exists a continuous selection of F. Conversely, if any lower semicontinuous multimap from topological space X to a Banach space, with nonempty convex closed values, admits a continuous selection, then X is paracompact. This provides another characterization for paracompactness. The function: , shown by the grey area in the figure at the right, is a set-valued function from the real interval [0,1] to itself. It satisfies all Michael's conditions, and indeed it has a continuous selection, for example: or . The function is a set-valued function from the real interval [0,1] to itself. It has nonempty convex closed values. However, it is not lower hemicontinuous at 0.5. Indeed, Michael's theorem does not apply and the function does not have a continuous selection: any selection at 0.5 is necessarily discontinuous. Michael selection theorem can be applied to show that the differential inclusion has a C1 solution when F is lower semi-continuous and F(t, x) is a nonempty closed and convex set for all (t, x). When F is single valued, this is the classic Peano existence theorem. A theorem due to Deutsch and Kenderov generalizes Michel selection theorem to an equivalence relating approximate selections to almost lower hemicontinuity, where is said to be almost lower hemicontinuous if at each , all neighborhoods of there exists a neighborhood of such that Precisely, Deutsch–Kenderov theorem states that if is paracompact, a normed vector space and is nonempty convex for each , then is almost lower hemicontinuous if and only if has continuous approximate selections, that is, for each neighborhood of in there is a continuous function such that for each , .

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