$L^q$ dimensions of self-similar measures, and applications: a survey
Pablo Shmerkin

TL;DR
This survey reviews the $L^q$ dimensions of self-similar measures on the real line, providing a simplified proof under exponential separation and discussing applications to Bernoulli convolutions and Cantor set intersections.
Contribution
It offers a self-contained, simplified proof of the $L^q$ dimension formula for self-similar measures with exponential separation, and reviews key applications.
Findings
Explicit formula for $L^q$ dimensions under exponential separation
Applications to Bernoulli convolutions
Insights into intersections of self-similar Cantor sets
Abstract
We present a self-contained proof of a formula for the dimensions of self-similar measures on the real line under exponential separation (up to the proof of an inverse theorem for the norm of convolutions). This is a special case of a more general result of the author from [Shmerkin, Pablo. On Furstenberg's intersection conjecture, self-similar measures, and the norms of convolutions. Ann. of Math., 2019], and one of the goals of this survey is to present the ideas in a simpler, but important, setting. We also review some applications of the main result to the study of Bernoulli convolutions and intersections of self-similar Cantor sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Mathematical Modeling in Engineering · Topological and Geometric Data Analysis
dimensions of self-similar measures, and applications: a survey
Pablo Shmerkin
Department of Mathematics and Statistics, Torcuato Di Tella University, and CONICET, Buenos Aires, Argentina
[email protected] http://www.utdt.edu/profesores/pshmerkin
Abstract.
We present a self-contained proof of a formula for the dimensions of self-similar measures on the real line under exponential separation (up to the proof of an inverse theorem for the norm of convolutions). This is a special case of a more general result of the author from [Shmerkin, Pablo. On Furstenberg’s intersection conjecture, self-similar measures, and the norms of convolutions. Ann. of Math., 2019], and one of the goals of this survey is to present the ideas in a simpler, but important, setting. We also review some applications of the main result to the study of Bernoulli convolutions and intersections of self-similar Cantor sets.
Key words and phrases:
Self-similar measures, Bernoulli convolutions, dimensions, Cantor sets, intersections
2010 Mathematics Subject Classification:
Primary: 28A75, 28A80
Partially supported by Projects CONICET-PIP 11220150100355 and PICT 2015-3675 (ANPCyT)
1. Introduction
1.1. Self-similar measures
The purpose of this survey is to present a special, but important, case of the main result of [19] concerning the smoothness properties of self-similar measures on the real line. Given a finite family , of contracting similarities (that is, ) and a corresponding probability vector there is a unique Borel probability measure on such that
[TABLE]
where here and throughout the paper, if is a Borel probability measure on a space and is a Borel map, then is the push-forward measure, that is, for all Borel . We call the tuple a weighted iterated function system, or WIFS, and the corresponding invariant self-similar measure.
Studying the properties of self-similar measures, and in particular quantifying their smoothness, is a topic of great interest since the 1930’s. Let us define the similarity dimension of a self-similar measure (or, rather, the generating WIFS) by
[TABLE]
The similarity dimension is one of the simplest instances of a very widespread expression in the dimension theory of conformal dynamical systems: it has the form
[TABLE]
Indeed, is the entropy of the probability vector : a quantity that measures how uniform this vector is. For example, it attains its maximal value exactly at the uniform probability vector . Lyapunov exponents quantify the average expansion or contraction of a dynamical system, and this is how the denominator should be interpreted.
It is well known that if , then is purely singular with respect to Lebesgue measure. In fact, even more is true. The Hausdorff dimension of a Radon measure on is defined as
[TABLE]
For self-similar measures it always holds that , and it is clear from the definition that measures with Hausdorff dimension must be purely singular. We also note that one always has , even though it is possible that .
Two major problems in fractal geometry are (a) understanding when one actually has , (b) analyzing the properties of when ; in particular, determining whether is absolutely continuous and, if so, characterizing the smoothness of its density. While both problems are still wide open in this generality, major progress has been accomplished in the last few years. The goal of this article is to present one of the several directions in which progress was achieved, following [19]. While the results of [19] concern a wider class of measures satisfying a generalized notion of self-similarity, here we focus on the proper self-similar case, both because it is an important class in itself and because it allows us to present some of the proofs of [19] in a technically simpler setting. In particular, some ergodic-theoretic concepts and tools are not required in the self-similar case.
1.2. The overlaps conjecture and Hochman’s theorem on exponential separation
Let . The set is self-similar: it satisfies that (here we assume that all the are strictly positive; we can always remove the maps with to achieve this). When the pieces are separated enough one does have an equality . Indeed, this holds if the sets are pairwise disjoint or, more generally, under the famous open-set condition which allows the images to intersect but in a very limited way.
On the other hand, there are two known mechanisms that force an inequality . The first is if . The second is slightly less trivial but still quite simple. Suppose first that for some . Then if we drop from the WIFS and replace by the invariant measure does not change. However a simple calculation reveals that the similarity dimension of the new WIFS is strictly smaller than that of the original one, and hence the Hausdorff dimension of is strictly smaller than the similarity dimension derived from the original WIFS. Although the calculation is slightly more involved, the same argument shows that if the maps do not freely generate a free semigroup or, in other words, if there exist different finite sequences such that
[TABLE]
then one also has . In this case we say that the WIFS has an exact overlap. We note that if this happens then it also happens for sequences of the same length, as we could replace and by the juxtapositions and .
A central conjecture in fractal geometry asserts that these are the only mechanisms by which a dimension drop can occur (we note that in higher dimensions this is not true, but there are related conjectures, see [13] for a discussion). This can be shortly stated in the form: if , then there is an exact overlap. The conjecture has a long history. A version for sets was stated in print in [16], where it is attributed to K. Simon. We refer to M. Hochman’s paper [12] for further background and discussion.
While the overlaps conjecture remains open, in [12] M. Hochman accomplished a decisive step towards it. Given a finite sequence we write for short. Roughly speaking, Hochman proved that if then for all large there must exist distinct pairs of words of length such that the maps and are super-exponentially close (as opposed to being identical, as the overlap conjecture predicts). More precisely, given two similarity maps , we define a distance
[TABLE]
(It may seem strange to define the distance to be if and , but it turns out that only the case in which ends up being relevant.) Given a WIFS as above, we define the -separation numbers as
[TABLE]
We say that the WIFS has exponential separation if there exists such that
[TABLE]
Note that this notion depends only on the similarity maps and not on the weights . We also remark that this condition is substantially weaker than the open set condition. We can now state Hochman’s Theorem.
Theorem 1.1**.**
If is a WIFS with exponential separation and is the associated invariant self-similar measure, then
[TABLE]
Besides conceptually getting us closer to the overlaps conjecture, this theorem has some striking implications: it can be checked in many new explicit cases, and it can be shown to hold outside of very small exceptional sets of parameters in parametrized families of self-similar measures satisfying minimal regularity and non-degeneracy assumptions. Hochman’s Theorem (and its proof) has also underpinned much of the more recent progress in the area - we will come back to all these points in Section 4.
1.3. dimensions
Hochman’s Theorem is about the Hausdorff dimension of self-similar measures. In fractal geometry, and in particular in multifractal analysis, there is a myriad of other ways of quantifying the size of a (potentially fractal) measure. Of particular relevance is a one-dimensional family of numbers known as dimensions, which we now define.
We introduce some further notation for simplicity. Let denote the family of boundedly supported Borel probability measures on . The class of supported on is denoted by . Given , we let denote the family of half-open dyadic intervals of side-length , that is,
[TABLE]
Given and , the quantity measures, in an -sense, how uniformly distributed is at scale . Using Hölder’s inequality, one can check that if , then
[TABLE]
with the extreme values attained, respectively, when is uniformly distributed among the intervals contained in , and when gives full mass to a single interval in . This suggests that the decay rate of as may indicate the smoothness of at arbitrarily small scales, and this is precisely how the dimensions are defined:
[TABLE]
(Here and throughout the paper, the logarithms are to base .) We will sometimes write , instead of , . The function is called the spectrum of . In light of (1.2), one always has for and, indeed, the same inequality holds for . Moreover, for purely atomic measures and if is Lebesgue measure on an interval or, more generally, if is absolutely continuous with an density. These basic properties suggest that is a reasonable notion of dimension.
We state two simple and well known properties of dimensions.
Lemma 1.2**.**
The functions , are respectively non-increasing and concave on .
Proof.
Fix , , , . It follows from Hölder’s inequality applied with exponents and that
[TABLE]
The concavity of is immediate from this. For the monotonicity of , suppose and apply the above with and . ∎
So far we have dealt with a general measure . We now turn to self-similar measures associated to a WIFS . We have seen that the similarity dimension is a “candidate” for the Hausdorff dimension of a self-similar measure , is always an upper bound for and is conjectured to equal under the terms of the overlaps conjecture. There is a natural analog of the similarity dimension: first, we define as the only number satisfying
[TABLE]
and then let . The function is a “symbolic” analog of the spectrum, while is a version of similarity dimension for dimensions.
A simple exercise shows that . We also have that is a real-analytic, nondecreasing function of ; it is constant if and only if for some independent of (in which case for all ), and otherwise it is strictly decreasing.
Just like for Hausdorff dimension, it always holds that , and the only known mechanisms for a strict inequality are and the presence of exact overlaps. A variant of the overlaps conjecture asserts that if is a self-similar measure then unless there is an exact overlap. This conjecture is stronger than the Hausdorff dimension variant, since for all and as in the case of self-similar measures: see [20, Theorem 5.1 and Remark 5.2].
In [19], the author established the following variant of Hochman’s Theorem 1.1 for dimensions:
Theorem 1.3**.**
If is a WIFS with exponential separation and is the associated invariant self-similar measure, then
[TABLE]
Again, this theorem is formally stronger than Theorem 1.1, since the latter can be recovered by letting . While at first it may seem that the difference between Hausdorff and dimensions is merely technical, the dimension version has several advantages in applications, especially since it applies to every . It is useful to think of the difference between and Hausdorff dimensions as being similar to the difference between and functions (on bounded intervals). Both kind of dimensions give information about the local behaviour of a measure, but the dimensions do so in a more quantitative fashion. If , then it holds that
[TABLE]
for -almost all and all sufficiently small (depending on ). On the other hand, if , then (1.3) holds uniformly, for all and all sufficiently small : see Lemma 4.1 below. For some applications of Theorem 1.3 beyond those described in this article, see [4, 10, 17].
Theorem 1.3 was originally featured in [19, Theorem 6.6]. In this article we will present the proof of the special case in which the WIFS is homogeneous, that is, all of the scaling factors are equal. The homogeneous case of Theorem 1.3 is a particular case of [19, Theorem 1.1]. As indicated earlier, this particular case avoids an ergodic-theoretic part of the argument, and so we hope it will be more accessible. The proof borrows many ideas from Hochman’s proof of Theorem 1.1, but there are also substantial differences.
One central element of the proof of Theorem 1.3 is an inverse theorem for the norm of convolutions, which does not rely on self-similarity and may have other applications. This theorem is discussed and stated (without proof) in Section 2. Section 3 contains the proof of the homogeneous version of Theorem 1.3, starting with a sketch and proceeding to the details. In Section 4 we introduce some applications to Frostman exponents, self-similar measures generated by algebraic parameters, absolute continuity and intersections of self-similar Cantor sets. We also briefly discuss some old and new results by other authors on Bernoulli convolutions, how they relate to ours, and a possible line for future research.
Although some of the applications in Section 4 have not been stated in this form in [18], both the results and the presentation of this survey are strongly based on [18].
2. An inverse theorem for the norms of convolutions
Let . The convolution is defined as the push-forward of the product measure under the addition map . Explicitly,
[TABLE]
Intuitively, one expects the convolution to be at least as smooth as . A natural question is then: if is not “much smoother” than , can we deduce any structural information about the measures and ? Of course, this depends on the notion of smoothness under consideration, and on the precise meaning of “much smoother”.
Here we will measure smoothness by the moment sums (with fixed, and also fixed but very large). Nevertheless, we begin by discussing the situation for entropy. Let . Its normalized level entropy is
[TABLE]
with the usual convention . In [12, Theorem 2.7], Hochman showed that if satisfy
[TABLE]
where is small, then and have a certain structure which, very roughly, is of this form: the set of dyadic scales can be split into three sets . At scales in , the measure looks “roughly atomic”, at scales in the measure looks “roughly uniform”, and the set is small. This theorem was motivated in part by its applications to the dimension theory of self-similar measures, as discussed above.
We aim to state a result in the same spirit, but with norms in place of entropy. Given , we will say that is a -measure if is a probability measure supported on . Given , we denote by the associated -measure, given by . Given a purely atomic measure we define the norms
[TABLE]
for and also set . With these definitions, we clearly have
[TABLE]
By the convexity of , we have that , for any and any two finitely supported probability measures (this is a simple instance of Young’s convolution inequality). We aim to understand under what circumstances , where the closeness is in a weak, exponential sense. More precisely, we are interested in what structural properties of two -measures ensure an exponential flattening of the norm of the form
[TABLE]
(Recall that, by definition, -measures are probability measures, so that .) One particular instance of this problem has received considerable attention. Given a finite set , we denote . Then is the additive energy of , a quantity of great importance in combinatorics and its applications. In particular, estimates of the form
[TABLE]
arise repeatedly in dynamics, combinatorics and analysis: see e.g. [7, 1] for some recent examples.
To motivate the inverse theorem, we discuss cases in which for -measures and , where we are deliberately vague about the exact meaning of . If , then is just a translation of and so we have an exact equality. If is supported on a small number of atoms (say subexponential in ), then we still have . Reciprocally, if denotes the uniform -measure giving mass to each atom , then we also have . The same holds if is replaced by a suitably small perturbation.
Furthermore, if and is an arbitrary -measure, then we still have . This shows that a subset of measure is able to prevent exponential smoothening, so that in order to guarantee (2.1) we need to impose conditions on the structure of the measures inside sets of exponentially small measure. This is one significant difference with the case of entropy, since sets of exponentially small measure have negligible contribution to the entropy.
A naive conjecture might be that if (2.1) fails for a pair of -measures, then either is close to uniform, or gives “large” mass to an exponentially small set of atoms. However, there other situations in which . Let be a large integer and fix . Given a subset of , let be the distribution of an independent sequence of random variables such that is uniformly distributed in if and if . Finally, let be the push-forward of under the -ary expansion map. In other words, is the -measure such that
[TABLE]
It is convenient to think about the structure of in terms of trees. Given a base and a nonempty closed subset of , we may associate to the family of all intervals of the form (i.e. the -ary intervals) that intersect . This family has a natural tree structure, where the interval is the root and descendence is given by inclusion. In general, the tree associated to is infinite, but in the case of -sets we can think of a finite tree with levels. For the measure just defined, its support has the following structure: vertices of level have a maximal number of offspring (“full branching”) while vertices of level have a single offspring (“no branching”), corresponding to the leftmost interval. Moreover, is the uniform measure on - it gives all points in the same mass .
The convolution has essentially the same structure, except that vertices of level such that have two offspring - due to the carries of the previous level. Using this structure, it is not hard to check that for all . In similar ways one can construct -measures supported on sets of widely different sizes, such that .
The inverse theorem asserts that if (2.1) fails to hold then one can find subsets and , such that captures a “large” proportion of the norm of and a “large” proportion of the mass of , and moreover are fairly regular (they are constant up to a factor of ). The main conclusion, however, is that and have a structure resembling the example above, and also the conclusion of Hochman’s inverse theorem for entropy: if is a large enough integer, then for each , either has no branching between scales and (in other words, once the first digits in the -ary expansion of are fixed, the next digit is uniquely determined), or has nearly full branching between scales and (whatever the first digits of in the -adic expansion, the next digit can take “most” values). To formalize this, we introduce the following definition:
Definition 2.1**.**
Given and a sequence , we say that a set is -regular if it is a -set, and for all and for all such that , it holds that
[TABLE]
In terms of the associated -ary tree, is -regular if every vertex of level has the same number of offspring .
Before stating the theorem, we summarize our notation for dyadic intervals (some of it has already been introduced):
- •
is the family of dyadic intervals .
- •
Given a set , we write for the family of intervals in that hit .
- •
Given , we write for the only interval in that contains .
- •
We write for the interval of the same center as and length times the length of .
We also write .
Theorem 2.2**.**
For each , , and , there are and , so that the following holds for .
Let and let and be -measures with
[TABLE]
Then there exist -sets and , numbers , and a set , so that
- (A1)
. 2. (A2)
* for all .* 3. (A3)
* is contained in and is uniform for some sequence .* 4. (A4)
* for each and .*
- (B1)
. 2. (B2)
* for all .* 3. (B3)
* is contained in and is uniform for some sequence .* 4. (B4)
* for each and .*
Moreover
- (5)
for each , if , and if . 2. (6)
The set satisfies
[TABLE]
Here, and throughout the paper, denotes the dual exponent. We make some remarks on the statement.
- a)
In the original version of the theorem in [19], both the convolution and the translations take place on the circle with addition modulo . See [17, Theorem 2.2 and Remark 2.3] for this formulation. 2. b)
The main claim in the theorem is part (5). Obtaining sets satisfying (A1)–(A4) and (B1)–(B4) is not hard, and (6) is a straightforward calculation using (5). 3. c)
The theorem fails for and . In the first case there is an equality for any -measures, and in the second case there is always an equality . On the other hand, the proof can easily be reduced to the case , with the remaining cases following by interpolation with the endpoints and .
The proof of Theorem 2.2 (including the proofs of the results it relies on) is elementary and, at least in principle, it is effective, although the value of that emerges from the proof is extremely poor and certainly sub-optimal. However, for the purposes of proving Theorem 1.3, the existence of any is enough.
3. Proof of the main theorem
3.1. Homogeneous self-similar measures
We restate the particular case of Theorem 1.3 that we will prove.
Theorem 3.1**.**
Let be a homogeneous IFS with exponential separation. Then for any probability vector , if is the invariant self-similar measure for the WIFS , then
[TABLE]
for all .
We recall that “homogeneous” here refers to the fact that all scaling factors are equal. We may and do assume that ; if , note that can also be generated by the WIFS , for which the scaling factor is . This iteration of the IFS does not change the validity of exponential separation.
The key advantage of homogeneity is that, in this case, the self-similar measure has an infinite convolution structure: if , then
[TABLE]
where rescales by . Formally, this infinite convolution is defined as the push-forward of the countable self-product under the series expansion map ; this is well-defined since the series always converges absolutely. To verify that this is indeed the self-similar measure, one only needs to check that it satisfies the self-similarity relation
[TABLE]
In more probabilistic terms, can also be defined as the distribution of the random series , where are IID random variables with distribution . The well-known fact that the distribution of a sum of independent random variables is the convolution of the distributions (which extends to countable sums) then gives another derivation of (3.2).
3.2. Outline of the proof
The overall strategy of the proof of Theorem 3.1 follows the broad outline of [12]. However, while Hochman’s method is based on entropy, we need to deal with norms and, as we will see, this forces substantial changes in the implementation of the outline.
The right-hand side in (3.1) is easily seen to be an upper bound for the left-hand side, so the task is to show the reverse inequality. Write and . We want to show that if (or, equivalently, ) then (under the hypothesis of exponential separation).
Recall that the spectrum is concave, so in particular it is continuous and differentiable outside of at most a countable set. Hence it is enough to prove the claim above for a fixed differentiability point . The advantage of this assumption is that the “multifractal structure” of a measure is known to behave in a regular way for points of differentiability of the spectrum. In particular, we will see that if then, for large enough , “almost all” of the contribution to the sum comes from intervals such that ; here is the Legendre transform of (see §3.5 for the definition). Moreover, using the self-similarity of , we establish also a multi-scale version of this fact, see Proposition 3.11.
The following is the key estimate in the proof; as we will see in Section 4, it has other applications. Recall that is given by
[TABLE]
and that, by definition, .
Theorem 3.2**.**
Let be a self-similar measure associated to a homogeneous WIFS (not necessarily with exponential separation) and let . Suppose . Then for every there is such that the following holds for all large enough : if is an arbitrary -measure such that , then
[TABLE]
This theorem is proved by combining the inverse theorem for the norm of convolutions (Theorem 2.2), together with the study of the multifractal structure of . We sketch the idea very briefly: suppose (3.4) fails. The inverse theorem then asserts that there is a regular subset of that captures much of the norm of . By part (5) of the inverse theorem, and since is assumed to have exponentially small norm, must have almost full branching on a positive density set of scales in a multi-scale decomposition. But itself does not have full branching (this will follow from the assumption , which rules out having too small norm). So there must also be a positive density set of scales on which has smaller than average branching. The regularity of the multifractal spectrum discussed above rules this out, since it forces to have an almost constant branching on almost all scales. For a detailed proof, see §3.6 below.
The conclusion of the proof of Theorem 3.1 from (3.4) tracks fairly closely the ideas of [12]. One consequence of self-similarity, as expressed by (3.2), is that
[TABLE]
where
[TABLE]
Note that the atoms of are the points of the form . The exponential separation assumption implies that there exist such that all these atoms are distinct and -separated. Hence for this value of we have
[TABLE]
where is chosen so that and . It is easy to see that the right-hand side is equal to the right-hand side of (3.1). Hence, it remains to show that
[TABLE]
In other words, we need to show that the norm of at scale (which is easily seen to be comparable to the norm of at scale , and hence is ) nearly exhausts the norm of at the much finer scale which, in turn, equals the full norm of , by the exponential separation assumption.
To show (3.6), we recall that , and use this to decompose
[TABLE]
where is the normalized restriction of to . Since the supports of have bounded overlap, it is not hard to deduce that
[TABLE]
where . This is the point where we apply Theorem 3.2, to conclude that if on the right-hand side above we only add over those such that , where is arbitrary, then, provided is large enough depending on , we still capture almost all of the left-hand side. This follows since (3.4) can be shown to imply that the contribution of the remaining is exponentially smaller than the left-hand side (incidentally, this is the only step where it is crucial to use that ). A similar calculation, now with in place of in the left-hand side, then shows that (3.6) holds, finishing the proof.
3.3. Notational conventions
Throughout this section, denotes a self-similar measure associated to a homogeneous WIFS with weights . We do not assume exponential until the very end, when we finish the proof of Theorem 3.1. We continue to denote
[TABLE]
Other measures, without any assumptions on self-similarity, will be denoted by and , possibly with subindices.
We use Landau’s and related notation: if are two positive quantities, then means that for some constant , while means that , and that and . If the constant is allowed to depend on some parameters, these are often denoted by subscripts. For example, means that , where is a function depending on the parameter .
3.4. Preliminary lemmas
In this section we collect some standard lemmas for later reference. They are all of the form: bounded overlapping does not affect norms too much. We refer to [19, Section 4] for the very short proofs.
Lemma 3.3**.**
Let be a probability space. Suppose are finite families of measurable subsets of such that each element of can be covered by at most elements of and each element of intersects at most elements of . Then, for every ,
[TABLE]
Lemma 3.4**.**
Let , where are finitely supported measures on a space , such that each point is in the support of at most of the . Then
[TABLE]
Lemma 3.5**.**
For any , for any and any ,
[TABLE]
Recall the definition of given in (3.5).
Lemma 3.6**.**
For any ,
[TABLE]
3.5. Multifractal structure
We turn to the multifractal estimates that will be required in the proof of Theorem 3.2. The Legendre transform plays a key role in multifractal analysis. Given a concave function , its Legendre transform is defined as
[TABLE]
It is easy to check that if is concave and is differentiable at , then
[TABLE]
As indicated earlier, we will establish some regularity of the multifractal structure for those values of such that is differentiable at .
The next lemma is well known; we include the very short proof for completeness.
Lemma 3.7**.**
If is differentiable at , , and , then
Proof.
Since (this is immediate from the definition) and , we have . On the other hand, as is concave and differentiable at , we must have . Furthermore, , so the lemma follows. ∎
The following lemmas illustrate the regularity of the spectrum for values of differentiability of (or dually, points of strict concavity of ). The proofs are similar to [14, Theorem 5.1]. The heuristic to keep in mind is that, whenever exists, almost all of the contribution to comes from intervals, each of mass
Lemma 3.8**.**
Suppose that exists for some .
Given , the following holds if is small enough in terms of and is large enough in terms of and .
Suppose is such that
- (1)
* for all and some .* 2. (2)
.
Then .
Proof.
Set , and pick , and also small enough that, if , then
[TABLE]
On one hand, using (1) and the definition of , we get
[TABLE]
if is large enough (depending on ). On the other hand, by the assumptions (1)–(2),
[TABLE]
if . Eliminating from the last two displayed equations yields
[TABLE]
so that, recalling (3.7),
[TABLE]
Hence , since we assumed . Using this, we get that if , then
[TABLE]
The conclusion follows from the formula and our choice . ∎
Lemma 3.9**.**
Let be such that exists. Given , there is such that the following holds for large enough (in terms of ):
[TABLE]
Proof.
Let be small enough that
[TABLE]
where .
Let , and write for the number of intervals in such that . For any fixed value of , if then,
[TABLE]
Applying this to , and using (3.9), we estimate
[TABLE]
Let be the sum in the left-hand side of (3.8) that we want to estimate. Using that , we conclude that
[TABLE]
as claimed. ∎
Lemma 3.10**.**
Let be such that exists. Given , there is such that the following holds for large enough (in terms of ).
If has elements, then
[TABLE]
Proof.
Let . In light of Lemma 3.9, we only need to worry about those with . But
[TABLE]
By our choice of , , so this gives the claim. ∎
The results in this section so far hold for general measures. The following proposition, on the other hand, relies crucially on self-similarity. The second part was first proved in [15]. Since the claim of Theorem 3.1 is not affected by rescaling and translating (from the point of view of the IFS, this amounts to doing these operations on the translation parameters ), from now on we assume that is supported on .
Proposition 3.11**.**
Let be such that exists.
- (i).
Given , there is such that the following holds for all large enough : for any , , if is a collection of intervals in with , then
[TABLE] 2. (ii).
Given , the following holds for all large enough : for any , ,
[TABLE]
Proof.
We prove (i) first. Let be the smallest integer such that . Let be the atoms of such that , let be their respective masses, and write
[TABLE]
Then the support of is contained in the -neighborhood of . Moreover, since is supported on , as we assumed that is supported on , it follows from the self-similarity relation and the definition of that . Write
[TABLE]
using that the support of is contained in the -neighborhood of the support of , and that .
We can then estimate
[TABLE]
where we used the convexity of in the third line. Now for each fixed , each interval with can be covered by intervals in , and reciprocally each interval in hits at most intervals among the . We deduce from Lemmas 3.3 and 3.10 that, still for a fixed ,
[TABLE]
provided is taken large enough, where is given by Lemma 3.10. Combining the last three displayed equations yields the first claim with .
The second claim follows in the same way, adding over instead of . ∎
3.6. Proof of Theorem 3.2
In this section we prove Theorem 3.2. A similar result, with smoothness measured by entropy rather than norms, was proved by Hochman in [12, Corollary 5.5], using his inverse theorem for the entropy of convolutions. In Hochman’s approach, a crucial property of self-similar measures is that their entropy is roughly constant at most scales and locations, a property that Hochman termed uniform entropy dimension, see [12, Definition 5.1 and Proposition 5.2] for precise details. Unfortunately, there is no useful analog of the notion of uniform entropy dimension for norms. One of the key differences is that nearly all of the norm may be (and often is) captured by sets of extremely small measure; while sets of small measure also have small entropy. Instead, we will use the regularity of the multifractal spectrum established in the previous section in the following manner: if the flattening claimed in Theorem 3.2 does not hold, then the inverse theorem provides a regular set which captures much of the norm of . The upper bound on , together with (5)–(6) in the inverse theorem imply that has nearly full branching for a positive proportion of -scales, so it must have substantially less than average branching also on a positive proportion of scales. On the other hand, we will call upon the lemmas from the previous section to show that, in fact, must have nearly constant branching on nearly all scales (this is the part that uses the differentiability of at ), obtaining the desired contradiction.
Proof of Theorem 3.2.
Suppose is a -measure with . In the course of the proof, we will choose many numbers which ultimately depend on and only. To ensure that there is no circularity in their definitions, we indicate their dependencies: , , , , , , , , , . Moreover, at different parts of the proof we will require to be smaller than certain (positive) functions of the parameters they depend on; in particular, all of the requirements can be satisfied simultaneously.
Finally, will be taken large enough in terms of all the previous parameters (hence ultimately in terms of and ).
Write , and define as
[TABLE]
Then thanks to Lemma 3.7, and the assumption .
We apply Proposition 3.11 to obtain a sufficiently large (in terms of , with yet to be specified) such that
- (A)
For any , any , , and any subset with ,
[TABLE]
where depends on and , hence on only. 2. (B)
For any and any , ,
[TABLE] 3. (C)
.
Let be the numbers given by Theorem 2.2 applied to and . For the sake of contradiction, suppose
[TABLE]
We will derive a contradiction from this provided is large enough (if is not of the form , we apply the argument to instead; we omit the details). We apply Theorem 2.2 to and to obtain (assuming is large enough) a set as in the theorem, with corresponding branching numbers . Since translating and does not affect their norms or the norm of their convolution, we assume for simplicity that the numbers are both [math].
The key to the proof is to show, using the structure of provided by Theorem 2.2, that
[TABLE]
where depends on and only (and is given by (3.10)). We first show how to complete the proof assuming this. Consider the sequence
[TABLE]
By (B) applied with and ,
[TABLE]
But if , then is contained in a single interval in by property (A4) from Theorem 2.2, and conversely hits at most two intervals , . We deduce that
[TABLE]
for all . Likewise, by (A),
[TABLE]
whenever . Recall that depends on . In light of (3.11), and using also (C), we have
[TABLE]
Hence, by choosing small enough in terms of and we can ensure that, for large enough,
[TABLE]
On the other hand, by (A1) in Theorem 2.2, if is a small number to be fixed later, then (always assuming is large enough)
[TABLE]
From the last two displayed equations,
[TABLE]
Recall that is yet to be specified, while so far was taken small enough in terms of and , and no conditions have been yet imposed on . By ensuring and we reach a contradiction, as desired.
It remains to establish (3.11). The idea is very simple: Theorem 2.2 (together with the assumption that ) imply that has “nearly full branching” on a positive proportion of scales. On the other hand, Lemma 3.8 says the size of is at most roughly (by Lemma 3.7), so there must be a positive proportion of scales on which the average -adic branching is far smaller than , which is what (3.11) says.
We proceed to the details. Using (A1), (A2) in Theorem 2.2, we get that (for ) there is such that for all , and
[TABLE]
We let and be small enough in terms of and that, invoking Lemma 3.8,
[TABLE]
Let , where . Using (A3) in Theorem 2.2, we see that
[TABLE]
Let , . Combining (3.12) and (3.13), and using that , we deduce
[TABLE]
Note that by Lemma 3.7. At this point we take small enough that . Using (6) in Theorem 2.2, and the assumption , we further estimate
[TABLE]
We can plug in the left inequality (together with ) into (3.14), to obtain the key estimate
[TABLE]
Recalling (3.10), this shows that by making (hence also ) small enough in terms of , we have
[TABLE]
Let . Recall that our goal is to show (3.11), i.e. . We have
[TABLE]
so that, using the right-most inequality in (3.15), and recalling that ,
[TABLE]
By ensuring that are small enough in terms of , the right-hand side above can be bounded below by
[TABLE]
confirming that (3.11) holds with . ∎
3.7. Proof of Theorem 3.1
Theorem 3.1 will be an easy consequence of the following proposition, which relies on Theorem 3.2. It is an analog of [12, Theorem 1.4], and we follow a similar outline. We emphasize that exponential separation is not required for the validity of the proposition.
Proposition 3.12**.**
Let be such that is differentiable at and . Fix . Then
[TABLE]
where is the smallest integer with .
Proof.
Fix . We write for simplicity, and allow all implicit constants to depend on only. Using the self-similarity relation and Lemma 3.5, we get
[TABLE]
Here is the normalized restriction of to (note that we are only summing over such that ). Since the measures are supported on , the support of each of them hits the supports of others. We can then apply Lemma 3.4 to obtain
[TABLE]
Let (we suppress the dependence on from the notation, but keep it in mind). Note that for any and measures . It follows from Lemmas 3.3 and 3.5 that
[TABLE]
so that, combining the last two displayed formulas,
[TABLE]
On the other hand, using Lemma 3.3 again,
[TABLE]
Fix , and let . According to Theorem 3.2, there is such that, if is taken large enough, then
[TABLE]
Applying this to (3.16), we get
[TABLE]
using Young’s inequality in the first line, and Lemma 3.6 in the second. On the other hand,
[TABLE]
if is large enough (depending on ). Inspecting the last two displayed equations, we deduce that if , then
[TABLE]
Recalling (3.17), we conclude that
[TABLE]
The inequality holds trivially, so that by Lemma 3.6
[TABLE]
provided . Since was arbitrary and , this concludes the proof. ∎
We can now conclude the proof of Theorem 3.1
Proof of Theorem 3.1.
We continue to write . To begin, we note that, for any ,
[TABLE]
(The latter inequality is an equality if and only if there are no overlaps among the atoms of .) Since for any probability measure , it follows from (3.18) and Lemma 3.6 that
[TABLE]
Hence the proof will be completed if we can show that for each , either (so that in fact ) or
[TABLE]
Since is concave, it is enough to prove this for all such that is differentiable at . Hence, we fix such that and is differentiable at , and we set out to prove (3.19).
By the exponential separation assumption, the atoms of are -separated for infinitely many and some . We know from Proposition 3.12 that
[TABLE]
On the other hand, if is such that the atoms of are -separated then (since )
[TABLE]
Combining Equations (3.20) and (3.21), we conclude that (3.19) holds, finishing the proof. ∎
3.8. About the proof of Theorem 1.3
In the proof of Theorem 3.1 the convolution structure played a crucial role. While a general self-similar measure does not have such a clean convolution structure, we can proceed as follows. Let be the scaling factors of the IFS generating (there may be repetitions). Given , let
[TABLE]
One can then check, using self-similarity, that
[TABLE]
where are certain purely atomic measures constructed from the translations of the maps with . Thanks to the fact that is polynomial in (even though is exponential in ), the proof given in the homogeneous case can be adapted with minor technical complications. We refer to [19, §6.4] for the details.
4. Applications
In this section we present several applications of Theorem 3.1.
4.1. Frostman exponents
If is a finite measure on a metric space , we say that has Frostman exponent if for some and all . There is a very simple relation between dimensions for large and Frostman exponents:
Lemma 4.1**.**
Let . If for some , then there is such that
[TABLE]
Proof.
If , then there is such that for all large enough and each ,
[TABLE]
Since any ball can be covered by dyadic intervals of size smaller than the radius, we get that if is sufficiently small then
[TABLE]
where is independent of and . This gives the claim. ∎
Theorem 3.1 together with the previous lemma immediately yields the following corollary:
Corollary 4.2**.**
Let be the self-similar measure associated to a homogeneous IFS with exponential separation and the uniform probability weights . Then has Frostman exponent for every .
4.2. Algebraic parameters
We now discuss the special case in which the IFS has algebraic parameters, that is, both the contraction ratio and the translations are algebraic numbers. Hochman [12, Corollary 1.5] proved that the overlaps conjecture holds in this case and, in the same way, we extend this to the -dimension version of the overlaps conjecture. The deduction is based on the following classical lemma; see [13, Lemma 6.30] for a proof.
Lemma 4.3**.**
Given algebraic numbers (over ) and a positive integer , there exists such that the following holds: if is a polynomial of degree , all of whose coefficients are at most in modulus, then either or
[TABLE]
Corollary 4.4**.**
Let be the self-similar measure associated to a homogeneous WIFS with algebraic coefficients (i.e. the contraction ratio and the translations are algebraic). Then either there is an exact overlap, or
[TABLE]
Proof.
Note that for any pair of sequences , , the difference can be written as , where has degree at most and coefficients . Since we assume that there are no exact overlaps, for . Lemma 4.3 then guarantees that the IFS has exponential separation, so that Theorem 3.1 yields the corollary. ∎
Even if there are exact overlaps, the proof of Theorem 3.1 yields an expression for the dimensions of . Recall that is the purely atomic measure given by
[TABLE]
Corollary 4.5**.**
Let be the self-similar measure associated to a homogeneous WIFS with algebraic coefficients (i.e. the contraction ratio and the translations are algebraic). Define
[TABLE]
Then the limit in this definition exists, and
[TABLE]
Proof.
By Lemma 4.3, and arguing as in the proof of Corollary 4.4, there is such that any two distinct atoms of are -separated. Suppose . By Proposition 3.12,
[TABLE]
But since , so the claim follows. ∎
4.3. Parametrized families and absolute continuity
Exponential separation holds outside of a small set of exceptions in parametrized families satisfying mild regularity and non-degeneracy assumptions:
Lemma 4.6**.**
Let be a compact interval, and let and be real-analytic functions. For a pair of -valued sequences , define
[TABLE]
Assume that if then is not identically zero. Then the IFS has exponential separation for all outside of a set of zero Hausdorff (and even packing) dimension.
See [12, Theorem 1.8] for the proof and some further discussion. Now Theorem 3.1 shows that for parametrized families of WIFS satisfying the assumptions of Lemma 4.6, there is a zero-dimensional exceptional set of parameters outside of which the dimensions of the self-similar measures have the value predicted by the overlaps conjecture (note also that the exceptional set is independent of the probability weights).
When , the overlaps conjecture predicts that (in the absence of exact overlaps) , but in fact it is plausible that under the same assumptions the measure is absolutely continuous with a density. While this is of course still open, and appears to be even harder than the dimension version of the overlaps conjecture, we have the following result for parametrized families:
Theorem 4.7**.**
Let be an closed interval, and let and be real-analytic functions. For a pair of -valued sequences , define
[TABLE]
Assume that if then is not identically zero. Then then there is a set of zero Hausdorff dimension such that the following holds for all : if is a self-similar measure associated to the IFS and a probability vector , and if for some , then is absolutely continuous and its Radon-Nikodym density is in .
This theorem provides the correct range for the possibility of having an density (up to the endpoint), since measures with an density satisfy ; this follows from the inequality for all intervals , where is the density of . The proof of the theorem follows the ideas from [18, 20]; the only new element is the stronger input provided by Theorem 3.1.
Recall that the Fourier transform of a measure is defined as
[TABLE]
The following result asserts that convolving a measure of full dimension and another measure with power Fourier decay results in an absolutely continuous measure with an density; see [20, Theorem 4.4] for the proof.
Theorem 4.8**.**
Let be such that for some and satisfies the Fourier decay estimate
[TABLE]
for some . Then the convolution is absolutely continuous and its Radon-Nikodym density is in .
The proof of this theorem shows that, additionally, has fractional derivatives in .
Proof of Theorem 4.7.
Fix a weight for some . For , let be the self-similar measure associated with the WIFS . We also denote
[TABLE]
Fix . Using the convolution structure of , we decompose
[TABLE]
We can think of and as the measures obtained from the construction of by “keeping only every -th digit” and “skipping every -th digit” respectively. Both and are, again, self-similar measures arising from homogeneous IFS’s. Indeed, is the invariant measure for the IFS . The WIFS generating is more cumbersome to write down: it consists of maps, indexed by sequences . The maps and weights are given by
[TABLE]
A short calculation shows that, for any ,
[TABLE]
On the other hand, it is easy to check that (for each ) the family of IFS’s generating also satisfies the assumptions of Lemma 4.6. Hence there are sets of zero Hausdorff dimension such that the WIFS generating has exponential separation for all . Letting and apply Theorem 3.1, we deduce that has zero Hausdorff dimension, and if then
[TABLE]
Turning to the measures , we claim hat there are exceptional sets of zero Hausdorff dimension such that if , then has power Fourier decay, that is, there are such that
[TABLE]
This follows by variants of an argument that goes back to Erdős [9]. If the function is nonconstant then, by splitting into finitely many intervals and reparametrizing, we may assume that . This case is closer to Erdős original argument; see e.g. [18, Proposition 2.3] for a detailed exposition. Suppose now that . In this case we must have . Indeed, suppose . Replacing by [math] and by has the effect of rescaling and translating the measures , which does not affect the claim. If , then for any and there is nothing to do, while if , there are two sequences such that , and this implies that the non-degeneracy assumption fails. Hence we assume that from now on. In this case, the function
[TABLE]
is non-constant and real-analytic outside of a finite set of (where the denominator vanishes). Otherwise, if either the denominator or itself were constant, the non-degeneracy condition would fail. As before, this shows that we may assume . The claim now follows from [20, Proposition 3.1]. Let .
Set and fix . If , then (4.2) ensures that provided is taken large enough. Since also has power Fourier decay by the definition of , the decomposition (4.1) together with Theorem 4.8 show that is absolutely continuous with an density, finishing the proof. ∎
4.4. Bernoulli convolutions
Given , we define as the distribution of the random sum , where the are IID and take values [math] and with equal probability . In other words, is the self-similar measure associated to the WIFS . The measures are known as Bernoulli convolutions.
When , the topological support of is a self-similar Cantor set of dimension ; in particular, is purely singular (and for all ). For , the Bernoulli convolution is a multiple of Lebesgue measure on the interval . Understanding the smoothness properties of for has been a major open problem since the 1930s. Although the problem is still very much open, dramatic progress has been achieved in the last few years. In this section we briefly state the consequences of the results of the previous sections for Bernoulli convolutions, and discuss their connections with other old and new results about them.
In two foundational papers, Erdős [8, 9] showed that is singular if is a Pisot number (an algebraic integer all of whose algebraic conjugates are in modulus), and that has a density in for almost all sufficiently close to (depending on ). In the 1960s, Garsia [11] exhibited an explicit infinite family of algebraic numbers for which is absolutely continuous. These remained the only explicit known parameters of absolute continuity until very recently when Varju [23], introducing several new techniques, exhibited a new large family of algebraic numbers very close to for which is absolutely continuous, with a density in .
In a celebrated paper, Solomyak [21] proved that is absolutely continuous with an density for almost all . Much more recently, in another landmark paper [12] that we have already encountered several times, Hochman proved that for all outside of a set of of zero Hausdorff (and even packing) dimension. Building on that, the author [18] proved that is absolutely continuous for all outside of a set of of zero Hausdorff dimension. As an immediate application of Theorem 4.7, we have:
Corollary 4.9**.**
There exists a set of zero Hausdorff dimension such that is absolutely continuous and its density is in for all , for all .
We underline that the information that the density is in for is new even for a.e. parameter. Note that Corollary 4.2 shows that has Frostman exponent for every for every for which there is exponential separation. Although this is weaker than density for all , exponential separation can be checked for some explicit parameters; in particular it holds for all rationals in .
An active area of research concerns investigating the properties of for algebraic values of . We only summarize some of the recent results in this area. The entropy of a purely atomic measure is defined as . The Garsia entropy associated to is defined as
[TABLE]
where is the -th step discrete approximation to , that is, the distribution of the finite random sum . It is well-known that the limit exists. The number can also be interpreted as the entropy of the uniform random walk generated by the similarities and .
It follows from Hochman’s work [12] (see [5, §3.4] for a detailed argument) that if is algebraic, then
[TABLE]
Breuillard and Varju [5, Theorem 5] gave bounds for in terms of the Mahler measure of (see e.g. [5, Eq. (1.1)] for the definition of Mahler measure):
[TABLE]
where is a universal constant that they numerically estimate to be at least . Using this theorem, they uncover a connection between Bernoulli convolutions and problems related to growth rates in linear groups. Very roughly, the idea is that the worst possible rate occurs for the group generated by the similarities , , which can be easily realized as a linear group. An easy consequence of (4.3) and (4.4) is that, assuming Lehmer’s conjecture that the Mahler measure is either or bounded away from , the Hausdorff dimension of is for all algebraic numbers which are close enough to . In [6], further progress was obtained; among many other results, the authors show that if for some transcendental number , then can be approximated by algebraic numbers with the same property. Hence, conditional on the Lehmer conjecture, for all close to . Very recently, combining results from most of the papers mentioned in this section with a clever new argument, Varju [22] achieved another major breakthrough by proving that for all transcendental .
The formula (4.3) makes it important to be able to compute Garsia entropy. An algorithm for this was developed in [2]. Among other applications, this algorithm makes it possible to check that for specific (new) algebraic values of .
All of these recent advances depend on the formula (4.3), and hence apply only to Hausdorff dimension and not to dimensions. However, Corollary 4.5 shows that the version of (4.3) remains valid: for all algebraic ,
[TABLE]
where
[TABLE]
is an analog of Garsia entropy. Hence it would be interesting to know if there are versions of some of the results described above.
4.5. Intersections of Cantor sets
To finish the paper, we show how Theorem 3.1 can be used to obtain strong bounds on the dimensions of intersections of certain Cantor sets. Indeed, a conjecture of Furstenberg about the dimensions of intersections of , -invariant closed subsets of the circle was the main motivation for the results of [19]. While the resolution of Furstenberg’s intersection conjecture requires a more general version of Theorem 3.1 and is therefore beyond the scope of this survey, we will still be able to derive other intersection bounds.
In the following simple lemma we show how Frostman exponents (and therefore, by Lemma 4.1, also dimensions) of projected measures give information about the size of fibers. We recall the definition of upper box-counting (or Minkowski) dimension in a totally bounded metric space . Given , let denote the maximal cardinality of an -separated subset of . The upper box-counting dimension of is then defined as
[TABLE]
Lemma 4.10**.**
Let be a compact metric space, and suppose is a Lipschitz map. Let be a probability measure on such that for all and all sufficiently small (independent of ). If has Frostman exponent , then there exists such that for all balls of radius in , any -separated subset of has size at most .
In particular, for any ,
[TABLE]
Proof.
Let be an -separated subset of with small. Then
[TABLE]
while the set in question projects onto an interval of size at most . Hence , giving the claim. ∎
We give one concrete application of Theorem 3.1 in conjunction with this lemma, and refer to [19, §6.3] for further examples. Let be an integer, and let be a proper subset. Let be the set of consisting of all points whose -ary expansion has only digits from . This is the self-similar set associated to the IFS . For example, the middle-thirds Cantor set is the case , . We call such a set a -Cantor set.
Corollary 4.11**.**
Let be a -Cantor set, . Then for every irrational number and any ,
[TABLE]
Proof.
Let , and let be the uniform self-similar measure on . Since the IFS generating satisfies the open set condition, it is well-known, and not hard to see, that for all , with the implicit constant depending only on . Hence the product measure satisfies
[TABLE]
for all .
Let . Then is the uniform self-similar measure generated by the IFS
[TABLE]
We claim that this IFS has exponential separation for all irrational . Assuming the claim, the corollary follows by combining Corollary 4.2 and Lemma 4.10 (keeping (4.5) in mind) .
The argument to establish exponential separation in this setting is due to B. Solomyak and the author, and was originally featured in [12, Theorem 1.6]. Fix . The separation number associated to has the form , where have the form with . Moreover, and cannot be simultaneously [math] since this would imply an exact overlap in the IFS generating . If either or are zero for infinitely many , then for infinitely many and hence we are done. So assume for all , and therefore
[TABLE]
where . If for all , then for all we have
[TABLE]
so, again using the irrationality of , there is exponential separation. It remains to analyze the case for infinitely many . For any such , the quotient is a non-zero rational number of denominator at most . Since for all , we conclude that there are infinitely many such that either or . Thus exponential separation also holds in this case, finishing the proof. ∎
For rational the behaviour is completely different: it follows from [3, Theoren 1.2] that if is any -Cantor set of dimension , and (in particular this holds if is prime), then for every rational there are many values of such that
[TABLE]
More precisely, for a given this holds for a typical chosen according to the natural self-similar measure on .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Christoph Aistleitner, Gerhard Larcher, and Mark Lewko. Additive energy and the Hausdorff dimension of the exceptional set in metric pair correlation problems. Israel J. Math. , 222(1):463–485, 2017. With an appendix by Jean Bourgain.
- 2[2] Shigeki Akiyama, De-Jun Feng, Tom Kempton, and Tomas Persson. On the Hausdorff dimension of Bernoulli convolutions. Int. Math. Res. Not. IMRN , accepted for publication, 2018. ar Xiv:1801.07118.
- 3[3] Balázs Bárány and Michał Rams. Dimension of slices of Sierpiński-like carpets. J. Fractal Geom. , 1(3):273–294, 2014.
- 4[4] BALÁZS BÁRÁNY, MICHAŁRAMS, and KÁROLY SIMON. On the dimension of triangular self-affine sets. Ergodic Theory Dynam. Systems , 39(7):1751–1783, 2019.
- 5[5] Emmanuel Breuillard and Péter P. Varjú. Entropy of Bernoulli convolutions and uniform exponential growth for linear groups. J. Anal. Math. , accepted for publication, 2018. ar Xiv:1510.04043.
- 6[6] Emmanuel Breuillard and Péter P. Varjú. On the dimension of Bernoulli convolutions. Ann. Probab. , 47(4):2582–2617, 2019.
- 7[7] Semyon Dyatlov and Joshua Zahl. Spectral gaps, additive energy, and a fractal uncertainty principle. Geom. Funct. Anal. , 26(4):1011–1094, 2016.
- 8[8] Paul Erdős. On a family of symmetric Bernoulli convolutions. Amer. J. Math. , 61:974–976, 1939.
