Discrete analogues of maximally modulated singular integrals of Stein-Wainger type
Ben Krause, Joris Roos

TL;DR
This paper establishes -bounds for a discrete maximal operator with oscillatory phases, extending Stein-Wainger type results to the integer lattice and addressing a question by Lillian Pierce.
Contribution
It introduces a discrete analogue of Stein-Wainger maximal operators with nonlinear phases and proves -bounds, a novel result in the discrete setting.
Findings
Proved -bounds for the discrete maximal operator ()
Extended Stein-Wainger results to the integer lattice setting
Addressed and answered a question posed by Lillian Pierce
Abstract
Consider the maximal operator where is a positive integer, a Calder\'on-Zygmund kernel and . This is a discrete analogue of a real-variable operator studied by Stein and Wainger. The nonlinearity of the phase introduces a variety of new difficulties that are not present in the real-variable setting. We prove -bounds for , answering a question posed by Lillian Pierce.
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.
Taxonomy
TopicsAdvanced Harmonic Analysis Research · Holomorphic and Operator Theory · Analytic Number Theory Research
Discrete analogues of maximally modulated singular integrals
of Stein–Wainger type
Ben Krause
BK: Department of Mathematics, King’s College London, WC2R 2LS, UK
and
Joris Roos
JR: Department of Mathematical Sciences, University of Massachusetts Lowell, USA
& School of Mathematics, The University of Edinburgh, Scotland, UK
(Date: February 15, 2021)
Abstract.
Consider the maximal operator
[TABLE]
where is a positive integer, a Calderón–Zygmund kernel and . This is a discrete analogue of a real-variable operator studied by Stein and Wainger. The nonlinearity of the phase introduces a variety of new difficulties that are not present in the real-variable setting. We prove –bounds for , answering a question posed by Lillian Pierce.
2010 Mathematics Subject Classification:
42B15, 42B20, 42B25
1. Introduction
Let and be positive integers and a homogeneous Calderón-Zygmund kernel on , taking the form
[TABLE]
where is a smooth function on that is homogeneous of degree zero. We also assume that , where denotes the surface measure on the sphere . Consider the following operator acting on functions ,
[TABLE]
where and . This is a discrete analogue of a maximal operator studied by Stein and Wainger [13]. We also refer to as a discrete Carleson operator. This is motivated by the formal resemblance to Carleson’s operator given by the presence of a supremum over the modulation parameters . However, we stress that the (substantial) difficulties encountered in the analysis of the present operator are of a fundamentally different nature than those encountered in the analysis of Carleson’s operator. The nonlinearity of the phase causes a number of new challenges arising from a curious fusion of number–theoretic and analytic phenomena which are not present in the real–variable case. We refer to the introduction of [5] for further discussions motivating the study of this operator and to [10], [11] for background and recent progress on some other related discrete analogues in harmonic analysis. The following is our main result.
Theorem 1.1**.**
There is a constant such that
[TABLE]
The constant only depends on and .
The case was the subject of a question posed by Lillian Pierce during a 2015 workshop at the American Institute of Mathematics. We build on key partial progress previously obtained in [5], where a restricted supremum was considered.
The specific choice of the phase in (1.1) and the assumptions made on the kernel are imposed primarily in favor of simplicity. Various extensions for other phase functions could be topics for further investigation. Another interesting problem is to prove bounds for , which will be a topic in a forthcoming sequel to this paper, [6].
Structure of the paper. In §2 we introduce some basic facts and notations used throughout the proof. The most substantial of these are certain known exponential sum estimates from [12].
In §3 we give the proof of Theorem 1.1. The basic strategy follows that of [5], splitting the multiplier into a number–theoretic approximate (’major arcs’) and an error term (’minor arcs’). This approach goes back to Bourgain [2] and can be viewed as an instance of the Hardy–Littlewood circle method. The proof involves four distinct components, which (with a slight abuse of terminology) we refer to as ‘Minor arcs I/II’ and ’Major arcs I/II’.
In §4 (’Minor arcs I’) we perform a preliminary argument to reduce the set of modulation parameters .
In §5 (’Minor arcs II’) we estimate the error terms from a number–theoretic approximation of the multipliers. This is a standard argument using the fundamental theorem of calculus (which only becomes possible after the crucial reduction from §4). This is already featured in [5].
In §6 (’Major arcs I’) we handle the number–theoretic component of the main contribution to the multiplier by exploiting exponential sum estimates. A somewhat unanticipated dichotomy appears here between the cases and .
In §7 (’Major arcs II’) we handle the full supremum by combining the number–theoretic component with a delicate multi-frequency analysis similar to [5]. A new aspect is that we make crucial use of a numerical inequality (see (2.3)) that also appeared in recent works of Mirek and Trojan and Mirek, Stein and Trojan [9], [10], [11].
This allows us to avoid the use of versions of Bourgain’s logarithmic multi-frequency lemma [2] and variation-norm estimates from [3], which could be used to give an alternative argument (as suggested by a remark in [5]). Avoiding the use of Bourgain’s lemma is desirable in view of extensions beyond .
Acknowledgements. J.R. is grateful to Shaoming Guo for many useful conversations about this problem. The authors thank Shaoming Guo and Pavel Zorin-Kranich for pointing out an oversight in a previous preprint version of this paper, and the anonymous referee for a careful reading of the paper and numerous suggestions that have led to improvements of the exposition.
2. Preliminaries
We write to denote existence of a constant such that , where the admissible dependencies of the constant will be specified, or clear from context. Throughout the text we allow constants to depend on the ambient dimension , the degree and the kernel . Similarly, signifies that both, and . The notation stands for . Moreover, we write to express that
2.1. Fourier transforms on , , and transference
For Fourier transforms of functions , we use the notations
[TABLE]
[TABLE]
Here . A function that satisfies for all will be called periodic and be silently identified with the corresponding function on .
For a function we write
[TABLE]
[TABLE]
In particular, Fourier transforms on or will be denoted by the same symbols unless the distinction is not clear from context, or is emphasized for other reasons.
For a bounded periodic function we denote by , the associated Fourier multiplier acting on , defined as
[TABLE]
We slightly abuse notation and also write for the Fourier multiplier acting on , defined as
[TABLE]
Let be a family of bounded functions supported on a fundamental domain of (such as a translate of the unit cube ) and denote their periodizations by
[TABLE]
We will make use of the following transference principle.
Lemma 2.1**.**
Suppose that for some constant ,
[TABLE]
Then
[TABLE]
where the implicit constant only depends on .
The proof of this fact is standard (see [2, Lemma 4.4]; there in the case , but the argument also works also for ).
2.2. Some notation and
For a function we denote by the operator defined formally by
[TABLE]
Then the operator is formally given by , where the kernel is
[TABLE]
2.3. Kernel decomposition
Let be a smooth function on supported in with and for every , where . Decompose
[TABLE]
with and for . Then for all and all ,
[TABLE]
2.4. A numerical inequality
We record a Rademacher-Menshov-type numerical inequality that was also crucially used in [10] (Lemma 2.3 there): for complex numbers we have
[TABLE]
for every integer with . This follows from an appropriate decomposition of the interval into dyadic intervals, see [7, 9].
2.5. Exponential sum estimates
Given integers at least one of which is non–zero we often use the notation for the greatest common divisor of . It will be clear from context whether refers to the greatest common divisor, or the vector of the integers . For a positive integer we use the notation
[TABLE]
The letter always denotes a positive integer throughout the text. By a reduced rational we mean a fraction with and . For a positive integer , and real coefficients we define the polynomial
[TABLE]
where denotes a multiindex. A key ingredient will be the following exponential sum estimate, due to Stein and Wainger [12, Proposition 3].
Proposition 2.2**.**
Let , a smooth function on such that and for all , and a convex set contained in the ball of radius centered at the origin. Then for every there exists only depending on such that the following holds: for every with the property that for some with there exists a reduced rational such that
[TABLE]
we have
[TABLE]
where the constant only depends on , , .
2.6. Approximation of the multipliers
For , and we define the multipliers
[TABLE]
This defines a periodic function both in and . Following Bourgain [2], the starting point for our arguments is an appropriate approximation for the value of when and are close to rationals with small denominator. To formulate the result, we define the exponential sums
[TABLE]
for rationals , with (note that this condition makes well–defined).
By Proposition 2.2 there exists so that
[TABLE]
The following observation will be crucial at various points in the proof of Theorem 1.1.
Lemma 2.3**.**
Suppose that , and . Then .
We postpone the standard proof of this to the end of this section. Next, we define the real–variable versions of the multipliers by
[TABLE]
At this point we record the following standard oscillatory integral decay estimate in the spirit of van der Corput’s lemma:
[TABLE]
For the proof we refer to [13, Proposition 2.1]. This estimate does not enter in the proof of the approximation result in this section, but will be important later on. Our basic approximation result for the multipliers now reads as follows.
Lemma 2.4**.**
Let be positive integers with . Let with . Further, assume that , are such that
[TABLE]
where . Then
[TABLE]
where the implicit constant depends only on .
The proof is similar to that of the corresponding statement in [2] (see Lemma 5.12 there).
Proof of Lemma 2.4.
Writing with , , we can express as
[TABLE]
where
[TABLE]
It suffices to show that for every and every with
[TABLE]
we have the relation
[TABLE]
The integral on the right–hand side of (2.11) equals
[TABLE]
which in turn can be split as
[TABLE]
In this display it holds that
[TABLE]
since , and . Similarly,
[TABLE]
Using also that , this yields that (2.12) is
[TABLE]
Finally, note from (2.2) that
[TABLE]
Then we see that (2.13) can be written as
[TABLE]
which establishes (2.11). ∎
Proof of Lemma 2.3.
Let . Write and . Then
[TABLE]
[TABLE]
Since and , there must exist such that is not divisible by . But that implies ∎
3. Proof of Theorem 1.1
To prove the theorem, we need to obtain an bound for the maximal operator
[TABLE]
where is defined in (2.4). A first observation is that for each fixed ,
[TABLE]
by the triangle inequality, Young’s convolution inequality and (2.2). As a consequence, we may in the following assume that , where is a sufficiently large constant depending on and .
Before we proceed, we give a rough description of what will be done. For this purpose, we will be deliberately vague when using the terms ’small’ and ’close’. At this point, the reader should imagine these terms as being relative to appropriate fractional powers of , which might differ at each occurrence and will have to be chosen carefully in the sequel. Roughly speaking, the approximation (2.10) tells us what is when and are close to rationals with small denominator. On the other hand, Proposition 2.2 tells us that is small if any of is not close to a rational with small denominator. This naturally leads to a decomposition of into two new functions. The first arises from summing the main contributions over a suitable collection of rational with small . In the terminology of the Hardy–Littlewood circle method, these are the major arcs. The second function is an error term, which will subsume both the approximation error from (2.10) and the minor arcs, i.e. the cases when at least one of is not close to one of the chosen rationals. This decomposition is stated below as (3.6). Following this approach naively already leads to a fundamental problem: the error term crucially depends on , but we know only little more about it except that its absolute value is small. This leaves us with few strategies to handle the maximal operator corresponding to the error term. This was one of the reasons for the restriction on the parameters imposed in [5]. By a preliminary argument on the multiplier , we may discard ’most’ parameters : as long as we discard sufficiently close to a rational with sufficiently small denominator, the argument yields summable decay in (see Proposition 3.1 below). For each , this only leaves contained in a union of a few small intervals (see (3.2) below). This allows us to bound the remaining maximal operator for the error term by a standard argument using the fundamental theorem of calculus, the crucial size information on the error and a crude –derivative estimate (see Proposition 3.2 below). We proceed with the precise estimates.
3.1. Decomposition of the multiplier and minor arcs
Define
[TABLE]
[TABLE]
where is a small fixed number that will be determined depending on and . Observe that the union in (3.2) is disjoint. The argument alluded to above yields the following result.
Proposition 3.1**.**
There exists only depending on , , such that for all ,
[TABLE]
The proof can be seen as somewhat parallel to that of Stein–Wainger [13] and is given in §4. From now on we can restrict our attention to the multipliers . In order to define the major arc approximations we need to set up some notation. For a positive integer define
[TABLE]
Fix a smooth radial function on with that is supported in and equal to one on . For and we write . Further define for with ,
[TABLE]
where is given by
[TABLE]
From the definition of it is clear that is periodic in and . Also note that if (where ), then . Define
[TABLE]
Next, the function is defined as the difference of and so that
[TABLE]
From the definitions, and are periodic in and and vanish unless .
Proposition 3.2**.**
If the constant is chosen small enough (depending only on and ), there exists depending on , , such that for all ,
[TABLE]
The proof is given in §5. The basic idea is that the absolute value of should be small (two reasons to believe this are Lemma 2.4 and Proposition 2.2) and its –derivatives are not too large. The structure of then allows us to effectively deploy the fundamental theorem of calculus to deal with the supremum over .
3.2. Major arcs
It now remains to bound the maximal operator associated with the multiplier
[TABLE]
where we have set
[TABLE]
The proof of Theorem 1.1 will be completed if we can exhibit such that for all ,
[TABLE]
We now begin with the definition of some auxiliary sets of rationals:
[TABLE]
[TABLE]
[TABLE]
By definition,
[TABLE]
and
[TABLE]
Also note that if . Fix a smooth radial function with that equals to one on (and hence on the support of ) and is supported in . Set . Given a bounded function on we define the periodic multipliers
[TABLE]
[TABLE]
A crucial observation is the factorization
[TABLE]
which holds because for each , there is at most one so that . The kernel associated with the multiplier (3.10) is given by
[TABLE]
[TABLE]
where . With this notation in mind we write the multiplier in question as
[TABLE]
where we have set
[TABLE]
and is the unique element of such that (say), or an arbitrary value from the complement of if no such exists (in this case, anyways). Here, uniqueness of such follows because two distinct rationals with denominators must be at least apart. In view of (3.14) and the factorization (3.12) it is reasonable to begin with the following number-theoretic estimate.
Proposition 3.3**.**
There exists depending on such that for every
[TABLE]
This will be proved in §6 by making use of exponential sum estimates. The factorization (3.12) invites us to consider the companion maximal operator
[TABLE]
Using Bourgain’s multi-frequency lemma and the variational estimates from [3] it is possible to show that this maximal operator has operator norm (the proof is omitted in this paper, because this claim will not be needed). However, it is technically not straightforward to combine this result with Proposition 3.16 to treat the maximal operator associated with (3.14). Instead, we take a different route that relies on the numerical inequality (2.3) and a theorem of Stein and Wainger [13]. The following proposition is proved in §7.
Proposition 3.4**.**
The constant can be chosen small enough depending on and so that there exists depending on such that for every ,
[TABLE]
This establishes (3.8) and thereby Theorem 1.1.
4. Minor arcs I: Proof of Proposition 3.1
Since the output only depends on the values of in a –neighborhood of the point , a standard localization argument allows us to assume that is supported in the set . Fix an arbitrary function and write
[TABLE]
where
[TABLE]
Then the kernel of is given by
[TABLE]
[TABLE]
Note that unless
[TABLE]
Let and be determined later and define
[TABLE]
Lemma 4.1**.**
The constants and can be chosen depending on such that for every it holds that
[TABLE]
Before proving this statement we show how it can be used to finish the proof of Proposition 3.1. By definition of ,
[TABLE]
With (4.3) this implies
[TABLE]
By the Cauchy–Schwarz inequality we have
[TABLE]
which by (4.4) and duality leads to
[TABLE]
with . It remains to prove Lemma 4.1.
In fact we will prove something stronger: the claim is that after choosing and suitably, we have for every fixed that
[TABLE]
In other words, each –slice of has small cardinality. By Fubini’s theorem and (4.2) this implies the claimed inequality (4.3).
For future reference, we will be more careful with explicit constants than strictly necessary in this proof. The reader can safely ignore all constants only depending on in the estimates that follow. Fixing , we define
[TABLE]
Set .
Claim. The numbers and can be chosen such that the following holds: for every there exists a reduced rational with such that
[TABLE]
Proof.
Note that the coefficient of in the phase of (4.1) is equal to . By Dirichlet’s approximation theorem, there exists a reduced rational with such that
[TABLE]
Applying Proposition 2.2 (with ) we may choose and (depending on the choice of ) so that (because ). Dividing through by yields the claim. ∎
From now on we fix and to make the statement in the claim valid. We will also assume , where is a large constant depending only on that will be determined later. Our goal is now to show that . Arguing by contradiction, we assume that
[TABLE]
It is clear that
[TABLE]
We now exploit the three properties (4.6), (4.7), (4.8) to prove that , which establishes the required contradiction. First, we claim that there exist such that
[TABLE]
Indeed, suppose that all elements of were pairwise separated by at least . Then, by (4.8) we would have , which contradicts (4.7). Consequently, there must exist such that (4.9) holds. By (4.6) there exist reduced rationals with and
[TABLE]
[TABLE]
Then,
[TABLE]
where is a reduced rational with
[TABLE]
With (4.10) we have already obtained a somewhat decent rational approximation for . However, to conclude , we need to show that the approximation is actually tighter by almost another factor of on the right–hand side (see (3.2)). Denote the set of reduced rationals with and by . Then for each we define
[TABLE]
where . By (4.6), we have . Since also , the pigeonhole principle and (4.7) imply that there exists such that
[TABLE]
Now we invoke the pigeonhole principle again in the following form (this step can be skipped if ): for positive integers with , cover a set with intervals, each of length . One of the intervals, call it , must satisfy . Writing and we then have . Applying this fact to our situation with , , and , we exhibit so that for large enough,
[TABLE]
By definition of there exist integers such that
[TABLE]
[TABLE]
This implies, using the lower bound in (4.12), that
[TABLE]
We claim that
[TABLE]
Indeed, suppose not. Then, from (4.12) and (4.11),
[TABLE]
On the other hand, from (4.10) and (4.13),
[TABLE]
for large enough. This yields a contradiction (again, for large enough). Thus, (4.14) holds. Summarizing, we have proved that
[TABLE]
for large enough (from (4.14) and (4.13)). Further, and for large enough . Recalling that we set , this means precisely that .
Remarks. 1. The argument simplifies slightly in the case : in place of the upper bound in (4.12), the trivial upper bound would be sufficient.
- From the proof it is clear that the factor appearing in (4.3) is not sharp. However, this is not relevant for our discussion.
5. Minor arcs II: Proof of Proposition 3.2
We will make use of the following fact.
Lemma 5.1**.**
Let be a disjoint union of intervals with , and a family of bounded periodic functions on such that
[TABLE]
the function , is absolutely continuous for a.e. and every , and
[TABLE]
Then
[TABLE]
The proof is via a standard argument using the fundamental theorem of calculus which we postpone to the end of this section. In order to apply Lemma 5.1 to the multipliers we will prove that
[TABLE]
for some only depending on (in particular, not depending on the choice of ) and all , . Moreover, we have directly from the definitions (3.6), (3.3), (2.7), (2.4) that for a.e. and every ,
[TABLE]
Then Lemma 5.1 (with , , , ) gives
[TABLE]
Thus we obtain the claimed decay in as long as . We turn our attention to proving (5.3).
Assume (otherwise ). Fix (this can be replaced by any sufficiently small absolute constant with ). We define the major arcs
[TABLE]
[TABLE]
We need the following disjointness statement for the neighborhoods of the rationals involved in the sum defining .
Lemma 5.2**.**
For each there exists at most one with for some such that
[TABLE]
If that is the case and also , then
[TABLE]
(Otherwise, .)
Proof.
Fix . Take such that (5.6) holds. Suppose that . Then
[TABLE]
This is a contradiction. Thus, . Write , with and , . By Lemma 2.3 and (5.6) we have and . But since , this implies and thus . Taking another look at (5.6) we see that (by inspecting the support of ). The claim about follows from the claim we just proved and (3.5), (3.3). ∎
The proof of (5.3) naturally splits into several cases.
Case 1:
Then there exist and such that . From Lemma 2.4 (with , ) we gather that
[TABLE]
We distinguish two further cases.
Case 1.1:
From Lemma 5.2 we deduce
[TABLE]
With (5.7) this gives
[TABLE]
Case 1.2:
We may write , with , . In particular, .
We claim that we must have . Indeed, suppose . Since , there exists a reduced rational with and
[TABLE]
Since , the reduced rationals and do not coincide. Therefore,
[TABLE]
This is a contradiction. Thus we must have and so by Lemma 2.3. In particular, by (5.7). Also, from Lemma 5.2 we see that .
Case 2:
In this case we bound
[TABLE]
and estimate the two terms on the right–hand side separately.
Fix and set . By Dirichlet’s approximation theorem there exist reduced fractions with , and
[TABLE]
Setting , we must have because . Thus at least one of must be (otherwise which is a contradiction because ). By Proposition 2.2 we then obtain
[TABLE]
It remains to estimate . Suppose that . Then, by Lemma 5.2 there exists for some such that
[TABLE]
Then Since ,
[TABLE]
With (2.8) and (5.8), this implies
[TABLE]
Proof of Lemma 5.1.
By the fundamental theorem of calculus, we have for absolutely continuous ,
[TABLE]
Hence,
[TABLE]
[TABLE]
By the Cauchy–Schwarz inequality and Fubini’s theorem,
[TABLE]
[TABLE]
Combining this with (5.9) and using Plancherel’s theorem with the assumptions (5.1), (5.2) we obtain the claim.
Remark. Observe that the same argument works for with and more general families of operators. ∎
6. Major arcs I: Proof of Proposition 3.3
Note that since , we may restrict the supremum to , without loss of generality. Also, from (3.13) we have
[TABLE]
where . Note that . For an arbitrary function we define
[TABLE]
Then Proposition 3.3 is a consequence of the following.
Proposition 6.1**.**
There exists depending only on such that
[TABLE]
with the implicit constant only depending on and , but not on the functions . (The notation is defined in (2.1).)
Remark. The proof shows that the same result holds with replaced by for every (with decay rate depending on ).
For every there exist and with such that
[TABLE]
For the proof we will employ a –argument. We begin by computing the kernel of . Note that where
[TABLE]
From (6.1),
[TABLE]
[TABLE]
Next we claim that for every with it holds that
[TABLE]
To see this, define a Schwartz function on by
[TABLE]
Then
[TABLE]
where we used the notation . From the definitions of and we then have for that unless . However, and imply . Hence, by the Poisson summation formula the left–hand side of (6.2) is equal to
[TABLE]
As a consequence,
[TABLE]
where we set
[TABLE]
For the following computation we fix and write
[TABLE]
for short. As a consequence of Lemma 2.3, we may assume and read the sum over in (6.4) as running over the set
[TABLE]
which is equal to
[TABLE]
where we have set . Thus,
[TABLE]
Expanding the exponential sums by (2.5), we can rewrite this as
[TABLE]
which, in view of the relation , is equal to
[TABLE]
Inspection of this exponential sum reveals several scenarios in which no cancellation can be expected. For instance, a typical case where (6.5) exhibits no cancellation is when , and is divisible by (then ). Additional degeneracies arise in the case , requiring a more careful analysis. For we define
[TABLE]
In the case it will suffice to exploit cancellation from the exponential sum (6.6), whereas in the case we will sometimes need to make use of cancellation from the sum over in (6.5).
The case
Viewing the phase in (6.6) as a polynomial in , the coefficient of is equal to This leads us to define
[TABLE]
By sorting modulo and counting divisors of we see that for and every ,
[TABLE]
If , then Proposition 2.2 (with , crucially using ) yields
[TABLE]
for some sufficiently small depending on and . Using the triangle inequality on the sum over in (6.5) leads to the estimation
[TABLE]
where we have removed the –dependence of by summing over all divisors of . Hence, recalling (6.3), we see for every that
[TABLE]
where denotes the number of divisors of . Using the standard divisor bound , (6.7) and rapid decay of , we obtain
[TABLE]
for every . Since also , we infer from Schur’s test that
[TABLE]
This concludes the proof of Proposition 6.1.
The case
First assume that Then . Viewing the phase in (6.5) as a polynomial in , the coefficient of is which equals a reduced rational with denominator in . Thus, applying Proposition 2.2 to the exponential sum over yields
[TABLE]
for a small enough . Next we handle the case that . We will exploit cancellation from the summation over in (6.5). The exponential sum on the right–hand side of (6.6) factors into one–dimensional sums. It will be enough to estimate the first factor, which is given by
[TABLE]
where with . We are led to distinguish two cases. Suppose that . Then, since also , we may apply Proposition 2.2 to obtain
[TABLE]
for some small enough . On the other hand, assume . Then, by reorganizing the summation modulo ,
[TABLE]
where . Summing the geometric sum over and using the triangle inequality on the sum over we get
[TABLE]
where . Note that depends on both and . To remove the dependence on we define for a positive integer the set
[TABLE]
Let and . Let be a complete residue system modulo . Then is also a complete residue system modulo . Thus
[TABLE]
Since , we then have for every and ,
[TABLE]
Define
[TABLE]
Then if , we gather from (6.6), (6.9), (6.10), (6.11) that
[TABLE]
and for every and ,
[TABLE]
The fact that we have chosen the exceptional set only depending on (as opposed to both and ) allows us to recycle the crude argument using Schur’s test seen in the case . Indeed, summarizing the above we have shown that (6.8) again holds for all with defined as in (6.12) (and small enough, possibly different from above). This completes the proof of Proposition 6.1.
7. Major arcs II: Proof of Proposition 3.4
Before we begin with the proof we collect some preliminary results. First note from (3.13) that for every bounded function on ,
[TABLE]
where denotes modulation by (and must denote convolution on , since is only defined on ). The factorization (3.12) will allow us to prove the following consequence of Proposition 3.3.
Lemma 7.1**.**
Let be a countable set and a family of bounded functions on . Then there exists such that for every ,
[TABLE]
Observe that Proposition 3.3 is the special case , . We also need the following result which can be seen as a variant of Lemma 7.1 (in the case ) for maximally truncated singular integrals.
Lemma 7.2**.**
For let be a mean zero function supported on so that there exists a constant with
[TABLE]
for all and . Write
[TABLE]
Then there exists so that for all ,
[TABLE]
Here the implicit constant depends only on and (necessarily) denotes the Fourier transform on .
The proofs of Lemma 7.1 and Lemma 7.2 are postponed to §7.4 and §7.5, respectively. We now begin with the proof of Proposition 3.4. The maximal operator in question can be bounded by
[TABLE]
where is a large constant.
Motivated by phase considerations, we introduce a frequency scale parameter to partition the scales for every fixed as
[TABLE]
where means . Note that has at most one element and is often empty. Define
[TABLE]
Let be a large positive constants that is to be determined later. We distinguish three cases
[TABLE]
[TABLE]
[TABLE]
and bound the norm of (7.4) accordingly by
[TABLE]
It remains to bound these three summands separately, which is the content of the next three subsections.
7.1. The high frequency case:
This is the easiest case. Here . From Stein and Wainger’s theorem [13] we see
[TABLE]
for some . Since for some , we may choose large enough so that the trivial bound , the triangle inequality on the summation over and a transference argument using Lemma 2.1 yield that the first summand in (7.5) is for some .
7.2. The intermediate frequency case:
First note that , so we may consider the terms for each fixed separately. The arguments differ slightly depending on the sign of with the terms for being the more problematic ones. Set . We begin estimating
[TABLE]
by
[TABLE]
Let denote an appropriately compactly supported, smooth and non-negative function so that and . With so that we define
[TABLE]
The definition is made so that and satisfies favorable estimates that will be stated below (also see [5, Lemma 3.22]). Observe that (there is also decay in but we will only need that later on). We now estimate (7.6) by the sum of
[TABLE]
and
[TABLE]
We begin with handling the latter term. Since we can bound (7.8) by
[TABLE]
as long as is chosen small enough so that (which is possible, since the choice of is independent of that of ). Expanding into a telescoping sum
[TABLE]
we bound (7.9) by
[TABLE]
Using Lemma 7.1 for the first term and Lemma 7.2 for the second term we see that the previous display is as required.
It remains to estimate the main term (7.7). The uncertainty principle suggests that the value of stays approximately constant as varies over an interval of length . This motivates the following standard argument (similar to §5). Define with , set and define
[TABLE]
The set has cardinality . For every differentiable function we have by the fundamental theorem of calculus,
[TABLE]
Using this with
[TABLE]
we bound (7.7) by
[TABLE]
[TABLE]
Applying Lemma 7.1, we see that (7.7) is with
[TABLE]
To show that we will use the following estimates. Let and . If , then for all ,
[TABLE]
If , then for all ,
[TABLE]
These estimates imply that . Both estimates follow from direct computation using the definitions. We indicate some of the details for the term . The term satisfies the same estimates and is handled in the same way. First suppose that . If , we use van der Corput’s lemma which gives . Moreover, for all using integration by parts. If , then integration by parts gives for all . Also using rapid decay of the Schwartz function we obtain the claim. If , we use , the mean value theorem and the estimate . It remains to consider (7.12). Suppose that . If , we argue in the same way as before using the mean value theorem. If , integration by parts and rapid decay of give as required.
7.3. The low frequency case:
The third summand in (7.5) can be written as
[TABLE]
where and is the largest integer so that . Using the triangle inequality, the previous display is
[TABLE]
where and
[TABLE]
Using the definition of we obtain , where denotes the discrete Hardy–Littlewood maximal function. Choosing , this takes care of the first term in (7.14), while the second term is handled by an application of Lemma 7.2 (setting for ).
7.4. Proof of Lemma 7.1
By (3.12),
[TABLE]
From Proposition 3.3 we obtain so that for every and ,
[TABLE]
Using (3.11) and Parseval’s identity,
[TABLE]
Summing over and using disjointness of the supports of the functions for different we have
[TABLE]
[TABLE]
which by definition of (and disjointness again) is
[TABLE]
7.5. Proof of Lemma 7.2
From the assumptions we have the standard estimate
[TABLE]
for all . We distinguish two cases: either or . Here is a large constant (to be determined).
Case I: . Using the numerical inequality (2.3), we bound by
[TABLE]
plus
[TABLE]
By Lemma 7.1 the maximal operator associated with the second term has operator norm as required. Hence, we are left with having to estimate
[TABLE]
for every fixed . By Lemma 7.1 this quantity is
[TABLE]
which in turn is by (7.15). This concludes the proof for Case I.
Case II: . Here we will exploit the enormous magnitude of the spatial scale . The argument is vaguely similar to the proof of Cotlar’s inequality for maximally truncated Calderón–Zygmund operators. By subtracting a Calderón–Zygmund operator (leading to a term that no longer involves a supremum over and is handled directly by Lemma 7.1) it suffices to consider
[TABLE]
Let denote a non-negative Schwartz function on with and . Write . We claim that it suffices to estimate
[TABLE]
where . To see this we consider
[TABLE]
This is majorized by
[TABLE]
which by Lemma 7.1 is
[TABLE]
From (7.15) and the definition of one derives
[TABLE]
which concludes the proof of the claim. Thus it remains to bound (7.17). Using (7.1) and band-limitedness of we write
[TABLE]
where the convolutions are in and .
Denote the least common multiple of all integers in the interval by . By choosing large enough we may achieve that if , then
[TABLE]
Then is small compared with the spatial scale of and this allows us to compare (7.17) favourably with the averaged version
[TABLE]
The resulting difference term can be handled by the mean value theorem and using that . More specifically, given we brutally estimate
[TABLE]
[TABLE]
Since , the previous display is (say)
[TABLE]
where denotes the discrete Hardy–Littlewood maximal function.
It now remains to estimate (7.19). Expanding the norm and changing variables we write the square of (7.19) as
[TABLE]
Changing variables and using periodicity ( is divisible by the denominator of for all ) this becomes
[TABLE]
Having decoupled and we arrive at the pointwise estimate
[TABLE]
[TABLE]
Applying the bound for , changing variables back and using Lemma 7.1 finishes the estimate.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. I. Arkhipov, V. N. Chubarikov, A. A. Karatsuba. Trigonometric sums in number theory and analysis. Translated from the 1987 Russian original. De Gruyter Expositions in Mathematics, 39. Berlin, 2004.
- 2[2] J. Bourgain. Pointwise ergodic theorems for arithmetic sets. Inst. Hautes Études Sci. Publ. Math. , (69):5–45, 1989. With an appendix by the author, Harry Furstenberg, Yitzhak Katznelson and Donald S. Ornstein.
- 3[3] S. Guo, J. Roos, P.-L. Yung. Sharp variation-norm estimates for oscillatory integrals related to Carleson’s theorem. Analysis & PDE 13(5):1457–1500, 2020.
- 4[4] A. D. Ionescu, S. Wainger. L p superscript 𝐿 𝑝 L^{p} boundedness of discrete singular Radon transforms. J. Amer. Math. Soc. , 19(2):357–383, 2006.
- 5[5] B. Krause, M. Lacey. A discrete quadratic Carleson theorem on ℓ 2 superscript ℓ 2 \ell^{2} with a restricted supremum. Int. Math. Res. Notices , (10):3180–3208, 2017.
- 6[6] B. Krause, J. Roos. Discrete analogues of maximally modulated singular integrals of Stein–Wainger type II. Preprint, forthcoming.
- 7[7] A. Lewko, M. Lewko. Estimates for the square variation of partial sums of Fourier series and their rearrangements. J. Funct. Anal. 262(6):2561–2607, 2012.
- 8[8] M. Mirek. Square function estimates for discrete Radon transforms. Analysis & PDE 11(3):593–608, 2018.
