The range of dimensions of microsets

TL;DR

This paper characterizes the possible Hausdorff dimensions of microsets of a compact set in Euclidean space, showing they form exactly the analytic sets containing their bounds, and extends results to packing and box dimensions.

Contribution

It provides a complete characterization of the dimension sets of microsets, answering a question by Fraser et al., and introduces stochastic co-dimension techniques for fractal percolations.

Findings

The set of Hausdorff dimensions of microsets can be any non-empty analytic set containing its bounds.

Constructs a compact set with microsets' dimensions exactly matching a given analytic set.

Extends the analysis to packing and box dimensions.

Abstract

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and moreover, $E \cap (0, 1)^d \neq \emptyset$. The main result of the paper is that for a non-empty set $A\subset [0,d]$ there is a compact set $K\subset \mathbb{R}^d$ such that the set of Hausdorff dimensions attained by the microsets of $K$ equals $A$ if and only if $A$ is analytic and contains its infimum and supremum. This answers a question of Fraser, Howroyd, K\"aenm\"aki, and Yu. We show that for every compact set $K\subset \mathbb{R}^d$ and non-empty analytic set $A\subset [0,\dim_H K]$ there is a set $\mathcal{C}$ of compact subsets of $K$ which is compact in the Hausdorff metric and $\{\dim_H C: C\in \mathcal{C} \}=A$. The proof relies on the technique of stochastic co-dimension applied for a suitable coupling of fractal percolations with generation dependent retention probabilities. We also examine the analogous problems for packing and box dimensions.