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. 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.
Preliminaries
C K ( X ) {\displaystyle CK(X)} and the Hausdorff metric For any normed vector space ( X , | | ⋅ | | ) {\displaystyle (X,||\cdot ||)} , let C K ( X ) {\displaystyle CK(X)} be the set of all its convex and compact subsets. We can endow C K ( X ) {\displaystyle CK(X)} with a metric structure given by the Hausdorff metric
d H ( A , B ) = sup x ∈ X | d ( x , A ) − d ( x , B ) | , {\displaystyle d_{H}(A,B)=\sup _{x\in X}|d(x,A)-d(x,B)|,}
where d {\displaystyle d} is the metric over X {\displaystyle X} induced by the norm | | ⋅ | | {\displaystyle ||\cdot ||} , and d ( x , Y ) = inf y ∈ Y d ( x , y ) {\displaystyle d(x,Y)=\inf _{y\in Y}d(x,y)} is the distance from x {\displaystyle x} to a set Y ⊆ X {\displaystyle Y\subseteq X} . It is well known that ( C K ( X ) , d H ) {\displaystyle (CK(X),d_{H})} forms a metric space of its own right.
Theorem
Main version The main version of Rådström's theorem reads as follows: Theorem (Rådström, 1952): Let ( X , | | ⋅ | | ) {\displaystyle (X,||\cdot ||)} be a normed space. Then there exists a normed space ( Y , | | ⋅ | | Y ) {\displaystyle (Y,||\cdot ||_{Y})} such that the space ( C K ( X ) , d H ) {\displaystyle (CK(X),d_{H})} can be isometrically embedded into a convex cone C ⊆ Y {\displaystyle C\subseteq Y} . Furthermore, it is possible to construct a "minimal" Y {\displaystyle Y} for which this holds.
… excerpt ends here. Continue reading the full article.
