much easier to calculate than box counting, comes for free with Lyapunov spectrum.
Let be a map in with . Consider an orbit with Lyapunov Exponent and let be the largest integer such that:
The Lyapunov Dimension of the orbit is defined to be:
- if doesnt exist ( all directions contracting ). this would happen in the basin of a sink
- if
- if
For the skinny Bakers Map, , , so and
The area after iterates is . Assuming and , area goes to as . But the dimensions is at least becuase .
Area:
d^2e^{K(h_{1}+h_{2})}=\underbrace{ (de^{Kh_{2}})^2 }_{ \text{area of single box} } \underbrace{ \frac{de^{Kh_{1}}}{de^{Kh_{2}}} }_{ \begin{array} f\text{number of boxes of} \\ \text{side length } de^{Kh_{2}} \\ \text{required to cover set} \end{array} }BCD:
\begin{align*} \lim_{ G \to 0 } \frac{\ln(N)}{\ln\left( \frac{1}{\epsilon} \right)} &= \lim_{ \epsilon \to 0 } \frac{-\ln N}{\ln \epsilon} \\ &= \frac{-\ln ( N(d)e^{K(h_{1}-h_{2})})}{\ln (de^{Kh_{2}})} \\ &= \frac{-\ln(N(d)) - K(h_{1}-h_{2})}{\ln d + Kh_{2}} \quad \text{in lim as }\epsilon\to 0 \end{align*} \quad \quad \begin{array} . N(d) = \text{number of boxes} \\ \text{of size d} \\ \text{I started with} \end{array}expression reduced to:
Fixed Point Theorem 2
Theorem
Let be a continuous map on and be a rectangular region such that as the boundary of is traversed, the net rotation of the vectors:
is nonzero. Then has a Fixed Point in
To do so, there must come a point as we shrink such that