English

A Divergence Formula for Randomness and Dimension (Short Version)

Computational Complexity 2009-06-24 v1 Information Theory math.IT

Abstract

If SS is an infinite sequence over a finite alphabet Σ\Sigma and β\beta is a probability measure on Σ\Sigma, then the {\it dimension} of S S with respect to β\beta, written dimβ(S)\dim^\beta(S), is a constructive version of Billingsley dimension that coincides with the (constructive Hausdorff) dimension dim(S)\dim(S) when β\beta is the uniform probability measure. This paper shows that dimβ(S)\dim^\beta(S) and its dual \Dimβ(S)\Dim^\beta(S), the {\it strong dimension} of SS with respect to β\beta, can be used in conjunction with randomness to measure the similarity of two probability measures α\alpha and β\beta on Σ\Sigma. Specifically, we prove that the {\it divergence formula} dimβ(R)=\Dimβ(R)=\CH(α)/(\CH(α)+\D(αβ))\dim^\beta(R) = \Dim^\beta(R) =\CH(\alpha) / (\CH(\alpha) + \D(\alpha || \beta)) holds whenever α\alpha and β\beta are computable, positive probability measures on Σ\Sigma and RΣR \in \Sigma^\infty is random with respect to α\alpha. In this formula, \CH(α)\CH(\alpha) is the Shannon entropy of α\alpha, and \D(αβ)\D(\alpha||\beta) is the Kullback-Leibler divergence between α\alpha and β\beta.

Keywords

Cite

@article{arxiv.0906.4162,
  title  = {A Divergence Formula for Randomness and Dimension (Short Version)},
  author = {Jack H. Lutz},
  journal= {arXiv preprint arXiv:0906.4162},
  year   = {2009}
}
R2 v1 2026-06-21T13:16:42.889Z