Week 11 Worksheet

  1. Compute the entropy of the shift map on {0,1,2}N.
  2. Fix pN. Prove that T(x)=x+1mod1 on Z/p has zero entropy.
  3. Prove that the number wn of length n strings of zeroes and ones with no consecutive ones satisfies the recurrence w1=2w2=3wn+2=wn+1+wn for all nN.
  4. Fix 0<p1. Assuming the shift map on {0,1}N is ergodic, use the pointwise ergodic theorem to prove that Y=nN{x{0,1}N:x(n)=1x(n+1)=0} has zero measure for the (1p,p) coin measure.
  5. Let ν be the fair measure on {0,1,2}N. Prove that the shift on {0,1,2}N equipped with ν is not isomorphic to the shift on {0,1}N equipped with any fair coin measure.
  6. Determine the Markov measure on {x{0,1,2}N:x(n)=1x(n+1)1} and calculate its entropy.