Professional Documents
Culture Documents
4, 1982
A SIMPLE PROOF OF
SOME ERGODIC THEOREMS
BY
ABSTRACT
exists for ~-a.e. x, and f* is a T-invariant function with the same integral as f.
We adapt an idea of T. K a m a e [1] to give a simple proof of this result. It is
sufficient to deal with nonnegative functions and defining
fM (x) = min{f(x), M}
291
292 Y. KATZNELSONAND B. WEISS Isr. J. Math.
(1)
o
f,~(T;x)<= o
f(TSx)+ n(x)" e.
Now n(x) is everywhere finite so that there is some N for which the set
A = {x n ( x ) > N} "
is also valid. The crucial improvement is that now ti (x) is everywhere bounded
by N, while
Choosing now L so that NM/L < e and defining inductively n,,(x) = 0 and
where k(x) is the maximal k for which nk(x)<= L - I. Applying (i) to each of
the k(x) terms, and estimating by M the last L - nkc~(X)<=N - 1 terms we have
for all x
L-I L I
where the fact that f_->0 allows us to write L - 1 as the upper limit of the
summation. Integrating both sides and dividing by L gives
VOI. 42, 1982 S I M P L E P R O O F OF E R G O D I C T H E O R E M S 293
in light of (2) and the choice of L. It is here that we use the fact that T is measure
preserving. Letting e ~ 0 and M ~ oo gives half of what we wanted, namely
For the other half, fix e > 0 and define now n(x) as the least integer n _->1 for
which
1 ~ fiT,x)<= f ( x ) + e.
n o
n-I
(4) n =
we see that if f 4'd/~ > - c~, then the pointwise convergence a.e. of (1/n)[~ to 4'
implies convergence in L Lnorm. We have a similar, asymptotic, estimate with fN
instead of f~ in (4). Fix N > 1 and let n > N. For each i = 1 , 2 , . . . , N write
n=i+mN+k with k < N . Thenby(3)
m-I
f,.(x)<-f,(x) + ~ IN(T'N*'x)+fk(T'N*'X)
Nf,,(x) <
- ~'~ f , ( x ) + ~ fN(T'x)+ ~ f.-~-,,,N(T'N+'X)
i=1 j-O i=l
hence
fn(x)<--gK Y~ f,,(T'x)+
i=0
/,(x)+
i--I
/n_,_.,,(T'"+'x) .
As n---, oo the last two terms on the right converge to zero a.e. and, by the
ergodic theorem,
which implies
For points x where 4 ' ( x ) = -oo, (5) shows that the desired limit exists and
equals 4'(x). We restrict our attention to XM = {x : 4' (x ) => - M}, which is
T-invariant, and proceed to show that
and as U~XM ={x :~b(x)>-oo} this will complete the proof. For ease of
notation we will simply assume th(x)--> - M for all x.
As in the proof of the Birkhoff theorem fix an e > 0, set [~ = max{/, - M - 1},
and put
n(x)=min{n>=l:l f,(x)<=[M(x)+e}
Set A = {x : n ( x ) > N} where N is chosen so that
1
f ,~(x)a. <= f --f frd~ = f -Ef~,
1 d
f
<= fMdlz +, + .N(M+,)+NJ
L -~" l f, Ida..
Letting L ~ oo and using (8), we see that
REFERENCES
1. T. Kamae, A simple proof of the ergodic theorem using nonstandard analysis, Isr. J. Math. ,12
(1982), 284-290.
2. J. F. C. Kingman, Subadditive ergodic theory, Ann. Probab. 1 (1973), 883-909.
INSTITUTE OF MATHEMATICS
THE HEBREW UNIVERSITYOF JERUSALEM
JERUSALEM, ISRAEL