Fractals
- Complex geometric shapes with fine structure at arbitrarily small scales.
- Self similarity
- Generally upto some scale
- Generally statitstical similarity
- Strange attractor
- Have geometrical properties which are self similar
Countable and Uncountable sets
Any set that is bijective with is called countable.
Consider which can be written as
But is uncountable can be shown by contradiction.
Let be the binary expansion of every in .
Assume that is countable, therefore all can be indexed by some variable .
Now consider which has a binary expansion where . This is different from every at the th position, which is a contradiction.
Fractal Sets - Cantor set
Consider a line from . Generate by removing . Generate by removing the middle third of each segment. Then, the Cantor set is defined as all the points in
What is the measure of this Cantor set?
Any must be smaller than for all . Hence, must be smaller than all .
Now has a length of . Hence, taking gives a length for
How many points in the set?
Consider the ternery expansion of any in . It is of the form where . Geometrically, lies in the third in the 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 in their ternary expansion.
Now to show that the Set is uncountable, we again assume that it is countable, and generate an such that 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 is the number of scaled, and r is the scaling parameter, then the similarity dimension is given by
For example, a box can be covered by 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
For the Cantor set, we need 2 lines of size 1/3 to cover each . Hence,
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.
For the Koch curve, we take . We need such segments. Hence, taking , we get
For the Cantor set, we take . We need such segments. Hence, taking , we get
For the 8/9 statitstical Fractal, the box dimension can be found by , and . Hence we get
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.
This 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.