Effectively closed sets of measures and randomness
Jan Reimann

TL;DR
The paper establishes a connection between strong Hausdorff $h$-randomness and randomness for certain continuous measures, introducing new measure construction methods and applying them to classical results like Frostman's Lemma.
Contribution
It introduces a novel measure construction technique based on effective transformations and applies it to unify and extend results in randomness and Hausdorff measure theory.
Findings
Strong Hausdorff $h$-randomness implies measure-based randomness.
New proof of Frostman's Lemma using effective measure construction.
Collapse of various randomness notions for Hausdorff measures.
Abstract
We show that if a real is strongly Hausdorff -random, where is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure such that the -measure of the basic open cylinders shrinks according to . The proof uses a new method to construct measures, based on effective (partial) continuous transformations and a basis theorem for -classes applied to closed sets of probability measures. We use the main result to give a new proof of Frostman's Lemma, to derive a collapse of randomness notions for Hausdorff measures, and to provide a characterization of effective Hausdorff dimension similar to Frostman's Theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals
