The Setting
Local dimension concerns the decay of the mass of a small ball around a typical point. A weighted affine iterated function system on a finite alphabet consists of similarities and probabilities satisfying (1): (1)✦ The weighted component of a measure on is the measure on given by (2). A measure on is self-similar for when it satisfies (3). (2)✦ (3)✦
The lower Hausdorff dimension of is the extended nonnegative number defined by positive-mass Borel sets in (4), where is the Hausdorff dimension of : (4)✦ For a real number , write .
The Map Walk and the Coding Exponent
A word of length over has probability and complete affine map as defined in (5); composition is in address order, with the identity. (5) The set of attainable affine maps for words of length and its probability mass function are given by (6), with equality of maps requiring equality of both the signed slope and the translation. (6) The walk entropy is the base-two entropy in (7), using . (7)✦ The map-walk entropy rate and the positive Lyapunov exponent of are the real numbers given by (8). (8)
On with its discrete -algebra, the symbol probability measure and the Bernoulli address measure on are defined by (9), where denotes the unit point mass at . (9) For an address , its prefix contraction and scaled translation term are the functions in (10). (10) The coding map and the coding probability measure on are defined by (11). (11)
For measures on , the maximal ball mass ratio is the extended nonnegative function on given by (12), using the set of rational radii specified there; denotes a closed ball. (12) The real-valued function on is given by when and by . For measures on , the positive logarithmic maximal envelope is the real-valued function on given by (13). (13)✦ The symbolic envelope and logarithmic Radon-Nikodym correction are the functions on addresses defined in (14), using the weighted components of (2). (14) is the clipped logarithmic density correction and the symbol information observable, both real-valued functions on defined by (15). (15) With natural logarithms, (16) defines the projection information rate and coding dimension exponent of . (16)
The Claim
Theorem 1. Let be a weighted affine iterated function system satisfying (1), and let be a self-similar probability measure as in (3). For -almost every , the radial limit (17) holds: (17)✦ Its lower Hausdorff dimension satisfies the identity (18) and bound (19): (18)✦ (19)✦
In the paper, the result reads: there is a constant such that for -almost every as , with , where denotes the open ball of radius about .
What Is Checked
The statements are over a finite weighted affine system , its coding exponent , and any self-similar probability measure on .