Michael selection theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description 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:[1]

Template:Math theorem 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.


Examples

File:Kakutani.svg

A function that satisfies all requirements

The function:

F(x)=[1−x/2,1−x/4]

, 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:

f(x)=1−x/2

or

f(x)=1−3x/8

.

A function that does not satisfy lower hemicontinuity

The function

F(x)={3/40≤x<0.5[0,1]x=0.51/40.5<x≤1

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.[2]

Applications

Michael selection theorem can be applied to show that the differential inclusion

dxdt(t)∈F(t,x(t)),x(t0)=x0

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.

Generalizations

A theorem due to Deutsch and Kenderov generalizes Michel selection theorem to an equivalence relating approximate selections to almost lower hemicontinuity, where F is said to be almost lower hemicontinuous if at each x∈X, all neighborhoods V of 0 there exists a neighborhood U of x such that ∩u∈U{F(u)+V}≠∅.

Precisely, Deutsch–Kenderov theorem states that if X is paracompact, Y a normed vector space and F(x) is nonempty convex for each x∈X, then F is almost lower hemicontinuous if and only if F has continuous approximate selections, that is, for each neighborhood V of 0 in Y there is a continuous function f:X↦Y such that for each x∈X, f(x)∈F(X)+V.[3]

In a note Xu proved that Deutsch–Kenderov theorem is also valid if Y is a locally convex topological vector space.[4]

See also

References

<templatestyles src="Reflist/styles.css" />

  1. ↑ Script error: No such module "Citation/CS1".
  2. ↑ Script error: No such module "citation/CS1".
  3. ↑ Script error: No such module "Citation/CS1".
  4. ↑ Script error: No such module "Citation/CS1".

Script error: No such module "Check for unknown parameters".

Further reading

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

Template:Functional analysis