Symbolic Dynamics
Shift Space The Bernoulli Shift Map
Shift Space
We denote the shift space by Σ + which consists of all infinite sequences of symbols
s = s 1 s 2 … s n … Bernoulli Shift Map
σ : Σ + → Σ + σ ( s 1 s 2 … s n … ) = s 2 s 3 … s n … Metric in Shift Space
δ = { 0 x = y 1 x ≠ y
d ( s , t ) = ∑ i = 1 ∞ δ ( s i , t i ) 2 i
d ( s , t ) ≥ 0
d ( s , t ) = d ( t , s )
d ( s , t ) + d ( t , q ) ≥ d ( s , w )
So ( Σ + , d ) is a metric space
Upper Bound of Distance
s , t ∈ Σ + where the first p terms are identical
s 1 = t 1 , s 2 = t 2 , … , s p = t p Then
d ( s , t ) ≤ 1 2 p Proof:
d ( s , t ) = ∑ i = 1 ∞ δ ( s i , t i ) 2 i = ∑ i = 1 p δ ( s i , t i ) 2 i + ∑ i = p + 1 ∞ δ ( s i , t i ) 2 i = ∑ i = p + 1 ∞ δ ( s i , t i ) 2 i ≤ ∑ i = p + 1 ∞ 1 2 i = 1 2 p Periodic Orbits
If s = s 1 s 2 … s k s 1 s 2 … s k s 1 …
σ ( s ) = s 2 … s k s 1 s 2 … s k s 1 … σ ( 2 ) ( s ) = s 3 … s k s 1 s 2 … s k s 1 … … σ ( k ) ( s ) = s 1 s 2 … s k s 1 s 2 ⋯ = s Properties:
Countably many periodic orbits. For each fixed period k ∈ N there are only finitely many k -periods
The periodic points are dense in the shift space:
∀ ε > 0 , ∃ n ∈ N , s.t 2 − n < ε Bound:
For any s = s 1 s 2 s 3 … s n s n + 1 ∈ Σ + construct t = s 1 s 2 s 3 … s n s 1 s 2 s 3 … s n s 1 s 2 s 3 … where d ( s , t ) < 2 − n < ε
Dense Orbit
What to prove there exists an s ∗ ∈ Σ + whose orbit
O σ ( s ∗ ) = { s k = σ ( k ) ( s ∗ ) , k ∈ N } is a dense subset of Σ + .
We construct s ∗ explicitly:
s 1 = 1 , s 2 = 1
s 3 s 4 = 00 , s 5 s 6 = 01 , s 7 s 8 = 10 , s 9 s 10 = 11
s 11 s 12 s 13 = 000 , s 14 s 15 s 16 = 001 , s 17 s 18 s 19 = 010 , s 20 s 21 s 22 = 011 , s 23 s 24 s 25 = 100 , s 26 s 27 s 28 = 101 , s 29 s 30 s 31 = 110 , s 32 s 33 s 34 = 111
…
keeping concatenating all string of length k consisting of 0 and 1
Take any t ∈ Σ + s.t t = t 1 t 2 t 3 … . for any p ∈ N there exists a
σ ( m ) ( s ∗ ) = t 1 t 2 t 3 … t p so that for any ε > 0 there exists an m such that:
d ( s ∗ , t ) < 1 2 p < ε Dynamic Behaviours and Chaos
Devaney's Definition of Chaos
Let f : X → X on a metric space ( X , d ) . X is chaotic under f we have all of the following:
Topological transitivity
Density of periodic orbits
Sensitivity to initial conditions
note:
It can be shown that the transitivity, under some mild assumption, is equivalent to the existence of a dense orbit, by the Birkhoff transitivity theorem.
It can be shown that the density of periodic points is a generic phenomena, according to the Kupka-Smale theory.
Transitivity
Let f be a map from a metric space ( X , d ) to itself.
f is topologically transitive on a subset A ⊆ X if:
∀ y ∈ A , ∀ ε > 0 and n ∈ N such that d ( f ( n ) ( x ∗ ) , y ) < ε There is an orbit O f ( x ∗ ) , x ∗ ∈ A that is dense in A .
Alternatively for any y ∈ A there exists a subsequence n k such that:
lim k → ∞ d ( f ( n k ) ( x ∗ , x ) ) = 0
Or for any pair of non-empty open subsets U , V ⊆ X there exists an n ≥ 0 such that:
f n ( U ) ∩ V ≠ ∅ Birkhoff transitivity theorem:
Topological Transitivity ⟺ Existence of a Dense Orbit dense orbit example
Density of a Periodic Orbit
Let f be a map on a metric space ( X , d )
Periodic points of f
P ( f ) = { x ∈ X : f ( n ) ( x ) = x for some n ∈ N } Density of Periodic Orbits if:
For every point x ∈ X and every ε > 0 , ∃ p such that d ( x , p ) < ε .
Sensitive Dependence on Initial Condition
Let f be a map on a metric space ( X , d ) , there is sensitive dependence on initial conditions at point of A ⊆ X if there
∃ ε > 0 , so that ∀ x 0 ∈ A and ∀ δ > 0 y 0 ∈ X such that
| y 0 − x 0 | < δ and
d ( f ( k ) ( y 0 ) , f ( k ) ( x 0 ) ) > ε So put otherwise ∀ x 0 ∈ A , ∀ N ε ( x 0 ) , ∃ y 0 ∈ N ε ( x 0 ) such that d ( f ( k ) ( y 0 ) , f ( k ) ( x 0 ) ) grows larger than ε