The Fine Structure of Dyadically Badly Approximable Numbers
Abstract
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle S and the smallest distance to an integer \|·\| we give elementary proofs that the set F(c) = \x ∈ S: \|2nx\| ≥ c, n≥ 0\ is a fractal set whose Hausdorff dimension depends continuously on c, is constant on intervals which form a set of Lebesgue measure 1 and is self-similar. Hence it has a fractal graph. Moreover, the dimension of F(c) is zero if and only if c≥ 1-2τ, where τ is the Thue-Morse constant. We completely characterise the intervals where the dimension remains unchanged. As a consequence we can completely describe the graph of c H \x∈[0,1]: \|x-m2n\|< c2n finitely often\.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.