The Setting
A finite family of contracting similarities on the line generates words whose affine maps may coincide. The relevant random walk records the complete affine map reached by a word, including its signed slope and its translation.
A weighted affine system on the line is a family of similarities with strictly positive probabilities , indexed by a finite nonempty set and satisfying (1), where : (1) A self-similar probability measure for a weighted affine system on the line is a probability measure on satisfying the invariance equation (2), in which denotes the pushforward of by : (2)
The Affine Walk
The complete affine map of a finite word is the pair determined by the composition in (3); the word probability is the product given in the same display, and denotes the empty word: (3) The attainable maps at depth form the finite set in (4); the random walk mass is the probability that a word of length has complete affine map : (4)
The map-walk entropy is the Shannon entropy of , and its entropy rate is the infimum of the entropies per letter over positive word lengths, as in (5). The logarithms are to base two, with . (5) The positive Lyapunov exponent of a weighted affine system on the line is its mean logarithmic contraction per letter, defined by (6) with logarithms to base two: (6)
The lower Hausdorff dimension of a measure on is the extended nonnegative real number given by (7), where denotes the Hausdorff dimension of a set : (7)✦
The Claim
Theorem 1. Let be a weighted affine system satisfying (1), and let be a self-similar probability measure satisfying (2). For the entropy rate and Lyapunov exponent defined in (5) and (6), its lower Hausdorff dimension is given by (8): (8)✦
What Is Checked
The claim is stated over every finite nonempty weighted contracting affine system on the line and every probability measure satisfying its self-similarity equation.