 Feigenbaum attractor

For the normalized Feigenbaum map, put $\gamma =-g(1)$ and defineThe Feigenbaum attractor is the nested intersection $A={\bigcap }_n{\bigcup }_i{\Delta }_i^{(n)}$. Each level interval has two children, and the largest interval length tends to zero. Consequently every compatible infinite binary address selects one point of this Cantor set.^[ref]

At level $n$, the intervals are visited cyclically: the label changes from $i$ to $i+1$ modulo $2^n$. Expressing $i$ in binary therefore turns iteration on $A$ into the dyadic adding machine. One adds one with carries, rather than discarding the first symbol as in a full shift. For example, addresses written with the least significant digit first begin $000\dots \mapsto 100\dots \mapsto 010\dots \mapsto 110\dots$.

There are $2^n$ geometric pieces at depth $n$, but those pieces are visited in a cycle. Counting them does not make the time evolution a two-symbol full shift. The Feigenbaum geometric potential uses this depth to study spatial contraction and Hausdorff dimension.