Computable Characterizations of Hausdorff Packing Regularity
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
Let $2^\omega=\{0,1\}^{{\mathbb{N}}}$ be Cantor space, where ${\mathbb{N}}=\{0,1,2,\ldots\}$, and let $A\subseteq 2^\omega$. The usual metric interpretation is the ultrametric $d(x,x)=0$ and, for $x\ne y$, \[ d(x,y)=2^{-\min\{n\in{\mathbb{N}}:x(n)\ne y(n)\}}. \] This metric convention is made explicit for interpretation; the supplied record does not specify a metric, and this convention requires source confirmation. Write $\dim_H(A)$ and $\dim_P(A)$ for the classical Hausdorff and packing dimensions of $A$, respectively. In the terminology of this problem, $A$ is regular precisely when \[ \dim_H(A)=\dim_P(A). \] A subset of Cantor space is analytic if it is empty or is the image of Baire space ${\mathbb{N}}^{\mathbb{N}}$ under a continuous map into $2^\omega$.The supplied record poses the following research questions.
- For arbitrary $A\subseteq 2^\omega$, can computability theory provide a partial characterization of the equality $\dim_H(A)=\dim_P(A)$? The record does not specify the computability property sought, allowable oracles, or the meaning of a partial characterization.
- For analytic $A\subseteq 2^\omega$ satisfying $\dim_H(A)=\dim_P(A)$, can point-to-set principles provide an alternative proof of the referenced closed-subset result?
- Can the analyticity hypothesis in that closed-subset result be removed?
Short English statement
The problem asks whether computability theory can help characterize subsets of Cantor space whose Hausdorff and packing dimensions agree, and whether point-to-set principles can reprove and extend a closed-subset theorem for regular analytic sets. The theorem itself and the intended computability criterion are unspecified, so those parts remain unresolved formulation issues.Sources
- Local UnsolvedMath registry, permanent ID $30004675$, title: Computable Characterizations of Hausdorff Packing Regularity; exact source problem code:
catalogue entry. The supplied record belongs to the Oberwolfach Reports Open Problems collection, gives proposed year $2021$, and names no individual proposer. - Supplied source citation: Computability Theory (2022), Oberwolfach Reports, pp. 1149--1190, DOI
10.4171/owr/2021/21. https://doi.org/10.4171/owr/2021/21. The background describes these reports as documenting mathematical workshops and their open-problem discussions. The citation's $2022$ designation and the $2021$ report identification are retained as supplied. - Stull, Optimal oracles for point-to-set principles. Supplied literature source: https://arxiv.org/abs/2101.11152.
- Peng, Wu and Yu, Some consequences of TD and sTD. Supplied literature source: https://doi.org/10.1017/jsl.2023.29.
- Oberwolfach Report 21/2021. Supplied literature source: https://ems.press/content/serial-article-files/46899.
- Literature assessment dated exactly
2026-08-22: the supplied curation labels the problem partially solved and reports that point-to-set principles and optimal-oracle results settle substantial analytic and regular-set cases, while determinacy-based work extends closed-subset conclusions beyond analytic sets under extra axioms. It further reports that the full computability characterization and unconditional removal of analyticity remain open. This is supplied dated curation derived from the OWR record, not an independently verified literature assessment; its time-sensitive status and cited claims require independent verification. - The supplied statement status is
corrected_verified. Its accompanying verification note says that only formula delimiters, notation, grammar, and typography were repaired, with mathematical content and scope preserved. This supplied label does not establish mathematical correctness or resolve the missing formulation details.
Statement licence: CC-BY-SA-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.