Vol. 159, No. 1, 1993

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
A converse to a theorem of Komlós for convex subsets of L1

Christopher John Lennard

Vol. 159 (1993), No. 1, 75–85
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)n 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ós’ theorem, then C must be L1-norm bounded.

Mathematical Subject Classification 2000
Primary: 28A20
Secondary: 60F15
Milestones
Received: 3 October 1991
Published: 1 May 1993
Authors
Christopher John Lennard