This should be the final thread (for now, at least) for the Polymath8 project (encompassing the original Polymath8a paper, the nearly finished Polymath8b paper, and the retrospective paper), superseding the previous Polymath8b thread (which was quite full) and the Polymath8a/retrospective thread (which was more or less inactive).

On Polymath8a: I talked briefly with Andrew Granville, who is handling the paper for Algebra & Number Theory, and he said that a referee report should be coming in soon. Apparently length of the paper is a bit of an issue (not surprising, as it is 163 pages long) and there will be some suggestions to trim the size down a bit.

In view of the length issue at A&NT, I’m now leaning towards taking up Ken Ono’s offer to submit the Polymath8b paper to the new open access journal “Research in the Mathematical Sciences“. I think the paper is almost ready to be submitted (after the current participants sign off on it, of course), but it might be worth waiting on the Polymath8a referee report in case the changes suggested impact the 8b paper.

Finally, it is perhaps time to start working on the retrospective article, and collect some impressions from participants. I wrote up a quick draft of my own experiences, and also pasted in Pace Nielsen’s thoughts, as well as a contribution from an undergraduate following the project (Andrew Gibson). Hopefully we can collect a few more (either through comments on this blog, through email, or through Dropbox), and then start working on editing them together and finding some suitable concluding points to make about the Polymath8 project, and what lessons we can take from it for future projects of this type.

### Like this:

Like Loading...

*Related*

## 86 comments

Comments feed for this article

20 June, 2014 at 5:17 am

Andrew V. SutherlandI just made a final pass of Appendix A and caught a couple of minor typos that I fixed in tuples.tex — I did not recompile newergap.pdf, so the fixes will not be visible until this is done. I also double checked the bounds in Theorems 1.4 and 3.3, and they all look good. For my part I’m happy with the paper as it stands.

As far as the journal goes, Research in the Mathematical Sciences is fine by me. I don’t think they will have any issues with the length of the paper, and as a new journal I expect the time to publication will be shorter.

(BTW, the hyperlink on “Research in the Mathematical Sciences” may not be pointing where you intended – it leads to the retrospective thread).

[Corrected, thanks – T.]20 June, 2014 at 6:15 am

Eytan PaldiA table of contents (and perhaps also a list of special notation – e.g. types of M-values) may be helpful.

20 June, 2014 at 6:35 am

Aubrey de GreyI’ve prepared a clean version of my optimised Pace-code; I’ll hold on to it pending the possibility of further refinements in the coming days, but I’ll upload it when there is a stable location for it.

20 June, 2014 at 11:58 am

Pace NielsenI’ve uploaded an updated version of my retrospective. Once the file is recompiled, any and all comments or suggestions are appreciated.

I should be able to carefully re-read the polymath8b paper over the next week or so.

21 June, 2014 at 2:34 am

Eytan PaldiPage 58: In the line below definition, it should be “Hankel form” (instead of “Toeplitz form”).

[Corrected, thanks – T.]21 June, 2014 at 8:30 pm

interested non-expertThe link to the retrospective article gives a 404 error.

[Fixed, hopefully – T.]21 June, 2014 at 9:36 pm

Eytan PaldiThe link to the polymath8b paper (in the main page) becomes the link to the retrospective paper.

22 June, 2014 at 8:17 am

Eytan PaldiNow the link to the Polymath8b paper gives this error.

[Fixed, hopefully – T.]22 June, 2014 at 8:55 am

Terence TaoSignificant news on the Polymath8a front: A&NT has now supplied a quite lengthy referee report on the 8a paper (actually a synthesis of multiple referee reports, as different sections were apparently handled by different referees), which can be found at https://www.dropbox.com/sh/0xb4xrsx4qmua7u/AAANw1yXYBckm0Ao9aQEe-lKa/report1C.pdf . The report is broadly positive, but they do insist that the paper be shortened significantly, focusing on the most original and useful portions of the paper, and relegating the more encyclopedic portions to supplementary files (which can be placed on the A&NT web page). There is also an extensive list of corrections for each section.

Many of the corrections are minor, but there are some extensive revisions required in some areas, particularly Section 3 and (to a lesser extent) Section 4; we may need to discuss exactly how to proceed in those sections. There may also be some mathematical issues in Sections 9/10 that may need some nontrivial attention.

The revisions in Sections 5-7 look straightforward, and I will try to implement them soon. If one of the other participants is willing to help implement revisions in other sections, that would certainly be appreciated. :)

22 June, 2014 at 9:00 am

Terence Taop.s. I have spun off a copy of the Polymath8a paper at https://www.dropbox.com/sh/0xb4xrsx4qmua7u/AACaCh2DCRRHVls485EfGz5xa/newgap-submitted.pdf , so that we have a permanent copy of the paper that the referee reports are referring to (in case the revisions we implement in one section affect the page numbering or equation numbering in another section, before we get to the referee suggestions for that section).

22 June, 2014 at 9:36 am

Terence TaoSection 5 revisions implemented (this was the shortest section of the referee report). Will turn to Section 6 later today.

EDIT: Oops, I forgot that we had merged all the old files (heath-brown.tex, etc.) into one single huge tex file, newgap.tex. This makes it more difficult for different participants to simultaneously edit different sections. What I think I’ll do is de-merge newgap.tex back into the component files for now, and then merge them back later; it’s a little awkward, but given that we are relying on Dropbox rather than on more advanced version control software here, I don’t see a better option.

EDIT II: I’ve now split newgap.tex back into component files. This inserted some page breaks which have increased the length of the paper, so it was a good thing that I spun off the submitted file previously as otherwise the page and line references in the referee report would be hard to locate.

22 June, 2014 at 11:23 am

Andrew V. SutherlandIn view of the referee comments and the concerns about length, I would suggest we simply eliminate Section 3 from the A&NT version and move Theorem 3.1 and its short (half-page) proof either to the end of Section 2 or to an appendix. Theorem 3.1 is the only part of Section 3 that is mathematically necessary; those who are interested in a broader discussion of the asymptotics and algorithms for computing narrow admissible tuples can always refer to the arXiv version.

In any case, I would suggest doing the revisions in two passes: a first pass for corrections and a second pass to edit for length. That way we could post the results of the first pass as a corrected full-length version to the arXiv.

22 June, 2014 at 2:34 pm

Terence TaoThis sounds like a good suggestion to me.

I implemented all the Section 6 corrections, except for the penultimate one which requires some change to the mathematics. It’s the old “” issue again – our main incomplete exponential sum estimate, Corollary 6.15, is stated under the assumption that the modulus d divides both and , but when we use this corollary (in each of the non-advanced Type I/II estimates), d (which is now called ) only divides the first modulus and not the second. However, the proof of Corollary 6.15 as written requires d to divide both moduli. This should be fixable, but I need to check some calculations carefully.

EDIT: I made a change to the conclusion of Corollary 6.15, basically deleting the factors of d from , and this seems to fix the problem.

23 June, 2014 at 12:39 am

Emmanuel KowalskiI’ve started reading the report and I (or Philippe) will make the small changes needed for the exponential sums sections.

With the benefit of time and hindsight (and the many developpments of Polymath8b since the paper was submitted), I would like to suggest concentrating even more on the Zhang-style equidistribution theorems. Except for a few pages of historical background and context, there does not seem to me to be a very strong case for keeping (for instance) those sieve-theoretic aspects that are tuned up for the gaps, when much stronger / simpler / better bounds now exist. Doing so might lead to a significantly shorter paper whose goal and achievements would be clearer. Parts which are genuinely useful for Polymath8b would then be more usefully transfered to that second paper.

Once the basic corrections following the report(s) are made, I could try to produce a file going in this direction to see what it would look like.

23 June, 2014 at 8:08 am

Terence TaoThanks for this! I already went through Section 6 (exponential.tex) to implement the changes there, but it may be good to have another pair of eyes take a look at the fix I had to implement on Corollary 6.16 (replacing the delta_1, delta_2 by delta’_1, delta’_2) to deal with one of the issues the referee raised there. I haven’t touched the later sections (other than some slight changes to Section 7 at each point where Corollary 6.16 is used).

You raise a good point that the sieve-theoretic portion of the paper (Section 4) is now obsolete in view of Maynard and Polymath8b; indeed neither of these papers even use the material in Section 4 of this paper. So we could slim down the 8a paper down significantly (almost 50%) by essentially ditching Sections 3,4 (and most of Section 2 and some of Section 1, such as the flowchart), establishing just the distributional estimate, and mentioning that these estimates could be used to prove the now-obsolete bound H_1 <= 4680, referring to the longer version on the arXiv for details. Whatever portions of Section 3 that are needed for Polymath8b can then be moved to that paper instead, as you say. (We'll have to proofread Polymath8b again to make sure that all references to 8a are still accurate.)

Of course, a lot of participants put a lot of effort into the portions of the paper that we are thinking of removing, but these efforts have still been valuable in either directly or indirectly inspiring the more advanced results that have superseded these portions, and we will still be able to record these efforts in full even if they only end up as a remark in the officially published writeup of the project. (Indeed, one could view the history of Polymath8 as being a continual process of superseding one’s previous results.)

I think I might go over Section 4 next; even if it is going to be removed in the published version of 8a, it will still be on the arXiv version, so we may as well still get all the corrections done there.

23 June, 2014 at 10:11 am

Emmanuel KowalskiI definitely agree that all corrections suggested by the referees should first be implemented before a shorter streamlined version is made, so that the arXiv version remains as a reference and is complete and correct. I will review the changes (and make corrections where someone else hasn’t yet done them) as soon as I have time. I hope I didn’t forget too much of the notation and all that…

24 June, 2014 at 9:26 am

Gergely HarcosI could not download the report from the above link. Dropbox tells me “Nothing Here. The file you’re looking for has been deleted or moved.”

[Fixed, hopefully; the file was moved to mark off some corrections, and I saved a copy of that back to the original file. -T.]24 June, 2014 at 9:40 am

David RobertsThe link to the referee report gives a ‘nothing here’ error for me.

[Hopefully fixed now – T.]22 June, 2014 at 12:32 pm

Gaal YahasThe abstract for the retrospective paper has

“[…] buth conditional and unconditional, on H_m.”

typo: buth -> both

[Corrected, thanks – T.]22 June, 2014 at 2:08 pm

Eytan PaldiIn theorem 1.5(b), can “sufficiently large” be made effective?

22 June, 2014 at 3:13 pm

Terence TaoI assume you’re referring to Polymath8b (now that this thread is discussing three papers simultaneously, one probably has to specify which paper one is discussing at any given time). The answer to your question depends on whether the constants in the GEH assumption are effective. Since we don’t actually have a proof of GEH with or without effective constants, the issue is moot at present. (But given that even Bombieri-Vinogradov is not known to hold with effective constants, it is likely that the first proof of GEH will also be ineffective, so that any result relying on GEH will be very likely to be ineffective also.)

23 June, 2014 at 4:48 am

Andrew V. SutherlandThe m=5 bound under the 1080/13*varpi+330/13*delta < 1 constraint can been improved. We have

H(3,393,468,735) <= 78,602,310,160,

using the tuple described here.

This can be verified using

schinzelverify schinzel_3393468735_78602310160.txt

[Records added, thanks – T.]23 June, 2014 at 2:30 pm

Terence TaoI’ve made the Section 4 corrections (ignoring the suggestions to shorten the section, since we’re actually planning to remove it entirely). One moderately significant change (though it doesn’t affect anything outside of this section, and in any event this analysis is rendered obsolete by Maynard and Polymath8b): I made w a “sufficiently slowly” growing function of x rather than log log log x, because it was pointed out by the referee that the proof of Lemma 4.2 doesn’t quite work as stated (the o(1) decay need not be less than ).

On a separate note, I talked with Ken Ono who is keen to handle the 8b paper, and is promising a quick refereeing process. I guess one thing we can do to move that along is to rework Appendix A of the 8b paper to incorporate material from section 3 of Polymath8a, given that this section is going to be removed from the published version of 8a.

I’ll look at the Section 3 corrections next.

24 June, 2014 at 9:33 am

Pace NielsenHere are some comments on the Polymath8b paper. Most of them are just minor typos and English improvements. The only big question I have is point #12 below.

1. Page 3, line below Theorem 1.5. “who”->”which”

2. Page 11, equation (3.13). Change to .

3. Page 15, statement of Theorem 3.12. Do we want to specify that is fixed? (If so, a similar change to happen in Theorem 3.14.)

4. Page 16, statement of Theorem 3.15. The function should be said to be “fixed”.

5. Page 17, offset equation between (4.3) and (4.4). In the subscript of the sum, should there be a comma between and (like there is in (4.1))?

6. Page 26, equation (4.17). Change to .

7. Page 27, equation (4.24). There should be a period at the end of the equation. The next sentence also doesn’t have to be a new paragraph.

8. Page 29, offset equation after (4.29). There is a missing .

9. Page 35, line -2 (the line directly after the offset equation). I believe that should be here.

10. Page 41, equation (6.2). There is an “ess” in the equation. Not sure why it is there.

11. Page 45, sentence after equation (6.5). There is a missing parenthesis at the end of the sentence.

12. Page 52, middle of the page when computing . I admit to not following the rest of the argument, but this equality does not look correct. In particular where does the extra come from, and where did the go?

13. Page 57. Change “maximize the quantity” to “maximizes the quantity ”. (Add a space before , and an “s” to “maximize”.)

14. Page 59, last line. The web address is off the page.

15. Page 65, equation between . When it says it should be . [This occurs twice.]

[Corrections implemented, thanks – T>]24 June, 2014 at 8:06 pm

Pace NielsenOn #12, I see now that somehow I just missed where was specified. The fix introduced an extraneous period.

[Corrected, thanks – T.]25 June, 2014 at 2:07 am

Eytan PaldiIn Polymath8b paper, the lower bounds in table 1 (page 54) should be sufficiently accurate (in order to imply parts of theorems 3.9 and 3.11) but in order to verify that, one needs sufficiently good upper bounds on the numerical integration errors in the calculation of the (non-elementary) integrals in (6.14)-(6.16).

25 June, 2014 at 3:45 am

Aubrey de GreyIs there any remaining issue with revising item 1 in the “avenues to possible improvements” section? I think my (second attempt at a) paragraph summarising our state of knowledge/belief is accurate – posted at https://terrytao.wordpress.com/2014/05/17/polymath-8b-xi-finishing-up-the-paper/#comment-365217 – but maybe others have improvements.

25 June, 2014 at 6:28 am

Eytan PaldiIt seems that the current Krylov subspace method for obtaining lower bounds for by using a fixed number (currently 51) of precomputed inner products (whose computation is very expansive) can be improved to get better lower bounds for – using the same(!) number of inner products.

I’ll describe the idea (improved processing of the inner products) in my next comment.

25 June, 2014 at 7:30 pm

Eytan PaldiImproved lower bounds for :

Let and the basis functions

for (defined as in page 58 of the Polymath8b paper). Let (for )

and denote by the Hankel matrices (as defined in page 58).

The lower bound for by the current method is the maximal generalized eigenvalue for the pencil which can be represented as

(1) subject to

is positive semi-definite.

Now suppose that

is given for some .

Therefore the current method can be applied only if .

Since it is not clear that the current Krylov subspace method gives the best lower bound for (based on the given vector ), it seems natural to consider the following problem:

“what is the best lower bound for where is given?”

It seems that the answer is given by

Where the infimum ranges over all the positive semi-definite linear operators on such that

for

Therefore, by increasing the number of basis functions, we can approximate the optimal lower bound for (for given – without the current need to satisfy ) as the solution of

(2) subject to

$A(w), B(w), t B(w) – A(w)$ are positive semi-definite.

Remark: observe that for the vector

should be optimized in (2) in addition to the parameter .

Clearly, the Hankel matrices are affinely dependent on the vector of free parameters, i.e. can be represented as

where all the symmetric matrices are known.

Since the feasibility domain in the problem (2) is a convex cone, any local minimum must be a global one. Moreover, this problem (known as generalized eigenvalue minimization) can be solved by efficient algorithms, implemented (in MATLAB) by the LMI solver gevp – as described in

“LMI control toolbox user’s guide”, the MathWorks Inc. 1995.

The gevp solver is based on Nesterov and Nemirovski’s projective method.

25 June, 2014 at 10:20 pm

Terence TaoIf I understand correctly, the idea here is to see if there is a better bound on the operator norm of that one can squeeze from knowledge of for than can be obtained from the Krylov method. I analysed a problem similar to this when trying to find a better sieve than the Selberg sieve. In that setting, I came to the conclusion that Selberg could not be significantly improved upon, and I think a similar argument works here, at least if N is odd (which is what Krylov needs).

One can see this using the spectral measure of wrt the vector 1. The inputs are then the moments of :

A lower bound is then the assertion that cannot be supported on . From the Hahn-Banach theorem, such a lower bound can be deduced from the given values of (without any further knowledge of the spectral measure) iff there exists a polynomial

which is non-negative on , but such that

. (*)

If , then by counting degrees of freedom, I think the optimal choice of P (generically) has to have a zero at M and n double zeroes in the interior of [0,M], or in other words it has to take the form for some degree n polynomial Q. In such a situation, the requirement (*) is the same requirement arising in the Krylov method, namely that there is a vector such that . (Indeed, the vector v is basically the coeffiicents of Q.) So one doesn’t improve upon Krylov in this case.

One may be able to do a little bit better when N is even, but my guess is that either there is no gain or it is negligible (it may depend on how anomalously large is).

26 June, 2014 at 9:50 am

Eytan PaldiThanks! It seems that your simpler (spectral) formulation of the problem may be easier to solve numerically by appropriate convex programming. It is clear that any zero of in should have even multiplicity (not necessarily 2), but I still don’t see how to infer the multiplicities of possible zeros of at the endpoints

26 June, 2014 at 9:56 am

Terence TaoBasically, if P has fewer than N zeroes in [0,M] (counting multiplicity), then there should be enough degrees of freedom to move P around (while preserving the number of zeroes it already has), and also shrink M a bit (unless there is a zero at M blocking this), until another zero of P is created in [0,M]. I haven’t worked out the rigorous details for this, but I think this process will generically terminate when P has n double zeroes inside (0,M) and one zero at M.

I think one can also proceed using the one-dimensional Positivstellensatz, which I think tells us that any polynomial that is nonnegative on [0,M] is a positive linear combination of polynoimals of the form and (I haven’t checked the details of this either, though).

8 July, 2014 at 4:37 am

Eytan PaldiIt seems that the complete solution (both even and odd cases) was given by Curto and Fialkov in “Recursiveness, positivity, and truncated moment problems”, Houston J. math. 17(1991), 603-635.

8 July, 2014 at 5:58 am

AnonymousThe paper can be found at http://www.math.uh.edu/~hjm/v017n4/0603CURTO.pdf.

8 July, 2014 at 10:54 am

Terence TaoThanks for this. It looks like that this paper confirms that outside of some degenerate singular cases, the positive definiteness of the Krylov matrix is the optimal criterion that one can derive from knowledge of a finite number of moments ; there is a potential loophole in the odd case when the highest moment is unusually large in magnitude (in which case it could give a better lower bound for than the bound that one would get by ignoring this odd moment), but I doubt that this will actually arise in our application.

26 June, 2014 at 12:48 am

Aubrey de GreyI’m wondering whether anyone else is seeing a strangeness at the dropbox: when I downloaded the 8b paper yesterday using the altogether correct-looking link at the top of this thread, it saved with the bizarre filename “bugJhUAfdbKE15Krps4JhSWAubUNrzHrdQaKHdkSRdjH7C4LBPHkH1FFZVcokSzg”. It opens fine (despite the lack of a .pdf extension), but if others are seeing the same thing (as opposed to this being some aneurysm of my computer brought on by a Mathematica overdose :-)) then maybe it’s worth looking for a fix before the paper is submitted.

26 June, 2014 at 2:17 pm

Terence TaoI’ve managed to go through the Section 7 corrections. (Section 3 ended up having no actionable items, so given that it is scheduled for deletion in the published version, I decided not to touch it.) With Phillippe having tackled the Section 8 corrections already, this leaves only the (lengthy) Section 9/10 list of corrections to deal with. I think I might try to tackle the Section 10 half of this either today or tomorrow. There are two suggestions here marked “Important”, one in Sec 9 and another in Sec 10, that I haven’t had a chance to look at in detail yet; hopefully they are not serious.

27 June, 2014 at 12:28 pm

Terence TaoGone through the Section 10 corrections; the “Important” correction turned out to only require a slight rearrangement of two portions of the argument (as the referee in fact indicated). So there’s only Section 9 left to do, which I might do today or tomorrow.

29 June, 2014 at 2:18 am

AJust a layman passing through: Why does the project separately state results obtained with and without Deligne’s theorems?

I am not familiar with the theorems, but I understand that they have been proved (as opposed to Fermat’s Last Theorem when it was still a conjecture); and thus I am curious as to why anyone should bother obtaining results while avoiding the use of these theorems.

(I realize it is fun, and sometimes enlightening, to try and solve the same problem in different ways. I am posting this because I imagine this is not the sole reason.)

29 June, 2014 at 7:08 pm

Terence TaoThis distinction was more relevant early in the project, in which it was not clear that one could get any bound at all without the difficult theorems of Deligne. Now, one can get a proof of bounded gaps between primes ih a handful of graduate lectures (at least if one assumes the Bombieri-Vinogradov theorem as a black box, but even that theorem is not too difficult, perhaps occupying a few more lectures in an analytic number theory course). In contrast, I’m not sure that one could cover the proof of Deligne’s theorem on the Riemann hypothesis for sheaves in an introductory graduate course without assuming quite a large amount of arithmetic geometry as background.

2 July, 2014 at 2:06 am

Emmanuel KowalskiThere have been graduate courses presenting Deligne’s second version of the Riemann Hypothesis (which is the relevant version for the sharper estimates). For instance, there is one by Katz in the early 1980’s (the notes are available on his web page), but they basically assume a working knowledge of all the background used by Deligne, which is a very significant amount of algebraic geometry, and I think Katz presents some material as black-boxes (e.g., Lefschetz pencils, if I remember right). Katz’s “Four lectures on Weil 2″ give a proof of an important part of Deligne’s work which is definitely shorter and easier, but I don’t know offhand if it would be enough for us, and it begins with the same type of prerequisites.

Setting up these necessary foundations of étale cohomology, assuming knowledge of Hartshorne’s book (for instance) is also probably a year-long endeavor (there are notes of a course by de Jong on étale cohomology in some sections of the Stacks project; I think it was only a semester-long course, but it doesn’t cover everything Deligne requires, if I remember right).

And presenting the material at the level of Hartshorne’s book (beginning with the content of a standard introductory graduate algebra class) that is needed is also probably something that requires at least a year.

29 June, 2014 at 7:06 pm

Terence TaoI’ve finished the Section 10 corrections from the (remarkably thorough) referee report; the comment marked “Important” required a tweak to a couple definitions and computations (we had taken the triangle inequality prematurely before a Cauchy-Schwarz, and so some reorganisation was in order) but nothing that wasn’t fixable.

Emmanuel, if you want to start on forming the abridged version of Polymath8a (in a subfolder, perhaps), I guess now would be a good time. At some point I’ll upload the full-length revision to the arXiv, but perhaps in a week or so after I and others have had a chance to take one last look at it.

2 July, 2014 at 1:50 am

Emmanuel KowalskiSorry for the delay in answering, I was hiking the last two days…

I’ll start preparing the shorter version hopefully today and hopefully a first draft will be available by the end of the week.

8 July, 2014 at 7:38 am

Emmanuel KowalskiThe first draft of the shorter version is now in (or will soon sync with) the dropbox folder, in a subfolder shorter/.

The new parts are the introduction, and a file technical.tex contains those things needed from the removed sections (e.g., definition and facts on dense divisibility).

There were very few dangling references after removing subtheorems, narrow, gpy and optimize, which confirms that the new version is very cleanly extracted from the previous one.

8 July, 2014 at 11:04 am

Terence TaoLooks good (and is significantly shorter, down from 163 pages to 106). I guess I’ll see you soon in person at IHES, so we can coordinate further editing of the draft then.

The longer version of 8a looks stable now, and I will shortly upload it to the arXiv to replace our previous draft.

We can now also move ahead with editing the portions of 8b involving narrow admissible tuples. A lazy way to proceed would be to refer to the long arXiv version of 8a that will shortly be posted, but perhaps for the sake of putting everything we use into the published literature, we should import the relevant portions of 8a into 8b (particularly the appendix of 8b).

10 July, 2014 at 4:15 pm

Andrew V. SutherlandI went through the appendix of 8b and incorporated a shortened version of the content on narrow admissible tuples from 8a that I thought was directly relevant to 8b. I refer the reader to the long version of 8a for further details in a couple of places, but I think the appendix of 8b is now reasonably self-contained (and not all that much longer than it was).

I did not include any of the material on lower bounds for H(k), but if others think that this (or any other material) should be there, feel free to make further changes to appendix.tex, I’m done with the file.

In the process I noticed a couple of typos in the 8a narrow.tex which I fixed.

11 July, 2014 at 10:27 pm

Terence TaoThanks, it looks good! I changed some references to Polymath8a to a new “unabridged Polymath8a” which should be online on the arXiv in a day or two. Otherwise, 8b looks in good shape; I’ll wait a few more days for any further comments, but I think it’s ready for submission.

4 July, 2014 at 8:34 am

Eytan PaldiIn Polymath8b paper, in the sixth line below (7.9), “will never exceed 5″ may now be updated to “will never exceed 3″.

[Corrected, thanks – T.]6 July, 2014 at 12:29 am

Eytan PaldiIn the Polymath8b paper, in the third line from the end of the abstract, it seems clearer to insert “unconditional” before “asymptotic”.

[Inserted, thanks – T.]7 July, 2014 at 12:41 am

Eytan PaldiIn the Polymath8b paper, in the fifth line of the introduction, it should be “where ” (instead of “where “).

[Fixed, thanks – T.]11 July, 2014 at 10:55 am

Eytan PaldiIn page 66 of Polymath8b paper, the vanishing of on (although stated in page 63), may be added (for completeness).

[Added, thanks – T.]12 July, 2014 at 3:22 am

Eytan PaldiIn the Polymath8b paper, Fig. 1 (now in page 73 – before the appendix) should be moved into the appendix (along with Fig. 2 and Fig. 3 to the end of A.1. subsection.)

[I’ll wait on fixing this until the final galleys of the paper, formatted to the journal house style, are in, as the conversion to that style may automatically solve the problem. -T.]12 July, 2014 at 4:11 am

Eytan PaldiIn Polymath8b paper, in the second line of subsection A.2. (page 73), it should be “(5)-(9)” (instead of “(4)-(8)”).

Also, in the second line of subsection A.3. (page 76), it should be “(10) and (11)” (instead of “(9) and (10)” ).

[Corrected, thanks – T.]13 July, 2014 at 12:47 am

Eytan PaldiIn Polymath8b paper, “between primes” is missing from the title of reference [40].

[Corrected, thanks – T.]13 July, 2014 at 11:48 pm

Eytan PaldiIn polymath8b paper, It would be helpful to add some information after theorem 3.2 on the (quite complicated) dependence of its several parts on other theorems.

14 July, 2014 at 9:10 pm

Terence TaoHmm, this is a good idea in principle, but I’m not sure how to convey this information in a concise, high-level manner; the distinctions between the various tools used to prove different parts of Theorem 3.2 are rather technical (e.g. using epsilon trick or not, using polynomials or piecewise polynomials, using a vanishing marginal constraint, etc.) and I don’t know if it will be very illuminating to make these distinctions explicit, particularly before the more technical theorems (Theorems 3.5-3.14) have even been stated. (Compare with Polymath8a, where we had a nice high-level breakdown of the logic that we made into a graphic.) But if anyone has some specific suggestions on how to collect this information (which is currently scattered in a bunch of sentences across Section 3), I can try to implement them.

14 July, 2014 at 10:40 pm

Eytan PaldiIt is perhaps sufficient just to state (perhaps in a small table) that

parts (vii)-(xi) (of theorem 3.2) will follow from theorems 3.8 and 3.9.

parts (ii)-(vi) from theorems 2.5 and 3.11.

parts (i), (xiii) from theorems 2.3 and 3.13.

part (xii) from theorems 3.14 and 3.15.

14 July, 2014 at 10:57 pm

Eytan PaldiCorrection: in my comment above, parts (ii)-(vi) will follow from theorems 2.5, 3.10 and 3.11 (i.e. theorem 3.10 is also needed.)

15 July, 2014 at 1:57 am

Eytan PaldiCorrection: in my comment above, parts (i), (xiii) will follow from theorems 2.3, 3.12 and 3.13 (i.e. theorem 3.12 is also needed.)

Remark: Note that in theorem 3.13(xiii)

– which is not covered by theorem 3.12(ii), but the desired conclusion still holds (e.g. by slightly reducing the numerical value of in theorem 3.13(xiii)).

[Table added -T.]14 July, 2014 at 9:10 am

Pace NielsenMathematica 10 was just released, and it appears they have updated their matrix routines. Aubrey, if you would email me the most recent version of your code, I’d be happy to do some timing testing (and double check the code still works on this new version).

14 July, 2014 at 11:19 am

Aubrey de GreyWill do – and I’ll wait to upload it to the dropbox until you confirm that it does.

15 July, 2014 at 9:12 am

Aubrey de GreyPace confirms that my latest code still works with Mathematica 10, so I’ve just uploaded it to the main Polymath8b dropbox folder with name “Mfinder-clean.nb”. I didn’t find time to explore beyond the refinements I reported on July 17th, so the code just implements what I described there. It still isn’t very well commented, but I hope it can be a viable starting-point for anyone who wants to go further (especially in respect of exploring domains larger than the simplex of size 1+epsilon), and I remain available to provide help.

30 July, 2014 at 6:39 am

Pace NielsenI just wanted to report on the Mathematica 10 run times. (I was hoping to report two weeks ago, but I had a flight to Poland, and so didn’t have access to my computer.)

Running Aubrey’s code on my desktop, which is a decent (but not decked-out) 5-year-old computer with 4-cores and 12 GB of RAM it took:

22 minutes to verify that should work

14 minutes to approximate the value to within

4.25 hours to approximate an eigenvector with which to do exact rational computations to prove

The most RAM ever used was a little below 3 GB.

15 July, 2014 at 6:23 am

Eytan PaldiIn Polymath8b paper, in the new table (table 1, page 9), it seems that for parts (vii)-(xi) it should be “3.9” (instead of “3.10”).

Also, since the components of theorem 3.2 are not directly implied by lemma 3.4 (they are directly implied by the other theorems inside table 1), it seems clearer to move lemma 3.4 to the title of table 1 (along with theorems 3.5, 3.6).

15 July, 2014 at 9:53 pm

Eytan PaldiIn the second version of the Polymath8a arxiv paper, “14950” somehow disappeared from the end of the abstract.

[Noted, though I’ll wait for more major revisions to post a correction to the arXiv version. -T.]16 July, 2014 at 10:33 pm

Terence TaoI’ve put Polymath8b in the house format for Research in the Mathematical Sciences, which happens to be the Biomed Central format, of all things; the draft PDF can be found here; I’ll give it a day or so for any final comments and then I’ll arXiv and submit it (of course, we can keep doing minor revisions after this process).

16 July, 2014 at 11:13 pm

S Jungsmall typo: in the abstract, last para, “one can obtain” appears twice in a row

[Corrected, thanks – T.]17 July, 2014 at 5:03 am

Eytan PaldiThat line also begins with an unnecessary “the”.

[Corrected, thanks – T.]17 July, 2014 at 1:35 am

Eytan PaldiSome remarks (for Polymath8b new format):

1. Page 8: in Table 1 (in its third line) it should be “Theorems 3.9, 3.10″ (instead of “Theorems 3.8, 3.10″) – as explained in the two lines above theorem 3.9.

Additionally, since the components of theorem 3.2 follow from the theorems inside the table (without lemma 3.4) it seems better to place lemma 3.4 in the title of the table (along with theorems 3.5, 3.6).

2. Page 15: in the footnote [4], it may be added that in fact (by the continuity of wrt ), theorem 3.12(ii) holds also for .

3. Page 64: there is a display (“xyplot”) problem (fifth line from below) with the diagram.

[Corrected, thanks – T.]17 July, 2014 at 2:28 am

Eytan PaldiCorrection: in my first remark above, it should be “Theorems 3.8, 3.9″. (instead of “Theorems 3.9, 3.10″).

17 July, 2014 at 6:10 am

Eytan PaldiMore remarks:

Page 13: in the first line above theorem 3.9, it should be “sections 6, 7″ (instead of “section 6″) – since theorem 3.9(vii) is proved in subsection 7.1 (page 58).

Page 55: In the title of table 2, it should be “Theorems 3.9 and 3.11″ (instead of “Theorem 3.9″) – as explained in the last ten lines of the previous page.

[Corrected, thanks – T.]18 July, 2014 at 1:48 am

Eytan PaldiRemarks for Polymath8b paper (new format):

1. In the line below theorem 3.3, “theorem 3.2 in Appendix 10″ should be “theorem 3.3 in Section 10″.

2. Since in the new format “Appendix A” is now “Section 10″, perhaps in the first line of section 10 (page 73), “this appendix” should be updated to “this section”.

(since section 10 seems to be an appendix, it is not clear if its current name is better than in the previous format.)

[Corrected, although I had just posted the paper to the arXiv and so the arXiv version will not currently have this correction. -T.]19 July, 2014 at 7:11 am

Eytan PaldiIn the line below theorem 3.3 (see my first remark above), “theorem 3.2″ should be “theorem 3.3″.

Additionally, in the new abstract, it seems clearer to have inside parentheses.

[Corrected, thanks – T.]20 July, 2014 at 6:43 am

Eytan PaldiIn Polymath8b paper (new format), page 60 second line, “Theorem 3.9(i)” should be “Theorem 3.13(i)”.

(hopefully, this is the last typo of this kind)

[Corrected, thanks – T.]17 July, 2014 at 8:13 am

Eytan PaldiLet be called a Polignac number if it appears as a gap between consecutive primes infinitely often. Clearly, Zhang’s theorem implies the existence of at least one Polignac number in .

Is it possible to deduce from the current knowledge on () the existence of at least two Polignac numbers?

17 July, 2014 at 11:00 am

Pace NielsenYes. Let be one Polignac number. We know that there are infinitely many sets of prime triplets a bounded distance (say ) apart. Given such a triple, let be the set of all primes in that bounded interval (so and ). Note that we cannot have for each , since that would contradict the fact that the primes must form an admissible tuple.

More generally, given a finite set of Polignac numbers, we cannot form an arbitrarily long admissible tuple using only jumps of those sizes, so there must exist another Polignac number.

17 July, 2014 at 2:21 pm

Gergely HarcosIn fact János Pintz proved that the set of Polignac numbers has positive density, and the density can be bounded effectively in terms of . Moreover, he also proved that the maximal gap size between Polignac numbers is bounded by an ineffective constant. The latter constant remains ineffective without significant new ideas, because there exist sequences with arbitrary large (but finite) maximal gap size which contain a difference from any -tuple.

17 July, 2014 at 1:19 pm

Eytan PaldiIf is a Polignac number, than the triple is admissible (enabling the possibility of infinitely many prime triples ) – so your argument can’t work for (or more generally if the Polignac number is a multiple of 6.)

17 July, 2014 at 1:29 pm

Andrew V. SutherlandI think for N=6 you want to take use the fact that there are infinitely many quintuplets of primes a bounded distance apart to get a contradiction of admissibility modulo 5, and in general you want to construct a contradiction of admissibility modulo the least prime p that does not divide N using the existence of infinitely many of p-tuplets occurring within an interval of bounded size.

17 July, 2014 at 2:49 pm

Eytan PaldiYes. It seems that with your modification, Pace’s argument (for the existence of at least two Polignac numbers) works (since there are only finitely many arithmetic progressions of primes with difference and length – provided that are relatively primes).

Since the smallest Polignac number is , we need to choose to be relatively prime to – so (for an unconditional argument) we may choose to be the least prime above 246.

It is still not sufficiently clear how to (rigorously) generalize this argument for more than two Polignac numbers.

17 July, 2014 at 3:02 pm

Gergely HarcosSee my previous comment on this blog (at 2:21pm). See also Theorems 1 and 2 in Pintz’s paper http://arxiv.org/abs/1305.6289.

17 July, 2014 at 3:52 pm

Eytan PaldiThanks! (It is quite remarkable that the main ideas for these theorems are from 2010 – before Zhang’s theorem!)

17 July, 2014 at 6:16 pm

Pace NielsenThanks Gergely. I had failed to account for small primes in my argument above, so it’s nice there is a clean proof due to Pintz.

17 July, 2014 at 1:49 pm

Andrew V. SutherlandA simpler argument is to get a contradiction on the the maximal density of the elements of an admissible tuple. The Omega(k*log k) lower bound on the diameter of an admissible tuple implies that for for any constant N we can pick k large enough so that every admissible k-tuple has an average gap size greater than N, and in particular has at least one gap larger than N.

Now suppose the number of Polignac numbers is finite, and fix a constant N that is larger than any of them. Pick k as above and use the fact that there are infinitely many k-tuples of primes a bounded distance M apart. If we go out far enough, all the gaps in our k-tuples of primes have to be smaller than N (otherwise there is another Polignac number between N and M), but this contradicts the fact that our admissible k-tuple must have at least one gap larger than N.

20 July, 2014 at 9:46 pm

Terence TaoI’m rolling over to a new (and perhaps final) Polymath8 thread at https://terrytao.wordpress.com/2014/07/20/variants-of-the-selberg-sieve-and-bounded-intervals-containing-many-primes/ . I’ve just arXiv’ed the 8b paper and submitted it to RIMS; apparently, some referees are already looking at the manuscript.

21 July, 2014 at 5:53 am

MathematicsThe END?