On numbers badly approximable by dyadic rationals (Q836105): Difference between revisions

In this interesting and well-written paper, the author considers real numbers which are badly approximated by dyadic rationals, \textit{i.e.}, rationals whose denominator is a power of \(2\). It is shown that the set of numbers \(x \in [0,1)\) such that \(2^n x \geq c \pmod 1\) for any positive integer \(n\) is a fractal set. The dimension of this set evidently depends on \(c\), and it is shown that this dependence is continuous. Furthermore, the dimension is constant on a family of disjoint intervals, whose union is full in the sense of Lebesgue. The author identifies these intervals. The results are proved by translating the problem into a problem in symbolic dynamics, namely the shift on the digits of the binary expansion of a real number. To analyze the components where the dimension is constant as a function of \(c\), the author uses combinatorial methods on this shift space. To prove that the Hausdorff dimension is a continuous function of \(c\), the topological entropy of the subshifts associated to a given value of \(c\). It is shown that the topological entropy of this subshift -- and hence the Hausdorff dimension of the set to be analyzed -- depends continuously on \(c\).