On Self-Similar Sets with Overlaps and Inverse Theorems for Entropy in ℝ𝕕

We study self-similar sets and measures on R d R^d . Assuming that the defining iterated function system Φ Φ does not preserve a proper affine subspace, we show that one of the following holds: (1) the dimension is equal to the trivial bound (the minimum of d d and the similarity dimension s s ); (2) for all large n n there are n n -fold compositions of maps from Φ Φ which are super-exponentially close in n n ; (3) there is a non-trivial linear subspace of R d R^d that is preserved by the linearization of Φ Φ and whose translates typically meet the set or measure in full dimension. In particular, when the linearization of Φ Φ acts irreducibly on R d R^d , either the dimension is equal to min { s , d } min \{s,d\} or there are super-exponentially close n n -fold compositions. We give a number of applications to algebraic systems, parametrized systems, and to some classical examples. The main ingredient in the proof is an inverse theorem for the entropy growth of convolutions of measures on R d R^d