Abstract. A net (x α ) in a vector lattice X is said to uo-converge to x if |x α −x|∧u o − → 0 for every u ≥ 0. In the first part of this paper, we study some functional-analytic aspects of uo-convergence. We prove that uo-convergence is stable under passing to and from regular sublattices. This fact leads to numerous applications presented throughout the paper. In particular, it allows us to improve several results in [26,27]. In the second part, we use uo-convergence to study convergence of Cesàro means in Banach lattices. In particular, we establish an intrinsic version of Komlós' Theorem, which extends the main results of [35,16,31] in a uniform way. We also develop a new and unified approach to Banach-Saks properties and Banach-Saks operators based on uo-convergence. This approach yields, in particular, short direct proofs of several results in [21,24,25].
We provide a variety of results for (quasi)convex, law-invariant functionals defined on a general Orlicz space, which extend well-known results in the setting of bounded random variables. First, we show that Delbaen's representation of convex functionals with the Fatou property, which fails in a general Orlicz space, can be always achieved under the assumption of lawinvariance. Second, we identify the range of Orlicz spaces where the characterization of the Fatou property in terms of norm lower semicontinuity by Jouini, Schachermayer and Touzi continues to hold. Third, we extend Kusuoka's representation to a general Orlicz space. Finally, we prove a version of the extension result by Filipović and Svindland by replacing norm lower semicontinuity with the (generally non-equivalent) Fatou property. Our results have natural applications to the theory of risk measures.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.