Books in black and white
 Books Biology Business Chemistry Computers Culture Economics Fiction Games Guide History Management Mathematical Medicine Mental Fitnes Physics Psychology Scince Sport Technics

# An introduction to ergodic theory - Walters P.

Walters P. An introduction to ergodic theory - London, 1982. - 251 p. Previous << 1 .. 39 40 41 42 43 44 < 45 > 46 47 48 49 50 51 .. 99 >> Next Wrf*. uTf) = to. Š£-Š/Š¢Šæ)) = Š¾
so gUTfāeV. ā”
Corollary 4.33.1 A Kolmogorov automorphism is strong-mixing.
Proof. By Theorem 2.12. ā”
Kolmogorov automorphisms are connected to entropy tncory by the following result (half of which was proved by Pinsker).
Theorem 4.3*4 (Rohlin and Sinai, ^ec Rohlin ) Let (X,n4,m) be a Lebesgue space unci let T: X ā> X be cm invertible measure-preserving transformation. Then T is a Kolmogorov automorphism iff h(T, sJ) > 0 for all finite sJ Ń Š.
4 pul.-Š¾ŃŃ
Remarks
\1) One says that T has completely positive -iruropy when the latter condition holds. Hence T has completely positive entropy ilT it is a Kolmogorov automorphism.
(2; This shows that Š automorphisms are "the opposites" of transformations with /ŠµŠ³Š¾ entropy (since h[T,.rV) = 0 V.c/ in the /.ŠµŠ³Š¾ cntrop) case).
(3) We aāready know from Cāorollary 4.14.4 that a Kolmogorov automorphism has positive entropy (since Š r T.V).
(4) It follows from Theorem 4.34 that if T-is a Kolmogorov automorphism ilien so is T'\ We know from Theorem -r.32(ii! That T~ 1 need not be a conjugate lo T.
(5) The result-, of Rohlin and Sinai (Roll.in , page 37) show thaT T is a Kolmogorov automorphism iff w icnevcr ./ is J r.niLC sub-algebra of Ā£ then Š.'=Š¾ V/=Ā« T~J rJ = J 'ā  ^llc ŃŠ°Šæ ŃŃŃ ^rom inis how much stronger the Kolmogorov properly is than strong-mixing because Sucheston has shown that T is strong-mixing iff for every subsequence Š of positive integers and every finite sub-alcebra s.J of /Š there exists a subsequence {bj) of Š with
. \/LHT-b'.'V = .r
\6) There is another result lhai shows the Kolmogorov property is a uniform strong-mixing condition. Let T be an invertible measure-preserving transformation of a Lebesgue .-.ruce (Š„,Š,Ń). For Š e j# and Šŗ > 0 let /A(B, k) denote the smallest ŃŃ-algebra containing all the sets T~"B for n > k. Then T is a Kolmogorov automorphism iff for all A, Š e ŠØ
lim sup |ni(4 n C) ā m(A)m{C)\ ā 0.
A x> Ce tf(tt.k)
In the following examples the word āautomorphismā is used in two senses. When we say āgroup automorphism of a compact groupā we mean automorphism in the sense of topological groups^ whereas in the terminology "Kolmogorov automorphismā the word autotrforphism refers to an invertible Structure preserving map of a probal^jity space.
\amplcs
(1) Group Automorphisms. Rohlin proved that any crgodic automorphism of a compact abelian metric group is a Kolmogorov automorphism  and later Yusinskii proved the theorem in the non-abelian case. . Kat/nelson [" i j has shown that crgodic automorphisms of fmue-dimensional tori are Bernoulli automorphisms. Lind  and Miles and Thomas  have proved, using different methods that any ergodic automorphism of a compact metric group is a Bernoulli automorphism.
(2) Markov Shifts. Let T be the two-sided (p, P) Markov-shift. We have seen that T is ergodic iff P is irreducible (i.e., V pairs of states i,j 3/i > 0 with pjf > 0) and T is strong mixing iff P is irreducible and aperiodic ^.e., ŠŠ' > 0 wilh p\j1 > 0 for all states /, /'). Friedman and Ornstein [l] h ive shown that
\$4.9 Bernoulli Automorphisms .md Kolmogorov Automorphisms
111
such a Markov shift is a Bernoulli automorphism. Therefore from the point of view of ergodic theory, mixing Markov chains are the same as Bernoulli automorphisms. One can easily dcduce that an ergodic Markov shift is the direct product of a Bernoulli automorphism and a rotation on a finite group.
The proof of Friedman and Ornstein consists of showing lhat a transformation with a certain property is isomorphic to a Bernoulli shift. This is a generalisation of the deep result of Ornitein (Theorem 4.28). It is however easy to show that the (p. P) Markov shift is a Kolmogorov automorphism iff P is aperiodic and irreducible. This generalises Theorem 4.30.
Theorem 4.35. The two-sided (p, P) Markov shift is a Kolmogorov uuto-morphism iff P is irreducible and aperiodic.
Proof. Let T denote the two sided (p, P) Markov shift and let (A, S), m) be the space on which it acts. If T is a Kolmogorov automorphism then T is strong-mixing (Corollary 4.33.1) and therefore P is irreducible and aperiodic (Theorem 1.27). Now suppose P is irreducible and aperiodic. Let Ā£ = {A0,Al,... be the natural partition into states at time zero i.e.
= {{*ā}-ŃŠ¾ Ā£ A|x0 = i). Let Š be the smallest c-algebra containing all sets in the partitions T~nĀ£, n > 0. i.e. Š ā \J*= 0 T~"s/(z)- Then Š <=. TJC and VĀ» = o Š¢ŠæŠ = ^ so it remains to show P|^=o Š¢~'Š = {Ń, A'}ā. We shall do this by generalising the argument used in the proof of Theorem 4.30 Recall from Theorem 1.27 that since P is irreducible and aperiodic we have lim,,^^ p-"' = pj for all states i, j. Suppose A is a cylinder block J[i0,..., irJu + r ar>d Š is a cylinder block b[y0,... with b -t- s < Sf. Then
m(A n B) = Pjlpjuji ā P.,-.-. so thal
The same inequality is true if A e \/anZra T~"s/{^) and Š e \/n=t T~"j#(38). Fix Š e \Jbn=% T~nsJ(c,) and fix N > b + s. Consider the collection Jl of all measurable sets A with Previous << 1 .. 39 40 41 42 43 44 < 45 > 46 47 48 49 50 51 .. 99 >> Next 