Optimal arithmetic structure in exponential Riesz sequences
Itay Londner

TL;DR
This paper characterizes the optimal growth rates of arithmetic progressions within Riesz sequences of exponential functions on sets of positive measure, revealing a unique classification based on these rates.
Contribution
It introduces a unique classification of sets based on the maximal growth rate of arithmetic progression steps in Riesz sequences.
Findings
Sets of positive measure have a unique class determined by the growth rate of arithmetic progressions in Riesz sequences.
Every set admits Riesz sequences with arithmetic progressions of length N and step proportional to N.
Partial geometric descriptions of these classes are provided.
Abstract
We consider exponential systems for . It has been shown by Londner and Olevskii in [9] that there exists a subset of the circle, of positive Lebesgue measure, so that every set \Lambda which contains, for arbitrarily large N, an arithmetic progressions of length N and step , , cannot be a Riesz sequence in the space over that set. On the other hand, every set admits a Riesz sequence containing arbitrarily long arithmetic progressions of length N and step . In this paper we show that every set of positive measure belongs to a unique class, defined through the optimal growth rate of the step of arithmetic progressions with respect to the length that can be found in Riesz sequences in the…
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.
Optimal arithmetic structure in exponential Riesz sequences
Itay Londner
Department of Mathematics, University of British Columbia, Vancouver, BC, Canada V6T 1Z2
Abstract.
We consider exponential systems for . It has been previously shown by Londner and Olevskii in [9] that there exists a subset of the circle, of positive Lebesgue measure, so that every set which contains, for arbitrarily large , an arithmetic progressions of length and step , , cannot be a Riesz sequence in the space over that set. On the other hand, every set admits a Riesz sequence containing arbitrarily long arithmetic progressions of length and step .
In this paper we show that every set of positive measure belongs to a unique class, defined through the optimal growth rate of the step of arithmetic progressions with respect to the length that can be found in Riesz sequences in the space . We also give a partial geometric description of each class.
Key words and phrases:
Riesz sequences, Arithmetic progressions
2000 Mathematics Subject Classification:
Primary 42C15; Secondary 42A38
The author would like to thank Alexander Olevskii for suggesting this project, and to Izabella Łaba, Malabika Pramanik and Josh Zahl for numerous useful conversations on the subject of this paper. The author would also like to express his gratitude to the anonymous referees of this paper for their thorough remarks and suggestions.
1. Introduction
1.1. Preliminaries
Let be a bounded set of positive Lebesgue measure (), and a uniformly discrete set. The exponential system is called a Riesz sequence in (we denote ) if there exist positive constants such that
[TABLE]
for every finite sequence of coefficients .
Any constant satisfying the left inequality in will be called a lower Riesz bound for in .
The problem of determining the exact relationship between sets of frequencies and their corresponding spectra, in general, is very difficult. Heuristically, it can be stated that for a fixed spectrum , the more dense a set of points is, the harder it becomes to verify that it is a Riesz sequence. Analogously, for a fixed set of frequencies , the more complicated the structure of the spectrum, and the smaller its measure, the less likely it is for to be a Riesz sequence for this spectrum. In past years, a large body of work has been dedicated to the analysis of the interplay between and (see, for instance, [5, 13, 15] and the references therein). Below we survey some of the most relevant results.
Throughout this paper, unless stated otherwise, we will always assume is a subset of the circle group , which will be identified with the interval , and . Also, in various places, and will denote absolute constants which might be different from one another, even within the same line.
1.2. Density
The case where is an interval is classical. In order to verify that is indeed a Riesz sequence in , one essentially needs to know the upper Beurling density of .
Theorem** (Kahane, [6]).**
Let If
[TABLE]
then , while if then it is not.
For arbitrary sets of positive (and finite) measure, the situation is much more complicated and only a necessary condition exists.
Theorem** (Landau, [7]).**
Let If then .
1.3. Simultaneous Riesz sequences
With regards to the Riesz sequence property it is only natural to ask whether there exists a set such that simultaneously for all subsets of positive measure. We call such sequences simultaneous Riesz sequences. By Landau’s necessary condition, it is clear that such sets must have zero upper density.
Zygmund essentially proved the following
Theorem** ([16]).**
Let be a Hadamard lacunary sequence, i.e. for some we have
[TABLE]
then is a simultaneous Riesz sequence.
Later, this result has been further generalized (see [12]).
1.4. Riesz sequences with positive density
Since a Riesz sequence cannot be too dense, one may ask whether a given set admits a Riesz sequence such that has positive density. This question may be considered under various notions of density. Bourgain and Tzafriri, as a consequence of their “restricted invertibility” theorem, answered this question positively proving
Theorem** ([1]).**
Every set of positive measure admits a Riesz sequence , , with positive asymptotic density
[TABLE]
where is an absolute positive constant, independent of .
1.5. Syndetic Riesz sequences
An even stronger notion is the following; we say that a set is syndetic if , for some .
Given a set , Lawton proved ([8]) that the existence of a syndetic Riesz sequence is equivalent to the Feichtinger conjecture for exponentials. The Feichtinger conjecture in its general form has been proved by Casazza et al ([4]) to be equivalent to the Kadison-Singer problem. The latter has been solved recently by Marcus, Speilman and Srivastava ([11]), and so the existence of syndetic Riesz sequences holds unconditionally.
It should be mentioned that the aforementioned solution was used in [2] to prove the existence of a syndetic Riesz sequence with a sharp asymptotic bound on the the quantity .
1.6. Riesz sequences and arithmetic progressions
In this paper we restrict our attention to the situation in which the set of frequencies contains arbitrarily long arithmetic progressions. More accurately, suppose that for some increasing sequence , one can find and such that
[TABLE]
What can be said about the different sets for which is, or is not a Riesz sequence in ?
Remark*.*
From hereon, given an arithmetic progression, we will denote by its length, and its step by .
Since every set admits a Riesz sequence of positive density, in particular, it follows from Szemeredi’s theorem ([14]) that this set contains arbitrarily long arithmetic progressions. We emphasize that the existence of Riesz sequences containing arbitrarily long arithmetic progressions may also be proved independently, we leave it as an exercise for the curious reader.
On the other hand Miheev proved
Theorem** ([12]).**
Given a set which contains arbitrarily long arithmetic progressions, there exists a set of positive measure such that , i.e. cannot be a simultaneous Riesz sequence.
In case grows slowly with respect to , one can choose the set independently of . This question was considered initially by Bownik and Speegle who gave a quantified version of this result.
Theorem** ([3]).**
There exists a set such that is not a Riesz sequence in whenever contains arithmetic progressions of length and step
[TABLE]
Later, using a different approach, this was improved by Londner and Olevskii.
Theorem 1** ([9]).**
There exists a set such that if a set contains arithmetic progressions of length and step , , then is not a Riesz sequence in .
It should be mentioned that the set in Theorem 1 was constructed independently of the choice of , and with arbitrarily small measure of the complement.
As indicated earlier, every set of positive measure admits a Riesz sequence containing arbitrarily long arithmetic progressions. It had been asked in [9] what can be said about the growth rate of with respect to in those systems? By Theorem 1 we know that, in general, cannot grow sublinearly. In [9] it was proved that Theorem 1 is essentially sharp.
Theorem 2** ([9]).**
Given a set of positive measure, there exists a set such that is a Riesz sequence in , and for infinitely many ’s contains an arithmetic progression of length and step .
Theorem 2 was proved by explicitly constructing the set , which takes the form
[TABLE]
for some specially chosen increasing sequence (depending on ) and translations , so in reality we have here .
We note that the latter results were considered in the multidimensional setting as well (see [10]).
2. Results
2.1. The classes
Theorems 1 and 2 suggest that one can distinguish between subsets of the circle through Riesz sequences containing arbitrarily long arithmetic progressions. The goal of this paper is to show that this phenomenon occurs at every scale, i.e. every set admits an optimal asymptotic growth rate which controls the step in any arithmetic progression of a given length in Riesz sequences over that set. To this end we define the following classes of sets.
Definition**.**
Let . We say that a measurable set belongs to the class , if admits a Riesz sequence such that contains, for infinitely many ’s, an arithmetic progression of length and step .
It follows directly from the definition that for all . We observe that by Theorem 2, the class contains all measurable subsets of the circle. When combined with Theorem 1, it implies that is nonempty. Also, by a trivial argument, the class contains all sets with nonempty interior (but not only those).
When , which inclusions are proper? Can we, in fact, separate these classes from one another?
Our main result answers this question positively.
Theorem 3**.**
For any we have is nonempty.
Such set would admit a Riesz sequence containing arbitrarily long arithmetic progressions of length and step , but any system for which the step in arithmetic progressions of length in grow at a rate bounded by cannot be Riesz sequences in . We prove Theorem 3 by explicitly constructing a set which admits a Riesz sequence having the desired properties. It is important to emphasize that the set constructed in the proof of Theorem 3 can be chosen to have arbitrarily small measure of the complement, independently of .
2.2. On the structure of sets in
Theorem 3 suggests that the arithmetic structure that can be found inside a Riesz sequence can help to sort subsets of the circle. It is therefore in our interest to obtain a description of the structure of sets in a given class. This is done using the following
Definition**.**
Given a set with and a positive integer , we define the -th multiplicity function associated with
[TABLE]
Our next result conveys the idea that some type of order inside a set is reflected in another type of order in Riesz sequences this set admits.
Theorem 4**.**
Given a set with and . If there exist constants , which might depend on , such that for infinitely many values of , the -th multiplicity function satisfies
[TABLE]
then . Moreover, if then this condition is also necessary.
Here means .
Simply put, a set satisfies condition with a fixed if for infinitely many values of and for every , up to some exceptional set of small measure, contains a -proportion of the arithmetic progression of length and step , passing through .
3. The classes
The proof of Theorem 3 is composed of 3 parts. In the first part, we generalize our construction from Section 3 in [9], constructing the set . In the second, we show that this set does not belong to any of the “lower” classes, i.e. when . In the third part, we prove that it does belong to .
Since the case has already been covered in [9], we restrict to .
3.1. Construction of the set
We start by generalizing the construction from [9]. Let , and define
[TABLE]
where will be a fixed constant, chosen so that .
For every set
[TABLE]
and let -periodic extension of , i.e.
[TABLE]
We also define
[TABLE]
and see that
[TABLE]
Observe that by definition we may identify with the following union
[TABLE]
considered as a subset of . Since the sequence is decreasing, it is easily seen that in the definition of , considering the union , any of the sets may be replaced by a set , where and
[TABLE]
In some cases the sets would be easier to handle. We prove
Lemma 5**.**
* for any .*
Proof.
Fix and let be such that one can find arbitrarily large for which
[TABLE]
with some , and
[TABLE]
Recall that by we have if and only if . Since lies inside the complement of , we get
[TABLE]
[TABLE]
Next we set , so . Moreover, for every we have , hence, by and the fact that for we get
[TABLE]
where the last inequality holds for every for which holds. It now follows from the choice of that the last term can be made arbitrarily small, and so is not a Riesz sequence in . ∎
3.2. Uniting blocks
In this section we lay out a basic, yet rather useful, principle that enables the construction of Riesz sequences containing arbitrarily long arithmetic progressions. Whenever this principle will be applied, it will always lead to the conclusion that some countable union of finite arithmetic progressions, which we sometimes refer to as "blocks", form a Riesz sequence over some set.
We require the following lemma.
Lemma 6** ([9], Lemma 8).**
Let , with and finite sets of integers such that is a lower Riesz bound in for , . Then for any there exists such that the system is a Riesz sequence in with lower Riesz bound .
Given a countable collection of finite sets with a common lower Riesz bound, positioning them distant enough from one another, we can take their union while keeping the Riesz sequence property.
Corollary 7**.**
Let with and be a collection of finite sets of integers. Suppose that is a Riesz sequence in , with lower Riesz bound for all . Then there exists a sequence of integers such that the system , where , is a Riesz sequence in with lower Riesz bound .
Proof.
By induction. Take .
Suppose we have chosen such that for
[TABLE]
the corresponding exponential system has lower Riesz bound .
Note that and are both finite sets satisfying the assumptions of Lemma 6 with . It follows that we can find such that is a Riesz sequence in with lower Riesz bound .
For the upper Riesz bound, i.e. the right inequality of . Since and , this inequality holds with and so is indeed a Riesz sequence in with the desired lower bound. ∎
3.3. Proving
By Corollary 7, in order to prove Theorem 3 it’s enough to prove the following
Lemma 8**.**
Let and . For , the set constructed in section 3.1, there exist and , both depending on and , such that for every prime , the exponential system is a Riesz sequence in with lower Riesz bound . Here we define
[TABLE]
Throughout this section, and will be fixed. Let be the constant chosen in Section 3.1, and let
[TABLE]
so that has spectrum in . We prove Lemma 8 by bounding from above each of the integrals
[TABLE]
separately. Given that our estimates sum up to a quantity smaller than 1 (in fact, it will depend on and ), we will write
[TABLE]
For convenience we shall denote the characteristic function of the set . Notice that since is a -periodic function, we have
[TABLE]
We will require the following lemmas.
Lemma 9**.**
Given and a prime number , we have
[TABLE]
Proof.
For we write
[TABLE]
We use the following key observation: considering the change of variables as above, we notice that if, as in (3.2), we identify as a subset of which is a union of disjoint intervals (counting as one interval), each of length , and centered at points . We get that is a subset of composed of disjoint intervals, each of length , and centered at points .
Since the mapping from to itself defined by is an isomorphism (this is so since is invertible ), residues modulo are mapped to themselves under this mapping and so we conclude that there exists a permutation of such that and
[TABLE]
Since is a trigonometric polynomial of period , we get
[TABLE]
By the definition of as a permutation we have
[TABLE]
We notice that the collection of intervals in covers every point of the circle at most times. Indeed let , since all the intervals are of the same length and their centers are evenly spaced on the circle, we have
[TABLE]
[TABLE]
From this we get
[TABLE]
summing over all in the current range, we get
[TABLE]
[TABLE]
∎
Denote .
Lemma 10**.**
Given and , there exists such that for any prime number we have
[TABLE]
The proof of the Lemma 10 will be divided to two cases: and . We begin with some intuition. Write
[TABLE]
by the same reasoning as we had for the previous range of ’s, since for all we have , we can conclude that
[TABLE]
where
[TABLE]
Notice that the sets may overlap, and so one way of estimating the integrals in the above sum is by bounding, for every , the number of sets to which belongs. We will show that when this number is bounded independently of , i.e. every belongs to at most of the sets , and depends only on . While for we shall prove that even though this number depends on , it grows slow enough to allow control over the latter sum. Moreover, when note that
[TABLE]
This observation should serve as an intuitive justification for Lemma 11 below.
In addition, for every the intervals forming the set are pairwise disjoint, that is
[TABLE]
Indeed holds if and only if
[TABLE]
which holds for all . Moreover, the following holds true.
Lemma 11**.**
Let and set . Then for all
[TABLE]
we have .
Proof.
Fix and let satisfy . First notice that
[TABLE]
Next, the sets and are disjoint if and only if for all with , for , we have
[TABLE]
since is a positive integer, it’s enough to verify
[TABLE]
By plugging the assumption , we get that
[TABLE]
and the last inequality holds true whenever
[TABLE]
∎
As a corollary, we can break the range into finitely many sub-ranges, so that within every sub-range the sets are pairwise disjoint.
Corollary 12**.**
Let . Then there exist positive integers , and a sequence satisfying
- (1)
for all primes 2. (2)
so that for every and every satisfying , the sets and are disjoint.
Proof.
Fix . We prove Corollary 12 by iterating Lemma 11, setting
[TABLE]
one can explicitly compute
[TABLE]
Since we may take . We get as a consequence that the sequence is monotonically increasing and clearly property is satisfied for all primes , given that is sufficiently large. Since grows, roughly, as a geometric sequence we can deduce there exists such that . ∎
Proof of Lemma 10, .
In order to get an estimate on the contribution of the sets when varies through , we write
[TABLE]
where
[TABLE]
By Corollary 12
[TABLE]
Taking into consideration the change of variables we deduce
[TABLE]
∎
When , we need the following.
Definition**.**
Given , for every and we denote by the function that counts the number of pairs of integers satisfying
[TABLE]
where , and .
The counting function will help us estimate the overlap of the sets as explained above.
Lemma 13**.**
Let . Then there exists such that
[TABLE]
Proof.
Fix . Note that for any two fractions where , , for and we have
[TABLE]
Hence the maximal number of pairs with and which satisfy (3.11) is at most
[TABLE]
When summing over all dyadic intervals the lemma follows. ∎
We are now ready to finish the proof of Lemma 10.
Proof of Lemma 10, .
Going back to the sum from (3.7)
[TABLE]
we wish to apply the estimate from Lemma 13. Since if and only if there exists with such that
[TABLE]
and that last inequality holds for all . Lemma 13 now implies
[TABLE]
[TABLE]
Observe that
[TABLE]
which hold for . ∎
Remark*.*
It is evident that the bound attained from Lemma 13 can be used when , but what we have actually proved for this case is that the counting function is uniformly bounded in both and .
The remaining range, , will be broken down to two parts. We write
[TABLE]
[TABLE]
[TABLE]
Lemma 14**.**
Given , for any prime we have
- •
**
- •
**
Proof.
Starting with the second sum, we notice that if , in the second term of we have and in and , hence
[TABLE]
which, by , implies that and so
[TABLE]
This also applies when and . Indeed, assuming without loss of generality that , we have only if
[TABLE]
with some . Since does not divide it must divide , in which case with some , and
[TABLE]
But this is not possible since while . It follows that
[TABLE]
as required. ∎
Last, the triangle inequality and Cauchy-Schwarz inequality give the estimate
[TABLE]
which holds for any measurable set , any , sequence of scalars and sequence of real numbers .
Corollary 15**.**
Given , for any prime number we have
[TABLE]
Proof.
For and , applying (3.16) we get
[TABLE]
[TABLE]
[TABLE]
∎
We are now in a position to finish the proof of Lemma 8.
Proof of Lemma 8.
We gather all our estimates (3.6), (3.10), (3.12), (3.14), (3.15) and (3.17), which hold for all primes , we finally have
[TABLE]
[TABLE]
[TABLE]
Therefore given and , if we choose sufficiently large, we can find some positive constant which is a lower Riesz bound for in , for all primes . By Corollary 7, we indeed get that . ∎
4. The multiplicity function
In this section we prove a structural sufficient condition to be a member of the class . Given and , we again use an -normalized polynomial
[TABLE]
so that has spectrum in .
Proof of Theorem 4, the case .
Fix , . Let be a set of all positive integers for which (2.1) holds, and let . We set and notice that
[TABLE]
making a change of variables we get
[TABLE]
clearly we can write
[TABLE]
applying the estimate (3.16) we can bound the last term
[TABLE]
Plugging in the assumption (2.1), we get
[TABLE]
This implies that for all , the exponential system has lower Riesz bound . Corollary 7 now gives . ∎
For the class we have a complete characterization in terms of the multiplicity function.
Lemma 16**.**
Given , the exponential system is a Riesz sequence in if and only if
[TABLE]
Remark*.*
Lemma 16 can also be deduced from [5], Theorem 7.2.3. Below we give an alternative proof.
Proof.
Suppose for some . This implies that for almost every point one can find such that
[TABLE]
Now, take any positive integer and consider which is a -periodic function and so
[TABLE]
By (4.2) we have
[TABLE]
and so is a Riesz sequence in .
For the other direction, suppose for some . This means that there exists a set of positive measure such that for all we have
[TABLE]
Let and find such that the polynomial
[TABLE]
satisfies
[TABLE]
This is possible due to the fact that the function vanishes at almost every point of . Since is arbitrary we deduce that is not a Riesz sequence in . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Bourgain and L. Tzafriri, Invertibility of “large” submatrices with applications to the geometry of Banach spaces and harmonic analysis . Israel J. Math. 57 (1987), 137-224.
- 2[2] M. Bownik and I. Londner, On syndetic Riesz sequences , Israel J. Math. (2019). https://doi.org/10.1007/s 11856-019-1903-5
- 3[3] M. Bownik and D. Speegle, The Feichtinger conjecture for wavelet frames, Gabor frames and frames of translates , Canad. J. Math. 58 (2006), 1121-1143.
- 4[4] P.G. Casazza, M. Fickus, J.C. Tremain and E. Weber, The Kadison–Singer problem in mathematics and engineering: a detailed account, In: Operator Theory, Operator Algebras, and Applications, Contemp. Math. 414, Amer. Math. Soc., Providence, RI, 2006, 299–355.
- 5[5] O. Christensen, An introduction to frames and Riesz bases. Vol. 7. Boston: Birkhäuser, 2003.
- 6[6] J-P. Kahane, Sur les fonctions moyenne-périodiques bornées , Ann. Inst. Fourier (Grenoble) 7 (1957), 293-314.
- 7[7] H.J. Landau, Necessary density conditions for sampling and interpolation of certain entire functions , Acta Math. 117 (1967), 37-52.
- 8[8] W. Lawton, Minimal sequences and the Kadison-Singer problem , Bull. Malaysian Math. Sci. Soc. 33 (2010), 169-76.
