Hausdorff Dimension Games

• Hausdorff dimension games are two-player strategy games that characterize fractal sets by using covering arguments and set-theoretic operations.
• The games establish an equivalence between winning strategies and the Hausdorff dimension threshold, yielding powerful regularity and compactness results.
• They integrate classical Hausdorff measures with modern descriptive set theory and Schmidt-type games, informing optimal strategies and further developments in fractal geometry.

Hausdorff dimension games are a class of two-player games constructed to characterize and analyze the Hausdorff dimension of subsets in metric or topological spaces. Stemming from the foundational work of Das, Fishman, Simmons, and Urbański, they model the interplay between covering arguments and set-theoretic operations, providing both theoretical and constructive frameworks for dimension theory. These games connect classical Hausdorff measure and more recent developments in descriptive set theory, determinacy, and fractal geometry, often enabling sharp geometric and regularity statements for analytic, Borel, or arbitrary sets under strong set-theoretic assumptions.

1. Definitions and Variants of Hausdorff-Dimension Games

At the core is the original δ-dimension game $G^{\delta}_\beta(A)$ played with parameters $0 < \beta < 1/2$ and initial scale. Let $A \subset \mathbb{R}^d$ be a target set. At stage $n$, Player I selects a finite, $3\rho_n$-separated set $F_n \subset \mathbb{Q}^d$ with $F_n \subset B(x_{n-1}, (1-\beta)\rho_{n-1})$ (for $n>0$), $\rho_n = \beta\rho_{n-1}$, and an asymptotic "size rule":

$$\prod_{i < n}|F_i|^{-1}\cdot \beta^{\delta n} \leq c \quad \text{for some }c<\infty \text{ and all large }n.$$

Player II then chooses $x_n \in F_n$. The outcome is the (possibly unique) limit point $x = \lim_n x_n$. Player II wins if $x\in A$, otherwise Player I wins.

A more flexible version, $G^\delta_{\vec{\beta}}(A)$, uses a sequence $\vec{\beta} = (\beta_n)$ satisfying suitable decay conditions (e.g., $\beta_n \geq (\prod_{i<n}\beta_i)^\eta$ for any $\eta > 0$ eventually) and adapts the size rule and separation accordingly.

These games can be unfolded further: given a relation $F \subset \mathbb{R}^d \times \omega^\omega$ and $A = \mathrm{proj}(F)$, Player I can interleave "witness" moves spelling out $y \in \omega^\omega$; Player II wins if $(x, y) \in F$. This unfolded game supports uniformization and additivity results within models admitting the Axiom of Determinacy (AD) (Crone et al., 2020).

2. Main Characterization Theorems

The fundamental result is the equivalence between determinacy of the game and the Hausdorff dimension threshold:

• Player II has a winning strategy in $G^\delta_\beta(A)$ $\iff$ $\dim_H(A) \geq \delta$.
• Player I has a winning strategy $\iff$ $\dim_H(A) \leq \delta$ (Crone et al., 2020).

For $G^\delta_{\vec{\beta}}(A)$ with decaying $\beta_n$, the characterization remains valid, and in fact Player II's victory yields the existence of a compact subset $K \subset A$ with $\dim_H(K) \geq \delta$—a strong regularity property.

The unfolded games, combining coordinate and witness plays, preserve this threshold: a winning strategy for Player II in the unfolded game translates into an ordinary $s$-game victory for any $s > \delta$.

3. Unfolding Principle and Its Consequences

The unfolded δ-dimension game allows Player I to "spell out" an independent witness sequence $y \in \omega^\omega$ in addition to controlling covers, modeling projection and uniformization problems. The key combinatorial lemma ensures any large enough family with $n$ linear orders has an element whose initial segments are large in each order, providing the backbone for simulating multiple witnesses in parallel.

The unfolding theorem asserts: if Player II has a winning strategy in the unfolded δ-game for relation $F$, then she can win in the ordinary $s$-game for every $s > \delta$ on $A = \mathrm{proj}(F)$ (Crone et al., 2020). This result is critical for transferring regularity properties from pairs $(x, y)$ to projections and domains.

4. Applications in Regularity and Additivity

Under the Axiom of Determinacy (AD), Hausdorff-dimension games underlie several central dimension-theoretic results:

• Continuous uniformization: For $R \subset \mathbb{R}^d \times \omega^\omega$ with $\dim_H(\mathrm{dom}\,R) \geq \delta$, for any $\delta' < \delta$, there exists a compact $K \subset \mathrm{dom}\,R$, $\dim_H K \geq \delta'$, and a continuous $f : K \to \omega^\omega$ with $(x, f(x)) \in R$ for all $x$.
• Full additivity: Any well-ordered union $A = \bigcup_{\alpha < \theta} A_\alpha$ with $\dim_H A_\alpha \leq \delta$ for each $\alpha$, but $\dim_H A > \delta$, leads to a contradiction. Thus under AD, the supremum of the dimensions of a well-ordered family bounds the dimension of the union.
• Compact sets of nearly full dimension: Any analytic $A \subset \mathbb{R}^d$ of Hausdorff dimension $D$ contains compact $K \subset A$ with $\dim_H K \geq D'$ for any $D' < D$ (Crone et al., 2020).

5. Generalizations and Connections to Schmidt-Type Games

The Hausdorff-dimension game is tightly related to Schmidt games and their numerous variants (classical, potential, matrix-potential, rapid) (Bellaïche et al., 13 Jan 2026, Broderick et al., 2017, Howat et al., 15 Aug 2025, Hatefi et al., 2024). All of these games share the principle of two players alternately refining covers while controlling geometric or measure-theoretic complexity.

Recent work has unified these tree-structured games under a game-theoretic covering model: the minimum Hausdorff dimension necessary for a "win" can be precisely recovered from the covering rates allowed to Player I (Bellaïche et al., 13 Jan 2026). In finite-branching settings, the value of the dimension game coincides with the Hausdorff dimension of the target set. These connections yield transparent proofs for sharp winning thresholds in alternating-move games in terms of Hausdorff dimension, e.g., $\dim_H(W) < 1/2$ implies a Player II win in the infinite binary digit game.

6. Comparison with Other Dimension and Measure Games

Hausdorff-dimension games possess several features that make them distinct:

• Sharpness: The size-rule calibrates precisely to the δ-dimensional Hausdorff scaling, avoiding excess or loss in dimension estimates.
• Projective and analytic regularity: For pointclasses such as analytic or well-ordered unions under AD, these games yield dimension-regularity properties not accessible purely from classical covering arguments.
• Unfolding and uniformization: The ability to force witnesses through auxiliary coordinates underlines the utility of these games in projection and selection problems.
• Robustness to coding: Results extend from $\mathbb{R}^d$ to Polish spaces and to relations modeling descriptive set-theoretic complexity.

7. Open Problems and Directions

Several further avenues are open for Hausdorff-dimension games:

• Optimal strategies and constructive bounds: While the above results provide existence, quantifying the minimal cover-branching or separation needed for optimal strategies remains of interest.
• Extensions to other fractal dimensions: The extension of characterization theorems to packing, box, or Assouad dimensions within the same framework may yield finer dichotomies.
• Descriptive set-theoretic hierarchies: The interface with determinacy, Borel complexity, and higher projective levels offers a rich field for dimension games and uniformization phenomena.
• Connection to potential and matrix-potential games: Integrating anisotropic scales and Alice/Bob deletion mechanisms points toward a more unified synthesis of geometric fractal games over general metric structures (Howat et al., 15 Aug 2025).

Hausdorff dimension games thus provide a fundamental and flexible toolkit for both the structural and quantitative analysis of fractal geometry, with deep implications for descriptive set theory and geometric measure theory (Crone et al., 2020, Bellaïche et al., 13 Jan 2026).