A point to set principle for finite-state dimension
Abstract
Effective dimension has proven very useful in geometric measure theory through the point-to-set principle [8] that characterizes Hausdorff dimension by relativized effective dimension. Finite-state dimension is the least demanding effectivization in this context [2] that among other results can be used to characterize Borel normality [1].
In this paper we prove a characterization of finite-state dimension in terms of information content of a real number at a certain precision. We then use this characterization to give a robust concept of relativized normality and prove a finite-state dimension point-to-set principle. We finish with an open question on the equidistribution properties of relativized normality.
1 Introduction
Effective dimension was introduced in [7, 6] as an effectivization of Hausdorff dimension. One of its generalizations is finite-state dimension [2] that is a robust notion that interacts with compression and characterizes Borel normality [1].
In [8] Lutz and Lutz proved a point-to-set principle that characterizes Hausdorff dimension in terms of relativized effective dimension. This principle has already produced a number of interesting results in geometric fractal theory through computability based proofs (see [5, 9] and a number of more recent results such as [4]).
In this paper we provide a characterization of finite-state dimension on Euclidean space based on the finite-state information content of a real number at a certain precision, which also provides an alternative characterization of Borel normality. This new characterization gives rise to a natural and robust relativization of finite state dimension with the strong property of a finite-state dimension point-to-set principle. We finish with open questions on the equidistribution properties of the corresponding relativized normality.
2 Preliminaries
Let be a finite alphabet. We write for the set of all (finite) strings over and for the set of all (infinite) sequences over . We write for the length of a string or sequence , and we write for the empty string, the string of length 0. For and , we write . For and , we say that is a prefix of , and we write , if .
A finite-state transducer (-FST) is a 4-tuple , where
-
•
is a nonempty, finite set of states,
-
•
is the transition function,
-
•
is the output function, and
-
•
is the initial state.
For and , we define the output from state on input to be the string defined by the recursion
for all and . We then define the output of on input to be the string .
For each integer we let be the alphabet of base- digits. We use infinite sequences over to represent real numbers in . Each is associated the real number and for each , is the infinite sequence that does not finish with infinitely many and such that .
A set of real numbers is represented by the set
of sequences. If then
We will denote with the set of rational numbers that have finite representation in base , that is,
We will write for when .
3 An euclidean characterization of finite-state dimension and Borel normality
Finite-state dimension was introduced in [2] on the space of infinite sequences over a finite alphabet. The original definition in terms of gambling was proven robust by several characterizations in terms of information lossless compression [2] and several versions of entropy [1].
Here we present an alternative definition on the Euclidean space and then prove its equivalence with [2].
Definition. Let be a -FST and let . The -information content of is
Definition. Let be a -FST, and . The base- -information content of at precision is
We next define the finite-state dimension of points and sets.
Definition. Let . Let and . The base- finite-state dimension of is
the base- finite-state dimension of is
Observation 3.1
.
The definition of finite-state dimension from [2] is usually done in a space of infinite sequences, while identifying and through or base- representation.
Doty and Moser [3] proved that finite dimension on sequences can be characterized in terms of finite-state transducers.
Theorem 3.2 ([3])
Let ,
We next show that the notion of information content at a certain precision characterizes finite-state dimension.
Theorem 3.3
For each , , and
Proof. Let , let . Then for every and -FST, and therefore .
For each , let be the complementary of , that is, for .
Claim 3.4
. .
Claim 3.5
.
To prove this claim, notice that needs to be witnessed either by approximations from above or for approximations from below and that tighter approximations can be delayed.
That is, for every FST there exist and infinitely many such that
For each let be such that and . Let be such that . Then , and for , either
or
Therefore either or and the claim follows.
Since finite-state dimension in the space of sequences characterizes Borel normality [1], we have an alternative characterization of normality in terms of finite-state dimension in the Euclidean space.
Corollary 3.6
Let , . is -normal if and only if , that is,
4 Point to set principle for finite-state dimension
We denote as separator a set such that is countable and dense in [0,1].
Definition. A separator enumerator (SE) is a function such that is a separator.
For each separator enumerator we can define information content in relative to .
Definition. Let be a SE. Let be a -FST, and . The --information content of at precision is
Definition. Let be a SE. Let and . The -enumerator finite-state dimension of is
the -enumerator finite-state dimension of is
We can generalize Borel normality through the same relativization.
Definition. Let be a SE, let . is -normal if .
Given this natural relativization of finite-state dimension we next prove a point-to-set principle stating that for every set there exists an SE such that classical Hausdorff dimension of is exactly -finite-state dimension. This implies that classical geometrical measure theory results can be obtained using only finite-state dimension.
Theorem 4.1
Let .
Proof. Let be such that from the point-to-set principle in [8]. Le be the universal oracle Turing Machine used in the definition of Kolmogorov Complexity for effective dimension . Let be such that when is defined, and otherwise. Then is the required SE.
Notice that the previous theorem holds even when fixing a particular countable dense set. In terms of Borel normality, it shows that reordering the set of base- finite representation numbers is enough to obtain normality for any other base.
5 Conclusions and open questions
We expect that our main theorem will prove new lower bounds on Hausdorff dimension in different settings. Notice that the result can be directly translated into any separable metric space and any reasonable gauge family.
Our result helps clarify the oracle role in the point to set principles. The next step would be to classify the different enumerations of a countable dense set.
We believe that the notion of -normal sequence can be of independent interest with robustness properties inherited from those of the original concept, for instance from the fact that is -normal exactly when the sequence is equidistributed modulo 1.
Open question. Let be a SE, let . For each , let for such that and is minimum. Can we characterize -normality in terms of the equidistribution properties of ?
References
- [1] C. Bourke, J. M. Hitchcock, and N. V. Vinodchandran. Entropy rates and finite-state dimension. Theoretical Computer Science, 349(3):392–406, 2005.
- [2] J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo. Finite-state dimension. Theoretical Computer Science, 310:1–33, 2004.
- [3] D. Doty and P. Moser. Finite-state dimension and lossy decompressors. Technical Report CoRR abs/cs/0609096, Arxiv, 2006.
- [4] D. S. Jacob B. Fiedler. Pinned distances of planar sets with low dimension. Technical Report arXiv:2408.00889 [math.CA], arXiv.org, 2024.
- [5] J. Lutz and N. Lutz. Who asked us? how the theory of computing answers questions about analysis. In Complexity and Approximation: In Memory of Ker-I Ko, pages 48–56. Springer, Ding-Zhu Du and Jie Wang (eds.) edition, 2020.
- [6] J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32(5):1236–1259, 2003.
- [7] J. H. Lutz. The dimensions of individual strings and sequences. Information and Computation, 187(1):49–79, 2003.
- [8] J. H. Lutz and N. Lutz. Algorithmic information, plane Kakeya sets, and conditional dimension. ACM Transactions on Computation Theory, 10, 2018. Article 7.
- [9] J. H. Lutz and E. Mayordomo. Algorithmic fractal dimensions in geometric measure theory. In V. Brattka and P. Hertling, editors, Handbook of Computability and Complexity in Analysis, pages 271–302. Springer-Verlag, 2021.