1. A New Set of Points in the Frame Set of the 3-Spline
The Gabor frame generated by
and
is the set of functions
for which there exist
such that
for all
, see, [1] [2] for details. The mystery of the fine structure of Gabor frames [3] and application requirements have obliged many researchers to investigate the characterization of Gabor frame set for some functions having good time-frequency concentration. For example, in the hyperbolic secant functions or different splines windows [4] [5] [6], the functions satisfy the partitions of unity [7] [8] and the sign-changing functions with compact support [9] [10] [11] are already been studied. More generally, the frame set
of
is known only for a few classes of functions, see [3] [12] - [22]. For instance, the determination of the frame set of B-splines for
is listed as one of the six problems in frame theory [12]. Recently, we have investigated the frame set of a class of compactly supported functions that include the B-splines. In particular, we have extended and put in a more general framework some of the known results on the frame set for this class of functions [23].
In this paper, we investigate the set of parameters
such that
is a Gabor frame where
is the 3-spline. This set is called the frame set of
and is given by
It is not difficult to see that
. Indeed, for any
there exists
such that for all
,
[ [24], Theorem 4.18]. Furthermore,
is an open set in
[25] [26]. This is a consequence of the fact that
belongs to the modulation space
[2]. However, the complete characterization of
is still unknown.
To the best of our knowledge [1] [5] [8] [11] [23] [27] [28], the biggest subset known in
is the connected set
In this note, we complete this last subset by showing that
belongs to
where
with for
,
(1)
and
(2)
More specifically, our main result gives the frame properties on
.
Theorem 1. For
, let
. Then, the Gabor system
is a frame for
, and there is a unique dual window
such
that
. Furthermore, for each
, the Gabor system
is a frame for
.
Theorem 1 is proved by using the following well-known necessary and sufficient condition, which is well developed in [ [23], Proposition 2], for two Bessel Gabor systems to be dual of each other.
For
, let
and
. Assume that
is a bounded real-function with support on
. Then, the Gabor systems
and
are dual frames for
if and only if
(3)
We can rewrite (3) as a matrix-vector equation:
(4)
where
and
are the row vectors given respectively by
and
;
is the
matrix-valued function defined by
. Using the fact that the 3-spline
is supported by
and
; one observes easily that for all
, not only the all
’s on-diagonal entries are positive but also the matrix-valued function
can be rewritten as the following block matrix:
(5)
where
is a
matrix of 0’s,
is a
matrix,
is a
upper triangular matrix and
is the
tridiagonal matrix given by
(6)
Figure 1 shows the connected set known in
.
The rest of the paper is organized as follows. In Section 2 we prove our main results by studying the invertibility of the matrix
.
2. Invertibility of
for
To prove Theorem 1, we only need to show that (3) has a unique solution
. This is equivalent to proving respectively that the
matrix-valued function
is invertible for a.e.
. In other
Figure 1. A sketch of
. No frame property in the red region, the green region is from [29] and the yellow region is the result from [11]. The blue and the magenta regions are respectively from [28] and [27]. The cyan region is the result from [23] completed by theorem 1.
words, from the block form for the matrix
, we need to prove that the matrix
is invertible.
Throughout the paper, we use the fact that
The following lemma gives the behavior of the entries of
.
Lemma 1. For
, let
,
and consider
. Then the following hold:
1)
, for all
.
2)
for
and
for all
.
3)
and
for all
.
Proof. 1) Firstly, let
. We have
and
Therefore for all
,
. Thus
. Secondly, let
. We have
and
Then for all
,
. Thus
.
2) Let
. We have
and
Then for all
;
Therefore for all
,
and using the fact that
, we have easily
for
.
3) Let
. We have
as far as
and
Then for all
;
as far as
and
Thus
and
for
.
The following remark gives the trivial two different partitions of
which can be derived from the definition of
and will be used to compute the determinant of the matrix
.
Remark 1. a) If
and
·
, then
. Hence
where
and
with the convention that
and
.
·
, then
. Thus
where
and
with the convention that
and
.
·
for
, then
is sign-changing. So, we use both different previous partitions.
b) If
, then a is only in
. Hence
where
and
with the convention that
and
.
NB: Specially for
, one substitutes
by
. The different cases considered in proving this result are illustrated for the cases
and
in Figure 2.
Let
,
and denote
the
sub-matrix of
, defined respectively by
Figure 2. The off-diagonal of
for
and
when
.
and
The following Lemma indicates that the matrices
are invertible.
Lemma 2. Given
, let
and
. The following hold:
a) if
, then
for all
.
b)
, for all
.
This result is proved in Appendix 4.
The following Proposition gives an explicit expression for the determinant of the sub-matrix
when
,
and under the hypotheses of Theorem 1.
Proposition 1. For
, let
and
. The following statements hold:
where
and j are given in the following cases:
1) If
and
a)
, then
i) for all
,
,
,
, and
.
ii) for all
,
,
,
and
.
b)
, then for all
, one has:
i) for
,
,
, and
.
ii) for
,
,
and
.
c)
when
, then one uses i) and ii) obtained in a) or b).
2) If
, then
a) For all
,
,
,
and
.
b) For all
,
,
,
and
.
Moreover the matrix
is invertible.
Proof. We prove the result by induction on m by using the different partitions of
obtained in Remark 1. For
, the matrix
given by
Suppose that
and
, then
with
,
and
.
So, it is easy to see that for all
,
;
,
and
,
. This establishes the part (a) for the base case
.
Suppose that
and
, then
with
,
,
and
. So, it is easy to see that
where
,
, and
; and
where
,
and
. Hence (b) holds. Similarly, (2) holds.
Suppose that (1) and (2) hold for
and let us prove that they hold for m. So, one compute the determinant of the matrix
given by
Suppose
. From Remark 1, we have
with
;
, for all
;
and
, for all
.
Let
. Thus
for all
. Hence,
where
,
and
.
Let
. Therefore
and
for all
. Consequently,
where
,
and
.
Let
and
. Thus
. Hence,
and by the induction assumption, we have
where
,
and
.
Let
. Thus
for all
. Hence,
where
,
and
.
Let
and
. Then
. Thus
and by the induction assumption, we have
where
,
and
.
Together, (2) holds for the case m. Similarly, one proves that (1) holds for the case m.
To end the proof, we observe that by using the block decomposition of
, we have for all
,
We know that
,
and
because
from Lemma 2. Thus we conclude that
for all
, and by symmetry
this holds for all
.
We are now ready to prove Theorem 1.
Proof of Theorem 1. By Proposition 1 we know that
is invertible. Let
be defined on
as follows. For
, let
and for
let
be defined by
, where
and
is the mth column vector of the matrix
. Consequently,
is a compactly supported and bounded function for which
is a Bessel sequence. By construction, it also follows that
and
are dual windows.
3. Conclusion
We studied the fine structure of the Gabor frame generated by the B-spline
. It should be remembered that this structure determines all pairs
for which the Gabor system
forms a frame. We presented the known results of the Gabor frame set
and we added a new set of points in the frame set of the 3-spline while building the compactly supported dual windows of
. All our results are obtained thanks to the partitioning of the domain in which the frame set is sought. This partitioning allowed us to establish a global approach, based on the study of the invertibility of a square matrix specific to each sub-domain, and which will be used to find other points belonging to the frame set of the B-spline
.
Appendix
Consider the first-order difference
and the second-order difference
given respectively by
The following Lemma completes the Lemma 2.2 of [27] in the case of
.
Lemma 3. Let
. Then
, for all
.
Proof. By definition of the functional space
and the Lemma 2.2 in [27], it is known that
for all
.
In particular, for
or
,
while for
and
,
. In other words, to have that
on
, it suffices to show that, for
and
,
Otherwise, we only show that for
and
;
Let
. It is easy to see that for all
,
One has
et
. Thus
,
. Consequently,
as wanted.
The following Lemma shows the invertibility of the matrix
.
Lemma 4. Let
,
and
. Then
.
Proof. Let
and
denote the ijth minor of
, the determinant of the matrix obtained by removing the ith row and the jth column from
. We have respectively
(1)
and
;
(2)
and
;
(3)
.
Combining (1), (2) and (3), we have for all
,
This implies that for all
,
.
We have for all
,
and
. Thus
and
. On the other hand,
Then (1) and (2) hold.
One has
where
,
and
Let
. It is easy to remark that the function g is strictly increasing on
and
where
Consequently
.
Let
where
We obtain
because
. Consequently (3) holds.
Therefore
. Hence
.
Proof of Lemma 2. Throughout this proof, we use the Lemma 1 and Remark 1 without notify it.
(a) Let
. In the first time, we consider the matrix
given by
We prove that for all
,
. For this, we know that
and
, therefore we have two different cases.
* If
, we have
and using the strict decreasing of
on
, one has
.
* If
, then
and
Thus
and using the fact that
is symmetric around the origin and strict decreasing on
, one has
.
Next, we prove that for all
,
. We also know that
and
, therefore we can consider the following two cases.
* If
, on has
. Therefore by the strict increasing of
on
, we obtain
.
* If
, then
and
. Indeed,
Thus
and using the fact that
is symmetric around the origin and strict increasing on
, one has
.
All in all, we conclude that
for all
.
For
, we consider the matrix
given by
We know respectively that
,
,
,
and
It is easy to see that if
, then
. To end, we prove that for all
,
.
We also know that
and
, therefore we can consider the following two cases.
*If
, one has
. Therefore by the strict increasing of
, we obtain
.
*If
, then
and
. Thus
and using the fact that
is symmetric around the origin and strict increasing, one has
In the second time, we consider, for all
, the matrix
given by
For
, we have
or
and hence
Let
.
We proved previously that
for all
.
Nest, we prove that
and
.
We know for all
,
,
and
, therefore we have different following cases.
*If
, on has
. Therefore by the strict increasing of
on
, we obtain
.
*If
, then
and
. Indeed,
Therefore
and consequently we have
*If
, we have
and then
.
*If
, then
and
because
Thus
and using the fact that
is symmetric around the origin and strict decreasing on
, one has
Let us prove that
for all
.
One has
because
.
Let
. We known that
and
, therefore we have two cases.
*If
, then
and therefore
.
*If
, then
and
. Therefore
and then
Let
A direct computation shows that
Hence to have
, it suffices to show that for all
,
This means precisely that
,
which is obtained in Lemma 3.
b) Let
and consider the matrix
*If
, then
and therefore
,
or
. Thus
*If
, then
.
When
, then
or
and therefore
We finish by proving that for all
,
. We observe that for
and
, then
and for
and
, then
. So we only prove that for all
,
. Using the condition
, we consider
and
. In other words, by the Lemma 4, we have this result.