The Setting
Random iteration of affine contractions on the line assigns entropy to the resulting maps and Hausdorff dimension to a measure. The library’s definitions retain the signed slopes of the compositions.
The Definition
Definition 1 (Weighted affine systems and associated quantities). A weighted affine system on a finite alphabet is a family of real slopes, translations and weights satisfying (1): (1)✦ The affine contraction associated with is the map in (2): (2)✦
For a finite word over and a letter , let denote the empty word and the word obtained by prefixing to . The affine parameters of a finite word over form the pair defined recursively by (3): (3)✦ For a word , with , its complete affine map is the pair in (4), with composition in address order: (4)✦ The word probability of is the product in (5): (5)✦
The attainable map set is the finite set of complete affine maps of words of length .✦ The map walk is the random complete map with mass function given by (6): (6)✦ The walk entropy of the map walk is the base-two entropy in (7): (7)✦ The entropy rate of the map walk is the infimum in (8): (8)✦
The Lyapunov exponent of is the real number defined by (9): (9)✦
A Borel measure on is self-similar for if it satisfies (10), where denotes its pushforward under : (10)✦
The lower Hausdorff dimension of a Borel measure on is the infimum in (11): (11)✦
In the paper, the result reads: a finite nonempty alphabet carries maps with arbitrary and , and weights with ; the self-similar probability measure satisfies ; words are composed in address order, their probabilities are products of the weights, and collisions are combined by equality of the complete affine map, including its signed slope and translation; writing for this random map, one has and ; lower Hausdorff dimension means .
What Is Checked
The constructions are stated over the finite weighted contracting affine systems in (1) and Borel measures on in (10) and (11).