You are currently browsing the category archive for the ‘question’ category.

This is the sixth thread for the Polymath8b project to obtain new bounds for the quantity

either for small values of (in particular ) or asymptotically as . The previous thread may be found here. The currently best known bounds on can be found at the wiki page (which has recently returned to full functionality, after a partial outage).

The current focus is on improving the upper bound on under the assumption of the generalised Elliott-Halberstam conjecture (GEH) from to , which looks to be the limit of the method (see this previous comment for a semi-rigorous reason as to why is not possible with this method). With the most general Selberg sieve available, the problem reduces to the following three-dimensional variational one:

Problem 1Does there exist a (not necessarily convex) polytope with quantities , and a non-trivial square-integrable function supported on such that

- when ;
- when ;
- when ;
and such that we have the inequality

(Initially it was assumed that was convex, but we have now realised that this is not necessary.)

An affirmative answer to this question will imply on GEH. We are “within almost two percent” of this claim; we cannot quite reach yet, but have got as far as . However, we have not yet fully optimised in the above problem.

The most promising route so far is to take the symmetric polytope

with symmetric as well, and (we suspect that the optimal will be roughly ). (However, it is certainly worth also taking a look at easier model problems, such as the polytope , which has no vanishing marginal conditions to contend with; more recently we have been looking at the non-convex polytope .) Some further details of this particular case are given below the fold.

There should still be some progress to be made in the other regimes of interest – the unconditional bound on (currently at ), and on any further progress in asymptotic bounds for for larger – but the current focus is certainly on the bound on on GEH, as we seem to be tantalisingly close to an optimal result here.

This is the fifth thread for the Polymath8b project to obtain new bounds for the quantity

either for small values of (in particular ) or asymptotically as . The previous thread may be found here. The currently best known bounds on can be found at the wiki page (which has recently returned to full functionality, after a partial outage). In particular, the upper bound for has been shaved a little from to , and we have very recently achieved the bound on the generalised Elliott-Halberstam conjecture GEH, formulated as Conjecture 1 of this paper of Bombieri, Friedlander, and Iwaniec. We also have explicit bounds for for , both with and without the assumption of the Elliott-Halberstam conjecture, as well as slightly sharper asymptotics for the upper bound for as .

The basic strategy for bounding still follows the general paradigm first laid out by Goldston, Pintz, Yildirim: given an admissible -tuple , one needs to locate a non-negative sieve weight , supported on an interval for a large , such that the ratio

is asymptotically larger than as ; this will show that . Thus one wants to locate a sieve weight for which one has good lower bounds on the numerator and good upper bounds on the denominator.

One can modify this paradigm slightly, for instance by adding the additional term to the numerator, or by subtracting the term from the numerator (which allows one to reduce the bound to ); however, the numerical impact of these tweaks have proven to be negligible thus far.

Despite a number of experiments with other sieves, we are still relying primarily on the Selberg sieve

where is the divisor sum

with , is the level of distribution ( if relying on Bombieri-Vinogradov, if assuming Elliott-Halberstam, and (in principle) if using Polymath8a technology), and is a smooth, compactly supported function. Most of the progress has come by enlarging the class of cutoff functions one is permitted to use.

The baseline bounds for the numerator and denominator in (1) (as established for instance in this previous post) are as follows. If is supported on the simplex

and we define the mixed partial derivative by

then the denominator in (1) is

and

Similarly, the numerator of (1) is

Thus, if we let be the supremum of the ratio

whenever is supported on and is non-vanishing, then one can prove whenever

We can improve this baseline in a number of ways. Firstly, with regards to the denominator in (1), if one upgrades the Elliott-Halberstam hypothesis to the generalised Elliott-Halberstam hypothesis (currently known for , thanks to Motohashi, but conjectured for ), the asymptotic (2) holds under the more general hypothesis that is supported in a polytope , as long as obeys the inclusion

examples of polytopes obeying this constraint include the modified simplex

the prism

the dilated simplex

and the truncated simplex

See this previous post for a proof of these claims.

With regards to the numerator, the asymptotic (3) is valid whenever, for each , the marginals vanish outside of . This is automatic if is supported on , or on the slightly larger region , but is an additional constraint when is supported on one of the other polytopes mentioned above.

More recently, we have obtained a more flexible version of the above asymptotic: if the marginals vanish outside of for some , then the numerator of (1) has a *lower bound* of

where

A proof is given here. Putting all this together, we can conclude

Theorem 1Suppose we can find and a function supported on a polytope obeying (4), not identically zero and with all marginals vanishing outside of , and withThen implies .

In principle, this very flexible criterion for upper bounding should lead to better bounds than before, and in particular we have now established on GEH.

Another promising direction is to try to improve the analysis at medium (more specifically, in the regime ), which is where we are currently at without EH or GEH through numerical quadratic programming. Right now we are only using and using the baseline analysis, basically for two reasons:

- We do not have good numerical formulae for integrating polynomials on any region more complicated than the simplex in medium dimension.
- The estimates produced by Polymath8a involve a parameter, which introduces additional restrictions on the support of (conservatively, it restricts to where and ; it should be possible to be looser than this (as was done in Polymath8a) but this has not been fully explored yet). This then triggers the previous obstacle of having to integrate on something other than a simplex.

However, these look like solvable problems, and so I would expect that further unconditional improvement for should be possible.

This is the fourth thread for the Polymath8b project to obtain new bounds for the quantity

either for small values of (in particular ) or asymptotically as . The previous thread may be found here. The currently best known bounds on are:

- (Maynard) Assuming the Elliott-Halberstam conjecture, .
- (Polymath8b, tentative) . Assuming Elliott-Halberstam, .
- (Polymath8b, tentative) . Assuming Elliott-Halberstam, .
- (Polymath8b, tentative) . (Presumably a comparable bound also holds for on Elliott-Halberstam, but this has not been computed.)
- (Polymath8b) for sufficiently large . Assuming Elliott-Halberstam, for sufficiently large .

While the bound on the Elliott-Halberstam conjecture has not improved since the start of the Polymath8b project, there is reason to hope that it will soon fall, hopefully to . This is because we have begun to exploit more fully the fact that when using “multidimensional Selberg-GPY” sieves of the form

with

where , it is not necessary for the smooth function to be supported on the simplex

but can in fact be allowed to range on larger sets. First of all, may instead be supported on the slightly larger polytope

However, it turns out that more is true: given a sufficiently general version of the Elliott-Halberstam conjecture at the given value of , one may work with functions supported on more general domains , so long as the sumset is contained in the non-convex region

and also provided that the restriction

More precisely, if is a smooth function, not identically zero, with the above properties for some , and the ratio

is larger than , then the claim holds (assuming ), and in particular .

I’ll explain why one can do this below the fold. Taking this for granted, we can rewrite this criterion in terms of the mixed derivative , the upshot being that if one can find a smooth function supported on that obeys the vanishing marginal conditions

and

then holds. (To equate these two formulations, it is convenient to assume that is a downset, in the sense that whenever , the entire box lie in , but one can easily enlarge to be a downset without destroying the containment of in the non-convex region (1).) One initially requires to be smooth, but a limiting argument allows one to relax to bounded measurable . (To approximate a rough by a smooth while retaining the required moment conditions, one can first apply a slight dilation and translation so that the marginals of are supported on a slightly smaller version of the simplex , and then convolve by a smooth approximation to the identity to make smooth, while keeping the marginals supported on .)

We are now exploring various choices of to work with, including the prism

and the symmetric region

By suitably subdividing these regions into polytopes, and working with piecewise polynomial functions that are polynomial of a specified degree on each subpolytope, one can phrase the problem of optimising (4) as a quadratic program, which we have managed to work with for . Extending this program to , there is a decent chance that we will be able to obtain on EH.

We have also been able to numerically optimise quite accurately for medium values of (e.g. ), which has led to improved values of without EH. For large , we now also have the asymptotic with explicit error terms (details here) which have allowed us to slightly improve the numerology, and also to get explicit numerology for the first time.

This is the third thread for the Polymath8b project to obtain new bounds for the quantity

either for small values of (in particular ) or asymptotically as . The previous thread may be found here. The currently best known bounds on are:

- (Maynard) Assuming the Elliott-Halberstam conjecture, .
- (Polymath8b, tentative) . Assuming Elliott-Halberstam, .
- (Polymath8b, tentative) . Assuming Elliott-Halberstam, .
- (Polymath8b) for sufficiently large . Assuming Elliott-Halberstam, for sufficiently large .

Much of the current focus of the Polymath8b project is on the quantity

where ranges over square-integrable functions on the simplex

with being the quadratic forms

and

It was shown by Maynard that one has whenever , where is the narrowest diameter of an admissible -tuple. As discussed in the previous post, we have slight improvements to this implication, but they are currently difficult to implement, due to the need to perform high-dimensional integration. The quantity does seem however to be close to the theoretical limit of what the Selberg sieve method can achieve for implications of this type (at the Bombieri-Vinogradov level of distribution, at least); it seems of interest to explore more general sieves, although we have not yet made much progress in this direction.

The best asymptotic bounds for we have are

which we prove below the fold. The upper bound holds for all ; the lower bound is only valid for sufficiently large , and gives the upper bound on Elliott-Halberstam.

For small , the upper bound is quite competitive, for instance it provides the upper bound in the best values

and

we have for and . The situation is a little less clear for medium values of , for instance we have

and so it is not yet clear whether (which would imply ). See this wiki page for some further upper and lower bounds on .

The best lower bounds are not obtained through the asymptotic analysis, but rather through quadratic programming (extending the original method of Maynard). This has given significant numerical improvements to our best bounds (in particular lowering the bound from to ), but we have not yet been able to combine this method with the other potential improvements (enlarging the simplex, using MPZ distributional estimates, and exploiting upper bounds on two-point correlations) due to the computational difficulty involved.

This is the second thread for the Polymath8b project to obtain new bounds for the quantity

either for small values of (in particular ) or asymptotically as . The previous thread may be found here. The currently best known bounds on are:

- (Maynard) .
- (Polymath8b, tentative) .
- (Polymath8b, tentative) for sufficiently large .
- (Maynard) Assuming the Elliott-Halberstam conjecture, , , and .

Following the strategy of Maynard, the bounds on proceed by combining four ingredients:

- Distribution estimates or for the primes (or related objects);
- Bounds for the minimal diameter of an admissible -tuple;
- Lower bounds for the optimal value to a certain variational problem;
- Sieve-theoretic arguments to convert the previous three ingredients into a bound on .

Accordingly, the most natural routes to improve the bounds on are to improve one or more of the above four ingredients.

Ingredient 1 was studied intensively in Polymath8a. The following results are known or conjectured (see the Polymath8a paper for notation and proofs):

- (Bombieri-Vinogradov) is true for all .
- (Polymath8a) is true for .
- (Polymath8a, tentative) is true for .
- (Elliott-Halberstam conjecture) is true for all .

Ingredient 2 was also studied intensively in Polymath8a, and is more or less a solved problem for the values of of interest (with exact values of for , and quite good upper bounds for for , available at this page). So the main focus currently is on improving Ingredients 3 and 4.

For Ingredient 3, the basic variational problem is to understand the quantity

for bounded measurable functions, not identically zero, on the simplex

with being the quadratic forms

and

Equivalently, one has

where is the positive semi-definite bounded self-adjoint operator

so is the operator norm of . Another interpretation of is that the probability that a rook moving randomly in the unit cube stays in simplex for moves is asymptotically .

We now have a fairly good asymptotic understanding of , with the bounds

holding for sufficiently large . There is however still room to tighten the bounds on for small ; I’ll summarise some of the ideas discussed so far below the fold.

For Ingredient 4, the basic tool is this:

Thus, for instance, it is known that and , and this together with the Bombieri-Vinogradov inequality gives . This result is proven in Maynard’s paper and an alternate proof is also given in the previous blog post.

We have a number of ways to relax the hypotheses of this result, which we also summarise below the fold.

For each natural number , let denote the quantity

where denotes the prime. In other words, is the least quantity such that there are infinitely many intervals of length that contain or more primes. Thus, for instance, the twin prime conjecture is equivalent to the assertion that , and the prime tuples conjecture would imply that is equal to the diameter of the narrowest admissible tuple of cardinality (thus we conjecturally have , , , , , and so forth; see this web page for further continuation of this sequence).

In 2004, Goldston, Pintz, and Yildirim established the bound conditional on the Elliott-Halberstam conjecture, which remains unproven. However, no unconditional finiteness of was obtained (although they famously obtained the non-trivial bound ), and even on the Elliot-Halberstam conjecture no finiteness result on the higher was obtained either (although they were able to show on this conjecture). In the recent breakthrough of Zhang, the unconditional bound was obtained, by establishing a weak partial version of the Elliott-Halberstam conjecture; by refining these methods, the Polymath8 project (which I suppose we could retroactively call the Polymath8a project) then lowered this bound to .

With the very recent preprint of James Maynard, we have the following further substantial improvements:

Theorem 1 (Maynard’s theorem)Unconditionally, we have the following bounds:

- .
- for an absolute constant and any .
If one assumes the Elliott-Halberstam conjecture, we have the following improved bounds:

- .
- .
- for an absolute constant and any .

The final conclusion on Elliott-Halberstam is not explicitly stated in Maynard’s paper, but follows easily from his methods, as I will describe below the fold. (At around the same time as Maynard’s work, I had also begun a similar set of calculations concerning , but was only able to obtain the slightly weaker bound unconditionally.) In the converse direction, the prime tuples conjecture implies that should be comparable to . Granville has also obtained the slightly weaker explicit bound for any by a slight modification of Maynard’s argument.

The arguments of Maynard avoid using the difficult partial results on (weakened forms of) the Elliott-Halberstam conjecture that were established by Zhang and then refined by Polymath8; instead, the main input is the classical Bombieri-Vinogradov theorem, combined with a sieve that is closer in spirit to an older sieve of Goldston and Yildirim, than to the sieve used later by Goldston, Pintz, and Yildirim on which almost all subsequent work is based.

The aim of the Polymath8b project is to obtain improved bounds on , and higher values of , either conditional on the Elliott-Halberstam conjecture or unconditional. The likeliest routes for doing this are by optimising Maynard’s arguments and/or combining them with some of the results from the Polymath8a project. This post is intended to be the first research thread for that purpose. To start the ball rolling, I am going to give below a presentation of Maynard’s results, with some minor technical differences (most significantly, I am using the Goldston-Pintz-Yildirim variant of the Selberg sieve, rather than the traditional “elementary Selberg sieve” that is used by Maynard (and also in the Polymath8 project), although it seems that the numerology obtained by both sieves is essentially the same). An alternate exposition of Maynard’s work has just been completed also by Andrew Granville.

It’s time to (somewhat belatedly) roll over the previous thread on writing the first paper from the Polymath8 project, as this thread is overflowing with comments. We are getting near the end of writing this large (173 pages!) paper, establishing a bound of 4,680 on the gap between primes, with only a few sections left to thoroughly proofread (and the last section should probably be removed, with appropriate changes elsewhere, in view of the more recent progress by Maynard). As before, one can access the working copy of the paper at this subdirectory, as well as the rest of the directory, and the plan is to submit the paper to Algebra and Number theory (and the arXiv) once there is consensus to do so. Even before this paper was submitted, it already has had some impact; Andrew Granville’s exposition of the bounded gaps between primes story for the Bulletin of the AMS follows several of the Polymath8 arguments in deriving the result.

After this paper is done, there is interest in continuing onwards with other Polymath8 – related topics, and perhaps it is time to start planning for them. First of all, we have an invitation from the Newsletter of the European Mathematical Society to discuss our experiences and impressions with the project. I think it would be interesting to collect some impressions or thoughts (both positive and negative) from people who were highly active in the research and/or writing aspects of the project, as well as from more casual participants who were following the progress more quietly. This project seemed to attract a bit more attention than most other polymath projects (with the possible exception of the very first project, Polymath1). I think there are several reasons for this; the project builds upon a recent breakthrough (Zhang’s paper) that attracted an impressive amount of attention and publicity; the objective is quite easy to describe, when compared against other mathematical research objectives; and one could summarise the current state of progress by a single natural number H, which implied by infinite descent that the project was guaranteed to terminate at some point, but also made it possible to set up a “scoreboard” that could be quickly and easily updated. From the research side, another appealing feature of the project was that – in the early stages of the project, at least – it was quite easy to grab a new world record by means of making a small observation, which made it fit very well with the polymath spirit (in which the emphasis is on lots of small contributions by many people, rather than a few big contributions by a small number of people). Indeed, when the project first arose spontaneously as a blog post of Scott Morrrison over at the Secret Blogging Seminar, I was initially hesitant to get involved, but soon found the “game” of shaving a few thousands or so off of to be rather fun and addictive, and with a much greater sense of instant gratification than traditional research projects, which often take months before a satisfactory conclusion is reached. Anyway, I would welcome other thoughts or impressions on the projects in the comments below (I think that the pace of comments regarding proofreading of the paper has slowed down enough that this post can accommodate both types of comments comfortably.)

Then of course there is the “Polymath 8b” project in which we build upon the recent breakthroughs of James Maynard, which have simplified the route to bounded gaps between primes considerably, bypassing the need for any Elliott-Halberstam type distribution results beyond the Bombieri-Vinogradov theorem. James has kindly shown me an advance copy of the preprint, which should be available on the arXiv in a matter of days; it looks like he has made a modest improvement to the previously announced results, improving a bit to 105 (which then improves H to the nice round number of 600). He also has a companion result on bounding gaps between non-consecutive primes for any (not just ), with a bound of the shape , which is in fact the first time that the finiteness of this limit inferior has been demonstrated. I plan to discuss these results (from a slightly different perspective than Maynard) in a subsequent blog post kicking off the Polymath8b project, once Maynard’s paper has been uploaded. It should be possible to shave the value of down further (or to get better bounds for for larger ), both unconditionally and under assumptions such as the Elliott-Halberstam conjecture, either by performing more numerical or theoretical optimisation on the variational problem Maynard is faced with, and also by using the improved distributional estimates provided by our existing paper; again, I plan to discuss these issues in a subsequent post. ( James, by the way, has expressed interest in participating in this project, which should be very helpful.)

Once again it is time to roll over the previous discussion thread, which has become rather full with comments. The paper is nearly finished (see also the working copy at this subdirectory, as well as the rest of the directory), but several people are carefully proofreading various sections of the paper. Once all the people doing so have signed off on it, I think we will be ready to submit (there appears to be no objection to the plan to submit to Algebra and Number Theory).

Another thing to discuss is an invitation to Polymath8 to write a feature article (up to 8000 words or 15 pages) for the Newsletter of the European Mathematical Society on our experiences with this project. It is perhaps premature to actually start writing this article before the main research paper is finalised, but we can at least plan how to write such an article. One suggestion, proposed by Emmanuel, is to have individual participants each contribute a brief account of their interaction with the project, which we would compile together with some additional text summarising the project as a whole (and maybe some speculation for any lessons we can apply here for future polymath projects). Certainly I plan to have a separate blog post collecting feedback on this project once the main writing is done.

The main purpose of this post is to roll over the discussion from the previous Polymath8 thread, which has become rather full with comments. We are still writing the paper, but it appears to have stabilised in a near-final form (source files available here); the main remaining tasks are proofreading, checking the mathematics, and polishing the exposition. We also have a tentative consensus to submit the paper to Algebra and Number Theory when the proofreading is all complete.

The paper is quite large now (164 pages!) but it is fortunately rather modular, and thus hopefully somewhat readable (particularly regarding the first half of the paper, which does not need any of the advanced exponential sum estimates). The size should not be a major issue for the journal, so I would not seek to artificially shorten the paper at the expense of readability or content.

The main purpose of this post is to roll over the discussion from the previous Polymath8 thread, which has become rather full with comments. As with the previous thread, the main focus on the comments to this thread are concerned with writing up the results of the Polymath8 “bounded gaps between primes” project; the latest files on this writeup may be found at this directory, with the most recently compiled PDF file (clocking in at about 90 pages so far, with a few sections still to be written!) being found here. There is also still some active discussion on improving the numerical results, with a particular focus on improving the sieving step that converts distribution estimates such as into weak prime tuples results . (For a discussion of the terminology, and for a general overview of the proof strategy, see this previous progress report on the Polymath8 project.) This post can also contain any other discussion pertinent to any aspect of the polymath8 project, of course.

There are a few sections that still need to be written for the draft, mostly concerned with the Type I, Type II, and Type III estimates. However, the proofs of these estimates exist already on this blog, so I hope to transcribe them to the paper fairly shortly (say by the end of this week). Barring any unexpected surprises, or major reorganisation of the paper, it seems that the main remaining task in the writing process would be the proofreading and polishing, and turning from the technical mathematical details to expository issues. As always, feedback from casual participants, as well as those who have been closely involved with the project, would be very valuable in this regard. (One small comment, by the way, regarding corrections: as the draft keeps changing with time, referring to a specific line of the paper using page numbers and line numbers can become inaccurate, so if one could try to use section numbers, theorem numbers, or equation numbers as reference instead (e.g. “the third line after (5.35)” instead of “the twelfth line of page 54″) that would make it easier to track down specific portions of the paper.)

Also, we have set up a wiki page for listing the participants of the polymath8 project, their contact information, and grant information (if applicable). We have two lists of participants; one for those who have been making significant contributions to the project (comparable to that of a co-author of a traditional mathematical research paper), and another list for those who have made auxiliary contributions (e.g. typos, stylistic suggestions, or supplying references) that would typically merit inclusion in the Acknowledgments section of a traditional paper. It’s difficult to exactly draw the line between the two types of contributions, but we have relied in the past on self-reporting, which has worked pretty well so far. (By the time this project concludes, I may go through the comments to previous posts and see if any further names should be added to these lists that have not already been self-reported.)

## Recent Comments