2 Erasing interval maps

We start by defining what we mean herein by erasing substitution. The notation used throughout the paper is summarized in Appendix A.

We say that $w\in \{0,1\}^{\infty }$ is a binary expansion for $x\in [0,1]$ if

(2.1) $$ \begin{align} x=(0.w)_2:=\sum_{i=1}^{|w|} 2^{-i}w_i. \end{align} $$

Note that the previous equation applies whether the length of w is finite or infinite. For $x\in (0,1]$ , we indicate by $w_x\in \lbrace 0,1\rbrace ^{\omega }$ the unique infinite binary expansion of x not ending with $0^{\infty }$ .

Let us denote the concatenation of words multiplicatively. Assuming $\sigma (\epsilon )=\epsilon $ , the k-block substitution $\sigma $ can be extended by concatenation to a map over $(\bigcup _{n\in \mathbb {N}_0}\{0,1\}^{nk})\cup \{0,1\}^{\omega }$ by setting, for every w belonging to this set,

$$ \begin{align*} \sigma(w)=\prod_{i=0}^{\frac{|w|}{k}-1} \sigma(w_{ki+1}w_{ki+2}\ldots w_{ki + k}), \end{align*} $$

where the concatenation index has to be intended to be up to $\infty $ if $w\in \{0,1\}^{\omega }$ .

We are now ready to introduce what we call the erasing interval maps, which are maps from $[0,1]$ to itself generated by the symbolic action of an erasing substitution on the binary expansion of reals.

Definition 2.2. Given an erasing substitution $\sigma $ , the interval map generated by it, indicated by $f_{\sigma }$ , is defined as follows:

(2.2)

In the following, the main objects of our analysis are the model-case erasing block substitution

$$ \begin{align*} \rho:\{0,1\}^2\to \{0,1\}^* \end{align*} $$

defined as follows:

(2.3) $$ \begin{align} \rho(00)=\epsilon,\quad \rho(01)=1,\quad \rho(10)=0,\quad \rho(11)=01, \end{align} $$

and the corresponding erasing interval map $f_{\rho }\colon [0,1] \to [0,1]$ , defined using (2.2).

Some properties of this map were already investigated in [Reference Della Corte, Isola and Piergallini6], where it was denoted by R. We point out that the map R was a slightly different object than $f_{\rho }$ . Indeed, R maps $0$ to $2/3$ and this makes its combinatorial dynamical properties more uniform. In the present paper, this slight discrepancy makes no difference as we are interested in measurable dynamical properties concerning absolutely continuous measures, which are unaffected by what happens at single points.

Let us now consider the following map $\rho _e:\{0,1\}^{\infty }\to \{0,1\}^{\infty }$ :

(2.4) $$ \begin{align} \rho_e: \begin{cases} 0 \mapsto \epsilon,\\ 1 \mapsto 0 & \text{in odd positions},\\ 1 \mapsto 1 & \text{in even positions}. \end{cases} \end{align} $$

As the action of $\rho _e$ coincides with that of $\rho $ on the words of even or infinite length, it can be taken as an extension of $\rho $ . In the following, we write simply $\rho (w)$ instead of $\rho _e(w)$ for words of any length.

The definition of $\rho $ given through (2.4) shows why $\rho $ can be considered the model-case erasing substitution. Indeed, $\rho $ is defined using the simplest non-trivial alphabet, namely $\{0,1\}$ , and acts by sending the digit 0 to the empty word and the digit 1 to 0 or 1 according to the parity of its position in the original word, which is arguably the simplest possible choice.

For the reader convenience, we recall here the main results of the two aforementioned papers, namely [Reference Della Corte and Farotti5, Reference Della Corte, Isola and Piergallini6], because we are now ready to formulate them more precisely:

• • in [Reference Della Corte, Isola and Piergallini6] it has been proven that $f_{\rho }$ is Devaney chaotic, exhibits distributional chaos of type $1$ (in the sense of [Reference Balibrea, Smıtal and Štefánková1]), has infinite topological entropy and uncountably many periodic cycles for every order; moreover, it is Borel-singular and not bi-measurable, because there are sets of Lebesgue measure zero whose $f_{\rho }$ -image is not measurable;

• • in [Reference Della Corte and Farotti5], Li–Yorke and Devaney chaos, as well as infinite topological entropy, have been established for maps generated by a more general class of erasing substitutions.

As the results that we are going to show will concern the even-order iterates of $f_{\rho }$ , and $f_{\rho }^2$ is equal to $f_{\rho ^2}$ Lebesgue-almost everywhere (as we prove in Lemma 3.5), a legitimate question is whether $\rho ^2$ itself can be rewritten as a block substitution. However, the following lemma shows that this is not the case, even asking only that $\rho ^2$ coincide with a block substitution on infinite words.

Proof. Suppose, towards a contradiction, that there exists $k\in \mathbb {N}$ such that $\rho ^2$ coincides with the k-block substitution $\varsigma $ when both are extended to a morphism over $\{0,1\}^{\omega }$ . Note that, because $\rho ^2(0^k)=\epsilon $ , the equality $\rho ^2(0^{\infty })=\varsigma (0^{\infty })$ implies $\varsigma (0^k)=\epsilon $ . Moreover, it should be

(2.5) $$ \begin{align} \rho^2(w)=\varsigma(w)\quad \text{for every } w\in\{0,1\}^k, \end{align} $$

because

$$ \begin{align*} \varsigma(w)=\varsigma(w0^{\infty})=\rho^2(w0^{\infty})=\rho^2(w). \end{align*} $$

Set now $a=0^{k-1}$ and take $b\in \{0,1\}^k$ such that $\varsigma (b)\ne \epsilon $ . Such a word b must exist, because otherwise the block substitution $\varsigma $ would send all words to the empty word. Take also $c\in \{0,1\}^{\omega }$ .

Recalling (2.5), and because, in particular, $\varsigma (1a)=\rho ^2(1a)=\epsilon $ , we have

(2.6) $$ \begin{align} \begin{aligned} \rho^2(0abc) &=\varsigma(0abc)=\varsigma(0^k)\varsigma(b)\varsigma(c)=\varsigma(1a)\varsigma(b)\varsigma(c)=\varsigma(1abc) \\ &=\rho^2(1abc). \end{aligned} \end{align} $$

Note now that

(2.7) $$ \begin{align} \rho^2(0abc)=\rho(\rho(0^k)u\rho(c))=\rho(u)w, \end{align} $$

where:

• • u is equal to $\rho (b)$ or its bitwise negation $\widetilde {\rho (b)}$ , depending on the parity of k;

• • w is equal to $\rho ^2(c)$ or $\widetilde {\rho ^2(c)}$ , depending on the parity of $|u|$ .

On the other hand, we have

(2.8) $$ \begin{align} \rho^2(1abc)=\rho(\rho(1a)u\rho(c))=\rho(0u\rho(c)) =\widetilde{\rho(u)}\widetilde{w}=\widetilde{\rho(u)w}, \end{align} $$

where $u,v,w$ are defined similarly as before.

By equation (2.6), the right-hand sides of equations (2.7) and (2.8) must be equal, so it should be

$$ \begin{align*}\rho^2(0abc)=\rho^2(1abc)=\epsilon, \end{align*} $$

which is absurd because, again by the chain of equalities in equation (2.6), both have $\varsigma (b)\ne \epsilon $ as a subword.

The previous result tells us that we cannot hope to straightforwardly apply to $\rho ^2$ the tools developed in [Reference Della Corte and Farotti5], so that we must study this map and the corresponding interval map $(f_{\rho })^2$ in itself.

As an immediate consequence of [Reference Della Corte, Isola and Piergallini6, Proposition 5.3], the $f_{\rho }$ -preimages of single points has Lebesgue measure zero. However, the map $f_{\rho }$ is not very well-behaved with respect to the Lebesgue measure, being a singular map. To show this, let us define the set of points whose binary expansion does not contain the word 00:

$$ \begin{align*} M:=\{x\in[0,1]: w_x\ \text{does not have pairs of consecutive 0s}\}. \end{align*} $$

As the subword $00$ has no effect in the $\rho $ -image of any word, it is clear that $f_{\rho }(M)=[0,1]$ . On the other hand, the Lebesgue measure of M is 0, because none of its points can be in $\mathcal {N}_2$ , namely in the set of normal real numbers in base 2 (see [Reference Queffelec18] for a reference work on normal numbers). Moreover, in [Reference Della Corte, Isola and Piergallini6, Proposition 5.2] it has also been proven that $f_{\rho }(\mathcal {N}_2)\subset [0,1]\setminus \mathcal {N}_2$ . Therefore, $f_{\rho }$ displaces all the Lebesgue-mass in the null set $[0,1]\setminus \mathcal {N}_2$ , whereas at the same time it maps the null set M to the whole interval $[0,1]$ . Quite surprisingly, it does so in such a way that in two iterations ‘things are set right again’. More precisely, we have the following result.

The proof of Theorem 2.4 is given later, after having proven some needed lemmas. Let us first look at some numerical computations to get a sense of what is going on. The behavior of the even and odd iterates of $f_{\rho }$ is graphically shown by the numerical results presented in Figure 1, where the substantial difference between the odd and even iterates of $f_{\rho }$ can be appreciated. As already recalled, $f_{\rho }$ is singular and, therefore, it cannot preserve any absolutely continuous measure. The graphs corresponding to the odd iterates can give some hint on a singular-continuous measure possibly preserved by it. Whether it exists is an open question for the authors. The self-similarities shown by the plots corresponding to the odd iterates are linked to the self-similarity properties of the graph of $f_{\rho }$ , which are investigated in some depth in §4 of [Reference Della Corte, Isola and Piergallini6].

Figure 1

Numerical results on the first five iterates of $f_{\rho }([0,1])$ . The graphs show how many, out of approximately 150,000 randomly selected points from $[0,1]$ , occupy the subintervals of length $2^{-8}$ at each iterate.

Before giving the proof of Theorem 2.4, let us introduce some useful notation.

For every $w \in \{0,1\}^*$ , we indicate by $[w]$ the real cylinder set corresponding to w, that is the dyadic subinterval of $[0,1]$ whose points have a binary expansion that starts with w:

(2.9) $$ \begin{align} [w] = \{x \in [0,1]: x = (0.wv)_2 \ \text{for some }v \in \{0,1\}^{\infty}\}. \end{align} $$

We remark that, with this definition, $[\epsilon ] = [0,1]$ and all real cylinder sets are closed intervals whose endpoints are dyadic rationals.

For $w\in \{0,1\}^*$ , we indicate by ${\langle \langle {w}\rangle \rangle }$ the (countable) set of all distinct words obtained by inserting (in any position, but not as a suffix) any finite number of subwords of type $00$ in w. More formally, for $w=w_1w_2\ldots w_k \in \{0,1\}^k$ , a word v is in ${\langle \langle {w}\rangle \rangle }$ if it can be written as

(2.10) $$ \begin{align} v=(00)^{h_1}w_1(00)^{h_2}w_2\ldots (00)^{h_k}w_k, \end{align} $$

for some choice of the k non-negative integers $h_1,\ldots , h_k$ . Thus, for instance,

$$ \begin{align*} {\langle\langle{1}\rangle\rangle} = \{w \in \{0,1\}^*: w = 0^{2k}1, \ k \in \mathbb{N}_0\}, \end{align*} $$

and

$$ \begin{align*} {\langle\langle{101}\rangle\rangle} = \{w \in \{0,1\}^*: w = 0^{2k}10^{2h}01,\ k,h\in\mathbb{N}_0 \}. \end{align*} $$

For every $w \in \{0,1\}^*$ , we indicate by $[[w]]$ the countable union of the real cylinder sets characterized by words in ${\langle \langle {w}\rangle \rangle }$ , namely

(2.11) $$ \begin{align} [[w]] = \bigcup_{v \in {\langle\langle{w}\rangle\rangle}} [v]. \end{align} $$

We prove now a technical result which shows an element of regularity in $\rho ^2$ that is missing in $\rho $ .

Lemma 2.5. Let $u,v,w\in \{0,1\}^*$ be such that

$$ \begin{align*} \rho(u) = v \quad\text{and}\quad \rho(v) = w, \end{align*} $$

with both u and v not containing $00$ as a subword and ending with $1$ . Then $|u|=2|w|$ .

Proof. We proceed by induction on the length of w. Consider first the two words, 0 and 1, having length 1.

It is straightforward to check that 01 and 11 are the only two words such that:

1. (1) their $\rho ^2$ -images are respectively 0 and 1;

2. (2) both they and their $\rho $ -images do not have 00 as a subword;

3. (3) they and their $\rho $ -images end with 1.

This settles the case of words with length 1.

Suppose now to have established the result for every word of length k. Fix $w\in \{0,1\}^k$ and let u and v have the properties indicated in the statement. As u has even length, we have

$$ \begin{align*} \rho(u01)=v1,\quad\rho(v1)=wx, \end{align*} $$

where x is 0 or 1 according to $|v|$ being even or odd, respectively. Moreover, we have

$$ \begin{align*} \rho(u11)=v01,\quad \rho(v01)=wx, \end{align*} $$

where x is 0 or 1 according to $|v|$ being odd or even, respectively. The words $u01$ and $u11$ are such that:

1. (1) their $\rho ^2$ -images are respectively $w0$ and $w1$ (if $|v|$ is even) or respectively $w1$ and $w0$ (if $|v|$ is odd);

2. (2) both they and their $\rho $ -images do not have 00 as a subword;

3. (3) they and their $\rho $ -images end with 1.

It is easy to check that they are the unique words with these properties. As $|u|=2|w|$ by the inductive assumption, we have $|u01|=|u11|=2|wx|$ , so we have established the result for the two words $w0$ and $w1$ whatever the parity of v is, which completes the induction procedure.

Under the assumptions of Lemma 2.5, we call v and u the minimal preimages of order 1 and 2 of w under $\rho $ , respectively.

Before giving the proof of Theorem 2.4, we need another result.

Lemma 2.6. For every $w \in \{0,1\}^*$ , let $W \subset \{0,1\}^*$ be defined as follows:

(2.12) $$ \begin{align} W=\{ q\in\{0,1\}^*: \rho^2(q)=w \text{ and both } q\text{ and }\rho(q) \text{ do not end in }0 \}. \end{align} $$

Then, $|q|$ is even for every $q \in W$ . Moreover, for every $q,q' \in W$ such that $q \ne q'$ , $[q] \cap [q']$ contains at most one point.

Proof. As a first step, let us show that $|q|$ is even for every $q \in W$ by a contradiction argument. If $|q|$ is odd, then q can be written as $q = v1$ , with $|v|$ even. As a consequence, $\rho (q) = \rho (v)0$ , so it ends in $0$ and $q \notin W$ by definition.

Now, let us consider $q,q' \in W$ such that $q \ne q'$ . Looking again for a contradiction, let us assume that $[q]\cap [q']$ contains more than one point. This implies that one of them is strictly contained in the other. Without loss of generality, let us assume that $[q'] \subsetneq [q]$ , so q is a prefix of $q'$ , namely there exists $v \in \{0,1\}^+$ (hence $v \ne \epsilon $ ) such that

$$ \begin{align*} q' = qv. \end{align*} $$

As both $\rho ^2(q)$ and $\rho ^2(q') = w$ , we have that $\rho ^2(v) = \epsilon $ . Moreover, because both $|q|$ and $|q'|$ are even, $|v|$ is even too. Hence, there exists $v' \in \{0,1\}^+$ such that $|v'|$ is odd and

$$ \begin{align*} v = v'1. \end{align*} $$

As a consequence, $\rho (v) = \rho (v')1$ and

$$ \begin{align*} \rho^2(v) = \rho^2(v')a, \end{align*} $$

where a is $0$ or $1$ depending on the parity of $|\rho (v')|$ . Therefore, $|\rho ^2(v)| \ge |a| = 1> 0 = |\epsilon |$ , so $\rho ^2(v) \ne \epsilon $ , that is a contradiction.

Now, we are ready to prove Theorem 2.4.

Proof of Theorem 2.4

In the following computations, it is useful to recall that the number of ways in which one can arrange m indistinguishable objects in n distinguishable sites is given by

$$ \begin{align*} {m+n-1\choose m}. \end{align*} $$

In our case, the objects will be subwords of type 00 and the sites can be thought of as the places ‘at the left of the digits 1’ in a given word. Moreover, we are going to use the following equality:

(2.13) $$ \begin{align} \sum_{m = 0}^{\infty} {m+n-1\choose m} 4^{-m} = \bigg(\frac{4}{3}\bigg)^{n}. \end{align} $$

We proceed by induction.

(1) First, we check the result in the case of the real cylinder set $[0] = [0,1/2]$ . Its $f_{\rho }$ -preimage is the set $[[1]]=\bigcup _{k=0}^{\infty } [0^{2k}1]$ . Therefore, the $f^2_{\rho }$ -preimage of $[0]$ is the set

$$ \begin{align*} [[01]]\cup\bigg(\bigcup_{k=0}^{\infty} [[(10)^{2k+1}11]]\bigg). \end{align*} $$

Let us calculate its Lebesgue measure. We have

(2.14) $$ \begin{align} m([[01]])=4^{-1} \sum_{j=0}^{\infty} 4^{-j}=\frac 13, \end{align} $$

and, using also (2.13), we have also

$$ \begin{align*} m([[(10)^{2k+1}11]]) =4^{-2k-2}\sum_{j=0}^{\infty}\bigg( {j+2k+2\choose j} \, 4^{-j} \bigg) =\frac{4}{3^{2k+3}}. \end{align*} $$

Thus, we obtain

(2.15) $$ \begin{align} m\bigg(\bigcup_{k=0}^{\infty} [[(10)^{2k+1}11]]\bigg) =\sum_{k=0}^{\infty} \frac{4}{3^{2k+3}}=\frac 16, \end{align} $$

which leads to $m(f_{\rho }^{-2}([0]))= m([0])=1/2$ , as claimed.

(2) From the previous step, it immediately follows that $m(f_{\rho }^{-2}([1])) =m([0,1]\setminus f_{\rho }^{-2}([0])) =1/2$ .

(3) Having established the claim for real cylinder sets associated to words of length $N = 1$ , let us fix $N \ge 1$ and suppose that for every $w\in \{0,1\}^{N}$ we have $m(f_{\rho }^{-2}([w]))=m([w])$ . We are going to prove that both $[w0]$ and $[w1]$ have $f_{\rho }^{2}$ -preimages having Lebesgue measure $2^{-|w|-1}$ , which suffices to prove the theorem.

Let $ P{\kern-1pt}={\kern-1pt}\{p{\kern-1pt}\in{\kern-1pt} \{0,1\}^*{\kern-1pt}:{\kern-1pt}\rho ^2(p){\kern-1pt}={\kern-1pt}w \text { and both } p\text { and }\rho (p)\ \text {do not end in }0\}$ . By Lemma 2.6 the length of every $p \in P$ is even and $[p]\cap [p']$ consists of at most one point for every $p,p' \in P$ such that $p \ne p'$ . Using the induction hypothesis we obtain

$$ \begin{align*} m\bigg(\bigcup_{p\in P}[p]\bigg) =\sum_{p \in P} 2^{-|p|} = 2^{-|w|}. \end{align*} $$

Let v and u be the minimal preimages of w under $\rho $ of order $1$ and $2$ , respectively, so that $\rho (u)=v$ , $\rho (v)=w$ and neither u or v have 00 as a subword. Let $a\in \{0,1\}$ . The minimal $\rho $ -preimage of $wa$ is of type $v1$ or $v01$ depending on a and on the parity of the length of v. Let us analyze the two cases separately.

1. (i) The minimal $\rho $ -preimage of $wa$ is of type $v01$ . The minimal $\rho $ -preimage of $v01$ is $u11$ , because by Lemma 2.5 u has even length. Set

   $$ \begin{align*} Q=\{ q\in\{0,1\}^*:\rho^2(q)=wa \text{ and both } q \text{ and } \rho(q) \text{ do not end in }0 \}. \end{align*} $$
   Every word in Q is of type $pr$ where $r\in {\langle \langle {1(01)^{2k}1}\rangle \rangle }$ for some integer $k\ge 0$ , because $|p|$ is even and this implies that the subword $(01)^{2k}$ in r goes to the empty word in two iterations of $\rho $ . Therefore, recalling (2.13), $m(f_{\rho }^{-2}([wa]))$ can be written as follows:
   $$ \begin{align*} \begin{aligned} m(f_{\rho}^{-2}([wa])) &= \sum_{p\in P} \bigg( m([p]) \sum_{j,k=0}^{\infty} {j+2k+1\choose j} 2^{-2-2j-4k} \bigg)\\ &=2^{-|w|} \sum_{j,k=0}^{\infty} {j+2k+1\choose j} 2^{-2-2j-4k} \\ &=2^{-|w|}\sum_{k=0}^{\infty} \frac{4}{9^{k+1}}\\ &=2^{-|w|-1}. \end{aligned} \end{align*} $$

2. (ii) The minimal $\rho $ -preimage of $wa$ is of type $v1$ . The minimal $\rho $ -preimage of $v1$ is $u01$ , because again by Lemma 2.5 u has even length. Let P and Q be defined as previously. Arguing as before (and recalling that $|p|$ is even), every word in Q is of type $pr'$ where $r'\in [[01]]$ or $r'\in [[1(01)^{2k-1}1]]$ for some integer $k\ge 1$ . Therefore, $m(f_{\rho }^{-2}([wa]))$ can be computed as follows:

   $$ \begin{align*} \begin{aligned} m(f_{\rho}^{-2}([wa])) &= \sum_{p\in P} m([p]) \bigg( \sum_{j=0}^{\infty} 2^{-2-2j} + \sum_{j=0}^{\infty}\sum_{k=1}^{\infty} {j+2k\choose j} 2^{-2j-4k} \bigg)\\ &=2^{-|w|} \bigg( \frac 13 +\frac{4}{3} \sum_{k=1}^{\infty} \frac{1}{9^k} \bigg)\\ &=2^{-|w|-1}. \end{aligned} \end{align*} $$
   As a consequence, the inductive step is proven and this concludes the proof.

3 Dynamical properties of $f_{\rho }^2$

In defining the map $f_{\rho }$ , we exploited the fact that, using (2.4), the erasing block substitution $\rho $ can be extended to a morphism on $\{0,1\}^{\infty }$ . However, we remark that $\rho $ does not commute with the operation of concatenation of words. Indeed, for any $v \in \{0,1\}^*$ and $w \in \{0,1\}^{\infty }$ with w containing at least one digit 1, the word equality

$$ \begin{align*} \rho(vw) = \rho(v)\rho(w) \end{align*} $$

holds if and only if $|v|$ is even, whereas for $|v|$ odd we have

$$ \begin{align*} \rho(vw) = \rho(v)\widetilde\rho(w), \end{align*} $$

where $\widetilde \rho $ is defined as follows:

(3.1) $$ \begin{align} \widetilde\rho: \begin{cases} 0 \mapsto \epsilon,\\ 1 \mapsto 1 & \text{in odd positions},\\ 1 \mapsto 0 & \text{in even positions}. \end{cases} \end{align} $$

By Lemma 2.5 for every finite binary word w, there is $k\in \mathbb {N}$ such that $\rho ^k(w)=\epsilon $ , because the length of subsequent iterates of $\rho $ applied to w has to strictly decrease every two steps of iteration. This means that $\rho $ is completely erasing in the sense of [Reference Della Corte and Farotti5] (a formal definition of this concept will be given in §4). The following result is then an immediate consequence of [Reference Della Corte and Farotti5, Theorem 4], the key point here being that both $\rho $ and $\widetilde \rho $ are surjective as maps on $\{0,1\}^{\omega }$ .

In the definition given in [Reference Pawlak16], a function $f\colon [0,1]\to [0,1]$ is called turbulent if there exist two compact subintervals $I_1,I_2\subset [0,1]$ with at most one point in common such that

$$ \begin{align*} I_1\cup I_2 \subset f(I_1)\cap f(I_2). \end{align*} $$

In [Reference Čiklová4] it has been proven that every turbulent interval map whose graph is a connected $G_{\delta }$ set has positive topological entropy. This does not apply to $f_{\rho }$ , because its graph is totally disconnected; however, it has been proven that its topological entropy is infinite (both results are proven in [Reference Della Corte, Isola and Piergallini6]).

A map f preserving the measure $\mu $ is said to be exact with respect to $\mu $ if $\lim _{n\to \infty } \mu (f^n(A))=1$ for every set of positive measure A. For a measure-preserving transformation, topological exactness and exactness are scarcely related. For instance, in [Reference Bobok and Troubetzkoy2] it is proven that the typical continuous non-invertible Lebesgue-preserving interval map is topologically exact, whereas the set of strongly mixing maps is of first category.

In the following, we prove that $([0,1], m, f^2_{\rho })$ is a strong mixing, which is a weaker property than exactness with respect to the preserved measure. Let us recall the definition of strong mixing.

Definition 3.3. Let $(X,\mathcal {M},\mu )$ be a measure space and $f\colon X \to X$ a measure-preserving map. Then f is said strongly mixing if for every $A,B \in \mathcal {M}$ the following holds:

(3.2) $$ \begin{align} \lim_{n \to \infty} \mu(A \cap f^{-n}(B)) = \mu(A) \mu(B). \end{align} $$

Our main result is the following.

The fact that $f_{\rho }^2$ is strongly mixing looks surprising, at first. Roughly speaking, if the Lebesgue measure is considered, the strongly mixing property requires that the preimages of increasing order of every measurable set tend to ‘spread’ uniformly on $[0,1]$ . Now, the $\rho $ -preimage of a real cylinder set $[w]$ is obtained in two steps: finding the minimal preimage v of w and then generating the set $[[v]]$ . The latter is obtained inserting pairs of consecutive 0s in v, an operation which seems to be non-uniform, favoring instead a global transfer of Lebesgue-mass towards the left of the interval. However, this rough intuition is wrong because the minimal preimage of $00$ is $101$ (inserted in such a way that the 1s are at odd-indexed places) and at the second iteration for the construction of the $\rho ^2$ -preimage the Lebesgue-mass can move again towards the right of the interval. Nevertheless, a perfect uniformity of finite-order $\rho ^2$ -preimages cannot be expected in general and it will be achieved only through a limit process (see the proof of Lemma 3.8 for more details).

To prove the strongly mixing property of $f_{\rho }^2$ we do not need to work with all the Lebesgue measurable subset of $[0,1]$ . Let us indicate by $\mathcal {I}_d$ the set of all subintervals of $[0,1]$ (open, closed, half-open) consisting of points x whose binary expansion begins with a given $w\in \{0,1\}^*$ , plus the empty set and the degenerate cases in which the interval becomes a single dyadic rational point. More precisely, every element of $\mathcal {I}_d$ has one of the following forms for some $w\in \{0,1\}^*$ :

$$ \begin{align*} \{x\in[0,1]:(0.w 0^{\infty})_2 \le x \le ( 0.w1^{\infty} )_2\}; \end{align*} $$

$$ \begin{align*} \{x\in[0,1]:(0.w 0^{\infty})_2 < x \le ( 0.w1^{\infty} )_2\}; \end{align*} $$

$$ \begin{align*} \{x\in[0,1]:(0.w 0^{\infty})_2 \le x < ( 0.w1^{\infty} )_2\}; \end{align*} $$

$$ \begin{align*} \{x\in[0,1]: (0.w 0^{\infty})_2 < x < ( 0.w1^{\infty} )_2\}; \end{align*} $$

$$ \begin{align*} \{(0.w0^{\infty})_2\},\ \{1\},\ \emptyset. \end{align*} $$

We call the elements of $\mathcal {I}_d$ the dyadic intervals.

It is immediate to check that $\mathcal {I}_d$ is a semi-algebra (see [Reference Gentili14]), that is:

• • $\emptyset \in \mathcal {I}_d$ ;

• • $J\in \mathcal {I}_d$ implies that $[0,1]\setminus J$ is a finite union of pairwise disjoint members of $\mathcal {I}_d$ ;

• • $\mathcal {I}_d$ is closed with respect to finite intersection.

Therefore (see, for instance, [Reference Einsiedler and Ward12, p. 52]), to establish that $f_{\rho }^{2}$ is strongly mixing it is enough to prove that

(3.3) $$ \begin{align} \lim_{n\to\infty} m(I\cap f_{\rho}^{-2n}(J))=m(I)m(J) \end{align} $$

holds for every $I,J\in \mathcal {I}_d$ . As Theorem 2.4 ensures that

(3.4) $$ \begin{align} m(f_{\rho}^{-2}(x))=0\quad \text{for every}\ x\in[0,1], \end{align} $$

it is enough to check that (3.3) holds for non-degenerate closed intervals, which we can identify with real cylinder sets $[w]$ such that w is a finite, possibly empty binary word. This will be done in the following. However, before addressing the proof of Theorem 3.4, it is convenient to prove some lemmas.

In the following, we usually construct the preimages of a dyadic interval $[w]$ under the action of $(f_{\rho })^2$ by finding the words v such that $\rho ^2(v) = w$ . However, it is not always true that $f_{\rho ^2} $ coincides with $(f_{\rho })^2$ . For instance, let

$$ \begin{align*} x = 0.1111(10)^{\infty}, \end{align*} $$

so that

$$ \begin{align*} f_{\rho}(x) = 0.\rho(w_x) = 0.0101(0)^{\infty} = 0.0101. \end{align*} $$

As a consequence, $ w_{{f_{\rho }}(x)} = 0100(1)^{\infty }, $ so we have

$$ \begin{align*} f^{2}_{\rho}(x) = f_{\rho}(0.w_{f_{\rho}(x)}) = 0.(10)^{\infty} \ne 0.11 = 0.\rho^2(x). \end{align*} $$

The next lemma ensures, however, that $f_{\rho ^2} $ coincides with $(f_{\rho })^2$ Lebesgue-almost everywhere on $[0,1]$ , as $f_{\rho }^2(x) \ne f_{\rho ^2}(x) = 0.\rho ^2(w_x)$ only if $\rho (w_x)$ ends with $0^{\infty }$ , so that $w_{f_{\rho }(x)} \ne \rho (w_x)$ .

Lemma 3.5. The set

(3.5) $$ \begin{align} S=\{x\in[0,1]: f_{\rho}^2(x)\ne (0.\rho^2(w_x))_2\} \end{align} $$

has Lebesgue measure $0$ .

Proof. If $f_{\rho }(x)\notin \mathbb {Q}_2$ and $x\ne 0$ , then, by (2.2),

$$ \begin{align*} f_{\rho}^2(x)=(0.\rho(w_{f_{\rho}(x)}))_2=(0.\rho^2(w_x))_2. \end{align*} $$

It is then sufficient to prove that $m(f_{\rho }^{-1}(\mathbb {Q}_2))=0$ . As $|\mathbb {Q}_2|=\aleph _0$ , this follows from the fact that the $f_{\rho }$ -preimages of single points has Lebesgue measure zero (see [Reference Della Corte, Isola and Piergallini6, Proposition 5.3]).

Lemma 3.6. For every finite word $w\in \{0,1\}^{*}$ such that $|w|$ is even and every dyadic interval J, we have

(3.6) $$ \begin{align} m([w]\cap f_{\rho}^{-2}(J)) = 2^{|\rho^2(w)| - |w|} m([\rho^2(w)]\cap J). \end{align} $$

Proof. We divide the proof in different cases. Indeed, because both $[\rho ^{2}(w)]$ and J are dyadic intervals, their intersection could either contain at most one point, or be equal to one of the two sets.

(i) $[\rho ^2(w)] \cap J$ is the empty set or it contains exactly one point. In this case, recalling Lemma 3.5, we have that $[w] \cap f_{\rho }^{-2}(J)$ is a Lebesgue-null set, hence (3.6) trivially holds as $0 = 0$ . Indeed, a point x is in $ [w]\cap f_{\rho }^{-2}(J)$ if and only if $w_x = wq$ for some $q\in \{0,1\}^{\infty }$ and $f_{\rho }^{2}(x) = 0.\rho ^2(wq) = 0.\rho ^2(w)\widetilde {q} \in J$ , (with $\widetilde {q}$ equal to either $\rho ^2(q)$ or $\widetilde \rho (\rho (q))$ ), and this is not possible by assumption.

(ii) $[\rho ^2(w)] \subset J$ . In this case, $[\rho ^2(w)] \cap J = [\rho ^2(w)]$ , thus the word $w_J \in \{0,1\}^*$ that characterizes J is a prefix of $\rho ^{2}(w)$ , namely there exists $v \in \{0,1\}^*$ (eventually $v = \epsilon $ if $[\rho ^2(w)] = J$ ) such that

$$ \begin{align*} \rho^2(w) = w_J v. \end{align*} $$

As a consequence, by Lemma 3.5, $[w]\cap f_{\rho }^{-2}(J) = [w]$ except for a Lebesgue-null set. Indeed, for Lebesgue-almost every $x \in [w]$ we have that

$$ \begin{align*} f_{\rho}^{2}(x) = 0.\rho^{2}(w_x) = 0.\rho^{2}(wq) = 0.\rho^2(w)\widetilde{q} = 0.w_J v \widetilde{q} \in [w_J] = J, \end{align*} $$

hence, $x \in f_{\rho }^{-2}(J)$ . Therefore, in this case (3.6) holds because $m([w]) = 2^{-|w|}$ and $m([\rho ^{2}(w)]) = 2^{-|\rho ^2(w)|}$ .

(iii) $J \subsetneq [\rho ^{2}(w)]$ . In this case, $\rho ^2(w)$ is a prefix of $w_J$ and there exists $v \in \{0,1\}^+$ (so v is different from $\epsilon $ ) such that

$$ \begin{align*} w_J = \rho^2(w)v. \end{align*} $$

Therefore, we have

(3.7) $$ \begin{align} m([\rho^2(w)]\cap J) = m([\rho^2(w)v]) = 2^{-|\rho^2(w)|} m(v). \end{align} $$

Let us define the set $V \subset \{0,1\}^{+}$ as

$$ \begin{align*} V = \{q \in \{0,1\}^+: \rho^2(wq) = \rho^2(w)v \}, \end{align*} $$

so that, again neglecting a Lebesgue-null set by Lemma 3.5,

$$ \begin{align*} [w] \cap f_{\rho}^{-2}(J) = \bigcup_{q \in V} [wq]. \end{align*} $$

As w is even by hypothesis, $\rho (wq) = \rho (w)\rho (q)$ for every $q \in V$ . Now, if $\rho (w)$ is even we have $\rho ^2(wq) = \rho ^2(w)\rho ^2(q)$ . Otherwise, if $\rho (w)$ is odd we have $\rho ^2(wq) = \rho ^2(w)\widetilde \rho (\rho (q))$ . Hence, we have either

(3.8) $$ \begin{align} V = \rho^{-2}(v) \quad\text{or }\quad V = \rho^{-1}(\widetilde\rho^{-1}(v)). \end{align} $$

By Theorem 2.4, both $f_{\rho }^2$ and $f_{\widetilde \rho } \circ f_{\rho } = (1 - x)\circ f_{\rho }^{2}$ preserve the Lebesgue measure. Therefore, in both cases we obtain

$$ \begin{align*} m\bigg(\bigcup_{q \in V} [q]\bigg) = m([v]). \end{align*} $$

As for all $q_1,q_2 \in V$ with $q_1\ne q_2$ the sets $[wq_1]$ and $[wq_2]$ are disjoint, Lemma 3.5 implies that we have

(3.9) $$ \begin{align} m( [w] \cap f_{\rho}^{-2}(J) ) = \sum_{q \in V} m([wq]) = 2^{-|w|}\sum_{q \in V}m(q) = 2^{-|w|}m([v]). \end{align} $$

Combining (3.7) and (3.9) we have that (3.6) holds.

Corollary 3.7. For every dyadic interval J and every word w such that $|w|$ is even, the following holds:

(3.10) $$ \begin{align} m([w]\cap f_{\rho}^{-2n}(J)) = 2^{|\rho^2(w)| - |w|} m([\rho^2(w)]\cap f^{-2n + 2}(J)) \quad \text{for all } n \ge 1. \end{align} $$

Proof. If $n = 1$ , then (3.10) reduces to (3.6). If $n> 1$ , then, neglecting the intersection with the Lebesgue-null set S defined in (3.5), $f_{\rho }^{-2n + 2}(J)$ can be written as a countable union of disjoint dyadic intervals $(W_k)_{k \in \mathbb {N}}$ , namely

$$ \begin{align*} f_{\rho}^{-2n + 2}(J) = \bigcup_{k = 1}^{\infty} W_k. \end{align*} $$

Hence, applying (3.6) to every $W_k$ , we obtain

$$ \begin{align*} m([w]\cap f_{\rho}^{-2n}(J)) &= \sum_{k = 1}^{\infty} m([w]\cap f_{\rho}^{-2}(W_k))\\ &= 2^{|\rho^2(w)| - |w|} \sum_{k = 1}^{\infty} m([\rho^2(w)]\cap W_k)\\ &= 2^{|\rho^2(w)| - |w|} m([\rho^2(w)]\cap f^{-2n + 2}(J)).\\[-38pt] \end{align*} $$

Lemma 3.8. For every dyadic interval $J\subset [0,1]$ we have

(3.11) $$ \begin{align} \lim_{n \to \infty} m([0]\cap f_{\rho}^{-2n}(J))=\tfrac{1}{2}m(J) = m([0]) m(J) \end{align} $$

and, consequently,

(3.12) $$ \begin{align} \lim_{n \to \infty} m([1]\cap f_{\rho}^{-2n}(J))=\tfrac{1}{2}m(J) = m([1]) m(J). \end{align} $$

The numerical results presented in Figure 2 show the mixing property ensured by Lemma 3.8. Indeed, it can be seen how a randomly selected set of points in $[0]$ spreads uniformly to the whole interval $[0,1]$ under the action of subsequent iterations of $f_{\rho }^2$ .

Figure 2

Numerical results on the first five iterates of $f_{\rho }^2([0])$ . The graphs show how many, out of approximately 150,000 randomly selected points from $[0,1/2]$ , occupy the subintervals of length $2^{-8}$ at each iterate.

Proof of Lemma 3.8

If $J = [0,1]$ or $J = \emptyset $ , then the thesis immediately follows from $f_{\rho }^{-2}(J) = J$ .

Let us consider a dyadic interval W different from $ [0,1]$ and $\emptyset $ . Hence, neglecting degenerate cases of Lebesgue measure zero, W is characterized by a finite word w of length greater or equal than $1$ , namely $W = [w]$ with $1\le |w|< \infty $ . Hence, either $w = 0v$ or $w = 1v$ , for some $v \in \{0,1\}^*$ . As a first step, let us consider $w = 0v$ . To obtain $f_{\rho }^{-2}(W)$ , we can follow the same construction given in the first step of the proof of Theorem 2.4. Hence, recalling Lemma 3.5, for Lebesgue almost every point x in $f_{\rho }^{-2}(W)$ , we have that $w_x = aqr$ , where

$$ \begin{align*} a \in \bigg( {\langle\langle{01}\rangle\rangle} \bigcup \bigg(\bigcup_{k = 1}^{\infty} {\langle\langle{(10)^{2k + 1}11}\rangle\rangle}\bigg) \bigg) = \rho^{-2}(0), \end{align*} $$

$q \in \{0,1\}^{+}$ is such that $\rho ^{2}(aq) = 0v$ and r is a general infinite binary word. As $|a|$ is even for every $a \in \rho ^{-2}(0)$ , by Lemma 3.6 we obtain

(3.13) $$ \begin{align} m( [a] \cap f_{\rho}^{-2}(W) ) = \frac{2m(W)}{2^{|a|}} \quad \text{for all } a \in \rho^{-2}(0). \end{align} $$

To compute $m([0]\cap f_{\rho }^{-2}(W))$ , it suffices to apply the previous equation for every $a \in \rho ^{-2}(0)$ that has $0$ as first letter. Let $A_1$ be the set of words in ${\langle \langle {01}\rangle \rangle }$ , $A_2$ the set of words in ${\langle \langle {(10)^{2k+1}11}\rangle \rangle }$ and $A^i_2$ the subset of $A_2$ of words that start with $i = 0,1$ . Using both (2.14) and (3.13), and recalling Lemma 3.5, we obtain

(3.14) $$ \begin{align} \sum_{a \in A_1} m([a] \cap f_{\rho}^{-2}(W) ) = 2m(W)\sum_{a \in A_1} \frac{1}{2^{|a| }} = \frac{2}{3}m(W). \end{align} $$

Using (2.15), we have that

$$ \begin{align*} \sum_{a \in A_2} \frac{1}{2^{|a|}} = \frac{1}{6}. \end{align*} $$

As

$$ \begin{align*} \sum_{a \in A_2} \frac{1}{2^{|a|}} = \frac{4}{3} \sum_{a \in A_2^1} \frac{1}{2^{|a|}} \quad\text{and}\quad \sum_{a \in A_2^0} \frac{1}{2^{|a|}} = \frac{1}{3} \sum_{a \in A_2^1} \frac{1}{2^{|a|}}, \end{align*} $$

we obtain

(3.15) $$ \begin{align} \sum_{a \in A_2^0} m([a] \cap f_{\rho}^{-2}(W) ) = 2m(W)\sum_{a \in A_2^0} \frac{1}{2^{|a| }} = \frac{1}{12}m(W), \end{align} $$

where we have neglected again a set of measure zero by Lemma 3.5.

Using (3.14) and (3.15), we have

$$ \begin{align*} m([0]\cap f_{\rho}^{-2}(W)) &= \sum_{a \in A_1} m([a] \cap f_{\rho}^{-2}(W) ) + \sum_{a \in A_2^0} m([a] \cap f_{\rho}^{-2}(W) )\\ &= \frac{2}{3}m(W) + \frac{1}{12}m(W) = \frac{3}{4}m(W). \end{align*} $$

By the generality of $W = [0v]$ , we conclude that, for every $v \in \{0,1\}^*$ ,

(3.16) $$ \begin{align} m([0]\cap f_{\rho}^{-2}(W)) = \tfrac{3}{4}m(W) \quad \text{if } W= [0v]. \end{align} $$

Using a similar procedure, for every $v \in \{0,1\}^*$ we obtain that

(3.17) $$ \begin{align} m([0]\cap f_{\rho}^{-2}(W)) = \tfrac{1}{4}m(W) \quad \text{if } W= [1v]. \end{align} $$

Now we are ready to prove (3.11) for every dyadic interval J different from $[0,1]$ and $\emptyset $ . In the following, we neglect systematically the intersection of the subsets of $[0,1]$ under consideration with the Lebesgue-null set S defined in (3.5). The idea is to exploit (3.16) and (3.17) to see that $ m([0]\cap f_{\rho }^{-2n}(J)) $ converges to $m(J)/2$ as $n\to \infty $ . Let us define the sequence $(y_n)_{n \in \mathbb {N}}\subset [0,1]$ as follows:

$$ \begin{align*} y_n =\frac{m([0]\cap f_{\rho}^{-2n}(J))}{m(J)}. \end{align*} $$

As J is a dyadic interval different from $[0,1]$ and $\emptyset $ , we have that $y_0$ is either $0$ or $1$ . For every $n \ge 1$ , $f_{\rho }^{-2n}(J)$ is a countable union of dyadic intervals. More precisely, there are two infinite countable sets of disjoint dyadic intervals, say $(W^0_i)_{i \in \mathbb {N}}$ and $(W^1_i)_{i \in \mathbb {N}}$ , such that

$$ \begin{align*} [0] \cap f_{\rho}^{-2n}(J) = \bigcup_{i = 0}^{\infty} W^0_i \quad\text{and}\quad [1] \cap f_{\rho}^{-2n}(J) = \bigcup_{i = 0}^{\infty} W^1_i. \end{align*} $$

As a consequence, we can write

$$ \begin{align*} f_{\rho}^{-2(n+1)}(J) = \bigcup_{i = 0}^{\infty} f_{\rho}^{-2}(W^0_i) \ \cup\ \bigcup_{i = 0}^{\infty} f_{\rho}^{-2}(W^1_i), \end{align*} $$

and we have also

$$ \begin{align*} \sum_{i = 0}^{\infty} m(W^0_i) = y_n m(J) \quad\text{and}\quad \sum_{i = 0}^{\infty} m(W^1_i) = (1 - y_n) m(J). \end{align*} $$

For every $W^0_i$ we can apply (3.16), so we obtain

(3.18) $$ \begin{align} \sum_{i = 0}^{\infty} m([0]\cap f_{\rho}^{-2}(W^0_i)) = \frac{3}{4} \sum_{i = 0}^{\infty} m(W^0_i) = \frac{3}{4} y_n m(J). \end{align} $$

Similarly, for every $W^1_i$ we can apply (3.17), so we have

(3.19) $$ \begin{align} \sum_{i = 0}^{\infty} m([0]\cap f_{\rho}^{-2}(W^1_i)) = \frac{1}{4} \sum_{i = 0}^{\infty} m(W^1_i) = \frac{1}{4} (1 - y_n) m(J). \end{align} $$

As a consequence, summing (3.18) and (3.19), we obtain

(3.20) $$ \begin{align} y_{n+1} m(J) &= m([0] \cap f_{\rho}^{-2(n+1)}(J))\nonumber\\ &= \sum_{i = 0}^{\infty} m([0]\cap f_{\rho}^{-2}(W^0_i)) + \sum_{i = 0}^{\infty} m([0]\cap f_{\rho}^{-2}(W^1_i))\nonumber\\ &= \frac{3}{4} y_n m(J) + \frac{1}{4} (1 - y_n) m(J) = \bigg(\frac{1}{4} + \frac{1}{2}y_n\bigg) m(J). \end{align} $$

Therefore, $(y_n)_{n \in \mathbb {N}}$ can be computed using the following discrete dynamical system

$$ \begin{align*} y_{n + 1} = \frac{1}{4} + \frac{1}{2} y_n, \end{align*} $$

thus, we obtain

$$ \begin{align*} \lim_{n \to \infty} y_n = \frac{1}{2}, \end{align*} $$

from which (3.11) follows.

Now, we are ready to give a proof of the strongly mixing property of $f_{\rho }^{2}$ .

Proof of Theorem 3.4

As discussed previously, it is enough to show that (3.3) holds for every pair of non-degenerate dyadic intervals $I,J\subseteq [0,1]$ . The proof is given by an induction argument on the length of the word w that characterizes the interval I (namely $I = [w]$ ).

By Theorem 2.4, we have that

$$ \begin{align*} m([\epsilon]\cap f_{\rho}^{-2n}(J)) = m(J) = m([\epsilon])m(J) \end{align*} $$

for every $n \in \mathbb {N}$ , hence the equality holds for $n \to \infty $ . Using also Lemma 3.8, we have that (3.3) holds for every I that is characterized by a word w such that $|w|\le 1 = 2^0$ .

Let us show that if (3.3) holds for every I that is characterized by a word w such that $|w| \le 2^{n}$ , then it holds also for every $I = [w]$ with $|w| \le 2^{n + 1}$ .

As a first step, let w be a word of length $2^{n + 1}$ , so $I = [w]$ and $m(I) = 2^{-|w|}$ . It follows immediately from Lemma 2.5 that $|\rho ^2(w)| \le |w|/2 = 2^{n}$ . By Corollary 3.7, in particular by applying (3.10), and using the induction hypothesis we obtain

$$ \begin{align*} \lim_{n\to\infty} m([w]\cap f_{\rho}^{-2n}(J)) &= 2^{|\rho^2(w)| - |w|} \lim_{n\to \infty} m([\rho^2(w)]\cap f_{\rho}^{-2n + 2}(J)) \\ &= 2^{|\rho^2(w)| - |w|} \frac{m(J)}{2^{|\rho^2(w)|}} = \frac{m(J)}{2^{|w|}} = m(I)m(J), \end{align*} $$

so (3.3) holds.

As a second step, let I be a dyadic interval that is characterized by a word w of length between $2^n $ and $2^{n+1}$ . As I can be obtained as a finite union of intervals of the type $I_j = [w_j]$ with $|w_j| = 2^{n+1}$ for every j, then (3.3) holds. This concludes the inductive step, so we are done.

In the proof of Lemma 3.6 we had to consider the composition $f_{\widetilde \rho }\circ f_{\rho }$ (see (3.8)), and we exploited the fact that it preserves the Lebesgue measure. A graphic illustration of this fact is shown in Figure 3.

Figure 3

Numerical results on the first iterates of $f_{\widetilde \rho }\circ f_{\rho }$ . The graphs show how many, out of approximately 150,000 randomly selected points from $[0,1]$ , occupy the subintervals of length $2^{-8}$ at each iterate.

In the proof of Lemma 3.6 we could neglect the interval maps generated by the other compositions of $\rho $ and $\widetilde \rho $ , that is, $f_{\rho }\circ f_{\widetilde \rho }$ and $f_{\widetilde \rho }^2$ . However, in order to investigate further dynamical properties of the model-case erasing interval map, such as exactness, rate of mixing and metric entropy, it seems relevant to study also these compositions. The Lebesgue measure is not preserved by them. Instead, the numerical results in Figure 4 and in Figure 5 suggest respectively that:

• • $f_{\widetilde \rho }^2$ preserves the probability measure supported and uniformly distributed on the set $[1]$ ;

• • $f_{\rho }\circ f_{\widetilde \rho }$ preserves a probability measure $\mu $ uniformly distributed on both $[0]$ and $[1]$ and such that $\mu ([0])> \mu ([1])$ ; most likely, $\mu ([0]) = 2/3$ and $\mu ([1]) = 1/3$ .

Figure 4

Numerical results on the first iterates of $f_{\widetilde \rho }$ . The graphs show how many, out of approximately 150,000 randomly selected points from $[0,1]$ , occupy the subintervals of length $2^{-8}$ at each iterate.

Figure 5

Numerical results on the first iterates of $f_{\rho }\circ f_{\widetilde \rho }$ . The graphs show how many, out of approximately 150,000 randomly selected points from $[0,1]$ , occupy the subintervals of length $2^{-8}$ at each iterate.

We conclude this section with some thoughts on the entropy of the map $f_{\rho }^2$ . As we already said, the topological entropy of $f_{\rho }$ (thus, of $f_{\rho }^2$ ) is infinite. The link between topological entropy and metric entropy, in a compact metric space, is expressed by the well-known variational principle:

(3.21) $$ \begin{align} h(f)=\sup\{h_{\mu}(f): \mu\ \text{is an } f\text{-invariant Borel measure}\}, \end{align} $$

where $h(f)$ is the topological entropy and $h_{\mu }(f)$ is the metric entropy with respect to $\mu $ . Classically, the variational principle is stated assuming that the map f is continuous (the elegant proof by M. Misiurewicz is given, for instance, in [Reference Petersen17]).

A remarkable result of the already cited (and, in our opinion, somewhat underestimated) work [Reference Čiklová4] is that the variational principle holds in far greater generality. In fact, if we use the metric definition of topological entropy given by Bowen and Dinaburg [Reference Bowen3, Reference Dinaburg7], Theorem 3.18 in [Reference Čiklová4] shows that the variational principle holds for completely general self-maps of a compact metric space.

Another relatively recent development, whose application to our model-case erasing map looks interesting, is the theory of entropy structure due to Downarowicz (see [Reference Downarowicz8]), which studies how the entropy emerges when improving the topological resolution power, and allows to define some powerful dynamical invariants. The theory can be applied to discontinuous maps through the passage to an extension of the system (preserving the entropy of invariant measures) in which the map is continuous. This is a viable approach if the set of discontinuities has measure zero for all invariant measures of positive metric entropy (see [Reference Downarowicz9], especially Chs. 6–9), which seems like a reasonable hope in the case of $f_{\rho }^2$ , whereas things are more difficult for $f_{\rho }$ .

The investigation of invariant measures for $f_{\rho }^2$ (which, we recall, has a dense set of discontinuities), other than the Lebesgue measure, seems particularly interesting in view of the aforementioned results.

4 More general erasing maps

In this section we address the problem of generalizing the results proven up to now to a larger class of interval maps generated by erasing substitutions.

We start by defining more formally a concept already introduced at the beginning of §3.

Definition 4.1. We say that the k-block substitution $\sigma $ is alternating if there exist k simple substitutions $\sigma _1,\sigma _2,\ldots , \sigma _k$ such that the map $\sigma _e$ defined below is an extension of $\sigma $ on $\{0,1\}^{\infty }$ :

(4.1) $$ \begin{align} \sigma_e(u)=\prod_{j=0}^{n-1} \bigg(\prod_{i=1}^k \sigma_i(u_{i+jk})\bigg)\prod_{i=1}^m \sigma_i(u_{i+nk}), \end{align} $$

where $|u|=nk+m$ ( $n,m\in \mathbb {N}_0$ , $m<k$ ) and the first (last) product has to be taken as empty if $n=0$ ( $m=0$ ).

The substitution $\rho $ is indeed alternating, as shown by (2.4) and subsequent comments.

In [Reference Della Corte and Farotti5], erasing substitutions have been classified in a hierarchy according to the ‘strength’ of their erasing character. In particular, a k-block substitution $\sigma $ is defined as follows.

1. (1) Completely erasing if it is alternating (in the sense of Definition 4.1) and, for every $w\in \{0,1\}^*$ , there is $n \in \mathbb {N}$ such that

   (4.2) $$ \begin{align} \sigma^n(w)=\epsilon. \end{align} $$
   The smallest positive integer n verifying (4.2), indicated by $\epsilon (w)$ , is called vanishing order of w. The topological entropy of $f_{\sigma }$ depends on the asymptotic behavior of the vanishing order of words of increasing length.

2. (2) Boundedly erasing if $\sigma $ is completely erasing and $\epsilon (\cdot )$ is bounded over $\{0,1\}^*$ .

In [Reference Della Corte and Farotti5] the concept of strongly erasing substitution was also introduced, an intermediate property between being erasing and completely erasing, but it is not relevant herein.

Boundedly erasing substitutions can be interpreted as an extreme, uninteresting case, because the dynamics of boundedly erasing maps is almost trivial (see [Reference Della Corte and Farotti5, Lemma 4.1]). Completely erasing substitutions, instead, show the richest topological dynamical properties. Thus, it is natural to try to establish the strong mixing property for the class of interval maps generated by completely erasing substitutions. However, things do not look easy.

First, understanding whether $f_{\sigma }$ is always Borel singular if $\sigma $ is completely erasing seems not trivial. In [Reference Della Corte, Isola and Piergallini6], the singularity of the map $f_{\rho }$ was established through a quite ad hoc argument connected to normal real numbers in base $2$ . The argument has a combinatorial nature and it boils down to showing that the $f_{\rho }$ -image of a $2$ -normal real number cannot be $2$ -normal by upper/lower bounding the asymptotic frequencies of blocks of length $8$ (see [Reference Della Corte, Isola and Piergallini6, Proposition 5.2]). None of that can be straightforwardly extended to a generic completely erasing substitution.

The existence of an absolutely continuous measure which is preserved by $f_{\sigma }^2$ under the sole hypothesis that $\sigma $ is completely erasing looks also far from trivial to establish. The reasoning in Theorem 2.4 is based on the possibility of counting explicitly the number of distinguishable insertions of the pair 00 in a given binary word which does not have any 00 subword. To achieve this, it was enough to consider the insertions made at the left of every digit 1 in the original word.

In the case of general completely erasing substitutions, indicating as usual by $w_{\epsilon }$ the word mapped to the empty word, this amounts to counting the distinguishable insertions of suitable circular permutations of $w_{\epsilon }$ in the original word w. The difficulty, here, lies in the identification of indistinguishable cases. For instance, let us consider the completely erasing k-block substitution $\sigma $ and the case in which we have just one insertion of (a suitable circular permutation of) the word mapped to $\epsilon $ in a given word $u\in \{0,1\}^n$ . In this case, we should check how many of the following word (non-)equalities hold for $0\le h\le k$ , $0\le j\le k$ and $m,m'$ such that $mk+h+1\le n$ and $m'k+j+1\le n$ :

$$ \begin{align*} &u_1\ldots u_{mk+h} (w_{\epsilon})_{h+1}\ldots (w_{\epsilon})_k (w_{\epsilon})_1\ldots (w_{\epsilon})_{h} u_{mk+h+1}\ldots u_n\\& \quad \ne u_1\ldots u_{m'k+j} (w_{\epsilon})_{j+1}\ldots (w_{\epsilon})_k (w_{\epsilon})_1\ldots (w_{\epsilon})_{j} u_{m'k+j+1}\ldots u_n. \end{align*} $$

where by $(w_{\epsilon })_i$ we mean the ith digit of the word $w_{\epsilon }$ .

The problem becomes much more intricate when we consider multiple insertions of the circular permutations of $w_{\epsilon }$ . This would ultimately lead to a countable family of word equalities, and it seems unlikely that this approach will prove suitable to achieve the result. Probably, in order to study the existence of absolutely continuous invariant measures for (the square of) general erasing maps, new ideas have to be used.