Dissertation/Thesis Abstract

Extension of Lyapunov's Convexity Theorem to Subranges
by Dai, Peng, Ph.D., State University of New York at Stony Brook, 2011, 61; 3477345
Abstract (Summary)

Consider a measurable space with a finite vector measure. This measure defines a mapping of the σ-field into a Euclidean space. According to Lyapunov’s convexity theorem, the range of this mapping is compact and, if the measure is atomless, this range is convex. Similar ranges are also defined for measurable subsets of the space. We show that the union of the ranges of all subsets having the same given vector measure is also compact and, if the measure is atomless, it is convex. We further provide a geometrically constructed convex compact set in the Euclidean space that contains this union. We show that, for two-dimensional measures, among all the subsets having the same given vector measure, there exists a set with the maximal range of the vector measure (maximal subset). Furthermore, for two-dimensional measures, the maximal subset, the above-mentioned union, and the above-mentioned convex compact set are equal sets. We also give counterexamples showing that, in three or higher dimensions, the maximal subset may not exist and these equalities may not hold. We use the existence of maximal subsets to strengthen the Dvoretzky-Wald-Wolfowitz purification theorem for the case of two measures. We show that there are no similar results for three or higher dimensions.

Indexing (document details)
Advisor: Feinberg, Eugene A., Mitchell, Joseph S. B.
Commitee: Arkin, Esther M., Bishop, Christopher J.
School: State University of New York at Stony Brook
Department: Applied Mathematics and Statistics
School Location: United States -- New York
Source: DAI-B 73/01, Dissertation Abstracts International
Source Type: DISSERTATION
Subjects: Applied Mathematics, Operations research
Keywords: Atomless vector measure, Lyapunov's convexity theorem, Maximal subset, Purification of transition probabilities, Subranges
Publication Number: 3477345
ISBN: 978-1-124-93854-7
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest