Skip to main content

Subsection 2.10.1 Tent maps

For each positive number \(a\text{,}\) we define the tent map \(T_a\) on \([0,1]\) by
\begin{equation*} T_a(x) = \begin{cases} a\,x \amp 0\leq x \leq 1/2 \\ a\,(1-x) \amp 1/2\leq x \leq 1. \end{cases} \end{equation*}
The graphs of several tent maps are shown in Figure 2.49. Note that when \(a < 2\text{,}\) the function \(T_a\) maps \([0,1]\) into itself and that when \(a=2\text{,}\) the function \(T_a\) maps \([0,1]\) onto itself. When \(a > 2\text{,}\) the unit interval is no longer invariant
Figure 2.49. The graphs of several tent maps
Of course, we are interested in iterating \(T_a\) for various values of \(a\text{.}\) Figure 2.50 shows cobweb plots of tent maps for several choices of \(a\) in the interval \((0,2]\text{.}\) It appears that \(T_a\) should have a single attractive fixed point at the origin when \(a < 1\) and that \(T_a\) should be chaotic on some interval when \(a > 1\text{.}\)
Figure 2.50. Cobweb plots for several tent maps
It’s not too difficult to prove that \(T_2\) is chaotic on the unit interval.
Just as with the chaotic quadratic, Claim 2.51 implies that the tent map \(T_2\) is chaotic. You can apply the conjugacy function \(T_2\) itself to a periodic point of \(d\) to find a periodic point of \(T_2\text{.}\) For example, \(T_2(0_{\dot 2}\overline{001}) = 2/7\) is a period three point for \(T_2\text{,}\) as you can easily check.
Finally, it’s worth noting that we can study \(T_2\) by examining its effect on binary expansions.

Checkpoint 2.53 The tent map applied to binary expansions.

Show that
\begin{equation*} T_2(0_{\dot 2}b_1b_2b_3b_4\cdots) = \begin{cases} 0_{\dot 2}b_2b_3b_4\cdots \amp b_1 = 0 \\ 0_{\dot 2}(1-b_2)(1-b_3)(1-b_4)\cdots \amp b_1 = 1 \end{cases}. \end{equation*}
In other words, the map shifts the digits (like the doubling map) when the first bit is zero but shifts bits and swaps the remaining bits when the first bit is one.