Rådström's embedding theorem
In functional analysis, Rådström's embedding theorem is a result related to the set of compact and convex subsets of a normed vector space. It states that such sets can be isometrically embededded into a convex cone in another normed vector space.
The theorem is an important result in that it shows that this family of sets has natural linear and metric structures, which allows for simpler algebraic manipulations via the embedding. It was first proven by Hans Rådström in 1952.[1]
An extension of Rådström's result to locally convex topological vector spaces, known as the Hörmander embedding theorem, was proven by Lars Hörmander in 1954.[2]
Preliminaries
[edit | edit source]and the Hausdorff metric
[edit | edit source]For any normed vector space , let be the set of all its convex and compact subsets. We can endow with a metric structure given by the Hausdorff metric
where is the metric over induced by the norm , and is the distance from to a set . It is well known that forms a metric space of its own right.[3]
Theorem
[edit | edit source]Main version
[edit | edit source]The main version of Rådström's theorem reads as follows:[1][4]
Theorem (Rådström, 1952): Let be a normed space. Then there exists a normed space such that the space can be isometrically embedded into a convex cone . Furthermore, it is possible to construct a "minimal" for which this holds.[nb 1]
Extensions
[edit | edit source]It is possible to generalize Rådström's theorem to locally convex topological vector spaces (LCTVS). This is done via Hörmander's embedding theorem, proven by Lars Hörmander in 1954.[2] Hörmander's theorem explicitly constructs an embedding via support functions of closed, convex, (strongly) bounded sets.
Theorem (Hörmander, 1954): let be a real LCTVS, and the set of all its closed, convex, (strongly) bounded subsets. Denoting by the dual space of , consider the closed unit ball , and the Banach space of all continuous, bounded functions . For each , let defined by
be its support function. Then the mapping given by
is an isometric embedding into a convex cone in . Moreover, by the properties of support functions such embedding is also linear when is endowed with a vector-space structure given by the Minkowski sum and scalar multiplication.[4]
Applications
[edit | edit source]Integration of set-valued functions
[edit | edit source]The theorem can be used to define the integral of a set-valued function (or correspondence) via Debreu's integral.[5][6] This has applications, for example, in the theory of random compact sets.[7][8]
Notes
[edit | edit source]- ^ Minimal in the sense that for any other normed space into which can be embedded, can also be embedded into a subspace of in which was embedded.
References
[edit | edit source]- ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).