--- a/paper/two-class-jacobsthal.md +++ b/paper/two-class-jacobsthal.md @@ -9,7 +9,7 @@ parity: residue-only --> -*Draft, 2026-09-05. Internal to the research repository; the publication +*Draft, 2026-09-05; audited 2026-09-10. Internal to the research repository; the publication moratorium is in force and this document is not submission copy. Prose follows `paper/writing-style-math.md`. Nothing is re-derived here: every theorem points at the file that proves it, every number at the script that produced it.* @@ -54,8 +54,8 @@ holes of the primorial wheel; a **twin slot** is a residue $r$ with $r$ and $r+2$ both holes. For $p = 2$ one class is forbidden ($r$ even) and for each odd $p \le x$ two classes are forbidden, $r \equiv 0$ and $r \equiv -2$. The -number of twin slots per period is $D_x = \prod_{3 \le q \le x}(q-2)$, the -Schemmel totient (OEIS A059861), and +number of twin slots per period is $D_x = \prod_{3 \le q \le x}(q-2)$, OEIS +A059861 (the Schemmel totient $\varphi_2$ evaluated at $W/2$), and $$G_2(x\#) = \max\{\text{cyclic gap between consecutive twin slots of } W\}.$$ @@ -69,7 +69,8 @@ - **It brackets the one-class function.** Twin slots are a subset of holes, so $G_2(x\#) \ge g(x\#)$ for Jacobsthal's $g$ (OEIS A048670 at primorials); and $G_2 \le h_2$, Ziller and Morack's function where each prime chooses its two - classes freely (OEIS A288815). Both hold at every shared term + classes freely (Ziller and Morack 2017, OEIS A288815). Both hold at every + shared term, $g \le G_2$ at all 22 and $G_2 \le h_2$ at all 21 to $x = 73$ (`research/G2-STATE.md` §2). - **It is OEIS A144311 shifted by one.** A144311 counts the longest run of consecutive integers each $\equiv \pm 1$ mod some prime $\le x$; that is @@ -90,7 +91,8 @@ ## 2. The upper bound -> **Theorem 1** (`paper/beta2-note.md`, conditional only on the cited sieve). +> **Theorem 1** (`paper/beta2-note.md`; the one input is the Diamond–Halberstam +> book's Theorem 9.1, cited and read at the page). > Let $\beta_2 = 4.26645028\ldots$ be the sifting limit of the DHR sieve of > dimension $2$. For every $\varepsilon > 0$ there is $C(\varepsilon)$ with > $$G_2(x\#) \le C(\varepsilon)\, x^{\beta_2 + \varepsilon} \quad \text{for all primes } x.$$ @@ -135,7 +137,7 @@ > **Theorem 2b** (`paper/kk-lower-bound.md` §9, Theorem A; published statements only, not refereed). > $G_2(x\#) \gg x \ln x$. -> **Theorem 2c** (`paper/kk-lower-bound.md` §3, Theorem B; derived here, checked twice, not refereed). +> **Theorem 2c** (`paper/kk-lower-bound.md` §3, Theorem B; derived here, checked twice adversarially and re-read at source since, not refereed). > There is an absolute $y_0$ such that for $y \ge y_0$ > $$G_2(P(y)) \gg \frac{y (\ln y)^3 (\ln\ln\ln y)^2}{(\ln\ln y)^4}.$$ @@ -167,23 +169,32 @@ *A caution on the one-class floor.* The Erdős Problems page for #687, edited 2026-08-31, reports a one-class bound $Y(x) \gg x \ln x/\ln\ln\ln x$ that improves FGKMT by a factor $\ln\ln x/(\ln\ln\ln x)^2$. Read at source on -2026-09-07: the attribution is not a paper. The page credits "GPT 5.6 Pro" +2026-09-07 and again on 2026-09-10, unchanged: the attribution is not a paper. The page credits "GPT 5.6 Pro" and links only to Erdős Problem #4's proof-claims thread; the artifact is an anonymous AI-authored PDF posted to GitHub on 2026-08-26, not on arXiv and not refereed, with its covering theorem formalised in Lean by a third party -(plby/lean-proofs). The statement is the one-class primorial form +(plby/lean-proofs); the page itself carries only the attribution and the link +to #4, and the artifact and the formalisation were reached through that thread +(`research/history/reviews-0907/03-erdos-687-source-read.md`). The statement is the one-class primorial form $Y(X) \ge c_0 X\ln X/\ln\ln\ln X$, so it transfers to $G_2$ through $G_2 \ge g$ at exactly that calibration. Theorem 2b sits above it in either case and Theorem 2c far above. ## 4. The data -Fourteen exact terms computed here (`research/05-twin-jacobsthal.js`, -`research/05b-twin-jacobsthal-segmented.js`, `research/exact-g2-ladder.js`; -$41\#$ and $43\#$ each twice on disjoint masks), agreeing at all fourteen with -A144311, whose remaining eight terms (Alekseyev 2009, Wang 2024, a public -branch-and-bound sharing no method with ours) are adopted as trusted -(`research/a144311-full-ladder.js`). $G_2(37\#) = 528$ additionally carries an +Fourteen exact terms computed here: $x \le 23$ by +`research/05-twin-jacobsthal.js`, $29\#$ and $31\#$ by the segmented +`research/05b-twin-jacobsthal-segmented.js`, $37\#$ by a mod-30 lattice walk, +and $41\#$ and $43\#$ each twice on disjoint natal masks on 2026-08-18 +(provenance table in `research/oeis-G2-submission.md`; `research/G2-STATE.md` +§2). The values and their lower certificates are re-checked at the artifact by +`research/exact-g2-ladder.js`, and a wheel-210 segmented striking sieve sharing +no code with either producer re-derived $x = 11$ to $37$ exhaustively on +2026-09-04 (`research/history/staging/measure-0904-argmax.md`). All fourteen +agree with A144311, whose remaining eight terms (Alekseyev 2009 for $47\#$ and +$53\#$, Wang 2024 for $59\#$ to $79\#$, a public C++ program read here as a +branch-and-bound depth-first search, sharing no code with ours) are adopted as +trusted (`research/a144311-full-ladder.js`). $G_2(37\#) = 528$ additionally carries an exhaustive maximality certificate from a third engine over all $217{,}929{,}355{,}875$ gaps (`research/history/staging/scanstat-t37.md`). @@ -191,12 +202,12 @@ |---|---|---|---|---|---|---|---| | 2 | 2 | | 0.500 | 41 | 546 | 0.512 | 0.325 | | 3 | 6 | | 0.667 | 43 | 618 | 0.492 | 0.334 | -| 5 | 12 | | 0.480 | 47 | 708 | 0.484 | 0.320 | +| 5 | 12 | | 0.480 | 47 | 708 | 0.484 | 0.321 | | 7 | 30 | | 0.612 | 53 | 870 | 0.518 | 0.310 | | 11 | 42 | 0.500 | 0.347 | 59 | 966 | 0.506 | 0.278 | | 13 | 66 | 0.447 | 0.391 | 61 | 1080 | 0.502 | 0.290 | | 17 | 108 | 0.471 | 0.374 | 67 | 1284 | 0.534 | 0.286 | -| 19 | 150 | 0.456 | 0.415 | 71 | 1398 | 0.523 | 0.277 | +| 19 | 150 | 0.456 | 0.416 | 71 | 1398 | 0.523 | 0.277 | | 23 | 204 | 0.458 | 0.386 | 73 | 1530 | 0.519 | 0.287 | | 29 | 258 | 0.446 | 0.307 | 79 | 1710 | 0.528 | 0.274 | | 31 | 348 | 0.479 | 0.362 | | | | | @@ -214,8 +225,9 @@ $0.534$ over $x \ge 41$. - The scale $m \ln D$ is $x \ln^2 x$ up to a constant, so the ladder lives at $x^{1 + o(1)}$, as the one-class function does. A power-law fit through the - 22 terms returns $1.50 \pm 0.05$ after correcting the estimator's bias on a - one-class control (`research/exponent-control.md` §5). That figure is a local + 22 terms returns $1.50 \pm 0.05$, statistical error only with the systematic + unquantified, after correcting the estimator's bias on a one-class control + (`research/exponent-control.md` §5). That figure is a local slope over one decade of $x$ and carries no asymptotic content. - The unconditional floor $x \ln^3 x$ and the conjectural ceiling $x \ln^4 x$ both sit above the $x \ln^2 x$ the data run at. This is the same situation @@ -228,8 +240,9 @@ $G_2/x^2$ falls from $0.347$ at $x = 11$ to $0.274$ at $x = 79$, ten descents in seventeen steps. The zone statement of §1 needs $G_2 < x'^2 - 2$; the measured ratio $x'^2/G_2$ runs $3.2$ to $4.5$ over the ladder and the zone $(x, x'^2)$ -holds a twin prime pair at every $x$ checked, to $X = 10^{12}$ -(`research/history/staging/zonegap-03-score.md`). None of this is evidence for an asymptotic +holds a twin prime pair at all $78{,}497$ zones with $x < 10^6$, the sweep to +$X = 10^{12}$ (`research/history/staging/zonegap-03-score.md`, rows S4 and S5, +from `research/zonegap-04-sweep-1e12.js`). None of this is evidence for an asymptotic statement, since $\ln^2 x/x \to 0$ makes the truth of the inequality overwhelmingly likely and its proof no easier. @@ -268,12 +281,12 @@ | statement | rung | what would move it | has the check run | |---|---|---|---| -| Theorem 1 | PROVEN, conditional on DHR Theorem 9.1 | a defect in the primary-source reading | yes: read line by line, page images archived | +| Theorem 1 | PROVEN, citing DHR Theorem 9.1 | a defect in the primary-source reading | yes: read line by line, page images archived | | Theorem 2a | PROVEN | nothing; elementary | yes: verified at all 22 shared terms | | Theorem 2b | DERIVED, not refereed | a misread of Kalmynin–Konyagin Corollary 1 | adversary-confirmed at the page image, once | -| Theorem 2c | DERIVED, checked three times, not refereed | a hypothesis of the source that the substitution does not satisfy; Halberstam and Richert Theorem 2.2 printed in a form that does not give Kalmynin and Konyagin's Lemma 1 (`paper/kk-lower-bound.md` §11.2) | second reader plus brute force of the finite content (2026-08-19); both §11.1 readings repeated at the arXiv text (2026-09-07) and at the TeX source, every other input read at source (2026-09-08, `research/history/reviews-0907/11`); the 1974 page unread after a second bounded access pass (2026-09-08, thirteen channels); a referee has not | -| the $c_2'$ band | MEASURED, 22 terms | a term at $x \ge 83$ outside $[0.44, 0.60]$ | no; the exact ladder and A144311 both end at $x = 79$ | -| "no earlier two-class upper bound" | CALIBRATED ABSENCE | one citation in the owning convention | searched 2026-08-18 and 2026-08-28 (`research/SEARCH-CONVENTIONS.md` §3) | +| Theorem 2c | DERIVED, checked twice adversarially and re-read at source since, not refereed | a hypothesis of the source that the substitution does not satisfy; Halberstam and Richert Theorem 2.2 printed in a form that does not give Kalmynin and Konyagin's Lemma 1 (`paper/kk-lower-bound.md` §11.2) | second reader plus brute force of the finite content (2026-08-19); both §11.1 readings repeated at the arXiv text (2026-09-07) and at the TeX source, every other input read at source (2026-09-08, `research/history/reviews-0907/11-two-class-theorem2c-source-review.md`); the 1974 page unread after a second bounded access pass (2026-09-08, thirteen channels, `research/history/reviews-0907/12-halberstam-richert-second-access.md`); a referee has not | +| the $c_2'$ band | MEASURED, 18 normalized terms of 22 | a term at $x \ge 83$ outside $[0.44, 0.60]$ | no; the exact ladder and A144311 both end at $x = 79$ | +| "no earlier two-class upper bound" | CALIBRATED ABSENCE | one citation in the owning convention | searched in the owning convention (`research/SEARCH-CONVENTIONS.md` §3, row "Published upper bound on $G_2$", which carries no date; the §5 sweeps behind it are dated 2026-08-18; `research/PRIOR-ART.md` row "Iwaniec-type upper bound for 2 omitted classes") | | §5 | elementary implications and scoped method limits | an independently proved estimate at the stated target scale | none supplied here; no universal impossibility claim | ## 7. Relation to the rest of the repository @@ -282,8 +295,10 @@ verification record; `paper/kk-lower-bound.md` carries Theorems 2b and 2c with a per-number provenance appendix; `research/G2-STATE.md` carries the full state of the object with a calibration marker on every line; -`research/OUTCOMES.md` indexes the seventy-two routes tried toward a lower -exponent and closed. The current campaign benchmarks classical Chen input on +`research/OUTCOMES.md` holds the routes tried toward a lower exponent and +closed, one line each; `research/G2-STATE.md` §0's recount of 2026-08-30 puts +them at 72, though its own breakdown there (67, then 2, then 4 added) sums to +73, so the count is quoted as the register's and not re-derived here. The current campaign benchmarks classical Chen input on long intervals before proposing a signed extension; its scope is in `README.md` §Status. @@ -293,17 +308,20 @@ Method*, Cambridge Tracts in Mathematics 177, CUP 2008. Theorem 9.1, Definition 1.3, Example 1.2, §6.5. - A. Booker, T. D. Browning, *Square-free values of reducible polynomials*, - Discrete Analysis 2016:8; ancillary table giving $\beta_2$ to twenty + Discrete Analysis 2016:8, DOI 10.19086/da.732; ancillary table giving $\beta_2$ to twenty decimals. - C. S. Franze, *Sifting limits for the $\Lambda^2\Lambda^-$ sieve*, J. Number - Theory 131 (2011), arXiv:1012.3809. + Theory 131 (2011), DOI 10.1016/j.jnt.2011.04.008, arXiv:1012.3809. - H. Iwaniec, *On the problem of Jacobsthal*, Demonstratio Math. 11 (1978). - K. Ford, B. Green, S. Konyagin, J. Maynard, T. Tao, *Long gaps between primes*, J. Amer. Math. Soc. 31 (2018), arXiv:1412.5029. - A. Kalmynin, S. Konyagin, *A polynomial analogue of Jacobsthal function*, - Izv. Math. 88:2 (2024), arXiv:2302.00459. + Izv. Math. 88:2 (2024) 225–235, DOI 10.4213/im9467e, arXiv:2302.00459. - M. Ziller, J. F. Morack, *Algorithmic concepts for the computation of - Jacobsthal's function*, arXiv:1611.03310; and OEIS A288815. + Jacobsthal's function*, arXiv:1611.03310. +- M. Ziller, J. F. Morack, *Divisibility in paired progressions, Goldbach's + conjecture, and the infinitude of prime pairs*, arXiv:1706.00317 (2017); the + paired Jacobsthal function $h_2$, OEIS A288815. - OEIS A144311 (A. Carter 2008; M. Alekseyev 2009; J. Wang 2024), A059861, A048670. - Erdős Problems #687, https://www.erdosproblems.com/687, as edited 2026-08-31;