Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the descriptive complexity of Salem sets (2009.09888v3)

Published 21 Sep 2020 in math.LO and math.DS

Abstract: In this paper we study the notion of Salem set from the point of view of descriptive set theory. We first work in the hyperspace $\mathbf{K}([0,1])$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol{\Pi}0_3$-complete family. This is done by characterizing the complexity of the family of sets having sufficiently large Hausdorff or Fourier dimension. We also show that the complexity does not change if we increase the dimension of the ambient space and work in $\mathbf{K}([0,1]d)$. We then generalize the results by relaxing the compactness of the ambient space, and show that the closed Salem sets are still $\boldsymbol{\Pi}0_3$-complete when we endow the hyperspace of all closed subsets of $\mathbb{R}d$ with the Fell topology. A similar result holds also for the Vietoris topology.

Summary

We haven't generated a summary for this paper yet.