No CrossRef data available.
Article contents
Some complexity results in the theory of normal numbers
Published online by Cambridge University Press: 28 September 2020
Abstract
Let $\mathcal {N}(b)$ be the set of real numbers that are normal to base b. A well-known result of Ki and Linton [19] is that $\mathcal {N}(b)$ is $\boldsymbol {\Pi }^0_3$ -complete. We show that the set ${\mathcal {N}}^\perp (b)$ of reals, which preserve $\mathcal {N}(b)$ under addition, is also $\boldsymbol {\Pi }^0_3$ -complete. We use the characterization of ${\mathcal {N}}^\perp (b),$ given by Rauzy, in terms of an entropy-like quantity called the noise. It follows from our results that no further characterization theorems could result in a still better bound on the complexity of ${\mathcal {N}}^\perp (b)$ . We compute the exact descriptive complexity of other naturally occurring sets associated with noise. One of these is complete at the $\boldsymbol {\Pi }^0_4$ level. Finally, we get upper and lower bounds on the Hausdorff dimension of the level sets associated with the noise.
Keywords
- Type
- Article
- Information
- Copyright
- © Canadian Mathematical Society 2020
Footnotes
The first author was supported by the National Science Foundation Graduate Research Fellowship grant DGE-1656466. The second author was supported by NSF grant DMS-1800323. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. The authors wish to thank the referee for several suggestions which significantly improved the paper.