A NOTE ON THE ERGODIC THEOREMS

Similar documents
Total Minimal Dominating Signed Graph

Restricted super line signed graph RL r (S)

Negation Switching Equivalence in Signed Graphs

Randomness for Ergodic Measures

AN INTRODUCTION TO CLASSICAL REAL ANALYSIS KARL R. STROMBERG. AMS CHELSEA PUBLISHING American Mathematical Society Providence, Rhode Island

THE COMMON MINIMAL COMMON NEIGHBORHOOD DOMINATING SIGNED GRAPHS. Communicated by Alireza Abdollahi. 1. Introduction

Fourier Transforms 1D

On the Infinity of Primes of the Form 2x 2 1

Note on Path Signed Graphs

BC Sequences and series 2015.notebook March 03, 2015

General description. The Pilot ACE is a serial machine using mercury delay line storage

2D ELEMENTARY CELLULAR AUTOMATA WITH FOUR NEIGHBORS

Part I: Graph Coloring

Cognitive Units, Connections and Mathematical Proof

Course Web site:

English Project. Contents

Signed Graph Equation L K (S) S

Lecture 3: Nondeterministic Computation

1/ 19 2/17 3/23 4/23 5/18 Total/100. Please do not write in the spaces above.

Figure 9.1: A clock signal.

Fourier Integral Representations Basic Formulas and facts

INTRODUCTION TO AXIOMATIC SET THEORY

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 6, JUNE Since this work considers feedback schemes where the roles of transmitter

Lecture 16: Feedback channel and source-channel separation

Chapter 4. Predicate logic allows us to represent the internal properties of the statement. Example:

HIGH-DIMENSIONAL CHANGEPOINT DETECTION

GENERAL DESCRIPTION UNIVAC ~DD4 III MAGNETIC TAPE SYSTEM UP

Curriculum Vitae Douglas A. Lind

An optimal broadcasting protocol for mobile video-on-demand

Chapter 12. Synchronous Circuits. Contents

MDPs with Unawareness

CHAPTER I BASIC CONCEPTS

Optimized Color Based Compression

The ambiguity of definite descriptions

2550 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 6, JUNE 2008

B I O E N / Biological Signals & Data Acquisition

data and is used in digital networks and storage devices. CRC s are easy to implement in binary

Decade Counters Mod-5 counter: Decade Counter:

Lecture 10 Popper s Propensity Theory; Hájek s Metatheory

22/9/2013. Acknowledgement. Outline of the Lecture. What is an Agent? EH2750 Computer Applications in Power Systems, Advanced Course. output.

Optimum Frame Synchronization for Preamble-less Packet Transmission of Turbo Codes

CSE 101. Algorithm Design and Analysis Miles Jones Office 4208 CSE Building Lecture 9: Greedy

Yale University Department of Computer Science

CSC 373: Algorithm Design and Analysis Lecture 17

Common assumptions in color characterization of projectors

Improving Performance in Neural Networks Using a Boosting Algorithm

mcs 2015/5/18 1:43 page 15 #23

Mathematics, Proofs and Computation

Filterbank Reconstruction of Bandlimited Signals from Nonuniform and Generalized Samples

MVP: Capture-Power Reduction with Minimum-Violations Partitioning for Delay Testing

Successive Cancellation Decoding of Single Parity-Check Product Codes

An MFA Binary Counter for Low Power Application

Introduction p. 1 The Elements of an Argument p. 1 Deduction and Induction p. 5 Deductive Argument Forms p. 7 Truth and Validity p. 8 Soundness p.

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): /ISCAS.2005.

1/8. Axioms of Intuition

Shift-Register Synthesis and BCH Decoding

( 1) n n n 2 5. n 4 n (2n)!

CM3106 Solutions. Do not turn this page over until instructed to do so by the Senior Invigilator.

2 nd Int. Conf. CiiT, Molika, Dec CHAITIN ARTICLES

Dynamic Backlight Scaling Optimization for Mobile Streaming Applications

Monadology and Music 2: Leibniz s Demon

A High- Speed LFSR Design by the Application of Sample Period Reduction Technique for BCH Encoder

Detecting Medicaid Data Anomalies Using Data Mining Techniques Shenjun Zhu, Qiling Shi, Aran Canes, AdvanceMed Corporation, Nashville, TN

UC Berkeley UC Berkeley Previously Published Works

Lattice-Ordered Groups. An Introduction

On time: the influence of tempo, structure and style on the timing of grace notes in skilled musical performance

CIS 500 Software Foundations Fall Reasoning about evaluation. More on induction. Induction principles. More induction principles

Power Reduction Approach by using Multi-Bit Flip-Flops

THE CAPABILITY to display a large number of gray

Visualizing Euclidean Rhythms Using Tangle Theory

Serial Digital Interface Checkfield for 10-Bit 4:2:2 Component and 4fsc Composite Digital Signals

Preservation Statistics Survey - FY2017. Preservation Statistics Survey - FY2017. General Information. * 1. Institution Name: * 2.

Stream Ciphers. Debdeep Mukhopadhyay

SYSTEM-PURPOSE METHOD: THEORETICAL AND PRACTICAL ASPECTS Ramil Dursunov PhD in Law University of Fribourg, Faculty of Law ABSTRACT INTRODUCTION

Module 8 : Numerical Relaying I : Fundamentals

Implementation of BIST Test Generation Scheme based on Single and Programmable Twisted Ring Counters

Beliefs under Unawareness

Michael Boshernitzan

EIGHTH GRADE RELIGION

Partitioning a Proof: An Exploratory Study on Undergraduates Comprehension of Proofs

Bibliography. Math. 16, 1-64.

MATH 195: Gödel, Escher, and Bach (Spring 2001) Notes and Study Questions for Tuesday, March 20

Requirements and editorial norms for work presentations

PIER Working Paper

Melodic Pattern Segmentation of Polyphonic Music as a Set Partitioning Problem

uniformity and individual uniqueness

Logik für Informatiker Logic for computer scientists

Formalizing Irony with Doxastic Logic

WINTER 15 EXAMINATION Model Answer

ANTON SOLOMKO. University of Bristol School of Mathematics Howard House, Queens Avenue Bristol, BS8 1SN, UK

D Latch (Transparent Latch)

WE treat the problem of reconstructing a random signal

Discrete, Bounded Reasoning in Games

Chapter 18: Supplementary Formal Material

Adaptive decoding of convolutional codes

A general framework for constructive learning preference elicitation in multiple criteria decision aid

Interface Practices Subcommittee SCTE STANDARD SCTE Hard Line Pin Connector Return Loss

Lesson 25: Solving Problems in Two Ways Rates and Algebra

Rate-Adaptive Codes for Distributed Source Coding

An Image Compression Technique Based on the Novel Approach of Colorization Based Coding

Transcription:

A NOTE ON THE ERGODIC THEOREMS YAEL NAIM DOWKER Introduction, definitions and remarks. The purpose of this note is to give an example of a measurable transformation of a measure space onto itself for which the individual ergodic theorem holds while the mean ergodic theorem does not hold. Let S be a measure space of finite measure, m the measure defined on the measurable subsets of 5, and T a 1-1 point transformation of S onto itself which is measurable (both T and T" 1 transform measurable sets into measurable sets). Let the points of S be denoted by y and let f(y) be any real valued function defined on 5. We denote by F h (y) the average (1/A) X^o f(t*y). We shall say that the individual ergodic theorem holds for f(y) if the sequence of averages {Fh(y)} converges to a finite limit almost everywhere. If the individual ergodic theorem holds for every integrable function ƒ Za(m) we shall say that the individual ergodic theorem holds (with respect to m). 1 We shall say that the mean ergodic theorem holds in L p {m) (p^l) for a function / Z, p (ra) if Fh(y)G.L p (m) for & = 1, 2, and the sequence {Fh(y)} converges in the norm of L p (m). If the mean ergodic theorem holds in L P {TYÎ) for every function ƒ(y) GEZ/p(w) then we shall say that the mean ergodic theorem holds in L p (m). The following relations between the two ergodic theorems are known: If T is measure preserving, both the individual [l] and the mean [4] 2 ergodic theorems hold. Without assuming that T is measure preserving, the mean ergodic theorem in L p (m) for any p^l implies the individual ergodic theorem for all functions in L p {m) ( [2, p. 1061 ], see also [3, p. 539] for the case p = l). The question arises whether, conversely, the individual ergodic theorem implies the mean ergodic theorem in b p (m) for some p^l. This question has significance only when L p (tn) is transformed into itself by the transformation induced on it by T. For in this case and only in this case is it true that for any ƒ L p (w) the averages {Fh} also belong to L p {m) for & = 1, 2, 3,, 3 We answer this question in Received by the editors April 9, 1948. 1 The words in the parenthesis will be omitted if there is no reason for ambiguity. 2 Only the case p 2 is proved in [4]; see [2, p. 1053] for all p ^ 1. The numbers in brackets refer to the bibliography at the end of the paper. 3 It is easy to give examples for which the individual ergodic theorem does hold while Lp(m) is not transformed into itself. Such an example for instance is given if T is periodic while m is non-atomic and T~ x is singular. 379

380 YAEL N. DOWKER [April the negative by constructing for each given p^l an example of a transformation of a measure space (5, m) onto itself for which (1) the individual ergodic theorem holds, (2) the mean ergodic theorem does not hold in p (ra), and (3) every function in L p (m) is transformed into a function belonging to L p (m). REMARK. Even though the individual ergodic theorem does not imply the mean ergodic theorem with respect to the original measure m it is known [2, p. 1059] that in case the individual ergodic holds, it is possible to introduce a new measure JJL defined on the measurable sets of S such that /* has no more null sets than m and ix is also invariant under T. It follows then from the statements made above that the mean ergodic theorem holds in L p (fx) for every p} l. The example for = 1. Let 5 be the totality of all points on the circumferences ci, c% of a sequence of circles. Let the length of c n be l/2 n. Let the measure m and the family of measurable sets in S be the obvious ones determined by the Lebesgue measure on each of the circumferences. On each circumference c n we fix the polar coordinates p = (l/2 w -27r) e ie. Let X = 0/2T. Let us divide c n into 2^ + 2 arcs, the end points of the arcs being x = 0, # = 1/2, and *= ±l/2* +1, & = 1, 2,, n. The arcs are 1 1 A nk : - 2 k è x è ~~ - 2* +1 1 ^»+ i: 7n7r =" x è o, while if n+2^k^2n + 2, A n h is the reflection in 0=0 of A n,2n+z-k. We define T as follows: For the points of A n k let T be the unique transformation given by x' = ax+b, a>0, which transforms A n k onto A n,k+i for fe = l,, 2n 1, and ^4 nfc onto -4 n,i for & = 2w+2. T is clearly a 1:1 point transformation of S onto itself. Moreover it is easily seen that T is measurable and pointwise periodic with the period of 2n + 2 for the points of c n. T also satisfies the following two conditions : (1) m(t~ l A) ^2m(A) for every measurable set A in 5. (2) The set of ratios 1 s- 1 m(t-*a) RA = - * Z~i 2n + 2 Zo m{a) where n = 1, 2, and A varies over all measurable sets A QS is not a bounded set of numbers. (1) follows from the fact that T~" x is de-

19491 A NOTE ON THE ERGODIC THEOREMS 381 termined by a linear transformation with a stretching factor of at most 2. (In fact, it is either 1/2, 1, or 2.) To prove (2) consider the sequence of sets A nt n+x- Since U^Ö^C^-^n.n+i) =Cn we have that 1 te 1 1 1 2n + 2 <_ 0 w(r-vt n, n ' +i) = 2rc + 2 2 n On the other hand tn(a ntn +i) = (1/2 W+1 ) (l/2 n ) and hence On+l n - 2^ + 2 which is an unbounded sequence. We can now show that the above example satisfies the required conditions specified in the introduction. (a) The individual ergodic theorem holds. In fact let f(y) be any real-valued function defined on 5, then since T is pointwise periodic the sequence {Fh(y)} converges to a finite limit for every y, that is, the individual ergodic theorem holds for every real-valued function defined on S. A fortiori it holds (with respect to m). (b) L\(m) is transformed into itself by T: In fact, it can be easily seen that m(a) =m(t~~ l A) is a completely additive non-negative set function (that is, a measure) defined on the measurable sets of 5. It can also be shown by considering approximating sums to the integrals thatif/6li(w) then By (1), m(a) ^2m(A) f \f(ty)\dm= f \f(y)\dm. J 8 J 'S S for every measurable set A and hence f \f(y)\dm^2 f \f(y)\dm J s J s < oo from which follows that f(ty)(e.li(rn), that is, Li(m) is transformed into itself by T. (c) The mean ergodic theorem does not hold in Li(m). To prove this statement we use the following result due to Miller and Dunford [3, p. 539]: Suppose that the mean ergodic theorem did hold in Li(m) ; then there would exist a positive constant c independent of A and h such that (i) I h-i >(r-^) <c-m(a) h»»o

382 YAEL N. DOWKER [April for all measurable sets A and h = 1, 2,. But (i) is in contradiction with (2) above. Hence the mean ergodic theorem does not hold in Li(m). It is possible to prove the last statement also directly by exhibiting functions in L\{m) for which the mean ergodic theorem does not hold in Li(m). In fact let ƒ(y) be defined as follows: f(y) 2 n on 4, n+ i, n = l, 2,, f(y) = 0 everywhere else on 5, then]{y) Li(m) but {Fh(y)} is not convergent inz, p (m), for if it were then the limit function ƒ*(j) of {"F h (y)} would have to belong to Li(ra). But f*(y) is seen to be equal to (l/2#+2)»2 w for ycz.cn- We have f \f*(y)\dm=jb(l/2n + 2) J S n«l which is a divergent series, that is, /*( Li(m) and hence {^(y)} is not convergent in Li(m). The example for ƒ> '1. Let p be a fixed integer -1. Let 5 be the same sequence of circumferences c\, c%, as before. We divide each c n into 2(n-2 p n + l) arcs, the end points being x = 0, # = 1/2 and x = r/2* p+1, fe = l, 2,, n, r = l, 2,, 2 P -1. Again we define T by the transformation given by +b, a>0y which transforms each arc into the next adjacent one. T is again seen to be a 1-1 measurable pointwise periodic transformation of S onto itself with the period 2(n-2 p n + 1) for the points of c n. As before it follows that (a) the individual ergodic theorem holds, (b) L p (m) is transformed into itself since there is a bound (the bound being 2 P ) on the stretching factor of T~ l. (c) The mean ergodic theorem does not hold in L p (m). To prove this last statement we use the following generalization of Miller and Dunford's result stated above: Let t be any real number ^1, then if the mean ergodic theorem holds in L t {m) there exists a constant C independent of A and h such that r 1 h ~ l 1 l (ii) X) *»(r-«i4) < C-m(A). L h *_ 0 J The proof is almost the same as for the special case 2 = 1. If, however, we consider the sequence of sets A nq, where q n(2 p 1) + 1 and where the enumeration of the arcs on each c n is analogous to that used in the case p = l, we can easily see that the sequence of ratios [ 1 2q ~ l l p / fn(t'*a Aq ) /m(a nq )

i 9 49l A NOTE ON THE ERGODIC THEOREMS 383 is an unbounded sequence. This is in contradiction with (ii) for t = p. Hence the mean ergodic theorem does not hold in L v {m). Again the statement made in (c) may be proved directly by exhibiting functions in L p (m) for which the mean ergodic theorem does not hold in L p (m). Let pi be any fixed number not less than 1. Let p be the first integer not less than pi. Then the example constructed above for p is also a valid example for pi, for the individual ergodic theorem clearly holds and L Pl (m) is transformed into itself for the same reasons as before, while it follows from the fact that m(a)^l for every measurable set A and the fact that p^pi that the same sequence of sets which violates (ii) for the case t = p also violates (ii) for t = pi. Hence the mean ergodic theorem does not hold in L Pl (m). BIBLIOGRAPHY 1. G. D. Birkhoff, Proof of the ergodic theorem, Proc. Nat. Acad. Sci. U.S.A. vol. 17 (1931) pp. 356-660. 2. Yael Nairn Dowker, Invariant measure and the ergodic theorems, Duke Math. J. vol. 14 (1947) pp. 1051-1061. 3. N. Dunford and D. S. Miller, On the ergodic theorem, Trans. Amer. Math. Soc. vol. 60 (1946) pp. 538-549. 4. J. von Neumann, Proof of the quasi-ergodic hypothesis, Proc. Nat. Acad. Sci. U.S.A. vol. 18 (1932) pp. 70-82. RADCLIFFE COLLEGE