A converse to a theorem of komlos for convex subsets of L1

7Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

Abstract

A theorem of Komlοs is a subsequence version of the strong law of large numbers. It states that if (fn)n is a sequence of norm-bounded random variables in L1 (µ), where µ is a probability measure, then there exists a subsequence (gk)k of (fn)m and f ∈ L1(µ) such that for all further subsequences (hm)m, the sequence of successive arithmetic means of {hm)m converges to f almost everywhere. In this paper we show that, conversely, if C is a convex subset of L1(µ) satisfying the conclusion of Komlοs9 theorem, then C must be L1 -norm bounded. © 1993 by Pacific Journal of Mathematics.

Cite

CITATION STYLE

APA

Lennard, C. (1993). A converse to a theorem of komlos for convex subsets of L1. Pacific Journal of Mathematics, 159(1), 75–85. https://doi.org/10.2140/pjm.1993.159.75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free