Michael selection theorem

From Wikipedia, the free encyclopedia

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]

Page Template:Math theorem/styles.css has no content.

Michael Selection TheoremLet X be a paracompact space and Y be a separable Banach space. Let F:XY be a lower hemicontinuous set-valued function with nonempty convex closed values. Then there exists a continuous selection f:XY 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.


Examples

File:Kakutani.svg

A function that satisfies all requirements

The function: F(x)=[1x/2,1x/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)=1x/2 or f(x)=13x/8.

A function that does not satisfy lower hemicontinuity

The function

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

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(tx) is a nonempty closed and convex set for all (tx). 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 xX, all neighborhoods V of 0 there exists a neighborhood U of x such that uU{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 xX, 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:XY such that for each xX, 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

Page Template:Reflist/styles.css has no content.

  1. ^ Page Module:Citation/CS1/styles.css has no content.Michael, Ernest (1956). "Continuous selections. I". Annals of Mathematics. Second Series. 63 (2): 361–382. doi:10.2307/1969615. hdl:10338.dmlcz/119700. JSTOR 1969615. MR 0077107.
  2. ^ Page Module:Citation/CS1/styles.css has no content."proof verification - Reducing Kakutani's fixed-point theorem to Brouwer's using a selection theorem". Mathematics Stack Exchange. Retrieved 2019-10-29.
  3. ^ Page Module:Citation/CS1/styles.css has no content.Deutsch, Frank; Kenderov, Petar (January 1983). "Continuous Selections and Approximate Selection for Set-Valued Mappings and Applications to Metric Projections". SIAM Journal on Mathematical Analysis. 14 (1): 185–194. doi:10.1137/0514015.
  4. ^ Page Module:Citation/CS1/styles.css has no content.Xu, Yuguang (December 2001). "A Note on a Continuous Approximate Selection Theorem". Journal of Approximation Theory. 113 (2): 324–325. doi:10.1006/jath.2001.3622.

Further reading

Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.