Borel complexity of sets of points with prescribed Birkhoff averages in Polish dynamical systems with a specification property

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Deka, Konrad, Jackson, Steve, Kwietniak, Dominik, Mance, Bill
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915441749786624
author Deka, Konrad
Jackson, Steve
Kwietniak, Dominik
Mance, Bill
author_facet Deka, Konrad
Jackson, Steve
Kwietniak, Dominik
Mance, Bill
contents We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a $T$-invariant Borel probability measure, but we also consider much more general sets (for example, $α$-Birkhoff regular sets and the irregular set appearing in multifractal analysis of ergodic averages of a continuous real-valued function). We show that many of these sets are Borel. In fact, all these sets are Borel when we assume that our space is compact. We provide examples of these sets being non-Borel, properly placed at the first level of the projective hierarchy (they are complete analytic or co-analytic). This proves that the compactness assumption is in some cases necessary to obtain Borelness. When these sets are Borel, we use the Borel hierarchy to measure their descriptive complexity. We show that the sets of interest are located at most at the third level of the hierarchy. We also use a modified version of the specification property to show that for many dynamical systems these sets are properly located at the third level. To demonstrate that the specification property is a sufficient, but not necessary condition for maximal descriptive complexity of a set of generic points, we provide an example of a compact minimal system with an invariant measure whose set of generic points is $Π^0_3$-complete.
format Preprint
id arxiv_https___arxiv_org_abs_2210_08937
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Borel complexity of sets of points with prescribed Birkhoff averages in Polish dynamical systems with a specification property
Deka, Konrad
Jackson, Steve
Kwietniak, Dominik
Mance, Bill
Dynamical Systems
Logic
We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a $T$-invariant Borel probability measure, but we also consider much more general sets (for example, $α$-Birkhoff regular sets and the irregular set appearing in multifractal analysis of ergodic averages of a continuous real-valued function). We show that many of these sets are Borel. In fact, all these sets are Borel when we assume that our space is compact. We provide examples of these sets being non-Borel, properly placed at the first level of the projective hierarchy (they are complete analytic or co-analytic). This proves that the compactness assumption is in some cases necessary to obtain Borelness. When these sets are Borel, we use the Borel hierarchy to measure their descriptive complexity. We show that the sets of interest are located at most at the third level of the hierarchy. We also use a modified version of the specification property to show that for many dynamical systems these sets are properly located at the third level. To demonstrate that the specification property is a sufficient, but not necessary condition for maximal descriptive complexity of a set of generic points, we provide an example of a compact minimal system with an invariant measure whose set of generic points is $Π^0_3$-complete.
title Borel complexity of sets of points with prescribed Birkhoff averages in Polish dynamical systems with a specification property
topic Dynamical Systems
Logic
url https://arxiv.org/abs/2210.08937