The pointwise H\"older spectrum of general self-affine functions on an interval
Pieter Allaart

TL;DR
This paper analyzes the multifractal spectrum of self-affine functions on an interval, including well-known examples like the Takagi function, and determines when the multifractal formalism accurately describes their pointwise regularity.
Contribution
It provides explicit formulas for the pointwise Hölder spectrum of self-affine functions and identifies conditions under which the multifractal formalism holds or fails.
Findings
Multifractal spectrum given by formalism when |d_k| ≥ |a_k| for some k
Explicit pointwise Hölder exponents derived for certain cases
Conditions identified for multifractal formalism validity
Abstract
This paper gives the pointwise H\"older (or multifractal) spectrum of continuous functions on the interval whose graph is the attractor of an iterated function system consisting of affine maps on . These functions satisfy a functional equation of the form , for and . They include the Takagi function, the Riesz-Nagy singular functions, Okamoto's functions, and many other well-known examples. It is shown that the multifractal spectrum of is given by the multifractal formalism when for at least one , but the multifractal formalism may fail otherwise, depending on the relationship between the shear parameters and the other parameters. In the special case when for every , an exact expression is derived for the pointwise H\"older exponent at any point.…
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.
The pointwise Hölder spectrum of general self-affine functions on an interval
Pieter Allaart
Mathematics Department, University of North Texas, 1155 Union Cir #311430, Denton, TX 76203-5017, U.S.A.
Abstract.
This paper gives the pointwise Hölder (or multifractal) spectrum of continuous functions on the interval whose graph is the attractor of an iterated function system consisting of affine maps on . These functions satisfy a functional equation of the form , for and . They include the Takagi function, the Riesz-Nagy singular functions, Okamoto’s functions, and many other well-known examples. It is shown that the multifractal spectrum of is given by the multifractal formalism when for at least one , but the multifractal formalism may fail otherwise, depending on the relationship between the shear parameters and the other parameters. In the special case when for every , an exact expression is derived for the pointwise Hölder exponent at any point. These results extend recent work by the author [Adv. Math. 328 (2018), 1–39] and S. Dubuc [Expo. Math. 36 (2018), 119–142].
Key words and phrases:
Continuous nowhere differentiable function; Self-affine function; Pointwise Hölder spectrum; Multifractal formalism; Hausdorff dimension; Divided difference
2010 Mathematics Subject Classification:
Primary: 26A16, 26A27, Secondary: 28A78, 26A30
1. Introduction
If is a continuous function, then for and we write if there exist a constant and a polynomial of degree less than such that
[TABLE]
The pointwise Hölder exponent of at is the number
[TABLE]
Hölder exponents were used by Mandelbrot [18] and Frisch and Parisi [8] to study intermittent turbulence, and were investigated later from a mathematical point of view by Jaffard [11, 12] and others, mostly using wavelet methods. In this paper we use a more direct approach to determine the pointwise Hölder spectrum of the general self-affine function , defined as follows. Let be a polygonal line such that , and let be affine transformations of given by , , where , , and for each ,
[TABLE]
Note that (1.2) implies . There is then a unique continuous function satisfying the functional equation
[TABLE]
(See [5, Theorem 1].) Many famous “pathological functions” are obtained in this way; see the examples below. The objective of this paper is to determine the pointwise Hölder spectrum of ; that is, the function
[TABLE]
The function has previously been determined for some special cases; for instance, Ben Slimane [4] gave a complete solution for and . More recently, the author [1] considered functions of the form (1.3) without shear coefficients (i.e. for each ) and showed that is given by the multifractal formalism (defined below) provided that is replaced with
[TABLE]
This quantity is easier to analyze but says little about the regularity of near if has a nonvanishing finite derivative at . The present article improves the main result of [1] in two important ways: (i) It extends the result to self-affine functions with shears (i.e. not all zero); and (ii) it provides the spectrum of the actual pointwise Hölder exponent rather than . As will be seen below, the presence of shears sometimes causes the multifractal formalism to fail, as was already noted in [4].
This paper also complements recent work of Dubuc [5], who classifies the differentiability properties of all functions of the form (1.3) and shows that
[TABLE]
unless happens to be a polynomial. (This generalizes an earlier result of Bedford [3]). The results and proof techniques from [1] and [5] play an integral role in the proofs of the main result below, but several new ideas had to be introduced to deal with the cases when the multifractal formalism fails.
1.1. Examples
Before stating the main result, we present some well-known examples of self-affine functions. Observe first that for any given polygonal line there are many self-affine functions of the form (1.3). For instance, when for every , (1.2) is equivalent to the system
[TABLE]
so there is one degree of freedom for each . One may, for example, freely choose all the vertical (signed) contraction ratios , and then the other parameters are fixed.
Example 1.1** (Generalized Takagi functions).**
For a parameter , let
[TABLE]
where denotes the distance from to the nearest integer. Then satisfies (1.3) with , , and . The case gives the classical Takagi function (see [22]), shown in the leftmost panel of Figure 1. When , is nowhere differentiable and its graph has Hausdorff dimension greater than [16]; and when , is differentiable everywhere except at the dyadic rationals in . Note that gives the parabola , which is uninteresting from the point of view of multifractal analysis. In most of the results of this paper, we will have to explicitly rule out the possibility that is a polynomial. **
Example 1.2**.**
The Riesz-Nagy singular function [20] with parameter (middle graph in Figure 1) satisfies (1.3) with , , and . The Riesz-Nagy function has also been attributed to Salem [21] and Hellinger [9], and is sometimes called Lebesgue’s singular function (e.g. [15]). **
Example 1.3**.**
Okamoto’s function [19] with parameter (rightmost graph in Figure 1) satisfies (1.3) with , , , and . For we get the Cantor function; the case was studied by Katsuura [14]. **
Many more examples, as well as a useful Matlab program for drawing graphs of self-affine functions (which the author gratefully used to produce Figure 1), can be found in Dubuc’s expository paper [5].
1.2. The main result
Define the index sets
[TABLE]
To avoid degenerate cases, we assume . Set
[TABLE]
and let
[TABLE]
Furthermore, let , and be the nonnegative numbers satisfying
[TABLE]
Note that since . On the other hand, and are typically zero unless there is a tie for the minimum (resp. maximum) of . Put
[TABLE]
Note that .
For each , let be the unique real number such that
[TABLE]
It is well known from multifractal theory (e.g. [7, Chapter 17]) that the function is strictly decreasing and convex, and its Legendre transform
[TABLE]
is strictly concave on the interval , and takes the value outside this interval. We say the multifractal formalism (MFF) holds if for all . In what follows, we shall assume that for each . It is straightforward, but cumbersome, to state similar theorems for cases where some of the are negative.
Define the index set
[TABLE]
Here we interpret as zero, and we declare that if and , or similarly, if and .
A special case of our main theorem below (with and ) was proved by Ben Slimane [4].
Theorem 1.4**.**
Assume for .
- (a)
Suppose for at least one or . Then
- (i)
* when ;* 2. (ii)
* is empty if , and has Lebesgue measure one otherwise;* 3. (iii)
* for all ;* 4. (iv)
, and ; 5. (v)
The maximum value of is attained at , and . Moreover, if , then has Lebesgue measure one. 2. (b)
Suppose for every and . Let be such that
[TABLE]
and put for . Let
[TABLE]
- (i)
* when ;* 2. (ii)
* is empty if , and has Lebesgue measure one otherwise;* 3. (iii)
For we have
[TABLE] 4. (iv)
The function is differentiable at . 5. (v)
. 6. (vi)
, and statement (v) of part (a) holds.
The multifractal spectrum of Theorem 1.4 (b) is illustrated in Figure 2. That does not follow the MFF for can be roughly explained as follows: The presence of shears in the maps causes a drop in Hölder exponent for points which are exceptionally well approximated by the images of [math] and under the composite maps , for , where . This phenomenon occurs only for Hölder exponents greater than 1, but in the setting of Theorem 1.4 (b) it affects a large enough set of points to increase the value of at the lower end of the spectrum, compared to what the MFF would predict (the dashed line in Figure 2).
Remarks**.**
(i) Note that the ’s are used to determine whether , but play no further role in the determination of the multifractal spectrum of .
(ii) When , the set contains at most the number . It is easy to check that in this case (assuming and ),
[TABLE]
(iii) Theorem 1.4 (b) includes the following special case: If is constant (for all ), then and for each , so that as well. In this case, the graph of is just the straight line segment connecting the points and .
(iv) When for some , the set has to be modified. Other than that, however, the statement of the theorem remains essentially the same. **
1.3. Related literature
There is a vast body of literature on Hölder spectra of continuous functions; we mention only those papers here which are most closely related to the present article. Jaffard [12] determines the multifractal spectrum of “self-similar” functions , but imposes a certain smoothness condition that rules out our functions. However, Jaffard and Mandelbrot [13] adapt Jaffard’s method to compute the multifractal spectrum of Pólya’s space-filling curve, which is of the form (1.3) except that it maps into . Ben Slimane [4] gives a complete description of the Hölder spectrum of in the case and . (This includes the Riesz-Nagy function and the generalized Takagi functions from Example 1.1.) Self-affine functions mapping into for any were studied by Allaart [1] and Bárány et al. [2]. These functions satisfy a functional equation for and , where are similarities in [1], and general affine maps in [2]. (Not surprisingly, the price for greater generality in [2] is that the results are less explicit, and severe restrictions must be imposed to obtain the full pointwise Hölder spectrum.) Recently, Jaerisch and Sumi [10] have extended some of the results of [1] to distribution functions of general Gibbs measures.
1.4. Organization of the paper
The rest of this article is organized as follows. In Section 2 we define a kind of generalized entropy function and state two useful duality principles. Section 3 gives two concrete examples illustrating the main theorem. Section 4, the longest and most technical section of the paper, develops an exact expression for the right pointwise Hölder exponent of at any point . A crucial role in its proof is played by the method of divided differences that was introduced in this context by Dubuc [5]. This expression is then used in the next two sections, which prove the lower and upper bounds in Theorem 1.4, respectively. The differentiability of at is proved in Section 7. Finally, in Section 8, we show how the techniques of this paper can be used to strengthen the main result of [1].
2. Generalized entropy and duality principles
For the remainder of this paper we shall assume without further mention that for every .
Before illustrating the main theorem, we present and the function in (1.8) as constrained maxima of certain entropy-like functions over a simplex. These dual representations will be important for the proofs later and can also be convenient for concrete computations. We denote by the standard simplex in :
[TABLE]
and set
[TABLE]
Define the function
[TABLE]
where as usual, we set . A proof of the following useful duality principle can be found in [1].
Proposition 2.1**.**
For each , we have
[TABLE]
Proposition 2.1 represents as the maximum value of over the intersection of a simplex with a hyperplane. The characterization is especially useful when , in which case the intersection consists of a single point, which is the solution of two linear equations in the two unkwowns and .
In order to prove Theorem 1.4 (b), we need a second, somewhat more involved duality principle. Recall that is the unique number satisfying .
Lemma 2.2**.**
Assume for each . The maximum value of
[TABLE]
over is , and is attained at (where we define for ).
Proof.
We could use the method of Lagrange multipliers, but the following argument is more direct. Let , and observe that the inequality is equivalent to (the summations being over ). But
[TABLE]
since we recognize the last expression as the relative entropy (or Kullback-Leibler divergence) of the probability vector relative to the probability vector , which is always nonnegative (an easy consequence of Jensen’s inequality). Moreover, equality obtains when for all . ∎
Proposition 2.3**.**
Assume for every , and define
[TABLE]
for , where the summations are over . Then
[TABLE]
Proof.
This follows from Proposition 2.1 and Lemma 2.2, by noting that if and only if . ∎
3. Examples
The first example, a generalization of Example 1.1, illustrates how to use Theorem 1.4 in combination with Propositions 2.1 and 2.3. For more examples along these lines, see [1].
Example 3.1** (Skew Takagi function).**
Fix numbers , and , and consider the self-affine function from (1.3) with parameters , , , and . We can view as a skewed version of the Takagi function from Example 1.1, with the tent map replaced by the triangle with vertices , and ; see Figure 3. If , we are in the situation of Theorem 1.4 (a) and the Hölder spectrum of is given by the multifractal formalism. Here Proposition 2.1 allows us to calculate very explicitly. Solving simultaneously the equations and , we obtain
[TABLE]
and then
[TABLE]
Now assume that instead. We must then determine the set . Using the characterization (1.9), we see that if and only if . Assuming this is not the case, we are in the situation of Theorem 1.4 (b). With the unique solution of , we can calculate
[TABLE]
and then is as given in (1.8), with again given by (3.1). **
The next example shows that certain self-affine functions can be obtained as indefinite integrals of other self-affine functions.
Example 3.2**.**
Consider the case when for every , so for . Let . A straightforward calculation shows that is again self-affine, satisfying
[TABLE]
where , and . It should be clear from the definition of that is differentiable everywhere on , and its multifractal spectrum is just that of shifted one unit to the right. Indeed, although for all , it is not difficult to verify using (1.4) that , so Theorem 1.4 (a) applies equally to and .
Vice versa, if satisfies (1.3) with for each and , then exists everywhere and is again self-affine, with parameters , , , and . **
4. The exact Hölder exponent of
We first introduce some additional notation. Say (resp. ) if there is a constant and a polynomial of degree less than such that
[TABLE]
Define the right and left pointwise Hölder exponents of at , respectively, by
[TABLE]
We aim to give an exact expression for for all but countably many points; a formula for can be obtained similarly. Precisely, we will omit the points from the set
[TABLE]
where . (These are the -adic rational points in case for each .) A precise statement requires the following notation. Let
[TABLE]
and
[TABLE]
Fix a point . There is a unique sequence of indices from , called the coding of , such that . Set
[TABLE]
and let
[TABLE]
or in case . We now define two indicators,
[TABLE]
and
[TABLE]
Assuming for all , we define
[TABLE]
and
[TABLE]
Finally, set
[TABLE]
Theorem 4.1**.**
Assume for all , and let with coding . Assume also that is not a polynomial. Then
[TABLE]
Moreover, if , then the right derivative of at is given by
[TABLE]
Note that the denominator in the expressions for and is negative. Hence, exceptionally large values of can reduce the pointwise Hölder exponent of at from the “default” value when or is positive. On the other hand, if , then we simply have .
Remark 4.2**.**
We can similarly give an expression for . Rather than stating a formal theorem, we briefly indicate how to modify the one above. First, in the definitions of , and , switch the roles of the digits and . The definition of should be changed to if and [math] otherwise; and the definition of should be changed to if and [math] otherwise. Then the expression in the theorem gives , and if this number is greater than 1, then the left derivative is given by the right hand side of (4.3). **
Remark 4.3**.**
It is possible, in principle, to give exact expressions for also in cases where for some . However, such statements would be even more complicated than the ones given, for instance, in [1, Theorem 6.1]. We therefore do not pursue this here. **
Before proving Theorem 4.1, we point out some relationships between the quantities and . Clearly, when , and when . More subtle are the following inequalities.
Lemma 4.4**.**
Assume and for all . Then . Moreover, if and , then .
Proof.
Throughout, we suppress the dependence on . Observe that
[TABLE]
Since
[TABLE]
it follows that when , and when .
To prove the second statement, suppose and . Then there is a constant such that for every . There also is a such that, for all large enough , . Starting from (4.4), we then have for all sufficiently large ,
[TABLE]
independent of . Hence, . ∎
Corollary 4.5**.**
If and , then .
Proof.
By Lemma 4.4, . On the other hand, implies , so directly from the definition of . ∎
Corollary 4.6**.**
Let .
- (i)
Under the hypotheses of Theorem 1.4 (a), . 2. (ii)
Under the hypotheses of Theorem 1.4 (b), .
Proof.
If for some , then , so assume for all . Clearly , so . As shown in [1, Lemma 6.3], also. If for some , then and so by Lemma 4.4. If , then because for all . Finally, if for all , then and so by Lemma 4.4. Thus, the corollary follows from Theorem 4.1. ∎
The proof of Theorem 4.1 is quite long and technical. We split it in two parts: First we prove the lower bound (Steps 1 and 2), and then, after introducing some useful facts about divided differences, we prove the upper bound (Steps 3 and 4).
We shall use the following terminology and notation. By a basic interval of order we shall mean an interval of the form , where . For any interval , will denote its length. Let denote the basic intervals of order , enumerated in order from left to right. For , there is for each a unique such that ; denote this interval by . If and , there are unique points such that and . In that case, we have the explicit expression (see [5, p. 135])
[TABLE]
Finally, we use the short hand notation
[TABLE]
Proof of Theorem 4.1 (lower bound).
Here we show that . We assume throughout the proof that and ; the proof in the other cases is simpler and shorter. Note that our assumption implies that , and furthermore
[TABLE]
Fix with coding . The case when for some is trivial, so we assume that for all . Let .
Step 1. We assume that and show that for every .
Fix and note that in particular, . Take a point with , and let be the largest integer such that
[TABLE]
Then , so there is an absolute constant such that . We write this as .
Case 1. If , we have simply, using (4.5),
[TABLE]
for some . Since , and are all bounded, it follows that there is a constant such that
[TABLE]
Now, since , there is a number and an integer such that and for all , and so
[TABLE]
This shows that the last product in square brackets in (4.8) tends to zero. The summation in (4.8) we split in two parts. Observe first that
[TABLE]
Since , it follows at once that
[TABLE]
For the remaining terms we can apply (4.9), obtaining
[TABLE]
As a result, the upper estimate for in (4.8), which holds when , tends to zero as .
Case 2. Suppose now that . Let . Note that . Let be the largest integer such that
[TABLE]
Observe that in view of (4.7). Hence, there is an index such that , and it follows that the interval is adjacent to . By (4.10), and so . Observe that our choice of implies
[TABLE]
and then also
[TABLE]
The interval has coding , where for , , and for . Let be the point joining and . We have already shown that \big{(}\phi(\xi_{n})-\phi(\xi)\big{)}/(x-\xi)^{\alpha}\to 0, so it remains to establish that
[TABLE]
(Recall that and is determined by through (4.7).) By (4.5), we have
[TABLE]
for some point . Hence, for some constant ,
[TABLE]
where for . We first rewrite
[TABLE]
If , then and we are done with this term. Otherwise, , and (4.12) gives
[TABLE]
using (4.1). In this case, since , there exist and such that for all . It follows that, analogously to (4.9),
[TABLE]
Hence by (4.16),
[TABLE]
The summation in (4.15) we divide in two parts:
[TABLE]
First, we rewrite
[TABLE]
By (4.11),
[TABLE]
and therefore,
[TABLE]
Thus as in Case 1. The second summation we rewrite as
[TABLE]
We now consider three cases:
(a) If , then , so by (4.18).
(b) If , then . By (4.11), there are constants and such that , so for all large enough , since . Thus, by (4.18) and (4.17), .
(c) If , then the largest term in is the one with , but this term differs at most by a multiplicative constant from the last term in . So in this case, too, . This completes Step 1.
Step 2. We assume that and show that the series
[TABLE]
converges absolutely, and
[TABLE]
It then follows that for every , and is right differentiable with .
First, since , (4.9) holds with for some and some . Since is uniformly bounded, we conclude that the series in (4.19) converges absolutely.
For , let again be the largest integer satisfying (4.7).
Case 1. Assume first that . Then there are numbers in such that
[TABLE]
so that
[TABLE]
There exist and such that (4.9) holds. So for ,
[TABLE]
Again by (4.9),
[TABLE]
Combining these last two results with (4.21) yields (4.20) for .
Case 2. Suppose now that . Let . We define the integer , the adjoining interval to the right of and the connecting point as in Case 2 of Step 1, and note that (4.11) and (4.12) hold. By (4.5), there are points such that
[TABLE]
and
[TABLE]
where and are defined as in Step 1. As in (4.18), and, more straightforwardly, , so the remainder terms in (4.22) and (4.23) are of no concern. Putting for brevity, we can write the summation in (4.23) as
[TABLE]
where
[TABLE]
Thus,
[TABLE]
where and denote the remainder terms in (4.22) and (4.23), respectively. This gives
[TABLE]
It has already been established that the first and last terms tend so zero, so we focus on the term involving .
Recall from our assumptions at the beginning of the proof that , so the second summation in (4.25) is bounded. We consider three subcases:
(i) If , then . If , then and the dominant term in the first summation in is the one with , which is of order . So in this case,
[TABLE]
as in Step 1, where we used (4.11) and (4.12) in the second step, and the convergence to zero follows from (4.17). If, on the other hand, , then simplifies to
[TABLE]
At this point, there are two possibilities:
(a) . Then simplifies further to
[TABLE]
by definition of , so that (4.9) gives
[TABLE]
(b) . Then and , so that
[TABLE]
since , where we used the obvious analogy to (4.17).
(ii) Suppose next that . If , the situation is as in case (i). If , then we have , and hence
[TABLE]
by (4.17), since (see Step 1).
(iii) Suppose finally that . Then . Summing the finite geometric series in (4.25) gives
[TABLE]
Note that is bounded. If , then and we have (4.27). Suppose . Then simplifies to
[TABLE]
As for the first term, we see at once that
[TABLE]
The second term vanishes when . If , then , and we obtain
[TABLE]
as in case (i) above. This completes Step 2, and the proof of the lower bound. ∎
The proof of the upper bound in Theorem 4.1 uses the technique of divided differences. We briefly review the definition and basic properties. For a function and a finite list of distinct points , the divided difference is defined inductively as follows:
[TABLE]
and
[TABLE]
Divided differences have some of the same properties as higher order derivatives. They are linear in and satisfy a mean value theorem. For the purposes of this article, the most important properties are the following:
Lemma 4.7**.**
- (i)
If is a polynomial of degree less than , then for every choice of points . 2. (ii)
If is not a polynomial on , then for every there are points in such that .
The next lemma, whose proof can be found in [5, Lemma 12], is crucial for proving the upper bound on .
Lemma 4.8** (Dubuc).**
Let and let be an increasing sequence of distinct points in . Then for any there is an index such that
[TABLE]
where .
Proof of Theorem 4.1 (upper bound).
Here we show that . We assume again that and , so that and the inequalities (4.6) hold.
Step 3. We assume that and show that for any . Note that implies by Lemma 4.4. We begin by showing that if .
Since is not a polynomial, it is not linear on and so there exists such that . Set for , and denote , and . From (4.5), we obtain
[TABLE]
and
[TABLE]
so that
[TABLE]
Note that . Thus, by Lemma 4.8, there is a point such that with . Hence,
[TABLE]
so by the counterpart of (4.9),
[TABLE]
for any .
If for all but finitely many , then and we are done. Assume therefore that for infinitely many . There is then an increasing subsequence such that for each , and
[TABLE]
Take and let . Let be the integer such that . We may assume also that (otherwise we simply scratch this from the subsequence ). Then the next basic interval has length . Note that
[TABLE]
Let be the largest integer such that . Then , so there is an integer such that the basic interval has length and is adjacent to (and to the right of) . Write . Let be the affine map satisfying and . Put . Applying Lemma 4.8 to the interval we see that there is a point such that , with as above. Then for at least one ,
[TABLE]
Now, since , there is an and an integer such that if and , then . This gives the dual to (4.18), namely
[TABLE]
Since
[TABLE]
it follows that
[TABLE]
for some constant . Thus, . This completes Step 3.
Step 4. We assume that and show that for any .
Case 1. Suppose first that . Take . From the work in Step 2 it follows that
[TABLE]
with defined as in (4.19). Hence, if there is a polynomial such that (1.1) holds, it must be the case that . We show that this leads to a contradiction.
Let be an increasing sequence of positive integers such that
[TABLE]
Since , we may assume that for each , and so . Moreover, , so we may assume that for all , for some suitable number to be chosen later. Take , and put and . Choose and as in Step 3, and write . Recall that is a basic interval adjacent to .
In Step 2 we derived for the expression
[TABLE]
with as defined by (4.25). Since , we have
[TABLE]
as in Step 2. We show that the remaining term,
[TABLE]
is unbounded if we take . Observe that by the choice of , , and similarly, as in (4.30). Hence
[TABLE]
where . We claim that is bounded away from zero when . To show this, we distinguish two cases:
(i) . Here we can write as in (4.28). We first show that is large when is large. From the choice of it follows that
[TABLE]
so that
[TABLE]
Let
[TABLE]
Then by definition of . Thus, since , we can assume in view of (4.28) and (4.31) that is large enough so that .
(ii) . Then , so our assumption that implies that for all sufficiently large . So we may assume . Then (see the note following (1.7)) means that
[TABLE]
and of course there are only finitely many possible values for this expression. Denote the smallest of these (in absolute value) by . At the same time, now simplifies to (4.26). Thus, we can assume is large enough so that . This proves our claim.
It now remains to show that
[TABLE]
along . But this follows since
[TABLE]
as in (4.27), and . We conclude that .
Case 2. Suppose on the other hand that . Take , and let be the smallest integer greater than . Since is not a polynomial, there is by Lemma 4.7(ii) a partition of such that . Let for . Let be a polynomial of degree less than such that , and set .
Assume first that . Let for . By Lemma 4.7(i), , and so
[TABLE]
Applying Lemma 4.8 to the function and the partition , we see that there is a point such that
[TABLE]
where , with . Hence
[TABLE]
since .
Assume next that . Then there is a subsequence such that for each , . Take such an . We now proceed as in the second case of Step 3, choosing the integer and the interval in the same way and letting be the affine map which maps onto without reflections. Now set for . This time we apply Lemma 4.8 to the function and the partition of to obtain a point such that
[TABLE]
Precisely as in Step 3 (see (4.29) and beyond), it now follows that
[TABLE]
Thus, . This completes the proof. ∎
Corollary 4.9**.**
If , then .
Proof.
The proof of Theorem 4.1 shows that the polynomial approximating for is given by for , and by for , where is given by (4.19). The proof shows only that is the right derivative of at . A completely analogous argument shows, however, that when , is also the left derivative of at , and the polynomial approximating for is the same as that for . Hence, . ∎
Remark 4.10**.**
The situation is different for points of . Take ; then has two codings and . It is straightforward to verify that and . Let us assume that and , so that and . Then exists and is given by (4.19) applied to the coding . Similarly, the left derivative is given by (4.19) applied to the coding . Working out the two infinite series, one finds that if and only if . When that is the case, is differentiable at and . But if , then is not differentiable at and . **
5. Proof of the lower bound
Here we assume first that we are in the setting of Theorem 1.4 (b); that is, for all , and . Without loss of generality we may assume that there is an element of such that . (If this is not the case, then there is a such that , and we reverse the roles of and in what follows; see Remark 4.2.) Note that .
We begin by constructing particular sets of sequences in . Fix and set . Set . Choose sequences and of positive integers such that for each ,
[TABLE]
and
[TABLE]
These two assumptions together imply
[TABLE]
a fact we will use repeatedly. We partition into the four sets
[TABLE]
Let be the set of all sequences in for which if , and if . For a given sequence , let
[TABLE]
or if ; and
[TABLE]
or if . We furthermore define
[TABLE]
and . For and , let be the index such that (or if no such exists), and define
[TABLE]
or if . Thus, is the run length of the digit ending at the th digit if digits whose index falls outside are ignored. Similarly, define
[TABLE]
or if .
Next, for a probability vector , we let denote the corresponding Bernoulli measure on . That is, the unique Borel measure on (endowed with the product topology) under which are independent random variables such that with probability , for .
Fix , and assume satisfies
[TABLE]
Let be the set of sequences satisfying
[TABLE]
Then by the strong law of large numbers and the well known fact that almost surely, maximum run lengths of digits grow at most logarithmically. Observe also that for , (5.6) and (5.7) imply
[TABLE]
by the construction of , since for all , and for all .
Let be the projection map given by
[TABLE]
and let be the pushforward of .
Lemma 5.1**.**
We have
[TABLE]
Proof.
Since and , it follows that . Let and . Clearly, . By Theorem 4.1,
[TABLE]
Since along , this is attained along . Suppose ; then and so . Hence . Observe also that
[TABLE]
and similarly,
[TABLE]
using (5.3), which also implies that as . As a result,
[TABLE]
where the first equality uses the definition of , the last equality follows from (5.4), and the convergence follows from (5.5) after dividing numerator and denominator by , noting that by (5.3), so that . Thus, .
Likewise, by (5.7) and the analog of Theorem 4.1 for (see Remark 4.2) we have . These two observations yield the first inclusion of the lemma; the second follows from Corollary 4.9. ∎
We shall need the following lemma (see [7, Proposition 4.9]), in which denotes the open ball centered at with radius , and denotes -dimensional Hausdorff measure.
Lemma 5.2**.**
Let be a mass distribution on , let be a Borel set and let be a constant. If
[TABLE]
then .
Lemma 5.3**.**
Let satisfy (5.4), and put
[TABLE]
Then for any and any ,
[TABLE]
Proof.
Fix and . We first show that
[TABLE]
Note that subject to (5.4), can be written as
[TABLE]
It suffices to consider . For all we have , and hence
[TABLE]
by (5.5). Suppose first that . Then by (5.3), and
[TABLE]
Since by (5.1), it follows that
[TABLE]
Assume next that . Then by (5.3),
[TABLE]
and
[TABLE]
Hence,
[TABLE]
again using (5.1). The derivation for and is essentially the same. Combining (5.10)-(5.13) yields (5.9). Since , it follows that
[TABLE]
Now consider an arbitrary open ball . Let be the largest integer such that
[TABLE]
Then . If , then
[TABLE]
by (5.14). So suppose . Let . Note that . Now let be the largest integer such that
[TABLE]
Observe that in view of (5.15). Hence, there is an index such that , the interval is adjacent to , and by (5.17), . If , then the coding of is not (a prefix of a sequence) in , so . Consider . Then, assuming as well,
[TABLE]
(If , then and hence .) Note that by the analog of (4.12) we have
[TABLE]
Moreover, as a consequence of (5.3), . Using (5.8), it follows that , and hence (recalling that ), (5.18) and (5.19) imply
[TABLE]
Now (5.16) follows as in the proof of (5.14), since . In the same way (considering instead of ), we can show that
[TABLE]
Thus, the proof is complete. ∎
Proof of the lower bound in Theorem 1.4.
(a) Assume first the hypotheses of Theorem 1.4 (a). We need to show that . But this follows easily from Proposition 2.1, since contains the set
[TABLE]
whenever with , and , a generalization of Eggleston’s theorem [6] due to Li and Dekking [17]. After all, the existence of the frequencies means that , so
[TABLE]
and in the same way, .
(b) Assume next the hypotheses of Theorem 1.4 (b). Fix (when there is nothing to prove). By Proposition 2.3 and by continuity, it suffices to show that whenever and , where was defined in Lemma 5.3. But when this last inequality holds, there is a number such that (5.4) holds, and we can find such that . It thus follows from the three preceding Lemmas that
[TABLE]
as desired. ∎
6. Proof of the upper bound
In this section we prove the upper bounds in Theorem 1.4 (a) and (b). For a short proof of the following elementary lemma, see [1].
Lemma 6.1**.**
Let , and let be nonnegative integers with . Put for . Then
[TABLE]
where we use the convention .
The next result is probably known. However, since the author could not find it in the literature, a proof is included for completeness.
Lemma 6.2**.**
The set
[TABLE]
has Hausdorff dimension zero.
Proof.
Fix and let
[TABLE]
Choose small enough so that
[TABLE]
This is possible since . If , then for every there is an such that . For such , and for any -tuple of integers with , there are basic intervals of level satisfying , , that could possibly contain . Each of these intervals has length \big{(}\prod_{k=1}^{r}a_{k}^{m_{k}}\big{)}a_{r}^{n-\lceil{\varepsilon}n\rceil}. Given , choose so large that . Setting , we then have
[TABLE]
where the second inequality follows from Lemma 6.1, and the last line follows from (6.1). Hence, , and since was arbitrary, the lemma follows. ∎
Remark 6.3**.**
Essentially the same argument shows this: For any , there exists such that
[TABLE]
Proof of the upper bound in Theorem 1.4.
Let and likewise, . Since for all but countably many by Corollary 4.9, it follows that
[TABLE]
Thus, it suffices to estimate and separately. We focus on ; the other term is dealt with similarly.
We can write , where
[TABLE]
It is proved in [1, Section 7] that
[TABLE]
so it remains to bound the dimension of . If , then by Lemma 4.4, so we need only consider the case . First, for , contains only points with by the second statement of Lemma 4.4, so by Lemma 6.2. Assume then, for the remainder of the proof, that .
Let be defined as in Proposition 2.3:
[TABLE]
Note that is well defined even when for some , since the constraint implies
[TABLE]
so the denominator is bounded away from zero. We will show that .
Fix . We can choose so small that and , where
[TABLE]
In view of Remark 6.3, we may choose so that (6.2) holds with in place of . Hence, it is sufficient to show that , where
[TABLE]
Take a point . Write and . Since , it follows that
[TABLE]
So on the one hand, there is an integer such that
[TABLE]
for all ; and on the other hand,
[TABLE]
for infinitely many . So for all , we can find such that (6.5) and (6.6) hold. Furthermore, can be chosen large enough so that . Fix such an , and set and
[TABLE]
Then (for else would equal ), and (6.6) can be rearranged to obtain
[TABLE]
while (6.5) gives
[TABLE]
since and . Note in particular that satisfies the constraint in (6.4). We can now calculate, using (6.7), (6.4), (6.8) and the obvious modification of (6.3):
[TABLE]
Hence, there is a constant (not depending on ) such that
[TABLE]
Note that must lie in one of basic intervals of level , each of which has length
[TABLE]
Given , can be taken large enough so that , so all basic intervals of level or greater have diameter less than . Let be the set of all -tuples for which , \sum m_{k}\big{(}\log|d_{k}|-(\alpha-\delta)\log a_{k}\big{)}\leq 0, and \sum m_{k}\big{(}\log|d_{k}|-(\alpha+\delta)\log a_{k}\big{)}\geq(\alpha+\delta-1)l\log a_{r}. Let denote the set of corresponding probability vectors, i.e. those satisfying (6.7) and the constraint in (6.4). Then
[TABLE]
Here, the third inequality follows from Lemma 6.1 and the fourth from (6.9). The final series converges; thus, letting (and hence ), we obtain . Therefore, , as was to be shown.
The upper bound in Theorem 1.4 (b) now follows, using Proposition 2.3. To see the upper bound in Theorem 1.4 (a), make the following two observations: First, if for some , then one can check easily that the constrained maximum in the definition of is achieved on the boundary , from which it follows that via Proposition 2.1. Second, if , then there are no points for which , so . In both cases, we conclude that . ∎
7. Proof of differentiability of
Assume in this section that for every .
Proposition 7.1**.**
The function is differentiable at .
Proof.
Recall that is the unique positive number such that and that for . Since solves (1.5), it follows immediately that .
Let satisfy . Then . Differentiating (1.5) with respect to then gives
[TABLE]
When , this equation is satisfied by . Since the infimum in (1.6) is uniquely attained, it follows that , and hence, . Thus, is continuous at .
Next, observe that
[TABLE]
and so . Therefore, is differentiable at . ∎
We now briefly address the remaining statements of Theorem 1.4. First, statements (a) (i) and (b) (i) follow from Corollary 4.6, Corollary 4.9 and Remark 4.10. Statements (a) (ii) and (b) (ii) are clear. Statement (a) (v) and its counterpart in (b) (vi) are straightforward; see [1]. That now follows from the differentiability of , which implies . Finally, statements (a) (iv) and (b) (v) are proved exactly as in [1].
8. Higher dimensional self-affine functions
In [1], the present author studied the pointwise Hölder spectrum of certain self-affine functions . In terms of the notation in the present article, they can be described as follows: Let be a partition of , and let be points in such that , , and for . For each , let and let be a contractive similarity such that the maps
[TABLE]
satisfy the connectivity conditions
[TABLE]
There is then a unique continuous function such that
[TABLE]
Let , so is the Lipschitz constant (or contraction ratio) of . Note that in this setup, for every . Moreover, since the maps factor we have necessarily that . Thus, a situation as in Theorem 1.4 (b) cannot occur for these functions.
In [1], two types of Hölder exponent are considered: One is the pointwise Hölder exponent defined in the Introduction of the present article; the other is
[TABLE]
Clearly, , but a priori these exponents need not be equal. One of the main results of [1] is that
[TABLE]
with , and defined as in Section 1 (see [1, Theorem 2.7]). As in the present paper, the proof involves an exact expression for , which can be reformulated in terms of our notation from Section 4 as
[TABLE]
under the simplifying assumption that for each and the constant from Section 4 is positive. (When for one or more ’s, the expression is more complicated; see [1, Theorem 6.1]. When , one interchanges the roles of the digits and .) Using the method of divided differences that was employed in the proof of Theorem 4.1 (based on Dubuc’s lemma), it is straightforward to “upgrade” the proof of [1, Theorem 6.1] and show that (8.3) (and hence (8.2)) holds with in place of . Even in the case when for some , this still works.
In [1, Theorem 2.5], it is shown that for the special case when . We can now conclude that for any function of the form (8.1). (This fails in general for the self-affine functions from (1.3), which can have a nonzero finite derivative as shown in Theorem 4.1.)
Acknowledgments
This paper could not have been written without the prior publication of Dubuc’s article [5]. I wish to thank Prof. Serge Dubuc for encouraging me to use his methods (especially, the divided difference technique and Lemma 4.8) in order to extend his results.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. C. Allaart , Differentiability and Hölder spectra of a class of self-affine functions. Adv. Math. 328 (2018), 1–39.
- 2[2] B. Bárány, G. Kiss and I. Kolossváry , Pointwise regularity of parameterized affine zipper fractal curves. Nonlinearity 31 (2018), no. 5, 1705–1733.
- 3[3] T. Bedford , Hölder exponents and box dimension for self-affine fractal functions. Constr. Approx. 5 (1989), 33–48.
- 4[4] M. Ben Slimane , Multifractal formalism for selfsimilar functions expanded in singular basis. Appl. Comput. Harmon. Anal. 11 (2001), 387–419.
- 5[5] S. Dubuc , Non-differentiability and Hölder properties of self-affine functions. Expo. Math. 36 (2018), 119–142.
- 6[6] H. Eggleston , The fractional dimension of a set defined by decimal properties. Quart. J. Math. Oxford Ser. 20 (1949), 31–36.
- 7[7] K. J. Falconer , Fractal Geometry. Mathematical Foundations and Applications , 2nd Edition, Wiley (2003)
- 8[8] U. Frisch and G. Parisi , Fully developed turbulence and intermittency, in Proc. Enrico Fermi, International Summer School in Physics, North Holland, Amsterdam (1985), 84-88.
