Regularity of anisotropic refinable functions
Maria Charina, Vladimir Yu. Protasov

TL;DR
This paper develops a method to precisely compute the H"older regularity of anisotropic refinable functions, extending previous univariate and isotropic results to the more complex anisotropic multivariate setting.
Contribution
It introduces an exact formula for H"older regularity in anisotropic cases and provides an efficient algorithm for its computation, advancing understanding of multivariate wavelet regularity.
Findings
Exact H"older exponent formula for anisotropic refinable functions
Efficient algorithm for spectral analysis of transition matrices
Analysis of higher and local regularity, and convergence rates
Abstract
This paper presents a detailed regularity analysis of anisotropic wavelet frames and subdivision. In the univariate setting, the smoothness of wavelet frames and subdivision is well understood by means of the matrix approach. In the multivariate setting, this approach has been extended only to the special case of isotropic refinement with the dilation matrix all of whose eigenvalues are equal in the absolute value. The general anisotropic case has resisted to be fully understood: the matrix approach can determine whether a refinable function belongs to or , , but its H\"older regularity remained mysteriously unattainable. It this paper we show how to compute the H\"older regularity in or , . In the anisotropic case, our expression for the exact H\"older exponent of a refinable…
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.
Regularity of anisotropic refinable functions
††thanks: The first author is sponsored by the Austrian Science Foundation (FWF) grant P28287-N35; the second author is supported by RFBR grants nos. 16-04-0832 and 17-01-00809.
Maria Charina
and Vladimir Yu. Protasov Fakultät für Mathematik, Universität Wien, Austria e-mail: [email protected] of University of L’Aquila and Department of Mechanics and Mathematics of Moscow State University e-mail: [email protected]
Abstract
This paper presents a detailed regularity analysis of multivariate refinable functions with general dilation matrices, with emphasis on the anisotropic case. In the univariate setting, the smoothness of refinable functions is well understood by means of the matrix approach. In the multivariate setting, this approach has been extended only to the special case of isotropic refinement with the dilation matrix all of whose eigenvalues are equal in the absolute value. The general anisotropic case has resisted to be fully understood: the matrix approach can determine whether a refinable function belongs to or , , but its Hölder regularity remained mysteriously unattainable.
We show how to compute the Hölder regularity in or , . In the anisotropic case, our expression for the exact Hölder exponent of a refinable function reflects the impact of the variable moduli of the eigenvalues of the corresponding dilation matrix. In the isotropic case, our results reduce to the well-known facts from the literature. We also analyze the higher regularity of anistropic refinable functions. We illustrate our results with several examples.
Keywords: multivariate subdivision, wavelets and frames, refinable functions, Hölder regularity, anisotropic dilation matrix, transition matrix, joint spectral radius, invariant polytope algorithm, discrete shearlet transform
**Classification (MSCS): 65D17, 15A60, 39A99 **
1 Introduction
We study the multivariate refinement equation
[TABLE]
with a compactly supported sequence of coefficients and with a general integer dilation matrix all of whose eigenvalues are larger than one in the absolute value. We do not make any assumptions on the stability of the integer shifts of .
In this paper, we characterize continuous and solutions of (1). Our main contribution is the exact expression for the Hölder exponent of in and in , , see Theorems 1 and 5. In the anisotropic case, the Hölder exponent of reflects the influence of the invariant subspaces of corresponding to its different by modulus eigenvalues. In the isotropic case, when all the eigenvalues of are equal in the absolute value, our results reduce to the well-known ones from the literature. We also analyze the higher regularity of continuous .
It is well known that compactly supported solutions (refinable functions) of (1) can generate systems of multivariate wavelets or frames, see e.g [11, 12, 19, 44, 48]. Refinable functions are building blocks for the limits of subdivision algorithms widely used in approximation and for generating curves and surfaces, see e.g. [5, 13, 25, 49, 65]. Refinable functions naturally appear in recent applications in combinatorics, multigrid, number theory, and probability [7, 8, 21, 27, 43, 52, 57].
In the univariate case, is an integer, there are several efficient methods for determining the regularity of refinable functions. In [14, 22, 26] the authors compute precisely the Sobolev exponent of . The so-called matrix approach yields the Hölder exponent of and, in addition, provides a detailed analysis of its moduli of continuity and of its local regularity [17, 20, 53, 58]. An obstacle to the practical use of the matrix approach is the NP-hardness of the joint spectral radius computation. This problem, however, was successfully resolved for a large class of problems by recent results in [30, 31, 47] where the authors presented fast and efficient methods of the joint spectral radius computation. Indeed, the invariant polytope algorithm [30] estimates the joint spectral radius for the corresponding transition matrices of size up to and, in most cases, even determines its precise value.
The generalization of the matrix approach to the multivariate case turned out to be a difficult task in the case of general dilation matrices. The special case of isotropic dilation is currently fully understood, see [5, 6, 10, 14, 22, 25, 26, 32, 33, 34, 37, 38, 40, 42, 59]. Several partial results in the anisotropic case are also available: for characterizations of continuity and , , regularity of see e.g. [4, 35]; for estimates for the Hölder exponent of see e.g. [4, 35].
The reason for the difficulty of the anisotropic case is natural and hardly avoidable. In the univariate case, say , the distance between two points can be expressed in terms of their binary expansions. The distance between the values and depends on the behavior of the products of certain square matrices derived from , . These two observations establish a correlation between and , which leads to the formula for the Hölder exponent of . This summarizes the essence of the matrix approach. In the multivariate case, one can similarly estimate the distance between and by suitable matrix products. The problem occurs at an unexpected point: the expression for the distance between . One can try to use the corresponding -adic expansions with a certain set of digits from , but such expansions do not provide a clear estimate for the distance between and . Indeed, unless the matrix is isotropic, multiplication by a high power of can enlarge distances differently in different directions. Hence, the points and , , whose -adic expansions are essentially the same, may have different asymptotic behavior as . Remarkably simple examples show that a direct analogue of the isotropic formula for the Hölder exponent does not hold in the anisotropic case. Moreover, unless is isotropic, this formula never holds for Lipschitz refinable functions, see section 3.1.
Nevertheless, there are ways of treating the anisotropic case. In [3, 15, 16, 62], the authors consider special anisotropic Hölder and Sobolev spaces. We put emphasize on incorporating the spectral properties of the dilation matrix into the expression for the Hölder exponent of . Furthermore, we get rid of the -adic expansions and base our analysis on geometric properties of tilings generated by .
Our paper is organized as follows. In section 3, we characterize the continuity and determine the Hölder regularity of multivariate refinable functions, see Theorems 1 and 2. In subsection 3.2, we provide an algorithm for construction of continuous solutions of (1). We consider several examples and list several important special cases of Theorems 1 in subsection 3.1. The crucial steps of the proofs and actual proofs of Theorems 1 and 2 are given in subsections 3.3 and 3.5. We illustrate our results on two numerical examples in subsection 3.6. Both examples deal with continuity and Hölder regularity of refinable functions, the first one being of shearlet type [18]. In section 4, we show how to factorize smooth refinable functions and compute the Hölder exponents of their directional derivatives. In section 5, we analyze the existence of -solutions of (1). We show that a direct analogue of the formula for the Hölder exponent (i.e. replacing the joint spectral radius by the -radius) does not hold in , . To characterize the Hölder exponent of , we consider extended transition matrices, see subsections 5.3 and 5.4.
2 Background and notation
We use the standard notation for the function spaces , . The space of vector-valued functions with components in is denoted by . We write , if the range space is fixed. The Schwartz space of smooth rapidly decreasing functions over is denoted by , and is the space of tempered distributions (distributions over or distributions of slower growth). By we denote the Lebesgue measure of a set and by by either a modulus of a complex number or the cardinality of a finite set. The norm in finite dimensional spaces is always а Euclidean, unless stated otherwise.
2.1 Spectral properties of the dilation matrix
We assume that the integer dilation matrix is expansive, i.e., all its eigenvalues are larger than in the absolute value. Hence, . Exactly among the eigenvalues of are in the absolute value equal to , . If is isotropic, then . For , let , , be the eigenspaces of corresponding to the eigenvalues of modulus . The space is a direct sum
[TABLE]
of the subspaces . There exists an invertible transformation such that has the following block diagonal structure
[TABLE]
where the operator has all its eigenvalues equal to in the absolute value.
2.2 Dilation matrix and tiles
The matrix splits the integer lattice into equivalence (quotient) classes defined by the relation . Choosing one representative from each equivalence class, we obtain a set of digits . We always assume that . The standard choice is to take .
For every integer point , we denote by , the affine operator . We use the notation , . Consider the following set
[TABLE]
By [28, 29], for every expansive integer matrix and for an arbitrary set of digits , the set is a compact set with a nonempty interior and possesses the properties:
a) the Lebesgue measure ;
b) , the sets have intersections of zero measure;
c) the indicator function of satisfies the refinement equation
[TABLE]
d) , i.e., integer shifts of cover with layers;
e) if and only if the function system is orthonormal.
If , then is called a tile. The integer shifts of a tile define a tiling.
Definition 1**.**
A tiling generated by an integer expansive matrix and by a set of digits is a collection of sets such that
a) the union of the sets in covers and , ;
b) .
Not every possesses a digit set such that is a tile. Those situations, however, are rare. For instance, a digit set generating a tile always exists in cases and also for arbitrary with an extra assumption , which is quite general for integer expansive matrices [45]. See [4, 46] for more details. Thus, in this paper, we assume that is a tile.
We denote
[TABLE]
Then , .
2.3 Refinable functions and the transition operator
A compactly supported distribution satisfying equation (1) is called a refinable function. It is well known that the solution of (1) such that exists if and only if . We assume further that the coefficients of (1) satisfy sum rules of order one
[TABLE]
These conditions are necessary for existence of stable refinable functions [5]. Consider the *transition operator * defined by
[TABLE]
For every compactly supported function such that , the sequence converges to in the space [4]. The space of distributions supported on the set
[TABLE]
is invariant under . Hence, for , we have for all . Therefore, the limit . Thus, , see [4, Proposition 2.2].
Definition 2**.**
A finite set is a minimal subset of with the property
[TABLE]
We denote .
It is shown easily that for every .
The main idea of the matrix approach is to pass from a function supported on to the vector-valued function
[TABLE]
Then the transition operator (5) restricted to the space
[TABLE]
becomes the self-similarity operator defined by
[TABLE]
where are the transition matrices defined by
[TABLE]
The rows and columns of the matrices are enumerated by elements from the set . We denote
[TABLE]
The refinement equation becomes the self-similarity equation for the vector-valued function defined by (7) with , i.e.
[TABLE]
2.4 Important subspaces of
We consider the following affine subspace of the space
[TABLE]
It is well known [4, 5] that every compactly supported refinable function such that possesses the partition of unity property:
[TABLE]
Hence, if is continuous, then for all . In particular . For summable refinable function, for almost all . We denote the linear part of by
[TABLE]
Finally, every continuous refinable function defines the difference space
[TABLE]
Since for all , we have , and, therefore, . The sum rules (4) imply that the column sums of each matrix are equal to one. Therefore, and . Thus, is a common affine invariant subspace of the family and is its common linear invariant subspace.
Since is invariant under all , the restrictions of the operators , , to the subspace are well defined. For a fixed basis of , we denote by
[TABLE]
the set of the associated matrices. If the family is irreducible on , i.e., the operators in do not share a common nontrivial invariant subspace of W, then . We also consider the following subspaces of the space
[TABLE]
Note that are nonempty, due to the interior of being nonempty. It is seen easily that the spaces span the whole space , but their sum may not be direct. Indeed, the subspaces , unlike the subspaces , may have nontrivial intersections. For example, they can all coincide with . Lemma 1 shows that all are invariant under .
Lemma 1**.**
If is an invariant subspace of , then is a common invariant subspace for .
Proof.
If , then is a linear combination of several vectors of the form with . For , , , we have and
[TABLE]
Hence, A_{d}\bigl{(}v(y)-v(x)\bigr{)}\in L for each pair , and, therefore, for all . ∎
2.5 Joint spectral radius
Definition 3**.**
The joint spectral radius of a finite family of linear operators is
[TABLE]
This limit always exists and does not depend on the operator norm [60]. The joint spectral radius measures the simultaneous contractibility of the operators from . Indeed, if and only if there exists a norm in in which all are contractions. In general,
[TABLE]
We denote
[TABLE]
3 Continuous solutions and Hölder regularity
In this section, in Theorem 1, we characterize the continuity of a solution of the refinement equation (1) in terms of the spectral properties of and determine the exact Hölder exponent
[TABLE]
of . Although the definition of in (12) depends on , Propositions 1 and 2 remove this dependency. Moreover, the space can be determined explicitly using Algorithm 1 in subsection 3.2 without the knowledge of . If this algorithm fails, then there exists no continuous solution of the corresponding refinement equation. The special cases of Theorem 1 are considered in subsection 3.1, for its summary see Remark 2. The crucial result for the proof of Theorem 1 is Theorem 2. The main steps of the proof of Theorem 2 are summarized in subsection 3.3 and the proofs of Theorems 1 and 2 are given in subsection 3.5. We illustrate our results with examples in subsection 3.6. For the readers convenience, we first list some of the above mentioned crucial results.
Proposition 1**.**
Let be an eigenvector of associated to the eigenvalue . If , then is the smallest by inclusion common invariant subspace of the matrices , that contains the vectors .
For the proof of Proposition 1 see the arXive version of this paper [9]. Our proof is the multivariate analogue of [17, Proposition 3].
Remark 1**.**
Recall that , which justifies the notation . The existence of the eigenvector of associated to the eigenvalue follows by by (11), i.e. and by the continuity implying that .**
Similarly to [17], Proposition 1 yields a useful characterization of .
Proposition 2**.**
Let be an eigenvector of associated to the eigenvalue . The space is the minimal common invariant subspace of the matrices , and contains the vectors .
If the eigenvalue of is not simple, Proposition 3 in subsection 3.2 guarantees that there exists at most one eigenvector associated with one of these eigenvalues such that . Thus, the subspace can be computed, unless the refinement equation does not possess a continuous solution. For simplicity, we make the following assumption.
Assumption 1**.**
The matrix has a simple eigenvalue .
Recall that , where the subspaces are defined in (14).
Theorem 1**.**
A refinable function belongs to if and only if . In this case,
[TABLE]
The proof of (15) is based on Theorem 2. To state it, we define the Hölder exponent of along a linear subspace by
[TABLE]
Theorem 2**.**
If , then
[TABLE]
Remark 2**.**
The identity (15) emphasizes the influence of the spectral structure of the dilation matrix on the regularity of the solution . Recall that, in the univariate case, the Hölder exponent is given by , where is the corresponding dilation factor. In the multivariate case, the Hölder exponent is equal to the minimum of several such values taken over different dilation coefficients on the corresponding subspaces of . In special, favorable multivariate cases, the expression in (15) becomes and, thus, resembles the univariate case. This happens, for instance, when the matrix is isotropic, i.e. , in particular, when , . Another favorable situation is when the matrices in do not possess any common invariant subspace. However, the need for the minimum in (15) is not exceptional. It is of crucial importance e.g. for anisotropic refinable Lipschitz continuous functions , see Corollary 3 in subsection 3.1.**
3.1 Special cases of Theorem 1 and examples
To compare the result of Theorem 1 with the known results from the literature, we need to define the stability of .
Definition 4**.**
A compactly supported is stable, if there exists such that for all ,
[TABLE]
The univariate case (). In this case, the dilation factor is and . Theorem 1 becomes a well-known statement that . If is stable, then we have even if (see [5]). The space was completely characterized in [54] and it was shown that every refinement equation can be factorized to the case . In the multivariate case, however, there is no general factorization procedure and, even in the stable case, we cannot expect , see Example 1 below.
The case with isotropic dilation matrix. Since , it follows that . Theorem 1 then implies the following well-known fact.
Corollary 1**.**
If is isotropic, then .
The irreducible case with . The dilation matrix can be anisotropic, i.e. the number of different in modulus eigenvalues of is . We say that the set of matrices is irreducible, if they do not possess any common invariant subspace. Another corollary of Theorem 1 states the following.
Corollary 2**.**
If the family is irreducible, then .
The irreducibility assumption fails however in many important cases. For instance, if is a tensor product of two refinable functions, then is always reducible.
Example 1**.**
Let be two univariate refinable function with dilations and and refinement coefficients and , respectively. Then the function satisfies the refinement equation with and . Due to , we have . By Theorem 1, , which is natural, because . On the other hand, \rho({\mathcal{A}})=\max\,\bigl{\{}\rho_{1}\,,\,\rho_{2}\bigr{\}}=\frac{1}{2}. Hence, . Thus, in this case, . Note that, if and are both stable, then so is . Nevertheless, unlike in the univariate case, the Hölder exponent of is not determined by the value . **
After Example 1 one may hope that the case of reducible family is exceptional, and the equality actually holds for most refinable functions. On the contrary, the result of Corollary 3 shows that the the situation when the isotropic formula fails is rather generic.
Corollary 3**.**
If the matrix is anisotropic and the refinable function is Lipschitz continuous, then and the family is reducible.
Proof.
Assume that , or, equivalently, . Since is anisotropic, factorization (2) contains blocks, and, hence, for some . By Theorem 2, we have . Therefore, is constant on every affine subspace , . Hence, , because it is compactly supported. The reducibility of follows by Corollary 2. ∎
Thus, we see that at least for all anisotropic smooth refinable functions, the simple formula for the Hölder exponent fails and the minimum in (15) is significant.
The case of a dominant invariant subspace. In practice, this case is much more generic than the irreducible case.
Definition 5**.**
A subspace is called dominant for a family of operators if
* is a common invariant subspace of ,*
* is contained in all common invariant nontrivial subspaces of and*
.
Take a basis of a dominant subspace and complement it to a basis of . Let be the matrix containing these basis elements of . Then every matrix in this basis has a block lower triangular form
[TABLE]
By Definition 5,
[TABLE]
Furthermore, since any common invariant subspace of contains , it follows that the joint spectral radius of restricted to any common invariant subspace is equal to . Therefore, we have proved the following result.
Corollary 4**.**
If the family possesses a dominant subspace, then .
3.2 Construction of and of the continuous refinable function .
In this section, we answer two crucial questions: how to determine the space and how to construct the corresponding continuous refinable function . In the univariate case, the algorithm for determining the space was elaborated in [17]. In this section, we present its multivariate analogue.
Algorithm for construction of the space .
Algorithm 1: For a given set of transition matrices
.Step: Compute in and normalize , where .
.Step: Define U^{(1)}={\rm span}\,\bigl{\{}T_{d}v_{0}\,-\,v_{0}\ :\ d\in D(M)\setminus\{0\}\bigr{\}}.
.Step: Repeat
[TABLE]
while .
[TABLE]
If .Step is impossible, i.e., the eigenvector does not exist, then, by Remark 1, the solution of the refinement equation (1) is not continuous. Note that is dictated by and that, by construction, at least one extra element is added to before the algorithm terminates. Proposition 1, stated at the beginning of section 3, implies that the space in Algorithm 1 coincides with the space in Definition 12.
Algorithm for construction of a continuous .
Due to the fact that the rational -adic points are dense in , the slight modification of Algorithm 1 yields a method for the step-by-step construction of the vector-valued function defined on or, equivalently, of the function .
Algorithm 2: For a given set of transition matrices
.Step: Compute such that and normalize .
.Step: Define .
.Step: For
[TABLE]
end
If the function is continuous, Algorithm 2 determines in a unique way.
The next result ensures that is well defined even if the eigenvalue of the matrix is not simple.
Proposition 3**.**
The matrix has at most one eigenvector associated with the eigenvalue such that . If such exists, then is continuous and .
Proof.
By Algorithm 2, there exists a refinable function with . If there is another eigenvector with this property, then, by Algorithm 2, it generates another refinable function for which . By the uniqueness of the solution of the refinement equation, these two solutions may only differ by a constant, hence, the vectors and are collinear. The continuity of follows from Theorem 1. ∎
3.3 Road map of our main results
We would like to emphasize that, to tackle the anisotropic case, we use geometric properties of tilings rather than the -adic expansions of points in (the latter being a successful strategy in the isotropic case). Our key contribution is Theorem 2 that finally reveals the delicate dependency of the Hölder exponent of a refinable function on its Hölder exponents along the subspaces , . Due to the importance of Theorem 2, we would like to give here a preview of its proof.
Step 1. Extend the vector-valued function in (7) defined on the tile to the whole , see (19). Lemma 4 yields, for (i.e. for some ), the estimate . The extension of is motivated by the fact that parts of the line segment can lie outside of , due to its possible fractal structure.
Step 2. Lemma 3 shows that, for a tiling of , the total number of the subsets of the tiling intersected by a line segment is proportional to the length of that segment.
Step 3. Due to Step 2, Lemma 2 and Proposition 4 imply that, for , any line segment in , , consists of several line segments such that 1) the endpoints of each of those line segments belong to one subset of the tiling ; 2) the total number of those line segments is bounded by .
Step 4. The difference between the values of the function at the endpoints of each of those subsegments of is bounded from above by for some . Hence, by Step 1, the same is true for . Therefore, by the triangle inequality, . For such that , we obtain , where approaches as goes to [math].
3.4 Auxiliary results for Theorems 1 and 2
The proofs of our main results, Theorems 1 and 2, are based on an important observation formulated in Proposition 4. We also make use of the following basic properties of the joint spectral radius and two auxiliary lemmas.
Theorem A1 [60]. For a family of operators acting in and for any , there exists a norm in such that for all .
Theorem A2 [2]. *For a family of operators acting in there exists and a constant such that . Moreover, if is irreducible, then , for some constant . *
Lemma 2**.**
Assume that the segment is covered with distinct closed sets. Then there exist points such that for each , the points belong to one of these sets,.
Proof.
Let the first set contain the point . Choose to be the maximal (in the natural ordering of the real line) point of the first set. If , then must belong to another set of the tiling. Choose to be the maximal point of this set. Repeat until for some . We have , since the sets are distinct. If , we extend the sequence by the points . ∎
Next we show that a segment of a given length intersects finitely many sets of the tiling .
Lemma 3**.**
For a tiling , there exists a constant such that every line segment intersects at most sets of .
Proof.
It suffices to prove that the number of sets intersected by a segment of length is bounded above by . It will imply that the number of sets intersected by a segment of length , is bounded by , and the claim follows. Thus, let a segment be of length . If for some , then the set is contained in , where is the Euclidean ball of radius . Denote by the volume of , then the total number of sets intersecting is bounded by , due to . ∎
To deal with line segments , , that do not completely belong to , we extend the continuous vector-valued function in (7) which is defined on to the whole . Define
[TABLE]
In Lemma 4 and in Proposition 4, we compare the properties of and .
Lemma 4**.**
Let , . Then .
Proof.
Let . By (7) and due to the compact support of , the -th component of is given by
[TABLE]
Hence, we have . ∎
Proposition 4**.**
Let be refinable, and . There exist
[TABLE]
(with from Lemma 3), integers from , positive numbers whose sum is equal to one, and sets of points , from such that for all , and
[TABLE]
Proof.
For , by Lemma 2, there exist points such that each pair of successive points belongs to only one set , , of the tiling . First we give an estimate for . Since elements of the tiling cover a segment of length , the same number of elements of the tiling cover a segment of length . Therefore, Lemma 2 yields . Furthermore, the set , . By Lemma 4, we obtain
[TABLE]
Due to , , the points
[TABLE]
belong to . Thus, by (11), we obtain
[TABLE]
For each , we define the number from the equality . It follows that and that . ∎
3.5 Proofs of Theorems 1 and 2
In this subsection we prove Theorems 1 and 2. We start with Theorem 2 as its proof is a crucial part of the proof of Theorem 1. Note that for both Theorems 1 and 2 the assumption that implies, e.g. by [4], that . We will not reprove this result here.
Proof of Theorem 2.
Let and . We first show that . For arbitrary points such that and , define to be the smallest integer such that . Since , it follows that
[TABLE]
where the constant depends only on . By (19), Theorem A1 and by Proposition 4, for these and , there exist a constant depending on and the integer
[TABLE]
such that (note that implies, by Proposition 4, that in (21) satisfy , )
[TABLE]
with the constant independent of . By the choice of , we have and, hence, . Thus,
[TABLE]
Combining the above estimate with (22) (i.e. ), we get, due to ,
[TABLE]
with and with . Letting , we obtain the claim.
Next we establish the reverse inequality . Let and , . By Theorem A2, there exist and a constant such that . Since the subspace is spanned by the differences , , there exist , , ( dimension of ), such that \displaystyle u\,=\,\sum_{j=1}^{n_{i}}\gamma_{j}\bigl{(}v(y_{j})-v(x_{j})\bigr{)}, . Denote and . Thus, and there exists such that
[TABLE]
Moreover, we have
[TABLE]
Consequently, at least one of the numbers , is larger than or equal to . Combining this estimate with (24) (i.e. with the constant independent of ), we obtain
[TABLE]
where and the constant does not depend on . Since as , there exist arbitrary small segments on which the variation of the function is at least a constant times the length of that segment to the power of . Therefore, . Since is arbitrary, the claim follows. ∎
Proof of Theorem 1.
We only show that the condition is sufficient for continuity of . Let . Note that the set of rational -adic points
[TABLE]
is dense in . To determine the values of in (7) on use the algorithm from subsection 3.2. We first show that is uniformly bounded on . Denote . Then, for every , we have
[TABLE]
Note that, by construction, for . Therefore, by Theorem A1, \bigl{\|}T_{d_{1}}\cdots T_{d_{j}}\bigl{(}v(0.d_{j+1})-v(0)\bigr{)}\bigr{\|}\,\leq\,C_{1}(\rho+\varepsilon)^{j}, . Thus, we obtain
[TABLE]
where the constant is independent of . Hence, which proves the uniform boundedness of on .
The values of on define the function on , where is the set of all rational -adic points of . The so constructed is supported on . Using , define the extension of in (7). We show next that is uniformly continuous on , which implies that its extension to is continuous. Take arbitrary points . By Proposition 4 and the same argument as in the first part of the proof of Theorem 2, we obtain
[TABLE]
where is the smallest number such that . Note that the value is finite because is bounded . Since , i.e. goes to as goes to zero, is uniformly continuous on , which completes the proof of continuity. Thus, if , then .
By Theorem 2, the Holder exponent of on shifts along the subspace is equal to . We pass to a basis in the space , in which all the subspaces are orthogonal to each other. Using a natural expansion we obtain for arbitrary
[TABLE]
where . Consequently, . ∎
3.6 Examples
There are several types of anisotropic dilation matrices, e.g. hyperbolic dilations or products of parabolic scaling and shear matrices, used in hyperbolic wavelet transform or discrete shearlet transform, see [1, 18, 61].
Example 2**.**
In [18], the authors present a general method for constructing interpolatory subdivision schemes with dilations which are products of parabolic scaling and shear matrices. We consider one of these examples with the anisotropic dilation matrix M=\left(\begin{array}[]{cc}2&1\\ 0&3\end{array}\right) and the refinement coefficients
[TABLE]
Note that the corresponding sequence of coefficients is supported on the set . By [28], for the digit set , the set in (3) is a tile. Using the result of [4], we determine the set of size . For the corresponding transition matrices , , using Algorithm 1 from subsection 3.2 we construct the set starting with
[TABLE]
We obtain
[TABLE]
Due to and , is a proper subspace of . Denote . We computed the joint spectral radius of the set using the invariant polytope algorithm from [30] and obtained that the joint spectral radius is attained at the finite product of length
[TABLE]
Since is anisotropic, there exist two non-zero subspaces . We construct these subspaces (each of dimension ) using Step of Algorithm 1 from subsection 3.2 with
[TABLE]
respectively. Note that, due to the continuity of , we have . Furthermore,
[TABLE]
and
[TABLE]
For the restrictions and , we obtain . Therefore, by Theorem 1,
[TABLE]
The next example shows that in some cases .
Example 3**.**
We consider the dilation matrix M=\left(\begin{array}[]{rr}2&1\\ 1&-1\end{array}\right) and the refinement coefficients
[TABLE]
The dilation matrix has eigenvalues and . By [28], for the digit set , the set in (3) is a tile. Using the result of [4], we determine
[TABLE]
The corresponding transition matrices , and are given by
[TABLE]
and
[TABLE]
respectively. The matrix has one eigenvalue with the corresponding eigenvector
[TABLE]
Using Algorithm 1 from subsection 3.2, we obtain with . Thus, and, therefore, . We computed the joint spectral radius of the set using the invariant polytope algorithm from [30] and obtained that the joint spectral radius is attained at the finite product of length , i.e.
[TABLE]
We verified that the matrix family is irreducible in this case. Hence, the only non-zero common invariant subspace of the matrices in is . Thus, . Therefore, and Theorem 1 implies that
[TABLE]
4 Higher order regularity
In this section, we show that the derivatives of the multivariate refinable function satisfy a system of nonhomogeneous refinement equations. The differentiability of is then equivalent to continuity of the solutions of all these equations, see Theorem 3. The main idea is that the directional derivatives of along the eigenvectors of the dilation matrix satisfy certain refinement equations and the directional derivatives along the generalized eigenvectors (of the Jordan basis) of satisfy nonhomogeneous refinement equations, see Proposition 5.
Definition 6**.**
A multivariate nonhomogeneous refinement equation is a functional equation of the form
[TABLE]
where is the transition operator in (5) and is a compactly supported function or distribution.
For more details on nonhomogeneous refinement equations see e.g. [23, 39, 41, 63] and references therein.
Let be the Jordan basis of the matrix in . The Jordan basis consists of the eigenvectors of , which satisfy , and of the generalized eigenvectors, which satisfy . Consider an Jordan block of corresponding to an eigenvalue . With a slight abuse of notation, denote by
[TABLE]
the Jordan basis corresponding to this Jordan block. In the following we study the properties of the directional derivatives of the refinable function , which belong to the following subspaces of .
Definition 7**.**
For a vector , we denote by
[TABLE]
the space of compactly supported distributions, whose mean along every straight line \bigl{\{}x=at+b\ :\ t\in{\mathbb{R}}\bigr{\}}, , parallel to , is equal to zero.
By \nabla\varphi\,=\,\bigl{(}\frac{\partial\varphi}{\partial x_{1}},\ldots,\frac{\partial\varphi}{\partial x_{s}}\bigr{)} we denote the total derivative (gradient) of and by \frac{\partial\,\varphi}{\partial\,a}\,=\,\bigl{(}a\,,\,\nabla\varphi\bigr{)}, its directional derivative along a nonzero vector . Due to the compact support of , its directional derivative belongs to .
The next result shows that a directional derivative of a refinable function along an eigenvector of the dilation matrix is also a refinable function and satisfies the refinement equation (25). A directional derivative of along a generalized eigenvector of satisfies the nonhomogeneous refinement equation (26).
Proposition 5**.**
Let and be an eigenvalue of . If , then \varphi_{i}=\bigl{(}e_{i},\nabla\varphi\bigr{)}\in{\mathcal{S}}^{\prime}_{i}:={\mathcal{S}}_{e_{i}}^{\prime}({\mathbb{R}}^{s}), , satisfy the refinement equation
[TABLE]
and the nonhomogeneous refinement equations
[TABLE]
Conversely, the system of equations (25)-(26) possesses a unique up to a normalization solution . Moreover, if satisfies \bigl{(}e_{i},\nabla\varphi\bigr{)}=\varphi_{i}, , then along the lines parallel to .
Proof.
By induction on , we show that, if satisfies the refinement equation , then \varphi_{i}=\bigl{(}e_{i},\nabla\varphi\bigr{)}, , satisfy (25)-(26). For , due to , we have
[TABLE]
For , due to and (26), we obtain
[TABLE]
Conversely, by [39], the system (25)-(26) possess a unique up to normalization solution. We show that the compactly supported primitive of , , along satisfies . Indeed, since and by (25), we obtain
[TABLE]
which implies that the gradient of the function is orthogonal to . Hence, the function is constant along all lines parallel to . On the other hand, is compactly supported, consequently along all lines parallel to . For , due to and , we obtain
[TABLE]
Analogous considerations about along imply the claim. ∎
Remark 3**.**
If, for the eigenvalue of the dilation matrix , the set does not contain any generalized eigenvectors, then the system (25)-(26) reduces to homogeneous refinement equations , . **
The main result of this section, Theorem 3, states that if and only if the (nonhomogeneous) refinement equations in Proposition 5 corresponding to the Jordan basis of the dilation matrix have continuous solutions , . The directional derivatives , , determine the total derivative of . Moreover, , , can be constructed and their Hölder exponents can be computed as described in section 3 (see Remark 4). Thus, the higher regularity of any refinable function can be analyzed by this recursive reduction to a set of continuous refinable functions.
Theorem 3**.**
Let . There exist continuous solutions , of (25) – (26) for each eigenvalue of the dilation matrix if and only if satisfies and , .
Proof.
If is a compactly supported solution of the refinement equation , then, by Proposition 5, its directional derivatives along satisfy equations (25)-(26). Conversely, if the equations (25)-(26) possess continuous solutions, then, by Proposition 5, is in , , , and satisfies . ∎
Corollary 5**.**
Suppose that does not contain any generalized eigenvectors, i.e., the matrix has a basis of eigenvectors; then
If is refinable, then satisfy , .
Conversely, if the solutions of , , are continuous, then the solution of belongs to . Moreover, , .
Remark 4**.**
The system of refinement equations (25)-(26) is solved and analysed in the same way described in subsection 3.2. First we solve the equation . We find as an eigenvector of the matrix with the eigenvalue . If does not have this eigenvalue, then equation does not have a solution, and hence . Then we define the space as the minimal common invariant subspace of containing the vectors . This can be done by Algorithm 1 from subsection 3.2. Then if and only if the joint spectral radius of the matrices restricted to the subspace is smaller than one. The Hölder regularity of is computed by formula (15) for the matrices . Similarly, we solve the other equations of the system (26) successively for . **
5 Existence and smoothness in
In this section, see Theorem 4, we characterize the existence of refinable functions in , , and provide a formula for the Hölder exponent of such , see Theorem 5, in terms of the -radius (-norm joint spectral radius [36, 51]) of a set of transition matrices.
Definition 8**.**
For , the -radius (-norm joint spectral radius) of a finite family of linear operators is defined by
[TABLE]
Note that, for , the difference space is defined similarly to (12) by
[TABLE]
Although the estimates in Theorem 5 look similar to the ones from section 3, the corresponding proofs require totally different techniques.
The Hölder exponent of a function is defined by
[TABLE]
We use the notation . To determine the influence of the dilation matrix on the Hölder exponent of , in Theorem 5, we consider the Hölder exponents of along the subspaces determined by the Jordan basis of . The Hölder exponent of along a subspace is defined by
[TABLE]
In the proofs of Theorems 4 and 5 we use the following auxiliary results.
5.1 Auxiliary results
The following analogues of Theorems A1 and A2 from section 3 were proved in [55].
Theorem A3. Let . For a finite family of operators acting in and for any , there exists a norm in such that
[TABLE]
For and for a finite family of operators acting in , we denote
[TABLE]
Since each norm in is equivalent to the norm , Theorem A3 yields the following result.
Corollary 6**.**
Let . For every , there exists a constant such that for all and .
Theorem A4. Let and be a finite family of linear operators in . Then for every that does not belong to any common invariant linear subspace of , there exists a constant such that
[TABLE]
In Lemma 5 we relax assumptions of Theorem A4. We show that (28) holds for all points apart from the ones in a proper linear subspace of .
Lemma 5**.**
Let . Every finite family of linear operators possesses a common invariant linear subspace , , (possibly ) such that for every there exists a constant for which (28) holds.
Proof.
Without loss of generality, after a suitable normalization, it can be assumed that . Let be the biggest by inclusion common invariant subspace of such that . Note that is a proper subspace of , otherwise we get a contradiction to . Hence, . Take arbitrary and denote by the minimal common invariant subspace of that contains . If , then the -joint spectral radius of on the linear span of and is equal to , which contradicts the maximality of . Hence, . Since does not belong to any common invariant subspace of the finite family , by Theorem A4, there exists a constant such that . On the other hand, , and, hence, the claim follows. ∎
For , in the rest of this section, we denote by the largest possible constant in inequality (28), i.e.,
[TABLE]
This function is upper semi-continuous and, therefore, is measurable.
5.1.1 Properties of the space
Note that, by (11), the vector is an eigenvector of the operator associated with the eigenvalue . The following result is an analogue of Proposition 1.
Proposition 6**.**
If , , then the subspace in (27) coincides with the smallest by inclusion common invariant subspace of the matrices , and contains the vectors , where the nonzero satisfies .
The proof of Proposition 6 is similar to the one of Proposition 1. Note that, since , the column sums of the matrix are equal to one. Hence, has at least one eigenvalue one. This eigenvalue does not have to be simple. Nevertheless, Proposition 7 guarantees that is well-defined. The proof of Proposition 7 is similar to the one of Proposition 3.
Proposition 7**.**
There exists at most one eigenvector of associated to the eigenvalue such that .
5.2 -solutions of refinement equations
Theorem 4**.**
A refinable function belongs to , , if and only if .
Proof.
Assume first that . Choose and consider the norm in as in Theorem A4. Define the function space
[TABLE]
with the norm \|f\|\,=\,\bigl{(}\,\int_{G}\|v_{f}(x)\|^{p}_{\varepsilon}\,dx\,\bigr{)}^{1/p}. The space is nonempty because it at least contains a piecewise constant function such that a.e., where is the eigenvector of the operator associated with the eigenvalue one. Note that, for , we have
[TABLE]
Therefore, due to , is a contraction on , and, hence, it has a unique fixed point , which is the solution of the refinement equation .
Assume next that . By Lemma 5, there exists a proper subspace (due to , we associate with ) invariant under such that , whenever . Since is the smallest by inclusion subspace of invariant under and containing the differences for almost all , the set has a positive Lebesque measure in . Hence, the set
[TABLE]
has a positive Lebesque measure. By the Fubini theorem, the set in (30) has sections of positive Lebesque measure. Thus, there exists such that
[TABLE]
Therefore, there exist and a set of positive Lebesque measure such that the function in (29) satisfies C\bigl{(}v(x+h)-v(x)\bigr{)}>\delta for almost all . Thus,
[TABLE]
Denote , , then, by (11), we get
[TABLE]
Since , by (31), we obtain
[TABLE]
Thus,
[TABLE]
Since and goes to [math] as , we get . ∎
Remark 5**.**
The proof of Theorem 4 is much simpler than that of Theorem 1. Indeed, the argument with a contraction operator on the affine subspace cannot be directly extended to prove the continuity of due to the following reason: the piecewise constant function for which is not continuous. Thus, it is not clear how to show that is nonempty. We are not aware of any simple proof of this fact in the multivariate case. **
5.3 Hölder regularity in
To be able to determine the exact Hölder regularity of a refinable function , , we need to adjust the definitions of the transition matrices , . To do so we replace the set in Definition 2 by the set in (34), the latter contains and is determined by a certain admissible absorbing set .
Definition 9**.**
Let . A set is called absorbing if, for all , the Hölder exponent of along satisfies .
Remark 6**.**
An arbitrary set that contains some neighborhood of the origin is absorbing. It is also easy to show that any convex body (convex set with a nonempty interior) that contains the origin is absorbing.**
For the sake of simplicity, we choose to be an arbitrary simplex with one of the vertices at the origin and such that its interior intersects all the spaces . In this case is absorbing, and the sets , , are absorbing in the corresponding subspaces . We call such a simplex admissible. Note that for each , the set is also an admissible simplex.
Define to be the minimal set such that
[TABLE]
Such a set always exists, due to . Note that . In many cases , but not always, see examples 4 and 5. Thus, Using we redefine
[TABLE]
and
[TABLE]
are now of size . This leads to the appropriate modification
[TABLE]
of the finite set in (13). The modified subspaces , , , , and differ from the subspaces and , respectively, only by the lengths of their corresponding elements. We are now ready to formulate the main result of this subsection.
Theorem 5**.**
For a refinable function , ,
[TABLE]
and, consequently,
[TABLE]
Proof.
We first show that . Set . Choose an arbitrary such that , . Then the function is supported on . Hence, the vector-valued function is well defined on . Thus, for arbitrary , we have
[TABLE]
By Corollary 6, for every , there exists a constant such that
[TABLE]
Thus, we obtain
[TABLE]
where is independent of either or . Choose an arbitrary , and let be the largest integer such that . From and substituting in (37), we obtain
[TABLE]
for some constant . Combining these estimates, we obtain . Taking the limit for , we obtain the claim.
To establish the reverse inequality , we argue as in the second part of the proof of Theorem 4. We show the existence of a vector and of a subset of positive Lebesque measure (on the space ) for which inequality (33) holds (with replaced by ). Taking a limit in that inequality as and using the fact that , where independent of , we complete the proof. ∎
5.4 Examples
The following examples illustrate the need for the modifications of the set in subsection 5.3.
Example 4**.**
The solution of the univariate refinement equation
[TABLE]
is the characteristic function . The -regularity of is . In this case, and, for the standard set of dyadic digits , we have and . Hence, and we get . The common invariant subspace of and is trivial , hence, by definition, . Thus, , while . We see that .
On the other hand, for , we get
[TABLE]
The corresponding common invariant subspace is one dimensional, and . Clearly, . By Theorem 5, we obtain the correct Hölder exponent . **
The next example shows that in some cases .
Example 5**.**
The solution of the univariate refinement equation
[TABLE]
is , where is the tile in corresponding to the dilation and to the digit set . Thus, .
For the standard set of triadic digits , we have and , i.e. . In this case, . Hence, one can take the complemented set .
Remark 7**.**
It is well known that, if is an even integer, then can be efficiently computed as an eigenvalue of a certain matrix derived from the matrices in [40, 51]. Hence, Theorem 5 allows us to find the Hölder -regularity at least for even integers , in particular, for , see Example 6. **
Example 6**.**
For the refinement equation from subsection 3.6, we have and . Therefore, Theorem 5 yields . Furthermore, and . Hence, . Recall that the Hölder exponent in of is . **
Acknowledgements. The authors are grateful to N. Guglielmi and T. Mejstrik who kindly spent their valuable time to help us with computation issues.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Abry, M. Clausel, S. Jaffard, S. Roux, B. Vedel, Self-similar anisotropic texture analysis: the hyperbolic Wavelet transform contribution , IEEE Trans. Image Process, 22 (2013), 4353 - 4363.
- 2[2] N. E. Barabanov, Lyapunov indicator for discrete inclusions, I-III , Autom. Remote Control, 49 (1988), 152 - 157.
- 3[3] M. Bownik, Anisotropic Hardy spaces and wavelets , Memoirs Amer. Math. Soc. 164 (2003), no. 781.
- 4[4] C. A. Cabrelli, C. Heil, U. M. Molter, Self-similarity and multiwavelets in higher dimensions , Memoirs Amer. Math. Soc., 170 (2004), no. 807.
- 5[5] A. S. Cavaretta, W. Dahmen, C.A. Micchelli, Stationary subdivision , Memoirs Amer. Math. Soc. 93 (1991), no. 453.
- 6[6] M. Charina, Vector multivariate subdivision schemes: Comparison of spectral methods for their regularity analysis , Appl. Comp. Harm. Anal., 32 (2012), 86 - 108.
- 7[7] M. Charina, M. Donatelli, L. Romani, V. Turati, Multigrid methods: Grid transfer operators and subdivision schemes , Linear Algebra Appl., 520 (2017), 151 - 190.
- 8[8] M. Charina, M. Donatelli, L. Romani, V. Turati, Anisotropic, interpolatory subdivision and multigrid , ar Xiv:1708.03469
