Borel complexity of sets of normal numbers via generic points in subshifts with specification

From MaRDI portal
Publication:5114741

DOI10.1090/TRAN/8001zbMATH Open1484.03088arXiv1811.04450OpenAlexW2979706303WikidataQ127121315 ScholiaQ127121315MaRDI QIDQ5114741FDOQ5114741

Author name not available (Why is that?)

Publication date: 25 June 2020

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: We study the Borel complexity of sets of normal numbers in several numeration systems. Taking a dynamical point of view, we offer a unified treatment for continued fraction expansions and base r expansions, and their various generalisations: generalised L"uroth series expansions and -expansions. In fact, we consider subshifts over a countable alphabet generated by all possible expansions of numbers in [0,1). Then normal numbers correspond to generic points of shift-invariant measures. It turns out that for these subshifts the set of generic points for a shift-invariant probability measure is precisely at the third level of the Borel hierarchy (it is a Pi30-complete set, meaning that it is a countable intersection of Fsigma-sets, but it is not possible to write it as a countable union of Gdelta-sets). We also solve a problem of Sharkovsky--Sivak on the Borel complexity of the basin of statistical attraction. The crucial dynamical feature we need is a feeble form of specification. All expansions named above generate subshifts with this property. Hence the sets of normal numbers under consideration are Pi30-complete.


Full work available at URL: https://arxiv.org/abs/1811.04450





Cites Work


Cited In (6)






This page was built for publication: Borel complexity of sets of normal numbers via generic points in subshifts with specification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114741)