A Komlós Theorem for abstract Banach lattices of measurable functions
نویسندگان
چکیده
منابع مشابه
A Banach-stone Theorem for Riesz Isomorphisms of Banach Lattices
Let X and Y be compact Hausdorff spaces, and E, F be Banach lattices. Let C(X,E) denote the Banach lattice of all continuous E-valued functions on X equipped with the pointwise ordering and the sup norm. We prove that if there exists a Riesz isomorphism Φ : C(X,E) → C(Y, F ) such that Φf is non-vanishing on Y if and only if f is non-vanishing on X, then X is homeomorphic to Y , and E is Riesz i...
متن کاملGeneralized Rings of Measurable and Continuous Functions
This paper is an attempt to generalize, simultaneously, the ring of real-valued continuous functions and the ring of real-valued measurable functions.
متن کاملMeasurable Multifunctions in Nonseparable Banach
In this article we define measurable multifunctions in nonseparable Banach spaces, prove a weak compactness criterion for the selectors of multifunctions integrably bounded, characterize Banach spaces that have the Radon–Nikodym property by means of convergence of multivalued martingales, generalize some recent results on convergence of set-valued conditional expectations, and give some applica...
متن کاملThe Hahn-banach Theorem Implies the Existence of a Non Lebesgue-measurable Set
§0. Introduction. Few methods are known to construct non Lebesgue-measurable sets of reals: most standard ones start from a well-ordering of R, or from the existence of a non-trivial ultrafilter over ω, and thus need the axiom of choice AC or at least the Boolean Prime Ideal theorem BPI (see [5]). In this paper we present a new way for proving the existence of non-measurable sets using a conven...
متن کاملBrooks’s Theorem for Measurable Colorings
Throughout, by a graph we mean a simple undirected graph, where the degree of a vertex is its number of neighbors, and a d-coloring is a function assigning each vertex one of d colors so that adjacent vertices are mapped to different colors. This paper examines measurable analogues of Brooks’s Theorem. While a straightforward compactness argument extends Brooks’s Theorem to infinite graphs, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2011
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2011.05.010