Fourier uniformity of bounded multiplicative functions in short intervals on average
Kaisa Matom\"aki, Maksym Radziwi{\l}{\l}, Terence Tao

TL;DR
This paper proves a new form of Fourier uniformity for the Liouville function and other multiplicative functions in short intervals on average, extending previous results to smaller interval lengths and demonstrating significant cancellations.
Contribution
It establishes the first non-trivial local Fourier uniformity results for the Liouville function in very short intervals, improving upon prior bounds and applying to non-pretentious multiplicative functions.
Findings
Proves Fourier uniformity for $ heta > 0$ arbitrarily small.
Shows cancellations in sums involving $ ext{Liouville}$ and von Mangoldt functions.
Extends previous results from $ heta > 5/8$ to smaller scales.
Abstract
Let denote the Liouville function. We show that as , for all with fixed but arbitrarily small. Previously, this was only known for . For smaller values of this is the first `non-trivial' case of local Fourier uniformity on average at this scale. We also obtain the analogous statement for (non-pretentious) -bounded multiplicative functions. We illustrate the strength of the result by obtaining cancellations in the sum of over the ranges and , and where is the von Mangoldt function.
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
TopicsMathematical Approximation and Integration · Advanced Harmonic Analysis Research · Analytic Number Theory Research
Fourier uniformity of bounded multiplicative functions in short intervals on average
Kaisa Matomäki
Department of Mathematics and Statistics
University of Turku, 20014 Turku
Finland
,
Maksym Radziwiłł
Department of Mathematics, Caltech, 1200 E California Blvd, Pasadena, CA, 91125
and
Terence Tao
Department of Mathematics, UCLA
405 Hilgard Ave
Los Angeles CA 90095
USA
Abstract.
Let denote the Liouville function. We show that as ,
[TABLE]
for all with fixed but arbitrarily small. Previously, this was only known for . For smaller values of this is the first “non-trivial” case of local Fourier uniformity on average at this scale. We also obtain the analogous statement for (non-pretentious) -bounded multiplicative functions.
We illustrate the strength of the result by obtaining cancellations in the sum of over the ranges and , and where is the von Mangoldt function.
1. Introduction
Let denote111All the results for discussed here are also applicable to the Möbius function with only minor changes to the arguments; we leave the details to the interested reader. the Liouville function, that is, a completely multiplicative function with at all primes . Among bounded multiplicative functions, plays a distinguished role since the prime number theorem is equivalent to222Our conventions for asymptotic notation are given at the end of this introduction.
[TABLE]
as , and the Riemann Hypothesis is equivalent to
[TABLE]
A far reaching generalization of (1) is Chowla’s conjecture [4], according to which, for any sequence of distinct integers , one has
[TABLE]
as , where we adopt the convention that for . Because of the equivalence of (1) and the prime number theorem, Chowla’s conjecture is frequently viewed as a “higher order” prime number theorem.
In recent years there has been a substantial amount of progress on Chowla’s conjecture. Following the work of the first two authors [23] the authors established in [24] an averaged form333By applying Hölder’s inequality to (3), it is also possible to obtain an averaged version of (2) over all shifts ; see [24] for details. of this conjecture in the case , namely,
[TABLE]
provided that as ; see also [1, 18, 19, 26, 12, 7, 25] for some other averaged forms of Chowla’s conjecture (as well as the closely related Elliott and Hardy-Littlewood conjectures). An equivalent form of (3) (for related discussion, see [32]) states that
[TABLE]
provided that as . The estimate (4) along with the entropy decrement argument was used by the third author [31] to establish a logarithmically averaged version of Chowla’s conjecture, that is,
[TABLE]
as , for any fixed integer . Subsequently for odd , the third author and Teräväinen [34] used the entropy decrement argument and the Gowers uniformity of the (-tricked) von Mangoldt function (but avoiding the use of (4)), to show that
[TABLE]
as , for any distinct integers and odd. Their argument only partially generalizes to arbitrary multiplicative functions (see [33]); in the case of the Liouville function, it relies crucially on the assumption that is odd.
In order to establish (5) for all it is necessary to establish (the logarithmically averaged version of) what we call the local (higher order) Fourier uniformity conjecture (see [32]).
Conjecture 1.1** (Local higher order Fourier Uniformity).**
Let . Let be an -step nilmanifold. Let be Lipschitz continuous and let . Then
[TABLE]
as soon as with .
We refer to [14] for the definition of the terms above, however we will not need these notions in this paper. Informally, the conjecture asserts that on most short intervals, does not exhibit significant correlation with any -step nilsequence (of bounded complexity). The estimate (4) proven in [24] essentially corresponds to the case of Conjecture 1.1; this is currently the only case of the conjecture that is completely settled.
In this paper we make a first step in going beyond the case of and establish the case of Conjecture 1.1 when with fixed but otherwise arbitrarily small. Let us first re-state our main result for the Liouville function in a more elementary fashion.
Theorem 1.2** (Local Fourier Uniformity for at scale ).**
Let be given and set . Then
[TABLE]
as .
We restrict attention here to the regime , since the case follows from the classical work of Davenport [5] (and see [11], [13] for the and cases respectively of Conjecture 1.1 for this range of ). Informally, Theorem 1.2 asserts that on most intervals of the form , the Liouville function does not exhibit singificant correlation with linear phases ; it can easily be shown to imply the case of Conjecture 1.1 in the range by approximating the -step nilsequence by a Fourier series.
Previously, Theorem 1.2 was known unconditionally only for from the work of Zhan [36], who showed that as the bound holds pointwise in for . It is likely that our method can be pushed to reach for some , and conditionally on the Riemann Hypothesis one should in principle be able to reach for any function going to infinity arbitrarily slowly with , although this may require a more careful reworking of the arguments here. It may be possible to extend the methods to this paper to also cover the case (again with for any fixed ); we plan to investigate this direction in future work.
Theorem 1.2 allows us to obtain cancellations in rather general triple correlations such as those of the form , for sequences and for which sharp sieve majorants can be constructed. We illustrate the flavor of these results in the corollary below.
Corollary 1.3**.**
Let be given. Let . Then
[TABLE]
as .
Interestingly we are unable to obtain an asymptotic for
[TABLE]
for this range of , since this latter problem is essentially equivalent to evaluating asymptotically for almost all . The best result in this direction allows one to take with tending to zero arbitrarily slowly as . This is due to Zaccagnini [35], building on ideas of Heath-Brown [15] and Huxley [16]. Thus, Corollary 1.3 gives a rare example of a sum involving the Liouville function that becomes harder to control when the Liouville function is removed!
In a subsequent paper we will obtain variants of Theorem 1.2 and Corollary 1.3 for unbounded multiplicative functions such as the divisor function or coefficients of automorphic forms. This will improve (in the aspect) earlier results of Blomer [3] that allowed one to take in the triple correlations of the divisor function; however, in contrast to the results of [3], we will not obtain power-savings in the error terms.
Theorem 1.2 can in fact be generalized to almost all multiplicative functions with (we call such multiplicative functions -bounded). There is however one obstruction: if with for a small absolute constant and a Dirichlet character of bounded conductor , then one can check (using a Taylor expansion) that
[TABLE]
In fact for each one can set equal to for some integer coprime to , and then will typically have a mean of magnitude if is primitive.
Therefore the proper analogue of Theorem 1.2 can only hold for multiplicative functions that “do not pretend” to be any multiplicative function of the form with and of bounded conductor. To quantify this notion of “pretentiousness”, we follow Granville and Soundararajan [9] and introduce the distance function
[TABLE]
In particular is small whenever is close to with444The role of the parameter here is mostly to control the size of . It is not important that the sum over runs up to ; it could run up to for any , since primes in contribute only to the distance. and of conductor .
Our main theorem, stated below, confirms that with and of bounded conductor are essentially the only examples of -bounded multiplicative functions for which (6) can happen.
Theorem 1.4** (Main theorem).**
Let and . Let be a multiplicative function with . Suppose that, for , we have
[TABLE]
Then, for any ,
[TABLE]
for some .
Theorem 1.4 yields an analogous result to Corollary 1.3 for general multiplicative functions. Without going into full generality we highlight that the result holds for correlations and sequences , that admit sharp sieve majorants. We illustrate this principle in the corollary below.
Corollary 1.5**.**
Let . Let be a -bounded multiplicative function. Suppose that are sequences such that for all .
If
[TABLE]
with , then for any ,
[TABLE]
for some .
The claim holds also when is replaced by or by .
We give the short derivation of Corollary 1.5 from Theorem 1.4 in Section 6. It is possible to extend Corollary 1.5 to sequences or equal to a multiplicative function such that for all and a fixed integer. Since we will obtain a stronger result along these lines in a follow-up paper we do not include the details here.
It is immediate from Corollary 1.5 that given -bounded multiplicative functions , the correlations
[TABLE]
vanish asymptotically whenever at least one of the is non-pretentious in the sense that as for each . In the remaining case that all of the are pretentious, an asymptotic for the correlations, without an average over , can be obtained using the method of [20] (see also the references therein).
1.1. An overview of the proof
We now describe in some detail the main ideas behind the proof of Theorem 1.4. Our presentation here is somewhat oversimplified to avoid technical issues; the actual rigorous argument will not quite follow the outline given here, but uses essentially the same ideas, despite being arranged slightly differently to resolve these technicalities.
First we notice that, by the “analytic” large sieve inequality (or more precisely, a maximal version of this inequality due to Montgomery [28]), given an interval , there are at most values (modulo and up to perturbations by ) for which
[TABLE]
for some ; see Lemma 2.2. For sake of this informal presentation, one can pretend that in fact there is only one such value (modulo and perturbations by ). Thus, if there are two subintervals of (or of a slight dilate of ) and two frequencies obeying (7), one can pretend that
[TABLE]
Informally, the estimate (7) asserts that exhibits significant oscillation at frequency on the interval (or a large subinterval of this interval). We depict this situation schematically in Figure 1. In the schematic depictions we are pretending that if two such intervals overlap (or are very near to each other), then their associated frequencies are close modulo in the sense of (8).
At this point we point out a key example: if for some , some Taylor expansion of the phase of in reveals that one has the above inequality for some and , where denotes the starting point of . Thus, under the hypotheses of Theorem 1.4, we expect to vary in in a manner which is “inversely proportional” to the location of in some sense. The bulk of our argument is devoted to rigorously verifying some version of this expectation; the main obstacle to overcome arises from the fact that is only determined up modulo and up to perturbations by .
Next, we recall an observation of Elliott [6] that by an application of the arithmetic large sieve inequality for a big set of primes , we have, for all ,
[TABLE]
see Proposition 2.5. To make things simpler we proceed in this outline as if the approximation (9) held for all primes with and some small absolute constant . Informally, (9) asserts that if behaves like a constant multiple of for , then behaves like a constant multiple of for . Heuristically, this follows from the relationship (at least when is coprime to ). We describe the estimate (9) schematically by the diagram in Figure 2. Note that this is consistent with the previous heuristic that should be inversely proportional to the location of .
By the hypotheses of Theorem 1.4, we have some frequencies for which
[TABLE]
and hence by a pigeonhole principle argument, we can find a large () set of disjoint intervals of length in for which (7) holds (after modifying slightly). From this, (9), and the Cauchy-Schwarz inequality, we will be able to locate a large set of quadruples with and disjoint intervals of length for which
[TABLE]
and are primes for which (9) holds and such that ; see Figure 3.
Since the intervals and are nearby and the frequencies , lead to very large values of the short trigonometric polynomial supported respectively on and , we conclude from (8) that these frequencies lie (modulo and up to perturbations by ) in a bounded set of frequencies. In particular by the pigeonhole principle it follows that, for a positive proportion of disjoint intervals of length and primes of size with , we have the fundamental approximate equation
[TABLE]
relating the frequencies associated to these intervals. The number of such quadruples is , since once are chosen, is essentially determined by .
It would be nice if the congruence (11) held rather than just , as one could then profitably divide by . Fortunately, by the Chinese remainder theorem there exists a (potentially very large!) integer depending on and such that if we redefine by shifting it by , then we do indeed have
[TABLE]
or equivalently
[TABLE]
for all , with . Importantly, shifting by maintains the property (10), no matter how large is. The dependence of the integer on is a bit problematic; however let us suppose for sake of discussion that is independent of (we essentially end up achieving this through a different argument that involves two consecutive applications of the arithmetic large sieve). Then applying Cauchy-Schwarz we conclude that, for a positive proportion of intervals and primes with555More precisely, and will both intersect a third interval , but this is almost the same as requiring that these intervals intersect each other, as they are all of comparable size; see Figure 4. For sake of this discussion, we ignore this technical distinction. , we have
[TABLE]
for many primes . This is essentially the outcome of Section 3, though the argument there proceeds using a somewhat different arrangement of the above ingredients, most notably in that the prime ends up being at a different scale to the primes , and the intervals have length a bit less than (and are located at spatial scales a bit less than ). For sake of this discussion we assume that for the data as above, the relation (12) holds for all , not just for many such primes. We depict this relationship in graph theoretic language by connecting to by an edge which we label by the ratio of the primes needed to get from to (the vicinity of) by multiplication; see the dashed line in Figure 4. The resulting graph is essentially undirected (except that if one wanted to get from to one would use the label rather than ) and multiplicity-free (the ratios for are all well separated from each other, so each pair of distinct intervals may be connected by at most one such ratio).
Notice that the number of intervals and primes constructed above is ; thus the graph described above has vertices and average degree . We begin Section 4 by applying Hölder’s inequality on in a way that is motivated by Sidorenko’s conjecture (see [30]). We choose to be the first even integer for which
[TABLE]
Because of our hypotheses and , we can take to be independent of . Roughly speaking, is the first integer at which we expect to see a very large number of non-trivial cycles of length in the graph . After many applications of Hölder’s ineqality, we can conclude that, for a positive proportion of disjoint intervals of length and primes with , there exist
[TABLE]
“chains” of intervals of length and primes
[TABLE]
such that, for all ,
[TABLE]
and furthermore the approximate identities
[TABLE]
hold for all , where we adopt the cyclic conventions . The above set of relationships corresponds to two cycles of length in connected by a further edge in ; see Figure 5. The choice of is just large enough to ensure that the configuration in this figure will usually be non-degenerate in the sense that the primes that arise are all distinct for most of the configurations. Since the primes in our case are of size , it suffices to take bounded in terms of to guarantee the existence of a large number of such chains.
Notice that we can interpret each of the relationships in (14) as holding instead of by multiplying by , thus obtaining the system of equations
[TABLE]
for all . We can then use the Chinese remainder theorem to replace the congruences in (15) with where . A key point for later analysis is that is going to be extremely large (of size about ), so much so that we will eventually be able to drop the congruence altogether, once we obtain some more control on the location of the .
After applying some algebra to (15) to eliminate all frequencies except , we eventually conclude the estimates
[TABLE]
where and . The integers are small; in fact the condition (13) will give the bound . We can also assume that these integers are non-zero, because the number of intervals and primes for which could be zero is negligible. It follows then from (16), (17) that
[TABLE]
for some , , and , where the starting points of the intervals , , respectively.
Suppose now for simplicity that , so that
[TABLE]
Notice that since we have . Combining (19), (20) with (18) we obtain the key relationship
[TABLE]
since are much smaller in magnitude than , we may now drop the congruence and conclude in fact that
[TABLE]
informally speaking, this means that the map is approximately locally constant on the graph . Obtaining these quadruples with all the described properties is essentially the content of Section 4.
A Taylor expansion shows that if is as in (19), then with depending only on . Similarly for (20). Thus there exists a positive proportion set of disjoint intervals connected by an edge in such that
[TABLE]
for some with . To proceed further, we claim that the graph is essentially an “expander graph” and in particular that it has one very large and highly connected component. This is the content of Section 5.
To see this claim, notice that taking a -spaced set of values in the range , we can group the intervals into subsets of those intervals for which . Then, because many pairs of intervals connected by an edge in belong to the same , we obtain a large lower bound of the form
[TABLE]
where . That is we obtain a lower bound that corresponds to a positive proportion of disjoint intervals of length and primes such that . Now, since the exponential sum exhibits cancellations, we can (using a bit of harmonic analysis) essentially bound the above by
[TABLE]
Noticing that , we see that the above expression is in turn
[TABLE]
and therefore, combining (21) and (22), there exists a value for which . That is, there exists a universal (up to non-essential perturbations by that we can ignore) such that for a positive proportion of disjoint intervals of length we have,
[TABLE]
Averaging over such intervals it follows that, there exists such that and
[TABLE]
By the main theorem of [23] (or rather more precisely its extension to complex valued functions as in [24, Theorem A.3]) this implies that has to behave essentially as with a Dirichlet character of bounded conductor and , thus finishing the proof.
1.2. Some final remarks
It is very likely that it is possible, at the expense of additional technical difficulties, to push our argument down to for some . However we start running into difficulties when hits and our argument appears to hit a hard limit when enters the neighborhood of powers of .
The first obstruction occurs because we require the set of primes to be sufficiently dense so that at the very least . This implies that needs to be larger than .
The second obstruction which prevents from going below occurs because we require the exponential sum to exhibit cancellations for of size . This is only known for following the work of Vinogradov-Korobov. This obstruction can be circumvented (in the case of the Liouville function, at least) by assuming the Riemann Hypothesis. In that case the exponential sum will be non-trivially small provided that is a large power of the logarithm (specifically ). However, we have not verified that the remaining portions of the argument extend to this range (among other things, one would need to make more precise the dependence of various implied constants on the parameter , which now must grow with instead of being fixed).
Notational conventions.
As usual , or means that there is an absolute constant such that . If needs to depend on some parameters then we indicate this by subscripts, for instance denotes the estimate for some depending on . If we write as this means that where is a quantity that goes to zero as tends to infinity (which may make other quantities dependent on , such as , go to infinity also). We also write for .
We set . The symbol always denotes a prime, and so do . Given an interval we define . Whenever we write we mean that there exists an absolute constant such that, where denotes the distance of from the nearest integer. Similarly whenever we write we mean . Given two intervals and with , whenever we write , we mean that . If and , we write , thus for instance .
Acknowledgments.
KM was supported by Academy of Finland grant no. 285894. MR was supported by an NSERC DG grant, the CRC program and a Sloan Fellowship. TT was supported by a Simons Investigator grant, the James and Carol Collins Chair, the Mathematical Analysis & Application Research Fund Endowment, and by NSF grant DMS-1266164. Part of this paper was written while the authors were in residence at MSRI in Spring 2017, which is supported by NSF grant DMS-1440140.
2. Auxiliary results
We collect here some standard results that will be used (mostly) in section 3.
In order to use some tools from graph theory, it is convenient666It should also be possible to work in a purely continuous setting, replacing various summations in our arguments with appropriately normalized integrals, using Fubini’s theorem in place of double counting arguments, allowing the intervals under consideration to overlap each other, and with various graph-theoretic inequalities replaced by their continuous counterparts. We leave the details of this alternate arrangement of the argument to the interested reader. to replace the continuous integral in Theorem 1.4 by something more discrete. Given , define a -family of intervals to be a finite collection of intervals of length contained in , such that any pair of intervals in are separated by a distance at least ; in particular, the intervals in are disjoint, and thus the cardinality of cannot exceed .
We then have
Lemma 2.1** (Discretizing).**
Let be a sequence of complex numbers with for all integers . Let and . Suppose that
[TABLE]
Then there exist an -family of intervals of cardinality and real numbers associated to each such that, for all ,
[TABLE]
Proof.
It follows from (23) and the pigeonhole principle that there exists such that
[TABLE]
Given , let be the sub-collection of intervals with for which
[TABLE]
Let . It follows from (25) and the trivial bound , that
[TABLE]
Thus there exists an for which is an -family of intervals of cardinality . Setting , we obtain the claim. ∎
The frequency in the above proposition is not unique: one can shift it by any integer, and one can also perturb it by up to a small multiple of without significantly affecting (24). However, it turns out that modulo these freedoms, there are only a bounded number of choices for (if one views as being fixed). More precisely, one has
Lemma 2.2** (Maximal large sieve).**
Let and let be an interval of length . Let be given. Let be a sequence of complex numbers. Suppose that there exist , frequencies and sub-intervals of length at most such that
[TABLE]
for all . Assume sufficiently large depending on . Then there exist a natural number with an absolute constant and frequencies depending only on , the sequence and the interval , such that, for each , there exists with
[TABLE]
where we recall that .
Proof.
Let be the frequency that maximizes the quantity
[TABLE]
with the supremum taken over all sub-intervals of . For we define inductively as the frequency that maximizes (26) in the region . We thus obtain frequencies with a parameter to be chosen later, and moreover for .
Using the Carleson-Hunt theorem, it was proven by Montgomery [28, Theorem 2] that one has the maximal large sieve inequality777At the cost of worsening the dependence on slightly, one could also use the standard large sieve inequality [27] here, combined with Lemma 2.4 below.
[TABLE]
with an absolute constant. The right-hand side is . Choosing to be a large multiple of , it follows that there are at most frequencies for which
[TABLE]
Therefore for any lying outside of
[TABLE]
we have
[TABLE]
Our assumption is that for each with there exists an interval with for which
[TABLE]
Therefore and the claim follows. ∎
We record also the following variant of the large sieve that we will need in Section 5.
Lemma 2.3** (Variant of large sieve).**
Let and . Let be -separated (thus for all ). Then
[TABLE]
Proof.
Let be a smooth function such that for and with . Then the left-hand side of (27) is
[TABLE]
as claimed. ∎
We will also need the following tool from harmonic analysis.
Lemma 2.4** (Completion of sums).**
There exists an absolute constant such that the following holds. Let be an interval of length and complex coefficients with for all integers . Let be an interval with . Suppose that and are such that
[TABLE]
Then there exists such that and
[TABLE]
Proof.
Let be chosen so that . Let be a smooth function with for , for all integers , and compactly supported in . Moreover we can ensure that is a Schwartz function with for all and therefore with for all . Let
[TABLE]
Applying Poisson summation to and using the above bound on we see that
[TABLE]
Moreover by construction of ,
[TABLE]
We split the integral on the right-hand side into two parts, namely and the complement. We estimate the part over trivially only using the bound . On the second part we apply Cauchy-Schwarz, Plancherel and (28) to see that it is bounded by . Collecting these estimates we conclude that
[TABLE]
Therefore there exists such that and
[TABLE]
as needed. ∎
In section 3 we will frequently relate the Fourier behavior of on an interval with the behavior on dilated intervals for various primes . The key tool here is
Proposition 2.5** (Mean scales down).**
Let , and let obey the bound
[TABLE]
(thus on average on in an sense). Then
[TABLE]
In particular, by Markov’s inequality, for any we have
[TABLE]
for all primes outside of an exceptional set of primes with .
Proof.
See [6, Lemma 4.7]. ∎
We will also need the following number-theoretic estimate, in particular to dispose of some degenerate cases.
Lemma 2.6** (Counting nearby products of primes).**
Let and be such that . Write . Then the number of -tuples of primes in obeying the condition
[TABLE]
with a constant, is at most .
If we also impose the additional condition
[TABLE]
for some modulus , then the number of tuples is bounded by
[TABLE]
Proof.
Since the first claim follows from the second by specializing to it is enough to prove the second claim.
First notice that without loss of generality we can assume that since otherwise the claim is trivial by replacing products of primes by integers (i.e., using the crude bound that every integer has at most representations as a product of primes) and counting trivially.
Let be a smooth function such that for . Then, the number of primes for which (30) and (31) hold is
[TABLE]
Since and all of the are primes, we can express the congruence condition using Dirichlet characters, thus
[TABLE]
where the sum is over all Dirichlet characters of period . Using this identity and the Fourier inversion formula , we see that the expression (32) is equal to
[TABLE]
Since , the zero-free region for gives
[TABLE]
see for instance [21, Lemma 2.4]. Using this pointwise estimate it follows that
[TABLE]
To bound the part of the integral with large we notice that for arbitrary coefficients , we have the mean value theorem
[TABLE]
(see e.g., [17, Theorem 9.1]), while from the pointwise estimate we have
[TABLE]
Since
[TABLE]
where
[TABLE]
we may thus bound the part of the integral with using (33) by
[TABLE]
as required. Combining the two bounds, the claim follows. ∎
3. Intervals and frequencies
Assume we have the hypotheses of Theorem 1.4, thus there exists an such that
[TABLE]
Informally speaking, the main purpose of this section is to produce a large set of disjoint intervals , each of length comparable to some quantity (which will be slightly shorter than ), as well as associated frequencies with
[TABLE]
and a scale with the following property: For a positive proportion of quadruples with prime such that is close to we have
[TABLE]
for a positive proportion of primes in some range (compare with (12)). Moreover the ranges are all related by and . This is the content of Proposition 3.2 below. We first need a preliminary proposition.
Proposition 3.1** (Scaling down).**
Let and , and let be a -bounded multiplicative function. Assume that and are sufficiently large depending on . Suppose that there exist an -family of intervals of cardinality and a real number associated to each such that
[TABLE]
for all . Then there exist , an -family of intervals of cardinality , and a real number associated to each , such that
[TABLE]
for all . Furthermore, for each , one can find pairs , where is an interval in and is a prime in , such that lies within of , and such that
[TABLE]
The conclusions of Proposition 3.1 are depicted schematically in Figure 6.
Proof.
For each , we apply Proposition 2.5 to the function on , and with sufficiently small depending on , to conclude that
[TABLE]
for all primes outside of an exceptional set with
[TABLE]
Summing over all (recalling that this collection of intervals has cardinality at most ), we conclude
[TABLE]
From Mertens’ theorem and the pigeonhole principle, we may thus find such that
[TABLE]
Fix this quantity . If is large enough, we conclude from the prime number theorem that
[TABLE]
and thus we have (35) for pairs with and .
As is multiplicative, we have unless is a multiple of . The latter contributes at most to the left-hand side of (35), which is negligible compared to the right-hand side as (and hence ) is large. Thus we may freely replace by , and conclude that
[TABLE]
for pairs . (Compare with Figure 2.)
Let denote the collection of these pairs , and let denote the collection of all intervals of the form where . These are intervals in of length between and . By a simple greedy algorithm, we may find a subfamily of these intervals which are separated by distance at least , with the property that every interval in lies within a distance of one of the intervals in .
By (36) and Lemma 2.2, we can associate to each interval some real numbers for some , with the property that, for each pair with within of , one has
[TABLE]
for some . By adding dummy values of if necessary we may take independent of . By the pigeonhole principle, we may find such that one has
[TABLE]
for triples with and with within distance of . If we let be the collection of such triples, then one can find a subset of of cardinality with the property that for each , there are pairs with .
For , pick one of the pairs with , then from (36) we have
[TABLE]
while from (37) we have
[TABLE]
whenever with .
The interval lies in with length between and . Let be an interval in of length exactly containing . By Lemma 2.4 and (38), we have
[TABLE]
for some real number
[TABLE]
In particular
[TABLE]
whenever with .
Setting to be a -separated collection of intervals of the form with , we obtain the claim. ∎
We are now ready to prove the main result of this section.
Proposition 3.2**.**
Let , , , and . Let be a multiplicative function with . Suppose that, for , we have
[TABLE]
Let be sufficiently small depending on and , and assume is sufficiently large depending on , , and . Then there exist , an -family of intervals of cardinality , and a real number associated to each such that
[TABLE]
for all . Furthermore, there exist quadruples with distinct intervals in and distinct primes in , such that lies within of , and such that
[TABLE]
for primes .
Proof.
By Lemma 2.1, one can find -family of intervals of cardinality and a real number associated to each such that
[TABLE]
for all . Applying Proposition 3.1, one can find , an -family of intervals of cardinality , and a real number associated to each , such that
[TABLE]
for all . Furthermore, for each , one can find pairs , where is an interval in and is a prime in , such that lies within of and
[TABLE]
By a second application of Proposition 3.1, one can find , an -family of intervals of cardinality , and a real number associated to each , such that
[TABLE]
for all . Furthermore, for each , one can find pairs , where is an interval in and is a prime in , such that lies within of , and such that
[TABLE]
Also, since the are -separated, we see that each prime is associated to at most one in this fashion (for a fixed choice of ). The above situation is depicted in Figure 7.
Note that if , then one can add an arbitrary integer to each real number without affecting any of the above properties. In particular, if one adds an integer with an appropriate residue class mod , one can upgrade (41) to
[TABLE]
for any pair appearing previously. By the Chinese remainder theorem, we may thus select so that (42) holds for all pairs appearing previously.
Combining the above properties, we see that we can find quintuplets , where , , , is a prime in , is a prime in , lies within of , lies within of , and one has the equations
[TABLE]
and
[TABLE]
Multiplying the first equation by and combining with the second equation, we conclude in particular that
[TABLE]
The number of possible choices for is (trivially) at most . Applying the Cauchy-Schwarz inequality, we conclude that we can find octuplets , where
- •
, , ;
- •
are primes in , and is a prime in ;
- •
For , lies within of , and lies within of .
- •
We have
[TABLE]
and
[TABLE]
See Figure 8.
Multiplying (43) by and (44) by and then subtracting, we see that
[TABLE]
Also, lies within of and lies within of , so by the triangle inequality and lie at distance at most from each other. Hence, on dividing by , and lie at distance at most from each other. In particular, if , then , and similarly . As a consequence, the number of octuplets with this property is at most . Since and is sufficiently large depending on , the contribution of this case is thus negligible, so that there are octuplets with .
Observe that if are fixed, then are completely determined by thanks to the separation properties of and ; in particular, there are ways to complete the quadruplet to an octuplet. Similarly, is completely determined by (since there is at most one interval in that lies within from ). Thus the number of eligible quadruplets is . We conclude that there exist quadruplets , each of which can be completed to an octuplet in ways. In particular, for such a quadruplet, (45) holds for choices of (recalling that are completely determined by the remaining coefficients of the octuplet). The claim follows. ∎
4. Local structure of
We now analyse the structure of the function appearing in Proposition 3.2. The main result of this section asserts that locally behaves like with “not too large” (and up to a shift with small denominator), where denotes the left endpoint of the interval . Crucially, will not vary much with , at least “locally”. It is here that we will rely on the hypothesis that is of polynomial size in .
Proposition 4.1**.**
Let be as in Proposition 3.2. Then, for of the pairs of intervals in , there exist a natural number
[TABLE]
integers , a real number
[TABLE]
and a set of primes in of cardinality such that
[TABLE]
for . Furthermore, for each such pair, there exist primes such that lies within of , and such that
[TABLE]
Proof.
Let be as in Proposition 3.2. Thus for instance we now have . Henceforth we allow implied constants to depend on . We abbreviate
[TABLE]
for the cardinality of and for the quantity
[TABLE]
thus the number of quadruples in Proposition 3.2 is . We construct a graph whose vertices are just the intervals in (thus has vertices), and the edges are those unordered pairs for which there exist distinct primes in such that lies within of , and such that
[TABLE]
for a set of primes in of cardinality (note that these properties are symmetric in and ). Observe that the primes are uniquely determined by , for if there was another pair of primes with the same properties, then and would lie within of each other, which implies that
[TABLE]
but if then the left-hand side has magnitude at least , which leads to a contradiction if is small enough and is large enough. Thus, by Proposition 3.2, we see that the number of edges in is . On the other hand, the degree of each vertex in is , since for fixed there are only choices for and , and is uniquely determined by these choices. Thus has edges and the mean degree of is .
At present, the sets of primes associated to each edge are large, but the intersections could be small. This will cause difficulties later. To get around this problem we use a random refinement trick of Gowers [8]. Let be a prime in selected uniformly at random, and let be the subgraph of consisting of the same vertex set as , and with the edge set consisting of all edges with containing . By the prime number theorem, each edge has probability of lying in , so by linearity of expectation the expected number of edges in is . In particular, we see that with probability , the random graph has edges. Of course, has maximum degree since it is a subgraph of . As we shall see later, the advantage of working with instead of is that the intersections have a high probability of being large when are all constrained to lie in .
If is the adjacency matrix of , then by the preceding discussion we have (where denotes the all-ones column vector) with probability . By the Blakley-Roy inequality [2], we now see that for any natural number , we have with probability . That is to say, with probability , the number of -tuples in such that for is .
Now let be the first even integer for which
[TABLE]
Then (since ) we have and
[TABLE]
In particular, we may allow implied constants to depend888If one were to extend the arguments here to smaller values of , one would need to pay more attention as to the precise dependence of these constants on . on . From the preceding discussion, with probability , the number of -tuples
[TABLE]
such that for is . This situation is depicted in Figure 9.
The number of possible choices for the quadruplet is , since there are choices for , and once is fixed there are choices for . Thus by the Cauchy-Schwarz inequality, with probability , we have there are pairs of such tuples with a common quadruplet . Relabeling, we conclude999This bound also follows from the work of Sidorenko [30], as the graph consisting of two -cycles (with even) connected by an edge is one of the confirmed cases of Sidorenko’s conjecture. that with probability , the number of -tuples
[TABLE]
such that for , is , where we adopt the periodic convention for . In particular, by definition of , we have
[TABLE]
for all and . The situation is depicted in Figure 10.
Call the -tuples of the above form good, thus there are good tuples. Given a good tuple, to each edge we have (uniquely determined) primes in , such that lies within of for and ; we also have primes such that lies within of . Again, we refer the reader to Figure 10 for a depiction of these relationships. Iterating the former claim, we see that lies within from for , thus
[TABLE]
Multiplying out, we conclude that
[TABLE]
thanks to (48).
We now eliminate some degenerate cases. Suppose . Then, by the fundamental theorem of arithmetic, the are a permutation of the . By the prime number theorem, the total number of possibilities for the is then at most . By Lemma 2.6, there are choices for , and finally there are possibilities for and possibilities for . All the other are uniquely determined by this data, so the number of tuples with is
[TABLE]
which is negligible compared to thanks to (48). Thus there are good tuples for which does not vanish. Repeating this argument for , we may see that with probability , there are good tuples for which for . We will call such good tuples non-degenerate.
Another case we would like to exclude is when the set
[TABLE]
is unusually small, say
[TABLE]
for some small depending on ) to be chosen later. Define a candidate tuple to be a tuple with , for , and obeying (52) and with non-vanishing for . Observe that a tuple is a non-degenerate good tuple obeying (52) precisely if it is a candidate tuple with . In particular, the probability that a given candidate tuple is actually good is . On the other hand, from two applications of Lemma 2.6, the number of candidate tuples is at most
[TABLE]
and so, by linearity of expectation, the expected number of good tuples obeying (52) is . On the other hand, with probability we have non-degenerate good tuples. With large enough (which makes large compared with ), and setting sufficiently small depending on , we thus have with positive probability that there are non-degenerate good tuples for which
[TABLE]
Let us call such tuples very good, thus we can find a deterministic choice of such that there are very good tuples.
Henceforth is chosen deterministically as above. Let be a very good tuple, with attendant primes and for and . From (47), (53) we see that there is a collection of primes in of cardinality
[TABLE]
such that
[TABLE]
and
[TABLE]
for all , , and . For large enough, the error term is less than in magnitude; thus the nearest integer to is divisible by all the primes in , and is hence divisible by the product of all the primes. Thus
[TABLE]
for all and and similarly
[TABLE]
We multiply the former equation by and sum the telescoping series for to conclude that
[TABLE]
This implies that
[TABLE]
for , where is the non-negative integer
[TABLE]
As is non-degenerate, is strictly positive. From (51) we conclude that
[TABLE]
From (55), we may write
[TABLE]
for and some integers . Inserting this into (54), we conclude that
[TABLE]
or equivalently
[TABLE]
The left-hand side is a rational of denominator at most . Meanwhile, since has cardinality , we have
[TABLE]
for some depending on . Thus the expression is far smaller than the denominator on the left-hand side, and hence
[TABLE]
Since we can modify and by arbitrary integers without affecting the claimed properties, and are distinct, we may in fact assume without loss of generality that
[TABLE]
thus we can write for some integer , some , and for . In particular, from (56) we have
[TABLE]
for ; from (48) we thus have
[TABLE]
We can then write
[TABLE]
for some real number
[TABLE]
and we then write
[TABLE]
for some real number
[TABLE]
Inserting these equations back into (54), we obtain
[TABLE]
Since lies within of , we have
[TABLE]
and hence by (58)
[TABLE]
Combining this with (59), (57) we conclude that
[TABLE]
and thus
[TABLE]
for .
Finally, by two applications of Lemma 2.6, each pair is associated to at most very good tuples; since there are such tuples, the number of pairs that arise in this fashion is
[TABLE]
The claim follows. ∎
5. Global structure of
Proposition 4.1 gives some control on , but it is currently “local” because the parameters that arise in this control depend on the pair . Fortunately, one can use the “mixing” or “ergodicity” properties of the graph of such pairs to convert this local control to global control. To do this we first need a lemma.
Lemma 5.1** (Mixing lemma).**
Let be as in Proposition 3.2. We allow implied constants to depend on . Let be two subsets of . Then the number of quadruplets with , primes in , and lying within of is
[TABLE]
Proof.
Let be a non-negative Schwartz function whose Fourier transform is supported on . Observe that if is a quadruplet of the required form, then
[TABLE]
Thus it will suffice to bound the expression
[TABLE]
by (60). Using the Fourier inversion formula , we can write this expression as
[TABLE]
which after a change of variable can be bounded by
[TABLE]
where
[TABLE]
for and
[TABLE]
From the triangle inequality we have
[TABLE]
while from the large sieve inequality (Lemma 2.3) we have
[TABLE]
Furthermore from [22, Lemma 2] we have
[TABLE]
for . The claim now follows from the triangle inequality and the Cauchy-Schwarz inequality. ∎
Using this lemma, we have the following tool for converting local approximate constancy to global approximate constancy. The corollary will allow us to show that many of the intervals in Proposition 4.1 share essentially same values of and .
Corollary 5.2** (Approximate ergodicity).**
Let be as in Proposition 3.2. We allow implied constants to depend on . Let . Let be a metric space, and let be a radius with the property that every ball of radius can contain at most disjoint balls of radius . For each , let be a finite subset of with cardinality at most . Let be a collection of sextuples with with , and distinct primes in with lying within of . Suppose that
[TABLE]
Then either
[TABLE]
or else there exists and a collection of pairs with , , and such that
[TABLE]
and such that there are sextuples such that , both lie in .
Proof.
For technical reasons we first need to refine the set . Let be the set of all pairs with and . From (61) we have
[TABLE]
where
[TABLE]
We have . We conclude that there is a subset of with
[TABLE]
for all , such that
[TABLE]
Let be a maximal -separated net in , thus every point in lies within distance of at least one point in . From (64) and the triangle inequality we conclude that
[TABLE]
If we define
[TABLE]
and
[TABLE]
then the left-hand side of (65) is bounded by
[TABLE]
which by Lemma 5.1 is bounded by
[TABLE]
Any pair can contribute to only if is contained in . As the balls with are disjoint, we conclude that each such pair contributes to at most sets , and hence
[TABLE]
and similarly
[TABLE]
By Cauchy-Schwarz, we may thus bound the left-hand side of (65) by
[TABLE]
and hence
[TABLE]
Thus, either (62) holds, or there exists with
[TABLE]
Suppose the latter claim is true. If we now let denote the collection of those with and , then we have
[TABLE]
From (63) there exist sextuples such that . Since and , we have . Thus, if we take to be the collection of those with and , we obtain the claim. ∎
Let be as in Proposition 3.2. Let be a small quantity (depending on ) which we will specify in a moment. Inspired by Proposition 4.1, define a good quadruple to be a quadruple , where is an interval in , is a real number with
[TABLE]
is a natural number with , is coprime to , and there exists a real number with such that
[TABLE]
for a set of primes in of cardinality at least . Proposition 4.1 guarantees that once is chosen sufficiently small in terms of there exist good quadruples. Throughout we fix sufficiently small so that this holds; in particular, implied constants may now depend on in addition to .
We have some limitations on how many good quadruples can be associated to a single interval :
Proposition 5.3**.**
Let be as above, and let be an interval in . Let , and let for be a collection of good quadruples. Then there exist with the following properties:
- (i)
.
- (ii)
.
- (iii)
.
Proof.
Without loss of generality we may take . For , let be the set of primes in associated to the good quadruple . Then
[TABLE]
and . From this and the prime number theorem we conclude that for at least primes in ; this implies that there exist distinct indices such that
[TABLE]
If one writes , we then have
[TABLE]
for some . On the other hand, from (67) one has
[TABLE]
and
[TABLE]
In particular,
[TABLE]
which when combined with (68) (and noting that the denominator on the left-hand side is at most ) forces
[TABLE]
Since and are in lowest terms and in , this implies that and . Subtracting (69) from (70), we conclude that
[TABLE]
since , we conclude from (68) that
[TABLE]
and hence . The claim follows. ∎
From the above proposition and the greedy algorithm, we conclude
Corollary 5.4**.**
For each , there exists a set of triples of cardinality
[TABLE]
such that, for any good quadruple , there exists such that and
[TABLE]
On the other hand, Proposition 4.1 provides us with a large number of quadruples:
Proposition 5.5**.**
Let be as above and sufficiently large depending on and . All implied constants may depend on . Then, for of the pairs of intervals , there exist such that and , and
[TABLE]
Furthermore, for each such pair, there exist primes coprime to such that lies within of , and such that
[TABLE]
Proof.
This is almost immediate from Proposition 4.1; the main difficulty is that the integers provided by that proposition need not be coprime.
We resolve this as follows. If and , then has at most prime factors in . Thus, for each , there are at most primes that divide for some .
Proposition 4.1 provides us with pairs of intervals , together with associated primes , obeying the properties of that proposition. It could happen that or divides for some in or , but by the preceding paragraph, the number of times this can happen is at most , which is a negligible portion when is large enough. Thus for of the above pairs, or do not divide any such .
From Proposition 4.1, we have
[TABLE]
for , where . We write in lowest terms as . Then is a good quadruple and do not divide . From (46) we may thus also write in lowest terms as and still have that (72) holds. Then is a good quadruple, and the claim follows from Corollary 5.4. ∎
Let be the collection of triples with , , and coprime to , endowed with the metric101010The term is present only to keep the metric from degenerating, but otherwise plays no role in the argument; if one prefers, one could drop this term and observe that Corollary 5.2 also applies to degenerate metric spaces.
[TABLE]
and some sufficiently small constant depending on (and thus ultimately on ). Let be the collection of sextuples
[TABLE]
with , , , and distinct primes in with lying within of , with coprime to and obeying (72) and (71). In particular (for sufficiently small) we have
[TABLE]
From Proposition 5.5 we have . Applying Corollary 5.2 with , , , we conclude that there exists and a collection of quadruples with , , and such that
[TABLE]
and there are sextuples such that , both lie in .
If , then , and hence by (73) we have and
[TABLE]
From (66) we thus have
[TABLE]
At present obeys the bounds . We can improve the control on significantly.
Proposition 5.6**.**
.
Proof.
Consider the graph whose vertex set is the set as above, and whose edge set consists of pairs , in with
[TABLE]
for some and . Then by the preceding dicussion has vertices and edges, where and .
Now let be the first even integer for which
[TABLE]
Using the Blakley-Roy inequality as in Section 4, the number of -tuples
[TABLE]
such that for is . The number of possible values for the pair is . Thus by the Cauchy-Schwarz inequality, there are pairs of -tuples of the above form with matching pairs . Relabeling, we conclude that there the number of -tuples
[TABLE]
such that for is . On the other hand, we may upper bound the number of such tuples in a different way, as we will now do. Writing , we see from (72) that there are primes such that
[TABLE]
(with the periodic convention ) and such that lies within of for all . From the first claim we have
[TABLE]
while from the second claim we have
[TABLE]
by repeating the derivation of (51). By Lemma 2.6, the number of tuples of primes obeying these constraints is . There are choices for , and this interval and the tuple of primes determine all the other . Since all the sets have cardinality , we conclude that the number of -tuples under consideration is
[TABLE]
Comparing the upper and lower bounds yields
[TABLE]
and the claim follows. ∎
From (67), (75) we see that whenever , one has
[TABLE]
for some . Since each is associated to quadruples in , we conclude from (74) that for intervals , one has (77) for some .
Let be one of these intervals, so that (see (40))
[TABLE]
Let . We may translate by any shift of size at most without affecting this estimate. Averaging over such shifts, we conclude that
[TABLE]
and thus by the triangle inequality
[TABLE]
From (77), (76) and Taylor expansion, we have
[TABLE]
The contribution of the is negligible, thus
[TABLE]
Recalling and Proposition 5.6, we can apply a Fourier decomposition
[TABLE]
where and ranges over Dirichlet characters of modulus . From the triangle inequality, we thus have
[TABLE]
Summing over the intervals , we conclude that
[TABLE]
By the triangle inequality, there thus exist and such that
[TABLE]
Writing with and we obtain by the triangle inequality
[TABLE]
where means that all the prime factors of are also prime factors of . Since there exists an natural number such that,
[TABLE]
Therefore by [24, Proposition A.3] we have for some and . Therefore for some and as claimed.
6. Proof of Corollary 1.5 and Corollary 1.3
Now we prove Corollary 1.5 and Corollary 1.3. It is enough to prove the former corollary since, for any fixed and , we have as by the Vinogradov-Korobov zero-free region [29, §9.5].
We restrict attention to the correlation for , as the other two correlations are handled similarly. The proof proceeds along classical lines by noticing that
[TABLE]
where
[TABLE]
Notice that
[TABLE]
We now claim the bound
[TABLE]
If then this bound follows from [10, Proposition 4.2]. On the other hand if for all integers , then, by Hölder’s inequality,
[TABLE]
The general case now follows from the triangle inequality. Similarly for . Therefore,
[TABLE]
and finally,
[TABLE]
Thus,
[TABLE]
Therefore if the left-hand side of is , then,
[TABLE]
for some absolute constant . Hence, for some , one has,
[TABLE]
Now the claim follows from Theorem 1.4.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Balog. The prime k 𝑘 k -tuplets conjecture on average. In Analytic number theory (Allerton Park, IL, 1989) , volume 85 of Progr. Math. , pages 47–75. Birkhäuser Boston, Boston, MA, 1990.
- 2[2] G. R. Blakley and P. Roy. A Hölder type inequality for symmetric matrices with nonnegative entries. Proc. Amer. Math. Soc. , 16:1244–1245, 1965.
- 3[3] V. Blomer. On triple correlations of divisor functions. Bull. Lond. Math. Soc. , 49(1):10–22, 2017.
- 4[4] S. Chowla. The Riemann hypothesis and Hilbert’s tenth problem . Mathematics and Its Applications, Vol. 4. Gordon and Breach Science Publishers, New York-London-Paris, 1965.
- 5[5] H. Davenport. On some infinite series involving arithmetical functions. ii. Quart. J. Math. Oxf. , 8:313–320, 1937.
- 6[6] P. D. T. A. Elliott. Probabilistic number theory. I , volume 239 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Science] . Springer-Verlag, New York-Berlin, 1979. Mean-value theorems.
- 7[7] N. Frantzikinakis and B. Host. Asymptotics for multilinear averages of multiplicative functions. Math. Proc. Cambridge Philos. Soc. , 161(1):87–101, 2016.
- 8[8] W. T. Gowers. A new proof of Szemerédi’s theorem for arithmetic progressions of length four. Geom. Funct. Anal. , 8(3):529–551, 1998.
