On maximal ranges of vector measures for subsets and purification of transition probabilities

Authors:
Peng Dai and Eugene A. Feinberg

Journal:
Proc. Amer. Math. Soc. **139** (2011), 4497-4511

MSC (2010):
Primary 60A10, 28A10

DOI:
https://doi.org/10.1090/S0002-9939-2011-10860-8

Published electronically:
April 25, 2011

MathSciNet review:
2823095

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Consider a measurable space with an atomless finite vector measure. This measure defines a mapping of the -field into a Euclidean space. According to the Lyapunov convexity theorem, the range of this mapping is a convex compactum. Similar ranges are also defined for measurable subsets of the space. Two subsets with the same vector measure may have different ranges. We investigate the question whether, among all the subsets having the same given vector measure, there always exists a set with the maximal range of the vector measure. The answer to this question is positive for two-dimensional vector measures and negative for higher dimensions. We use the existence of maximal ranges to strengthen the Dvoretzky-Wald-Wolfowitz purification theorem for the case of two measures.

**1.**J. R. Barra.*Mathematical Basis of Statistics.*Academic Press, New York, 1981. MR**628863 (84h:62002)****2.**A. Dvoretzky, A. Wald, and J. Wolfowitz. Elimination of randomization in certain problems of statistics and of the theory of games.*Proc. Natl. Acad. Sci.***36**(1950), 256-260. MR**0035979 (12:40c)****3.**A. Dvoretzky, A. Wald, and J. Wolfowitz. Elimination of randomization in certain statistical decision procedures and zero-sum two-person games.*Ann. Math. Stat.***22**(1951), 1-21. MR**0039228 (12:515a)****4.**D. A. Edwards. On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov measures.*Glasg. Math. J.***29**(1987), 205-220. MR**901667 (88i:28017)****5.**E. A. Feinberg and A. B. Piunovskiy. On strongly equivalent nonrandomized transition probabilities.*Theory Probab. Appl.***54**(2010), 300-307.**6.**M. A. Khan and K. P. Rath. On games with incomplete information and the Dvoretsky-Wald-Wolfowitz theorem with countable partitions.*J. Math. Econom.***45**(2009), 830-837. MR**2564361****7.**P. Loeb and Y. Sun. Purification of measure-valued maps.*Illinois J. Math.***50**(2006), 747-762. MR**2247844 (2007j:28022)****8.**A. A. Lyapunov. Sur les fonctions-vecteurs complètement additives.*Izv. Akad. Nauk SSSR Ser. Mat.***4**(1940), 465-478. MR**0004080 (2:315e)****9.**Cz. Olech, The Lyapunov theorem: its extensions and applications, Lecture Notes in Math.**1446**, Springer, 1990, 84-103. MR**1079760 (92b:49011)****10.**D. A. Ross. An Elementary Proof of Lyapunov's Theorem.*The Amer. Math. Monthly***112**(2005), 651-653. MR**2158899 (2006e:28002)****11.**R. Schneider.*Convex Bodies: The Brunn-Minkowski Theory.*Cambridge University Press, Cambridge, 2008. MR**1216521 (94d:52007)**

Retrieve articles in *Proceedings of the American Mathematical Society*
with MSC (2010):
60A10,
28A10

Retrieve articles in all journals with MSC (2010): 60A10, 28A10

Additional Information

**Peng Dai**

Affiliation:
Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, New York 11794-3600

Email:
Peng.Dai@stonybrook.edu

**Eugene A. Feinberg**

Affiliation:
Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, New York 11794-3600

Email:
Eugene.Feinberg@sunysb.edu

DOI:
https://doi.org/10.1090/S0002-9939-2011-10860-8

Keywords:
Lyapunov convexity theorem,
maximal subset,
purification of transition probabilities.

Received by editor(s):
June 1, 2010

Received by editor(s) in revised form:
June 16, 2010, and October 20, 2010

Published electronically:
April 25, 2011

Additional Notes:
This research was partially supported by NSF grants CMMI-0900206 and CMMI-0928490.

Communicated by:
Richard C. Bradley

Article copyright:
© Copyright 2011
American Mathematical Society

The copyright for this article reverts to public domain 28 years after publication.