IDC402 Non Linear Dynamics

Fractals

Countable and Uncountable sets

Any set that is bijective with N is called countable.

Consider E=even numbers which can be written as

E=2n|nN

But R is uncountable can be shown by contradiction. Let [ri] be the binary expansion of every r in R. Assume that R is countable, therefore all r can be indexed by some variable j.

Now consider x which has a binary expansion where xj= rjj. This x is different from every rj at the jth position, which is a contradiction.

Fractal Sets - Cantor set

Consider a line from l0=[0,1]. Generate l1 by removing [1/3,2/3]. Generate l2 by removing the middle third of each segment. Then, the Cantor set is defined as all the points in l

What is the measure of this Cantor set?

Any li must be smaller than lj for all j<i. Hence, l must be smaller than all li.

Now li has a length of (2/3)n. Hence, taking limn gives a length for l=0

How many points in the set?

Consider the ternery expansion of any r in [0,1]. It is of the form r=ri(1/3)i where r0,1,2. Geometrically, r lies in the rith third in the ri1th segment. Hence, the Cantor set is the set of all points which don’t exist in the second third in any segment. This implies that they don’t have a 1 in their ternary expansion. Now to show that the Set is uncountable, we again assume that it is countable, and generate an x such that xi=2rjj which will not be a part of the set, exactly like in [Real numbers]

Hence, the Cantor set has uncountably many points but still has a measure of 0

Dimensions of Fractals

Similarity dimension

This is given by looking at how many more scaled self similar parts we need to make every part of the fractals.

If m is the number of scaled, and r is the scaling parameter, then the similarity dimension is given by

ds=lnmlnn

For example, a box can be covered by r3 boxes scaled by r boxes.

For the Koch curve, we need 4 lines of size 1/3 to cover each step of the Koch sequence. Hence, the dimension is ln4/ln3)

For the Cantor set, we need 2 lines of size 1/3 to cover each ln. Hence, ds=ln2/ln3

Statistical Fractals

This are fractals where self similarity is only statitstical and not exact.

In such cases, we cannot define the Similarity dimension, and we need to introduce other

Box Dimension

It is the number of boxes of size ϵ needed to cover the set as ϵ tends to 0.

db=limϵ0lnN(ϵ)ln1ϵ

For the Koch curve, we take ϵ=1/3n. We need 4n such segments. Hence, taking limn, we get db=ln(4n)ln(11/3n)=ln4ln3

For the Cantor set, we take ϵ=1/3n. We need 2n such segments. Hence, taking limn, we get db=ln(2n)ln(11/3n)=ln2ln3

For the 8/9 statitstical Fractal, the box dimension can be found by ϵ=1/3n, and N=8n. Hence we get db=ln8ln3

Point Dimension

For dynamical maps, we cannot define such a dimension.

One way to define the dimension is to take the average density of an orbit at each point. Hence, the box dimension weighs each box equally, whereas the point/correlation dimension weighs each point by density.

dcorrdb

dcorrelation=lnC(ϵ)lnϵ

This C(ϵ)ϵ curve generally saturates at very small ϵ and very large ϵ. For large ϵ, the ball is so big that it engulfs the entire orbit. For small ϵ, the sample size is not large enough, which leads to no points being recorded.