Acta Applicandae Mathematica

, Volume 5, Issue 3, pp 209–237

Embedding theorems for classes of convex sets

  • Klaus D. Schmidt

DOI: 10.1007/BF00047343

Cite this article as:
Schmidt, K.D. Acta Appl Math (1986) 5: 209. doi:10.1007/BF00047343


Rådström's embedding theorem states that the nonempty compact convex subsets of a normed vector space can be identified with points of another normed vector space such that the embedding map is additive, positively homogeneous, and isometric. In the present paper, extensions of Rådström's embedding theorem are proven which provide additional information on the embedding space. These results include those of Hörmander who proved a similar embedding theorem for the nonempty closed bounded convex subsets of a Hausdorff locally convex vector space. In contrast to Hörmander's approach via support functionals, all embedding theorems of the present paper are proven by a refinement of Rådström's original method which is constructive and does not rely on Zorn's lemma. This paper also includes a brief discussion of some actual or potential applications of embedding theorems for classes of convex sets in probability theory, mathematical economics, interval mathematics, and related areas.

AMS (MOS) subject classifications (1980)

Primary: 52A0746A40secondary: 28B2047H1054C6060D0565G1090A14

Key words

Classes of convex setsembedding theoremstopological vector latticesintegration of random setslimit theorems for random setsfixed-point theorems for set-valued mapsmathematical economicsinterval mathematics

Copyright information

© D. Reidel Publishing Company 1986

Authors and Affiliations

  • Klaus D. Schmidt
    • 1
  1. 1.Seminar für StatistikUniversität Mannheim, A5MannheimWest Germany