Jack H. Lutz
Abstract
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways;
(1) We prove a point-to-set principle that enables one to use the (relativized, constructive) dimension of a single point in a set E in a Euclidean space to establish a lower bound on the (classical) Hausdorff dimension of E. We then use this principle, together with conditional Kolmogorov complexity in Euclidean spaces, to give a new proof of the known, two-dimensional case of the Kakeya conjecture. This theorem of geometric measure theory, proved by Davies in 1971, says that every plane set containing a unit line segment in every direction has Hausdorff dimension 2.
(2)We use conditional Kolmogorov complexity in Euclidean spaces to develop the lower and upper conditional dimensions dim(x|y) and Dim(x|y) of x given y, where x and y are points in Euclidean spaces. Intuitively, these are the lower and upper asymptotic algorithmic information densities of x conditioned on the information in y. We prove that these conditional dimensions are robust and that they have the correct information-theoretic relationships with the well-studied dimensions dim(x) and Dim(x) and the mutual dimensions mdim(x : y) and Mdim(x : y).
- K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. 2007. Effective strong dimension in algorithmic information and computational complexity. SIAM J. Comput. 37, 3, 671--705. Google Scholar
Digital Library
- A. S. Besicovitch. 1919. Sur deux questions d’intégrabilité des fonctions. J. Soc. Phys. Math. l’Univ. Perm 2, 105--123.Google Scholar
- A. S. Besicovitch. 1928. On Kakeya’s problem and a similar one. Math. Zeitschr. 27, 312--320.Google ScholarCross Ref
- A. Case and J. H. Lutz. 2015a. Mutual dimension. ACM Trans. Comput. Theory 7, 3, 12. Google ScholarDigital Library
- A. Case and J. H. Lutz. 2015b. Mutual dimension and random sequences. In Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 9235. Springer, 199--210.Google Scholar
- G. J. Chaitin. 1966. On the length of programs for computing finite binary sequences. J. ACM 13, 4, 547--569. Google ScholarDigital Library
- G. J. Chaitin. 1969. On the length of programs for computing finite binary sequences: statistical considerations. J. ACM 16, 1, 145--159. Google ScholarDigital Library
- T. R. Cover and J. A. Thomas. 2006. Elements of Information Theory (2nd ed.). Wiley. Google ScholarDigital Library
- R. O. Davies. 1971. Some remarks on the Kakeya problem. Proc. Cambr. Phil. Soc. 69, 417--421.Google ScholarCross Ref
- R. Dougherty, J. H. Lutz, R. D. Mauldin, and J. Teutsch. 2014. Translating the Cantor set by a random real. Trans. Am. Math. Soc. 366, 3027--3041.Google ScholarCross Ref
- R. Downey and D. Hirschfeldt. 2010. Algorithmic Randomness and Complexity. Springer-Verlag. Google ScholarDigital Library
- Z. Dvir. 2009. On the size of Kakeya sets in finite fields. J. Am. Math. Soc. 22, 1093--1097.Google ScholarCross Ref
- K. Falconer. 2014. Fractal Geometry: Mathematical Foundations and Applications (3rd ed.). Wiley.Google Scholar
- X. Gu, J. H. Lutz, and E. Mayordomo. 2006. Points on computable curves. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS’06). IEEE, Los Alamitos, CA, 469--474. Google ScholarDigital Library
- X. Gu, J. H. Lutz, E. Mayordomo, and P. Moser. 2014. Dimension spectra of random subfractals of self-similar fractals. Ann. Pure Appl. Logic 165, 11, 1707--1726.Google ScholarCross Ref
- F. Hausdorff. 1919. Dimension und äusseres Mass. Math. Ann. 79, 157--179.Google ScholarCross Ref
- A. N. Kolmogorov. 1965. Three approaches to the quantitative definition of information. Probl. Inf. Transmiss. 1, 1, 1--7.Google Scholar
- L. A. Levin. 1973. On the notion of a random sequence. Sov. Math Dokl. 14, 5, 1413--1416.Google Scholar
- L. A. Levin. 1974. Laws of information conservation (nongrowth) and aspects of the foundation of probability theory. Probl. Pered. Inf. 10, 3, 30--35.Google Scholar
- M. Li and P. M. Vitányi. 2008. An Introduction to Kolmogorov Complexity and Its Applications (3rd ed.). Springer. Google ScholarDigital Library
- J. H. Lutz. 2003a. Dimension in complexity classes. SIAM J. Comput. 32, 5, 1236--1259. Google ScholarDigital Library
- J. H. Lutz. 2003b. The dimensions of individual strings and sequences. Inf. Comput. 187, 1, 49--79. Google ScholarDigital Library
- J. H. Lutz and N. Lutz. 2015. Lines missing every random point. Computability 4, 2, 85--102.Google ScholarCross Ref
- J. H. Lutz and E. Mayordomo. 2008. Dimensions of points in self-similar fractals. SIAM J. Comput. 38, 3, 1080--1112. Google ScholarDigital Library
- J. H. Lutz and K. Weihrauch. 2008. Connectivity properties of dimension level sets. Math. Logic Quart. 54, 483--491.Google ScholarCross Ref
- J. M. Marstrand. 1954. Some fundamental geometrical properties of plane sets of fractional dimensions. Proc. Lond. Math. Soc. 4, 3, 257--302.Google ScholarCross Ref
- P. Martin-Löf. 1966. The definition of random sequences. Inf. Contr. 9, 6, 602--619.Google ScholarCross Ref
- E. Mayordomo. 2002. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Inf. Process. Lett. 84, 1, 1--3. Google ScholarDigital Library
- A. Nies. 2009. Computability and Randomness. Oxford University Press, New York, NY. Google ScholarDigital Library
- C. E. Shannon. 1948. A mathematical theory of communication. Bell Syst. Techn. J. 27, 3--4, 379--423, 623--656.Google ScholarCross Ref
- R. J. Solomonoff. 1964. A formal theory of inductive inference. Inf. Contr. 7, 1--2, 1--22, 224--254.Google ScholarCross Ref
- E. M. Stein and R. Shakarchi. 2005. Real Analysis: Measure Theory, Integration, and Hilbert Spaces. Princeton Lectures in Analysis. Princeton University Press, Princeton, NJ.Google ScholarCross Ref
- T. Tao. 2000. From rotating needles to stability of waves: emerging connections between combinatorics, analysis, and PDE. Not. Am. Math. Soc. 48, 294--303.Google Scholar
- A. M. Turing. 1937. On computable numbers, with an application to the Entscheidungsproblem. A correction. Proc. Lond. Math. Soc. 43, 2, 544--546.Google Scholar
- K. Weihrauch. 2000. Computable Analysis: An Introduction. Springer. Google ScholarCross Ref
- T. Wolff. 1996. Recent work connected with the Kakeya problem. In Prospects in Mathematics. American Mathematical Society, Princeton, NJ, 129--162.Google Scholar
Index Terms
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
Recommendations
Fractal Intersections and Products via Algorithmic Dimension
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions of ...
Mutual Dimension
We define the lower and upper mutual dimensions mdim(x: y) and Mdim(x: y) between any two points x and y in Euclidean space. Intuitively, these are the lower and upper densities of the algorithmic information shared by x and y. We show that these ...
Effective Strong Dimension in Algorithmic Information and Computational Complexity
The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff [Math. Ann., 79 (1919), pp. 157-179], and packing dimension, developed independently by Tricot [Math. Proc. Cambridge Philos. Soc., 91 (1982), pp. 57-74] ...
Comments