The Setting
Let be a finite nonempty alphabet of cardinality , and let for . Consider the similarities (1) A weighted affine iterated function system consists of the maps (1) and real weights with .✦ The uniformly weighted system for this family has .✦
For a finite word over , the affine word coefficients are the signed slope and translation of its composition in address order; write for the empty word and for a symbol prefixed to : (2) A family has no exact overlaps if any two nonempty words with the same coefficient pair in (2) are equal.
For an infinite address , the prefix contraction product and scaled translation term give the coding map by (3) The coding attractor is the range of the map (3); it is also the unweighted coding attractor of the uniformly weighted system: (4) The Hausdorff dimension of the set (4) takes values in .
The similarity sum of the family is (5)✦ A nonnegative similarity root of the family is a real number with and in (5). The similarity dimension of the family is the nonnegative root of in (5).✦
The Claim
Theorem 1. Suppose the family has no exact overlaps. For every nonnegative similarity root , (6)✦ For the same family with no exact overlaps, the uniquely selected similarity exponent satisfies (7)✦ For the same finite nonempty family with and no exact overlaps, (8)✦
In the paper, the result reads: for a finite nonempty family of similarities of with arbitrary real translations and , absence of exact overlaps implies .
What Is Checked
The statements (6), (7) and (8) are over finite nonempty alphabets, nonzero strictly contractive signed slopes, arbitrary real translations and injectivity of the map sending each nonempty word to its affine coefficient pair.