System bandwidth and the existence of generalized shift-invariant frames
Hartmut F\"uhr, Jakob Lemvig

TL;DR
This paper investigates the existence of tight frames in generalized shift-invariant systems over locally compact abelian groups, introducing the concept of system bandwidth and establishing conditions for frame existence based on analytical and algebraic properties.
Contribution
It develops a new approach using unconditional convergence to study generalized shift-invariant frames, introduces system bandwidth as a key measure, and provides characterizations and conditions for frame generators.
Findings
Unconditional convergence replaces local integrability in frame analysis.
System bandwidth is introduced as a measure of a system's capacity.
Counterexamples show orthonormal bases can have arbitrarily small bandwidth.
Abstract
We consider the question whether, given a countable system of lattices in a locally compact abelian group , there exists a sequence of functions such that the resulting generalized shift-invariant system is a tight frame of . This paper develops a new approach to the study of almost periodic functions for generalized shift-invariant systems based on an \emph{unconditionally convergence property}, replacing previously used local integrability conditions. From this theory, we derive characterizing relations for tight and dual frame generators, we introduce the \emph{system bandwidth} as a measure of the total bandwidth a generalized shift-invariant system can carry, and we show that the so-called Calder\'on sum is uniformly bounded from below for generalized shift-invariant frames.…
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.
22footnotetext: 2010 Mathematics Subject Classification. Primary 42C15. Secondary: 42A6022footnotetext: Key words and phrases. Almost periodic, bandwidth, Calderón sum, frame, generalized shift-invariant system
System bandwidth and the existence of generalized shift-invariant frames
Hartmut Führ111Lehrstuhl A für Mathematik, RWTH Aachen, E-mail: [email protected]∗ and Jakob Lemvig222Technical University of Denmark, Department of Applied Mathematics and Computer Science, Matematiktorvet 303B, 2800 Kgs. Lyngby, Denmark, E-mail: [email protected]
(March 3, 2024)
Abstract
We consider the question whether, given a countable system of lattices in a locally compact abelian group , there exists a sequence of functions such that the resulting generalized shift-invariant system is a tight frame of . This paper develops a new approach to the study of almost periodic functions for generalized shift-invariant systems based on an unconditionally convergence property, replacing previously used local integrability conditions. From this theory, we derive characterizing relations for tight and dual frame generators, we introduce the system bandwidth as a measure of the total bandwidth a generalized shift-invariant system can carry, and we show that the so-called Calderón sum is uniformly bounded from below for generalized shift-invariant frames. We exhibit a condition on the lattice system for which the unconditionally convergence property is guaranteed to hold. Without the unconditionally convergence property, we show, counter intuitively, that even orthonormal bases can have arbitrary small system bandwidth. Our results show that the question of existence of frame generators for a general lattice system can be rather subtle, depending on analytical properties, such as the system bandwidth, as well as on algebraic properties of the lattice system.
1 Statement of the problem
1.1 Some terminology
Let us start by recalling some facts from harmonic analysis on locally compact abelian (LCA) groups; for a thorough introduction, we refer to [21, 9]. Throughout the paper, we let denote a second countable LCA group. It is endowed with a translation-invariant Radon measure, unique up to normalization, called the Haar measure of , and denoted by . We let denote the Hilbert space of square-integrable functions with respect to Haar measure, and the space of bounded continuous functions. We will typically write LCA groups additively, and let denote the neutral element.
A lattice, sometimes called a uniform lattice, in is a discrete subgroup with the property that the quotient is compact. Since we assume to be second countable, lattices in are necessarily countable. A generalized shift-invariant (GSI) system in is constructed by picking a family of lattices and a family of vectors , and defining the family
[TABLE]
where denotes the translation operator on . This general class of systems of vectors was introduced in [8, 20] for , and further studied, e.g., in [10, 12] for the general setting of LCA groups.
GSI systems can be seen as countable filter banks or adaptive time-frequency representations. They are interesting objects in their own right and not only as a framework to unify Gabor and wavelet analysis. We refer to [1] for an implementation and applications of GSI systems in signal processing, to [4] for a construction of dual GSI frames for , and to [18, 17] for sparseness properties of GSI frames for .
Next, some terminology relating to frames, Bessel systems, and related notions. A family of vectors contained in a Hilbert space is called a Bessel system if there exists a constant such that, for all
[TABLE]
The constant is called a Bessel bound of the system. If, in addition, there exists a lower bound such that, for all ,
[TABLE]
the system is called a frame. The constants and are called frame bounds; the optimal frame bounds, denoted and , respectively, are the largest possible value for and the smallest possible value for in the above inequalities. If , the frame is said to be tight. If , the frame is called a Parseval frame. As a particular case of frames, we mention orthonormal bases, which can be characterized as Parseval frames with normalized elements.
For a Bessel system the frame operator on is given as ; this operator is bounded and, furthermore, invertible if the lower bound (1.1) holds. Two Bessel systems and are called dual frames if
[TABLE]
in this case the two Bessel systems are automatically frames. Finally, a frame has at least one dual frame so that (1.2) holds; the canonical choice is for all .
A generalized shift-invariant frame is a generalized shift-invariant system that is a frame at the same time. From the general frame theory outlined above given a GSI frame , there exists a dual frame , i.e, for all , we have
[TABLE]
with unconditional convergence. Parseval frames are characterized by the property that one may take . However, for a non-tight GSI frame there might not exist any dual frames with GSI structure. Recall that a Riesz basis is a non-redundant frame and that Riesz bases only have one dual frame, namely, the canonical dual.
Proposition 1.1**.**
The dual basis of a GSI Riesz basis need not have GSI structure.
Proof.
We consider dyadic wavelet systems in , where and for and . We will let be a generator of an orthonormal wavelet basis . Furthermore, we assume that is a continuous, compactly supported function with a unique maximum at . Daubechies [7, p. 989] and Chui and Shi [6, Section 3] prove that the canonical dual of the dyadic wavelet Riesz basis generated by for , where is any orthonormal wavelet, does not have wavelet structure. Even more is true: it does not have GSI structure. In fact, the canonical dual basis of can be computed explicitly as
[TABLE]
where . Now, it can be seen by using the properties of that there exist dual basis vectors that are not translates of any other dual basis vector. Indeed, , , is compactly supported. On the other hand, , , has a unique maximum at , but these functions are not compactly supported. Every GSI system containing these functions must contain elements that are not compactly supported, but have a unique maximum at a point different from zero, whereas the dual basis contains no such function. ∎
Due to Proposition 1.1, we introduce the notion of a dual generalized shift-invariant system consisting of a system of lattices, and two families such that the generalized shift-invariant systems fulfill the following: and are Bessel sequences, and
[TABLE]
holds for all .
1.2 Aims of this paper
The starting point of this paper is a system of lattices in . We want to find sufficient and/or necessary criteria on for the existence of an associated system of vectors such that the generalized shift-invariant system arising from these data is a (tight) frame. We then call the system (tight) frame generators for . In the case of existence of dual frames, we call the systems and dual frame generators. The associated lower and upper frame bounds shall be denoted by , etc.
Stated in such general terms, the problem of deciding the existence of frame generators seems somewhat impenetrable at first. We will not be able to fully solve the existence problem for generating systems, but we will derive results and construct examples showing that this question is remarkably subtle, involving both analytic and algebraic aspects.
An analytic condition that we shall investigate has to do with bandwidth. To motivate this notion, it is useful to recall the Shannon Sampling Theorem. Pick an interval , and define the closed subspace , where denotes the characteristic function on . Then, letting , where denotes the inverse Fourier transform, we find that the system is an orthonormal basis of . The length is commonly called the bandwidth of the space . We now revert this view. Starting from a lattice , we pick an interval of length , and a generator such that is an orthonormal basis of the Paley-Wiener space . Now, given a system of lattices , one possible strategy for the construction of compatible tight frame (in fact, orthonormal basis) generators would be to cover the real line (the frequency domain) disjointly by intervals of length , and pick orthonormal basis generators for each . The question remains, however, whether the combined intervals suffice to cover the full real axis, i.e., whether the system bandwidth, defined by , is infinite. These considerations motivate the following definition.
Definition 1.2**.**
Let be a system of lattices in . Then the quantity, where is the Haar measure of a fundamental domain of in ,
[TABLE]
is called the bandwidth of ,
Now the above discussion suggests to study the relationship of the existence of tight frame generators to the condition that . We shall exhibit situations in which the bandwidth criterion is quite sharp, and other somewhat pathological cases, in which bandwidth is an irrelevant quantity. Hence a general characterization of lattice system admitting dual frame generators will have to involve both analytical, quantitative criteria (such as bandwidth), as well as algebraic ones.
The main results of this paper can be summarized as follows. We first introduce the approach to the analysis of GSI systems via almost periodic functions, established for wavelet systems by Laugesen in works [13, 14], and then further generalized to the GSI setting in [8]. We add a new result to this general approach that allows to derive characterizing relations for dual frame generators under suitable, rather mild, unconditional convergence conditions (Theorem 3.11), and show, in Example 1, that it properly generalizes the known characterizing results for GSI frames [10, 12, 8]. Our mild convergence conditions replace previously used local integrability conditions. Under this convergence property we prove that the so-called Calderón sum for GSI frames is bounded from below by the lower frame bound (Theorem 3.13) which provides a necessary condition on for the frame property, but which is also of independent interest. It is also under the unconditional convergence property, we prove that is necessary for the existence of tight frame generators (Theorem 3.14). We then present a general existence result for frames assuming the existence of a suitable dual covering (Theorem 3.16).
In absence of the unconditional convergence property we construct tight GSI frames with arbitrarily small bandwidth (Theorem 4.1). Using the notion of independent lattices, we then exhibit a rather general class of lattice families for which the unconditional convergence property has an easy characterization and for which the characterizing relations from Theorem 3.11 are rather restrictive (Theorem 5.3). Further illustrations of various interesting features of the problem studied in this paper can be found in Examples 2, 4 and 5.
Remark 1*.*
In our considerations, taking some to be the zero function is expressly allowed, unless we want to construct orthonormal bases. Hence, whenever the existence of Bessel, frame, or dual frame generators is shown for a subfamily of a family of lattices, it holds for itself. Thus one should be aware that the following sufficient conditions only need to be fulfilled by a suitable subfamily of the original lattice family. The LCA group being second countable implies that is separable, and thus all (discrete) frames in this space are countable. Hence, we will concentrate on countable lattice families .
2 Notation for LCA groups
As stated above, will always denote a second countable, locally compact abelian group, its Haar measure will be denoted by .
A fundamental domain, also known as a Borel section, associated to a lattice is a Borel set such that the -translates tile up to sets of measure zero; such sets always exist. A more rigorous formulation of this is as follows: Let denote the indicator function of . Then is a fundamental domain for if
[TABLE]
It is an easy exercise, using translation invariance of Haar measure, to prove that for any two fundamental domains of the same lattice , one has . The covolume of in is then defined as . Fundamental domains can always be chosen to be pre-compact.
For , all lattices are given by , where can be any invertible matrix. Since the cube is a fundamental domain for , it is immediate that is a fundamental domain for , and one obtains .
We let denote the character group of , i.e., the group of all continuous homomorphisms . The duality between and is denoted by ; confusion of this notation with inner products in will be cleared up by the context. The Fourier transform of a function is then given by ,
[TABLE]
This defines a bounded operator , . The Plancherel theorem states that, after proper normalization of the Haar measure on , the operator extends uniquely to a unitary operator from onto which we will also denote by .
Given a lattice , its dual lattice (or annihilator) is given by
[TABLE]
By duality theory, is a lattice as well. In fact, if one normalizes the Haar measure on in such a way that the Plancherel theorem holds, then the covolumes of and are related by
[TABLE]
In the case and for some invertible matrix , the dual lattice is computed as , with denoting the inverse transpose of .
To summarize, we let a Haar measure on be given. We assume dual measures so that Plancherel theorem holds, and we assume the counting measure on discrete subgroups and choose the Haar measure on as the quotient measure so that Weil’s integral formula holds. Using this quotient measure on , we can express the covolume as . The quantity is sometimes called the density of the subgroup, while is called the lattice size.
3 Almost periodic functions and GSI systems in
3.1 Fourier analysis of GSI systems
In order to understand the role of almost periodic functions, let us fix a dual GSI system given by the lattice system and the associated functions and . We fix a closed set of measure zero, and define
[TABLE]
This is a translation-invariant and dense subspace of , and since the frame operator is bounded precisely when the associated system is a Bessel system, the Bessel property and further frame theoretical properties of the system only need to be checked on . Here denotes the blind spot of the system [10]; the specific choice of depends on the application.
For , we define the functions for by
[TABLE]
For each , the series in (3.2) converge pointwise to a continuous limit function as is seen by the following result. The result is a dual version of [12, Lemma 3.4] which is an adaptation of [8, Lemma 2.2].
Lemma 3.1**.**
Fix and . Let be a lattice in and . Then is a trigonometric polynomial. More precisely,
[TABLE]
where
[TABLE]
In particular, for all but finitely many .
We define the function on as
[TABLE]
provided that the series converge. In the case , for all , we write and . Without any further assumption on the lattice system and the generators, we can only say that the series converges in , hence is well-defined, while might not be.
However, under the Bessel property, the partial sums converge pointwise absolutely and uniformly on compact sets, and the limit functions are continuous and bounded. To prove these properties, we need the following well-known result.
Lemma 3.2**.**
If , generates a Bessel system in , then
[TABLE]
The sum is called the Calderón sum of the GSI system in accordance with wavelet analysis. For a proof of Lemma 3.2 in we refer to [8, Proposition 4.1], and for a proof in we refer to [10, 12].
Lemma 3.3**.**
Fix . Let denote a system of lattices, and , associated function systems of Bessel generators. Then is uniformly continuous. Moreover, the right-hand side of
[TABLE]
converges uniformly and unconditionally on compact sets.
Proof.
To begin with, note that the Bessel assumption on the generators guarantees that the sum defining converges pointwise absolutely. We next prove uniform continuity of the limit. Given , we compute
[TABLE]
using the Bessel constants and that the regular representation is a homomorphism. Since this representation is strongly continuous, for any there exists a neighborhood of the identity element such that whenever . This shows uniform continuity of .
It remains to show uniform and unconditional convergence on compact sets. We first consider the case . Here the terms on the right-hand side are positive, continuous functions, whose partial sums are bounded by the Bessel constant of the system generated by the . We already showed that the limit function is continuous, as well, and since the group is metrizable [9], we may apply Dini’s theorem to conclude that the sum converges uniformly on compact sets.
For the general case, fix and a compact set . Fix a finite set with the property that, for all , it holds for all .
The Cauchy-Schwartz inequality yields, for all , that
[TABLE]
It follows, by a second application of the Cauchy-Schwarz inequality, that
[TABLE]
whenever . This proves uniform and unconditional convergence on compact sets. ∎
3.2 Almost periodic functions and the unconditionally
convergence property
The significance of almost periodic functions for GSI systems comes from the fact that the function is a sum of trigonometric polynomials. As soon as this sum converges uniformly, is an almost periodic function, and this fact allows to invoke results from the Fourier analysis of such functions, which we now recall. Our main sources for this subsection are [9, Chapter 18] and [19].
Definition 3.4**.**
A function is called almost periodic if the set is relatively compact with respect to the uniform norm. The space of all almost periodic functions on is denoted by .
As elucidated in [19], almost periodic functions are best understood in connection with the Bohr compactification of the group . This group is constructed by taking the dual group of , where the latter is endowed with the discrete topology. By construction, is a compact LCA group, and the duality between and gives rise to a canonical embedding , an injective, continuous group homomorphism with dense image. Throughout the following, we will identify with its image under , i.e., with a subgroup of . If is noncompact, this image is a proper subset (being noncompact), measurable (being -compact), and therefore of measure zero: Any measurable subgroup of positive measure contains a neighborhood of the neutral element, and is therefore open.
We now have the following characterizations of almost periodic functions. Note that by definition, a trigonometric polynomial is a linear combination of characters.
Theorem 3.5**.**
Let . Then the following are equivalent:
- (a)
. 2. (b)
* is the uniform limit of trigonometric polynomials.* 3. (c)
* has a (necessarily unique) continuous extension .*
We will call the function from part (c) the Bohr extension of . Part (c) opens the door to the Fourier analysis of almost periodic functions (and therefore for a proof of (b)), by making Fourier expansions of available for the analysis of . Since is compact, every continuous function on is the continuous limit of trigonometric polynomials. But and share the same dual (only the induced topologies are different), hence this approximation result translates to functions in . In order to compute the Fourier coefficients of , we need to integrate over , or better, devise an integration process on that allows to compute these integrals without explicitly passing to the extension . This is where the mean on comes into play, which is described in the following result, which summarizes Theorems 18.8-18.10 from [9].
Theorem 3.6**.**
Let denote a second countable LCA group.
- (a)
There exists a sequence of open, relative compact subsets with and such that, for all ,
[TABLE] 2. (b)
Let be a sequence of subsets as in part (a). For any , the expression
[TABLE]
is well-defined and finite. Furthermore, if denotes the Bohr extension of , then
[TABLE] 3. (c)
As a consequence of (b), is independent of the choice of .
The quantity , as defined in Theorem 3.6, denotes the mean of . Given any , we can then define the Fourier coefficient of as
[TABLE]
Using the facts that the map is injective, and that the duals of and coincide, standard facts of Fourier analysis on give rise to the following important theorem.
Theorem 3.7**.**
Let . We then have:
- (a)
Fourier uniqueness*: if and only if , for all .* 2. (b)
Plancherel Theorem*: . In particular, only countably many Fourier coefficients are nonzero.*
We remark that under the inner product for is a pre-Hilbert space; its completion is called the Besicovitch space , for which is an orthonormal basis. The completion with respect to the norm gives rise to the Besicovitch space .
With these definitions in place, we can now introduce a technical condition that will be of central importance to the following.
Definition 3.8**.**
Let denote a system of lattices, and let and denote generating systems in .
- (a)
The GSI systems and (or, for short, simply and ) have the dual -unconditional convergence property (dual -UCP) if, for all , and
[TABLE]
unconditionally with respect to , i.e., for every there exists a finite set such that for all finite set ,
[TABLE] 2. (b)
The systems and have the dual -UCP if (3.4) holds with uniform convergence. 3. (c)
If holds, for all , we say that the system fulfills -UCP, for .
Note that the Hölder inequality implies , whenever . In particular, -UCP is the stronger condition.
Remark 2*.*
The -UCP condition can be rephrased as requiring that
[TABLE]
with convergence in , where we again used the subscript to denote the (continuous) Bohr extension. This is one of the reasons why the condition is included in the definition of -UCP. Clearly, checking this part can present a nontrivial obstacle. Note however that in the case , uniform convergence already implies . Also, note that for the derivation of necessary conditions for dual systems, one departs from the assumption that , which is clearly in .
Remark 3*.*
As for local integrability conditions, the -UCP depends on the blind spot set , which is a closed set of measure zero. Since for any blind spot set , see (3.1), it follows that if -UCP holds for , it holds for any . However, we usually only need the -UCP to hold for some blind spot set .
The Bessel generator assumption and the -UCP can be seen as regularity assumptions on , e.g., both assumptions separately guarantee that is continuous. The two assumptions are in general unrelated. Bessel generators do not imply -UCP and the -UCP does not imply Bessel generators. However, the following result shows that the analysis windows and synthesis windows can be separated in the verification of the dual -UCP condition, when combined with a Bessel assumption.
Lemma 3.9**.**
Assume that we are given lattices , and generating systems and .
- (a)
Suppose that fulfills -UCP, and that is a system of Bessel generators. Then and fulfill the dual -UCP. The same result holds with assumptions on and interchanged.
- (b)
Suppose that fulfills -UCP, and that is a system of Bessel generators such that . Then , fulfill the dual -UCP. The same result holds with assumptions on and interchanged.
Proof.
Note that, for any finite set , and any ,
[TABLE]
Now assuming that fulfills -UCP, yields the desired conclusions about the dual system ; in particular uniform convergence of the series yields . Since , the second statement of (a) follows. In the case of -UCP, Hölder’s inequality implies
[TABLE]
hence part (b) follows in the same way as part (a). ∎
Proposition 3.10**.**
Assume that we are given lattices , and generating systems and that fulfill the dual -UCP. Then, for all and all , we have
[TABLE]
with absolute convergence. Hence, the generalized Fourier coefficients of are given by
[TABLE]
Proof.
Recall that -UCP entails -convergence of the Bohr extensions, and that the Fourier coefficients of any function in coincide with the coefficients of its Bohr extension. Since Fourier coefficients are continuous linear functionals with respect to the -norms, equation (3.5) follows. The last statement of the theorem is just a reformulation of (3.5) using Lemma 3.1. ∎
Remark 4*.*
Under the dual -UCP assumption in Proposition 3.10 in place for the dual -UCP, the conclusions of Proposition 3.10 still hold true, in particular, that is a continuous and almost periodic function that agrees pointwise with its generalized Fourier series.
The importance of the function and its generalized Fourier series in Proposition 3.10 is that it encodes frame theoretical properties of GSI systems. E.g., under the UCP assumption, a GSI system is a frame with optimal bounds and if and only if
[TABLE]
and
[TABLE]
Fourier analysis of was recently employed in (3.7) and (3.8) to obtain new sufficiently conditions for the frame property of GSI systems [16]. Moreover, whenever the mixed frame operator on of and is well-defined, but not necessarily bounded, the discussions in the next section yield the representation, under appropriate convergence assumptions,
[TABLE]
where denotes the multiplication operator by .
3.3 Characterizing equations for dual and tight GSI frames
The following theorem exploits the fact that convergence of the sum
[TABLE]
in the proper sense results in expressions for the Fourier coefficients
[TABLE]
Theorem 3.11**.**
Suppose that and are Bessel families fulfilling the dual -UCP. Then the following are equivalent:
- (i)
and are dual frames for , 2. (ii)
for each we have
[TABLE]
with absolute convergence.
Proof.
(i) (3.10): Fix . The dual frame assumption yields , which entails by Fourier uniqueness that, for all ,
[TABLE]
with unconditional convergence, where we have used Proposition 3.10.
For the derivation of (3.10) from this fact, we adopt the strategy used in the proof of [10, Theorem 3.4]. Fix , and define
[TABLE]
Note that the right-hand side actually converges absolutely by the following chain of inequalities:
[TABLE]
where the last inequality is due to Lemma 3.2, and and are the Bessel constants associated to and , respectively. This shows also that
[TABLE]
Hence the multiplication operator , is well-defined and bounded. For all we have the relation
[TABLE]
and since is dense, this implies
[TABLE]
which in turn yields (3.10).
[TABLE]
for all , with the last equation provided by the assumption on the . Hence, by Proposition 3.10, the Fourier coefficients of coincide with the Fourier coefficients of the constant function. Hence the Bohr extension of is constant, and consequently, so is . ∎
Remark 5*.*
Theorem 3.11 is indeed a generalization of [10, Theorem 3.4]. The cited result is established under the assumption that the so-called dual -local integrability condition (dual -LIC) holds. This condition involves the coefficients associated to each via
[TABLE]
A comparison with the definition of shows that is obtained by taking the absolute value of the integrand in the definition of , in particular,
[TABLE]
Now the dual -LIC amounts to the requirement that for every . Since characters are bounded, the -LIC implies in fact that
[TABLE]
with the right hand side converging unconditionally and uniformly. Thus dual -UCP is guaranteed, and we may apply Theorem 3.11 to recover [10, Theorem 3.4].
Note also that this argument goes through under the assumption that . This condition could be strictly weaker than the dual -LIC because of possible cancellations inside the integrals defining the that could entail . However, we are not aware of examples where this observation pays off. Finally, we remark that the classical LIC [8, 12] amounts to the requirement that for every , where
[TABLE]
which implies the -LIC and therefore also the -UCP.
In the case of tight frames, the Bessel assumption in Theorem 3.11 is not necessary.
Theorem 3.12**.**
Suppose that fulfills the -UCP. Then the following are equivalent:
- (i)
* is a Parseval frames for ,* 2. (ii)
for each we have
[TABLE]
Proof.
We claim that if either (i) or (3.12) holds, the convergence in (3.12) is absolute. The proof of this claim for (i) is clear from the chain of inequalities (3.11) with , , since is a Bessel system by assumption. On the other hand, if (3.12) holds, then for , we have . By computations as in (3.11), this proves the claim.
The rest of the proof follows the proof of Theorem 3.11. ∎
The following example was discovered by Bownik and Rzeszotnik [3] to show that the Calderón sum for Parseval GSI frames is not necessarily equal to one. The example was also the first construction to show that the -equations (3.12) do not characterize Parseval GSI frames without some regularity assumption on and , e.g., the LIC. In the context of this paper, the example serves as an illustration that -UCP allows finer distinctions than LIC. It is constructed in , but can be easily transferred to .
Example 1**.**
Let and, for each , write as a disjoint union:
[TABLE]
where and , , are chosen inductively as the smallest in absolute value satisfying
[TABLE]
It case and both are minimizers, we pick to be positive.
For , let and , where denotes the sequence with and for . The GSI system is an orthonormal basis for since it is a reordering of the canonical orthonormal basis . Bownik and Rzeszotnik [3] show that and that the GSI systems do not satisfy the LIC. For this shows that the local integrability condition of [8, Theorem 2.1] cannot be removed. Kutyniok and Labate [12] used the example with to show that Parseval frames need not satisfy the LIC.
In [10] it was noted that the characterizing equations (3.12) are satisfied for ; to be precise, the example in [10] is slightly different from the present one, but the verification of the characterizing equations for our example is very similar, hence we leave out the details. Since GSI systems can satisfy the characterizing equations, but not the local integrability conditions nor the weaker -LIC, it leaves room for an improvement of the results in both [8] and [10]. Hence, none of the known results on characterizing -equations can be applied for the case . However, we will now show that Theorem 3.11 indeed can capture this phenomenon: For the 1-UCP holds, while it fails for . This is the desired conclusion as only the case satisfies the characterizing equations.
A first indication of the striking difference between and comes from the growth rate of . For we find by induction that , while grows linearly as for .
Let be given. Since is an orthonormal basis, we have that for . For simplicity, assume is normalized, that is, and . For each ,
[TABLE]
where . Hence, is the value of the squared norm of the orthogonal projection of onto .
We first prove that -UCP is not satisfied for any choice of . For this purpose, let be any finite subset. Let be such that ; note that exists by construction of the . It then follows that , or
[TABLE]
and thus . Hence, -UCP does not hold for . Note that allowing a general blind spot set , i.e., a closed subset of of measure zero, does not change this conclusion as is a non-trivial, translation-invariant subspace of .
Let us next consider -UCP. Note that which is indeed almost periodic. We first compute the mean of . Note that is -periodic, and that the mean of a periodic function is just the average over one period. Hence we get
[TABLE]
Using linearity of the mean, we get for any finite set
[TABLE]
In particular, for convergence of the geometric series yields
[TABLE]
unconditionally, and thus -UCP holds. For , however,
[TABLE]
shows that -UCP is violated.
3.4 Necessary conditions for the frame property
From the characterizing equations in Theorem 3.11 we can derive a necessary condition for the frame property of a GSI system in terms of the Calderón sum. The condition can be seen as a quantitative version of the fact that the Fourier supports of the generators need to cover .
Theorem 3.13**.**
Suppose that is a frame for satisfying the -UCP. Then
[TABLE]
Proof.
Let . By assumption, , and its mean is equal to the constant term of its Fourier series by Definition 3.8, that is,
[TABLE]
where we have used (3.5).
The frame inequality implies that for all . Since a.e., it follows that
[TABLE]
Hence, we arrive at
[TABLE]
This, in turn, implies that for a.e. . To see this, assume towards a contradiction that for , where is of positive measure. Let . Then , which contradicts (3.15). ∎
Remark 6*.*
Note that Theorem 3.13 is a generalization of results in [4, 6]. The argument in the proof of Theorem 3.13 can also be used to prove an upper bound, but this bound holds without any LIC/UCP assumptions by Lemma 3.2. We refer to Section 6 for applications to wavelet systems and generalizations of Theorem 3.13.
The following theorem substantiates the intuition on the role of bandwidth for the existence of generators. It proves that infinite bandwidth is necessary for the existence of frame generators in non-discrete spaces.
Theorem 3.14**.**
Suppose that is a frame for which satisfies the -UCP. Then
[TABLE]
In particular, if is non-discrete, then .
Proof.
By integrating the lower bound in (3.14) over , we obtain
[TABLE]
From frame theory we know that a countable Bessel family with Bessel bound in a Hilbert space satisfies the norm bound for all . In our settings, using isometry of translations and the Plancherel theorem, this fact yields which, combined with (3.16), proves the sought inequality. Finally, if is non-discrete, the dual group is non-compact, hence is infinite. ∎
The following result notes a further basic fact: Lattice systems that generate a frame must be infinite, if is non-discrete.
Corollary 3.15**.**
Assume that is non-discrete. Let denote a finite system of lattices. Then, for every system of generators , the associated GSI system does not possess a lower frame bound.
Proof.
Since is non-discrete, is non-compact, and therefore has infinite Haar measure. A GSI system with a finite system of lattices, i.e., , obviously satisfies -UCP and therefore -UCP. Let . Then . The system cannot be a frame by Theorem 3.14. ∎
We end this subsection by remarking that, for discrete LCA groups , the above discussions yield the following additional necessary condition for the Bessel property:
[TABLE]
3.5 Sufficient conditions for the frame property
The next theorem builds on the intuition that motivated the introduction of our notion of bandwidth. Note in particular that the conditions of the theorem can only be fulfilled if : Condition (i) implies that must be contained in a fundamental domain modulo , and then (ii) implies that can be covered by fundamental domains mod , as runs through . The latter can only hold if the measures of these domains at least sum up .
Theorem 3.16**.**
Let denote a family of lattices. Assume that there exist Borel sets , for , fulfilling the following two properties:
- (i)
* for all and for all ,* 2. (ii)
.
Then there exists a family such that the associated GSI system is a Parseval frame. In addition, the system can be chosen to fulfill the relations
[TABLE]
and
[TABLE]
If, in addition to (i) and (ii), the sets fulfill , for , as well as , there exist orthonormal basis generators with these properties.
Proof.
Without loss of generality, we can assume either or . For each , pick a fundamental domain of which satisfies mod , and define the function by . Then is an orthonormal basis of the closed subspace
[TABLE]
by Kluvanek’s Theorem [11]. Next define, for ,
[TABLE]
Then is a disjoint covering of , and if we define
[TABLE]
we obtain . Furthermore, for any given , the function , defined by is the projection of into . Since this projection commutes with translations, one gets that the associated shift-invariant system is the image of an orthonormal basis under the projection onto the subspace , and thus a Parseval frame of that subspace. Finally, taking the union over Parseval frames of an orthogonal sequence of subspaces spanning the whole space yields a Parseval frame of the latter.
In the case where the fulfill , for and , it follows that and only differ by a set of measure zero, and the system is an orthonormal basis of . Hence the full system is an orthonormal basis of . ∎
If the underlying group is , we can now formulate the following characterization of existence of frame generators.
Corollary 3.17**.**
Suppose that is a family of lattices in . Then the following are equivalent:
- (i)
There exists a system of frame generators satisfying the LIC-condition. 2. (ii)
There exists a system of frame generators satisfying the -UCP condition. 3. (iii)
.
Proof.
The implication (i) (ii) is clear by Remark 5. Implication (ii) (iii) is provided by Theorem 3.14. Finally, if , we use Theorem 3.16 to construct generators for . Given any , we use (3.17) and the construction of the to verify LIC via
[TABLE]
∎
We remark that the equivalences in Corollary 3.17 are false without the LIC/UCP assumption. This follows from Theorem 4.1, proved in Section 4.
The next result describes classes of lattice systems in for which the intuition from the one-dimensional case remains valid. Example 3 in Section 5 shows that the assumption on the singular values cannot be dropped.
Proposition 3.18**.**
Assume that the system of lattices in has the property that for all , the quotient of maximal singular value of , divided by the minimal singular value, is bounded by a constant. Then implies the existence of a family of tight frame generators.
Proof.
Fix , and let and denote the minimal and maximal singular value of , respectively. By the assumption on the family, we have
[TABLE]
for fixed. We let denote the singular value decomposition, where and are orthogonal, and diagonal with diagonal entries ranging between and . To simplify notation, we suppress the dependence of in the singular values. Denoting by the open ball around zero with respect to the euclidean norm, we have the inclusions
[TABLE]
This gives the following chain of inclusions
[TABLE]
On the other hand, we have , and thus, since , we get
[TABLE]
Combining these inclusions yields
[TABLE]
Furthermore, recalling the dependence of , we have
[TABLE]
via (3.19), and thus the infinite bandwidth assumption yields
[TABLE]
To summarize, we have that the fundamental domains modulo contain cubes of infinite combined volume. Now the elementary, but somewhat technical following Lemma 3.19 shows the desired covering property. ∎
Lemma 3.19**.**
Let , , denote a sequence of cubes in , with . Then there exist vectors such that .
Proof.
For the following argument, it is helpful to recall the notion of a dyadic cube. By this we mean a subset , with and . What we need in the following is that each dyadic cube decomposes into disjoint dyadic cubes of smaller size.
We first show the simpler statement that there exist ( such that
[TABLE]
To see this, we first observe that we may assume that : If denotes the largest power of that is less than or equal to , then we have as well, and any covering by the smaller cubes solves the problem, as well.
Secondly, note that the problem is easy to solve if the do not converge to zero. In that case, there is either an unbounded subsequence (in which case a single cube from the system can cover the unit cube), or there exist infinitely many cubes of the same size, which then can be used to cover the unit cube.
Hence, possibly after reindexing the sequence, we are left with the case where is a decreasing sequence of powers of , converging to zero. Here we can inductively pick , with the property that for all satisfying
[TABLE]
we have
[TABLE]
To see this, we pick . Assuming that are determined, and (3.20) holds for , we note that by the inductive assumption, is the complement of a union of dyadic cubes in , with side-lengths greater than or equal to , which in turn is greater than or equal to . In particular, if this complement is nonempty, it is the union of dyadic cubes of side-length . Hence there exists , with , with the desired property.
Since the volumes of the cubes add up to infinity, the condition (3.20) can only hold for finitely many . Hence we have , for sufficiently large .
In order to cover all of by shifted cubes, we reindex the sequence into a double sequence with the property that, for all , . Numbering the cubes of the type , with , as , the first step of the proof shows that we can cover using the cubes with side-lengths . Hence we have achieved the desired covering of using the full family of cubes. ∎
4 Finite system bandwidth
By the intuition outlined in the introduction, and substantiated in Theorem 3.14, large bandwidth is necessary for the existence of tight frame generators. On non-discrete groups even infinite bandwidth is necessary. Note however that these conclusions required additional assumptions, in the form of LIC or UCP. We will see that without these assumptions, the bandwidth intuition fails. Surprisingly, we will even see that can be arbitrarily small, while still preserving the frame property; actually, even orthonormal bases can have arbitrarily small system bandwidth.
Theorem 4.1**.**
Assume that there exists a sequence of strictly decreasing lattices in . Then, given any , there exists a system of lattices in with , and a system of functions such that the associated GSI system is an orthonormal basis.
The remainder of this section will prove the construction. The following results exploit an idea introduced by Bownik and Rzeszotnik in [3], namely that it is possible to index the same family of vectors as GSI system over different lattice families. While this relabeling does not affect any pertinent property of the associated frame operator(s), it may influence other properties of the system, most notably its bandwidth.
Definition 4.2**.**
Let and denote lattice systems. We say that is a refinement of if there exists a partition of and vectors with the property
[TABLE]
We then have the following obvious fact.
Lemma 4.3**.**
Let be a system of lattices, and a refinement of . Given a system of functions , and define
[TABLE]
Then the GSI system is obtained by reindexing the GSI system . In particular, it is a Bessel system, a tight/Parseval frame, or an orthonormal basis if and only if the original system has the same properties. This observation extends to dual systems.
Remark 7*.*
Note that whenever one has
[TABLE]
with finitely many lattices , , then
[TABLE]
Hence, if is a refinement of , then one has that
[TABLE]
The whole point of introducing refinements to our discussion is the fact that this inequality can be proper. It is also worth noting that whenever the index sets occurring in a refinement are all finite, the bandwidth does not change.
We next show that refinements can be constructed from chains of subgroups. Note that Lemma 4.4 is valid also for non-abelian groups, but we only formulate it for the setting we need.
Lemma 4.4**.**
Let denote a countable abelian group, and let denote a sequence of proper subgroups with finite index, and for all . Then there exists a sequence such that
[TABLE]
Proof.
Let denote an enumeration of . We choose the inductively, with . Then is nonempty.
Assume that after steps, we have found such that
[TABLE]
is nonempty. Since for all , is a union of -cosets. Now pick minimal with , and let . Then , because , and thus , for all . Finally, the fact that implies that
[TABLE]
is a nonempty union of -cosets.
Thus the inductive procedure can be continued to yield a sequence with for . In addition, the choice of in the induction step allows to prove inductively that , for all . Hence the sequence has all the desired properties. ∎
Proof of Theorem 4.1.
First consider a constant lattice system . If is any fundamental domain modulo , then its translates , with are a disjoint covering of , and Theorem 3.16 provides the existence of a family of orthonormal basis generators for .
We will now construct a refinement of with finite bandwidth, as follows: Let , and fix a bijection with the property that, for every , the sequence is strictly increasing. Given , let . By choice of , we have for all , that
[TABLE]
Hence Lemma 4.4 implies that is a refinement of , and since is bijective, the refined system has bandwidth
[TABLE]
Now for every , the inclusion yields . Since the inclusions are strict, all subgroup indices are at least , which leads to , and we finally arrive at
[TABLE]
Hence, there exist GSI orthonormal bases with bandwidth .
Now, starting from the constant lattice system in the above construction, we obtain orthonormal bases with bandwidth less than or equal to . ∎
Lemma 4.3 showed that a system of frame, Bessel, or dual frame generators for a system can be used to provide a system of generators for , whenever is a refinement of . The converse is generally not true as the following example shows.
Example 2**.**
The system is a refinement of the single lattice system . By Theorem 4.1, there exist orthonormal basis generators in for , but by Corollary 3.15, has no frame generators.
5 Independent lattices and UCP
The aim of this section is to exhibit a general setup for which -UCP holds as soon as is bounded. Furthermore, we argue that this setup is the generic case of GSI systems and that it leads to rather stringent condition on the frame generators.
Definition 5.1**.**
A lattice system is called independent if for all families with finite and , we have the implication
[TABLE]
We call the system pairwise independent if , whenever .
We will be interested in lattice families whose dual lattices are independent. The following lemma characterizes this condition in terms of a density property.
Lemma 5.2**.**
Let denote a family of lattices in . Then the following are equivalent:
- (i)
The dual lattices are independent. 2. (ii)
For all finite subsets , the subgroup
[TABLE]
is dense with respect to the product topology. 3. (iii)
The subgroup
[TABLE]
is dense with respect to the product topology.
Proof.
For the proof of , consider the continuous group homomorphism , defined by . Let
[TABLE]
denote the dual homomorphism, defined by
[TABLE]
We may identify with , using the duality
[TABLE]
With this identification, we obtain
[TABLE]
leading to
[TABLE]
Now (i) is equivalent to injectivity of , for all choices of finite , whereas (ii) is equivalent to the fact that has dense image. But the statements about the homomorphisms are equivalent by duality theory: If has dense image, then two continuous functions (for example, characters) coinciding on must coincide everywhere, which shows (ii) (i). And if the image of is not dense, there exists a nontrivial character on the quotient , which gives rise to a character on that coincides on with the trivial character, showing that is not injective, and thus (ii) (i).
Finally, the equivalence (ii) (iii) is a standard fact about product topologies. ∎
Remark 8*.*
For and , independence of the dual lattices is equivalent to linear independence of over the rationals. We note that this is not the same as linear independence of over the rationals. E.g., if is transcendental, then the family given by , , is linearly dependent over the rationals, but is not.
While the condition of rational independence may seem strong, one can argue that in a sense, it is the generic case: If one chooses the lattice generators randomly, with independent Lebesgue-absolute continuous probability densities for each , then the system will be rationally independent with probability one.
If and , then the dual lattices are independent if and only if the are pairwise prime. This can be seen by Lemma 5.2 and the Chinese Remainder Theorem, stating that
[TABLE]
is onto if and only if the are pairwise prime.
The following theorem shows the scope of the -UCP condition.
Theorem 5.3**.**
Let denote a system of lattices, and let .
- (i)
Suppose that the dual lattices are independent. Let . Then if and only if converges uniformly. In particular, every Bessel family fulfills the -UCP with respect to any closed set of measure zero. 2. (ii)
Suppose that the dual lattices are pairwise independent. Then two families and of Bessel generators satisfying the -UCP are dual frame generators if and only if
[TABLE]
and
[TABLE]
for almost all .
Proof.
Fix . If -UCP holds, then . To finish the proof of (i), we need to show that
[TABLE]
converges uniformly. In fact, we will show that
[TABLE]
For this purpose, fix and a finite, nonempty set . Each induces a continuous function on the compact group , hence there exists an open set such that
[TABLE]
By the independence assumption on the dual lattices and Lemma 5.2, there exists . Since all are positive, and their sum is pointwise bounded by the , we get
[TABLE]
Since and were chosen arbitrary, (5.2) is shown, and thus part (i).
For the remainder of the proof, it is enough to observe that the characterizing equations from Theorem 3.11, which are applicable by the -UCP assumption, simplify to the form given in (ii), when the dual lattices are pairwise independent. ∎
The point of the following result is that if a family of lattices has pairwise independent dual lattices, and there exist dual frame generators , then the somewhat simple-minded procedure from Theorem 3.16 will also provide such generators.
Corollary 5.4**.**
Assume that is a family of lattices with pairwise independent dual lattices. If there exist dual frame generators satisfying the -UCP, then there exist Borel sets satisfying
- (i)
, for all and for all , 2. (ii)
.
Proof.
This follows from the characterizing equations in Theorem 5.3(ii), if we let
[TABLE]
for each ∎
If one restricts further to orthonormal basis generators, the characterizing equations become even more stringent.
Corollary 5.5**.**
Let denote a system of lattices whose dual lattices are pairwise independent. Let an associated system of orthonormal basis generators fulfilling -UCP. Then
[TABLE]
where is a measurable fundamental domain mod , and, up to sets of measure zero,
[TABLE]
Proof.
Let . Then Theorem 5.3(ii) implies that, up to a set of measure zero, the set is contained in a fundamental domain modulo . Now the fact that the -shifts of are an orthonormal system forces to have measure , and that , with . Thus the -shifts of are an orthonormal basis of
[TABLE]
The assumption that the full system is orthonormal therefore forces the to be pairwise orthogonal, and thus the to be essentially disjoint. Finally, it is clear that completeness of the system forces up to sets of measure zero. ∎
As a further application of Theorem 5.3, we now construct an example of a lattice family in dimension two with infinite bandwidth, but without dual frame generators.
Example 3**.**
Fix a transcendental number , and let , where
[TABLE]
Hence , but there do not exist families of dual generators for this system. To see this, assume otherwise. Note that by choice of , the dual lattices are independent, hence Theorem 5.3(i) implies that the dual generators fulfill -UCP. Hence Corollary 5.4 applies and yields Borel sets with and for all and all , where denotes the Lebesgue measure on .
Without loss of generality, we may assume that , for all and . Define, for and , the Borel set
[TABLE]
Assume that there exists such that . Then there exists such that and . Hence , and , which contradicts our assumption on the .
Hence is contained in a fundamental domain mod , which entails . Now, let us assume that , up to a null set. We then get
[TABLE]
which is the desired contradiction.
Remark 9*.*
The results in this section align nicely with results from wavelet analysis. For example, Corollary 5.5 is related to so-called MSF wavelets. Such wavelets are characterized by the property that is, up to scalar multiplication, given by the characteristic function of a Borel set. It was shown by Chui and Shi in [5], that whenever the dilation is such that all integer powers of are irrational, every orthonormal wavelet associated to must be an MSF wavelet. Corollary 5.5, applied to the family , for , provides this answer under the strictly stronger assumption that is transcendental (which is equivalent to independence of the dual lattices). Note however that here our corollary also provides a stronger conclusion, since the generators are not assumed to be dilates of a single mother wavelet.
But also Theorem 5.3(i) and its proof have a precedent in wavelet analysis. Note that the proof of the Theorem yields
[TABLE]
This phenomenon is related to the question how to estimate frame bounds of the full system from the bounds of the individual layers indexed by , which was investigated for wavelet systems with transcendental dilations in [15]. Indeed, is a Bessel system with optimal bound precisely when
[TABLE]
which furthermore is a frame with optimal lower bound if and only if
[TABLE]
These estimates should be compared to (3.7) and (3.8); they can be viewed as a generalization of [15, Theorem 2.1].
First an example concerning perturbation (in)stability of this property. Indeed, the existence of normalized tight frame generators is not robust with respect to arbitrarily small perturbations of the lattice generators.
Example 4**.**
Consider with the Lebesgue measure. Consider the system , and let be an arbitrary sequence of strictly positive numbers. Pick a sequence with , and the additional property that is -linearly independent (this is easily done inductively). Then Theorem 4.1 yields a system of tight frame (even orthonormal basis) generators associated with . However, for the perturbed lattice system , we can estimate , hence Theorem 5.3 shows that no generators can exist for .
A question that is somewhat similar to the notion of refinements of lattice families is whether the existence of frame generators is robust with respect to enlarging each lattice in the family individually. At first glance, this may seem like a reasonable conjecture; after all, enlarging the lattices leads to systems with more redundancy (and larger bandwidth), which should make frame construction easier. However, this intuition is generally misleading, as the following example shows.
Example 5**.**
Consider with the counting measure. Fix a family of pairwise prime integers such that . Then the tight lattices are independent. Hence, there does not exist a family of dual frame generators in for the lattices by Theorem 5.3(i) and Theorem 3.14. On the other hand, if we let
[TABLE]
we obtain a strictly decreasing family of lattices. By the proof of Theorem 4.1, there is a system of dual frame generators for the , and holds for all . Thus increasing the lattices can have a negative impact on the availability of tight frame generators.
6 Applications and extensions
We end this paper with further discussions of the necessary conditions for the frame property in Section 3.4.
Intuitively, the Calderón sum measures the total energy concentration of the generators in the frequency domain. If the Calderón sum is zero on some domain in frequency, then clearly none of the frequencies in this domain can be represented by the corresponding GSI system. In other words, the corresponding GSI system is not complete/total. Furthermore, whenever a GSI system has the frame property, which is a stronger assumption than the spanning property, one would even expect the Calderón sum to be bounded uniformly from below since the GSI frame can reproduce all frequencies in a stable way.
However, as we saw in Theorem 3.13 and Example 1, this is again a situation where our intuition only holds true if we assume the -UCP. Under the -UCP, the Calderón sum of a GSI frame with bounds and takes values in , that is,
[TABLE]
Without the -UCP, the best one can say is that
[TABLE]
As mentioned, the terminology “Calderón sum” comes from wavelet analysis. Let us show that our results on GSI systems extends known results in wavelet analysis. Fix an matrix and a full-rank lattice . The wavelet system , where , can be written as a GSI system in the following standard form:
[TABLE]
The Calderón sum then reads . It is a classical result by Chui and Shi [6] that for univariate frame wavelets (, ) with bounds and , it holds
[TABLE]
In wavelet analysis the case is special: it is the only dimension where the LIC/UCP automatically holds once we assume local integrability in of the Calderón sum. Hence, for univariate wavelets the issue of LIC/UCP is, in most cases, completely absent.
Theorem 6.1**.**
Let , , let be a full-rank lattice, and let be an at most countable index set. Suppose that satisfies the lattice counting estimate, that is,
[TABLE]
If the wavelet system is a frame with bounds and , then
[TABLE]
Proof.
We consider the wavelet system as a GSI system in the standard form. By Lemma 3.2, it holds that for a.e. . Since satisfies the lattice counting estimate, this implies, by a result in [2], that the wavelet system satisfies that LIC. Since the LIC implies -UCP, the result follows from Theorem 3.13. ∎
The lattice counting estimate was introduced in [2], where Bownik and the second named author show that almost all wavelet systems satisfy the lattice counting estimate. In particular, a dilation matrix that is expanding on a subspace (i.e., matrices with eigenvalues bigger than one in modulus, at least one strictly bigger, and eigenvalues of modulus one have Jordan blocks of order one) and any translation lattice will satisfy the lattice counting estimate.
The proofs of the lower bound of wavelet frames and GSI frames for in [6] and [4], respectively, are of similar nature, and they rely on the fact that lattices in has a natural ordering. Indeed, one can assume . This is not the case in higher dimensions nor for general LCA groups, and the mentioned proofs break down. Moreover, the proof of Theorem 3.13 is conceptually much simpler than the proofs in [6, 4] once the theory of almost periodic functions of GSI systems is in place. In fact, our proof extends to a larger class of systems, called generalized translation-invariant (GTI) systems, introduced in [10]. GTI systems are continuous or semi-continuous variants of GSI systems, and therefore encompass, e.g., the continuous (and semi-continuous) wavelet, Gabor and shearlet transforms.
Theorem 6.2**.**
Let be at most countable. be a GTI system, where for each : , is a co-compact subgroup (with some given Haar measure), and a measure space (satisfying the three standing assumptions in [10]). Suppose is a (continuous) frame with bounds and that satisfies -UCP (with the straightforward modifications). Then
[TABLE]
where for each .
Theorems 3.11, 3.12 and 3.14 also extend to GTI frames as Theorem 6.2, albeit Theorem 3.14 needs the additional assumption that for all . We remark that there exist LCA groups that have no lattices, while any LCA group has a co-compact subgroup. We leave the existence question of GTI frames for a family of co-compact subgroups for future research.
Acknowledgements
We thank Mads Jakobsen and Felix Voigtlaender for interesting discussions and help with Example 3. We also thank Jordy van Velthoven for reading the manuscript and pointing out some typos.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Balazs, M. Dörfler, F. Jaillet, N. Holighaus, and G. Velasco. Theory, implementation and applications of nonstationary Gabor frames. J. Comput. Appl. Math. , 236(6):1481–1496, 2011.
- 2[2] M. Bownik and J. Lemvig. Wavelets for non-expanding dilations and the lattice counting estimate. Int. Math. Res. Not. , 2016.
- 3[3] M. Bownik and Z. Rzeszotnik. The spectral function of shift-invariant spaces on general lattices. In Wavelets, frames and operator theory , volume 345 of Contemp. Math. , pages 49–59. Amer. Math. Soc., Providence, RI, 2004.
- 4[4] O. Christensen, M. Hasannasab, and J. Lemvig. Explicit constructions and properties of generalized shift-invariant systems in L 2 ( ℝ ) superscript 𝐿 2 ℝ L^{2}(\mathbb{R}) . Adv. Comput. Math. , 43(2):443–472, 2017.
- 5[5] C. K. Chui and X. Shi. Orthonormal wavelets and tight frames with arbitrary real dilations. Appl. Comput. Harmon. Anal. , 9(3):243–264, 2000.
- 6[6] C. K. Chui and X. L. Shi. Inequalities of Littlewood-Paley type for frames and wavelets. SIAM J. Math. Anal. , 24(1):263–277, 1993.
- 7[7] I. Daubechies. The wavelet transform, time-frequency localization and signal analysis. IEEE Trans. Inform. Theory , 36(5):961–1005, 1990.
- 8[8] E. Hernández, D. Labate, and G. Weiss. A unified characterization of reproducing systems generated by a finite family. II. J. Geom. Anal. , 12(4):615–662, 2002.
