Cambridge University Press 978-0-521-38997-6 - Ergodic Theory Karl Petersen Frontmatter More information
© Cambridge University Press
www.cambridge.org
Cambridge University Press 978-0-521-38997-6 - Ergodic Theory Karl Petersen Frontmatter More information
© Cambridge University Press
www.cambridge.org
Ergodic theory
KARL PETERSEN Professor of Mathematics, University of North Carolina
The right of the University of Cambridge to print and sell all manner of books was grappled by Henry Pill in 1534. The University has pruned ad published continuously since 1584.
CAMBRIDGE UNIVERSITY PRESS Cambridge New York Port Chester
Melbourne
Sydney
Published by the Press Syndicate of the University of Cambridge The Pitt Building, Trumpington Street, Cambridge CB2 1RP 40 West 20th Street, New York, NY 10011, USA 10 Stamford Road, Oakleigh, Melbourne 3166. Australia © Cambridge University Press 1983
First published 1983 First paperback edition (with corrections) 1989 Printed in Great Britain at the University Press, Cambridge Library of Congress catalogue card number: 82-4473 British Library cataloguing in publication data
Petersen, Karl Ergodic theory. - (Cambridge studies in advanced mathematics: 2) 1. Ergodic theory L Title 515.42 QA313 ISBN 0 521 23632 0 hard covers ISBN 0 521 38997 6 paperback
TM
Contents
1 1.1 1.2
1.3
1.4
Preface
ix
Introduction and preliminaries The basic questions of ergodic theory The basic examples A. Hamiltonian dynamics. B. Stationary stochastic processes. C. Bernoulli shifts. D. Markov shifts. E. Rotations of the circle. F. Rotations of compact abelian groups. G. Automorphisms of compact groups. H. Gaussian systems. I. Geodesic flows. J. Horocycle flows. K. Flows and automorphisms on homogeneous spaces. The basic constructions A. Factors. B. Products. C. Skew products. D. Flow under a function. E. Induced transformations. F. Inverse limits. G. Natural extensions. Some useful facts from measure theory and functional analysis A. Change of variables. B. Proofs by approximation. C. Measure algebras and Lebesgue spaces. D. Conditional expectation. E. The Spectral Theorem. F. Topological groups, Haar measure, and character groups.
1
The fundamentals of ergodk theory
tI 12 113
The Mean Ergodic Theorem The Pointwise Ergodic Theorem Recurrence I/
1 5
10
13
23 23 27 33
vi
Contents
2.4 2.5 2.6
Ergodicity
3 3.1
More about almost everywhere convergence More about the Maximal Ergodic Theorem A. Positive contractions. B. The maximal equality. C. Sign changes of the partial sums. D. The Dominated Ergodic Theorem and its converse. More about the Pointwise Ergodic Theorem A. Maximal inequalities and convergence theorems. B. The speed of convergence in the Ergodic Theorem. Differentiation of integrals and the Local Ergodic Theorem The Martingale convergence theorems The maximal inequality for the Hilbert transform The ergodic Hilbert transform The filling scheme The Chacon—Ornstein Theorem
3.2
3.3 3.4 3.5 3.6 3.7 3.8 4 4.1
4.2
4.3
4.4
Strong mixing Weak mixing
More about recurrence Construction of eigenfunctions A. Existence of rigid factors. B. Almost periodicity. C. Construction of the eigenfunction. Some topological dynamics A. Recurrence. B. Topological ergodicity and mixing. C. Equicontinuous and distal cascades. D. Uniform distribution mod 1. E. Structure of distal cascades. The Szemerédi Theorem A. Furstenberg's approach to the Szemerédi and van der Waerden Theorems. B. Topological multiple recurrence, van der Waerden's Theorem, and Hindman's Theorem. C. Weak mixing implies weak mixing of all orders along multiples. D. Outline of the proof of the FurstenbergKatznelson Theorem. The topological representation of ergodic transformations A. Preliminaries. B. Recurrence along IP-sets. C. Perturbation to uniformity. D. Uniform polynomials.
41 57 64 74 74
90
100 103 107 113 119 126 133 133
150
162
186
Contents 4.5
E. Conclusion of the argument. Two examples A. Metric weak mixing without topological strong mixing. B. A prime transformation.
vii
209
227
5.2 5.3
Entropy Entropy in physics, information theory, and ergodic theory A. Physics. B. Information theory. C. Ergodic theory. Information and conditioning Generators and the Kolmogorov—Sinai Theorem
6
More about entropy
249
6.1
More examples of the computation of entropy A. Entropy of an automorphism of the torus. B. Entropy of a skew product. C. Entropy of an induced transformation. The Shannon—McMillan—Breiman Theorem Topological entropy Introduction to Ornstein Theory Finitary coding between Bernoulli shifts A. Sketch of the proof. B. Reduction to the case of a common weight. C. Framing the code. D. What to put in the blanks. E. Sociology. F. Construction of the isomorphism.
249
References
302
Index
322
5 5.1
6.2 6.3 6.4 6.5
227 234 243
259 264 273 281
Jumalate juhatusel Jooksvad elujoonekesed, Voolavad ônnelainekesed. For Elisabeth
viii
Preface
Ergodic theory today is a large and rapidly developing subject. The aim of this book is to introduce the reader first to the fundamentals of the ergodic theory of point transformations and then to several advanced topics which are currently undergoing intense research. By selecting one or more of these topics to focus on, a student can quickly approach the specialized literature and indeed the frontier of the area of interest. Of course the number of interesting topics that we have neglected is necessarily far greater than that of those we have been able to include. Thus we have to refer the reader elsewhere for discussions of, for example, operator ergodic theory, the existence of invariant measures, nonsingular transformations, orbit equivalence, differentiable dynamics, subadditive ergodic theorems. etc. Unfortunately, there do not exist coherent expositions of all of these topics; I invite those of my colleagues who are more expert than I in the areas I have omitted to do some more expository
writing. It should also be understood that. even for the advanced topics that we do discuss, their treatment here cannot be more than an entryway to the rapidly expanding specialized literature. Thus our presentations of multiple recurrence and the Ornstein theory, to mention two examples, are intended as introductions to the books of Furstenberg (1981) and Ornstein (1974), respectively. From my point of view, ergodic theory consists of examples, convergence theorems, the study of various recurrence properties, and the theory of entropy. Each of these facets is given first a basic and later a more advanced treatment. At the introductory level, one can find the usual important basic topics: the standard examples, the mean and pointwise ergodic theorems, recurrence, ergodicity, strong mixing, weak ix
x
Preface
mixing (all in Chapter 2) and the fundamentals of entropy (in Chapter 5). I have tried to make the writing as clear and complete as possible. Throughout we concentrate on single invertible measure-preserving maps on Lebesgue spaces. Some more advanced topics related to convergence theorems appear in Chapter 3, to recurrence in Chapter 4, and to entropy in Chapter 6. Chapter 3 presents a rather thorough analysis of maximal functions and their usefulness in the proof of the important convergence theorems of analysis (Lebesgue's Differentiation Theorem and the existence of the Hilbert transform), probability (the martingale convergence theorems), and ergodic theory (the Maximal Ergodic Theorem and its refinement to an equality, the Pointwise Ergodic Theorem, the Local Ergodic Theorem, the Dominated Ergodic Theorem and its converse, and the existence of the ergodic Hilbert transform). We also give Neveu's proof of the Chacon—Ornstein Theorem, as an introduction to operator ergodic theory. Chapter 4 begins with a direct construction of eigenfunctions for non-weakly-mixing transformations, which leads to a brief treatment of almost periodic functions and topological dynamics. In Section 4.3 we give an introduction to Furstenberg's approach to multiple recurrence and the Szemerédi Theorem, and Section 4.4 proves the Jewett— Krieger Theorem on the topological representation of measure-preserving transformations. The final section examines the important examples of Kakutani and Chacon, both of which are weakly but not strongly mixing and at least one of which is prime. Chapter 6 contains several nontrivial entropy computations (toral automorphisms, skew products, and induced transformations), the Shannon— McMillan—Breiman Theorem, and the fundamental facts about topological entropy. We also provide a brief introduction to Ornstein's isomorphism theory of Bernoulli shifts, proving the Ornstein Isomorphism Theorem by the Keane—Smorodinsky method, which produces a finitary (realizable by machine) map. The background necessary to read this book is some knowledge of measure theory and functional analysis; for example, the contents of Royden's Real Analysis suffice. Each chapter begins with a short summary, and many sections end with exercises, which range from trivial to difficult. The list of references contains all works referred to in the text, and then some, but it is not a complete bibliography for the subject; starred entries are books and survey articles, several of which contain more extensive bibliographies. I apologize for any errors of fact, misattributions of results, misprints, passages of incompetent exposition, and all other mistakes and misjudgments; I will be happy to receive lists of errors (preferably accompanied by suggested corrections) from all who care to compile them.
Preface
xi
This book grew out of courses given at the University of North Carolina and Yale University. During part of the writing I received financial support from the National Science Foundation, and the work was completed while I was on a leave supported by the Kenan Foundation at the Laboratoire de Calcul des Probabilités of the Université Pierre et Marie Curie (Université de Paris, VI). I thank all of those institutions for providing me with the opportunities to teach and learn this subject. I have had mathematical and editorial help especially from Brian Marcus, and also Shizuo Kakutani, Ulrich Krengel, Benjamin Weiss, Mike Keane, Shaul Foguel, Yves Derriennic, Bruce Kitchens, and Judy Halchin. My students listened patiently to my lectures, made many useful suggestions, and caught lots of errors. Janet Farrell typed the original manuscript with the assistance of Debbie Hanner Reives, Hazeline Lewis, and Doris Mahaffey. The editing and publishing were handled by David Tranah and John Samuel. My sincere thanks to all these people for their contributions.
Karl Petersen Chapel Hill, N.C. September 1981
Introduction and preliminaries
Without going into the details (to which the rest of the book is devoted), we mention some of the basic questions, examples, and constructions of ergodic theory, in order to provide an indication of the content and flavor of the subject as well as to establish reference points for terminology and notation. The final section presents a few facts from measure theory and functional analysis that will be used repeatedly.
1.1. The basic questions of ergodic theory Ergodic theory is the mathematical study of the long-term average behavior of systems. The collection of all states of a system forms a space X. The evolution of the system is represented by a transformation T: X X. where Tx is taken as the state at time 1 of a system which at time 0 is in state x. If one prefers a continuous variable for the time, he can consider a one-parameter family { : t E RI of maps of X into itself. When the laws governing the behavior of the system do not change with time, it is natural to suppose that Ts4_, = 7T. so that {7; : tER} is a flow, or group action of ER on X. A single (invertible) transformation T: X —> X also determines the action of a group, namely the integers 1, on X. The actions of arbitrary groups, and even of semigroups in case the transformations may not all be invertible, are worthy of study, but we will be interested mainly in the action of the powers of a single transformation and, occasionally, of a flow. In order to analyze a system mathematically, one needs to have some structure on X and restrictions on T. There are three major cases: (1) X is a differentiable manifold and T is a diffeomorphism, the case of differentiable dynamics; (2) X is a topological space and T is a homeomorphism, the case of topological dynamics;
2
/. Introduction and preliminaries (3) X is a measure space and T is a measure-preserving transformation, the case of ergodic theory.
Of course the three cases overlap extensively, and a single example can be viewed in different lights; in fact, some of the most interesting problems concern the relationships among the three areas. Let us define more carefully the case (3) of most interest for us. Let (X, 2, p) be a complete probability space, that is, a set X together with a a-algebra .2 of measurable subsets of X and a countably additive nonnegative set function p on .2 such that p(X) = 1 and such that 2 contains all subsets of sets of measure O. Let T: X X be a one-to-one onto map such that T and T -1 are both measurable: T -1 .4 = TI = 2. Since sets of measure 0 don't matter, we don't care if T only becomes well-defined and one-to-one onto after a set of measure 0 is discarded from X. Assume further that p(T -1 E)= p(E) for all E E.. A map T satisfying these conditions is called a measure-preserving transformation (abbreviated m.p.t.), and the systems (X, .4, p, T) will be our fundamental objects of
study. (Sometimes one wishes to consider possibly noninvertible maps T: X X such that T -1 .4 4 and p T -1 = p, and many of the results we present extend to such maps, but we will restrict ourselves for the most part to the invertible case. There is also an interesting theory of nonsingular maps (T -1 .4 c 2,12T -1 4p) which we do not have space to discuss here.) In the one-parameter case, we assume that T, is a m.p.t. for all te R, the map (x, t)--+ Ti x is jointly measurable from X x R -to X, To is the identity, and Ts+s = 7;1; for all s, te R. If T: X -4 X is a m.p.t., the orbit trix:nc.11 of a point x e X represents a single complete history of the system, from the infinite past to the infinite future. The o--algebra .4 is thought of as the family of observable events, with the T-invariant measure p specifying the (time-independent) probabilities of their occurrences. A measurable function f : X ER represents a measurement made on the system; f(x), f(Tx), f(T 2x),... may be thought of as the values of some physically interesting variable at successive instants of time, beginning with the world in initial state x. In statistical mechanics, information theory, and other areas of application it is interesting and sometimes necessary to consider the long-term time average
1 N-1
— N
f(T kx)
I=0
of a large number N of successive observations. (The average may not really be 'long-term', because the time unit involved may be very short:
1. L The basic questions of ergodic theory
3
in statistical mechanics, for example, molecular collisions may occur so often that we can actually observe only long-term' averages of any variable f.) A basic question of ergodic theory is that of the convergence of these averages: when does 1 1V-1 f(X) = liM —
N
E
f(rx)
k= 0
exist in some sense? If it exists, j(x) may be thought of as an equilibrium or central value of the variable f. The convergence had been proved in special cases earlier (e.g. Borel's Strong Law of Large Numbers (1909) in case thef V' are independent and identically distributed), but the general convergence in the mean square (L2) sense was proved by von Neumann and the almost everywhere convergence by Birkhoff, both in 1931. Their results are known as the Mean Ergodic Theorem and the Ergodic Theorem (or Pointwise Ergodic Theorem), respectively. Generalizations and improvements of these results have been appearing continually since 1932; we will have space for only a few in this book. The question of the existence of averages occurred to mathematicians because of the physicists' concern with the `ergodic hypothesis'. which was formulated in an (erroneous and unsuccessful) attempt to bring about the conclusion that the time mean 1 111T1 N—c)
N
N-1
E0 f(rx)
and the space mean
fx fdp coincide almost everywhere. It is desirable that the equilibrium or central value of a physical variable coincide with its weighted average over all possible states of the system. Boltzmann felt that if orbits penetrated all corners of the space, then this useful and symmetrical conclusion would follow. The investigation of the conditions under which this equality of time and space means, as well as even stronger conclusions, holds forms a second major topic in ergodic theory, the study of general recurrence properties, by which we mean the qualitative behavior of orbits. If the time mean of every measurable function coincides almost everywhere (a.e.) with its space mean, the system (or just T itself) is called ergodic. It turns out that a system is ergodic if and only if the orbit of almost
4
1. Introduction and preliminaries
every point visits each set of positive measure, or, equivalently, if p(E)> 0 and p(F) > 0 implies that p(TnE n F)> 0 for some n. A recurrence property which implies this one is strong mixing: lim„ p(TnE n F) = p(E)p(F) for all E, F E M. Weak mixing lies between the two, and just plain recurrence — if ,u(E) > 0 then p( TE n E) > 0 for some n — always holds in a space of finite measure. A third major question of ergodic theory is the classification problem. Let us say that two systems (X, M, p, T) and ( Y, y, S) are metrically isomorphic if there are sets of measure zero X0 X and 110 c Y and a one-to-one onto map 4): X1X0 Y\ Y0 such that çbT — SO on X\X 0 and p(0 - = v(E) for all measurable E c Y\Y o . (Such a map 41 is sometimes called an isomorphism mod O.) How can we tell whether two given systems are (metrically) isomorphic to one another? A classical way is by attaching isomorphism invariants to systems, of which ergodicity, weak mixing, and strong mixing are examples. These are, however, only spectral invariants. The map T: X —) X determines a unitary operator U = U T on L2(X) by U rf(x) —f( Tx) (Koopman 1931). (We sometimes denote this map by U T . sometimes by U. and sometimes even by T.) We can say that T and S are spectrally isomorphic if UT and Us are unitarily equivalent, in that VUT = U s V for some unitary V: L2(X)—) LAY). Then if S and T are spectrally isomorphic, either both or neither have any one of the recurrence properties mentioned above. An invariant which is sensitive to the nature of the action of T on individual points of X is the entropy h(T) of T. The entropy can be used to distinguish some nonisomorphic systems (Kolmogorov and Sinai) and is in fact a complete isomorphism invariant within certain classes of systems (Ornstein). in many parts of mathematics there is a construction problem as well as a classification problem. Such a question could be formulated in several ways in ergodic theory, one of which is the realization problem: which systems of type (3) above can be realized within type (2) (say with T preserving a unique Borel probability measure) or within type (1) (say with T preserving a measure determined by a smooth density)? The first of these questions is discussed below, and the second is the subject of current research. Still another question is that of genericity: which types of systems are 'typical', in various senses and in the several different settings? Many of the important questions of ergodic theory receive scant or no attention here: the existence of invariant measures, the case of infinite measure spaces, operator ergodic theory, the actions of other groups, C* dynamical systems. etc. And our discussion of the questions that we do treat is not alleged to be complete. The starred references in the bibliography are a good starting place for filling in any gaps that we leave_
1.1. The basic examples
5
1.2. The basic examples Because the two major sources of ergodic theory are mathematical physics (especially statistical mechanics and Hamiltonian dynamics) and the theory of stationary stochastic processes, naturally- these subjects provide a rich store of examples of measure-preserving transformations and flows. There are also several interesting and illustrative classes of abstract examples in an algebraic or geometric context. The following list will give some idea of the kinds of measure-preserving systems we will have in mind during the succeeding discussion. Obviously the various classes are not disjoint, and there are in fact inclusion relations among some of them. A. Hamiltonim dynamics The state at any time t of a physical system consisting of N particles can be specified by the three coordinates of position and the three of momentum of each particle, that is by a point in IR", which is the phase space of the system. More generally (allowing for changes of variables and constraints on the system), let the state of the system be described by a pair of vectors (q, p), where p = (p i , pn) (the 'generalized qn) (the 'generalized position') are in Di", momentum') and q = (q in which case the phase space is There is given a (V) Hamiltonian function H(q, p), which we assume to be independent of time, and which is typically the sum of the kinetic energy K(p) and potential energy U(q) of the system. Hamilton's equations are
dqi _ OH dt Opi "
dpi
011
di
— aq i
(i = 1. 2, ... , n).
These equations determine the state Tt(q,p) at any time t if the system has initial state (q, p), by the theorem on the existence and uniqueness of solutions of first-order ordinary differential equations. We obtain in this way a one-parameter flow : oo
11(q'
f311 Vp 1
OH OH
öp i -
q1 ' •
011 qn )'
for which clearly div ( V) = O. Denoting the Jacobian at (q, p) of the map T, by JT,(q, p), this implies through direct calculation that
0 —JT (q, p)= O. Dt
6
L Introduction and preliminaries
If E
R 2'1 is measurable and pc denotes Lebesgue measure on ER 2n then ,
ATE)
= JT;(q, p)d,u(q, p).
Thus d —
dt
p(TE) = f — PT (q, p)]dp(q, p) = 0. E t
(For the details, see Khintchine 1949 or Plante 1976.) Hamilton's Equations yield immediately that dH =0. dt Thus the system is not free to wander all over the phase space but is restricted to surfaces of constant total energy E. Usually most of these surfaces are compact manifolds. The flow restricted to any such surface also has an invariant measure. For the proof of this Proposition see Khintchine (1949). Proposition 2.2 The Hamiltonian flow restricted to a surface
S = t(q, p): 11(q, p) = El of constant energy preserves the measure diis = dS/II grad H where dS is the element of surface volume.
Through this formulation physical dynamical systems ranging from gas in a container to a cluster of galaxies enter the purview of ergodic theory. B. Stationary stochastic processes
Let (LI F P) be a probability space and ... J fo,f; J,, a sequence of measurable functions on a Suppose that the sequence is stationary, in that for any n i , n 2 , ... nr , any Borel subsets B 1 , B,, of ER, and any kEl, ,
13{"fni(w)EBI = Plco: , k(co)EB 1 ,
,
...
Br} , fnri_ h(co)ei3,1.
Such a stationary process corresponds to a measure-preserving system in a standard way. Let fie = ( x _ 1 , xo , x 1 ,...): each xi eR), define çb :S2 R z by (4)co)n = fco) for all n el, and define p on theBorel subsets of Ele by i(E) P(çt - 'E)Extend p to the completion A of the Borel field. Let cr:ble
Ile be the
1.2. The basic examples
7
shift transformation defined by (ax).= xn+ Because of the stationarity of ( fj p is shift-invariant on cylinder sets and so that we have constructed a measure-preserving hence on all of system (Rz, p, a). Moreover, if Tr. : Rz R is the projection onto the nth coordinate (iv = x ) , then [trn } has the same joint distributions on Rz as {L} on a Thus every stationary stochastic process 'comes from' some shift-invariant measure on Rz. A similar construction applies in the case of a continuous-parameter stochastic process (7; : — cc
C. Bernoulli shifts Let n = {0, 1.... n — 1} be an alphabet of finitely many symbols pi = 1. Form the with weights po , p l , p, 1 such that all pi > 0 and product space n7 of all two-sided sequences of the symbols in n, and give nz the product measure p determined by the given probability measure El on n. Thus for a typical cylinder set determined by a set of places and elements j 1 . jk en,
E7=-,;
= j, ,
x
= Pj1Pj2 ,
Clearly the the shift transformation cr:re —> n 7 preserves the measure p. The resulting measure-preserving system is denoted by .4(p0 , p 1 , p n _ i ) and represents a finite-valued stationary stochastic process with independent identically distributed terms (i.i.d.). models an experimenter tossing a fair coin from the infinite past on into eternity. D. Markov shifts Form the product space n7 and shift transformation as in (C). We will define a different invariant measure on nz, one for which the associated stochastic process is Markov rather than i.i.d. Let A = (ai) be an n x n stochastic matrix, i.e. a matrix with nonnegative entries and each row sum equal to 1. Suppose also that p = (p o , p l , PM- 1) is a row probability vector (all pi 0, IA = 1) which is fixed by A: pA = p. By the Perron—Frobenius Theorem (see Varga 1962) such a vector can always be found, and in some cases it is unique. Define the measure of a cylinder set determined by consecutive indices by
PA{x :xi
xi+k =4)
8
L Introduction and preliminaries
(Thus p gives the a priori probabilities of the symbols and A the transition probabilities from one symbol to another.) It can be verified that PA extends in a well-defined way to a countably additive measure on the algebra generated by the cylinder sets, and hence, by the CarathéodoryHopf Theorem, 144 extends to the Bord fi eld of lie and its completion bit. The resulting measure-preserving system (nz , .4, kiA , a) models a finitestate Markov chain. E. Rotations of the circle From the point of view of ergodic theory, the unit circle 11( = {z EC: I z I = 1} is the same as the unit interval [0, 1), and both are versions of R/Z, the reals 'mod 1'. Given an ŒE R, we consider the map TŒ : [0, 1) --- [0, 1) defined by Tax = x + a (mod 1) = (x + a > = fractional part of x + a
= x + a — [x + cc].
Regarded as a map of [K, T e znie = e 2ni(8+ a) . It is clear that Ta preserves Lebesgue measure. If a is rational, then Ta is periodic, all orbits being finite and of the same cardinality. Thus Tx is most interesting when a is irrational. F. Rotations of compact abelian groups Let G be a compact abelian group and go E G. Define Tgo :G G by Tgog = g + go . Because Haar measure is translation-invariant, To is a m.p.t. Again the most interesting case is when G is monothetic and go is a generator: {rig ° :nel} is dense in G.
G. Automorphisms of compact groups Let G be a compact group and T: G G a continuous automorphism. The uniqueness of normalized Haar measure implies that it is T-invariant. A particular case of interest is when G = fie . Rn/ln is the n-torus, when it can be shown that T is given by an n x n integer matrix with determinant ± 1. H. Gaussian systems
Consider a stochastic process ...f la foifi ,... on a probability space (SI, .9-, P) which is Gaussian in that the joint distribution of any finite number of the 4 is Gaussian : given i i < j 2 < ... < in , there are R and a symmetric positive-definite n x n matrix A = (Au)
1.2. The basic examples
9
such that for each Borel E
E} , .. - ji„(CO)E P{a):(fic, =
1
berVdet A
exp [ - I-(x - 0" A - ' (x - m)]dx i ... dx..
fE
j„(fi - no (fi - m)dp depends only If in fi dp is a constant, mo , and A. on i - j, then the process is stationary, and as in (B) determines a measurepreserving system (see Totoki 1970). I. Geodesic flows
Let M be a compact Riemannian manifold and U T(M) the unit tangent bundle of M, i.e. the collection of all (x, v), where x EM and y is a unit tangent vector to M at x. The geodesic flow {T) on U T(M) is defined as follows. Given (x, y), find the geodesic )40 which at time 0 passes through x and is tangent to v. Flow along the geodesic at unit speed for a time t, and take for 7;(x, y) the point and unit tangent vector that you finish with. The geodesic flow preserves the measure on the manifold that is determined by the Riemannian metric (see GottschalkHedlund 1955).
J. Horocycle flows Let M be a compact oriented surface of constant negative curvature. Then M is a quotient of the Poincaré disk by a discrete subgroup of isometries. Geodesics in the Poincaré disk are circular arcs that are perpendicular to the boundary circle:
geodesics: 7--------\
horocycles: / ".. -- — .... ■
By a horocycle we mean a circle which is interior to the disk (except for the point of tangency) and tangent to the boundary. The horocycle flow on VT(M) is defined as follows. Given (x, v)e UT(M), find the geodesic through x in the direction of v. Find the point (x, v)co
10
1, Introduction and preliminaries
at which this geodesic intersects the boundary. Construct the horocycle tangent to this point, through x, and orthogonal to v. Flow along this horocycle (in a pre-selected sense) at unit speed for a time t, and take for Tt(x, y) the equivalence class of the point and unit normal vector that you finish with. Again the natural volume is preserved. It is important to note that the geodesic and horocycle flows on the full Poincaré disk have no recurrence whatsoever, but even strong mixing does arise when we pass to a compact quotient by a discrete group of isometries (see Gottschalk and Hedlund 1955). K. Flows and automorphisms on homogeneous spaces Let G be a unimodular Lie group, F a discrete subgroup such that G/F has finite volume (as determined by the Haar measure on G), and Igt : t ER) a one-parameter subgroup of G. Then (&) determines a volume-preserving flow by left multiplication on the set of right cosets. In fact, the classical geodesic and horocycle flows arise in this way (see Auslander, Green and Hahn, 1963 and Brezin and Moore, 1981). Alternatively, let T: G > G be a continuous automorphism such that TF — F. Then the map induced on G/F by T is a m.p.t. By combining translations and automorphisms, one can produce affine maps on homogeneous spaces (see Parry 1969c, 1971). —
1.3. The basic constructions In any subject it is valuable to have ways to modify or combine old objects to make new ones. In this section we list some of the techniques that are available in ergodic theory. A. Factors Let (X, 2, ii,T) and (Y, Se, y, S) be measure-preserving systems
1.3. The basic constructions
11
and 0: X —. Y a map such that OT= S4) a.e., p(0 - 1 E) = v(E) for all E e (6. Then 4) is called a homomorphism (sometimes homomorphism mod 0) or factor map, (Y, W, y, S) (or S) is called a factor of (X, A', p, T) (or T), and (x, a, p, T) is called an extension of (Y, (6, y, S). B. Products
If (X i , .4 i , p i , T1 ) and (X 2 , .2 2 , 112 , T2 ) are measure-preserving systems, we define the product map T= T1 x T2 on X 1 x X 2 by T(x i , x 2) = (T1 x 1 , T2 X 2 ). Then T is a m.p.t. on the (completed) product measure space (X 1 x X 2 ,1 1 022 , p 1 x p2 ). C. Skew products Let (X, , p, T) be a measure-preserving system, and suppose that {Sx :xe X} is a family of m.p.ts of another probability space (Y,(6,y). Assume that Sy is a jointly measurable map X x Y--* Y. Then T : X x Y.X x Ydefined by
t(x, y) = (Tx, Sy) is a m.p.t. on the product space (Exercise 6). D. Flow under a function Let (X, R, p, T) be a measuring-preserving system and f: X —>
(0, cc) a measurable function. We construct a one-parameter flow on the region I- = (x, t) :0 -. t
under the graph of f. Each pcint flows vertically at unit speed, and we identify the points (x, f (x)) and (Tx, 0).
12
/. Introduction and preliminaries
It is easy to see (Exercise 7) that this flow preserves the product of IA with Lebesgue measure. The Ambrose- Kakutani Theorem (see Jacobs 1960) says that under suitable conditions every flow can be represented as a flow under a function. E. Induced transformations There are two kinds of induced transformations, the derivative transformation on a subset and the primitive transformation on a superset. 1. Let (X,.49,p,T) be a measure-preserving system and A X a measurable subset such that for a.e. x E A there is a smallest positive n(x)EN such that Tmx)xe A. Then TA :A.--, A defined by TA X = Tx is an invertible measurable map on A which preserves the normalized restriction of ji to A. 2. Let X = Y0 D D Y2 D Y3 D ... be a decreasing sequence of measurable sets, for each i take a copy X. of Yi such that all the X. are disjoint, and form the discrete union g = U13- 0 Xi . Then g inherits a a-algebra .4 and (possibly infinite) measure /1 from X in the obvious way. We think of fc as a tower or skyscraper built over X0 = X.
.t 3 x t2 x
t
X2
Î: g --) fc is defined by mapping each point in the tower to the one directly above it if there is one, and otherwise to the image under T in X 0 of its projection to the base. This can be made precise in the following way. We have measure-preserving injections ch i : X. —> X ; for i <j induced by the inclusions yi c Yi . We define = {1. 1 iii 1 T(0 1, o k)
if .)ZE X i and ci)-+110i,-{32} #ck otherwise.
One can show that tpreserves
ii.
F. Inverse limits Let (X,. i , p i . Ti) be measure-preserving systems for i = 0, 1, 2, ... and suppose that for each 1 j there is a homomorphism (iv X i , X i such that 4 ,i = identity and cki; ckik = 4lik if i j k. Form the subset X
1.4. Some useful facts
13
of the infinite product n't:"._ 0 X defined by X = fx = (xi): (kiixi ---- xi forai! i Let ni : X
.
X i be the projection: nix = xi . Then clearly
= 75 on X. Let 2 be the smallest a-algebra on X which contains all the by The countably additive measure p defined on the algebra U E) = pi(E) if Ee Mi extends (for Lebesgue spaces see 4.5 and 4.6) to all of R. Complete a. with respect to p. Define T: X X by T(x i) = Then clearly each 75 :(x, a, IL, T)-+ (Xi , pi , T) is a homomorphism. The system (X, 2, p, T) is called the inverse limit of the directed family { (X i , p i , = 0, 1, 2, ... J. Such a construction also applies for more general partially ordered index sets. G. Natural extensions Let (X,2,p) be a measure space and T: X X a possibly noninvertible measurable (T -1 2 c 2) measure preserving (pT 1 = p) map. A measure-preserving system (it, 4, 1.2, (with D invertible) is called a natural extension of c, , p, T) if there is a homomorphism 4): (fc, à. 12, (x, p, T) such that 4) - 2 = 4 up to sets of measure O. A natural extension can be constructed by taking for the space the inverse pi, Ti ), where all (X„ 2„ pi) = (X, T-ia, p), each limit of and for the transformation the (backwards = identity, and Oi; = unilateral) shift. The natural extension is unique up to isomorphism. -
1.4. Some useful facts from measure theory and functional analysis A. Change of variables Let (X, 2, p) be a measure space, (Y, W) a measurable space (i.e. a set Y together with a a-algebra 1 of subsets of Y), and 4): X Y ameasurable map, in the sense that 4 c Then 4) carries p to a measure denoted by 4)p or 14 on W, which is defined by p4) - '(E) = p(4,- 'E) for
a,.
EE Proposition 4.1 If 4): (X, 2, p) > (Y, ce) is a measurable map and f is a real valued measurable function on Y, then —
-
frfd(pork
-
1
)
1. Introduction and preliminaries
14
in the sense that if one of these integrals exists then so does the other and the two are equal. Proof: When f = xE is the characteristic function of Ee Se,
fyxE d(ticir I ) --= prk - '(E) and f xE ° (/) dp = f x x = P(0 - 1 E) , so that the result holds by definition of p4) - 1 . Hence the formula is also true for simple functions (i.e. linear combinations of characteristic functions). If f is a nonnegative measurable function, then f is the pointwise limit of an increasing sequence of simple functions, and the result follows from the Monotone Convergence Theorem. Finally, any measurable function f on Y can be written as the difference f = f + —f - of two nonnegative measurable functions on Y, so the formula is true in general. B. Proofs by approximation
The argument of the preceding paragraph is of a kind frequently encountered in ergodic theory, except that, even more, it is sometimes enough to check a formula only for certain characteristic functions in order to be able to conclude that it holds for all fe Li or L2, all measurable functions, or whatever. A semialgebra on X is a collection .99 of subsets of X which is closed under finite intersections and such that the complement of any Se .9') is a finite disjoint union of members of 99. We say that .99 generates a ff-algebra .0/ if A' is the smallest (complete) o-algebra which contains 99 • Examples of generating semialgebras (for the usual a-algebras) are the collection of half-open intervals [a, b) in [0, 1) and the family of cylinder sets
{xeé: x i = j i 9 Xi 2 =i2 , .. • Proposition 4.2 Suppose
X ik
=jk} in {0, 1, ... n — 1 } 1 .
that p.: L2 x L2 -4 [O, cc), for n =
O. 1,2, ... , is a function such that
(0 P.U., g)
(ii)
K lif 112 Ilg II 2 for all f, ge L2 and some constant K;
+f2 , g) P,S fi , g) + P,02 , g), NV, gi)+ P.(fg2), Pn(Lgi+2) Mai; g) lal Pn(f,g), and Pn(fi
P.(f ag) lai Mi., g) for all f,fi ,f2,g,g„ g2 E L2 and a € R. If lim.„ pn(xE , xF) = 0 for all sets E, F in a generating semialgebra in .07, then lim, oe p. (f, g) = 0 for all f, ge L2.
1.4. Some useful facts
15
Proof : By (ii) it follows immediately that limn„ pn(xA , 4) = 0 whenever A and B are disjoint unions of sets in .99, and also that limn, œp.(0, 0) = 0 whenever (/) and 0 are linear combinations of characteristic functions of sets in the algebra generated by .9' (which consists of all finite disjoint unions of members of 99). The set of such simple functions 4) is dense in L2. Given any f, g E L2, choose such simple 0 rkic -- f in L2 and I, 1l k —k g in 1,2. Then
Of g) = p„(4)k + f —
sbk, g) ‘. p„(4),„ g) + Of —
010
g)
P(4 k ' 0 lc) + P n( 0 1 cl g — 11/ lc) + P 'Si. — 4) k ' g) Pn (95k' Ikk) + K II0k11211g — t 1k 112 + K iif— (Pk h II g II 2 Given E> 0, choose k so that each of the last two terms is less than c/3. and then choose n so that the first term is less than en. C. Measure algebras and Lebesgue spaces There is a coherent way to ignore the sets of measure 0 in a measure space. A measure algebra is a pair (M, p), where N is a Boolean a-algebra (i.e., a set with general operations y, A,' which behave the same way as union, intersection, and complementation do in a a-algebra), and p is a countably additive positive (p(B) ?..-. 0, with equality if and only if B = 0) extended real-valued function on M. If A' is a Boolean a-algebra and 1 c 2, then we say that I is a a-ideal in case
(i) lei, BEN, B <1 (i.e., B A 1 = B) implies Be/ CO
(ii) in e.0(n =-- 1, 2, ... ) implies V I el. n= 1 n
If A' is a Boolean a-algebra and I c2 is a a-ideal, then .0 determines an equivalence relation on M according to B 1 — B2 if and only if B 1 A B2 = (B 1 A Bp y (B ; A B2)E.1. It is not difficult to check that the collection Al., of equivalence classes forms a Boolean a-algebra. For example, let At denote the collection of sets of measure zero. Then X is a a-ideal in M, it is constant on equivalence classes of modulo .Ar and hence determines a countably additive positive extended real-valued function 12 on 4 = 41/..4r, and (4, 12) is a measure algebra. The most important case is when a is the Boolean a-algebra of measurable sets in a measure space (X, 2, p); then (4, 12) is called the measure algebra of the measure space (X, .4, p). Let (M, p) and (4g, y) be measure algebras. A map T: 2 —. W is called a itomomorphism (of measure algebras) in case T commutes with the Boolean
16
I. Introduction and preliminaries
u-algebra operations (so that T(B A B;) = (TB) (TB 2)' and TVB = V TB„ for all B 1 , B2 ,... and satisfies p(B) = v(TB) for all Bea'. If T is onto and one-to-one, then it is called an isomorphism. Let (2, p) be a measure algebra. We define a metric d on 2 by d(A, B) = IAA AB) for A, Be. (.2, d) is called the metric space of the measure algebra
0,p). Proposition 4.3 The metric space of a measure algebra is
complete. A measure algebra (AS, p) is called separable in case its associated metric space is separable — that is, there is a countable dense set. If, for example, (ce, p) is a finite measure algebra and is countably generated, then (gi, p)
is separable. For a measure algebra (2, p), a nonzero Bea is called an atom if whenever A < B either A = 0 or A = B. A measure algebra (2, p) is called nonatomic if it has no atoms. The measure algebra th) of the unit interval is normalized (p(X) = 1), separable (since .41 is generated by a countable base for the open sets), and nonatomic. The following important theorem says that these three properties are sufficient to characterize the measure algebra of the unit interval. Theorem 4.4 (Carathéodory 1939) If (AI, p) is a normalized, separable, nonatomic measure algebra, then there is an isomorphism from (.2, p) onto the measure algebra (.4, th) of the unit interval.
Thus the measure space consisting of the unit interval with Lebesgue measure is a fairly representative object, at least at the level of measure algebras. We single out the class of measure spaces that are actually isomorphic to this standard one, with the possible addition of countably many point masses, in the sense of 'point isomorphism mod 0'. Definition 4.5 A (complete) finite measure space ( Y, ce, y) is called a Lebesque space if it is isomorphic (mod 0) with the ordinary Lebesgue measure space (X, 2, p) of a (possibly empty) interval [a, b) IR together with countably many point masses. That is, there are y1 , y2 , ... e Y, sets of measure zero Y0 c Y and X 0 OE X and a one-to-one onto map 4:
1.4. Some useful facts
)-■ X\X 0 such that 0 and
YVY0 u ty,
17 are measurable and
For a systematic treatment of the theory of Lebesgue spaces, see Rokhlin (1949) or Halmos and von Neumann (1942). For our purposes, it is enough to register the following two theorems of von Neumann (1932a) (see also Billingsley 1965, p. 69). Theorem 4.6 If X is a complete separable metric space and g is the completion of the family of Borel sets with respect to a Borel probability measure p on X, then (X. .4, p) is a Lebesgue space. Theorem 4.7 11 (X, Al, p) and (Y. 'te. y) are Lebesgue spaces and i) -'(1, it)is a homomorphism of their associated measure algebras, then (11 arises from a point homomorphism mod O: there is a set of measure zero X 0 c X and a measurable transformation 0:Xl.X 0 Y such that 1 coincides with el as a map ('i , i;) /2).
Since for Lebesgue spaces the concepts of point homomorphism mod 0 and homomorphism of measure algebras (the measurable sets reduced modulo the o--ideal of sets of measure 0) essentially coincide, a cavalier attitude toward sets of measure 0 can be forgiven. In this book we will deal exclusively with Lebesgue spaces, and in fact will usually work with just the unit interval, since the action of a m.p.t. on any atomic part is relatively uninteresting. D. Conditional expectation Let (X, p) be a probability space, f ELI(X, a., 14 and g a sub-a-algebra. Then
v(A)
f dp, for A e ST. A
defines a finite measure which is absolutely continuous with respect to the restriction of p to g. By the Radon-Nikodym Theorem there is a function ge 1.1( X ,97 , p) such that v(A) =
E1
4
for all A€.97.
A
Any other such function g 1 must coincide a.e. dp with g. We use the notation E(f1) for g, and call E(f Ig ) the conditional expectation of f with respect to As an element of L1 , E(fig- )is completely characterized by the following
18
I. Introduction and preliminaries
two properties:
gfl.F) is .9--measurable; f dp for all A e,_F. (ii) IA E(fl.F )dil This seemingly innocent application of the Radon-Nikodym Theorem in fact provides one of the most important kinds of averaging processes. Themeaning of E(f1.97 ) can best be apprehended in case f = xA is a characteristic function - in which case we use the notation
4AIfl = E(xA 1..F) and call p(A I,_F ) the conditional probability of A given .9- - and is a finite a-algebra (4), E, E`, X}, for some E e .2 with p(E)> 0 and 14E1> O. If E(f ) is to be .9--measurable in this case, it must be constant on E and on Ec; then (ii) gives
E(x
)=
I
AA
(-1 E) p(E) - p(AlE)
on E
p(A n Ec) p(A lEc) on E'. p(Ec)
We see that p(Al.F)(x) gives the probability of occurrence of A once we know to which elements of .9- the point x belongs. In the general case, too, E(f1")(x) represents the expected value of f if we know for each Ee.9whether or not x e E. The following properties of conditional expectation can be proved easily by using the characterization by (i) and (ii). Proposition 4.8 (1) If f 0 E( f ) 0 a e. (2) If f is .F-measurable, then E( f) = f a.e. (3) If f is .F-measurable, then E(fgi.F ) = f E(gI. ) a.e.
(4) (E(E(fl.F )) = E(f) (E(f)=Ix f dp). (5) If .97 , c S. then E(E(f1.17)1.9- 1 ) = E( fig 1 ) a.e. (6) If f is independent of .9-, then E( f ) = E( f) a.e. (7) For each p 1, E( is a linear operator of norm 1 on LP(X, p). (8) Jensen's Inequality: If 4): R -*R is convex (A i , 0, Et= = 1, x 1 , xft e ER implies 44E7= 1 .11x1) and O. f is integrable, then 0(E(fl..97)) E(0° fin a.e.
19
1.4. Some useful facts
E. The Spectral Theorem There are various ways of stating this result, of which we give three. Let T : H —+H be a continuous normal (TT* = T*T) operator on a separable Hilbert space H. (1) There is a finite measure space (X, A', ii) and a function 0ELoe(X, 6/42) such that T is unitarily equivalent to multiplication by 0 on L 2(X , .1, p). (2) There are Borel measures a i > a2 > ... on C such that T is unitarily equivalent to the operator S on the direct sum Er_ L 2(C, ad defined by
,e
S( f i (z 1 ), f2(z 2 ), ...) --= (z 1 f i (z 1 ), z 2(f2(z 2 ), •.•)• The ai are determined up to absolute-continuity equivalence. The equivalence class of a l is called the maximum spectral type of T. (3) There is a unique spectral measure E such that T= f AclE A .
c That is, E is a projection-valued Borel measure on C with compact support such that E(C) = identity, and (E Ur_ i A i )( f ) = Er_ i (EAd(f) if the Ai are measurable and disjoint, where the series converges in the
L2 norm. E is supported on the spectrum a(T) = {Ae C: T — AI has no continuous inverse} of T. If h is any bounded Borel-measurable function on a( T), the integral h(T) =
h(A)dE(A) fex(T)
can be defined by noting that if f, 0 H, then (E(- )f, g) is a complex measure on a(T), and the equation (Sf, g) = fh(A)d(E(A)f, g)
for all f, ge L2
o-(7)
will define S = h(T) on H. In particular Tk
=f J
il k dER 7
)
(1,f, g)= f A kd(E(A)f, g). 17(
T)
There are two facts about these spectral integrals that are very useful in applications.
20
1 . Introduction and preliminaries
Proposition 4.9 If R = j c f (A) d E(11,) and S = Lc g(ii.)dE(2), then RS = Lc f (.1.)g(.1)dE(i1). Proposition 4.10 Let T have spectral measure E, let xeH, and
let v be a finite positive measure which is absolutely continuous with respect to the measure (E(A)x, x). Then there is yeH such that v(A) = (E(A)y, y) for all Borel sets A. (Actually such a y can be found in the smallest T- and T*-invariant closed subspace containing x.) F. Topological groups, Haar measure, and character groups Let G be a topological group, so that G is simultaneously a group
and a topological space and the map G x G -. G defined by (x, y) --, xy - 1 is continuous. If G is locally compact, then there exists on G a left Haar measure ni, i.e., a positive, regular, Borel measure which is finite on compact sets, positive on nonempty open sets, and translation invariant: ni(gA)= m(A) for all g E G and all measurable A. The measure tit is unique up to a constant multiple. Similarly, there is a right Haar measure. Of course, on an abelian group they can be taken to be equal, and on a compact group they can be normalized to be probability measures (see Halmos 1950.). Henceforth let G be locally compact and abelian. The character group of G is the set Û of all continuous homomorphisms of G into the multiplicative group [1( of all complex numbers of modulus 1. '6 is a group under pointwise multiplication, When 6 is given the topology of uniform convergence on compact subsets of G, it becomes a locally compact abelian group. If G is discrete, then 6 is compact; if G is compact. then 6 is discrete. Examples: il% = Z. (Kn)" = Z", ER! = R, (W)*. or. The Fourier transform f of a function f eLt(G,n ) is defined on 6 by
f(x)= f f (g)- a dm(g) G
According to the Plancherel theorem, the Fourier transform f -+ f is an L2 -norm-preserving map from Li (G) n 1,2( G ) onto a dense subspace of L 2(d), which, therefore, extends to an isometry from LAG) onto /Ad). Frequently, f can be recovered from f via an inversion formula. If G is compact, then 6 forms a complete orthonormal set in L2 (G) and one has the Fourier series decomposition, in L2(G), f (g) =
E J(x)x(g)
for any f €L2(G).
xEa
The Pontrya gin Duality Theorem says that (6)^ can be identified in a
1.4. Some useful facts
21
natural way with G. Thus, 7L = 1K, etc. See Rudin (1967) for more details and references. Exercises
1. Show that if T is a m.p.t., then U = UT . defined on I}(X , .0, p) by UT 1(x)= f (Tx). is unitary. What if T is noninvertible? 2. Show that: (a) The one-sided Bernoulli shift (ax)n = on FI:°-0 {0, 1 }, where 0 and I both have weights 1, is isomorphic to the map t 2t mod 1 on [0, 1). (b) .0(4,1) is isomorphic to the 'baker's transformation'
T(x. =
3. 4. 5.
6.
7. 8.
9.
10.
{(2x mod 1, ly)
if 0 x (2x mod 1,(y + 1)) ill
x 1
on [0, 1) x [0, 1). Show that an automorphism of a compact group preserves Haar measure. Show that a homomorphism of measure-preserving systems is onto, up to a set of measure 0. Show that there is a correspondence between (isomorphism classes of) factors of a Lebesgue space and (appropriate equivalence classes of) invariant sub-a-algebras. (You may use the fact that a factor of a Lebesgue space is a Lebesgue space.) Verify that the skew product defined in 1.3.C. is a m.p.t. (Note: To get both T and t extra hypotheses may be needed.) Verify that the flow built under a function in 1.3.D. is measurepreserving. Give a categorical definition of the inverse limit (1.3.F) of a countable directed family of measure-preserving systems and show that an object satisfying this definition is unique up to isomorphism. (a) Construct the natural extension (1.3.G) as the shift on an inverse limit of measure spaces. (b) Prove that the natural extension is unique up to isomorphism. (c) Show that the natural extension of a unilateral Bernoulli shift is the corresponding bilateral Bernoulli shift. Let (X, .0, p) and ( Y, v) be Lebesgue spaces and T : V(Y, e, v)—) 1,2(X , JO an isometry which is multiplicative: T( fg) = T f • Tg
22
1. Introduction and preliminaries whenever f, g, and fg E 4f, v). Show that there is a homomorphism 0: X Y such that Tf (x) = f(4x) ac. 11. Fill in the details in the proof of Liouville% Theorem (2.1). 12. Use the Carathéodory-Hopf Extension Theorem to prove Kolmogorov's Consistency Theorem: Let A be an index set, and for each n = 1, 2, ... and each n-tuple (a, , ;) of elements of A, let p (a,...,.) be a Borel measure on Rn. Assume that: (i) If is any permutation of the set with n elements and TT is the corresponding transformation of Rn, then 1
(ii) If II., , .....
: Rn ,
k Rn
E)
for all Borel E c R.
is the projection map defined by
+k) = (x 1 ,
, x), then
..) (E) = p (a,... _ ..4.k) (11.-÷ik. .E)
for all n. k = 1, 2, 3,...
and all Borel E c= Rn. Then there is a probability space (n. P) and a family If. :ae AI of measurable functions on û such that always
= P{co:(fŒi (co),
fŒri (co))e El.
13. Prove Proposition 4.8. (Hint: For Jensen's Inequality, first consider the case when f is a simple function.) 14. Prove Proposition 4.3. 15. (Lind) Consider the two-to-one map Tx = li(x— 1/x) on R. (a) Show that T preserves the measure dx/(1 + x 2 ). (Hint: It is enough to show by calculus that f R iG(X - 1/x))(dx/(1 + x2)) = lot f (y)(dy/(1 + y 2)) for enough functions f.) (b) Show that the change of variables x = tan t carries T to a n/2). Lebesgue-measure-preserving map S of ( — (c) Show that S is isomorphic to the one-sided Bernoulli shift a(-1-, (d) Find a map that carries T to Vx = 4x(1 x) on [0, 1] (which preserves dx/n. /x(1 x)). (e) For each ae R. discuss the action of Taz = 3-(z + (a/z)) on C, represented as a sphere with poles at the two square roots of a. (Iteration of the map Ta is an ancient algorithm for computing square roots.) —
2 The fundamentals of ergodic theory
In this chapter we prove the basic convergence theorems of ergodic theory, namely von Neumann's Mean Ergodic Theorem and Birkhoff's Pointwise Ergodic Theorem. We also discuss recurrence. ergodicity, strong mixing, and weak mixing. These properties help to understand the manner in which a m.p.t. moves points and sets through the space on which it acts, and their presence or absence provides the first test for deciding whether two transformations are isomorphic.
2.1. The Mean Ergodie Theorem Although the Mean Ergodic Theorem and the Pointwise Ergodic Theorem bear the publication dates 1932 and 1931, respectively, von Neumann's theorem came first.
Theorem 1.1 Mean Ergodic Theorem (von Neumann 1932b) Let (X, A p) be a a-finite measure space, T: X --* X a measure-preserving transformation, and fe LAX, .0, 14. Then there is a function.TEL2(X,R, p) for which in-1
lim 1R -4' GO
E for—I
nk-=0
=---
0.
2
(The requirement that (X, .0, p) be a-finite is not really necessary. For if feL2 (X, A', p), then f vanishes outside a set E of a-finite measure. If we let CO
X' == U TkE, k=
—co
then each f 0 Tk vanishes outside X', and X' is invariant and has a-finite measure. If the Mean Ergodic Theorem holds in L2(r), then we can find Pfe L200 such that 1 "—
-n E Pr —1)'f k=0
24
2. The fundamentals of ergodic theory
in 12(X'). Then xe X — X') and
-
137 extends to Pf e 12(X) (by putting Pf (x) = 0 in case
f° T k Pf in L2(X).) k=0
We will prove a more general theorem than this. Note that the m.p.t. T : X -4 X determines a linear operator U: L2 according to (U f )(x) = f (Tx). U is an isometry, since (using 1.4.1)
flUf (x)I 2dp = fl f(Tx)1 2dp =
11f11 22"
U is also invertible (U 'f (x) = f(7 'x)), and hence U is a unitary operator (its adjoint equals its inverse). U = U T is called the unitary operator induced by T The Mean Ergodic Theorem, then, asserts that 1 n-1
-n
ukf
k= 0
converges in L2 ; this is a consequence of the following theorem.
Theorem 1.2 Mean Ergodic Theorem in Hilbert Space Let U be a (linear) contraction on a Hilbert space ./( (so that II U.f11 11f 11 for all fe Jr), let = {fe lif =f} (so .,11 is a closed linear subspace of /(), and let P: .11 be the projection of Ye onto Then for each fe ye , in-1
-
E
n k=0
Ukf
converges in ye to Pf. Proof : Let .)1( denote the closed linear span of {g — Ug: gel(); we claim that X and di are orthogonal complementary subspaces of .re It suffices to show that .Arl = 1, where Af-1- = {he :(h, n)= 0 for all n e.A } and (.,.) denotes the inner product on ye . ; then (h, g — Ug)= 0 for all gele, so Let h E 0
(h, g) — (h, Ug)= (h, g) (U* h, g) = (h U*h, g)
for all ge.)r, and hence h = U*h. We wish to show that Uh= h. Now I! Uh — h 11 2 = (Uh — h, Uh h) = II Uh11 2 — (h, Uh) (Uh, h) + 1h11 2 = II Uh11 2 — (U*h, h) — (h, U*h) + 1h 11 2 II h 11 2 — (h, h) — (h, h) + 11h112 = 0. Therefore Uh = h,
so hedi. We conclude that
.Afi a di.
2.1. The mean ergodic theorem
25
Conversely, if hE di, then Uh = h and hence U*h = h by the same argument applied to U* (which is also a contraction since
I u*f I
(u*f, U*ni Il UtrY 1111 f Therefore, for any gE
I(UU*M )1
2 -
I 11 u*f 1111 f 11).
,
(h, g — Ug) (h, g) — (h., Ug)= (h — U*h, g) = 0, so heX i. Consequently X.' =-We will show next that if f E.,1; then in-1
— E n
Ukf
k =0
converges to zero. First, if f = g — Ug for some g E .W. then in-1
—E n
k=0
1
ukf=
Ag — Ung),
SO
2 ;71 11 11
— Ukf n k=0
If f E.Ar then there is a sequence Igil in Yt such that fi = gi — Ugi converges to f. Then 1n-1
n-1
E
Uk+
Uk(f — fi )
1
"k----o for each j. Given c > 0, choose i so that ri /4=-0
so that
n-1
nk=0
Ukfi
I f - L II
<4i. and choose n
I n -1
nk = 0 then — n k= 0 Now iff E Then
E fi
is arbitrary, there is
a unique f0 E •Ar such that f =f0 + Pf
n-
ukf—
Pf
k=0
E
uk(fo + Pf) Pf n ic=0
— ukfo n k =0
The proof is complete.
2. The fundamentals of ergodic theory
26
There are many generalizations and modifications of this theorem, of which we will consider one example. The following theorem, essentially due to K. Yosida (1938) (see also Kakutani 1938b and Yosida and Kakutani 1941) contains several basic ideas common to many of these extensions.
Theorem 1.3 Mean Ergodic Theorem in Banach Space Let g be a Banach space and T:g —P g a continuous linear map satisfying IlTk il ‘. M for all k = 1, 2, ... for some constant M. Let yeg. Then the following statements are equivalent: (i) { —
E Tky:n = 1, 2, ...
nk=0 on
converges with respect to the norm
e'.
(ii)
i n —1 — E Tky : n = 1, 2, ...
has a weak cluster point. n k= 0 (iii) T has a fixed point in the weakly closed convex hull of {T ky: k = 0, 1, 2, ... } (i.e. the intersection of all the weakly closed convex sets containing {ry : k = 0, 1, 2, ... } ). {
Proof. (i) (ii): Clear. (ii) (iii): Abbreviating A ny = ( I /n) r,c1:(1 T'y, suppose that a stibnet Ay converges weakly to 9. Then for any continuous linear functional
(T9,0> = U, T*0> = Urn < An.y, T*0> = lim
= <.fl, 0> , because
TA ny — Any =
T1 .'y — Ty —i 0. n
Thus Tr? =9. Of course 9 , being the weak limit of convex combinations of { Tky}, is in the weakly closed convex hull of {Tky}. (iii) (i): Let r? be the fixed point. Since Tky = Tkr, + Tk(y — .T) = .fl + Tk(y — .p), we have Any = 9 + An(y — .0, and it is enough to prove that An(y — .p)-4 0 in q . Now 9 is a weak limit of convex combinations Ma
Say = E Ai.T iy, 't ?-- 0, E ■li.= 1. This implies that y — Say — Eilin(y — Tly) = Eilia(I — 7)(1 + T + T 2 + ... Ti ')y e range (I — T),
2.2. The pointwise ergodic theorem
27
so that y--j7 is in the weak closure of range (I - T), hence also in (weak and strong closure coincide for subspaces - see ----nr aro Royden 1968, p. 201). Now it is easy to show that A n(y ;7) -* 0. For, given e. Clearly Ax 0, > 0, choose X E range (I- T) with II - (y - 1 since An(I - T)= (T T" ')/n. Thus for large enough n,
il Axil +
A n(y -
if A.(x - (y - .0)11 < + Ms.
Remark 1.4 'Weakly closed' can be replaced by `norm closed'
in (iii) above, since in a locally convex topological vector space a convex set is strongly closed if and only if it is weakly closed (Royden 1968, p. 206).
2.2. The Pointwise Ergodic Theorem We turn our attention now to Birkhoff's Ergodic Theorem, also known as the Individual (or Pointwise) Ergodic Theorem. The basic estimate needed to prove the ac. convergence of the ergodic averages n-1
f (T kx)
-
k=0
is the content of the preliminary result known as the Maximal Ergodic Theorem, which concerns the maximum 1
n-1
n
0
f*(4= sup na,
1
f(Tkx)
of these averages. Actually, an estimate on the lim sup rather than the sup is sufficient to prove the Pointwise Ergodic Theorem, and this was Birkhoff's method in his original proof. Later we will study the role of maximal inequalities in some detail. For now we prove the estimate by means of an idea that goes back to Kolmogorov (1937) and Yosida and Kakutani (1939) and most recently has been presented in an especially clear form by Katznelson and Ornstein. Theorem 2.1 Maximal Ergodic Theorem (Wiener and Kakutani 1939) If fELAX, p), then
If* > 0}
Remark : It follows then that also fdp 0, •rif. 0)
1939, Yosida
28
2. The fundamentals of ergodic theory
since for each & > 0 we have
0 -.<._
( f + e)dp ...‹._ fiu. + os > 0)
f dp + e, fus> - E)
and we can let e decrease to 0 and apply a convergence theorem. Proof : The set where f * > 0 is the disjoint union of the sets
B 1 = {x:f(x) > 0 } B2 = { X :f(x) 4 0,f (x) + f(Tx)> 01
B.= {x: f(x) 4 0, ... ,f (x) + ... + f(Tn - 2 x) 4 0, f(x) + ... + f (Tn - 1 x) > 01 If we can show that
f then it will follow (by the Dominated Convergence Theorem applied to XB, u uB„ f) that Ls>o)
Let us fix an n = 1, 2, ... . The idea is to break B1 u ... u iiin into a union of different disjoint pieces, over each of which the integral of f will clearly be nonnegative. These pieces will be pictured as towers Bic' V TB Ik U ...UTk— 1 /31. In order to accomplish this, we make three observations:
(1) TkB,, B i u ... u Bn _ k for k = 1, 2, ... , n — 1. This is so because if X E B., then f(x) + f(Tx) + ... + f(T k- 'x) ...ç_ 0, while f(x) + f '(Tx)! + ... + f(T k- 1 x) + f (T kx) + ... so that we must have f(T5) + ... +f(Tn'x) > 0, i.e., f(T5) + f(T(T kx)) + ... + f(Tn -1` - 1 (rx))> O.
(2) The sets B., T B., ... , Tn - 1 B. are pairwise disjoint. This is so because if TiB. n VB.* 0 for some i <j, then B. n T-"B.# 0, contradicting (1).
2.2. The pointwise ergodic theorem
29
(3) If we let
B
1= H1 = B I VC 2 u ... u C.),C =
then the 'columns' C 1 , C 2 , ... Cn are pairwise disjoint, and the levels H , ,r ---1 .131 within each column Ck are also pairwise disjoint. Thus the following picture is a correct representation of B 1 u B2 B
L.) B2
Tn •
2B;,_ 3 B:,_
TB B,,
2
2 =
,\C,,
C._
B;1 _2 =
—B;
Bn_2\(C„ u
cl
cos - 2
This is so because (i) the pieces are in B 1 u u B, by (1);
(ii) each base is disjoint from all the columns to the left of it, by definition; (iii) each base is disjoint from all the columns to the right of it, by definition (for the base) and by (1) (for the higher levels - since the images of the base to the right are contained in Bis even further to the right). Thus, if two columns were to intersect, we could apply until one column intersected the base of the other; and we have seen that this does not happen. Now it is a simple matter to make the estimate
fdp =
f
n
n
E f fdp = E Ck
k = 1 B;c LI T 4 1.)...
n
.Ef k=1
4
(f + f T + ... + f T k - 1)dp › 0,
f dp L.) T ie
- 1 13;c
30
2. The fundamentals of ergodic theory
since f + f T + ... + f T k- 1 > 0, by definition, on
Bk = B.
Corollary 2.2 For each ac R, f dp › att{ f * > a}. art,* > al
Proof: Letting g =f- a, we see that { f* > a) = (g* > 0 } , so that 0
L.> oi gclti = f
(f - a)dii,
If* > a)
and hence
f
f dp .?...- °cuff * >Œ}
(fs> a}
Now we are in a position to state and prove the fundamental theorem of ergodic theory, the Pointwise Ergodic Theorem (also known as just the Ergodic Theorem) of G. D. Birkhoff.
Theorem 2.3 The Ergodic Theorem (Birkhoff 1931) Let (X, M, p) be a probability space, T: X -- X a m.p.t. and fc L l (X,M, p). Then (1) lim.,(1/n)E::,?„ f (Tkx) = J(x) exists a.e.; (2) f (Tx) = J(x) a.e.; (3) f E 1-1 , and in fact (4) if AE M with T -1 A = A. then fA fdp = f A ldp (this says that if .5 is the sub-c-algebra of .4 consisting of all the T-invariant sets, then f = E(f1.1) a.e.); (5) (1/n)a: (1) f Tk -> f in L.
11f111 IlfIli;
Remark 2.4 If X has infinite measure, the same statements hold, except that (4) and (5) apply only to invariant sets of finite measure. Proof of the Ergodic Theorem: (1) For each a, /3 € R with a < fi, let 1 n -1 E,,.fl = xe { X : lim inf - E f(rx) < a ‹ # ri --■ co n k=0 in-1
/1
E
k =0
We will show that p(E) ---- 0 for each a, P. Then the union over all rational a, /3 will also have measure 0, and hence the limit exists a.e. Now E 1 is an invariant subset of f * > #}, so by considering T restric{
31
1.1. The pointwise ergodic theorem
ted to E11, we see that the Maximal Ergodic Theorem implies that
SEE P
/3p(E.,fl ).
fdp
Next we consider — f. Since if x E Ece13 , there is an n 1 with
E f(Tkx)< a,
n k=0 we see that
Ect.P
((—
>
Hence, by the Maximal Ergodic Theorem,
— ap(E.. p ), Or
L.0
dit < c4(E..0).
Thus
fit4E,03) tçj
fdi.1 ‘. 340,4), Ea,p
and, since a < /3, this is possible only if p(E.. p ) = O. (2) It is clear thatjT =fa.e. (3) We use Fatou's Lemma. Since I 1 '1 I 1n-1 - ,1
we have
> f n k=0 Ik=0 I T' ,
I
I n 4‘
If and thus
J
if IcIP
11 I f( Tk X) fFd
JIfI d
< oo.
(4) This is usually proved by means of the Maximal Ergodic Theorem as follows; we will also obtain this result as an immediate corollary of (5). For each n =0, 1, 2, ... and k 0, + 1, + 2, ..., let
A ndt :=I X
E
k _
k+1 < 2 . 1.
The A n.k are invariant sets, and for each n we have A J A n k
le
2. The fundamentals of ergodic theory
32
Fix E > O. Then f* > kl2" — fdp
Similarly, (
—
E
on A n.k , so
(- — 2"
f )* > (k +
)/r on A n.k , so
k+1 2r, ii(A n.k).
fdp
Thus (— E)p(A 2n
and letting
k+1
fdp
n.k )
2R
A„,k
E --0
0 gives k+1
fdp
±11(A k) 1 n.
2n
p(A n.k)..
2n
A,, k
p(A "
,
Since obviously 2n
k+1
Idp
)
k ),
2n
"
n'
we have that fdp — f JAn.k Summing over k, dp —
1 A",k
2n
fdp
— p(A),
A
e
p(A
n.k
2n
and the conclusion follows upon letting n 0 X. (5) For bounded functions. the 12 convergence would follow from the Bounded Convergence Theorem. The general case can then be proved by approximating by bounded functions (which are dense in L') and using (3). There is no problem in assuming thatf 0, since we may writef =f —f and deal with the two parts separately. If g is bounded and 0 g Çf —
then n-
E n
-
k= 0
—1
-n1 nE
(fTk —
k= 0 n— 1
-n y
g Tk 4
k= 0 By (3), the third term is less than or equal to 11 g
—
f Il i , which can be made
2.3. Recurrence
33
arbitrarily small by appropriate choice of g. Similarly, the first term is also less than or equal to ll f- g 1h. But once g is fixed, the second term approaches 0 as n --, oo , by the Bounded Convergence Theorem. This proves (5). (Notice that it is essential here that X have finite measure.) We can also give in this vein an alternative proof of (4): .
1
n-1
1 fidil - ficlil l = fA ('Z k l
f) dil l
Z-4 1— E f Tk - 1 dp = -ni En— f' 7 4 - 11 1 n— 1
A n k -=
0
ic=0
---■ 0, LI(A)
by (5). Remark
2.5 It is not hard to extend the Ergodic Theorem from
the case of point transformations to that of more general Markov operators (3.7) having subinvariant measures (see Foguel 1980 for the details).
2.6 The Maximal Ergodic Theorem (2.2.1) and parts (1), (2) and (4) of the Ergodic Theorem (2.2.3) hold under the weaker hypothesis that one off + and f - is in L' rather than fe Li . Remark
Exercises
1. State and prove versions of the Maximal Ergodic Theorem and
Pointwise Ergodic Theorem for one-parameter measure2. 3. 4. 5.
preserving flows. Prove Remark 2.6. Show by example that (4) and (5) of the Ergodic Theorem need not hold if (X)= 00 . If gm. co and gel;3 , then {kg} need not converge a.e., but it does converge in some sense. Identify f(x) in case (a) (X, .4t, p, T) is 2(po , D.- 1 9 Pn - 1) and f(...x_ i , xo , x i ...)= .' • /
X(i)(x 0)•
6.
(b) Tx --.-- x + a mod 1, a irrational, and f ---- xi for some interval I. (c) Tx --.-- x + 1 on R, ii is Lebesgue measure, and f e L i . Show that if I',1:4f(Tic x) ---> co a.e., then f , f dp > 0.
2.3. Recurrence Let (X, At , 12) be a probability space and T: X -- ■ X a measurepreserving transformation. In this section we discuss the problem of recurrence, the most basic question to be asked about the natures of orbits of points and measurable sets. We prove the recurrence theorems of
34
1. The fundamentals of ergodic theory
Poincaré, Khintchine, and Halmos and define the induced transformation on a set of positive measure. The mathematically simple Poincaré Recurrence Theorem has become famous because of-its physical and philosophical implications, some of which we will indicate below. It may be considered to be the most basic result in ergodic theory. Definition 3.1 Let BEM. A point xeB is said to be recurrent with respect to B if there is a k 1 for which rx GB. Theorem 3.2 Poincaré Recurrence Theorem (1899) For each BEM, almost every point of B is recurrent with respect to B. Proof: Let F be the set of all those points of B which are not recurrent with respect to B; then F = B—
k=1
T -k B=BnT -1 (X — B)nT -2 (X — B)n...
Note that if xEF, then Tn..1cOF for each n 1. Thus F nT'F = 25 for n 1. and hence T'FnT -(n +k) F Ø for each n 1 and each k O. Then the sets F, T -1 F. T -2 F,... are pairwise disjoint and each has measure p(F). Since p(X) < co, p(F) must be zero. One may make the following physical interpretation of this result. As usual the space X is supposed to include all the possible stat_.; of some physical system, the a-algebra to consist of all observable states of the system, and the measure p to specify the probability of each observable state. The physical system is evolving with respect to a discrete time (i.e., we make measurements on it, say, once a second), and T: X —> X is the transformation which carries each state of the system into its succeeding state. In a situation of equilibrium, the transformation T preserves the measure p, so that the probability of an observable state does not change with the time. Under this interpretation Poincaré's Recurrence Theorem says that if at time zero the physical system is in some observable state B, then almost surely the system will eventually return to this observable state. For example, if we insert a partition in a box and pump out all the air on one side of the partition, our system of air molecules is in a state for which all the molecules are in half of the box. Poincares Recurrence Theorem asserts that if we remove the partition and wait long enough, the molecules will almost surely once again congregate in their original half of the box. The fact that this theorem implies that such an unlikely event will almost
2.3. Recurrence
35
surely happen has worried many people for a long time. Zermelo pointed out the apparent incompatibility of this prediction with such important conclusions of thermodynamics as the Second Law and Boltzmann's H-Theorem. Apparently much of the controversy is based on various misunderstandings, such as the fact that the H-Theorem involves not a single orbit (or history) but a quantity calculated by performing an average over all possible initial conditions. We also face the difficulty that the expected return times are even larger than enormous. Consider the following simple example, due to the Ehrenfests (1957), which involves only a
relatively small number of particles. Let us suppose that there are two urns, one of them containing 100 balls numbered from 1 to 100, and the other being empty. There is also a hat containing 100 slips of paper numbered from 1 to 100. Once a second we draw a slip of paper from the hat, read the number on it, replace it in the hat, and move the ball bearing that number from whichever urn it is in to the other urn. According to the Second Law of Thermodynamics, as well as our naive intuition, the system will settle down towards the statistical equilibrium state in which there are 50 balls in each urn. Of course there will continue to be random fluctuations about the 50-50 division, but it appears highly unlikely that a fluctuation could be so large that all 100 balls would return to the urn from which they started. The Recurrence Theorem says that although such a fluctuation may be highly unlikely, still it will occur almost surely. The Recurrence Theorem really applies to this situation because this sequence of experiments can be represented by a Markov shift. We can describe the state of our physical system at a given time k = 0, 1, 2... by Specifying the number cok e {0, 1, 2, , 100} of balls in the first urn. If at time k = 0 there are coo balls in the first urn and we proceed to draw numbers from the hat and so forth, the system passes through the states coo , co i , co 2 ,... in succession, subject to the conditions co
1 ... 100} k e{0" (ok wk411= for all k 0, 1, 2,... Matters can be simplified considerably if we assume that the experiment began infinitely long ago and continues infinitely far into the future. Let SI nr {0, 1, 2,...,100} , let :CI CI be the shift transformation defined by (aco) (n) = co(n + 1) for n E 1, and let .4 be the ci -algebra generated by the finite segments of histories ( 1)
Bk (i i , i2 ,...,in)
{coal: co(j + k) = ip j
36
2. The fundamentals of ergodic theory
We wish now to construct a measure p on (n, a) such that p(Bk (i t ,...,0) gives the probability of observing the sequence (i 1 , ... , id of successive states of the system beginning at time k. The a priori probability pi of observing the state i at time k is independent of k and is
1 (100) Pi— 2 1 " \ i ). Let p denote the vector (po , p i ,.••,p 100 ) For each i, j = 0, 1, ...,100, let aij denote the conditional probability of the state j given the state i. If we are in state i. then there are i balls in the first urn and 100—i in the second. Drawing a number m from the hat, the probability that ball number m is in the first (second) urn is 1/100 ((100 — 0/100). Now from state i we can only move to state i+ 1 or i— 1. Thus t, i - 1
a
=
..
=
.
.
i
100 100 — i 100
ao = 0 if j is neither i + 1 nor i — 1. We have the transition matrix -
0
1
1 100
o
—
A
0 0
2
0
0 99 100 0 3 100
0
0
o
o
98 100
o
o 10
•••
97 100
Then the probability of observing a sequence (i 1 ,... ,in) beginning at time k is independent of k and is given by
P(Bdil , • • • , in) ) = Pi, ai,,i, • .. Since pA = p, the conditions of Kolmogorov's Theorem are satisfied and p extends to a measure on all of ge such that a: X -- ■ X is a m.p.t. Let E = {cue il co(0) = 0 } , so E consists of those performances of the experiment in which we are interested. The measure of E is p o > 0. Accord-
2.3. Recurrence
37
ing to the Recurrence Theorem, IwEE: there is k> 0 such that crk coeE} has measure equal to p(E). That is. with probability 1 the system will recur again and again to the state in which there are no balls in the first urn. Of course the expected time is astronomical: by Kac's Theorem (2.4.6), it is 1/p(E) = 2 1 " drawings. For real systems with millions of particles, the expected return times will be even more absurd. For recurrence of sets a sharper, quantitative statement can be made. A set E c Z is called relatively dense if it has bounded gaps. in that there is a positive integer K such that En ijj + 1,...,j + K
11 # 0 for each je Z.
The following theorem says that the images of a measurable set under the iterates of T come back and overlap the set fairly regularly - namely, with bounded gaps. Theorem 3.3 (Khintchine 1934) For any BE
and any E > O. the
set
EE = IkEZ:p(rBnB)
p(B) 2
—
is relatively dense. Proof: We direct our attention to the Hilbert space L2 (X p) and apply the Mean Ergodic Theorem. Let U: L 2 4 L2 be the unitary operator induced by T. If Be.4 and z8 is the characteristic function of B. then -
8 . Thus
X7-kB = U
p(Tk B n B)=
zil z r,B dp=
z i3 U -k z Bdp=(z 13 ,U -k x8).
Applying the Mean Ergodic Theorem to f = 4, given E > 0 there is an n such that n-1
-
Pf
Ulf
n k=0
<
1 111+ 1
'
and hence for each j el n-1 '
E
uk+if-
Pf
• k=
+ 1 or
n-fj-1
-n kE. i U
kf
Pf <
11/. 11+ 1
for all jEZ.
Because of the orthogonal decomposition L2 =
Art e . 4 •
in the Mean
38
2. The fundamentals of ergodic theory
Ergodic Theorem, consequently
(Pt, Pf)=-- (Pf f),
also, since 1 edt, (f, 1) = (Pf 1);
(f, 1 )2 = (Pf, 1 )2 11 Pf 11 2 ( 1 , 1 ) = (Pf, Pf ) = (Pf, f). Then
y
-0 - 1 E
1( 1 n 1 k -
n
U f — Pf,f)1‘.
— Pf
f < E for all jeZ,
k=i
SO n+ — 1
E 11(74B n B) -=
=
kj
E
n k=j
(Ukf f) (Pf,f) — E (f, 1)2 — e
1.1(13) 2 — E for all jel.
Thus the interval [i, n +1 — 1] must contain at least one k for which p( TkB n B) 4 B)2 E, and this shows that Ef is relatively dense. One may study recurrence also in more general situations, even where there is no finite invariant measure and where T is merely a set transformation rather than a point transformation. Let (X, .4) be a measurable space, Jc .4 a a-ideal with T , and T: X X a (possibly noninvertible) measurable transformation. For each Beg, if 00
B* k=1
then B\B* is the set of all those points of B which never return to B. We say that the transformation T is recurrent in case B\B* e if for all Be. For each Beg,
n=0 j?--. n
is the set of all those points of B which do not return to B infinitely many times. 1f for each Beg this set is in 5, then we say that T is infinitely recurrent. Poincares Recurrence Theorem implies that a m.p.t. on a finite measure space is infinitely recurrent, where 5 is the a-ideal of sets of measure zero. B, T -2 B,... are pairA set Beg is called wandering if the sets B, wise disjoint. T is called conservative if every wandering set is in f. Since B\B* is wandering for each Beg, it is true that T conservative implies T recurrent. Finally, T is called incompressible if whenever Bea' and T - B B, then B\T-1
1.3. Recurrence
39
Theorem 3.4 (Halmos 1947) Let X, a, f. and T be as above. Then the following statements are equivalent: (I) T is incompressible. (2) T is recurrent. (3) T is conservative. (4) T is infinitely recurrent. Proof (Wright 196Ib): For each Bea, continue to let B* = Ukc° I T-k a Note that each set LAB* is wandering, and conversely if B is wandering then B n B* = 0 so B — B\13*. (1) (2): Let Bea and E = Bu B* . Then T -1 E =-- B* E, so E\T - 1 Eef. But E\T - 'E = (B u B*)\B* = B\B* , so B\B* E f . (2) (3): If B is a wandering set, then B = B\B* Eit, since T is recurrent. (I): Suppose Be a and T -1 B c B. Then B* = T - 1 B, so (3) = LW e .1 t , since B\B* is wandering and T is conservative. (4) (2): Obvious. (2) (4): If T is recurrent and Be, then 13\13*e I . We need to show that 13\n 0 T' B* e it . Now
B\
fl
T 'LP = B n (x \ n T-nB*). B n U (X\T'B*)
= B n[(X\B*)u (X\T - 1 B*)u (X\T - 2 B*)u ...] = B n[(X\131u(B*\T - 1B*)u(T ' B*\T - 2 Blu ...] = (13\13*)u[B n
co (T ' B*\T - (n+ 1)B*) .
0 Now T -1 T - "B* = T -("'"B* T - "B* and T is recurrent, hence incompressible, so T ' B*\T - (n+ 1) B* e., for each n = 0, I, 2, ... Consequently B\Rœ_ o T 'B* e 5 and T is infinitely recurrent. n=
The phenomenon of recurrence makes possible an interesting construction of m.p.t.s which is very useful for producing examples with a wide variety of properties. Let T: X —0 X be a m.p.t. and Ac Xa measurable subset of X of positive measure. The integer
nA (x).-- inf in .?.--- 1: Tnxeill is defined (and finite) for a.e. xeA. A is a probability space with measure PA = pl p(A). We define the induced or derivative transformation TA:A—*A by
TA (x) ---- TnA'x for a.e. xc A (Kakutani 1943)'.- Of course n A and TA are measurable, and in fact TA is a measure preserving transformation. This is all checked most easily with the aid of the diagram below, in which -
A. = (xe A n A (x) = n). :
40
2. The fundamentals of ergodic theory
1 I
1
I
i
1
I t I 1
1 4 I
t
T2AVALITA)
I
I
TA\A
I
j
A
AI
The action of T on this part of X is described as follows: a point not on the top floor is moved directly up, and the top floor is moved back down to the first floor. Under TA , each point of A is mapped to the point where it first returns to A. This idea of a derivative transformation can also be reversed, so as to define an induced or primitive transformation T: i'l -, R on a space Ye larger than X. For example, if A t X is a measurable set with positive measure, let A' be a distinct copy of A. The disjoint union fe = X u A' is made a probability space in the obvious way. We think of A' as sitting over A.
A'
X X\A
A
The action of T is described as follows. Since A' is a copy of A. there is a one-to-one onto map - --* x' from A to A'. We let Tx if xe X\A {
if xeA Ty if xe24 1 and x = y' for ye A.
The action of T is described in the same way as that of T above. Again T is a measure preserving transformation. Of course this process can be repeated so as to construct skyscrapers with 3, 4, ..., oo floors as well. -
2.4. Ergodicity 1.
2.
3.
4. 5.
6.
7.
41
Exercises Let T: X --+ X be an invertible, measurable, nonsingular transformation on a a- -finite measure space (X, A', m), in that T preserves the a-ideal of null sets of m. A set WER of positive measure is called weakly wandering if there is a sequence nk -+ oo such that the sets rk W are all pairwise disjoint. Show that if T has a weakly wandering set, then there does not exist a finite invariant measure equivalent to m. (The converse, due to Hajian and Kakutani (1964), is also true.) Let T be as in (1). Show that X has a decomposition into disjoint, measurable, invariant conservative and dissipative parts, X = C u D, in the following sense: TI C is conservative and D= { TRW: nel} for some wandering set W. (Hint: We may assume that m(X) < co . Take W,, with m(W,,) sup {m(W): W is wandering} and let C be the complement of the invariant set generated by the .) Let T be as in (1). Show that T is conservative if and only if ur takes only the two values 0 and co a.e. for each nonnegative u eV' (X, m). Verify that the induced transformations TA and really are m.p.t.s when X is. Describe the action of TA in case (a) X = [0, 1), Tx = x + a (mod 1), and A = [0 , 1), (b) X = (0, 1}', a- is the shift, and A = tx: x(0) = 01. Prove directly (i.e. without using 3.3 or the Mean or Point wise Ergodic Theorems) that if T is a m.p.t. on a finite measure space and p(A) > 0, then In .?--• 1 " A n A) > 01 has bounded gaps. (Hint: If not, there is a sequence (ni ) such that the sets T - "1,4 are essentially disjoint.) If p.(A)> 0, then almost every point of A returns to A with a positive limiting frequency. Need almost every point of A return to A with bounded gap?
Er. o
2.4. Ergodicity From an abstract point of view, the qualitative ideas of recurrence discussed in the preceding section lead naturally to quantitative considerations. Granted that points almost surely return to subsets of positive measure, how often do these recurrences take place, and how much time does (the orbit of) each point spend in the vicinity of a given subset? _ Considering again the example of the Ehrenfests, according to intuition
42
2. The fundamentals of ergodic theory
the two-urn system should spend most of its time near the highest probability situation (an even division), with only very infrequent and brief diversions to low-probability states. Thus the high probability states at least seem attractive and stable, with high probability and on a reasonable time scale. Historically and physically the idea of ergodicity carne from Boltzmann's ergodic hypothesis. It was desirable that the time mean of a physical variable should coincide with its space mean, i.e. that the long-term time average along a single history (or orbit) should equal the average over all possible initial conditions, or, equivalently, the average at any other single moment over all possible histories. (The word `ergodic' comes from the Greek for 'energy path') In order to arrive at this conclusion, Boltzmann hypothesized that each orbit (under the action of Ill) filled out all of the phase space (in his case a surface of constant energy). It did not take long to realize that such a condition was topologically impossible, and so it was replaced by the quasi-ergodic hypothesis: each orbit is dense in each surface of constant energy. (This is minimality ; see Section 4.2). However, in spite of many attempts to prove that it did, this weaker hypothesis does not imply the equality of space means and time means. (This follows from the fact that a minimal system need not be uniquely ergodic - see Section 4.2-, as was first shown by Markov - see Nemytskii and Stepanov 1960.) In this section we will establish several correct and mathematically easy necessary and sufficient conditions for the equality of space means and time means. The most basic of these is metric indecomposability; we will in fact take this as the definition of ergodicity. Physicists have complained that none of these conditions is easy to verify in practice. Indeed, it was only recently (1963) that Sinai was able to prove the ergodicity of (a simplified version ot) the hard sphere gas, the most fundamental system of interest in statistical mechanics. Practical difficulties aside, the property is interesting in itself and worthy of close examination; and since every system can be decomposed into ergodic systems (see Jacobs 1960 pp 85 ff) the assumption of ergodicity, if necessary, is frequently harmless. Recall that a set Be gi is called invariant if 1 T ' BAB) = 0. The transformation T (or, more properly, the system. (X, gi1, p, T)) is called ergodic or metrically transitive if every invariant set has measure 0 or 1. (
Proposition 4.1 (X ,gI, p, T) is ergodic if and only if every invariant (fo T = f a.e.) measurable function on X is constant a.e. Proof: Suppose every invariant measurable function is constant a.e., and
2.4. Ergodicity
43
let Ee.4 be an invariant set. Then xE is constant a.e., so xE is either 0 a.e. or 1 a.e. Thus ;4E) is 0 or 1. Conversely, suppose (X, .4, p, T)is ergodic andf is an invariant measurable function. Then for each reR. E,, = bce X: f(x) > I.} is measurable and invariant, hence has measure 0 or I. But if f is not constant a.e., there exists an reR such that 0 < ,u(Er) < 1. The refore f must be constant a.e. Theorem 4.2 (X, p, T) is ergodic if and only if 1 is a simple eigenvalue of the transformation U induced on L2 (X, p) (complex) by T. Moreover, if (X, at, p, T) is ergodic, then every eigenvalue of U is simple and the set of all eigenvalues of U is a subgroup of the circle group K I zI = 1 }. Conversely, given a subgroup G of the circle group, there is an ergodic system (X, p, T) such that G is the group pf eigenvalues of the unitary operator on L2 (X, A p) determined by T. Proof: 1 is always an eigenvalue of U, since constant functions are invariant. For 1 to be a simple eigenvalue means that Uf =f implies f is constant a.e. Thus the first statement is obvious. Since U is unitary, every eigenvalue of U has absolute value 1. (For if Uf= Af, then f= .I.U*f, so (Uf, f) = A(f, f) and (Uf, f) = (f, U*f)= 1/X(f,f). Thus AX = 1.) If f is an eigenfunction with eigenvalue A, then Ulfl = I Ufl = 141 = If I, so If I is a nonzero constant a.e., since T is ergodic. Therefore f* 0 a.e. Now if g is another eigenfunction with eigenvalue then U(g/f) = (ri/A) (g/f), so g/f is an eigenfunction with eigenvalue ?JR; therefore the eigenvalues of U form a subgroup of K. If we take = A, we see that g/f is constant a.e. ; therefore each eigenvalue is simple. Finally, suppose we are given a subgroup G of K. If we give G the discrete topology, then its character group Ô is a compact abelian group and hence has a unique normalized Haar measure p. Define 0E6- by 0(g) = g for all geG, and T: Ô Ô by Ty = 0-y. Equipping 6' with the a-algebra A' of Borel sets, we obtain a probability space (6', A p) and a m.p.t. T: Ô --• Ô. Note that if f: K is a character of Ô. then for each 7E 6, (Uf)(y) = fifirY) 2---. f(A) f (y), so f is an eigenfunction of U with eigenvalue f(4). We will see that all eigenfunctions (up to constant multiples) arise in this way, and that each eigenvalue is simple. The map G --0 d according to g where fg(y) = y(g), is well known to be an isomorphism onto. The eigenvalue corresponding to feÔ is JO) = 4)(g) = g. Thus G is contained in the group of eigenvalues of U.
44
2. The fundamentals of ergodic theory
Now the elements of d form a complete orthonormal set in L2(0, M, A). Thus, given an eigenfunction f with eigenvalue A, we have f=
E agfg
(ag EC),
geG
and thus
f (OD = 1 2g f,(0 .0 - Eagfg (o)f.(y)= Eag gy(g) geG
= Af (V) =
E ilag fp)= Eolagy(g), geG
so agg = Aag for all g EG, and hence ag = 0 whenever g # A. Therefore g = a,lf,t , and we see that each eigenfunction is a constant multiple of a character of d. The foregoing also shows that the group of eigenvalues coincides with G and each eigenvalue is simple. Remark 4.3 A system (X, a', p . T), such as the system (6, M, p, T)
constructed in the preceding proof, which has the property that the eigenfunctions of the induced unitary operator U on LAX. M. p) span /i(X. M. p). is said to have discrete spectrum. Theorem 4.4 (X, gi, p, T) is ergodic if and only if for each f E Li (X , a, p) the time mean off equals the space mean of f a.e. : in-1
f(X)==
lirn -
E
n—bco rik.0
f(Tkx) =
f f dp a.e.
x Proof: Suppose (X, gi1, p, T) is ergodic. Then 7, being invariant, must be constant a.e. Moreover, from the Ergodic Theorem we also have
ix fdp = fx jd,u = 1(x)
a.e.
Conversely, suppose that for each f EL 1 (X, If f is an invariant function in L1 (X, M, p), then
1 —'
-E
f( T x) = f(x)
a, p), f
is constant a.e.
a.e.,
n k-=- 0 so f = f a.e. Thus f is constant a.e., and Proposition 2.4.1 implies that (X, a, p, T) is ergodic.
For a measurable set E and a point xe X. we defi ne the mean sojourn time of x in E to be in-1
liM— n_.con
y xE (Tkx) =1E(x).
k=0
45
2.4. Ergodicity
If T is ergodic, then iE = p(E) a.e. Conversely, if the preceding theorem holds for characteristic functions of measurable sets, then, for an invariant set EE, 2E = X E a.e. is the constant p(E) a.e., so ,u(E) must be 0 or 1. Thus T is ergodic if and only if the mean sojourn time in a measurable set equals the measure of the set for almost all points of X. The theory of Krylov and Bogoliouboff (1937) (see also Oxtoby 1952) reverses this situation by starting with a measurable transformation and trying to define an ergodic invariant measure by
1''
p(E)= lim 11 -* C0
E XE (T kX)
n k =0
when the limit exists. Proposition 4.5 (X, M, p, T) is ergodic if and only if for each f geV(X, M., p) we have 1 n -1
rim n-'œ
E (U" f, g) = ( f, 1)(g , 1 ).
n k.0
Proof: If (X, M, p, T) is ergodic, then 1 n-1 (ukf, 11111 — rt-• co /1 k=0
E
g) = (1, g) = ( f f dp, g) X = (( f,
I), g) = (f,1)(1, g) = (f, 1)(g, 1).
Conversely, given f€ P(X , A', p) c 1)(X , M, p), suppose (7, g) = (f, 1) (g, 1) for all ge12(X,M,p). Then we must have 1= (f,1)= Ix f dp a.e., so T is ergodic by the preceding theorem. In case T: X -, X is ergodic, the Kakutani skyscraper picture we associated with an induced transformation TA :A-- Aon a subset of positive measure is actually a picture of the action of T on (almost) all of X, since almost every point of X must eventually enter A.
2. The fundamentals of ergodic theory
46
Here nA(x)= inf In > 0: Tnx e A} and A n = Ix e A:n A(x)= n } . This diagram makes possible a calculation of the expected recurrence time 1
nA d,u
,u(A)fA
of a point of
A to A: it is 11p(A). We give three proofs
of this interesting
fact (partly because the question of expected multiple recurrence times see 4.3 - is open). Theorem 4.6 (Kac 1947) Let T be an ergodic m.p.t. space (X. PÀ, p). If A E4 with p(A) > O. then
on a Lebesgue
nA dp = 1. s'A
(Wright 1961a) Referring to the diagram above.
Proofs : (1)
CO
SA nA dp =
p(X)= 1. n= 1
of n pieces, each of since the column Au T A n u ...0 T" - 'A measure p(A n). and the union of the columns is X. (2) (Kac 1947) For each k = 0. 1. 2.... let Ak = X\T A. Define and
m 0 --- 1
nAt n---n As, — 1) for k O.
mk
Then for each k
1.
1.1(Anizf i n...n k nT 4 + 1) A) = p(A n i n n Ak ) p(A nA i n n = p(i n n ;i ) - p( 2-1,D n n A k )
/10. i )
' • • • n Ak+ 1)] n 71k+ 1) - g il-on Lu(Ai (and. because T is measure-preserving) 71k- 1) gilon • • • n izfd - [f (A ° n - n 74k) gÂo n - n A k+1)]
= 1-1(Aon =
Mk
— ink+ — M k+1 +
M k+2
=
Mk —2M k+ 1 + M k+ 2'
Now
SA
(k + 1)1.4(Anq i n n  k nT -(k+ " A)
n A d,u = k=0
=
(k + 1)(m k - 2m k+ + m k+ 2 ) k=0
2.4. Ergodicity
47 ,
E (k + 1)(m k — Ink + 1 ± ink+ 2)
= link
n-6c° k=0
= liM 1 [ n-tco
n
ni-1
k=0
k=1
n+2
E (k + 1)m k — y 2kmk + E (k —
)mk ]
k--=.2 n
= liM
[
tno ± 27n 1 —
n-4 ci
2m1 +
E
[(k + 1) —2k
k=2
+ (k — 1)]mk — 2(n + 1)mn+ 1 + nm,. + 1 + (n + Om ni_ 2 ] = 1 + lim [ — 2mn + 1 — nmn+ 1 + ( n + 1)m +2 ] n-4 cc
= 1 + Ifin [(n + 0012,1+2 — Mn + 1) — Mr + 1] n-bco
= 1 — lim [n(m n — m
+ m a ].
Since the partial sums increase, In(mn — mn + i ) + mn i is decreasing, and hence the limit exists. But co
n AI,
k=0
is an invariant subset of 2i, and p(A)> O. so by ergodicity of T we must have I
hill -'co
mr =( P
(1 Ak )= 0.
k=0
The series CC
E (m„ — m ) .,1
n=0
has kth partial sum mo — mk + i , and hence the series is convergent and has sum mo = 1. Moreover, since {my. } is a decreasing sequence, this series has positive terms. Therefore limn,. n(mn — mn + 1 ) = 0, because otherwise (since the limit exists) we could conclude that the series E (1/ n) is convergent. It follows that
SA nA d,u = 1. (3) Since the derivative transformation TA :A -414 is ergodic (Exercise 1), 1 k-i 1 il irn i E nA (T,i x) a.e. on A. f it J= 0
48
2. The fundamentals of ergodic theory
For each k let Nk(x) --- nA (x) + n A(TAx) + ... + n A(TYI - 1 x), so that
Nk(x) k
1 p(A) f A
a.e. as k --- 0 0.
n A d,u
However, Nk(x) is the number of T-steps required to produce k entries to A; equivalently, k counts the number of visits of Tx, T 2x, ... rktx)x to A:
x,Tx,T 2x, ... Tilx, ... Ti 2x, ... ... T N"4(x) ..—„.
nA (x)
4.----,
nA (TAx) ... nA(T,k4 - 1 x)
ii vNkoo- 1 ..,, .-.-Thus k — - L- 4 = 0 A- At x) for x E A, and so by ergodicity of T k a.e. ' fXAdti = PO) N k(x)
The Kakutani skyscraper decomposition of an ergodic transformation leads to a lemma on which are based many of the important constructions of ergodic theory. With a bit more work, the lemma can be shown to hold actually for all aperiodic transformations- those whose periodic points form a set of measure 0 (see Halmos 1956).
Lemma 4.7 Kakutani- Rokhlin Lemma (Kakutani 1943, Rokhlin 1948) Let T :X -- X be an ergodic m.p.t. on a nonatomic measure space (X, a, p),n a positive integer, and e > O. Then there is a measurable set A c X such that A,TA,...T" -1 A are pairwise disjoint and cover X up to a set of measure less than e. Proof: Select a measurable set B c X of small measure (exactly how small to be determined later). We use the set B to form a Kakutani skyscraper decomposition of X. That is, for each k = 1, 2, ... let Bk = (x€B:nB (x)= k),
so that X decomposes (up to a set of measure 0) into the union of disjoint columns Bk l1 TB k l1 ...l1 T B it , k = 1, 2, ... In order to form the set A, we ignore the first n — 1 columns from the left; and beginning with the nth column from the left we select the base of each column and every nth one above it, moving up the column, and stopping before we arrive at a point n levels frOm the top of the column. Analytically,
2.4. Ergodicity
49 Tk- I Bk
TB2
T2B 3 T B3
B2
B3
:
TBk
..
Bk
"
.. ..... ......■
we May write [(Ic —n-1)/n.]
U T inBk.
A -=-- U Icrl
j=0
Then clearly A. TA, ... Til— I A are pairwise disjoint and cover X except maybe for a set of measure at most co n E ,u(Bk) ‹ n,u(B). k=
1
Thus we only need initially to choose p(B) < tin. Here are some examples of ergodic transformations. (1) Bernoulli shifts are ergodic. This follows from Exercise 4(b) (p. 56), since
the condition 1n— 1 — E p(T -k A n B)-- p(A)p(B)
n k= 0
is easily verified when A and B are cylinder sets. In the next section we will see that essentially the same argument proves that in fact Bernoulli shifts are strongly mixing. (2) Irrational rotations of the circle are ergodic. Let Tx = x + a (mod 1) for xe[O, 1), where a is irrational. If f eL2(X, .4, m), then f has a Fourier
expansion CO
f(x) =
I, ae 2"
-00
in L2 . If U f =f, we find that U f (x) = foc ± a) =_-__ E ane 2.b. e brin. _ v L, a„e2Rinx, -co
-.
so that a ae 2" for all n. Since ed" # 1 unless n = 0, we must have a. = 0 for n # O. Hence f(x) = ac, in L 2. By Proposition 2.4.1, T is ergodic. Thus if f ELV, A', m), we have i n -1 — E f(x + lux) ffdm a.e. nk = 0 -,
50
2. The fundamentals of ergodic theory
H. Weyl (1916) showed that in fact if f is Riemann integrable, then this formula holds for all x. His way to see this was as follows (see also Section
4.2). Translating f if necessary, it is enough to consider the case x = O. If f is Riemann integrable, there are trigonometric polynomials ni
nz
p 1(x) = E cne 2ginx ,
P2(X) =
E
dn e2ninx
such that p 1 < f < P2 on [0, 1) and
ft 0 (p 2 – f)dm
1
J
and f (f – p i )clm 0
are both a bitrarily small. Nowr
rl E Pi(kci)--co = j Pi din,
— N k= 0
0
and similarly for p2 , because for n # 0 1 N-1 1 1 _ e2niNna 2nka in = --).- O. — L e N 1 _e2nin, N k= 0
Then 1
i N-1
— E Oka) N
k= 0
<— N
1
N-1
E k=0
N-1
f(ka) <
2(ka) N
for all N
k=0
implies that (1/N) E kirs :01 f (koc) is arbitrarily close to 101 fdm for large N. This fact has an interesting application, the solution of Gelfand's problem: fi nd the frequency of the number 7 in the sequence 1, 2, 4, 8, 1, 3, 6, ... of first digits (in decimal notation) of the numbers 2, n = 0, 1, 2, ... That is, if for each k = 0, 1, ... 9, Pk() denotes the number of ks in the fi rst n terms of the above sequence, Gelfand's problem is to evaluate, if it exists, 197 , iim P.7(n) . n-■ -)D n Let a = log 10 2 and Ik = [108 10 k, log i 0 (k + 1)) for k = 1, 2, ... 9. Then the first digit of 2i is k if and only if k- 10' .-5. 2J < (k + 1).10r for some r, i.e., if and only ifjaE ik Thus .
n-1
P 7 (n)=
E x1 7 00 i=0
2.4. Ergodicity
51
aad 1 n-1
p7 = lim - E x 17 UŒ) = m(1 7) = log 10-87. n -•co n J--.0 (3) Translations of the torus. The same way as in (2), we can determine which translations of the n-torus
for i = 1, 2, ... n}
are ergodic. K" is a compact abelian group under addition modulo 1. Fix a = (al , a2,...a.)EDV and define T: K" -- K" by Tx = x + a (mod 1) for all x€ K". Let a be the a-algebra of Borel subsets of Kt', and let p denote the product Lebesgue measure on K". Then p is just normalized Haar measure, and T is a m.p.t. (le, a, p, T) is ergodic if and only if invariant L2 functions are constant ac. Suppose then that f is in the complex I! space OK", a, p). Now f -fo T is zero a.e. if and only if its Fourier transform ( f -fo T) is zero as a function on kn = Z. . For each k E ./n,
(f - fo T) -(1c) = f e - 21".' (f(x) - f(Tx))d,u(x) Kn
= f eoo- 27ik.xf(x)dp(x) _
e - Drik.xe2nik.afoodio) kn
= (1 _ e 21f e - 2.1k.xf(x)dp(x)= 0 _ e2.ik11(k). ic-
Suppose that a is rationally independent in the sense that, for keZ", k-cieZ if and only if k = O. Iff E L2 is invariant and a is rationally independent, then the above calculation shows that J(k) = 0 for all k # O. This implies that f equals the constant 1(0) a.e. Conversely, if (K", at, p, T) is ergodic, then a must be rationally independent. For if there is a nonzero kEir such that k - a E Z, then f (x) = is a nonconstant invariant function and (K", At, p, T) is not ergodic. Thus (Ihr, a, p, T) is ergodic if and only if a is rationally independent. The system (K", a, p, T) has discrete spectrum, as does any translation on a compact abelian group. (4) An irreducible Markov shift is ergodie. Let ((-a, a, p, e) be a Markov Shift on the alphabet {1, Z ... NI determined by an N x N stochastic matrix A = (ai) with left-fixed probability row vector p (see 1.2 and 2.3). Recall that Ak = (4) gives the k-step transition probabilities: a iki = Pr {cok = flcoo = i}.
2. The fundamentals of ergodic theory
52
Assume that A is irreducible, in that for each i and j there is a k for which 4.1 > O. Let = 1, 2, ... N.
Ei = (coEfl:coo = ,
The Ergodic Theorem yields the a.e. existence of the limits 1 n— 1 liM
E w(7x)
n k=0
and hence of 1 k urn - L xE,(a. x E, (x) dp(x) pi Ln = 0 1 = lin1 E p(a - k Ei n E)= lim 4i . Pi n-boon k=0 k=0 The matrix Q = (q ii) is stochastic and satisfies 1
qi,
[
—
Q = QA = AQ,
Q2
since Q= limn , co (l/n)
.
I claim that if A is irreducible, then all the entries of Q are positive and all the rows of Q are identical, each row being equal to p. From Q = QA, we see that, for fixed i and j,
=
E qikaz,
qik aikli for each k and n.
Thus if gi = (j:q u > then if k €' and atki > O. we have jeer Moreover, ei #0. So by irreducibility gi = (1, 2, ... NI for each i, that is to say, > 0 for all i and j. To see that all the rows of Q are identical, suppose that for some j oko qiko qioko < q = Then from Q2 = Q we have
qik.
=
qijqjko < (1 E 47
for ail i, which is impossible. Now (P(2)i =EPiqii= lim n•-• op = liM
n-■ co 11
k
L(PA1 j = pi ;
53
2.4. Ergodicity
since q ii is independent of i, we have qii = pi for all i, j. To prove that a is ergodic, it is enough to show that 1
_ n
11 -
1
y ,u(a - kE n F) -• ,u(E)p(F)
k=0
for each pair of cylindrical sets E = {coeil:corcor+ 1 ...cor#1 =-- id, ... ii }
where io , ...
... Le {1, 2, ... N}. If k is large enough, then
(fr, r + 1, ... r + l} + k) n {s, s + 1, ... s ± m} = 0,
and we have ,u(a -k En F)= (pioajoi , ... aim iim )(alm-i7a1.1 , ... a„_ . „).
Since 1" - l
E di::
n k=0
-p
p.
as n-* co,
the ergodicity of a follows. According to Exercise 8, the converses of all these implications also hold. Thus for a Markov shift with all p i > 0 the following statements are equivalent: (1) a is ergodic. (2) A is irreducible. (3) qii is independent of i. (4) qii = pi for all i and j. (5) go > 0 for all i and j. (5) Ergodicity of skew products (Anzai 1951). Let T be a m.p.t. on a probability space (X, a, p), and G a compact abelian group with Haar, measure v. Let f:X--G be a measurable function, and on the product probability space (X x G, Rix 0 aG . p x y) define the skew product transformation T f by T1 (x, g) = (Tx, g -f(x)).
Recall that Tf is measurable, invertible, and measure-preserving. Theorem 4.8 Suppose (X ,a,p, T) is ergodic. Then the skew product transformation Tf :X x G ---■ X x G is not ergodic if and only if there is a nontrivial character TE 6 and a measurable map pi of X into the unit circle D.( such that 'Of (x)) . q(x)q(Tx)
for almost all
X E X.
54
2. The fundamentals of ergodic theory
Proof: Suppose there is such arEd and such a map t 1: X -p K. Define h: X x G --P K by h(x, g) = q(x)r(g), so h is clearly measurable. The function h is T1 -invariant because h(Tx, f(x)) = n(Tx)r(gf(x)) = ti(T x)x(g).r( f(x)) = ri(x)t(g) = h(x, g)
a.e.
Moreover, h cannot be constant a.e. since (r, 1) = 0 in LAG, M G , V) and hence
f XxG f
h(x, g)d,u(x)dv(g) =
f( X
f ri(x)r(g)dv(g))d,u(x) = O. G
Thus h could be constant only if h = 0 a.e., but I hi = 1. Conversely, suppose the skew product is not ergodic and let h:X x G-PC be a nonconstant invariant function in L2. For each r E 6 define OT .X -"C by
=
h(x, g)t(g) - 1 dv(g). fG
Then OJT x)-r( f (x)) = fh(Tx, g)-r(g) - 1 r(f(x))dv(g) G
= f h(x, gf (x)')r(g) - 1 r(f(x))dv(g)
=
G
h(x, g)-r(gf(x)) - 1 -4 f (x))dv(g) fG
= f h(x, g)r(g) - 1 dv(g) = C(x)
a.e.,
G
SO
14)t(TX)I =
I ri) t(x)1 a.e. Since T is ergodic, I CI must be a constant Ct a.e.
There exists a nontrivial red for which CT # O. For if not, then for almost all x the function h(x, -)E L2(6) has each of its Fourier coefficients f h(x, .)T' dv equal to zero for r # 1 and consequently h(x, g) is independent of g. Since h is invariant and T is ergodic, this would imply that h is constant. Choose a nontrivial t e d such that C 0, and let
(1) (x) n(x) - 1. , C, so ri: X -P K is measurable. Then - 1 0,(x) Cr ri(x)riax) as required.
CT (MT x) (/),(x)-r(f(x)) - 1
-
2.4. Ergodicity
55
Anzai originally considered skew products in the case that X = G = K = 1-torus. Actually, this example goes back to von Neumann, who showed that the skew product (x, y) --4 (x + a, x + y) (a irrational) on 0K 2 has the same spectral type (i.e., the induced operators in L2 are unitarily equivalent) as the cross product of the shift transformation on an infinite torus with the translation x -4 x + a of K, but these two systems are not isomorphic (see Anzai 1951). In Anzai's situation, the transformation T: 0( 2 ---P 0( 2 is given by T(x, y) ,---- (x + a, y + f(x)). where a is irrational and f: K--p K is measurable, and the condition for nonergodicity becomes the following: there is an integer p # 0 and a measurable map Iv K- K such that
Pfix) = n(x) - ri(Tx)
a.e.
Obviously the idea of a skew product generalizes further, for example to infinite products. We might consider the map T: Kœ -4 Kœ given by, say . T(x i , x2 , ...) = (x 1 + a, x i + . 2 , X2 ± X 3 , ... ). Skew products are related to cohomology and representations of groups and to the virtual groups of Mackey. They also provide a useful tool for the analysis of the structure of a given m.p.t., as in structure theorems of Furstenberg (1963) and Zimmer (1975, 1976a, b). Recall that a given system (X, At, p, T) is said to have discrete spectrum in case the eigenfunctions of the unitary operator U induced on L2 by T span 12. There are two generalizations of this concept. Let Do c L2(X, a, p) consist of the constant functions of absolute value 1, and for each i = 1, 2, ... let Di = tfeL 2(X,M, ,4:If1=1 a.e. and Uf/feDi _J. The elements of D = Ur-cl Di are called quasi-eigenfunctions of U. and T is said to have quasi-discrete spectrum in case D spans ox,a,p). Again, let Ho c ox, a, p) denote the constant functions of absolute value 1. For each ordinal i, E. will denote the closed linear span in L2(X, M, p) of Hi . Assuming that Hi and ; have been defined for all j < i, we define Hi = U Hi if i is a limit ordinal, and
j
if i is a successor ordinal. The elements of H = U • H. are called generalized eigenfunctions of U, and Tis said to have generalized discrete spectrum in case H spans L2(X, p) (Abramov 1962, Parry 1969a, Petersen 1971 et al.). These classes of transformations may be considered the next simplest, after the discrete spectrum transformations.
a,
56
2. The fundamentals of ergodic theory Exercises 1. Prove that if T is ergodic, then so are the induced transformatiors TA and t (see Section 2.3). (t is metrically indecomposable even if ii(g) . co.) 2. Prove that if Tis ergodic, f..>. 0, and in-1 11In —
E f(T kx) < co a.e.,
n- • co
fl =0 then f E Li . 3. Which of the equivalent characterizations of ergodicity fail when X has infinite measure? 4. (a) Prove that T is ergodic if and only if
-n E ,u(Tk A n B)--- ,u(A)p(B)
for all A. BEA. k=0 (b) Prove that T is ergodic if and only if (a) holds for all A, B in a setnialgebra which generates the a-algebra R. 5. Let T be ergodic and y 4 p a measure on (X, M) such that v T -1 ‹ v. Show that vT = y and y is a constant multiple of z. 6. Let X = [0, 1] with Lebesgue measure m. Then T (preserving n) is ergodic on X if and only if -
1
in-1
-n E, f(T kx)--
7.
ffdm a.e. k .0 for each continuous function f. (Note: It is not true that ergodicity is characterized by the absene of continuous invariant functions.) Let U:V(X, A p)--+ L 2(X, al, p) be the unitary operator associaed with an ergodic m.p.t. on a nonatomic probability spate (X, A', p). Then every point of the unit circle is an approximae eigenvalue of U; i.e., given A with I AI = 1 there are fn e L 2 wih I fn 2= 1 for all n and 11 Uf — 24,11 -- O. Consequently tie spectrum of U is the entire unit circle. Suppose that ( 2, m, p, a) is a Markov shift determined by a give stochastic matrix A and fixed probability vector p with dl pi > 0. Prove that if 42, gi, p, a) is ergodic, then A is irreducib:. Prove that for any ergodic m.p.t. on a nonatomic space there if.a set A of positive measure for which the return time n A iS U1bounded. Prove that if T has discrete spectrum, then there is a sequencof
I
8.
9.
10.
57
2.5. Strong mixing
integers nk co with T"k I in the strong operator topology on Tnk f -f112 -0) for all f 12,
2.5. Strong mixing While every m.p.t. on a space of finite measure is recurrent, only certain ones, namely those that move almost all points throughout the space, are ergodic. The concept of ergodicity can be strengthened in several ways to define classes of transformations which satisfy even more stringent quantitative recurrence conditions. Recall that a m.p.t. T: X -4 X is ergodic if and only if I" (1)
-
nk
y ,u(T
p(A)p(B)
kA n
for all A, Best
=
We say that T is weakly mixing if 1 n— 1 pp(T-kAnB) - ,u(A),u(B)I -4 0 for all A, Be 91, (2) nk= 0
y
and strongly mixing if . ( 3) I P(T -k A r) B) - (A)i(B)t -4 0
for all A, Bea.
Thus T is strongly mixing if and only if ,u(T k A n B) ,u(T -k A n B) ti(B)
,u(A)
for all A, BE a with ,u(B) > O.
This last condition says that eventually T distributes A fairly evenly throughout the space X: for large k, the proportion of T ' A that lies in B, namely p(T k A n B)/4B), is approximately the same as the relative size of A in X, namely ,u(A). The following observations are important even though they are evident. Proposition 5.1. Strong mixing implies weak mixing and weak mixing implies ergodicity. Proposition 5.2. T is strongly mixing if and only if
(Unf, g)
f, 1)(g, 1)
for all f, g E
Thus T is strongly mixing if and only if Unf - Jfdp weakly in L2(X , 1.2) for each f eva, p). Too bad about that.
2. The fundamentals of ergodic theory
58
Proposition 5.3 T is strongly (respectively weakly) mixing if and only if (3) (respectively (2)) holds for all A, B in a semialgebra which generates a, or for all A. B in a set dense in 3. Proposition 5.4 Ergodicity, weak mixing, and strong mixing are isomorphism invariants of T. (Actually they are spectral invariants.) Theorem 5.5 (Rényi 1958) T is strongly mixing if and only if for
each A € lim p(T ' A n A) = 11
-• co
Proof: We prove that if limr „ p(T A n A) = p(A) 2 for all AEA then (X. Pi p, T) is strongly mixing; the converse is obvious. Fix AEA' and ,
let M be the closed linear subspace of L2(X, Pi, ,u) generated by the constant functions together with {U kxA :kEZ}. Since
lim (UnxA , 1) = lim p(A)= (x A , 1)(1, 1) and n
Il -6 OD
cc
lim (UnzA , UkxA ) = lim (Ur k xA , xA) = lim p(T - "" A n A) co
n co
= P(A) 2 = (xA 1)(Uk xA , 1) ,
,
we have lim(Ux A , f)= (x A , 1)( f , 1) n
for all f E M.
Co
Given f EL2 (x, Pi p), write f=f i ±f2 , where f l EM and f2 EMI . Then ,
lim (UnxA ,f)= lim (UnxA, f1) lim (Unx A , f2 ) n co
11 -4
= (xA , 1)(f, ,1) = (x A , 1 )(i, 1 ), since (f2 , 1) -- 0. Thus in particular, for BE 3 and f = lim ,4T _"A ri B) = lim (Un x A , xa) =-- (x A , 1)(xi3 , 1) = therefore (X,
a, p, T)
is strongly mixing.
Here are some examples of strongly mixing transformations. (1) Bernoulli shtfts are strongly mixing. This is true even for shifts based on infinite alphabets. Let CO
p) = n (X, a?, P), —
co
where (X a, P) is a probability space, and let cr:11 -4 LI be the shift. It is clear that if A, Be, are cylindrical sets (i.e., of the form lcoESI:coii E Erl, where E 1 , ... Ee a), then ,
p(cr - "A n
p(A)p(B),
59
2.5. Strong mixing
since if n is large enough the sets of indices determining cr'A and B do ' not overlap. By Proposition 5.3, a is strongly mixing. (2) Mixing for Markov shifts. An N x N stochastic matrix A is called aperiodic in case there do not exist an i = 1, 2,...,N and an integer m> 1 such that eti > 0 implies m divides k. Theorem 5.6 Let (0, ", p, o-) be the Markov shift determined by
an N x N stochastic matrix A which fixes a positive probability vector p (see Sections 1.2.B and 2.4). The following statements are equivalent: (1) (0., .F, p, cr) is strongly mixing; (2) limk _, dici ---- pi for all i and j; (3) A is irreducible and aperiodic. Proof: (1). (2): di`i = Pr {cok = jl coo = il .
p(T -k {coo = j} n {coo .--- i} ) -* P{coo= .i} = Pi. p{co o = il
(2) (3): This is clear, since all pi are positive. (3) .(1): If A is aperiodic and irreducible, then on is ergodic for each n, and since (1/n)Erk1 :1aiici -- pi > 0, we must have lim supk _. oe atj >0 for all i,j. Now if, for example, E = (wen: coo co i ...co, . io i i ...ir )
and F = {coen: wow ' .• • cos =id ' •-•./s } , then for large enough k, ME r) T -k n = (Pioaicii..- air_,i)(aorajoh. -- ais-lis) al!'
= 14E)ti(F)
Pio
and lim sup ,u(T -k En F) ‹ c,u(E)/2(F), where akc = sup lim sup--u. i,j
k-b ,x2
pj
By Ornstein's characterization (see Exercise 2.6.6), cr is strongly mixing.
Friedman and Ornstein (1970) proved that in fact every strongly mixing Markov shift is Bernoulli. This means that there is another measurement
60
2. The fundamentals of ergodic theory
to make on the experiment, the records of whose outcomes will be indistinguishable from the histories produced by a certain Bernoulli shift: There is a finite measurable independent partition (A 1 , A 2 ,...,An } of SI {1, 2, ...n} by (4)(0); = i which generates .F, so that the coding n ±, if and only if 4 toe A i gives an isomorphism of the Markov shift with the Bernoulli scheme on n symbols with weights p(A 1 ). ,u(A (3) Automorphisms of compact abelian groups (Halmos 1943). Let X be a compact abelian group, .q the Borel subsets of X, p normalized Haar measure on X, and T: X --■ X a continuous automorphism. Then T is a m.p.t. For, define a measure y on X by y(A) = p(T A) for each A E ; then for all A E a and all xe X, y(xA) = p[T -1 (xA)] = Apr - x) A)] = p(T A) = y(A), so because of the uniqueness of Haar measure y is a constant multiple of p. But y(X) = p(T' X) = so y = p. Again we wish to find conditions for (X a, p, T) to be ergodic. The character group k of X forms a complete orthonormal set in p), and the unitary operator U induced on /2 by T maps fe /2(X, into itself.
rto,,,
,
Theorem 5.7 If (X, M, p, T) is ergodic, then the only finite orbit
of U on k is that of the trivial character. Conversely, if U on k has no finite orbits other than that of the trivial character, then (X, a, p, T) is strongly mixing and hence ergodic. Proof: Suppose e k is a nontrivial character with a finite orbit under U. Then Let n be the smallest positive integer such that U% = is an invariant function. Since 1, 1,1/ = c + are distinct elements of k they are linearly independent, and therefore tfr is not constant. Consequently (X. a, p, T) is not ergodic. Conversely, suppose now that no element of k other than 1 has a finite orbit under U. Let f,geg and suppose at least one off g is not 1. Then Unf# g for all large n, and consequently lim (Unf, g) --= 0 = (f, 1)(g, 1). In case f = g = 1, the same formula still holds. Iff, geL 2 are arbitrary, the fact that (Uhf, g) = (f, 1)(g, 1) follows from approximation off and g by linear combinations of elements of k (see Proposition 1.4.2). We consider now the special case where X is the n-torus 11,5" = Rig". It is known that a continuous automorphism T: IK" LK" is given by an n x n matrix with integer entries and determinant + 1. We claim that T on IFS" is ergodic if and only if the matrix A representing T has no roots of unity among its eigenvalues.
61
2.5. Strong mixing
According to this Theorem, T on 11(" is ergodic if and only if U on Csn= in has no finite orbits other than that of the trivial character. Welk' is nontrivial, there is a nonzero ker such that f(x) = e2nik'' for all x E 11(n.
Then UPf(x) = e 2xik • 7t = e2rlk AP = e 2nik(Afr)v.x .
so if UPf =f, then k(AT = k and AP has 1 among its eigenvalues. Then we have APv = y for some v Fin, and hence
0 = (AP — 1)v = (A —
I)[(A —
(A — E,1)1)1,
where t ,...tp are the pth roots of unity. Thus either (A — p I)v is an eigenvector of A with eigenvalue t i , or else it is zero. It is clear that we may continue this process to find that at least one is an eigenvalue of A. Thus if U on kit has a finite orbit, then A has a root of unity among its eigenvalues. Conversely, suppose A has a root of unity among its eigenvalues. Then there will be kEZ" and pE Z + such that 14AgrY = k. It is clear that thenfE defined by f(x) = e2nik'x will have a finite orbit under U. Katznelson (1971) proved that any ergodic automorphism of Oe is isomorphic to a Bernoulli scheme. This was extended to compact abelian groups by Lind (1977) and Miles and Thomas (1978), and to certain ergodic automorphisrris of nilmanifolds by Dani (1976). There are some non-Bernoulli strongly mixing transformations, for example those with entropy 0 (see Chapter 5). We will mention now two other properties that lie between strong mixing and being Bernoulli. Let N be a finite or infinite cardinal number. We say that a m.p.t. T has Lebesgue spectrum of multiplicity N in case there is a set A of cardinality N and a set of functions
{fa.i : AEA, jeZ} which, together with 1, form an orthonormal basis for 1 2 (X, p), and such that UT f
=f1 for all 2 E A, iE Z.
It can be proved that T has Lebesgue spectrum if and only if its maximal spectral type is absolutely continuous with respect to Lebesgue measure on the unit circle (hence the name).
2. The fundamentals of ergodic theory
62
Example 5.8 Bernoulli schemes have countable Lebesgue spectrim 1), the shift on fr œ (0,11, The idea will be clear from considering where 0 and 1 each have weight 1. Let r(co) = ( — 1)w^. The finite products of the T n, together with the constant function 1, form an orthonormal basis for L2. Partition this basis into equivalence classes by saying that f ,-- g iffa" = g for some nel. There will be countably many equivalence classes, so a has countable Lebesgue spectrum.
ma,
Proposition 5.9 A m.p.t. which has Lebesgue spectrum is strongly
mixing. Proof: The relation (1)
(Unf, 9)-4 (f, 1)(1, g)
clearly holds if eitherfor g is 1. For any other elements of the distinguished orthonormal basis, clearly (fA,j+n,f1',P) = °
for all large enough n. Thus (1) holds for all basis vectors, and hence for all fElf We say that a m.p.t. T on (X, M, p) is a K-automorphism Kolmogorov) if there is a sub-a-algebra .4 c M such that
(for
(i) T -l af c si, cc (ii) U Td generates 61 , n = — 00
0
(iii) n T d is trivial. PI = — 00
Proposition 5.10 Bernoulli shifts are K-automorphisms. Proof: If M(p l , ... pN) is the shift on the measure space (0, .F, p), where (2 = {1, 2,...,N} z and p is the product measure determined by the weights pN , let .521 be the a-algebra generated by all cylinder sets of the form
{we LI : coi =j}, where j = 1, 2,...N and i > 0. Then clearly a' d c a and U' OE, esi generates M. Now if A E a-nsi, then A is in the a-algebra generated by cylinder sets determined by coordinates at least n, so if B is in the a-algebra generated by cylinder sets determined by coordinates less than n we will have p(A n B) = p(A)p(B). Hence if A c R,"_ 0 a ' at , A will be independent of every cylinder set B. This implies that p(A) --= p(A) 2 , and (iii) follows.
2.5. Strong mixing
63
Proposition 5.11 Every K-automorphism has countable Lebesgue
spectrum. Proof: Let .4 be the distinguished sub-a-algebra of and let M denote the closed linear span in L2 of the characteristic functions of all the sets in d. Then we will have 00
unm
constants = n
u2 m
um m u-im ...c
0
C
URM L2-
n = — 09
Choose an orthonormal basis fej for the orthogonal complement of UM in M. For each i, let
Mi = c.l.s. {Unei : riEZ}. Then UM i = Mi for all i, and
EGMi = (constants)'. If we let fij = (Pei , we will obtain the functions required by the definition of Lebesgue spectrum. Exercise 1 shows that dim (M e UM) = cc, so the transformation has countable Lebesgue spectrum. It can be proved that T is a K-automorphism if and only if every nontrivial factor of T has positive entropy (see Chapter 5 for the definition of entropy). Ornstein constructed K-automorphisms which are not Bernoulli (i.e. not isomorphic to any Bernoulli shift). On the other hand, there are m.p.t.s with Lebesgue spectrum and zero entropy, for example certain Gaussian systems (Girsanov 1958) and horocycle flows (Parasjuk 1953 and Gurevich 1961). (See also Rokhlin 1960 and Newton and Parry 1966.) Finally, we cannot end this section without mentioning Rokhlin's old, still-unsolved problem involving higher degrees of mixing. A m.p.t. T is said to be n-mixing if for any choice of measurable sets A 1 , A 2 , ... An , lim
AP"' A i n. .n T". An) = p(A 1 ) ... AA).
in ftm — ml — co
Thus 2-mixing coincides with strong mixing. It is still not known whether there are any 2-mixing transformations that are not 3-mixing. Exercises
1. Complete the proof of Proposition • 2.5.11 by showing that dim (M e UM)= co. (Hint: Choose a nonzero f EM e) UM. Note that d must be nonatomic, choose disjoint d-measurable
64
2. The fundamentals of ergodic theory subsets E 1 ,E2 ,... of the support off ; and consider the functions fXE i .) 2. Prove Proposition 2.5.2. 3. Prove Proposition 2.5.3. 4. Prove that a weakly mixing Markov shift is strongly mixing. 5. Prove that T is weakly mixing if and only if n-1
p(T -1€ A n A) — p(A)2 1= 0
liM n-boo n k=0
for each A E gi. 6. Prove that Bernoulli shifts, mixing Markov shifts, and ergodic automorphisms of compact abelian groups are n-mixing for all n. 7. (Ambrose, Halmos, Kakutani-see Halmos I949a.) Show that there is no concept of 'uniform mixing' for m.p.t.s: If
p(T - " A n B)
p(A)p(B)
uniformly for all A, BEM with A c B, then every set in At has measure 0 or 1 and so (X, At, p) is isomorphic with the space consisting of a single point. (Hint: It is easy if we remove the phrase 'with A c B' above. But the weaker hypothesis implies the stronger: make n B) n B) — p(A n B)p(B) I
and I /4( T - "(A n Er) n 13`) — p(A n MOB') I small simultaneously.)
2.6. Weak mixing Recall that a m.p.t. T: X X on a probability space (X, 01, p) is said to be weakly mixing in case for every pair of measurable sets A and B, n-1
urn n-bat)
n
E
p(T"AriB)— p(A)'4B) = O.
k =0
That the concept of weak mixing is natural and important can be seen from the following theorem, according to which a transformation is weakly mixing if and only if its only measurable eigenfunctions are the constants. Thus weakly mixing transformations lie at the other extreme from those with discrete spectrum, i.e., the group rotations. Most of this theorem seems to go back to Koopman and von Neumann (1932).
2.6. Weak mixing
65
Theorem 6.1 Let T: X X be a m.p.t. on a probability space (X, 6e, 14. Then the following are equivalent: (1) T is weakly mixing. n- 1
(2) firn n-■ op n
E
(UT' f, g) (f, 1)(g, 1)1 = 0 for all f, g LAX, .4, ply
k=1)
(3) Given A., BEM, there is a set J c 1 + of density 0 such that
lirn
1.1(T" A n B) = p(A) p(B).
co,n#.1
(4) (5) (6) (7)
T T T T
x T is weakly mixing. x S is ergodic on X x Y for each ergodic (Y, y, S). x T is ergodic. has no measurable eigenfunctions other than the constants.
We will prove this Theorem presently. The implications (1)-4*.(2) and (5) (6) are clear. The argument for (1).*>(3) consists of a real-variables analysis of the type of convergence of sequences involved in the definition of weak mixing and is based on a lemma of Koopman and von Neumann. The proof that (3) (4) turns just on the observation that the union of two sets of density 0 has density O. The arguments for (4) (5), (6) (7), and (6) (3) (and hence (6) (1)) will be found to be straightforward and easy. The major difficulty of the proof lies in the implication (7) =-(6). We will first give the usual proof, which makes use of the Spectral Theorem. This will be followed in Section 4.1 by a second, more constructive proof, which does not need the Spectral Theorem. Notice that (7) implies that T is ergodic; a characterization of weak mixing in terms of eigenvalues, however, would have to mention ergodicity explicity: T is weakly mixing if and only if T is ergodic and has no eigenvalues other than 1. Let us proceed towards the proof of the Theorem. Recall that a subset E NI of the positive integers is said to have density zero in case
1 n-1 n k=0 rs-• co urn -
E xE (k) = 0 .
Lemma 6.2 (Koopman-von Neumann 1932) Let f : be nonnegative and bounded. A necessary and sufficient condition that n- 1
lim
E f(k)= 0
n-boo k=0
is that there exist a subset E
lim f(n). O. nitE
fkl of density zero such that
66
2. The fundamentals of ergodic theory
Proof: Suppose first that there is such a set E. We may write 11f_1 1 1 - E f(k) = E f(k) + E f (k). n nk0 n k4n-1,k(E k4n — 1, keE
The first term is arbitrarily small for large n. since E has density 0 and f is bounded. The second term is arbitrarily small for large n, since f(k)x Ec(k) - ■ 0 and ordinary convergence implies Cesaro convergence. Conversely, suppose that
E f(k) = 0.
11111 —
n
co n k .= 0
For each m = 1, 2, ... let keN1 :f (k) >
E.
1
mJ
Then E l c E 2 , and each E. has density zero, since (1/m)xE., < f Therefore, for each m = 1, 2,... we may choose im >0 such that j 1 < 1, <
and
E xE — n
,n
(k)<
1 — for n
_ 1 (m = 2. 3, ... ).
112
k=0 Now let io = 0 and define
E= U En, n (im _ i„, ); m= 1
we will show that E has density zero and
lim f(n)= 0. n-, $E
Let us consider f(k) for ktiE. In the interval (0, i l ] we have removed those ks for which f(k) > 1; in (i 1 , i2 ] we have removed those ks for which have removed those ks for whichf (k) > 1/m. f (k) > ; and in (i._ 1Ç] Thus clearly
lim f(n)
O.
n-+ co, na
However, we have only removed a set of ks of density zero. For if then 1 n
1 n-
—E
nk=0
1 6-1- 1 xE(k)=
1 n
E
xE (k) + n k =0 1
in,- 1—
I
k=0
E
X E (k) 1 11— 1
i
•
-1
(k) + -n E
k=0
XE„,
2.6. Weak mixing
67
1 i,n-i-1
im- 1 k=0
<
1R - 1
-1
E XE..(k)
(k) + -n
k=0
1 1 +—. m—1m
Proof of the Theorem. (1). (2): This is clearly true whenf and g are characteristic functions of measurable sets. The general statement follows by forming linear combinations and approximating. (2) (1): Trivial. (1)«(3): This follows directly from the Lemma, taking f(n) = Ip(T"A n B) — p(A)p(B)I. . (3) (4): Let A, B, C, Dew. By (3), we may choose sets Ji , J2 c N, each of density zero, such that lim n
MCI
'
!pa' A n C) - ,u(A)p(C) i = 0, 1
liM 17-• COMM 2
Ip(T"B n D) - p(B)p(D)I = 0.
Let J = J 1 l)J 2 . Then J has density zero, and lim Iii x p(T x T)" ((A x B) n (C x D))
n-+ x
.4.1
-p x 14,4 x B)p x p(C x D)! -....- lim Ip(T" A n C)p(TnB n D) - p(A)p(B)p(C)p(D)I n- • ao ,nit.1 ‘. linl
[p(T"A n C)I p(T"B n D) - p(B)p(D)
I
n-4x),nt-J
+ p(B)p(D)Ip(T"A n C) - p(A)p(C)I] = 0.
The result then follows from the known equivalence (3)«(1) applied to T x T. (4) (5): If T x T is weakly mixing, then so is T itself. Let ergodic (Y, qr, v, S) be given. In order to show that T x S is ergodic on X x Y, it is enough to show that if A, BE and C, D E, then ln- 1
- Epxv[(TxS)&(AxC)n(BxD)] -. p(A)p(B)v(C)v(D). nk=0 However, the left-hand side is
-1 Pr-E1 p(TkA r) B)v(S k C n D) il k = 0 I Pi - I = - E {p(A)p(B)v(S kC n D) n k=0 ± [ti(T* A n B) - p(A)p(B)]v(S k C n D)}.
68
2. The fundamentals of ergodic theory
By ergodicity of S, the first term tends to p(A)p(B)v(C)v(D). The second term is dominated by
y lio-kA
-
n
n B) - p(A)p(B)I,
k=0
which tends to 0 as n —■ 00 because T is weakly mixing. (5) (6): T must itself be ergodic, if it satisfies (5), since T x {1} ( {1} = the identity transformation on a single point) is ergodic. Therefore, under (5), T x T is ergodic. (6) (3): If A, Bey, then -
in -1 L ki(rA n B) - p(A)p(B)J 2
n
k=0 1n-1 = — EgTkAn B)2
n k= 0
E
- 2,4A)p(B)p(T kA n B) + [p(A)p(B)] 2 n k=0
l n—I
_-,- - Epxp [(T x T)k(A x A)n (B x B)] - 2p(A)p(B)nk=0 in - 1 -Ep.xp[(TxT) k(AxX)n(BxX)] + [p(A)p(B)j 2 . n k=0 Since T x T is ergodic, as n —, 00 this tends to
p x p(A x A)it x pt(B x B) - 2p(A)p(B)p x p(A x X)p x p(B x X) + [p(A)p(B)] 2 2p(B) 2 - 2p(A) 2 p(B) 2 + p(A) 2 p(B) 2 = O. =1(A) By the Lemma, there is a set J of density zero such that lim 1,u(TnA nB)- p(A)p(B)I 2 = O. n--• co.tntJ
Then (3) is immediate. (6) (7): Suppose f EL2(X) is an eigenfunction, so Tf= 2f for some AEC with 121 ---- 1. For (x, y)e X x X, let g(x, y) = f(x)f(y). Then
(T x T)g(x, y) = g(Tx, Ty) = f (T x) f (T y) = .14(x, y)= g(x, y) a.e., and thus g is an invariant function. Assuming that T x T is ergodic, g, and hence f, must be constant a.e. (7) (1): We use the Spectral Theorem. Let V denote the closed linear span in L2(X) of the eigenfunctions of T. We will show first that if f E 1/1 and ge L2(X), then i n— 1
iim -
n-boorl
k=0
69
2.6. Weak mixing
Fix f E V1 and geL2(X), and let p be the complex measure on the spectrum a(UT ) of UT defined by p(A) = (E(A)f, g) for all Borel sets A c c(U T ) (see p. 19). Note that if 20 E E.S, then U TE{20}f =A{10 X dRAW = 20 1 mu 7-)
so E{11.0} f is an eigenfunction of
UT.
T)
410) dE(1)f = A 0 E{A 0 }
But since fE VI,
0 = (E{2 0 ) f,f) = (E{/1 0 } 2 f, f) = (E{11 0 } f, E{). 0 } f),
so 41.0 ) f O. Consequently p{.10 } 0 for each ilo e NDW . i nv, -1
L I(UTY, 01 2 ="
1 Fr- 1
E f
n k =0
V
2
1 R- 1
dp(2) 1 = - E = L n k = 0 a(t' T ) n k= 0 1 R
in
- k=E
0
2k
(42(.1)
f
ckdri(o)
C M' T )
e'
—
n
f,
2k
Ak dp(A)dii(C) (Au OxaCC
1 n--- 1
. f_ E a
kck) citiodgc)
n k= 0
a(L'Oxcra 7 T )
dp(A)dri(C).
f
= aWoxa(CT)
n 1 — g
g=
0 if and only if A = C. But the diagonal (This is permissible since 1 A of a(t./ 7,) x cr(U T ) has measure zero by Tonnelli's Theorem, since p assigns measure zero to individual points: ske
f0( Now 1(1/n)(1 Thecrem
,i(uT) ti{Y} dfi ty ) =
(2-cr)/ o -
in- 1
ihn
Xe(x, Y) 0111(x))dri(Y)
d(1-4 x = f awr)
E Kurkf,
n k=0
0 a.e., so by the Bounded Convergence
= o.
70
2.
The fundamentals of ergodic theory
From Lemma 6.2,
E i(u,kf, g)1 = 0
liM
for f E V I and geL2(X).
n " n k=0
Now let f, ge LAX) be arbitrary. Then, assuming that the only eigenfunctions of T are the constants, f (f, 1)e VI. Therefore, 0= lim n-"C
E
(f, 1), g)I
nk= 0 in-1
E
liM — n-• co n k = 0
KLITk f, g) ( f, 1)(g,
1)1,
so T is weakly mixing.
Remark 6.3. In statement (3) of Theorem 2.6.1, it is in fact possible to select a single set J c Z + of density 0 such that lirn Ip( r A n B)
-
p(A)p(B)1 = 0 for all A, BE a.
This has been noted by S. Kakutani and by L. K. Jones (1971). We select a set J (as in (3)) corresponding to each pair A i , Ai in a countable dense set in M. Renumber these as J 1 , J 2 , . Let fen } be a sequence decreasing to 0. Choose n 1 so that n-- 1
- E xj,00
if n n i .
E,
nk= 0
Choose n2 > n i so that
xj ,(k) < -2te2 nk = 0
n k =0
x j2 (k) <
2 if n n2 .
Continue in this manner, choosing n> nr _ i so that n-1
E x,i(k) <
for i = 1,
nk = 0
r if n
nr .
Define
J=
Û [J n(ni , cc)].
Then J has density 0, since if n, n
1%1,1
-n > x(k)
n-1
lir
+,
we have
r
EE
E r,
n k=0 i=1 which tends to 0 as r CO. However, since J contains a tail of each k=0
Jr,
2.6. Weak mixing
71
we have
lim a = lim a
n -4 CO. nOJ
each r,
n-+ oo.n0L-
and hence
lim ipt(Tn A i n A i ) - p(A 1 )pt(A)1 0 rt
, nit./
for each pair A i , A i in the countable dense set in M. Then given A, BE and &> 0, if we choose A i , A i with p(A i A) < E and p(A i AB) < e, we will have
lim ipt(Tn A n B) - p(A)14(B)1 n-■ ?area
"‘. linl 1114T n A n-• OD , /240
n B) - p(T" A i n Ai) I
+ 11.4(Tn A i n Ai) - p(A 1)p(A i)1 + I p(A i)1.4(A i) - p4A)p(B)1} < (e.g.. the third term is no greater than ip(A i)!4Ai) - p(A 1)p(B)1 + IAA i )p(B) - tc(A)p(B)I < 2c). Since g > 0 was arbitrary,
lim 11.1(T" A
B) - p(A)p(B)I = 0 forait A. BEM.
n-4 ao ,n0J
It is not easy to give examples of m.p.t.s which are weakly mixing but not strongly mixing - see Section 4.5. But there is a sense in which almost every m.p.t. is weakly mixing but not strong mixing. Because of the isomorphism theorem and von Neumann's theorem, every m.p.t. on a Lebesgue space is isomorphic to a m.p.t. on the ordinary measure space of the unit interval, [0, 1). We will regard two m.p.t.s on [0, 1) as equivalent in case they differ only on a set of measure O. The resulting set G of equivalence classes is the group of all automorphisms of [0, 1). G is a complete metric topological group with respect to each of the following two topologies: the weak topology, in which Tn -- T if and only if TA TA (in the sense that p(TAA TA) -■ 0) for all A E; and the strong topology, determined by either of the equivalent metrics d i (S, T) = p{xEX:Sx # Tx} or d2(S, T) = sup {1.4(S A A T A): A EM}. (The weak topology is the one induced in G by both the strong and weak topologies for operators on L2 , which coincide for unitary operators.) Halmos (1944) proved that with respect to the weak topology, the set of weakly mixing m.p.t.s is residual (i.e. the complement of a first category
72
2. The fundamentals of ergodic theory
set); while Rokhlin (1948) showed that with respect to the weak topology the set of all strongly mixing transformations is of the first category. Thus in this particular sense, the 'generic' m.p.t. is weakly mixing but not strongly mixing. The details of the proof, which involves approximation of arbitrary m.p.t.s by periodic m.p.t.s, can be found in Halmos (1956). Katok and Stepin (1967) investigated the possible speeds of such approximations, analogous to the speeds of approximation of irrational numbers by rationals. This refined theory has many applications to the 'study of spectra, isomorphism, entropy, and genericity of m.p.t.s and is useful for the construction of examples. There is another sense in which weak mixing is generic. Historically, the first genericity result was the theorem of Oxtoby and Ulam (1941). which stated that for a finite-dimensional compact manifold with a nonatomic measure which is positive on open sets the set of ergodic measure-preserving homeomorphisms is generic in the strong topology. (Note that in G. with respect to the strong topology the set of all ergodic m.p.t.s is nowhere dense!) Their purpose was to prove the existence of ergodic m.p.t.s on manifolds; cf. the realization problem discussed in 4.4. Katok and Stepin (1970) showed that in fact the weakly mixing measure-preserving homeomorphisms of a compact manifold are generic. Recently Alpern (1978) has shown how to obtain these results and the Halmos-Rokhlin theorems simultaneously. See also Oxtoby (1973). White (1974), Prasad (1979), Anosov and Katok (1970) and Fathi and Herman (1977) for recent work on this circle of questions. Exercises 1. Can a weakly mixing transformation have nonmeasurable (hence
nonconstant) eigenfunctions? 2. Prove that if T is weakly mixing, then so are T" and . 1 -f" for any n = 1, 2, ... (Here .fF 1 means any m.p.t. S for which 5' = T.) 3. Prove that there is a universal system (Y, y, S)(( Y, 9f, y) is a probability space, S: Y Y a m.p.t.) such that a m.p.t. T: X -> X on a probability space (X, q, p) is weakly mixing if and only if T x S is ergodic. 4. There are examples of weakly mixing m.p.t.s that are not strongly mixing (see 4.5). For now, consider some easier counterexamples. (a) Find an example of a sequence {an } for which
1 n— 1 lim- E lak I = 0 n-b 11 Go
k= 0
73
2.6. Weak mixing
but lim an # O. II -6 00
} of measurable sets, each having (b) A sequence {A1, 2 measure a, is called strongly mixing if
for all Beg,
lim p(A n n B) = ap(B)
n-•co
and it is called weakly mixing if 1 n-1
lim
E
-
n B) — ap(B)I = O.
Give an example of a sequence which is weakly mixing but not strongly mixing. as above is called mixing of order k (c) The sequence { A 1 , A 2 (k = 1, 2, ... ) if .,
lim infet, -• x
- ni --• x
p(A n A n n n1
n2
A nk
n B) ak p(B) for all BEG.
Give an example of a sequence that is mixing of order 1 but not of order 2. 5. (England and Martin 1968). Show that T is weakly mixing if and only if for each pair of sets A, BEM with positive measure, there is a set J c NI of density 0 such that n B)> 0
for all n0 J.
Can such a set J be found that works simultaneously for all A, BEN?
6. (Ornstein 1972). If T is ergodic for all n, and if there is c such that Jim supn, p(TnA n B) cp(A)p(B) for all A. Bed, then T is strongly mixing. (Hint: First prove that T is weakly mixing. Then let m be a cluster point of the measures v. on X x X defined by
f
f(x, y)dvn = ff(x, Tnx)dp
Show that m = p x p.) 7. Find a metric for the weak topology on G. 8. Which of the following classes of m.p.ts are closed under the formation of Cartesian products (and not just Cartesian squares): (a) ergodic; (b) weakly mixing; (c) strongly mixing?
3 More about almost everywhere convergence
Many of the fundamental convergence theorems of ergodic theory, analysis. and probability can be proved by the technique of maximal inequalities and Banach's Principle. We give proofs of this kind for the Ergodic Theorem. Local Ergodic Theorem (via the Lebesgue Differentiation Theorem), and existence of the ergodic Hilbert transform. For novelty. the Martingale Convergence Theorem and ChaconOrnstein Theorem are proved without using maximal inequalities. We begin with a careful study of the ergodic maximal function, and find that for one-parameter ergodic flows the maximal inequality is actually an equality. We show that the Ergodic Theorem cannot be improved, in that no statement is possible about the speed with which the convergence of the ergodic averages takes place. 3.1. More about the Maximal Ergodk Theorem
In this section we undertake a deeper study of the ergodic maximal functions
1 f*(x)= sup n?:
and
i n k =0
f*(x)= sup!-
f(T5)
11' f(T x)ds
(for a single m.o. T)
.
t> 0 t o
s
(for a flow { T,} ),
including the following topics: (A) Hopf's extension of the maximal inequality to the case of a positive contraction T on I"(X).
(B) Proof that the maximal inequality is actually an equality for ergodic flows. (C) The theory of sign changes of t
Ft(x)= f f(Tsx)ds 0
that follows from (13).
n-1
and
Stif(x)=
E f(rx)
k=0
3.1. More about the maximal ergodic theorem
75
(D) A characterization of when the maximal function f* of an 12 function is itself integrable: Wiener's Dominated Ergodic Theorem together with the converse that follows from (B). A. Positive contractions. Suppose that T:L i (X)--, L(X) is positive contraction. This means that if f , then f 0 a.e. implies Tt 0 a.e.. and I} 4. 1, i.e. 11 Tg lid for all gEL1 . Ergodic theorems can be proved for certain such operators T also, whether or not they arise from m.p.ts on X (see Section 3.8). Usually the essential first step is the proof of the corresponding maximal inequality. Theorem 1.1 Maximal Ergodic Theorem for Operators 1954) If T is a positive contraction on L i (X) and f E Li , then
f dp
O.
( f* > 0) rf(x), as might be guessed.) (Here f*(x) = sup„,(1/n) Proof (Garsia 1965): For each n = 1, 2,... let J-1 Tkf. = sup pc -o
E
Then
f=11 =12 and
un ›
{ f* > I
Also,
L f+Tf:
for all n
;
for clearly
f and for! <j‘,n
E kr-- 0
Therefore
i-2
Tkf= f+ T(T
E
k=0
. .f+ Tfi _ i kf 4
f+Tfn ‘f+
(HoPf
76
3. More about almost everywhere convergence fdpi _.-- f Tf:- dp f.dp - f { {fn > o} f.> 0} fun>0)
= ff.+ ail
—f
{In >0)
Tfit+ dp .?--. $f
- f Tfit+ dp ?.- 0,
since il Tli‘.. 1 implies f Tgdp -.-ç fgdy if 0 -‘,. geLl . The conclusion follows from the Monotone Convergence Theorem, letting n -. oo . In 3.8 we will examine the relationship of this maximal inequality with the filling scheme and will obtain a proof of the Chacon-Ornstein Theorem that actually avoids the maximal inequality.
B. The maximal equality Let us consider now a one-parameter flow { T, : - co
and
1 1 sre f*(x)= sup - F,(x) = sup- f(Tsx)ds. t>0 t i> 0 t o Recall the Maximal Ergodic Theorem. Theorem 1.2 Maximal Ergodic Theorem (Wiener 1939, Yosida and Kakutani 1939) Ufa! and ace R, then
f dp _.-- ap { f* > a } .
f f* >a) (
Actually this inequality is often an equality. Theorem 1.3 Maximal Ergodic Equality (Marcus and Petersen 1979; see also Engel and Kakutani 1981). If {Tel is ergodic, in that every measurable subset A of X which is invariant under the flow (7; A = A for te R) has measure 0 or 1, if fe LI (X), and if a _..- S f dp, then I
ir >co (If a < ifdp, then p{f* > al = 1.)
3.1. More about the maximal ergodic theorem
77
We will prove these results simultaneously, using Hartman's approach (1947), which is based on the following simple lemma. Lemma 1.4 Rising Sun Lemma (F. Riesz 1931, 1932) Let h be a
real-valued continuous function on an interval [a, b] c R and let S---- {tE(a, b): there is t` > t with h(e)> h(t)}. (If the graph of h represented a mountain range, S would be the set of points that were in the shade as the sun rose at the positive end of the x axis.) Then (i) S is open; (ii) if S = U(ak ,bk) is the decomposition of S as the union of pairwise disjoint open intervals, then h(ak) ‘. h(b k) for all k; and (iii) equality holds in (ii) except possibly when ak = a.
a
b
s The proof of the Lemma is easy and indeed is already clear from the picture. Proof of the Theorems: We let A = { x: Ff (x) .?:- 0 for all t > 0}
and notice that we need to prove that
fdp .4. 0, JAE'
and that equality holds in case I f dit ..- 0 and T} is ergodic — for, as before, the results will then follow after replacing f by a —f (If f = a — g, then Ac(f). {x: there is t > 0 with Ft (x) < 0} = {x : there is t > 0 with at — (a — g)dit ....ç. 0, or tg(Tsx)ds a}, and Lifdp,‘. 0 says f 14,.,,,i gdp..... ap, {g* > 4.) ' For each x e X, let Wx = {te ER : Txeilc} = {t e R : there is t' > t with Fe(x)< Ft(x)}, {
78
3. More about almost everywhere convergence
and let
W: . W x r)(0, I). By the Rising Sun Lemma (with h replaced by
—
h),
U (cI k , bk)
14 7
with
Fak (x) ) Fbic (x) for all k. Thus
Li f(Tsx)ds =
E Tf k
bk f( s x)ds =
E [Fox) - Fak (x)] . .5 o, k
ak
so that
0..... j f f(Ts x)dsdp(x) = Ts f f( x)dsdp(x) x wix ft(x.$):o<s<1.T.A-EA9 i f fit f(Tsx)dp(x)ds = f(Tsx)dp(x)ds J o i lx:rxeAr 1
= Jr i Jr 0
0frs 1 Ac
f(x)dit(x)ds
=
A,
Jr f(x)dp(x). AC
In order to prove the equality, we notice that if (ak , bk) is a bounded component of W., then ak ot Wx , so r
f(Tsx)ds _..- 0 for every t fak
and in particular fbk
bk f(Tsx)ds ->- 0, hence f x)ds f(Ts = O. ak
If p(A)> 0, then (for almost all x) all the components of W. must be bounded, since MI is ergodic. But if p(A) =0, then by the inequality just proved,
0 --.Ç.. ffdp = f A
fdp
+ f fdp A'
=I. fdp --.5 0, Ac
so that the equality
f dp = 0 fie
holds in this case. We suppose then that the components of W. are bounded.
More chout the maximal ergodic theorem
3.1.
XE X,
For each
79
let
the component of Wx containing 0, if xE { 0, if KEA
x
and Ii1
if xe A'
A(x)
0
if xe A
Then if x EK, we see that — se.fx if and only if se Jr _ ix . Thus xAc (x) = End applying the measure-preserving change of variables (x, s)---, (Tx s) on X x Ill allows us to compute that f(x)dp(x)= f(x)y Ac (x)dp(x)
fac
f
x
= fx
=
f(x)
A(T s x)dsdp(x) seJ x)
f(x)
A(T_ s x)dsdp(x) cse.IT _ ,x1
f kx)f (Tsx)dsdp(x) = f A(x)( f f(Tsx)ds)dp(x) = 0 x
.r„ (since we have seen that the integrals off over the components of Wx are all 0). fX J„
Remark 1.5 lI A = IxE X :Ft(x)> 0 for all t> 01 and jf then fdp. =
f = O. A°
Proof: Because of the 1.ocal Ergodic Theorem (see 3.3), lim
1 — t
f
1
(Ts.c)ds = f(x)a.e.;
Jo
thus if xe A, f(x) 0 aimost surely. It is enough to prove, then, that fitx e
f (x,› = O.
If f (x)> 0, then almostsurely F;(x)> 0 for all small t> O. Let
E.=
{X E AV4
:f (x) > 0 and I;(x)> 0 for 0 < t < 1/n} ;
we wilt show that p(E.). 0 for each n = 1,2 ....
80
3. More about almost everywhere convergence
If (E) > 0, by a theorem of von Neumann (1932 c) it is possible to choose t with 0 < t < 1/n and p(kn T _,E.) > 0. If x E.E. n T_,E, since xe A\A we can find t 0 > 0 with F10(x) =0. Then to ..›.. 1/n > t, and
0= F,.(x)= Ft (x)+ Ft.,(Tt x), which is impossible since Ft(x)> 0 and Ft .,(Tt x)..>'- O. C. Sign changes of the partial sums. The one-parameter Itchy case Suppose that {T,} is ergodic and If dp > 0. Then A' coincides with the oscillation set 6" = [x e X : there are t, t' > 0 with Fr(x)> 0 and F,.(x) < 01,
while A' coincides with the crossing set q? = {xe X : there is t >0 with Ft (x) = 0 } . (This observation uses the Ergodic Theorem.) The Maximal Equality asserts, then, that J0
fdp = f fdp = w
O.
We claim that this formula is true whether or not { T,} is ergodic and irrespective of the sign of ffdp. First, if ffdp < 0, then by considering —f, for which f —fdp > 0, we see that 0( — f)= 0(f) and if( f ) =Se(f), so that still —
fdp = f f dp = O.
w If ffd,u =0. then we have JO
J
f dp = f f dp = f f dp = 0,
A(f)
so that
A(- f)
0=
f dp = ff dp fA(f)vA(-
f)
and
L
fdp = m(f)um- Dr f clil =OE
3.1. More about the maximal ergochc theorem
81
Also, by the preceding Remark.
L
f du =
f dp = 0,
f dp +
E
AUM(f)
At - fhA( - fl
so that also
fe in this case. We have proved the formula, then, in the ergodic case, no matter what the sign of f f diz may be. In order to deal with the general, nonergodic case, we appeal to the theorem on ergodic decompositions. We may assume that X is the disjoint union of sets x,,,, each equipped with a a-algebra gi. and a probability measure p.., and that T acts ergodically on each (x.,g8., /. . The indexing set is another probability space (SI, S. P), and we have the formula )
fdp = f f fdpdP(o))
fx
for fel)(X).
n
Now for each co,
C. = C n X . and W.. = W n X 0 (where C., for example, is the oscillation set in X 0 off restricted to X, with respect to T restricted to x.); therefore
and
fe
fdp. = f f fdp..dP(co) = 0
dp = ff fdp.dP(to) = O. sf,f
Û w.,
We have proved the following comprehensive result. Theorem 1.6 For any measure-preserving flow { 1;} and any fe l)(X),
f dp . f f dp = O.
fe David Engel has pointed out that one can prove this result without making use of the full force of the theorem on ergodic decompositions. First, we extend the Maximal Equality to the non-ergodic case as follows.
sz
.5. More about almost everywhere convergence
Theorem 1.7 Let (T,} be a measure-preserving flow on (x, a, p), let feL l (X), and denote by 5 the a-algebra of all 1-invariant measurable sets. If E( f I .0) ..- 0, then
fdp = 0 for each iEf. J
it-14c
Proof: In case E( f j.f) > 0, we use the Ergodic Theorem to show that the components of W. are bounded. On an invariant set where ,E(f If) = 0, replace/ by4 =f + E. Then f dp = 0
I
l nAlfa° A(4) = A(f), so the conclusion follows by approximation. The
R >o
and rest of the proof carries through as before.
Corollary 1.8 (Engel and Kakutani 1981) If a(x) is measurable with respect to 5 and a(x) ..- E( f I .f) a.e., then ff dp = I nix: f(x)> a(x)!
Œ d/.L
for each
!E.,.
J in(x:Pfx)>cc(x))
Now the proof that WO. =1,6f dit =0 proceeds as before. We divide C into invariant sets according to the value of sgn E(f I .f) and observe that the integral off over each of these sets is 0. We may also consider crossings of, and oscillations about, levels other than 0. For any ŒE P, let
1 t '
1 t"
C a = xe X : there are t, t' > 0 with - F (x)> a and - F ,(x) < a
1 W.= {xE X: there is t> 0 with - F (x)= al. t '
Theorem 1.9 For any measure-preserving flow (7;), fE 1,1 i X), and ()cell,
f di .--- ag() and f fdp = ap.(WŒ). With a slight auxiliary argument for the converse, the following result is also immediate. (Here =-- means equals up to a set of measure 0.) Corollary 1.10 If WŒ =-
{T,} is ergodic.
X, then a = if dp. The converse holds if
.1.1. More about the maximal ergodic theorem
83
Thus a = Ifdp. is the only level which can be crossed by almost all the graphs {(1/t)F ,(x): — co
f
fdp
t
If a # J. f dp, there is a positive-measure set of trajectories which stay entirely below the level a, or such a set of trajectories which stay entirely above the level a. Remark 1.11 The following are equivalent:
(1) Cc, -4-- X. (2) f f dp. = a for almost all w.
x,„ 1 (3 )J = lim - l(x) equals a a.e. g.c. I The discrete case If T: X --, X is a single measure-preserving transformation, it is not hard to see that equality cannot hold in the Maximal Ergodic Theorem the same way as it does for a flow. (If we deal, however, with a function that takes values only in ( — 1, 0, 1), then again there is a sort of continuity and the equality can be recovered.) For fE V (X), we consider the partial
sums .- i
s„f(x) =
E f(T kx), k=0
the extrema
S* f(x) = inf S,,f (x) and
S* f(x) = sup Snf(x),
nil
and the sets of constant sign
A = {xe X : Sf(x)> 0 for all n ..- 1}, A = Ixe X : S,,f(x) -- 0 for all n › 11, E = {xe X : SJ(x) < 0 for all n ..- 1 } , E = [x€ X : S.f(x) 4. 0 for all n ,- 11.
nil
S4
J. more about almost everywhere
convergence
Theorem 1.12 If T is ergodic and Sfdp ?b, 0, then
fAS*f du = f S * f dp = ff dp. A
Proof: Since S *f = 0 on A\A, the first equality is clearly true. If gA) = 0, then the Maximal Ergodic Theorem applied to —f shows that
0 -.<..
— fdp= — f fdp,
so that
f dp -4-50 JAC
and we have 0 4 ff dp = f f dp 40, A'
whence I f dp ---- 0 = IAS*f dp, which proves the Theorem in this case. Suppose now that p(A) > O. Then for almost every xe X there is a smallest n(x)?.'.. 1 such that
T" E A. I claim that Mx) -1
S * f (x) =
E
f (Tkx).
k= 0
For Tn(x)xEA, so that
E
f(7`kx) ?JO
for all m .- n(x).
k = n(x)
This implies that the infimum S* f(x) is achieved by some i with 1 ..<- i ..ç. n(x):
S* f(x) =
E f(T kx). k=0
Then for m -- i,
E f(Tkx) = k=E0 f(Tkx) — k=E0 f(Tkx) -13,
k=i
so that rxEA and hence i = n(x).
3.1. More about the maximal ergodic theorem
85
Now we may compute that ri(x)- 1 ff dp .-f( Tkx)dp(x)--=.f S * f dp
f
A
E
k=1)
A
Remark 1.13 The preceding argument involves a sort of discrete Rising Sun Lemma. The Theorem is also, via suspensions (i.e. flows built under constant functions), a corollary of the Maximal Equality for flows. Corollary 1.14 If T is ergodic, f ELAM with ff dp ..- 0, and f takes values only in 1 —1, 0, 11, then p(A)= f f dp .--- ff dp . A
This last result is familiar in the theory of random walks. Suppose we flip a coin with probability of heads equal to p> 1/2 and that of tails equal to q = 1 — p. and we move up one unit for each head obtained and down one for each tail. (i.e., T is the Bernoulli shift alp, q) on the symbols +1.) Then Snf(x) gives the walker's height after n (independent) flips. The Corollary states that the probability of always remaining above 0 is p — q. Our result applies to all stationary processes. not just the independent, identically-distributed ones; on the other hand, the conclusion of the Corollary remains true for some non-stationary processes too, as for example in the Ballot Problem (see Feller 1950, p. 69). Let us turn now to the unrestricted discrete case: we no longer assume that T is ergodic or f f dp ..- O.
Theorem 1.15 If T: X —* X is a measure-preserving transformation and fe/2 (X), then S.f dp + sie PI dp.= i f di.i. JA A
j
E
Proof: We again use an ergodic decomposition of X into {(X .,.4., p j: foci-4. (As before, arguments avoiding ergodic decompositions are also available.) If f dp...>: 0, then fx.
f dp.= x.
S* f dp.; 16Ar
1
X,,,
while if fx. f dp. <0, then f f dp. — S*f dp. ,74.,, fEnx,,
i.
More about almost everywhere convergence
(as may be seen by considering —f in place off ). Thus ff dp =
S*f
f dp. dP(w) =
x,„
{
col x,o fdpo)
dP(w)
.Arl
S*f dp. dP(co) E n X co
Ito:1 x f dcv <
S * f dp
f S* f dp,
A
since, for example, toe A n X w implies that ff dp.
O.
If f takes only the values — 1, 0, 1. as in a simple random walk, then the Theorem states that the probability that the walker first returns to 0 from above equals the probability that he first returns to 0 from below, no matter what the probabilities of moving up and down are (and even in the case of dependent increments)! For S* f = 1 on A and S*f = —1 on E, so that according to the Theorem, 14A) — ME) =
f > 0} —
f < 0},
Or
p{f >0} - AA) = p{ f <
— 1(E)),
that is, pix: f (x) > 0, Snf(x)
=
0 for some n 1} f(x) < 0, Snf(x) 0 for some n
(the probability of first returning to 0 from above equals that of fi rst returning to 0 from below). By considering A and E in place of A and E. it follows similarly that p.tx: f(x) > 0, Snf(x) < 0
=
for some n 1} f(x) < 0, Snf (x) > 0 for some n
11.
In the LLD. case of a true random walk (i.e., T a Bernoulli shift), such results can be easily proved by symmetry considerations:
3.1. More about the maximal ergodic theorem
87
gach path which returns to 0 correspcnds (under a measure-preserving transformation obtained by considering the increments in reverse order. starting at the first impact on 0) to a path on the other side of 0:
Our theorem shows that such symmetry is present in every stationary stochastic process. For further discussion of random walks with stationary (dependent) increments, see Derriennic (1980). D. The Dominated Ergodic Theorem and its conu erse Wiener's Dominated Ergodic Theorem gives a sufficient condition that f * : that fa, log L. i.e.
fx 1.1.001 log
+
1.1 . 001d/4x) < X.
(For f* to be in L t means that the a.e. convergence of (1/n)Sn f is of the kind in the Dominated Convergence Theorem, hence the name.) Because of the Maximal Equality, we know the distribution of f* well enough to see that for a nonnegative function this condition is also necessary. Theorem 1.16 (Wiener 1939, Petersen 1979) Let { Tr } be an ergodic measure-preserving flow on (x, g p) and 0 f EL 1 (X). Then f *ELI if and only iff E L log L. Proof: For each a _) 0, let ,
G(a) = pixEX: f*(x)> al.
From (B), for a
If di/ we have
1f
GOO = -
Œ if* >
f
88
3. More about almost everywhere convergence
Now for any continuous increasing function h on [0, w) with h(0) = 0, we have
fx h(f*(x))dp(x)
—
h(y)dG(y) =
G(y)dh(y).
(For the last equality, check it first for bounded functions and then apply the Monotone Convergence Theorem.) Thus co
Ix
f*
=
II
G(y)dy = f
G(Y)dy +
G(Y)dy
0
roe
=c+ Ilf II 1Y
co
c + .1'
f
f dpdy
If* >yI
1 - J.
f(x)
f(x)
f dp dy = c + i f > VIII)
VII i -V If > y}
dy d p.(x)
f 11111 1
Y
= c +f(x) [log f(x) — log I f1]dp(x). 11 > 11 111 ii
so that f* EL' implies f EL log L. For the converse, we use a neat trick of Wiener's: if g = f • (a/ 2)} , then f* 4 g* + a/2, and the Maximal Ergodic Theorem applied to g says that
tif f * > cx} p{g* > (a/2)} -
gdp 4- f gdp a X
2
f dp.
— Œ If> (ca.211
Thus
L
f* dp = c + • c+
p{ f * > y} dy 211f Iii le 2
f dpdy if > (y1 2) 1
211111 1Y
=
f(x)
c +I
J 1f>llfII l I
1(x)
dv
I:114x)
J11111 1 y
• c +f(x) log + f (x)dp(x), > II f II
so that f EL log L implies f* E L1 . Reverse maximal inequalities and converse dominated theorems are found in other contexts as well: see Burkholder (1962), Stein (1969),
3.1, More about the maximal ergodic theorem
89
Gundy (1969), Ornstein (1971b), Derriennic (1973), Jones (1977). Part of the interest in the question of exactly when f* is integrable arises from the general theory of Hardy spaces: frequently one says that f€11" if an appropriate maximal function of f is in D'. See Hardy and Littlewood (1930), Burkholder, Gundy and Silverstein (1971), and Fefferman and Stein (1972) for the original results in this direction and Petersen (1977) and Garsia (1973) for an introduction to this deep and fascinating subject.
Exercises 1. Show that if T is a positive contraction on L', 0 f gel}, and re-1
E=
rg for some n 1
> k=0
k=0
then gdp
f dtt.
E
2. Prove that the sets A, A are measurable. 3. Give examples for which A # A, in both the flow and discrete cases. 4. Prove that if { 1 } is ergodic, then (6. = X if and only if a = f dp. (Hint: First consider the discrete case. If J f dp = 0, use the tower decomposition of X with respect to A to prove that p(A) = O. Then consider the time 1 map of and f i (x)= f o' f( 7;x) ds.) 5. Prove Remark 1.11. 6. Fill in the details of the proof of Theorem 1.7 and prove Corollary 1.8. 7. Show that the Maximal Ergodic Theorem (see Section 2.2) still holds if we only require that f ± EL', rather than f 8. If f eV and .31r is the family of invariant sets, then, without assuming ergodicity, (a) in the discrete case E( fif) = E(S * f-X A + S*f. xE ll) a.e. (b) in the flow case, E(f1.5r) = E(f.(x A + z E)1.1) a.e. (where = ix: F1(x) -.5 0 for all t 0}). 9. Work Exercise 8 on the basis of 1.12 and 1.3, avoiding ergodic decompositions. (Hint: (a) Consider first an integer-valued f, and work separately on the sets where E( f > 0, Et f ) = 0, and E(flit)
90
3. More about almost everywhere convergence
3.2. More about the Pointwise Ergodic Theorem This section includes two main topics. First, we will give a proof of Birkhoff's theorem which shows more clearly exactly how the maximal inequality produces the convergence theorem. The same type of argument will also appear in the next few sections. when we prove the Fundamental Theorem of Calculus and the existence of the real-variable and ergodic Hilbert transforms. Second, we will show that in general no statement can be made about the speed with which the convergence takes place in the Ergodic Theorem. A. Maximal inequalities and convergence theorems Already in 1925, Kolmogorov (1925) proved a maximal (or weak-type (1,1)) inequality for the conjugate of a harmonic function. and soon thereafter (Kolmogorov 1928, 1929-30) he established a weaktype (2.2) inequality for sums of independent random variables. Hardy and Littlewood (1930) further demonstrated the usefulness of maximal functions in analysis. They considered both the Hardy-Littlewood maximal function
M f (0) =
sup - I f (0 + x) dx (f E [ — n]) 4/4
nt
0
and the nontangential maximal Junction
Nc F(0)= sup IF(z)1 (F analytic on D = the open unit disk), zEn..(0) where St (0) is as shown.
and used these functions to study the nontangential convergence of analytic functions to their boundary values and what we now call Hardy spaces. F. Riesz (1931) based a direct proof of the Hardy- Littlewood Maximal Theorem (originally proved from its discrete version) on his Rising Sun Lemma and the (consequent) maximal inequality
m{Mi >
f
-IfI dm 1
3.2. More about the pointwise ergodic theorem
91
for the Hardy- Littlewood maximal function. Riesz was primarily interested in applying these ideas to differentiation theory, and indeed he showed that the Fundamental Theorem of Calculus for the Lebesgue integral, 1f - {f (x - t) - f (x)] dt e 0
0 a.e.
as e --+ 0,
was easily proved via this approach. Later, F. Riesz contributed important simplifications to the proof of the Ergodic Theorem; as we have seen, however, it was because of Wiener (1939) and Yosida and Kakutani (1939) that the Maximal Ergodic Theorem achieved its central position in the argument. For certain stochastic processes {X k(co):k = 1, 2, ... } (submartingales), maximal inequalities like 1 P{sup X k (co) cx) k4n
a
X n dP flsup Xk .rtj
were used by Paul Lévy (1937) and Jean Ville (1939); these led to the martingale convergence theorems of Doob (1940, 1953). Finally, we should mention that the discoveries of recent workers such as Fefferman and Stein (1972) and Calderôn (1950, 1977), have led to a very deep understanding of maximal functions and, of course, have also produced a set of new problems of correspondingly greater depth. The basic reason why the maximal function and the maximal inequalities are so useful in analysis was already formulated by Banach (1926). Theorem 3.1 Banach's Principle Let 1 .‘ p < cc and let { 7'.} be a sequence of bounded linear operators on LP. If
T* f = sup IT f < cc a.e.
for each fe LP,
then the set off for which { 7'nf } converges a.e. is closed in LP. For the proof, see the Exercises. Frequently it is easy to exhibit a dense set g in LP such that { Tnf} converges a.e. for each fe g. If one can prove that T* f < co a.e. for each f elf, then the a.e. convergence of {Tnf } for all f e LP will follow from Banach's Principle. In most cases, that T* f < ce a.e. for eachf e LP is established by proving that T* f satisfies a weak-type (p, q) inequality : \q c } { 7.'1 > 11 P
(Indeed, Stein 1961, Sawyer 1966, and Garsia 1970 have shown that in many situations T* f satisfies such an inequality if and only if
92
3. More about almost everywhere convergence
T* f < oc a.e.) Of course the Maximal Ergodic Theorem is an example of such a result. We will follow this scheme of proof several times in the following pages and will thus have a chance to see it operating in various contexts. First. let us apply it to the Ergodic Theorem. Approximation proof of the Ergodic Theorem 2.2 We will prove the
essential part, namely that the ergodic averages in-1
/
f Tk converge a.e.
First, if gel, and f = g - T.q (so that f is a `coboundary'), then i n-1
1
E (g T k - gTk + 1 ) = -(g - gT") -40 a.e. n k= 0 n k=0 n Also, iff eV is invariant (f T =f a.e.), then =-
y
_ f Tk -> f a.e. n k=0
Thus if g = { f + (g - Tg):fel}
is invariant, g e Ll
and in-
1
W = If eV :- 1 f T k converges a.e. , n k=0 then g and Sf is a linear subspace of L'. We only need to show. then. that (1) 9 is dense in 1,' and (2) (if is closed in L'. In order to prove (1), let g 2 -= if + (g - Tg): f E L2 is invariant, gE Ll.
We will show that g 2 -6i is dense in L2 , and hence in L' (recall that on a finite measure space 11 II 1 0 112 by Holder's Inequality). If h e 1,2 and h 1 (g Tg) for all g e Lc°, then -
TA hdp = f hT - 1 dp
for all A ER,
A
and hence h = hT - 1 a.e. This implies that L2 is even the orthogonal direct sum of the invariant functions and the closure of 1g - Tg:ge Ll. At any rate, 22 is dense in L2 and hence in L'. To prove (2), let ln-1
Anf =- E IT" nk=0
3.2. More about the pointwise ergodic theorem
93
and note that by the Maximal Ergodic Theorem
p{sup kJ' > al ‘4.2.{sup A VI > a} Œ
a
VI. >
Suppose then that fk e(6 and
in L t ; we will prove that fundamental (i.e., Cauchy) ac., so that also f e(6. Now
A mf
Ill
I fi dz
A nf,d+k m(j . —fdi+
•
A n f } is
f)I.
and the first term tends to 0 a.e. as m, n --+ x, since {Anfk } is fundamental a.e.; therefore, for each a> 0
p Ilim sup I A nif— A nfl > 1177.11 -i
z_çtti2suplAy—fdl> ‘- --2cx Ilf — fk which can be made arbitrarily small by a suitable choice of k. Thus
p lim sup lAni f n1.n-0
A n fi > a } = 0 for each a > O.
XJ
and hence. letting a
0, we see that lA n f'j is fundamental a.e.
B. The speed of convergence in the Ergodic Theorem Suppose that T: X X is an ergodic m.p.t., so that
n-
-
y fiTkx)_-.
ffdp a.e. for each f EL I
PI k = 0
For each n 1. let SH fix) =1(x) + J. (T x) + + fir - x). Let us consider only functions Je 12 for which ffdp = O. For such an j; S
a.e.
It is not unreasonable to suppose that for some T a series such as
Sn2f L. n=
1
fl
might converge a.e. After all, not only does
S j(x)
0 a.e..
but it usually changes sign frequently enough so that the convergence of this series, even if not absolute, might be enhanced by a great deal of cancellation, as in the case of an alternating series. Indeed, the series does
94
3. More about almost everywhere convergence
converge a.e. in many cases: if the f r are independent, as when T is a Bernoulli shift and f is a coordinate function (by the Law of the Iterated Logarithm); if Tx = x + a (mod 1), f is the characteristic function of an interval, and a is not a Liouville number, i.e., for almost all a (by numbertheoretic estimates on the `discrepancy'); iff=g—gT for some gel...'; or if f is a nonconstant eigenfunction of T. (For sums of independent random variables X k , the Law of Random Signs asserts that Eak X k converges a.e. if Eak2 < cc. The definitive result along these lines is Kolmogorov's Three Series Theorem: If {Xn } are independent, then EX,, converges a.e. if and only if each of the following three series does, for some AER:
Eptix„I-4. ygx(A) n ') yvar(V)) n Here X.(À) is X , truncated at + ),: v)(co) = .1 X n(co) if I Xn (c0)1 , 0 otherwise. Statements about series E akf(rx) and yb n (Sj(x))/n are related because of partial summation.) We will see, however, that the series Snf(x) L /1 2 ).
n=1
does not in general converge a.e., and that in fact (S,f(x))/n does not tend to 0 fast enough to make any divergent series convergent: given any sequence b„ -- 0 with y,°,0 b.= oc, and any ergodic T, there is an feLœ such that ,
Eœb.S "S'(fn x)
a.e.
n= Y
Thus, no general statement can be made about the speed with which convergence takes place in the Ergodic Theorem. We will actually construct such a function f for each given sequence {kJ and each ergodic T, using one of the basic tools of ergodic theory, the Kakutani-Rokhlin tower (see Lemma 2.4.7). (A category argument for the existence of such functions has been given by del Junco and Rosenblatt (1979).) Theorem 2.3 (Kakutani and Petersen 1981) Let T: X -4 X be an ergodic m.p.t. on a nonatomic probability space (X, (,4,14, and let I), .- 0 be any sequence for which CO
E k=1
bk = oc .
3.2. More about the pointwise ergodic theorem
95
Then there is an fel.f)(X) with if dp. = 0 for which S f (x) sup E b k = co a.e. ; k k k=1 in particular, the series
E
S f (x) n
b. " 1
diverges a.e. Proof: The function f will be defined as an infinite series,
fn 1=
E
The constants K. / oo and a sequence Çi oo will be defined inductively, and each f. will be defined as a simple function with respect to (i.e., constant on each set of) a Kakutani-Rokhlin tower in X. Let Gif(x) =
E
Skf (x)
bk k
,
k=1
we will show that for large N, G IN is very large on a set of measure very and E \ 0 such that close to 1: there are sequences M p{x
: GIN (x)1
MN}
1 -ç.
This estimate will be carried out by splitting the series for bk f (x) E_ E E„.1— E -'k= k n ., K,,
bk f (x) k n— 1k=1 k k v "K„ into three terms-those for which n N, and n = N-and showing that the term for which n = N dominates the other two. To begin, let K 1 = 1,1 1 = 1, and find a tower of height 2 in X: That is, find a measurable set A 1 c X such that A 1 n TA i = 0. Define f1 by f1 1 on A 1 , f1 - 1 on T A i , andfi -a 0 on X - (A l u TA Notice that Skfi (x) takes only the values 1, 0, and - 1, for all k and x. Suppose that K r I, and fi have already been defined for all j < n, and that c, = Sup SUP I S kfi „ < ce . Gif (x)
i
(1)
k1
-
Choose K. large enough that (a) K.>, K._ 1 , (b) bk for all j
(c) \Tr< k=1
< n.
—s
96
3. More about almost everywhere convergence
(2) Choose I
enough that
(a) 1. .>.- I._ 1
i„
E
(LI)
b E1" ±L. k
bk .. K n c
k=1
This is possible since
k=1
Ek(43
_1
b
= 00
implies that
I
E
bk
k =1
I
E k=
bkfic
1
(3) 4, is defined by using a tower of height 2n1 X, with 'remainder' having measure no greater than 1/n. That is, find a measurable set A such that A. T A,,,...,V"'" - ' A pairwise disjoint and 2ni, - 1
(
p i
u TiAn ) ...- 1 — 1-. n =0
We think of the tower as consisting of a lower half, n blocks each of height Ç, and an upper half, again n blocks each of height in.
97
3.2. More about the pointwise ergodic theorem
The function fe is defined to be 1 on the entire lower half of the tower, —1 on the entire upper half, and 0 on the remainder: fe -= 1 on TA n for 0 ‘.../ nin — 1, ffl a
Ion TA n for nin ‘..j -<2n1— — 1, 2n1,,— 1
—= 0 on X\
U TiAn . i= 0 feLD, J fdp=0, and Skfn(x) takes values only in Notice that — n1,,, nie], for all k and x. Thus ce+ 1 The K, le , andfn are therefore defined by induction for all n = 1, 2, We let
E k=i
f(x)=
fe(x)
Q< cc. This series converges in L, since fn I ‘.1 a.e. and EokriWe have fel," and f f dit = O. We will now show that, for large N, G I f (x) is very large on a set of N measure very close to 1. We may write bk
GiNf(x)=
I N bk
S f(x)
kk
EE
=
k=1
k=1
E"1
b
IN
Skf.(x)
k n= jr(,,
1 n < AN/
kskirn (x)
L,
n=lA k= i k
'N
b Sk fe(x)
kE =1
IN b
1
=171: Skfn(x) >NN/KnkE nI
1
'Nb k1
Skiv (x)
= 1 + 11 +
Now
I1I
E
1
n
bk
= eN Ic=1
= CC N
IN b
E kklskin(x)i E 1
k )n<1,1.1F <
1
v b k eN n
E
bk (
eN k=1
k
to
1 \
b (by 1(b)), where c is a finite constant. E -A k=1
I
98
3. More about almost everywhere convergence
Further, since I Sk f.(x)1 ‘.k for all k and x,
I Hi
1
1
IN
(by 1(c))
FK-nk=i
vo.N N
1
u,
.
c', another finite constant.
However, Sk fm(x)= k for k = 1, ... IN if x is in the bottom n - 1 blocks of the lower half of the N'th tower, and Sk fpi (X) = - k for k =1, ... 1N if x is in the bottom n -1 blocks of the upper half of the N'th tower. This set has measure at least ((N - 1)1N)1 . More precisely, Skfiv (X)= k for k=1,...I N if xe VA N and 0 ‘..j ,.<,. (N -1)1N -1; SkfN (X) = - k for k =1,...IN
if XE TiA ly and Nip, ‘. j ..‹,. (2N - I)1N - I; Ti A N ) > ( N - 1)2 U 0-S. »S(N - 1)1N - 1 N p( tw ig...5;4(2N- i)i„, - I
Therefore, on this set
1 111 1 = /
1
IN
E
-v KN k=1
Thus
'MI
-*
y bTk IN
b k ..- N/K N eN
.
k=1 rt
cc as N -, 00 , so also
II + II + IIII -■ co as N -4
. We
III +1111 have proved that ti {x : lim sup 1 '", x
EI k=- 1
bk
Sk f(x)1_ + 1_ 1. ,
-
r‘"
While for if T k } independent we have the Law of the Iterated Logarithm (Khintchine 1923, Kolmogorov 1929)- according to which I V (x)I = °( ‘,/n log log n) a.e. because of this Theorem no analogous statement can be made for stationary stochastic processes in general, for any choice of the comparison speed. Some applications of this result to questions about the convergence of series of the form OC
E
ak f (T k x)
k= 1
are mentioned in the Exercises and in section 3.6.
3.2. More about the pointwise ergodic theorem
99
Exercises 1. Prove Banach's Principle. (Hint: First use the Baire Category Theorem to show that if Tsf < cc a.e., then there is a function 4:5(a) such that NO —> 0 as a —> cc and pi Tsf > f li p } Nu) for all .fe LP and all a > O. For this purpose, consider the set
El =
IfELP: p{rf> m}
it[sup I Tkfl> m} .4e). IC-5n
Then proceed as in 2.2.) 2. Extend the approximation proof of the Ergodic Theorem to the infinite measure case. (Hint: {f+ g gT: f, g e L.2 and f= f Tax.) is dense in 1,2, and weak (1, 1) implies (using the integration technique on p. 88) that IIT*fI1 2 cll f 112 for fe L 2.) 3. Prove that no statement concerning the speed of convergence in the Ergodic Theorem is possible, in the following sense: Given any ergodic transformation T on a nonatomic measure space and any sequence an ■ 0, there is a bounded measurable function Jon X such that —
—
lim sup
I[Snf(x)In]— ffdpi
a.e.
(See (Krengel 1978)), where it is shown that if X = [0, 1), then f can in fact be chosen to be continuous or the characteristic function of a measurable set.) 4. Suppose ck ck+1 0 for all k = 1, {kc k } is bounded, and Ekc-_ k cc. Prove that for any ergodic transformation T on a nonatomic measure space X, there is a function feL(X) with jfdp = 0 such that
E
c,f(Tkx)
k=
diverges a.e. Thus series like
co f (Ty k
f(Tkx)
E
k=3 k log k log log k
, etc.
can be made to diverge a.e. (But see 3.6.) (Hint: Let bk -k(ck ck , ) and use partial summation.) 5. Prove the Ulam von Neumann Random Ergodic Theorem (Ulam and von Neumann 1945) Suppose that (X, .4, p) and (F, 9, y) are probability spaces, and that for each yel- there is a m.p.t. Ty : X > X. Assume that for each measurable fon X. the function -
—
100
3. More about almost everywhere convergence f(T).x) is jointly measurable in x and y. Let 0 = ri% (F, W, y be the product measure space; each WE is a sequence co = {yn(co)) of elements of F. If feL l (X). then for almost all coef. there isLe /.2 (X) such that
lim
1" -
E f (Tim _ , 00 ... T). , ((,,) Tmo x) =1.(x) a.e.-dp.
n -+ co ri k= 1
(Hint: Apply the Ergodic Theorem to a suitable skew product.) 6. (R.L. Jones) Let T: X -■ X be a m.p.t. and fe L i (X). (a) Show that f (T kx)/k -■ 0 a.e. (b) Show that if p> 1, then
i
(f ( TkX) y k )
k=
converges a.e. (Hint: Assume /.. - 0 and show that
ci3 {x:[ E
T P > a } ‘ c I f il , )P (\f (Tkx) k J .1
by writing Tk - s. AI (x) = f( and establishing such inequalities for g separately. Recall that g(x)
hk =fT k
-
gi
idg k(x)1Pdp -- ji; pa P - 1 pIgk > aldoc.) (c) If p > I, then f(T kx) L 'I kP k=
converges a.e. (Hint: Use partial summation.)
3.3. Differentiation of integrals and the Local Ergodic Theorem For a real-valued function ge OR), we define the HardyLittlewood maximal function Mg of g by Mg(t) = sup f>0
i r:
—
2.E „
I g(t + s)Ids.
We first prove the original maximal inequality of F. Riesz. Theorem 3.1 (F. Riesz 1931) If gE 12(R) and A > O. then
mIxe R: Mg(x) > /1.1 ‘.. ii2, II gil l .
3.3. Differentiation of integrals and the local ergodic theorem
101
Proof: Let A c x: Mg(x)> 11 be closed and bounded. For each xEA there is an open interval I, centered at x with }
{
1
m(k) fixigidm>.t. A finite subcollection / 1 , /2 ,...,/. of these still covers A. We may assume that no point of R belongs to more than two of the I. (For if t is in three /k's the interval with left endpoint farthest from t and the one with right endpoint farthest from / cover the union of the three intervals.) Thus
Ex', 2y,/ k k
k
so that 1 I k ) .‘_ 7,E f Igldm
m(A)
A k
k 1C
-=.-2 j EiglY/ k
k
ik
2C •-j IglY / k di
2 ---2 ilg
k
Theorem 3.2 Lebesgue Differentiation Theorem (Lebesgue 1904) If g is locally integrable on R (i.e.fe L I (K) for each compact K c R), then
lim
I f' —
,_. 0 . 2e _
g(t + s)ds = g(t) a.e.
Proof: Fix an open interval I and suppose that geL l (I); we will show that the formula holds a.e. on I. If g is continuous, then as in elementary calculus
1 CE
I g(t ± s)- g(t)Ids
L6 — e
can easily be made arbitrarily small by taking c small enough. Let As(t)= — 1 f g(t + s)ds
2c -
and defme
W = {g€L 1 (1): illg -0 g a.e. on / } . We have just seen that 5° contains the continuous functions on I. a dense set in L i (I), so that it is enough to prove that W is closed in 1,1(I).
LUZ
J. More about almost everywhere convergence
Suppose then that gk E As(t) — g(t)I
and gk —> g in VW. Since
g(t) 1 + I g k (t) — g(t)I
I A ,(g — g)(01 + I Ag(t)
and lim sup I il,gk (t) — gk (t)I =-- 0 on I,
we see that for each 2 > 0 m tt E
:
lim sup I A r g(t) — g(t)I> A:
+mttE/:1
Ç
A}
...Ç 3 11g —gk Il i +mftEl:Ig k (t)— g(t)i 1
2
which tends to 0 as k x. (Recall that L' convergence implies convergence in measure). Thus in { tei: lim supikg(t)— E--.0and letting 2 --. 0 shows that
g(t)i > A } = 0 for each A > 0,
lim supj As(t) — g(t) I = 0 a.e. Remark 3.3 This result can be extended to show that 1 CC
Ig(t + s) g(t)I ds
0
for a.e. t.
BE -
The set of t for which this happens is called the Lebesgue set of g. Theorem 3.4 Local Ergodic Theorem (Wiener 1939) Let {Tr} be a measure-preserving flow on a probability space (X, .4, p), and suppose that fE Li ( X). Then lim E -, 0 +
I
lit
f(Tsx)ds =f(x)
a.e. dp.
E
Proof: Direct proofs are also possible, and of course the result would follow immediately from the representation of 11;1 as a flow under a
function if this could be established independently, but we will give Wiener's original argument, which uses the Lebesgue Differentiation Theorem and Fubini's Theorem. There is a set of x of full measure for which f(Ts.x). as a function of
3.4. The martingale convergence theorems
103
s e R, is locally integrable on R. For any fixed x in this set, by the preceding Theorem ER: Jim ft
1 f
f(Ts Tr x)ds #f(Tx)
—
2e
-e
has measure 0. Hence (t, x): convergence fails at Tx}
has product measure 0, and therefore for almost all t p{x: convergence fails at Trx} = 0. If we choose and fix a single such t, then, letting F = {x : convergence fails at x},
we have that 0 = p{x: Tr xeF} = p(T _,F) = p(F), which proves the Theorem.
3.4. The martingale convergence theorems Let (0, .9-, P) be a probability space and S c ... an increasing sequence of sub-a-algebras of A sequence X 1 , X 2 ,... of functions in 00) such that X is measurable with respect to .9 -n for n= 1, 2, ... is called a submartingale if E(X
1 1 .F„)
a.e.,
a martingale if E(Xn+1 1.9-n) = X n a.e.. a supermartingale if E(X . 4_ 1 1 .9" .) 4. . X
and a.e.
If Xn is the fortune of a gambler after n plays, in the case of a submartingale the game is favorable to the player. The word 'martingale' was formerly used for a certain betting system, possibly appropriated for that use from its usual meaning as part of a bridle. The word 'supermartingale' is unfortunate– it is in no way connected with grocery stores. Here {Xn} is properly called a martingale (or submartingale or supermartingale) with respect to {. .}; the simple word 'martingale' may be reserved for the case when ..F n is the a-algebra generated by X 1 , X 2 ,.. .,X. The fundamental result about martingales is the Martingale Convergence Theorem of Doob, which is comparable in importance as well as content to the Ergodic Theorem. The following extremely elementary proof was shown to me by J. Horowitz. In contrast to the usual proofs and the other arguments in this chapter it relies on no maximal inequalities
104
3. More about almost everywhere convergence
or uperossing lemmas. It is no harder to prove the a.e. convergence of L' -bounded submartingales, and we will do so. First a simple decomposition will reduce the statement to showing that every non-negative supermartingale converges, and the proof will be completed with the help of an elementary optional sampling (i.e., stopping time) theorem.
Theorem 4.1 Submartin gale Convergence
Theorem Every 12-
bounded submartingale (i.e.. supn El Xn I < oc) converges a.e. Lemma 4.2 (Krickeberg Decomposition - see Neveu 1975) Every
L'-bounded submartingale P(.1 is the difference of a non-negative martingale {Mn } and a non-negative supermartingale {S}: X. - M. - S. for all n. Proof: Notice that {X: } is a non-negative submartingale, since
I..-Fn )
E(X:4_
E(X. +1 1,),..>- X.
and hence, since E(X:+1 1.F.)
E(X:+1 1.F.)
X: a.e.
0 and X
either X: or - X:.
for all n.
For fixed m n.
E(X:+1 1',Frd= so that E(X: limit
I Fyn ) increases in n for fixed m and hence has an increasing
M.
T E(X: grn).
I claim that {M.; is a martingale. For WI/1,J gn) E(lim T E(X: I g
= lim T
dig n)
X: = lim E 5-`" X: = M,„.
Also, each M n EL', since
E(M) = lim T E(E(X: .)) = iim T E(X:) ‘.
SUP
El X <
Then let Sn = M. - X. for n = 1, 2, ... . Clearly Sn 0 a.e. (see the second line of the proof) and each Sn is in P(0). Also,
= E( Mn+lign)- E(X 1 I .F„) so that {Sn ) is a non-negative supermartingale. E(Sn+
M - X,7 S a.e.,
3.4. The martingale convergence theorems
105
Lemma 4.3 (Optional Sampling)
Let {Xnl be a non-negative supermartingale with respect to tgrn} and a, t: 0 --- { 1, 2,..., CO } stopping times (i.e., {co: Ow) ‹ n} E .5% for all n = 1, 2,..., and similarly for T). Define {
XT(co) =
Xr(a)) (CO)
0
if r(o) < co if T(0)) = oo ,
and similarly for X.(co). If a(co) 4 r(co) a.e., then
E(X 0) ..- E(X r). (In the case of a supermartingale, a gambler's fortune tends to decrease with time. According to this Lemma, the sooner he stops, the greater his expected fortune.) Proof: Fix ni ...- 1. If n ..- m, then
X TAn dP =
X dP + r
L=m)
X r dP +
..-
f
X n dP ffu=nt, r >
n)
X n + 1 dP = f
X rA(n+ 1) dP
(since {a = m, r> n}e,„ and the supermartingale condition says that
TA
Xn+ i
dP4. f X n dP if Aeg-n). A
Also, for n ..- m, on {a- . m} we have m = a ..‘. -r, so that
X gdP = L=nt)
Xm dP = fla =n11
la =m)
and by the first part of the proof this is greater than, or equal to,
ficr=m1
X T A.dP
X rAn dP ?:" fin=pn,r<x))
(since each X. ,.. 0). Thus -
fin=
XadP ..et)
La
X rn A dP
for all n ->- m. We want to apply Fatou's Lemma; note that X, as n -- co on {a = m, T < 00 }
and X, = 0 on {-r = cc}.
106
3. More about almost everywhere convergence
Thus
f
X dP .-- lim inf n
fa = ml 6
X t An dP ler=m. r< col
X dP
lim inf ,dP =
f
XtdP.
ict
=-Pnl
Summing on m gives
J'
f XT dP.
'CAP
Corollary 4.4 Under Proof: Take a I.
the hypotheses of Lemma 4.3, X T e
Proof 4.5 (ofthe Submartingale Convergence Theorem) Because of Lemma 4.2 it is enough to show that every non-negative L'-bounded converges a.e. Let {Xn} be a non-negative supermartingale supermatingl which does not converge a.e. Then there are a, (3 with 0 c
such that
E = {co: lim inf X n(co) < a
KO = inf In > r21 (o): X n(co) > pl for i 0,
and T21 (o) = inf In >
T 21 _ 1 (0*
Xii (C,O) <
for i
where as usual inf (/) = + cc . Then T
0
T
1
T
2
—1
Xt2, < a if T 2i ‘. CC, and X r2. + > if T 2i + 1 < CC) Let pi = P{co:T i(co) < co}. We have p 21 21 - D 2i-1 and /3p 21+1
X
dP 1 214
IX r , • dP ap v ,
1,
3.5. The maximal inequality for the Hilbert transform
107
by Lemma 4.3. Therefore, .e. a P2i-i- I ''''''' — P 2i ....ç
P
a P 2i—1 .4
a
11
but this is impossible since p2+1 ---
P(E) > O.
3.5. The maximal inequality for the Hilbert transform For a function f EL1 (1R), the Hilbert transform Hf of f is defined by I
Hf(0= - -lim
It e.-.0 4-
f
Isl
f(t - s)
ds.
S
E
Considerable argument is required to show that this limit exists. We will show here that the maximal Hilbert transform If f (t - s) H*f(t) =-- sup ds L>o n i s! ?.., E S satisfies a weak-type (I, 1) inequality. m{tER:H*f(t) > i} 4c 11 f 11 , for each ; > 0. ;
While the convergence would, as usual, follow readily from this inequality, we will not stop to prove it, but will move on to the ergodic case. We give the ingenious proof due to Loomis (1946), who rediscovered an idea that actually goes back to Boole (1857). This argument, however, works only in one dimension, and for the higher-dimensional versions one must resort to covering lemmas and Calderón-Zygmund decompositions (see Stein 1970, Stein and Weiss 1971). The Hilbert transform Hf is the analogue on R of the Fourier conjugate of an I) function on the unit circle F. Recall that a harmonic function u on the unit disk D has a unique conjugate function a which is harmonic on D with u(0) = 0 and such that u + iii is analytic on D. If u has boundary values f Elf for some p> 1, then ii has boundary values J The conjugate function is also given by a certain singular integral:
7
7
.
1 t I 7(x) = - - limt f (x + t) , cot-- dt ir14. IIE-4 0 + (see Zygmund 1959). Moreover, there is a simple relationship between the Fourier coefficients {a n} off and tan} off: ein = - i sgn na,,. Similarly, if
3. More about almost everywhere convergence
108
then f determines by a Poisson integral a harmonic function u on the upper half-plane. If is is the imaginary part of a suitable analytic completion of u, then û has boundary values Hf on R. The situation in case p 1 is too complicated and too interesting to be discussed here; it is already hard to prove that /EL" when fE LP for p> 1. We are studying the Hilbert transform here because we wish to establish in the next section the existence of the ergodic Hilbert transforms E LP( R)
J
1(x) = lim
f (Tsx)
ds,
for a flow { Ts }, and
(x) =
E k=1
f(T kx)— f (T -k x)
for a single transformation T. The existence of these limits was first proved by Cotlar (1955). We will use Caldenin's approach (1968), which transfers the real-variable theorems to the ergodic-theoretic context. The first step toward the maximal inequality for the Hilbert transform is a simple covering lemma. which seems to be due to Sierpinski and appears also in the paper of Wiener (1939). A version of this Lemma also holds in R".
Lemma 5A Let A be a bounded subset of and R and {' l ' 12 , ... In} a family of intervals which covers A. Then there is a subfamily {J 1 , J,} of intervals with disjoint interiors such that m(A)
3
E M(4). k=1
Proof: Again, by discarding some of the /k's we can produce a covering of A with the property that no more than two I's intersect at any one point. Choose J i to be an interval of maximal length among the remaining {/k }. We include J 1 in our subfamily, and we delete from A the interval J 1 and any of the lk that meet J 1 . There remains a set A l of measure m(A1) _›-m(A) — 3m(J 1 ).
Now repeat the process with A 1 , choosing an interval J 2 of maximal length from among the remaining /k's and deleting a set of measure at most 3m(J2). There remains a set A 2 of measure m(A2) m(A) — 3[m(J 1 ) + m(J 2 )1 At the eth stage, we remove the last of the /k's. Then we have
m(Jk ),
0 m(A) — 3 k= 1
3.5. The maximal inequality for the Hilbert transform
109
so that
m(A) k=1
A deep study of the function appearing in the following Lemma can be found in a paper of Boole (1857).
Lemma 5.2 If a l , a2 , ... a >0 and g(t) = each A> 0 ,
1" m{t:g(0> = — A i= 1
= m{r:g(t) < — A}.
Proof: Notice that gi(t)> 0 if tO Is, ,
snl, and
iim 00= °D
lim g(t) =
— t), then for
i
so that g has the following type of graph:
The set where g> A consists of exactly n intervals, as shown. There are exactly n points, m l , m 2 , ... m., with g(t) = A, and
1(s1
intg >
—
i=1
The mi are the roots of the equation
i-1
ai = si — t
which may be rewritten as
[ai i=1
ncsi _ 0].). n(s.-t), :1=1
110
3. More about almost everywhere convergence
or
n ( — On - 1 (E ai )t '1- I + ... = 2[ ( — lri n + ( — ir - i E si r - i i= 1
or
1 The coefficient of tn -1 is the negative of the sum of the roots; therefore
1 —A Ea.I
Ern. = Es.J and 1
E(si — mi)
If /3 1 ,
p
the roots of g(t)==
A., then
m{g < —1} =E(p i — si),
and for t = pi we have a E si —= t or
E ai ri (si t)= i=1 (—
j4i 1 (Ea
n (si t), j=1
I
=
A[( —
tn
—
1r '(s1 )t'1
+ •••_11 1
or tn—
1,
(Es, +-Lai )t" - + = 0, .1
so that EPi = Esi
Eaf
and
E(Pi
Eai.
i)
Theorem 5.3 There is a constant c such that if f EL1 (R) and 2> 0, then
mfs ER: sup E>o
dt E
t
,
<
1 fAli
3.5. The maximal inequality for the Hilbert transform
111
O. Let A be a closed and bounded subset
Proof: We suppose first that f of the set where
f(t) f(s — t) dt l > .1.. dtl= sup sup I 1Ief(s)1 = sup t e>0 1 firpse s>0 t — c "Ifil—sl For each s€ A there is an interval I, say of radius es , centered at s such that It'S
f (t) t—s
dt >
A finite number / 1 , / 2 , ... In of these intervals cover A. Let Pk}, with centers sk and radii ek , be as in Lemma 5.1. Then the J,, are pairwise disjoint,
m(A) -. Ç3Em(J k), and
110
> ,1
.4 f(t) tdt
for each k.
Since F(s) =f (t)dt - 03
is a continuous function of bounded variation and f(t) f rclk sk
—t
dt =
Lk
dF(t)
exists as a Riemann- Stieltjes integral, this integral can be approximated by its Riemann sums (Rudin 1953 p. 112):
1
E
ti
i
AFi =
E
Choose a partition t l , Jk such that
E 1
f(t)dt. Sk
ti
tn including the endpoints and centers sk of the
A FL
for each k.
— ti
Let us deal with the inequality
y Kai+
ipr.lk
AF. -1->2 s — ti
for s = sk
112
3. More about almost everywhere convergence
a similar argument will apply in case the sum is less than —À. The left side is a decreasing function of s, so the inequality holds for sk — Ek <s Sk . For each such s, then, either F. A
E s — ti' >z
or
A F. (rti ocJi, s
A
— ti
2
In the first case, by Lemma 5_2 s falls into a set of measure 2
YAF <2 11f III ,
and in the second case into a set of measure 2 ;3.
I
A F1
.
Taking the union on k, we find that a set of measure Eck is covered by a set of measure 21if 1111A (the set of the first case does not change with k) and a set of measure
v2
2
Lal
k
fi n ,i,. lic.lk
Thus (taking also into account the case when the Riemann sum is less than — A), we find that
2
f Il
and rn(A) 4 . .3Em(J k) = 61Ek --
f
1.
Of course in case f were negative a similar argument would apply. For an arbitrary f Ef COI
+ (s)i
- (s)i
so that, H*f > + *f > -
2
IL)
{
11*f
> -}, 2
and hence m{H*f>il}
96
„
„
96
3.6. The ergodic Hilbert transform
113
3.6. The ergodic Hilbert transform We will prove that if {Ti } is a measure-preserving flow on a probability space (X, a' , p) and f e On then
f(Trx) dt lim E- 0 + SE4 itpg. 1/, t exists a.e. A similar argument shows that for a single measure-preserving transformation T : X -- X. the series
Ax)=
f (T kx) — f (T - k x) k k= 1 L
converges a.e. (It might be conjectured that if f e L i with jf dp = 0, then in fact f(T kx) L k k= 1
converges a.e. However, this is not true; partial summation shows that if n Sn f = >f Tk. then
k=-- 1
f Tk v' S f L '1 k = n=1 L' n(n n+ 1) k=
f'
and we have seen (in 3.2. B) that the series on the right does not converge a.e. in general, even for f e Lœ.) The method of proof involves first establishing a weak-type (1, 1) inequality for the maximal function
fk(x)= sup >O
f (T‘ x) dtl. t E41t1<'-11E
Theorem 6.1 There is a constant c such that if f EV(X) and .1> 0, then
pIxEX: f h(x) > ;1- 1
-;ct II f I - -
Proof : Fix N and let
f (T x)'
fNk(X)= sup 1 E.?-*-
UN
t it14 1ft
' t w
dtl= sup E?' -
111■1
f
E4 I tI 4 iik
We will find a constant c independent of N such that
p{x:f 1,1 (x)> A}
;c1 li f II i for all fa,' ;
f(T_ fx) dt I
t
I.
114
3. More about almost everywhere convergence
the conclusion will follow upon letting N —> co. The technique, due to Calderbn, involves transferring the real-variable result of the previous section to the ergodic context by considering one orbit at a time and then applying Fubini's Theorem. This is similar to the idea behind Wiener's proof of the Local Ergodic Theorem, but this time the argument is a bit more complicated; in particular, certain truncations must be made, since in the ergodic case we cannot integrate over an entire orbit. Now H:g(t)= sup i
E>im
g(t — s) ds , cflsi . 5. 1/, s
for ge OR),
is a semilocal operator, in that the support of li:g is contained in a neighborhood of the support of g: g(s)
Hg(r) = sup
—
ds
Eqt--sille t — s
E>IIN
is 0 at points t which are farther than N from supp g. Let F(t, x) = f (Tx),
and
G(t, x) = H:F(t, x) = sup EiiiN
= sup EI/ 1V
ltis
f
F (t — s, x)
eflsr-g. 1/e
s
ds
f(Ti _x)1 ds = fsh(Tix). s 1411E
Then F(t, Tsx)= F(s + t, x) G(t, Tsx)= G(s + t, x),
so that for fixed t 1 and t 2' Rt i , X) and F(t 2 , x) are equimeasurable functions of,,x, as are GO 1 , x) and G(t 2 , x). Fix a > 0 and define f
F(t, x) if Iti a otherwise
F„(t, x) = 10 and
Ga(t, x) = H:FJ• , x)(t).
Now G(t, x) = HF = HI(F., x + (F — Fa+ 1,41 )) ..-Ç 11F., N ± H:(F — F.,N) and F — Fai_ N has support in It' > a + N, so H:(F — F0 + N) is 0 for itj-..ç. a,
3.6. The ergodic Hilbert transform
115
and hence G ‹G a+b,
roll/1
Fix A > 0, and let
E = (xE X :G(0, x)> A) = (xe X : 4,;(x)> A), E= {(t, x):G a+ x (t, x)> A}, and
E= {t:(t, y)€E}, Y
for ye X.
For any fixed teR, let
E'= {x:G(t, x)> A}; by the equimeasurability of the G(t,.), p(E) = p(E) for all t. Thus a
2ap(E) = .1 1 p(Eldt, -a and, since G
OD
= m x p(E)= f m(k)dp(x) x = f m{t:G a+ 1,,,(t, x)> A} dp(x) x
=I
m{t: I-4;Fa+ n )(t, x > 21 dp(x). x Thus, by the weak-type (1, 1) inequality for the real-variables Hilbert transform,
2a(E) f 516 IIF .„(t, x)11 v (d) dp(x) x 11 = 96 f foe 00 IFa + N (t , x)Idt c 112(x)
_ 9:af f
+N
96
X a+ N
1 F(t, x)Idtdp(x)
(a + N)
A - la +1*/) afX 96 ral- N =
Ai
-la +N)
IF(t,
96r+N f ( i F 0, x)14(x)dt A j - a +141) X 96
x)I dp(x)dt =
(
11f11 idt= 2(a + N)71 IlfIli.
116
3. More about almost everywhere convergence
Therefore a+ N 96
A 11 10
a
for each a > 0,
and letting a -) cc gives 96 P(E)
f
By an analogous argument, but convolving with a step-function kerne rather than lit, one can also obtain: Corollary 6.2 There is a constant c such that iffeL i (X) and ). > 0, then
E f( rx)— f (T kx)1I >
pfx:supl
)
". 1 k= 1
11?
We will now prove the existence a.e. of the ergodic Hilbert transforrr
J(x) = lim E -■ 0
fdt (Tix)
+ L1114
of a function fe 12(X). The pattern of proof is familiar: convergence iE established relatively easily for a dense subset of L', and then the maximal inequality is used to show that the set of functions for which convergence takes place is closed in L'. Theorem 6.3 If on a probability space (X.
: - cc
a). p) and fe LI (X), then the limit f(1x) di
f(x) = lim c-0* exists a.e. on X. Proof: With
VEf(x)=
f(Trx) dt ise41:1.-5. 1/, t
and
fh(x)= st;tE)1Kf (x)I, we know that h(x)
> 111I1 fII1 .
Let 9 be the subspace of Li (X) generated by all invariant functions and all functions of the form f çJJ
f(x) =
.f0(Tsx)(1)(s)ds, -co
3.6. The ergodic Hilbert transform
117
where fo EL(X) and 4)ESe l (R) has compact support and 0 integral. We will show that 1(x) exists a.e. if f E g and that 9 is dense in 1.1 . If f is a function of this form, then, with
k(t)
11 t
if E ‘.1t1 ‹-
1
0
otherwise
we have that Vi(x) =
(1)
4 G°
f -
f(T, x)dt —
k (t) f f o(Tr± ,x)4)(s)ds dt ao
=
f0(Tix)[k.* 4)(t)]dt. fo(T,x)k.(t — s)4)(s)dsdt = f-30 Let K s(s) = 1/s for I si E and 0 otherwise. We will show that (i) K.* v(t) converges for a.e. t as E 0, (ii) I K.* 4)(t)i g(t)E12(R), and 0 as E —> O. This will imply that k.* 4) converges in (iii) il k e * 4) — K r * 4)1 /2(R) as E —> 0, hence limr V.f(x) exists a.e. for our particular f. ..
o
To prove (i), write
K.* 4)(t)=
4) (s) ds =
is _ ti „...„ t
—s
4)(s)
fIs-0 i t — s
The first term is of course constant with respect to
f
4)(s) — 4)(t) ds = f OW i?....13-11>e
—
4)(s)
ds + f
I ?-31s— t1?---E t
E,
ds.
—S
white the second is
4)(t)
t s —
The integrand is bounded by an absolute constant and converges a.e. ds to [(4)(s) — 4)(t))/(t — s )] xv _ 1 .,± n(s), so the integrals converge as E —+ O. For (ii), suppose that supp 4) c [ — K, K]. If Id ?-. 2K, then
IK, * Ot)I = f cc K.(t — s)44s)ds =1 fc ° [K.(t — s) K.(t)]4)(s)dsl(because f oe 4)(s)ds = 0) - ix =
f [I( — — K e(01 44S) dS1 —K K
I _Kt
1
1
S
10( s) ds = fic
Isl
— Ki t' I t
Si
ios)i ds
T 2 for some constant c depending on 4).
118
3. More about almost everywhere convergence
If Iti ‘... 2K, then K,* Ot)= f cc K,(s)(At - s)ds = 11°'' K,(s)[0(t - s) - 4)(t)] ds .
c°
«t - s) - 00
fs4 is'
ds =
S
L
4*
-
s) - 4)(t)
s
lsK3K
ds,
which is again bounded by a constant. Thus 1K1 *4(t)1 ‘.(c 1/t2) +
c2XE-2K.2KI(t) e L l(R)For (iii), notice that k * Ot) and K,*(14t) only differ because ke(t — s) = 0 for it — si ..>.-- 1/e while K,(t — s) = 1/(t — s) for all large ft — si. Thus
Os) ds
K ,* OW - k,* 4(t) =
f is-ti?, im t - s Ot - s)
=
S
c ds 4-i-x4_ lle+K,Ile—Kr 0) t
as in (ii), and this tends to 0 in L1 . To show that the invariant functions tozether with all the functions f(x) = rj0(1 ix)0(t)dt are dense in L', it is enough to show that if hELŒ)(X) and Ix hf dp = 0 for all such f, then h is invariant. (By the HahnBanach Theorem, the closed subspace generated by g can be separated by a linear functional from any function not in it.) But
0 = ffhdp = f fo(x) f cc h(T_ 1x)0(t)dt dp(x) for all fo e/ ( X) A' - co implies that
f
h(T,x)4P(t)dt = 0 for all such 4).
- co
Considering a çf' (smooth) version (/) of (1/m(I))x1 — (I/m(J))xj where I and J are intervals and letting I and J shrink to arbitrary points shows that his a.e. constant along almost every orbit. Finally, let us show that the set g of all feL l(X) for which V,f(x) converges a.e. is closed in LI . Let fk eg, k = 1, 2, ... and suppose that fk -*f in V. Since I 1/,f(x) - Vef (x)I =IVE[fk + (f - fk)](x)4/,,[fk + (f- fk)](x)i
I
k( — ‘.- VE fx)
Ve fk(x)1 + 2 sup I
V.( f — fk)(x)f
n> 0 -
3.7. The filling scheme
119
and for fixed k the first term approaches 0 as e, el -> 0, we see that for any A > 0, ptx: lim sup I V f (x) - K. f(x)I > A} .E•-•ci À c ‹..pfx:supl V„(f - fk)(x)i > - } -di ilf - frill 2
which tends to 0 as k --, cc. Therefore {17Ef (x) } is fundamental a.e., and hence converges a.e. Remark 6.4 In most of the arguments of this type, we do not need the weak-type (1, 1) inequality for the full maximal function - such an inequality for an 'eventual' maximal function, in which the sup is replaced by a lim sup, would be sufficient. (This was Birkhoff's method in his proof of the Ergodic Theorem.) Also, for the purposes of the theorem on differentiation of integrals, the absolute value signs could have been moved outside the integral. However, there is a theorem of Stein (1961) according to which the existence of a convergence theorem frequently already forces the corresponding full maximal function to satisfy a weak-type (1, 1) inequality, so such apparent gains in power may be only illusory. Corollary 6.5 If T: X -- X is a m.o. and f eL 1 (X), then the series 7(x) =
E f(T kx) -Jk .( T -kx) '
k=1
converges a.e. Proof: Use Corollary 6.2 and mimic the proof of Theorem 6.3.
17. The filling scheme In the next few sections we undertake the proof of the ChaconOrnstein Ergodic Theorem (1960), an extremely general pointwise an result which includes many other ergodic theorems as special-vergnc cases. This theorem deals with an operator T:L i(X)-) L I(X), and thus it extends the case when T arises from a m.p.t. X -, X to situations that are found in interesting applications, for example in the theory of Markov processes. We will give the proof of the conservative case with the simplifications due to Neveu (1979), who saw how to base the argument on certain key features of the filling scheme. (The filling scheme appeared already in Chacon and Ornstein 1960).
120
3. More about almost everywhere convergence
We deal with a a -finite measure space (X, Al, IA and assume that T: L1 (X) —> Li ( X)
is a positive contraction: if0 ---Ç. fe L I , then 0 ...‹... Tf e L i , !I Tf
II 1 11 f 11 i
and
for all f eV.
Such a T is sometimes called a sub - Markov operator; if T*1 = 1, where T* is the adjoint of T on L''' (defined by J4 Tf dtt = j T*4).f dp. for all Oa,' and all J EL L) then T is called a Markov operator. The filling scheme is defined as follows. We begin with 0 -. Ç f, geLl . Think off as giving the amount of sand piled above each point of X and g as giving the depth of a hole below some points of X:
When we allow whatever sand will do so to fall into the hole, and consequently decrease the depth of the hole, we obtain a new sand function h+ = (f-g
)
and a new hole-depth function
h - = (f — g) - . (Thus h = h+ — h - = f — g.)
3.7. The filling scheme
121
Now we use the transformation T to transport the sand: at the next stage the sand has distribution Th+ , while the hole still has depth h - . When the sand and hole interact, the distribution of the outcome is given by h 1 = Th ±— h - . Continuing in this manner, we build a sequence 110 , h1 9 h 2, of L' functions. The inductive definition is ".
ho = h = f — g h , 1 = Tki- — h„- for n = 0,
1, 2, ...
A short proof of the Chacon-Ornstein Theorem, for the conservative ergodic case, will emerge (in the next section) from the observation that if Pulp
This just says that the depth of he hole continues to decrease at each point. Let H - = lim 1 h.- (the decreasing limit of the ii; ) and A = {H - > O}. (2) h.41,_ i -..ç. Th:
for all n ?--. 0
This says that after each time the sand is moved, some of it may fall into the hole. In fact this statement can be slightly strengthened. Notice that h: = 0 on A, since 11.-
H- > 0
on A.
Thus
h:, 1 --. .. Th: implies that in fact
h,, TO( Ach,” = (T M A.)h: (M A C denotes multiplication by the characteristic function of A% and
hence, by induction,
h:_,_ i --aç- (TM A cr1-1/1+
for n =0, 1, 2, ....
(3) If T is a Markov operatcr, so that j Tf dp = jf dp for all f eLl , then
T
hn + i dp = f h. dp for n = 0, 1, 2, ... .
This says that the difference between the amount of sand and the size of the hole remains constant under the hypothesis that T*1 = I. This automatically holds, as we shall see, in case T is conservative. Then for all n, (*)
f
h.dp —
f hdp = I h: dA — f h.- clit -- lim 1 f h: dit — j1-/ - dp. ■
122
3. More about almost everywhere convergence
The filling scheme is useful in ergodic theory because the sequence {h is related to the sequence of partial sums of { TAP, as the following Proposition shows. Proposition 7.1 Let 0 --.5.f, gEL I(X) and h =1— g. Then there are une Li with un ->- 0 a.e. and n-1
E
n-1
Tkf=
E h: + un and
k=0
/4=0
n-1
n-1
E rg = E
k=0
Tn-k-ih k-
+ u n for n = 1, 2, ....
k=0
Proof : We define U 0 = 0,
un = (g — h; i ) + Tu n _ i for n ?-- 1. We will prove by induction that these un satisfy the required equations.
For n = 1, the formulas say that
f = k; + u i ,---- h + +u = h+ + (g — h - ) + TO = f and
g = ho- +u 1 = h - +u = h - + (g — h - ) + TO = g. Note also that u 1 = g — h - ?..- 0 since g ..... h - . Assume now that the formulas hold for n, and let us prove them for n + 1. Notice that un+ 1 ?-- 0 since
g_11-
11;
by (1) above. Further,
Th: = hk+ 1 + h1 = hk++ 1 + (h; — hic-+ 1 ), so by induction n-1
T E T kf = T k=0
n-1
n-1
k=0
k=0
E h: + Tu
E hk++ i + (h - — h;) + Tun
3.7. The filling scheme
123
and hence n-1
n
E
TY = f + T
E
n-1
TY =f +
E h:+1 + (h - - g)
n + (g - h;")+ Tu n = E k + u, +1 ..--,...--, k=0 U n+ 1
(of course f - g + h - = h 4 ). For the other formula, by induction n-1
n-1
T E T kg = E T"h k- + Tun ; k=0
k=0
therefore n
n-1
I(0
k=0
E Tkg = g +
E Tn - khk- + Tun = g +
n
=E
n
E
T" -khx- - h; + Tun
k=0
_i_ u "k 1 n+1 •
Tn—kh—
k=0
Next we will use the filling scheme to establish the Hopf decomposition of X into a conservative part and a dissipative part with respect to T. Usually this decomposition is a corollary of the Hopf maximal ergodic theorem, but here we deduce both results from the filling scheme. (Actually the Hopf decomposition can be proved from scratch, as Exercise 2.3.2 does for a partial case (Foguel 1980).) The heart of the Chacon-Ornstein Theorem lies in the case when T is conservative and ergodic. If T:1_2(X) -- L I (X) is a positive contraction, then we say that T is conservative if CO
E
Tk u takes only the two values 0 and co a.e. k --o T is called conservative ergodic if 0--<-. ueLl (X) implies
c0
0 ‘. ueL 1(X), u 0
implies E Tku = oo a.e. k=0
Lemma 7.2 Let 0 < fi e L l with fi ll° a.e. and 0 < ge Li . Then the H - functions E H - associated with the ih=f1 - g increase to g a.e. as i-, op.
124
3. More about almost everywhere convergence
Proof: Since It decreases with i and the mapping h Th+ h - is increasing (since T is positive), the (ih)k decrease in i for fixed k. Therefore (1h)k- increases in i for fixed k and hence 1 1-1 -
= Jim (' 1 )1-:
increases with i. Also, th - g
and (from (1) and (2)), hdp = fh o+ dp - fig dp .?; f Th o+ dp - fig dp =
J
h 1 dp
1 implies ITizt, 0 .-S. P20+ dp), so that
(since II T II
h dp
hdp
Therefore, replacing h by 'h,
dp =
J -
-> lim l
(g
+ g)dp
h: dp -
)dp
W di - f dp.
O.
Now taking the limit as i - cc gives g a.e.
1 11 -
Proposition 7.3
f
If 0 u, v LAX), then E:'
CO
Tv = 0 a.e. on
00
x: y Tflu(x). oo n=1
y
Tv(x) < oc}.
, ni =
Proof: Let us show that r = 0 a.e. on the set in question; the stronger statement will follow upon replacing L.' by Tr for each n = 1, 2, .... We apply the Lemma to fi = u/i and g = u to find
lim But we claim that = 0, for each i, on {E ,0_ 0 u = cc , Enco_ 0 Tv 0 with n— 1
n-1
Tkox),
rfi(x)> k=0
k=0
so, by Proposition 7.1, there is an n with 1::(x) > 0. For this latter n, i h;(x) = 0, and hence also ih,;(x)= 0 for m n. Thus on this set if
= lim 1 1 17; = 0 a.e.
3.7. The filling scheme
125
Theorem 7.4 (Hopf Decomposition 1954) Choose any ue/2(X) with u(x) > 0 a.e. The set 00 C = {x : E T ku(x) = 00}, k=0 called the conservative part of X. is independent of u. D ----- X\C is called the dissipative part of X. If 0--<... ueL l , then Tk i4 < OC' a.e. on D. Proof: Let 0 < ye L l(X). By Proposition 7.3, y must be 0 a.e. on
Er 0
C(u)\C(v)c
{ETku =
co,
E Tkv < co},
so this set must have measure O. If 0--.‹.. u€L1 , there is u' > 0 with u' € LI and u'?.-- u a.e. Then Ekœ 0 TkUi < CO a.e. on D, so Er_ o Tku < co a.e. on D.
The adjoint operator T* on the dual L°(X) of /2(X) is also positive: 4) ..›.: 0 implies T* 4) ?• -• O. Sets E for which T* xE = xE a.e. are called invariant. Proposition 7.5 If T is conservative (i.e., X = C up to a set of measure 0) and 4)€/:°(X) with T* 4) -..‹.. 4) a.e., then T*4) =4) a.e. In particular, T* 1 = 1 when T is conservative (so that (3) above holds). Proof: We may suppose that 4) .?:- 0, by adding a constant if necessary. Choose 0 < ueLl with ( 4), u> = j 4)u dp < cc . (This is possible because X is a-finite.) Then for each n..?-. 1, n
o ...“ 0 - T*0, E =<40 ,0
--
n
Tk u> --=
y < 7-4:k0,14 > -
k=0 k=0 (T *n±1 40 ,0 -.Ç.<0,0<00
n+I
k =1
independently of n, so by Fatou's Lemma O
(4) - T*4), E
no < oc, ,
k=0 which is impossible, since Ek't 0 TkU = OC a.e., unless T*4) = 4) a.e. Of course T* 1--.‹.. 1 since j 1- Tf dp-..ç._ '1 f dp for each 0--'ç_feLl . Thus T*1 = 1:
J Tfdp = jf dp
for fe L i .
Exercises 1. Use measurable point transformations to construct examples of contractions of each of the following types: (a) conservative, (b) dissipative (i.e., D = X),
126
3. More about almost everywhere convergence (c) with both C and D nontrivial, (d) conservative ergodic, (e) nonconservative ergodic, (f) conservative nonergodic, (g) nonconservative nonergodic. 2. Show that when T is induced by a point transformation, D is generated by a wandering set (W, T W, T -2 W... pairwise disjoint) and the restriction of T to C is incompressible (T -1 B B implies p(B\T B) = 0). 3. Let .0 denote the family of all invariant subsets of C. (a) .0 is a a-algebra. (b) .1 coincides with the family of all sets of the form for 0 -.S.feLl . = (c) Tx, = xt on I implies ./e.0; lei implies Tx1 = xl on C. (d) These are equivalent for each non-negative measurable h on C: (i) Th %S. h on C, (ii) Th = h on C, (iii) h is .0-measurable on C. 4. Use the Filling Scheme to prove the formula
{>f
SA S
dp = ff dp
of 3.1. 3.8. The Chacon-Ornstein Theorem Theorem 8.1 (Chacon and Ornstein 1960) if (X, .4f, p) is a-finite,
0
f, geL l (X), and T: V(X)
L 1 (X) is a positive contraction, then
n- 1
T kf k =0 n- 1
Tkg k= o converges to a finite limit a.e. on fx: E17_ 0 Tkg(x)> 01. Remark: On C the limit can be identified as a quotient
E(j) Ec.(4) of conditional expectations of modifications of f and g with respect to the ø'-algebra of invariant subsets of C (see Foguel 1980, 1.3) while on D it is
3.8. The Chacon—Ornstein theorem
127
the quotient a,.
E
T kf
k=0 .17
E
Tkg
k=0
of two almost surely finite numbers. The main interest of the Chacon—Ornstein Theorem lies in the case when T is conservative. We will henceforth assume that T is conservative and ergodic; the general statement follows from this special case with some extra effort, which we will not undertake here. (See Foguel 1980 for a complete discussion.) Also, notice that the hypothesis f >.- 0 is not necessary, since the general statement could be proved by applying the theorem to f + and f separately. This Theorem does not yet imply that if T is a positive contraction on L', then -
._ i —E 1
n 1c0
rf
converges a.e. for eachfeli. In fact, such a statement is false (Chacon 1964). However, M. A. Akcoglu (1975) has shown that if 1 < p < x, and T is a positive contraction on LP, then 1/n EN 01 Tkf does converge a.e. for each fe LP. Suppose then that T: 12(X) --. L l (X) is a conservative, ergodic, positive contraction, 0 --aç.f,geL l ,h=f— g, and h 1 , h 2 .... are associated tof and g by the filling scheme. Let A = {x : II - (x)> 0} and, fa k = 0, 1, 2, ... ,
vk = (M A C T*)k z it . (If T were induced by a point transformation T: X —> X on a probability space, then we would have vk(x) = xi,,A=k1 (x), where nA (y) is the first entry time of y to A.) Lemma 8.2 If it(A)> 0, thei. Ek1=0 vk = 1 a.e. Proof: First we will prove by induction that n
E vk + ou,,, 7-4,r ,,,,, 1 a.e. k=0
128
3. More about almost everywhere convergence
For n = 0, the formula says that Vo — XA '
which is true. If the formula holds for n, then n+ I
E
vk
+
(M 4, T*)'
' x Ac
I=0
n 7.--
XA
+
( M AC
T * ){ E vk + wAcTinxAc} k=0
= XA + (%1 Ac T*)(1) = XA + XA. = 1 a-e-, since T*1 = 1 when T is conservative. Since the vk are non-negative, the (M A C T*r X A , decrease a.e. with n to w .?; O. We have y E I), + w ,-- 1, w= 0 on A, M Ac T * w ---- w. k= o e_, w Ilso_ w, by slight extension of The last equation implies thaat.e71 1f•% then T*Z -‹.. Z, so Proposition 7.5, T*w = w 7'=:- a-II T*Z = Z,) We need to show, then, that w = 0 a.e. Choose 0-....5feLl , f # 0, with suppf c A. Then
so that
f
t w dit = 0,
E
Tkf-wcIpt =
k=0
since EZ: 01 TY
T*wdp = ff - nwdp = 0; k=o
—
oc a.e., this is impossible unless w -- 0 a.e.
Proposition 8.3 If T is conservative ergodic and ha.' with H - * 0, then 30
lim i f h: clpt = 0 and n-0 ao •
E
h: < ao a.e.
n=0
(H - * 0 means Sf dp < f gdp, so that at the outset the size of the hole exceeds the amount of sand. The Proposition says that under this condition, in the conservative ergodic case, all the sand disappears eventually, and during the entire process only a finite amount of sand passes over each point of X.)
3.8. The Chacon-Ornstein theorem
129
Proof: We know from (2) in the preceding section that
-..ç(Tm Acrh+
M
h:
for n = 0, 1, 2,....
Therefore, for each n, k = 0, 1, 2, ... ,
f
h: vk dp
(TM /On h+ • vk dp = h+ (M Ac T*)n vk dp
= f 11+ un+kcillNow sum over k and use the Dominated Convergence Theorem to find that
dp q
JO
h+ E v„,„dp\,o as n . k= o since E/T_ 0 Vn k \ 0 a.e. as n --+ c. On the other hand, if we summed over n we would have
f
Eh:vk dp:--çfh'Eun , k dp -.4h + dp<
so that L"_ 0 1.1„ Gc a.e. on each Ek = Ek Vk > 0 ax. on X.
Irk > 01.
hence a.e. on X. since
Theorem 8.4 Let T: L'(X)-> L' (X ) be a conservative, ergodic, positive contraction and 0 f, ge L I (X). Then n-1
iim
yTkf
f fdp
Tkg
gdp
k=0
n—
y
1
k=0
a.e. on {x: Ekœt 0 Tk g(x)> 0 } . Proof: We suppose that g #0 and consider first the case when jfdp < jgdp. Let h =f- g and apply the filling scheme. Then Pi dp
y
n—
E
1
n—1 Tkf
lim sup kn—= °1 ?I
E
k=0
E
un +lim sup n _ 1
tç. lim sup kn—= 1°
T kg
E
k=0
T kg
E k=0
Tk g
!-Ç.
0 + 1=1.
130
3. More about almost everywhere convergence
Let n-1
E
rf
Q(fg)_k=0
.
n-1
E
rg
k=0
If p > 0, then Qn (pf, g) — pQ n (f, g).
Thus given arbitrary 0 -‹..f, g e /2 with g * 0, we can choose p > 0 so that j pf dp < jgdp and apply the above estimate to see that
1 lim sup Qn (f, g) .-<..— . 1)
f
gdp
Letting p 7
ff dp lim sup W .f. g) -‹.. n
. we find that
ff dp
. f gdp
1ffm-- 0, the result is obvious. Otherwise, we interchange fand g and use the information already gained to conclude that
1
f
f dp
lim inf 02(f g ) • — lim sup Qn(gf ) f gdp Finally, we show how the Hopf Maximal Ergodic Theorem, the usual starting point for the proof of operator ergodic theorems, follows from the filling scheme. (By Exercise 2, the implication can also be reversed.)
Theorem 8.5 Hopf Maximal Ergodic Theorem (1954) Let he L' (X) and n- 1
E = Ix: sup
s Tkh(x)›ol.
111 k=-0
Then t0. .- .? fEhdp
3.8. The Chacon-Ornstein theorem
131
Proof: Note that
{h > 0} c E c 11/ - = 01, since (as in the proof of Proposition 7.3) for each point of E we have (with/ - g = h = h + - h - ) n-1
E
n-1
E
T kf>
k=0
rg,
k=0
so by Proposition 7.1 h: > 0 for some n at each point of E. Again we find that
H - = Jim 4. h; = 0 a.e. on E. Thus
J
hdp ?--- -
J
H - dp
(see (*) in the preceding section, p. 121),
and hence Lhdp + fhdp .?--- - I IV dp - f 11 - dp = - f 11 - dp; Ec
E
Ec
Ec
however, since on EC we have h -.Ç. 0 so h =-- - h - , this also equals
hdp
-
f h - dp. Er
. i lE
We find that
JE
hdp
h - dp - p; f H- d fEc
Ec
but the latter expression is nonnegative, since h - ..•.- H - a.e. Exercises
L (Rost) If T is conservative ergodic, then (a) lim.„ 4, Sh: dp = 0 if and only if ihdp -.‹.. 0 (b) lirn Œ, ,t. f 11; dp = 0 if and only if f hdp ..- 0; Interpret in terms of sand and holes. 2. Prove Proposition 8.3 from the Hopf Maximal Ergodk Theorem. 3. Prove Hurewicz's Ergodic Theorem (1944): If T is nonsingular on (X, Al, p) (pT - pT -1 - it) and wn = dpr/dp for n = 0, 1, 2, ..., then for any feLi and any positive measurable g with n-1
E
1,0
g(T kx)w k (x) -+, x a.e.,
132
3. More about almost everywhere convergence the limit n-
E f(rx)w 4 (x) lim kn-=10
D
g(Tkx)w 4(x)
n -"
k =. 0
exists a.e. 4. Extend the Chacon-Ornstein Theorem to the case of a oneparameter group {T, : - GC < t < ) of positive contractions on Li(X). 5. Show that the Chacon-Ornstein Theorem for general T follows from the case when T is conservative. (Hint: Consider the restriction of T to Ll(C).)
4 More about recurrence
This chapter presents several further topics concerning recurrence and mixing. First is a direct construction (based on the theory of almost periodic functions) of eigenfunctions for m.p.t.s which are not weakly mixing. The second section presents the purely topological analogues of recurrence, ergodicity, and weak and strong mixing, and the third introduces Furstenberg's theory of multiple recurrence and his proof of the Szemerédi Theorem. In 4.4 we give the Jewett-Bellow-Furstenberg proof of the existence of uniquely ergodic topological representations of ergodic m.p.t.s. The final section examines two examples of weakly mixing m.p.t.s which are not strongly mixing: an example of Kakutani (which we show is not even topologically strongly mixing), and one of Chacon. which is also prime (i.e. without proper invariant sub-cr-algebras), as was discovered by del Junco.
4.1. Construction of eigenfunctions We will give now a more direct proof of the existence of eigenfunctions for m.p.t.s which are not weakly mixing. The idea, apparently due to Varadhan, Furstenberg, and Katznelson, is to reduce the statement to the existence of nontrivial characters on compact abelian groups. However, since this is itself usually proved with the help of the Spectral Theorem for compact operators, we will complete the argument by means of an elementary proof, which also introduces some important ideas from topological dynamics and the theory of almost periodic functions.
A. Existence of rigid factors Theorem 1.1 Let T be a m.p.t. on (X, .4, p). If T is ergodic but
T x T is not ergodic, then T has a factor which is an isometry on a compact metric space, hence a rotation on a compact abelian (even monothetic) group.
134
4. More about recurrence
Proof: Suppose that Tx T is not ergodic, and let G:X x X --• C be a nonconstant invariant function in L2(X x X). For x, ye X, define
d(x, y) = I1G(x, ') — G(Y , )112 -= .\I f IG(x, z) — G(y, z)I 2 dp(z).
x
That is, we have a map 1: X —■ L2(X) defined by /(x) = G(x, -), and d is the pull-back to X of the metric on L2(X): d(x, y) = II i(x) - 101 11 2Clearly d is a pseudo-metric on X (i.e., d is symmetric and satisfies the triangle inequality). Since G is T-invariant, T is an isometry of X with respect to d. We form the quotient metric space g" of X obtained by identifying points of X which are at zero distance from one another. The quotient map n: X —, )? is continuous, and if Anx, ny) = d(x, y), then ci. is a metric on g. We also obtain a map t: g -> g defined by t(nx) = n(Tx) (the definition is allowable since x — y if and only if Tx — Ty, where x — y means d(x, y) = 0). The measure p is carried to a Borel measure fi on Â. Notice that n is measurable since n' of an E-ball in (g, a) is an E-ball in (X, d), which is measurable because, looking at the definition of d, d is a measurable function of x and y. Notice that T is ergodic, since it is a factor of T. I claim now that g has more than one point. For if g is a singleton, then G(x,.)= G(y,.) in L2(X) for each x, ye X, so that g(u) = G(x, u) is invariant, and hence constant, for a.e. x. Next we will show that g is totally bounded (i.e., for each E > 0, g can be covered by finitely many E-balls). Notice first that if B(x) is an E-ball in X, with center x E X, then p(B c(x)) is a.e. a constant independent of x. For
p(.13.(x)) = p(TB c(x))= p(.13 c(Tx)), since p is T-invariant and T is an isometry with respect to d, so p(13,(x)) is an invariant function and hence, by ergodicity of T, must be a constant a.e. Call this constant cc . We next show that cc > O. First observe that (g, a) is separable. This is so because (g, a) is a (topological) subspace of L2, and L2(X) is separable and hence second countable, so (g, is second countable and hence separable. Thus g can be covered by countably many E-balls, and hence one of these must have positive measure. Since they all have measure c.,, however, it follows that cE > O. Thus fi(B)) = c, > 0 a.e. for each E > 0, with cc independent of 56 eg. By taking a sequence {E. decreasing to 0 and discarding a set of measure 0
a)
}
4.1. Construction of eigenfunctions
135
from g for each n, we may assume that
ii(Bc(i)) = c c >0 for all 2 E for each E = En . Now given any 6 > 0, choose n so that an < 5. We will show that finitely many 2E n-bal 1 s. and hence finitely many a-balls, cover R . Since is ergodic, OD
U Tk(13JZ)) 1
for each 2€ g.
k=o
Thus, fixing SEX, we may choose N so that tic(Ben(i))>
1—
Cc. .
k=0
Then
r kB,„(5E) kO
must hit every En-ball in
k=
o
g, and therefore
—rkB 2E„(i)
covers g We have shown, then, that g is totally bounded. It follows that the completion g of g is compact. i- - extends to an isometry T on X, and /.7 on A! extends to /I on g with
ii(g\g) =0. is a factor of (X, T, p); thus T is an ergodic isometry on the compact metric space X. It is an easy exercise to show that g is a compact abelian group and T is multiplication by a certain member of I (Exercise 1). Then any nontrivial character of g will produce an eigenfunction of T and hence of T.
(g, T,
B. Almost periodicity Suppose that T : X X is an ergodic isometry on a compact metric space X with respect to a Borel measure p which assigns positive measure to each nonempty open subset of X. (The system (g, T, ri) constructed in the preceding section has these properties.) We will show that
136
4. More about recurrence
if f is a continuous function on X and X0 E X, then { f (Tnx 0): n El} is an almost periodic sequence. A sequence fan :neZ} is called almost periodic (we write a€ AP) in case for each E > 0 the set of all pEZ for which suplan+ , — an i 0, there s a relatively dense set of n for which d(x, Tax)
For a moment, let us consider an arbitrary homeomorphism T on a compact metric space X. For each xE X, let e(x) = {Tax:neZ}. A nonempty closed T-invariant set M is called minimal if it contains no proper closed T-invariant subsets. M is minimal if and only if the orbit of each point of M is dense in M. The phrase 'almost periodic' is used in a slightly different way in topological dynamics: a point xe X is called almost periodic if for each e> 0 there is a relatively dense set of n such that d(x, Trix) < E. Theorem 1.2 (Gottschalk 1944). 0(x) is minimal if and only if x is
almost periodic. Proof : Suppose that x is almost periodic. Let yet(x) and let U be a compact neighborhood of x: if we can show that C(y)n U * 0, it will follow that xE(9(y), and hence (9(y) = 6(x). If R {n:TaxE U), then R is relatively dense, so there is a finite interval of integers 1 c iL such that Z = R + 1. Then, writing nx for Tax, 0(x) c (R + I)x c I(Rx) c I U. which is compact, so that 0(x)
IU.
Thus, since ye0(x), we have ye II/ and hence C(y)nU * 0Conversely, suppose that 0(x) is minimal and let U be an open neighborhood of x; we need to show that R In: Taxe U1 is relatively dense. Each point of (9(x) has an orbit which meets U; therefore, C(x)c J TU, neZ
4.1. Construction of eigenfunctions
137
and by compactness there are n 1 , n2 , ... ?I, such that (9(x)c T - n 1 U If neZ, we can find i 1. r such that Taxe T -14 U ; then
Tni- nixe U, so that n + ni e R, i.e., neR — n i . This shows that
Z= R —
nr } = U (R i--
so that R is relatively dense (finitely many translates of R cover 1). (This proof is written in language which allows it to extend easily to the case of actions of groups other than Z.) Remark 1.3 Uniform almost periodicity Since T is an ergodic isometry, this Theorem readily implies that T is in fact uniformly almost periodic. For each n =01 1, 2, ... the continuous function
f(x) = d(x, Tax)
must be constant on X, since fn(Tx)= f.(x). Thus d(x, Tax) < e exactly when d(y, Tay) < E, for any x, ye X. Since by Zorn's Lemma X contains minimal sets and hence almost periodic points, it follows that every point of X is almost periodic and {n:d(x, Tax) < c} is a relatively dense subset of Z independent of x for each >0. Remark 1.4 Dense orbits Let us note also that T has dense orbits. If {U, U 2 , is a countable base for the topology of X, let ...
}
X i = {xe X: there is n
0 with Tnxe Ui }.
Since T -"'X i X i and U. X i , so that p(X i) >0, we have p(X i) = 1 for each i. Thus ni x, has measure 1, and so in fact almost every orbit is dense. That T is an isometry, however, implies that every orbit is dense. For if xo € X has a dense orbit and x, ye X are given, then
d(Tax, y) < d(Tax,T" -"x0) d(T""x o , y) d(x, Tax o) + d(Tn"x o , y), which can be made arbitrarily small by appropriately choosing first m and then n. Thus our (X, T) is minimal. Remark 1.5 Uniform existence of mean values We will
show that
4. More about recurrence
138
for the ergodic isometry T, 1nlim- E
f(Tkx)
n—conk=0
exists uniformly for x EX for each feW(X). (This, together with the limit's being constant, is the condition that (X, T) be uniquely ergodic - there is exactly one T-invariant Borel probability measure on X.) Since for each f €(X) the functions 1nk=o by form an equicontinuous family which is uniformly bounded by the Arzela-Ascoli Theorem some subsequence {fni } converges uniformly on X. Of course the limit must be if dp, since f dp pointwise. This observation shows that (X, T) is uniquely ergodic: for if y is any T-invariant Borel probability measure on X, we have 1 ff. & = — E ni k=0
ifTkav= ff
f [ di]& = d,u,
since f dp uniformly; therefore y = p. Now if {f,,} failed to converge to ff d,u uniformly, we could find E > 0, mi op, and x, E X with .
—E
f(rx i)
-
M i k= 0
if
dp
c.
Define continuous linear functionals pi on W(X) by 1 fti(g)= — E g(Tkx i) for geW(X), mi k=0 and let y be a weak* limit point of {p 1 } . Then ff - ff dp1 ?- c;
but also y is T-invariant, since for geW(X) 1 mi -1 (gnmf(xi)
E
Mi k= 0
so that ,ui (gT) = (gT).„(x i)
and iti(g)= gmi(xi )
g(Tmixi) g(r 1 ' ,c1)=gm,(xi)+
rn,
g(xi)
139
4.1. Construction of eigenfunctions
differ by a term which tends to 0 as i —■ co. Since T is uniquely ergodic, this situation is impossible. Remark 1.6 This proof shows that if fEW(X), then
1 n— 1
-n E f(rx n )—■ f f dp
uniformly
k=0
for any choice of x, , x2 , ...EX. Remark L7 From 1.8 below, it will follow that each almost periodic sequence {an} has a mean value
I Al { an)
= hill -
n
n- 1
Ea
lc +nt'
k=- 0
the limit existing uniformly in m (even if m varies with n). Remark 1.8 A sequence {a n :nel) is almost periodic if and only if its orbit closure under translation, the set of all sequences {an _,J : nEZ},j €1, is totally bounded in the supremum norm. This statement is nothing more
than a paraphrase of the definition of almost periodicity: the e-balls centered at K consecutive translates of a will cover the set of all translates of a, provided that every interval of length K contains an e-period of f: given j, we find an e-period p and ajo in the consecutive set such that j = p+j o and note that I an+i — an+jo l = lan+ , + jo — anti° I < e
for all n.
(This characterization of almost periodicity (which Bochner (1927) showed to be equivalent to Bohr's for continuous functions on DI) was employed by Bocimer and von Neumann (1935) to define almost periodic functions on a general group G: a bounded function f :G —■ 01 is called left almost periodic if the set of all left translates off is totally bounded in the supremum norm. One can prove that f is left almost periodic if and only if it is right almost periodic. Most of the properties of almost periodic sequences that we are considering here are shared by all almost periodic functions on groups.) Now if T: X —> X is an ergodic isometry, x o c X, and f EW(X), then {f(Tnx0 ):nEZ} is an almost periodic sequence, since T is uniformly
140
4. More about recurrence
almost periodic. In fact, all almost periodic sequences arise in this way. For if Ian ) is an almost periodic sequence, its orbit closure 0 under the shift a is compact. Of course a is an isometry with respect to the supremum norm, and (û , cr) is uniquely ergodic. (In fact, 0 is a compact monothetic group, since it contains a dense copy of Z, and a is multiplication by a fixed element of n.) The function f which evaluates 0th coordinates will recover the sequence a: a(n) = f( rr a). (We could also form the function algebra generated by a given almost periodic sequence and its translates and consider the transformation on its maximal ideal space induced by translation.) We have established the following result. Remark 1.9 Almost periodic sequences are exactly those which come from ergodic isometries. Remark 1.10 The almost periodic sequences form an algebra. We will in fact prove a stronger result: If {an } and {b.} are almost periodic sequences, then {(a n , bn) } forms an !J 2 -valued almost periodic sequence. For if {an) comes from a pair (A, S) via a function f and a point ao , and {k} from (B, T) via g and 1)0 , then S x T is an isometry on A x B. Let X be the orbit closure of (a0 , /30) under S x T. Then (S x Tr(a 0 ,b0)= (an , bn), for neZ, forms an R2-valued almost periodic sequence, by 1.9. We also give the classical nondynamical proof of this observation. Given e> 0, let P. be the set of all le-periods of a. Choose K so that every interval of length K contains members of both P. and Pb . In each interval [(n — 1)K, nK), choose ;E Pa and fin ePb . We have —I( ....ç. an — fin
K
for all n.
Thus there are only finitely many possible values for the an — fin , and hence there is an no such that for each neZ an n' can be found with —no --<.. n' .-5. no and
an —
an , — fin, .
Then an — an. = 13, — fi,,., and each is an &period of its respective sequence. The spacing of these c-periods is (Œ,,+1 — ao + i ). ) — (OE, — cen ,) I
I
œn + iœ(n + 1 ) — Œ n'l
.,Ç. 2K + 2n0.
4.1. Construction of eigenfunctions
141
:n = 1, 2, is a relatively dense set of &periods for each Thus lan of a and b. Now clearly if {(a., b)1 is an 1 R 2-valued almost periodic sequence and f :ER 2 is continuous, then {f(a n , b.)} is an almost periodic sequence. Since multiplication is continuous, 1.10 follows. Remark 1.11 The set AP of all almost periodic sequences is uniformly closed.
C. Construction of the eigenfunction Recall that T is an isometry on a compact metric space X consisting of more than one point and that T is ergodic with respect to an invariant Borel probability measure p. We are trying to find a nonconstant OeL 2(X, p) for which there is EC with 4(Tx) = (j)(x) a.e. Choose any f&(X) which is not constant and for which If dp = 0, and fix xo e X. Write Ri) = f (T x 0) ( E74
This is an almost periodic sequence. Since rotation of the circle through any fixed angle 270, is an isometry, { e 2ninA.
nEZ}
is an almost periodic sequence for each )ER. By Remarks 1.10 and 1.7
there is a uniform mean value -1 f (j)e - 2Eij A l - lim
ax.(A) =
co
We define
nE f(j)
n =0
C -21tijA
n-1
h(x) = ax(A) = lim n—e• co n
E f(Tix)e
j=0
Then h, being a uniform limit of continuous functions of x, is continuous, and 1" -1 h(T x) = lim - E f(T
x) e -2/ti jA
n'co e21
n-1 A ii m E f(r n —,
i+ x) e-2ni(j+1).1. e21"h(x).
n j=0
We need then only select .1 so that h 0 0. E.g., if we can find a .01 such that h(x0) = a 0 (A) # 0,
we will be through.
•
.
-
C. 1 iLC
IL,. 441, 1
We will be able to find such a A by careful scrutiny of the almost periodic sequence { f(j)}. We will consider &periods (in fact tin-periods) p. of this sequence, and for each n pick a rational number kip ft for which f , 0 j
p — 1,
'best matches' e 2nijk,a/pn u
pn
1,
in that Pn
E f (fie -2 it ij k1p,
c > 0 for all n.
Pn jO The rational numbers knip. will converge to our eigenfrequency .1 for which 1 xo (;)
iirn
n-œ F n
E
f
a
Let xo e X and fE (6(X) be fixed. We will prove the following assertion: Theorem 1.12 If t f ( j)} is an almost periodic sequence for which Œ(.1) = MI f(j)e -276P} = 0 for all ileR then n-1 lim 11-4
E ifoor =o,
n k=0
and hence f (j) = 0 for all j. Since in our case f (j) = f (Tixo) for a continuous function f on X. it will follow that if all cxxo (À) are 0, then f (x) = 0 for all xE X. and so we will be finished. Theorem 1.12 is fundamental in the theory of almost periodic functions: it is the heart of Bohr's theorem characterizing AP as the uniform closure of the set of all trigonometric polynomials
an = E j e2ninkr jI
(see Bohr 1925a, 19256, 1926, 1932; Besicovitch 1954). Our proof reproduces the essential part of Bohr's original argument. We will prove Theorem 1.12 by means of a sequence of lemmas. The idea is to show first that if a(),)--- 0 for all A, then, because of a certain continuity property of mean values (Lemma 1.13), in fact n- 1 lim n-.co
E f (i)e -27riP.
n .fro
(Remark 1.14).
=
unifortilly
in Ile ER
4.1. Construction of eigenfunctions
143
Lemma 1.131f { f(j)} is an almost periodic sequence with M{ f) then for each E> 0 there are N and 6 > 0 such that
11 n -1
-n j=0 E Ai) e - 2/tij.1
whenever n..>-- N
GE
and
0,
I .1.1 < b.
Proof: Since M{ f} --- 0, given e> 0 we can find no such that 1 n-1 E f (k + Al< - for n ...- no and for all kEZ.
E
2
n j=0
For n> no , write n = lno + p with p < no . Choose (5 so small that 1 C -21tiil — 11 <
for I'll < 6
E 2
and j = 0, 1, ..., no -1.
1If IL
Then 1 n— I
nj=0
E - 1n0 + p k= E 0 jkno I /-1 `C' ‘. -1 L
fOle -2 ni" +
E
f(j)e -216P
j= Ino
1 t1 ,-1
e - 27tikno A ____
E
f(j + kno)e - 21tijA
no J-0
k=0
a
n-1
1— 1 (k+ 1)no— 1
1
1 I 1 n -1 Ape -2' 4A ± --/. I — no i=in.
E
Now the second term is bounded by 1 -1 11 fli Go , which tends to 0 as / -> while in the first term we have 1 no—
GO ,
I
— E f(j + kn no j=. 0
°
2
and
1 no -1 E f(j + kn0)e -2ni3)=0 Al + kn o ) - — — no j E O n j=0
1 ne — I ‹ —
E
n 0 j=0
!Ai+ kno)111 - e'il
so that n
1— n ID
E
j=
i Io-
f (j + kn o)e - 21diAl<
E.
0
Thus the first term is less than E, and hence the sum of the two is less than 2e, if n -,- ln o and 1 is large enough.
144
4. More about recurrence
Remark 1.14 It follows readily that if
Mt f(j)e - 21'42 } = 0
for all A E ER,
then 1 n— I
fim - E f(j)e' lil = 0 n •.1 _— U-
uniformly for AEk.
n—..x.
Now we want to choose kn eZ and 1/n-periods pn such that
I
1 P" — 1
E
f(j)e'li kriPn > c > 0
for aim .
Pr! k = 0 Then if kip. -■ 'I, we will be able to argue that oixo (t)# O. If it is not possible to choose such kn and p„, then we will see that the Ar of the following lemma tend to 0 uniformly in k as p -- Go .
Lemma 1.15 Let I P— I 11 (f ) = —
I f(j)e' li kiP for p = 1, 2, ... and k = 0, 1,... p - 1.
If lim p—Poo A k(P) = 0 uniformly in k, then 1 n—1 liM —
E ifoor =0
(and hence f7.,-- 0). Assume henceforth that the hypotheses of Lemma 1.15 are satisfied. The following sequence of lemmas will constitute a proof of Lemma 1.15. Since AP is an algebra, i n— I
E f(k + j)f (j)
g(k) = lim n ,,œ. x
exists uniformly in k. We need to prove that g(0) = O.
This will be accomplished by considering certain periodic functions related to f For a fi xed integer p, let F = PP) be the periodic sequence of period p for which F(k) = f (k)
for k = 0, 1, ... p - 1.
Fourier analysis on the finite abelian group Zp shows that if 1 g— 1
Ak =-- A (P) = —
E
pi=-,o
f(j)e - 27riikiP,k
-1
4.1. Construction of eigenfunctions
145
then 13- 1
E A
F(k) = F(P) (k)=
e 2lar kIP
r= 0
Further, either by direct calculation or knowledge of Parseval's formula, we see that p- I
p- I
1p-'
-P•=0 E ifor
E
E
PJ O
1Al2 II fe. , then
Lemma 1.16 If