Rådström's embedding theorem

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

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]

CK(X) and the Hausdorff metric

[edit | edit source]

For any normed vector space (X,||||), let CK(X) be the set of all its convex and compact subsets. We can endow CK(X) with a metric structure given by the Hausdorff metric

dH(A,B)=supxX|d(x,A)d(x,B)|,

where d is the metric over X induced by the norm ||||, and d(x,Y)=infyYd(x,y) is the distance from x to a set YX. It is well known that (CK(X),dH) 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 (X,||||) be a normed space. Then there exists a normed space (Y,||||Y) such that the space (CK(X),dH) can be isometrically embedded into a convex cone CY. Furthermore, it is possible to construct a "minimal" Y 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 X be a real LCTVS, and CB(X) the set of all its closed, convex, (strongly) bounded subsets. Denoting by X* the dual space of X, consider the closed unit ball *X*, and the Banach space 𝒞b(*) of all continuous, bounded functions h:B*. For each ACB(X), let sA𝒞b(*) defined by

sA(x)=supyAx,y

be its support function. Then the mapping H:CB(X)𝒞b(*) given by

AsA

is an isometric embedding into a convex cone in 𝒞b(*). Moreover, by the properties of support functions such embedding is also linear when CB(X) 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]
  1. ^ Minimal in the sense that for any other normed space (Z,||||Z) into which (CK(X),dH) can be embedded, (Y,||||Y) can also be embedded into a subspace of (Z,||||Z) in which (CK(X),dH) was embedded.

References

[edit | edit source]
  1. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  7. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  8. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).