random bits and pieces - an introduction to symbolic dynamics
TRANSCRIPT
![Page 1: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/1.jpg)
Random Bits and PiecesAn Introduction to Symbolic Dynamics
Davar Khoshnevisan
Department of MathematicsUniversity of Utah
http://www.math.utah.edu/~davar
Undergraduate ColloquiumUniversity of UtahNovember 15, 2006
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 1 / 21
![Page 2: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/2.jpg)
Introduction
This is a talk about sequences of zeros and ones:
Random Number Generators;
Random search on a binary tree [philogenetic];
Binary encoding of numbers.
We work by examples, and in random order.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 2 / 21
![Page 3: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/3.jpg)
Introduction
This is a talk about sequences of zeros and ones:
Random Number Generators;
Random search on a binary tree [philogenetic];
Binary encoding of numbers.
We work by examples, and in random order.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 2 / 21
![Page 4: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/4.jpg)
Introduction
This is a talk about sequences of zeros and ones:
Random Number Generators;
Random search on a binary tree [philogenetic];
Binary encoding of numbers.
We work by examples, and in random order.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 2 / 21
![Page 5: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/5.jpg)
Introduction
This is a talk about sequences of zeros and ones:
Random Number Generators;
Random search on a binary tree [philogenetic];
Binary encoding of numbers.
We work by examples, and in random order.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 2 / 21
![Page 6: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/6.jpg)
Introduction
This is a talk about sequences of zeros and ones:
Random Number Generators;
Random search on a binary tree [philogenetic];
Binary encoding of numbers.
We work by examples, and in random order.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 2 / 21
![Page 7: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/7.jpg)
Introduction
This is a talk about sequences of zeros and ones:
Random Number Generators;
Random search on a binary tree [philogenetic];
Binary encoding of numbers.
We work by examples, and in random order.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 2 / 21
![Page 8: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/8.jpg)
Binary Encoding of Numbers
Let x be a number between zero and one.
We can write
x =x1
2+
x2
4+
x3
8+ · · ·
=∞∑j=1
xj
2j,
where x1, x2, . . . are either zero or one.
If there are two ways of doing this [dyadic rationals] then opt for thenon-terminating expansion.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 3 / 21
![Page 9: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/9.jpg)
Binary Encoding of Numbers
Let x be a number between zero and one.
We can write
x =x1
2+
x2
4+
x3
8+ · · ·
=∞∑j=1
xj
2j,
where x1, x2, . . . are either zero or one.
If there are two ways of doing this [dyadic rationals] then opt for thenon-terminating expansion.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 3 / 21
![Page 10: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/10.jpg)
Binary Encoding of Numbers
Let x be a number between zero and one.
We can write
x =x1
2+
x2
4+
x3
8+ · · ·
=∞∑j=1
xj
2j,
where x1, x2, . . . are either zero or one.
If there are two ways of doing this [dyadic rationals] then opt for thenon-terminating expansion.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 3 / 21
![Page 11: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/11.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 12: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/12.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 13: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/13.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 14: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/14.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 15: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/15.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 16: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/16.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 17: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/17.jpg)
Examples
We might write x = [x1 , x2 , . . .] instead of x = ∑∞j=1 2−jxj .
0 = [0 ,0 , . . .]
1 = [1 ,1 , . . .] because ∑∞j=1 2−j = 1
0.5 can be written in two different ways.
Here is one:
0.5 =1
2+
0
4+
0
8+ · · ·
Here is another:
0.5 =0
2+
1
4+
1
8+ · · ·
This works because ∑∞j=2 2−j = 1/2.
Infinite-option convention yields:
0.5 = [0 ,1 ,1 , . . .].
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 4 / 21
![Page 18: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/18.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 19: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/19.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 20: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/20.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 21: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/21.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 22: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/22.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 23: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/23.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 24: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/24.jpg)
An Algorithm for Finding the Digits
Let x be a fixed number between zero and one
Ask twenty-twenty style:
Is x ≤ 0.5? If yes then x1 = 0; else, x1 = 1
Is y1 = 2(x − 12x1) ≤ 0.5? If yes then x2 = 0; else, x2 = 1
Is y2 = 2(y1 − 12x2) ≤ 0.5? If yes then x3 = 0; else, x3 = 1
...
Why does this work? Hint:
y1 =∞∑j=1
xj+1
2j
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 5 / 21
![Page 25: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/25.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 26: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/26.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 27: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/27.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 28: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/28.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 29: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/29.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 30: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/30.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;
...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 31: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/31.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 32: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/32.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 33: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/33.jpg)
Symbolic Dynamics [An Alternative]
Split [0 ,1] into two subintervals [0 ,0.5] and (0.5 ,1];
If x falls in the left interval then x1 = 0; if x falls in the right one thenx1 = 1;
Call whichever [dyadic] interval x fell in last I1;
Split I1 into two subintervals each half the length of I1;
If x falls in the left one x2 = 0; if x falls in the right one x2 = 1;
Call whichever [dyadic] interval x fell in last I2;...
Try it for x = 0.5 0.5 = [0 ,1 ,1 , . . .]
What if you split into [0 ,0.5) and [0.5 ,1] etc.?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 6 / 21
![Page 34: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/34.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,
(j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 35: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/35.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,
(j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 36: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/36.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,
(j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 37: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/37.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,
(j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 38: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/38.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,(
j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 39: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/39.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,(
j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 40: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/40.jpg)
Dyadic Intervals
These are the intervals we obtained by subdividing.
A dyadic interval is a subintervals of [0 ,1] that has length 2−n forsome integer n ≥ 0.
A dyadic interval of length n ≥ 1 can be written as[j
2n,j + 1
2n
]if j = 0,2, . . . is even,(
j
2n,j + 1
2n
]if j = 1,3, . . . is odd
Let Dn denote all dyadic intervals of length 2−n.
#Dn = 2n (check!)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 7 / 21
![Page 41: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/41.jpg)
Uniform Sampling
Let X1,X2, . . . be independent random variables
Pr{Xj = 0} = Pr{Xj = 1} = 12 for all j ≥ 1
For all sequences a1, . . . , an of zeros and ones,
Pr{X1 = a1 , . . . ,Xn = an} =n
∏j=1
Pr{Xj = aj} =1
2n. (1)
Let X be a random variable who [random] binary digits areX1,X2, . . .. I.e.,
X =∞∑j=1
Xj
2j.
By (1), Pr{X ∈ I} = 2−n for all I ∈ Dn.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 8 / 21
![Page 42: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/42.jpg)
Uniform Sampling
Let X1,X2, . . . be independent random variables
Pr{Xj = 0} = Pr{Xj = 1} = 12 for all j ≥ 1
For all sequences a1, . . . , an of zeros and ones,
Pr{X1 = a1 , . . . ,Xn = an} =n
∏j=1
Pr{Xj = aj} =1
2n. (1)
Let X be a random variable who [random] binary digits areX1,X2, . . .. I.e.,
X =∞∑j=1
Xj
2j.
By (1), Pr{X ∈ I} = 2−n for all I ∈ Dn.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 8 / 21
![Page 43: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/43.jpg)
Uniform Sampling
Let X1,X2, . . . be independent random variables
Pr{Xj = 0} = Pr{Xj = 1} = 12 for all j ≥ 1
For all sequences a1, . . . , an of zeros and ones,
Pr{X1 = a1 , . . . ,Xn = an} =n
∏j=1
Pr{Xj = aj} =1
2n. (1)
Let X be a random variable who [random] binary digits areX1,X2, . . .. I.e.,
X =∞∑j=1
Xj
2j.
By (1), Pr{X ∈ I} = 2−n for all I ∈ Dn.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 8 / 21
![Page 44: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/44.jpg)
Uniform Sampling
Let X1,X2, . . . be independent random variables
Pr{Xj = 0} = Pr{Xj = 1} = 12 for all j ≥ 1
For all sequences a1, . . . , an of zeros and ones,
Pr{X1 = a1 , . . . ,Xn = an} =n
∏j=1
Pr{Xj = aj} =1
2n. (1)
Let X be a random variable who [random] binary digits areX1,X2, . . .. I.e.,
X =∞∑j=1
Xj
2j.
By (1), Pr{X ∈ I} = 2−n for all I ∈ Dn.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 8 / 21
![Page 45: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/45.jpg)
Uniform Sampling
Let X1,X2, . . . be independent random variables
Pr{Xj = 0} = Pr{Xj = 1} = 12 for all j ≥ 1
For all sequences a1, . . . , an of zeros and ones,
Pr{X1 = a1 , . . . ,Xn = an} =n
∏j=1
Pr{Xj = aj} =1
2n. (1)
Let X be a random variable who [random] binary digits areX1,X2, . . .. I.e.,
X =∞∑j=1
Xj
2j.
By (1), Pr{X ∈ I} = 2−n for all I ∈ Dn.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 8 / 21
![Page 46: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/46.jpg)
Zero-One Construction of Length [Lebesgue Measure]
We just argued that Pr{X ∈ I} = length(I ) for all dyadic intervals I .
General measure theory tells us that for all sets I ⊆ [0 ,1],
Pr{X ∈ I} = length(I ),
provided that we can attribute “length” to I .
X is “distributed uniformly on [0 ,1]”
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 9 / 21
![Page 47: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/47.jpg)
Zero-One Construction of Length [Lebesgue Measure]
We just argued that Pr{X ∈ I} = length(I ) for all dyadic intervals I .
General measure theory tells us that for all sets I ⊆ [0 ,1],
Pr{X ∈ I} = length(I ),
provided that we can attribute “length” to I .
X is “distributed uniformly on [0 ,1]”
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 9 / 21
![Page 48: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/48.jpg)
Zero-One Construction of Length [Lebesgue Measure]
We just argued that Pr{X ∈ I} = length(I ) for all dyadic intervals I .
General measure theory tells us that for all sets I ⊆ [0 ,1],
Pr{X ∈ I} = length(I ),
provided that we can attribute “length” to I .
X is “distributed uniformly on [0 ,1]”
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 9 / 21
![Page 49: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/49.jpg)
Borel’s Strong Law of Large Numbers
Recall X1,X2, . . . are independent, and
Xj =
{1, with probab. 1
2
0, with probab. 12 .
(Expectations)
EXj =
(1× 1
2
)+
(0× 1
2
)=
1
2for all j
(Borel’s Theorem, 1909) With probability one:
limn→∞
X1 + · · ·+ Xn
n= lim
n→∞EX1 + · · ·+ EXn
n=
1
2.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 10 / 21
![Page 50: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/50.jpg)
Borel’s Strong Law of Large Numbers
Recall X1,X2, . . . are independent, and
Xj =
{1, with probab. 1
2
0, with probab. 12 .
(Expectations)
EXj =
(1× 1
2
)+
(0× 1
2
)=
1
2for all j
(Borel’s Theorem, 1909) With probability one:
limn→∞
X1 + · · ·+ Xn
n= lim
n→∞EX1 + · · ·+ EXn
n=
1
2.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 10 / 21
![Page 51: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/51.jpg)
Borel’s Strong Law of Large Numbers
Recall X1,X2, . . . are independent, and
Xj =
{1, with probab. 1
2
0, with probab. 12 .
(Expectations)
EXj =
(1× 1
2
)+
(0× 1
2
)=
1
2for all j
(Borel’s Theorem, 1909) With probability one:
limn→∞
X1 + · · ·+ Xn
n= lim
n→∞EX1 + · · ·+ EXn
n=
1
2.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 10 / 21
![Page 52: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/52.jpg)
Normal Numbers
Borel’s theorem: With probab. one, limn→∞X1+···+Xn
n = 12 .
X1+···+Xnn is also the fraction of 1’s in the first n digits of X
Since Pr{X ∈ I} = length(I ),
Length
{x : asymp. fraction of ones =
1
2
}= 1.
A number x ∈ [0 ,1] is normal if limn→∞x1+···+xn
n = 12 .
Borel’s theorem: Nonnormal numbers are of length zero.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 11 / 21
![Page 53: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/53.jpg)
Normal Numbers
Borel’s theorem: With probab. one, limn→∞X1+···+Xn
n = 12 .
X1+···+Xnn is also the fraction of 1’s in the first n digits of X
Since Pr{X ∈ I} = length(I ),
Length
{x : asymp. fraction of ones =
1
2
}= 1.
A number x ∈ [0 ,1] is normal if limn→∞x1+···+xn
n = 12 .
Borel’s theorem: Nonnormal numbers are of length zero.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 11 / 21
![Page 54: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/54.jpg)
Normal Numbers
Borel’s theorem: With probab. one, limn→∞X1+···+Xn
n = 12 .
X1+···+Xnn is also the fraction of 1’s in the first n digits of X
Since Pr{X ∈ I} = length(I ),
Length
{x : asymp. fraction of ones =
1
2
}= 1.
A number x ∈ [0 ,1] is normal if limn→∞x1+···+xn
n = 12 .
Borel’s theorem: Nonnormal numbers are of length zero.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 11 / 21
![Page 55: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/55.jpg)
Normal Numbers
Borel’s theorem: With probab. one, limn→∞X1+···+Xn
n = 12 .
X1+···+Xnn is also the fraction of 1’s in the first n digits of X
Since Pr{X ∈ I} = length(I ),
Length
{x : asymp. fraction of ones =
1
2
}= 1.
A number x ∈ [0 ,1] is normal if limn→∞x1+···+xn
n = 12 .
Borel’s theorem: Nonnormal numbers are of length zero.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 11 / 21
![Page 56: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/56.jpg)
Normal Numbers
Borel’s theorem: With probab. one, limn→∞X1+···+Xn
n = 12 .
X1+···+Xnn is also the fraction of 1’s in the first n digits of X
Since Pr{X ∈ I} = length(I ),
Length
{x : asymp. fraction of ones =
1
2
}= 1.
A number x ∈ [0 ,1] is normal if limn→∞x1+···+xn
n = 12 .
Borel’s theorem: Nonnormal numbers are of length zero.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 11 / 21
![Page 57: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/57.jpg)
Normal Numbers
Normal numbers make sense also in base-ten arith. (or any other base ≥ 2for that matter):
x = ∑∞j=1 10−jxj , where xj ∈ {0 , . . . ,9}.
x is normal in base ten if
limn→∞
1
n
n
∑j=1
I{xj = 0} = · · · = limn→∞
1
n
n
∑j=1
I{xj = 9} =1
10.
Borel’s theorem: Almost every number is normal in base ten. In fact,almost every number is normal in all bases!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 12 / 21
![Page 58: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/58.jpg)
Normal Numbers
Normal numbers make sense also in base-ten arith. (or any other base ≥ 2for that matter):
x = ∑∞j=1 10−jxj , where xj ∈ {0 , . . . ,9}.
x is normal in base ten if
limn→∞
1
n
n
∑j=1
I{xj = 0} = · · · = limn→∞
1
n
n
∑j=1
I{xj = 9} =1
10.
Borel’s theorem: Almost every number is normal in base ten. In fact,almost every number is normal in all bases!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 12 / 21
![Page 59: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/59.jpg)
Normal Numbers
Normal numbers make sense also in base-ten arith. (or any other base ≥ 2for that matter):
x = ∑∞j=1 10−jxj , where xj ∈ {0 , . . . ,9}.
x is normal in base ten if
limn→∞
1
n
n
∑j=1
I{xj = 0} = · · · = limn→∞
1
n
n
∑j=1
I{xj = 9} =1
10.
Borel’s theorem: Almost every number is normal in base ten. In fact,almost every number is normal in all bases!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 12 / 21
![Page 60: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/60.jpg)
Amusing Facts
There are no numbers that are known to be normal in all bases.
(Champernowne, 1933) 0.1234567891011121314 . . . is normal in baseten
Champernnown’s number is also transcendental (Mahler)
(Copeland and Erdos, 1946) 0.23571113 . . . is normal in base ten[conjectured by Champernowne, 1933]
and a few others
Is π/10 normal? How about√
2/10?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 13 / 21
![Page 61: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/61.jpg)
Amusing Facts
There are no numbers that are known to be normal in all bases.
(Champernowne, 1933) 0.1234567891011121314 . . . is normal in baseten
Champernnown’s number is also transcendental (Mahler)
(Copeland and Erdos, 1946) 0.23571113 . . . is normal in base ten[conjectured by Champernowne, 1933]
and a few others
Is π/10 normal? How about√
2/10?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 13 / 21
![Page 62: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/62.jpg)
Amusing Facts
There are no numbers that are known to be normal in all bases.
(Champernowne, 1933) 0.1234567891011121314 . . . is normal in baseten
Champernnown’s number is also transcendental (Mahler)
(Copeland and Erdos, 1946) 0.23571113 . . . is normal in base ten[conjectured by Champernowne, 1933]
and a few others
Is π/10 normal? How about√
2/10?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 13 / 21
![Page 63: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/63.jpg)
Amusing Facts
There are no numbers that are known to be normal in all bases.
(Champernowne, 1933) 0.1234567891011121314 . . . is normal in baseten
Champernnown’s number is also transcendental (Mahler)
(Copeland and Erdos, 1946) 0.23571113 . . . is normal in base ten[conjectured by Champernowne, 1933]
and a few others
Is π/10 normal? How about√
2/10?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 13 / 21
![Page 64: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/64.jpg)
Amusing Facts
There are no numbers that are known to be normal in all bases.
(Champernowne, 1933) 0.1234567891011121314 . . . is normal in baseten
Champernnown’s number is also transcendental (Mahler)
(Copeland and Erdos, 1946) 0.23571113 . . . is normal in base ten[conjectured by Champernowne, 1933]
and a few others
Is π/10 normal? How about√
2/10?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 13 / 21
![Page 65: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/65.jpg)
Amusing Facts
There are no numbers that are known to be normal in all bases.
(Champernowne, 1933) 0.1234567891011121314 . . . is normal in baseten
Champernnown’s number is also transcendental (Mahler)
(Copeland and Erdos, 1946) 0.23571113 . . . is normal in base ten[conjectured by Champernowne, 1933]
and a few others
Is π/10 normal? How about√
2/10?
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 13 / 21
![Page 66: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/66.jpg)
Random-Number Generators
Your computer generates X uniformly between 0 and 1.
Is it the case that X has the correct distribution?
The binary digits X1,X2, . . . have lots of structure; so they need topass various statistical tests (lots known)
All RNG’s will fail the true test of randomness: Xj ’s have to benormal in all bases.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 14 / 21
![Page 67: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/67.jpg)
Random-Number Generators
Your computer generates X uniformly between 0 and 1.
Is it the case that X has the correct distribution?
The binary digits X1,X2, . . . have lots of structure; so they need topass various statistical tests (lots known)
All RNG’s will fail the true test of randomness: Xj ’s have to benormal in all bases.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 14 / 21
![Page 68: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/68.jpg)
Random-Number Generators
Your computer generates X uniformly between 0 and 1.
Is it the case that X has the correct distribution?
The binary digits X1,X2, . . . have lots of structure; so they need topass various statistical tests (lots known)
All RNG’s will fail the true test of randomness: Xj ’s have to benormal in all bases.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 14 / 21
![Page 69: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/69.jpg)
Random-Number Generators
Your computer generates X uniformly between 0 and 1.
Is it the case that X has the correct distribution?
The binary digits X1,X2, . . . have lots of structure; so they need topass various statistical tests (lots known)
All RNG’s will fail the true test of randomness: Xj ’s have to benormal in all bases.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 14 / 21
![Page 70: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/70.jpg)
Ternary Expansions
Let x = [0 ,1], and write uniquely,
x =∞∑j=1
xj
3j, where xj ∈ {0 ,1 ,2}.
The ternary Cantor set C :
C = closure of {x ∈ [0 ,1] : xj ∈ {0 ,2}}
x = 1/3 is in the Cantor set; in fact, x = [0 ,2 ,2 , . . .]
If 13 < x < 2
3 then x 6∈ C etc.
C = The middle-thirds Cantor set
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 15 / 21
![Page 71: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/71.jpg)
Ternary Expansions
Let x = [0 ,1], and write uniquely,
x =∞∑j=1
xj
3j, where xj ∈ {0 ,1 ,2}.
The ternary Cantor set C :
C = closure of {x ∈ [0 ,1] : xj ∈ {0 ,2}}
x = 1/3 is in the Cantor set; in fact, x = [0 ,2 ,2 , . . .]
If 13 < x < 2
3 then x 6∈ C etc.
C = The middle-thirds Cantor set
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 15 / 21
![Page 72: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/72.jpg)
Ternary Expansions
Let x = [0 ,1], and write uniquely,
x =∞∑j=1
xj
3j, where xj ∈ {0 ,1 ,2}.
The ternary Cantor set C :
C = closure of {x ∈ [0 ,1] : xj ∈ {0 ,2}}
x = 1/3 is in the Cantor set; in fact, x = [0 ,2 ,2 , . . .]
If 13 < x < 2
3 then x 6∈ C etc.
C = The middle-thirds Cantor set
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 15 / 21
![Page 73: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/73.jpg)
Ternary Expansions
Let x = [0 ,1], and write uniquely,
x =∞∑j=1
xj
3j, where xj ∈ {0 ,1 ,2}.
The ternary Cantor set C :
C = closure of {x ∈ [0 ,1] : xj ∈ {0 ,2}}
x = 1/3 is in the Cantor set; in fact, x = [0 ,2 ,2 , . . .]
If 13 < x < 2
3 then x 6∈ C etc.
C = The middle-thirds Cantor set
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 15 / 21
![Page 74: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/74.jpg)
Ternary Expansions
Let x = [0 ,1], and write uniquely,
x =∞∑j=1
xj
3j, where xj ∈ {0 ,1 ,2}.
The ternary Cantor set C :
C = closure of {x ∈ [0 ,1] : xj ∈ {0 ,2}}
x = 1/3 is in the Cantor set; in fact, x = [0 ,2 ,2 , . . .]
If 13 < x < 2
3 then x 6∈ C etc.
C = The middle-thirds Cantor set
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 15 / 21
![Page 75: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/75.jpg)
Devil’s Staircase
Let X1,X2, . . . be independent,
Pr{X1 = 0} = Pr{X1 = 2} =1
2.
Let X be “uniformly distributed” on C ; i.e.,
X =∞∑j=1
Xj
3j=⇒ Pr{X ∈ C } = 1.
Distribution function of X ,
F (x) := Pr{X ≤ x} “devil’s staircase”
Aka Cantor–Lebesgue function
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 16 / 21
![Page 76: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/76.jpg)
Devil’s Staircase
Let X1,X2, . . . be independent,
Pr{X1 = 0} = Pr{X1 = 2} =1
2.
Let X be “uniformly distributed” on C ; i.e.,
X =∞∑j=1
Xj
3j=⇒ Pr{X ∈ C } = 1.
Distribution function of X ,
F (x) := Pr{X ≤ x} “devil’s staircase”
Aka Cantor–Lebesgue function
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 16 / 21
![Page 77: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/77.jpg)
Devil’s Staircase
Let X1,X2, . . . be independent,
Pr{X1 = 0} = Pr{X1 = 2} =1
2.
Let X be “uniformly distributed” on C ; i.e.,
X =∞∑j=1
Xj
3j=⇒ Pr{X ∈ C } = 1.
Distribution function of X ,
F (x) := Pr{X ≤ x} “devil’s staircase”
Aka Cantor–Lebesgue function
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 16 / 21
![Page 78: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/78.jpg)
Devil’s Staircase
Let X1,X2, . . . be independent,
Pr{X1 = 0} = Pr{X1 = 2} =1
2.
Let X be “uniformly distributed” on C ; i.e.,
X =∞∑j=1
Xj
3j=⇒ Pr{X ∈ C } = 1.
Distribution function of X ,
F (x) := Pr{X ≤ x} “devil’s staircase”
Aka Cantor–Lebesgue function
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 16 / 21
![Page 79: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/79.jpg)
The Cantor–Lebesgue Function
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 10
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
x
the
cant
or−
lebe
sgue
func
tion
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 17 / 21
![Page 80: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/80.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 81: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/81.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 82: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/82.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 83: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/83.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 84: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/84.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 85: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/85.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 86: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/86.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 87: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/87.jpg)
The Cantor–Lebesgue Function
Theorem (Cantor)
C := {x : F ′(x) exists and is = 0} has length one.
F is nondecreasing and continuous
F (0) = 0
F (1) = 1
Fundamental theorem of calculus(?):
1 = F (1)− F (0) =Z 1
0F ′(x)dx = 0
Mind those technical conditions of theorems!
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 18 / 21
![Page 88: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/88.jpg)
Hausdorff Dimension
Let S be a set in Rn. Roughly speaking, its Hausdorff dimension
dimH
S := max
{s ∈ [0 ,n] : E
(1
‖X −Y ‖s
)<∞
},
where X and Y are:
independent;
both distributed “uniformly” on S
(Frostman, 1935)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 19 / 21
![Page 89: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/89.jpg)
Hausdorff Dimension
Let S be a set in Rn. Roughly speaking, its Hausdorff dimension
dimH
S := max
{s ∈ [0 ,n] : E
(1
‖X −Y ‖s
)<∞
},
where X and Y are:
independent;
both distributed “uniformly” on S
(Frostman, 1935)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 19 / 21
![Page 90: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/90.jpg)
Hausdorff Dimension
Let S be a set in Rn. Roughly speaking, its Hausdorff dimension
dimH
S := max
{s ∈ [0 ,n] : E
(1
‖X −Y ‖s
)<∞
},
where X and Y are:
independent;
both distributed “uniformly” on S
(Frostman, 1935)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 19 / 21
![Page 91: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/91.jpg)
Hausdorff Dimension
Let S be a set in Rn. Roughly speaking, its Hausdorff dimension
dimH
S := max
{s ∈ [0 ,n] : E
(1
‖X −Y ‖s
)<∞
},
where X and Y are:
independent;
both distributed “uniformly” on S
(Frostman, 1935)
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 19 / 21
![Page 92: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/92.jpg)
Dimension of the Cantor Set
Theorem (Hausdorff, 1919)
dimH
C = log3(2) = ln2/ ln 3 ' 0.7615
Strategy: Let X and Y be uniformly distributed on C , both independent.Then we wish to demonstrate that:
if s > log3(2) then E (|X −Y |−s) =∞;
if s < log3(2) then E (|X −Y |−s) <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 20 / 21
![Page 93: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/93.jpg)
Dimension of the Cantor Set
Theorem (Hausdorff, 1919)
dimH
C = log3(2) = ln2/ ln 3 ' 0.7615
Strategy: Let X and Y be uniformly distributed on C , both independent.Then we wish to demonstrate that:
if s > log3(2) then E (|X −Y |−s) =∞;
if s < log3(2) then E (|X −Y |−s) <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 20 / 21
![Page 94: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/94.jpg)
Dimension of the Cantor Set
Theorem (Hausdorff, 1919)
dimH
C = log3(2) = ln2/ ln 3 ' 0.7615
Strategy: Let X and Y be uniformly distributed on C , both independent.Then we wish to demonstrate that:
if s > log3(2) then E (|X −Y |−s) =∞;
if s < log3(2) then E (|X −Y |−s) <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 20 / 21
![Page 95: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/95.jpg)
Dimension of the Cantor Set
Theorem (Hausdorff, 1919)
dimH
C = log3(2) = ln2/ ln 3 ' 0.7615
Strategy: Let X and Y be uniformly distributed on C , both independent.Then we wish to demonstrate that:
if s > log3(2) then E (|X −Y |−s) =∞;
if s < log3(2) then E (|X −Y |−s) <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 20 / 21
![Page 96: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/96.jpg)
Finally, a Proof
Let us prove that if s < log3(2) then E (|X −Y |−s) <∞. This provesthat dim
HC ≥ log3(2), and is in fact the harder bound.
Let N := min{j ≥ 1 : Xj 6= Yj}; then Pr{N > k} = 2−k for all k ≥ 0.
Therefore, Pr{N = k} = Pr{N > k − 1}− Pr{N > k} = 2−k .
We have1
|X −Y |s ≤1
3Ns
If s < log3(2) then
E
(1
|X −Y |s
)≤ E
(1
3Ns
)=
∞∑k=1
1
3ks× 2−k <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 21 / 21
![Page 97: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/97.jpg)
Finally, a Proof
Let us prove that if s < log3(2) then E (|X −Y |−s) <∞. This provesthat dim
HC ≥ log3(2), and is in fact the harder bound.
Let N := min{j ≥ 1 : Xj 6= Yj}; then Pr{N > k} = 2−k for all k ≥ 0.
Therefore, Pr{N = k} = Pr{N > k − 1}− Pr{N > k} = 2−k .
We have1
|X −Y |s ≤1
3Ns
If s < log3(2) then
E
(1
|X −Y |s
)≤ E
(1
3Ns
)=
∞∑k=1
1
3ks× 2−k <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 21 / 21
![Page 98: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/98.jpg)
Finally, a Proof
Let us prove that if s < log3(2) then E (|X −Y |−s) <∞. This provesthat dim
HC ≥ log3(2), and is in fact the harder bound.
Let N := min{j ≥ 1 : Xj 6= Yj}; then Pr{N > k} = 2−k for all k ≥ 0.
Therefore, Pr{N = k} = Pr{N > k − 1}− Pr{N > k} = 2−k .
We have1
|X −Y |s ≤1
3Ns
If s < log3(2) then
E
(1
|X −Y |s
)≤ E
(1
3Ns
)=
∞∑k=1
1
3ks× 2−k <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 21 / 21
![Page 99: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/99.jpg)
Finally, a Proof
Let us prove that if s < log3(2) then E (|X −Y |−s) <∞. This provesthat dim
HC ≥ log3(2), and is in fact the harder bound.
Let N := min{j ≥ 1 : Xj 6= Yj}; then Pr{N > k} = 2−k for all k ≥ 0.
Therefore, Pr{N = k} = Pr{N > k − 1}− Pr{N > k} = 2−k .
We have1
|X −Y |s ≤1
3Ns
If s < log3(2) then
E
(1
|X −Y |s
)≤ E
(1
3Ns
)=
∞∑k=1
1
3ks× 2−k <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 21 / 21
![Page 100: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/100.jpg)
Finally, a Proof
Let us prove that if s < log3(2) then E (|X −Y |−s) <∞. This provesthat dim
HC ≥ log3(2), and is in fact the harder bound.
Let N := min{j ≥ 1 : Xj 6= Yj}; then Pr{N > k} = 2−k for all k ≥ 0.
Therefore, Pr{N = k} = Pr{N > k − 1}− Pr{N > k} = 2−k .
We have1
|X −Y |s ≤1
3Ns
If s < log3(2) then
E
(1
|X −Y |s
)≤ E
(1
3Ns
)=
∞∑k=1
1
3ks× 2−k <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 21 / 21
![Page 101: Random Bits and Pieces - An Introduction to Symbolic Dynamics](https://reader031.vdocument.in/reader031/viewer/2022022804/621b1ed601c6a56bb7452ac5/html5/thumbnails/101.jpg)
Finally, a Proof
Let us prove that if s < log3(2) then E (|X −Y |−s) <∞. This provesthat dim
HC ≥ log3(2), and is in fact the harder bound.
Let N := min{j ≥ 1 : Xj 6= Yj}; then Pr{N > k} = 2−k for all k ≥ 0.
Therefore, Pr{N = k} = Pr{N > k − 1}− Pr{N > k} = 2−k .
We have1
|X −Y |s ≤1
3Ns
If s < log3(2) then
E
(1
|X −Y |s
)≤ E
(1
3Ns
)=
∞∑k=1
1
3ks× 2−k <∞.
D. Khoshnevisan (Salt Lake City, Utah) UofU: U-Coll ’06 21 / 21