4.3 Rozier–Terracol Lemma 2.3
For any \(j, m \in \mathbb {N}\), the parity of the iterates at \(m\) and \(m + 2^j\) are opposite:
By the linear decomposition \(2^j T^j(n) = 3^{q} n + \mathcal{Q}_j(n)\), and the fact that \(V_j(m + 2^j) = V_j(m)\), we have \(T^j(m + 2^j) = T^j(m) + 3^q\). Since \(3^q\) is always odd, \(T^j(m + 2^j)\) and \(T^j(m)\) have opposite parity.
The correction ratio \(E_j(n)\) is periodic with period \(2^j\):
Since \(E_j(n)\) depends only on the parity vector \(V_j(n)\), and \(V_j(n)\) is periodic with period \(2^j\), the result follows.
For any \(j, m \in \mathbb {N}\), we have the identity:
Using the recurrence \(E_{j+1}(n) = \frac{3^{X(T^j(n))}}{2} E_j(n) + \frac{X(T^j(n))}{2}\) and the shift properties:
For every positive integer \(j\), the average value of the correction ratio \(E_j(n)\) over a full period is \(j/4\):
By induction on \(j\). For \(j=1\), the average is \((E_1(1) + E_1(2))/2 = (1/2 + 0)/2 = 1/4\). For the inductive step \(j+1\), we split the sum over \(\{ 1, \dots , 2^{j+1}\} \) into two halves and use Lemma 132:
Dividing by \(2^{j+1}\) yields \((j+1)/4\).