On the Structure and Interpolation Properties of Quasi Shift-invariant Spaces
Keaton Hamm, Jeff Ledford

TL;DR
This paper investigates the structure of quasi shift-invariant spaces, explores conditions for stable interpolation and sampling, and examines the relationship between different such spaces for function recovery.
Contribution
It provides new insights into the structure of quasi shift-invariant spaces and establishes conditions for stable interpolation and sampling within these spaces.
Findings
Conditions for stable sampling are identified.
Criteria for function recovery from interpolants are established.
Relations between different quasi shift-invariant spaces are characterized.
Abstract
The structure of certain types of quasi shift-invariant spaces, which take the form for a discrete set is investigated. Additionally, the relation is explored between pairs and such that interpolation of functions in via interpolants in solely from the samples of the original function is possible and stable. Some conditions are given for which the sampling problem is stable, and for which recovery of functions from their interpolants from a family of spaces is possible.
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.
On the Structure and Interpolation Properties of Quasi Shift-invariant Spaces
Keaton Hamm
Department of Mathematics, Vanderbilt University, Nashville, TN 37240
and
Jeff Ledford
Department of Mathematics and Applied Mathematics, Virginia Commonwealth University
Richmond, VA 23284
Abstract.
The structure of certain types of quasi shift-invariant spaces, which take the form for an infinite discrete set is investigated. Additionally, the relation is explored between pairs and such that interpolation of functions in via interpolants in solely from the samples of the original function is possible and stable. Some conditions are given for which the sampling problem is stable, and for which recovery of functions from their interpolants from a family of spaces is possible.
Key words and phrases:
Shift-invariant Space, Quasi Shift-invariant Space, Nonuniform Sampling, Interpolation
2010 Mathematics Subject Classification:
46E20, 41A05, 41A30, 42B35, 41A63, 42C15
1. Introduction
At the heart of modern signal processing and sampling theory are two fundamental questions: when is sampling a class of functions at a given point-set stable? And if the sampling is stable, how may functions in the given class be reconstructed from their samples? While these questions may be based around applications and are indeed of import in engineering disciplines, they lead quite quickly to some deep theoretical and structural mathematical problems. The origin of classical sampling theory lies in the observation that functions in the Paley–Wiener space of bandlimited functions in whose Fourier transforms are supported in the torus can be recovered both in and uniformly on by a cardinal sine series:
[TABLE]
This is equivalent to the observation that the exponential system is an orthonormal basis for .
However, much literature in the modern era has been devoted to breaking away from the assumption that functions are bandlimited (which implies, in particular, that the functions are analytic). Consequently, many interesting function spaces have been discussed – Wiener amalgam spaces, modulation spaces, spaces of finite rate of innovation, shift-invariant spaces, Sobolev spaces, and Triebel–Lizorkin spaces to name a few.
In particular, shift-invariant spaces have been popularized in many areas, including functional analysis, harmonic analysis, and approximation theory (in the latter field, they have been well-studied specifically in the setting of radial basis function approximations [10, 11, 12, 17, 38, 39, 44]). A shift-invariant space has the form , where the closure is taken in for some (see, for example, [13, 37]). As a matter of terminology, we call the generator of the space (note it is sometimes called the window or kernel). The objects of study in this paper are quasi shift-invariant spaces
[TABLE]
where the closure is taken in . Quasi shift-invariant spaces in this form with being infinite have been considered in [5, 26], and are also implicitly considered in [62]. Recently, stability results for Riesz bases in such spaces were considered in [20].
The purpose of this article is twofold: to determine how the structure of quasi shift-invariant spaces compares to the structure of shift-invariant spaces under the same assumptions on the generators; and secondly, to discuss the recovery of functions in quasi shift-invariant spaces via their interpolants from other quasi shift-invariant spaces. Motivated by the study of shift-invariant spaces, we consider the following problems.
Problem 1**.**
Under standard assumptions on the generators , and discrete translation sequences , what is the structure of ? In particular, is the space a closed subspace of ? Do the translates of form a natural basis for the space?
Problem 2**.**
- a)
Under what conditions on and is interpolation of functions in via interpolants in possible, and uniquely determined? 2. b)
Under what conditions may be recovered from its interpolants in a family of quasi shift-invariant spaces ?
Answers to the first problem in the shift-invariant case (i.e. ) are driven by the fact that , which of course is a closed subspace of , and the integer translates of sinc form an orthonormal basis for . The second problem is one of scattered-data interpolation and has been studied by several authors. For instance, Dyn and Michelli [21] provide results for finite multivariate interpolation using conditionally positive definite functions, while Jetter and Stöckler [36] examine irregular sampling where one of the spaces is a shift-invariant spline space. Similar considerations, including reconstruction algorithms may be found in [2, 3]. More recently, Atreas [5] considers spaces under essentially the same assumptions made below ((A1) and (A2) in Section 3) and gives a reconstruction formula in the spirit of the classical Whittaker–Kotel’nikov–Shannon (WKS) sampling theorem; some results in this article may be viewed as approximate reconstruction methods in the same vein. Radial basis functions (RBFs) have been employed to attack this problem as well, [52, 53]. The literature on RBF interpolation is vast, and the reader is encouraged to consult [15] and [64] for a more general discussion of this problem.
These works, and the results of [45], which solve Problem 2 in the special case when and the exponentials are a Riesz basis for , form the inspiration for our study of this problem. More precisely, Theorems 1 and 2 in [45] give conditions on families of generators which allow for recovery of via their interpolants in .
Such interpolation schemes have their origin in the work of I. J. Schoenberg on cardinal interpolation via splines [59], which are related to summability methods of the cardinal sine series appearing in the aforementioned WKS sampling theorem.
The rest of the paper is organized as follows. In the following section, we give some preliminary definitions and discuss some of the function spaces to be studied in the sequel. Section 3 introduces quasi shift-invariant spaces and gives some indication of their structure as desired by Problem 1. Section 4 begins the study of interpolation between quasi shift-invariant spaces and gives an answer to Problem 2, part a (Theorem 2), while Section 5 provides conditions on families of interpolating generators giving an answer to part b (Theorem 4 and Corollary 4). The subsequent section provides several types of examples to illustrate the convergence phenomenon described previously, and it turns out that the support of the function plays an important role in the structure of the examples. Section 7 discusses some extensions to cardinal functions which are classical objects of study in interpolation theory, and we conclude with brief sections on inverse theorems and remarks.
2. Preliminaries
Denote by and the typical spaces of –integrable functions over a measurable set and –summable sequences indexed by the set , respectively, with their usual norms. By with no set specified we mean , and likewise . For convenience, let . Additionally, let be the space of continuous functions on and the subset of continuous functions on vanishing at infinity.
For functions , we will use the following normalization for the Fourier transform:
[TABLE]
whereby the Fourier transform can be extended to a linear isometry on . If and is continuous, then the inversion formula is Plancherel’s Identity thus states that We will use to denote the torus, which may be identified with the interval . Unless otherwise specified, is to be taken as the inner product on .
Throughout, will denote a constant, which may change from line to line depending on context, and subscripts will denote dependence upon a given parameter. Additionally, the statement will mean that there are constants and such that
[TABLE]
2.1. Function Spaces
Throughout the sequel, we will be concerned with many function spaces which arise in applications of harmonic analysis (specifically as different models of the structure of signals one wishes to analyze), but which also enjoy use in other areas of functional analysis. The first is the classical Paley–Wiener space of bandlimited functions. Given , let
[TABLE]
endowed with the norm on . Since is isometrically isomorphic to for any parameters and via the map , , in the sequel we limit our considerations to the canonical space . Naturally, the Fourier transform is an isometric isomorphism from to .
Of additional utility to our analysis are various Wiener amalgam spaces. For , these spaces are defined by
[TABLE]
with the suitable modification when is infinite. We denote the norm implicit in the definition above via . These spaces may also be identified as the sum of Banach spaces: , which is isometrically isomorphic to via the obvious map. Note that this readily implies that the amalgam spaces are Banach spaces. For the special case that is most heavily considered in the sequel, we reduce the notation to , which is sometimes called Wiener’s space. Note that these amalgam spaces capture both local and global behavior of the functions simultaneously. Loosely, functions in are locally in and globally in . These spaces, first considered by Wiener, have found great utility in harmonic analysis (see the excellent survey [34] and its many references, as well as [22, 25]). As the sequel will make use of the Fourier transforms of functions in the amalgam spaces, it will be useful to adopt the convention that is the set of Fourier transforms of elements of provided .
We will not enumerate all of the properties of these amalgam spaces, but let us collect some facts which will be useful later on.
Proposition 1**.**
- (i)
If and , then , and . 2. (ii)
If , and , then , and . 3. (iii)
. 4. (iv)
** 5. (v)
** 6. (vi)
If then .
Proof.
Note that (i) follows from the inclusion , and the fact that the norm is subordinate to the norm, whilst (ii) follows from the facts that and
Part (iii) is evident by the definition of the norm on , and (iv) follows from combining (i), (ii) and (iii). Finally, (v) arises from (iv) and the Riemann–Lebesgue Lemma, and (vi) follows from the fact that is closed under multiplication. ∎
For a separable Hilbert space , let be the space of bounded linear operators from into itself, and recall that the strong operator topology (SOT) on is the topology of pointwise convergence. That is, converges in SOT to provided for every . When the context is clear, we simply use to denote the typical operator norm for elements of .
2.2. Riesz Bases and Complete Interpolating Sequences
Two important objects for our subsequent study will be Riesz bases for Hilbert spaces and complete interpolating sequences for Paley–Wiener spaces. These objects are defined in rather different ways, but are nonetheless intimately related.
Definition 1**.**
Let be a separable, infinite dimensional Hilbert space. A family is a Riesz basis for provided it is complete and there exists a constant (called the Riesz basis constant) such that for every finite sequence of scalars ,
[TABLE]
Equivalently, a Riesz basis is a bounded unconditional basis, or is the image of an orthonormal basis under an invertible bounded linear operator, or is an exact, tight frame [19, 63]. Moreover, if is a Riesz basis for , then each admits a unique representation of the form with .
Definition 2**.**
A sequence is a complete interpolating sequence (CIS) for provided for every , there exists a unique satisfying
[TABLE]
Finding a solution to (2) is called the moment problem [63]. It turns out that these two concepts are closely related as the following theorem shows.
Theorem 1** ([63], Theorem 9, p. 143).**
A sequence is a CIS for if and only if is a Riesz basis for .
Note that Definition 2 and Theorem 1 provide a natural bijection between and via the map .
A necessary condition for to be a CIS for is for it to be quasi-uniform, i.e. there are such that (assuming that the points are ordered so that for all ). A sufficient condition may be found in Kadec’s 1/4–theorem [41], which states that if , then is a CIS for . Consequently, CISs are available in abundance, and restricting attention to such sequences is not overly strict. Necessary and sufficient conditions were given by Pavlov [56] in terms of zeros of certain types of entire functions and Muckenhoupt weights.
Next, we define two operations, extension and prolongation, which will be used extensively in the subsequent sections. First, assume that is a CIS for , and note that on account of Theorem 1, if , it admits a unique representation in . Therefore, (1) implies that the extension
[TABLE]
is locally square-integrable, and thus is well-defined almost everywhere on . Second, for every , define the prolongation operator associated with the CIS via
[TABLE]
Note is not merely translation, as it is viewed as an operator mapping into , so is better viewed as an operation on the coefficients. An application of (1) implies that
[TABLE]
where is the Riesz basis constant for the exponential system associated with as in Definition 1. The same bound holds for the adjoint, . Consequently, the families are uniformly bounded subsets of .
In the sequel, we will distinguish between prolongation operators for multiple CISs, and if is another CIS, then and are defined analogously via the expansion of in terms of the Riesz basis .
Finally, each Riesz basis has with it an associated dual Riesz basis. Indeed, if are the coordinate functionals associated with the basis , i.e. the dual elements such that , then any admits a unique representation in each basis as follows:
[TABLE]
These coordinate functionals are the dual Riesz basis. It should be noted that the functions need not be continuous in general, though if for every , then evidently .
Our use of the prolongation and extension operators above stem from Lyubarskii and Madych [48], who additionally provide a pleasant extension of the classical Poisson Summation Formula to sequences which are CISs for [49].
3. Quasi Shift-Invariant Spaces and their Structure
Let us now introduce the primary object of the subsequent study: the so-called quasi shift-invariant spaces (so-named in [26]). For the moment, suppose that is a discrete sequence, i.e. , and that . Then define
[TABLE]
where the closure is taken in . In the special case , which is one of the primary motivations of this study, the space is called the principal shift-invariant space associated with the generator (which is also commonly called the kernel or window function; our use of the term generator follows from [4]). For an excellent survey of the weighted sampling problem in shift-invariant spaces, the reader is invited to consult [4]. Let us note that in the case that is a Riesz basis for , then the space can be described in a manner that is easier to handle in practice. Namely,
[TABLE]
where convergence of the series is taken to be in . Indeed, in much of the literature, the space is defined by (3) (for example, [4, 26]).
In light of the fact that quasi shift-invariant spaces are generalizations of shift-invariant spaces, it is natural to ask how similar their structure is. Consequently, there are some natural questions that present themselves here, the first of which is: when is a closed subspace of ? Secondly, when is a Riesz basis for ? The third question of interest to us (Problem 2) is that of when the nonuniform sampling problem is well-posed, i.e. when is uniquely and stably determined by its values for some discrete ? This of course requires pointwise evaluation to be well-defined in the space . The answers, as will be demonstrated, are similar to the shift-invariant space case.
3.1. Regular Generators
We now turn to some regularity conditions on the generator and the translation set , and elucidate the structure of the associated quasi shift-invariant spaces. Henceforth we assume that enjoys the following properties:
- (A1)
is positive definite, and 2. (A2)
such that
[TABLE]
For convenience later on, if satisfies (A1) and (A2), then we define
[TABLE]
which is necessarily positive.
Note that by Proposition 1, (A2) implies that the generator is continuous. Also, in the case of , properties (A1) and (A2) imply that is a Riesz basis for its closed linear span, and consequently that is a closed subspace of . Additionally, these assumptions are not overly strict in that they encompass the well-studied sinc kernel, which forms the launching point of our study (and many others, for that matter). Moreover, the literature on interpolation and approximation of functions by positive definite kernels is extensive, and employs connections with reproducing kernel Hilbert spaces, polynomial splines, and other techniques. See, for example, [53], and for many references on scattered-data approximation, [64].
For the duration of this work, we will make the assumption that the shift sequence is a CIS for , or equivalently, via Theorem 1, that it contains the frequencies of a Riesz basis of exponentials for . This restriction, while a special case of the general quasi shift-invariant space, comes from the motivation of the interpolation problem found in Theorem 1 of [45]. Throughout this section, we will use the equivalent definition in (3), which is justified on account of the following proposition, which is the main structural statement on quasi shift-invariant spaces in this section.
Proposition 2**.**
If is a CIS for and satisfies (A1) and (A2), then the following hold:
- (i)
* is a Riesz basis for , and moreover,*
[TABLE] 2. (ii)
* is a closed subspace of ;* 3. (iii)
. 4. (iv)
For all ,
[TABLE]
Proof.
Note that (ii) follows immediately from (i). Item (i) is [35, Theorem 2.4]; since we use similar periodization arguments often in the sequel, we choose to give the proof here. Since there is only one CIS of interest, let for ease of notation in the remainder of the proof. In light of Plancherel’s Identity, it suffices to check the Riesz basis inequality in (i) with the middle term replaced by the norm of its Fourier transform. To wit, notice that
[TABLE]
where we have used periodization, the operator bound on , the Riesz basis inequality, and the fact that . The above inequality gives the right-hand side of the stated Riesz basis inequality for . To prove the lower bound, simply note that
[TABLE]
which is the desired lower bound.
In light of the Riemann–Lebesgue Lemma, statement (iii) only requires that we check that the Fourier transform of is in . That is square-integrable follows from (i), whereas the calculation to show that follows by the same method, and so is omitted. It should be noted that while the above calculation only requires , showing that requires that , which is (A2).
The first inequality in (iv) is a trivial consequence of Plancherel’s Identity. The second inequality depends upon Plancherel’s Identity and periodization. Let , then
[TABLE]
The inequality follows from elementary estimates, the uniform bound on the prolongation operators , multiplying and dividing by , and the fact that .
∎
It should be noted that Proposition 2 and its proof imply that , and that the Fourier inversion formula holds for functions in . Note also, from (iv) above, that is isomorphic to if is a CIS for .
Remark 1**.**
It should be noted that, under more relaxed assumptions on , its translates need not form a Riesz basis for . Indeed, if , but , then might fail to be a Riesz basis, or even a frame for its closed linear span (see [19] for the definition of a frame).
Interestingly, the support of plays an important role in the structure of these spaces under the assumptions above as the following proposition shows.
Proposition 3**.**
Suppose satisfies (A1) and (A2). Then
- (i)
If is a CIS for and , then . 2. (ii)
If , then there exist CISs for , and , with and .
Proof.
Proof of (i): Since the Fourier transform is an isometric isomorphism between and , it suffices to show that . Since is a Riesz basis for , we have that , which is since on .
Proof of (ii): Suppose that and and let . Then . However, any satisfies where is a –periodic function. Consequently, and must differ in for all but a single . ∎
The simple example of item (ii) turns out to be an important one and will be used again to discuss the limitations of the interpolation and recovery schemes developed in subsequent sections. Further discussion of the case when is postponed until Section 6.
A natural question is how large can the subspaces be? Can we obtain all of in this manner? Such questions have been considered for general and translation sets [6, 23, 55, 54]. The answer is essentially that translations can span and for ; however, one cannot generate an unconditional basis for all of in this manner for any .
4. Interpolation
Having elucidated some of the structure of the quasi shift-invariant spaces above, we now turn to the task of interpolation of functions in one such space from another, with the ultimate goal of classifying how well interpolation of functions in a target space with functions in performs.
Henceforth, we will fix a particular choice of satisfying (A1) and (A2) and a CIS , and we wish to interpolate data sampled from at some sequence . We require that our interpolant have the form
[TABLE]
(that is, ) where is a CIS for and are the interpolating coefficients. Here, is the interpolation generator.
On the way, we first demonstrate that the sampling problem is indeed well-posed as long as one samples at a CIS:
Lemma 1**.**
Let and be CISs for , and suppose satisfies (A1) and (A2). If with , then . Moreover,
[TABLE]
Proof.
We begin by noting that pointwise evaluation is well-defined by Proposition 2(iii). Recalling that is the inner product on , we have
[TABLE]
Now we may use the Riesz basis inequality for , which yields
[TABLE]
Using the triangle inequality and the bound for and provides the upper bound
[TABLE]
which we may bound above in terms of . Multiplying and dividing by provides us with the bound
[TABLE]
which completes the proof. ∎
A similar argument allows us to find the following bound in terms of :
[TABLE]
4.1. Existence of Interpolants
The following theorem demonstrates that interpolation is well-defined for a large variety of generators.
Theorem 2**.**
Suppose that and are CISs for , satisfies (A1) and (A2), and . If satisfies (A1) and (A2), then there exists a unique sequence such that the function of (5) satisfies:
- (i)
* for all , and* 2. (ii)
.
Proof.
This is essentially a reformulation of Corollary 1 and Proposition 1 in [45] since (A1) and (A2) imply the conditions found there. ∎
We note the following bound on the interpolating coefficients as in Theorem 2:
[TABLE]
Note that Theorem 2 implies that the interpolation operator is a bounded linear operator from . See also [29, 47] for similar interpolation results in higher dimensions.
This interpolation theorem provides us with the following norm equivalences in the quasi shift-invariant space.
Theorem 3**.**
Suppose satisfies (A1) and (A2), and that is a CIS for . Then if , we have
[TABLE]
Proof.
The equivalence follows from Proposition 2(i). Meanwhile, the fact that follows from (6) when and . In particular, this uses the fact that implies that the bi-infinite matrix defines an operator in (which in turn relies on the fact that is a CIS). Finally, that follows from the proof of Lemma 1. Putting together these estimates yields the conclusion of the theorem. ∎
Note that the following stems directly from the above theorem.
Corollary 1**.**
If and are as in Theorem 3, then for any satisfying (A1) and (A2), the interpolation operator is boundedly invertible. Moreover, the sampling operator associated with defined by is an isomorphism.
Consequently, and are isomorphic to each other if both and are CISs for . However, they are, in general, not the same subspace of as Proposition 3(ii) shows. It should also be noted that in the case but , interpolation is delicate. In particular, Baxter and Sivakumar [9] showed that if , , and , then the interpolation operator is not boundedly invertible.
Gröchenig and Stöckler [26] and recently together with Romero [27] give more general sampling results similar to the second part of Corollary 1 when is a totally positive function, but for quasi-uniform . Moreover, their techniques, using Gabor frame analysis, are quite different than the ones used here, and have some rather interesting implications.
4.2. Bounds for the Interpolation Operators
In this subsection, we explore some properties of the interpolation operators with the two-fold aim of extracting information about general interpolation properties between quasi shift-invariant spaces and setting the stage for the recovery results in the sequel.
In what follows, let and be fixed, but arbitrary CISs for , and recall that, given a function satisfying (A1) and (A2), each has a unique interpolant via Theorem 2 which satisfies , .
To move forward, we define some auxiliary operators whose importance will be revealed shortly. We begin with a simple multiplication operator: for , let
[TABLE]
where is defined as in (4). Given a function and an integer , we denote multiplication by by ; that is, for ,
[TABLE]
First, let us note that the conditions (A1) and (A2) guarantee that these are well defined, bounded operators on . Indeed we have the transparent bounds
[TABLE]
and if , with , whence is bounded independent of . Of particular note is that (A2) implies that
[TABLE]
Finally, let be defined by
[TABLE]
and
[TABLE]
Via the same method of calculation found in the previous proofs, one obtains the following bounds for these operators:
[TABLE]
and
[TABLE]
Note that , , and are positive (i.e. for every ); however, is not positive in general.
We simplify the notation of the interpolants by naming the nonharmonic Fourier series that arises in their Fourier transform:
[TABLE]
The following lemma will be exploited frequently.
Lemma 2**.**
Under the assumptions of Theorem 2, let , and be its unique interpolant in . The following equality holds almost everywhere on :
[TABLE]
where denotes the identity operator on .
Proof.
The proof uses periodization and the fact that is a CIS. Knowing that , we simply expand these in terms of the Fourier transform. First, note that
[TABLE]
where the inner product is on .
Similarly, we have
[TABLE]
Thus the conclusion of Lemma 1, the fact that is a CIS, and that the equalities above hold for all completes the proof. ∎
The following results illustrate the nature of the interpolation operators between two quasi shift-invariant spaces.
Proposition 4**.**
Under the assumptions of Theorem 2, the following holds:
[TABLE]
Consequently,
[TABLE]
Proof.
Note that Lemma 2, the triangle inequality, and the fact that provide us with the estimate
[TABLE]
Now the second term is majorized by on account of (9), whence it suffices to show that
[TABLE]
Rewriting the result of Lemma 2 as
[TABLE]
then taking the inner product with and appealing to (A1) and (A2), the Cauchy-Schwarz inequality, and positivity of , yields
[TABLE]
Now the elementary inequality combined with the previous estimate yields (10), which completes the proof of the first inequality. The second statement follows directly from the fact that and (8). ∎
Using these bounds, we may now estimate the operator norm of the interpolation operator .
Corollary 2**.**
With the notation and assumptions above, the following holds for all :
[TABLE]
Proof.
Since , we simply combine Propositions 2(iv) and 4. ∎
5. Recovery Criteria
Having determined when interpolation of functions in is possible via functions in in Section 4, we now turn to some approximate sampling schemes which allow for recovery of in a limiting sense from its interpolants in a family of spaces . The idea is that while the generator may be complicated, or decay slowly as sinc does, it may be replaced by an interpolating generator which gives approximate recovery in both and , but which may have a much simpler structure. More specifically, we consider the following problem:
Problem 3**.**
Given satisfying (A1) and (A2) and a CIS , find conditions on a family of interpolating generators and CISs such that for every , its interpolants converge to in and uniformly.
5.1. Preliminaries
With the above considerations in mind, consider the following criteria:
- (B1)
For every , satisfies (A1) and (A2). 2. (B2)
, where is as in condition (A2). 3. (B3)
for every . 4. (B4)
for every .
Let us stress that while (B3) and (B4) may seem rather abstruse at the moment, stronger hypotheses may be used which imply these conditions but which nonetheless give rise to many examples and additionally are more easily verified in practice. We will discuss these in more detail in Section 6; presently we turn our attention to consequences of these criteria. Note that if , then these conditions are much easier to handle since and are the identity on .
Condition (B1) implies that for all , , and additionally
[TABLE]
Together, (B1) and (B2) show that if , , with and thus are bounded independently of and . Moreover, (7) implies that
[TABLE]
Likewise, we have and .
If , (A2), and hence (B1), provides the bound ; however this bound could well depend on , as will be made more clear in the examples section that follows.
5.2. Recovery
With these notions in hand, we are ready to demonstrate our main recovery results. Let us first note that Lemma 2 and Proposition 4 imply the following.
Corollary 3**.**
The operators are invertible and the norms of the inverses are bounded independent of .
Additionally, we have the following.
Lemma 3**.**
(B1)–(B4)* imply that in the SOT on .*
Proof.
Let . Then
[TABLE]
and both terms converge to 0 as on account of (B3) and (B4). The first inequality above stems from the uniform bounds on the prolongation operators and their adjoints. ∎
It should be noted that in general, need not converge to in the SOT on . An example of this is provided by regular interpolators discussed in Section 6. We may now prove our main recovery result.
Theorem 4**.**
Suppose that and are CISs for , satisfies (A1) and (A2), and satisfies (B1)–(B4). Then for every ,
[TABLE]
where is the unique element of which interpolates at .
Proof.
Plancherel’s Identity allows us to check this result in the Fourier domain; thus we estimate
[TABLE]
We begin with . On , we have
[TABLE]
Therefore, Corollary 3 and Lemma 3 imply that as .
Next, notice that is majorized by
[TABLE]
which, in turn, is majorized by , where
[TABLE]
[TABLE]
and
[TABLE]
Notice that , which converges to 0 as this is the term above. Subsequently, is majorized by
[TABLE]
where the first term is majorized by a constant multiple of , which is , hence converges to 0, and the second term converges to 0 as a result of (B3).
Finally, is bounded by
[TABLE]
The first term is bounded above by a constant multiple of by a similar argument to the first term related to , hence converges to 0. The second term converges to 0 on account of (B4). Putting these estimates together, we conclude that as , whence the conclusion of the theorem.
∎
Corollary 4**.**
With the notations and assumptions of Theorem 4,
[TABLE]
uniformly on for every .
Proof.
The proof follows directly from the proof of Theorem 4 by noticing that , which by periodization and the Cauchy-Schwarz inequality, is majorized by a constant multiple of
[TABLE]
The first term above converges to [math] by Theorem 4, whilst the second is handled as in the proof thereof.
∎
For additional convergence phenomena similar to the ones listed in this section, the interested reader is referred to [28, 29, 32, 45, 47, 48, 51, 61].
6. Examples
Here we will provide a few examples of the phenomena described above. Such concrete considerations will also lead us to some alternative statements of the criteria (B3) and (B4) which may be more readily checked in practice. Our examples are broken up into three cases based on the support of . The first is when (note that condition (A2) implies that ). The second case is for some , and the final case is when the support is not contained in any bounded interval.
6.1. Case – Regular Interpolators
To begin, let us demonstrate that the more general setting here indeed recovers the specific considerations of [45]; namely, for the case of , the criteria (B1)–(B4) imply the criteria therein of so-called regular interpolators.
A family is said to be a family of regular interpolators for provided (B1) and (B2) are satisfied, and in addition,
[TABLE]
Note that, in particular, (13) implies that in the SOT on as on account of (11) and the dominated convergence theorem.
Theorem 5**.**
If is a family of regular interpolators for and satisfies (A1) and (A2) and , then satisfies (B1)–(B4). In particular, Theorem 4 and Corollary 4 are valid for such families.
Proof.
By definition, (B1) and (B2) are satisfied. Notice also that condition (B3) is vacuous because of the assumption on the support of . Finally, by the now familiar argument, (B4) may be shown as follows:
[TABLE]
which tends to [math] as via the observation that in the SOT on .
∎
Consequently, Theorem 5 recovers Theorem 1 of [45], which constitutes the special case when is the sinc function, whose Fourier transform is the characteristic function of . Also regard that the proof follows from Proposition 3(i) in this case given the assumptions on . Examples of regular interpolators may be found in Section 5 of [45] and Section 8 of [28], but here we note that a prominent example is the family of Gaussian generators: , .
6.2. A Class of Convolution Examples for Bandlimited
Here, we focus on the special case when is a generator satisfying (A1) and (A2) such that for some . Note that if and is compactly supported on , then . However, not everything in is the Fourier transform of a function in Indeed, consider a function such that is unbounded on , e.g. where This is in because its Fourier transform is square-integrable, but fails to be in the amalgam space.
Additionally, we assume that the interpolation set coincides with the set defining the space (the reason for this is explained in Section 6.4). Suppose that is a family of generators, each of which satisies (A1) and (A2). Let
[TABLE]
and note that Proposition 1 implies that the convolution theorem holds, i.e. . Then we have the following:
Proposition 5**.**
Suppose satisfies (A1) and (A2), for some , and is a CIS for . Let . If satisfies (B1),
[TABLE]
and
[TABLE]
then satisfies (B1)–(B4), where . Consequently, Theorem 4 and Corollary 4 hold for .
Proof.
Note that (A1) for follows from the fact that (A1) holds for and . For (A2), note that
[TABLE]
Thus, to check (B2) for , we need only notice that , whence applying (14) and the fact that for sequences, , yields
[TABLE]
which is bounded by a constant independent of on account of the fact that satisfies (B2’) (here we have abbreviated the amalgam space in question to for brevity).
Next we check (B3) and (B4). Notice that
[TABLE]
where the first inequality follows from (14).
Consequently, letting ,
[TABLE]
To conclude the proof, it suffices to notice that the above inequality together with (B3’) implies both (B3) and (B4) for . In particular, (B3’) implies that in the SOT on . ∎
Remark 2**.**
As a special case of this, suppose that , which can happen e.g. if and are even and decreasing on . In this case, (B3’) reduces to the statement that as .
Remark 3**.**
It should also be noticed that a family satisfying (B2’) need not satisfy (B2) as the following example will illustrate. That is, need not be uniformly bounded for since the proof of Proposition 5 only requires a finite number of terms in the amalgam norm.
Remark 4**.**
In Proposition 5, the assumption that satisfies (B1) can be relaxed. If for all , we have , with on and on . Then clearly satisfies (A1) and (A2), and we have
[TABLE]
thus to account for (B2), we impose the additional hypothesis that
[TABLE]
For an illustration of this, see Example 4 below.
Example 1** (Convolution with the Poisson Kernel).**
Let with such that for each . Then
[TABLE]
Evidently, , and for ,
[TABLE]
Therefore,
[TABLE]
Note that the series on the right hand side of (15) is increasing as increases, and moreover each term tends to 1 as . Consequently, is not bounded above by a constant independent of . However, is since is compactly supported. Indeed, if , then (15) implies that
[TABLE]
which implies (B2’).
To verify (B3’), we use Remark 2 and simply notice that uniformly in on for any .
Example 2** (Convolution with the Gaussian Kernel).**
Similar to Example 1, we obtain the same convergence results when , letting . It should be noted that the parameter here is the opposite as in the regular interpolators case, where the Gaussian parameter limits to [math]. In both of these examples, convolution is used to smooth out the generator with something that decays rapidly.
Example 3** (Convolution with Inverse Multiquadrics).**
In the vein of Examples 1 and 2, consider where is the inverse multiquadric of exponent , and we let . Then from [40],
[TABLE]
where is the modified Bessel function of the second kind (see [1, p. 376] for the precise definition).
Since is decreasing, as before. The other conditions being easily checked, let us consider (B3’). It suffices to check for that uniformly for . Notice that
[TABLE]
To consider the limit as , we need to know the asymptotic behavior of the modified Bessel function of the second kind with respect to its order. From [60], we find that
[TABLE]
where the notation , means that . Thus, setting , we have that
[TABLE]
which yields (B3’).
Example 4** (Convolution with Approximate Identities).**
Finally, we may consider a large class of approximate identities. These are similar in spirit to the examples presented thus far, but the previous examples are not necessarily approximate identities of the form considered here. Again make the assumption that is compactly supported on , with , and that . For our purposes, an approximate identity is a function with on , with , and . Then set , and we find that satisfies (B1)–(B4).
To check that satisfies (B1)–(B4), first note that by Remark 4, (B1) is satisfied; therefore we simply verify that satisfies (B2’) and (B3’). Recalling that , it follows that the quantity is non-decreasing as increases, and hence
Next, note that since , the inversion formula holds, and we have that for almost every . Consequently,
[TABLE]
Combining this with the previous observation about yields the conclusion of (B2’).
To see (B3’), note that as , and that for any fixed , . Consequently, we have . Moreover, the amalgam norm of the constant goes to [math] as well by a similar argument. Thus by the triangle inequality, (B3’) is satisfied.
6.3. Non-bandlimited
Let us now consider the case when is not compactly supported, and again . Then if where satisfies (B1) and modified versions of (B2’) and (B3’) where the amalgam norms therein are taken to be and , respectively, the conclusion of Proposition 5 holds for . It should be noted that in this case, the Gaussian of Example 2 still yields recovery, but convolution with the Poisson kernel does not because then the family does not satisfy the uniform bound in (B2’) when the sum is infinite (see the discussion in Example 1).
6.4. Interpolation at
It is pertinent to examine the case when , and . Unfortunately, recovery turns out to not be generally feasible, a fact we record in the following proposition.
Proposition 6**.**
There exist with , and CISs for such that there is no family satisfying (B1) for which the interpolants converge in and uniformly to for all .
As of yet, we do not have enough information at our disposal to provide the proof, but we return to the matter at the end of Section 7.
7. Cardinal Functions
In this section, we analyze the special case when , in which case the space is called the principal shift-invariant space associated with the generator – an object of extensive study in many areas of harmonic analysis, approximation theory, and functional analysis. We still make the assumptions (A1) and (A2) on , and in what follows, assume that is a one-parameter family of generators satisfying (B1)-(B4).
Cardinal interpolation arose from the penetrating work of I. J. Schoenberg on spline interpolation [58, 59], and from summability methods for the sampling series found in the WKS sampling formula. Recall that if , then
[TABLE]
where if , and . Convergence of the series in (16) was later shown to be both in the sense of and uniform on . But to E. T. Whittaker [65], (16) was an equation of interpolation, i.e. clearly for since .
However, the sinc series converges slowly in the sense that . Consequently, many authors, including Schoenberg, have sought to replace sinc with another cardinal function which has the property that , , but which decays more rapidly than sinc, hence the term summability method. There are of course other ways around use of the sinc kernel; for example, the generalized sampling kernels of Butzer, Ries, and Stens [18], but we restrict our attention here to cardinal function methods. There are many examples of such cardinal functions and their associated decay rates [8, 14, 15, 16, 30, 31, 46, 50]. Of primary interest to us is their construction from a given function as follows.
Given , formally define
[TABLE]
Under certain conditions (for example, if ) the inverse Fourier transform, , will be a cardinal function which satisfies , . Indeed, one needs only justify the following formal calculation:
[TABLE]
Consequently, if the family of interpolators is made from convolution with the generator , i.e. , then the Fourier transform of the cardinal function is
[TABLE]
Moving on to more general cardinal functions, there are a couple of natural questions that arise. The first is, does satisfy (A1) and (A2)? Provided that itself does, then the answer is yes. We exhibit this in the following proposition.
Proposition 7**.**
If satisfies (A1) and (A2), then is a cardinal function, and moreover, satisfies (A1) and (A2).
Proof.
Since (A1) and (A2) hold for , we have on and , thus Bochner’s theorem and a routine periodization argument show that (A1) holds for as well. Additionally, since is nonnegative, the calculation above evaluating is valid by the monotone convergence theorem, and so given by the Fourier inversion formula is a cardinal function provided we have , which follows from (A1).
For (A2), we have
[TABLE]
which implies that . Now we can calculate by noting on , which leaves us with
[TABLE]
∎
Note that Proposition 7 implies that is a well-defined shift-invariant space.
7.1. On Interpolation via Cardinal Functions
Given cardinal functions constructed previously, we now turn to their interpolation properties. Proposition 7 together with Theorem 2 implies that interpolation of functions in via interpolants in is possible. We now enumerate some of the consequences of this fact beginning with the following lemma. For ease of notation in this section, we write for , representing the interpolation operator from .
Lemma 4**.**
Let be the interpolation operator associated with the generator . Then if , .
Proof.
Note that by (5) and Theorem 2(i), . Moreover, is the unique function in such that . However, evidently satisfies this relation as well; consequently . ∎
This lemma leads us to the following proposition.
Proposition 8**.**
If satisfies (B1)–(B4), then both uniformly and in as .
Proof.
First, note that via Theorem 2 (or Lemma 2 of [45]), there exists a function such that . For this , , and by Lemma 4. Thus, an application of the conclusion of Theorem 4 demonstrates that
[TABLE]
uniformly and in . ∎
Another, perhaps more important question, involves the form of the interpolant to a given . Theorem 2 shows that is the unique element of that interpolates at the integer lattice. However, the definition of the cardinal function implies that the following function interpolates at the integers:
[TABLE]
Moreover, Lemma 1 implies that , on account of the interpolatory condition, is the unique element of that interpolates at . The following theorem is a consequence of the characterization of principal shift-invariant subspaces of in [10], and implies that indeed . For completeness we give the proof here.
Theorem 6**.**
If satisfies (A1) and (A2), then .
Proof.
Again, it suffices to show that . By definition, However, we may equivalently write the space as The proof may be concluded by simply noticing the where is a continuous, –periodic function which is bounded above and below on . Consequently, with a –periodic function, whence . ∎
Consequent upon Theorem 6, the unique interpolant of from the shift-invariant space takes the forms
[TABLE]
As promised, this section concludes with the counterexample to recovery whenever .
Proof of Proposition 6.
Let and ( is obviously a CIS, and the perturbation of only finitely many points in a CIS yields another CIS provided the resulting points are pairwise distinct). Additionally, let be the Gaussian kernel , so that and on .
By way of contradiction, suppose that there was a family of generators which satisfy (B1) such that for every , we have in and uniformly, where .
First, notice that by Theorem 6, . Therefore, for every , we have
[TABLE]
via the uniqueness of the interpolant. Consider first that
[TABLE]
By the Poisson Summation Formula (which clearly holds for the Gaussian) this is
[TABLE]
Thus in , which implies that in (since is a –periodic function that is bounded above and below by positive constants for every ).
Therefore, in . This implies that if , which is in , we have
[TABLE]
in (this follows again by using the Poisson Summation Formula on , which is evidently valid, and the fact that for ). But the right hand side above is in . On the other hand, by assumption, which is in , which yields a contradiction. ∎
7.2. Extensions for Cardinal Interpolation
One of the more interesting utilities of cardinal functions defined as in (17) is that they may still be well-defined even when the generator grows. For example, if , which is the traditional Hardy multiquadric [33] then the cardinal function is well-defined because may be identified with a function which has an algebraic singularity at the origin and decays exponentially away from the origin [40], thus allowing the right-hand side of (17) to be defined for every . Yet in this case, because the space associated with is not well-defined because of the growth of the generator. However, the decay of and its Fourier transform is such that its principal shift-invariant space is indeed well-defined [14, 15].
Additionally, there do exist families of cardinal functions which satisfy condition (B1); as a canonical example, we consider , the cardinal functions associated with the Hardy multiquadric mentioned above indexed by the shape parameter . Suppose for simplicity that . Then the fact that satisfies (A1), (A2), and (B2) may be surmised from [57], while (B3) is vacuous based on the support of . Finally, (B4) follows from Proposition 2.2 of [8]. Thus there are examples of cardinal functions which exhibit convergence by satisfying these conditions despite the fact that the generators they are formed from manifestly do not. So while often the spaces and coincide, there is sometimes additional flexibility when using cardinal functions.
In [46], sufficient conditions on a family of multivariate generators were given such that cardinal interpolation from the space (defined in the obvious manner for ) is well-defined, and moreover, the interpolants of a bandlimited function converge to that function both in and uniformly on as .
8. On Inverse Theorems
The conclusion of our analysis features a discussion of inverse theorems with respect to the generators, or rather lack thereof. Indeed, it is an interesting question whether convergence of interpolants for every implies that in some manner . In all cases described above, the answer to this question is negative.
The first case to consider is when . In this case, the fact that for every does not imply that . Essentially all regular interpolators of [45] are counterexamples; in particular, provides recovery in as , but clearly in any classical (e.g. pointwise, , etc.) manner.
For more general , consider interpolation of functions in via . Note that if , then Theorem 6 and uniqueness of the interpolant (Theorem 2) implies that for all as well. But Proposition 8 implies that , whereas there are many generators for which (for example, if , then , a fact that can be checked via (17)), which means that we cannot also have in this case .
9. Remarks
While the above analysis thoroughly explores Problem 2 in the quasi shift-invariant space, it is natural to consider what happens in the setting for general . Some things carry over in the uniform setting; for instance, under conditions (A1) and (A2), the systems and are unconditional bases for their span in , which we denote and , respectively, and moreover they are closed subspaces of [4]. Under the additional assumption that the symbol is in the Wiener algebra of –periodic functions with absolutely summable Fourier coefficients, we also have that for . The proof follows from the representation of the symbol as with and elementary norm inequalities.
Additionally, the results here involving cardinal functions extend easily to higher dimensions in the case . However, for more general , the methods here do not extend readily, predominantly due to the fact that Riesz bases of exponentials are difficult to come by in higher dimensions even for straightforward domains (e.g. it is an open problem whether or not a Riesz basis of exponentials exists for the Euclidean ball in for any ). For recent results on existence of Riesz bases, consult [24, 42, 43]. For some interpolation and recovery schemes similar to those here in higher dimensions, see [7, 29, 47]. Naturally, [26] and others consider quasi shift-invariant spaces for more general point-sets , which would eliminate this difficulty, but for the interpolation method examined here, the techniques of proof do not extend to sets which are merely quasi-uniform, though that is not to say that no such method is feasible.
Acknowledgments
The first author thanks Akram Aldroubi, Alex Powell, and Ben Hayes for many fruitful discussions involving this work. The authors also take pleasure in thanking the anonymous referee for their valuable suggestions which greatly improved this article.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Abramowitz and I. Stegun (Eds.), Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , National Bureau of Standards Applied Mathematics Series, No. 55, Courier Dover Publications, 1972.
- 2[2] A. Aldroubi, Non-uniform weighted average sampling and reconstruction in shift-invariant and wavelet spaces, Appl. Comput. Harmon. Anal. 13 (2002), 151-161.
- 3[3] A. Aldroubi and H. G. Feichtinger, Exact iterative reconstruction algorithm for multivariate irregularly sampled functions in spline-like spaces: the L p subscript 𝐿 𝑝 L_{p} theory, Proc. Amer. Math. Soc. 126 (9) (1998), 2677–2686.
- 4[4] A. Aldroubi and K. Gröchenig, Nonuniform sampling and reconstruction in shift-invariant spaces, SIAM Review , 43 (4) (2001), 585-620.
- 5[5] N. D. Atreas, On a class of non-uniform average sampling expansions and partial reconstruction in subspaces of L 2 ( ℝ ) subscript 𝐿 2 ℝ L_{2}(\mathbb{R}) , Adv. Comput. Math. 36 (1) (2012), 21-38.
- 6[6] A. Atzmon and A. Olevskii, Completeness of integer translates in function spaces on ℝ ℝ \mathbb{R} , J. Approx. Theory 87 (1996), 291–327.
- 7[7] B. A. Bailey, Th. Schlumprecht, and N. Sivakumar, Nonuniform sampling and recovery of multidimensional bandlimited functions by Gaussian radial-basis bunctions, J. Fourier Anal. Appl. 17 (3) (2011), 519-533.
- 8[8] B. J. C. Baxter, The asymptotic cardinal function of the multiquadric ϕ ( r ) = ( r 2 + c 2 ) 1 2 italic-ϕ 𝑟 superscript superscript 𝑟 2 superscript 𝑐 2 1 2 \phi(r)=(r^{2}+c^{2})^{\frac{1}{2}} as c → ∞ → 𝑐 c\to\infty , Comput. Math. Appl. , 24 (12), (1992), 1-6.
