=================================================================== --- a/paper/kk-lower-bound.md version 2 +++ b/paper/kk-lower-bound.md version 3 @@ -68,10 +68,10 @@ Theorem 1] is not itself a theorem about $G_2$. Sections 4--7 below adapt its proof architecture to this specific pair. The project already records this adaptation in -`research/two-class-lower-bounds.md`, section 4c, and in the live manuscript -`paper/kk-lower-bound.md`, sections 4--7 [R2, R4]. This draft supplies a +`research/two-class-lower-bounds.md`, section 4c, and in the prior edition of +this manuscript (version 1, [R4]), sections 4--7 [R2, R4]. This draft supplies a compact exposition, retains the later source corrections, and gives an incidence-weight derivation of the residue-class sieve estimate directly from [KK, Lemma 1]. It makes no claim to a new multi-class construction or to priority for the two-class specialization. @@ -144,10 +144,13 @@ We use only $z\leq X$; its proportionality constant is fixed. The statement was read in arXiv v2, page 4, and in the journal's online text. Its proof cites Halberstam and Richert, *Sieve Methods* (1974), Theorem 2.2. That printed book theorem has not been independently read -here. Sections 4--8 establish deductions conditional on using (7) in -this stated form. They do not reconstruct its underlying sieve proof. +here. A second carrier of the same statement is [FI], Theorem 6.9 with +Corollary 6.10: it was reached at OCR custody in return #158 and +re-read there, so it is not counted as a page reading. Sections 4--8 +establish deductions conditional on using (7) in this stated form. They +do not reconstruct its underlying sieve proof. **Input M.** Mertens' prime harmonic estimate is $$ \sum_{p\leq t}\frac1p=\log\log t+M+o(1). @@ -165,9 +168,12 @@ \Psi(X,Z)=X u^{-(1+o(1))u} \tag{9} $$ as $Z,u\to\infty$, uniformly when $u\leq Z^{1-\varepsilon}$. -The formula and its range were read from the primary page image. +The formula and its range were read from the primary page image: this is +the printed range of Corollary 1.3 (p. 417). In $x,y$ the source restates +the underlying range (1.13) of its Theorem 1.2 as +$(\log x)^{1+\varepsilon}\leq y\leq x$, (1.13)$'$ on p. 418. We will use only its upper-bound consequence. **Input P.** The prime number theorem gives $$ @@ -297,9 +303,9 @@ This proves the assertion. $\square$ The term $m+2$ in (14) and (16) is required. Replacing $2(m+2)/y$ by the smaller $2m/y$ inside this finite inequality is -not valid. The historical draft makes that error; the live version +not valid. The historical draft makes that error; version 1 records its correction [R3, section 4; R4, equation (5.1)]. Condition (14) is sufficient. We claim no converse. In the notation of [KK], no nonlinear-factor case remains: the two @@ -436,9 +442,9 @@ $$ G_2(P(y))\gg y\log y. \tag{27} $$ -This is Theorem A of the live manuscript [R4, section 9]. +This is Theorem A of version 1 [R4, section 9]. For completeness, let $m=\lfloor c y\log y\rfloor$ and $z=\sqrt m$, with $c>0$ fixed and sufficiently small. Choose $a_p=0$ for $p\leq z$. @@ -454,8 +460,16 @@ $\pi(y)-\pi(z)\sim y/\log y$. Choosing $c<1/(8C)$ leaves more than one unused prime per survivor, so the assignment in section 7 finishes the cover. +If that constant is priced at all, the cited form gives +$C=2C_2e^{-2\gamma}C_1=0.41621\,C_1$ with $C_1(1/2)=805.5$ +($\delta=0.05$, $K=3$), hence $c_0<1/(8C)<3.7\times10^{-4}$ +([FI, Theorem 6.9 and Corollary 6.10], conditional on that reading). +The value $7.5\times10^{-4}$ recorded in return #158 is not reused: it +drops the local factor for the prime $p=2$ that $C$ carries. That is a +priced constant, not a certified threshold. + This argument does not use the smooth-number input, but it still uses Input S. It cannot be described as having escaped the unread Halberstam--Richert source dependency. Its composition has the same project-derived, unrefereed status. In asymptotic size, (1) is stronger @@ -468,9 +482,9 @@ show $G_2(P(y))=o(y^2)$. It also gives no claim about a prescribed prime-sized interval containing a twin pair. No assertion in this note changes the project's standing upper-bound problem. -This draft uses the live source record rather than reproducing the +This draft uses the source record rather than reproducing the historical quick draft unchanged: | Item | Treatment in this manuscript | |---|---| @@ -488,11 +502,16 @@ Here no explicit Rosser--Schoenfeld or Dusart error formula is needed. Likewise, the earlier finite tests of the covering step remain cited historical evidence, not executions by this manuscript's preparer. -The next mathematical review should check Input S against a printed -upper-sieve theorem, including its uniformity for these changing -residue systems, and then inspect the reduction in sections 4--7. +The uniformity for these changing residue systems is settled under +Input S as quoted: its constant depends only on $\kappa$ (in the +Halberstam--Richert form as cited, on $\kappa,A_1,A_2$), and those +quantities are uniform here, because $g(p)\leq4$ and $g(p)/p\leq4/5$ +follow from (18) with $g$ integer-valued ($g(2)=1$, $g(3)=2$, and +$g(p)\leq4$ for $p\geq5$). The next mathematical review should check +Input S against a printed upper-sieve theorem and then inspect the +reduction in sections 4--7. Tracking all constants would be a separate task. Optimizing the bands or proving an optimal growth law is also left open. No additional logarithmic factor is asserted on the basis of a heuristic multi-cover argument. @@ -534,9 +553,10 @@ The 1974 Halberstam--Richert pages were not accessed in this assignment. We retain the source registry's documented access limitation rather than repeating its failed retrievals or presenting OCR as a page reading. -No new citation-count claim is made. +The [FI] carrier recorded in section 3 sits at that same OCR custody and +is not a page reading either. No new citation-count claim is made. ### Primary references - **[KK]** A. B. Kalmynin and S. V. Konyagin, *A polynomial analogue of @@ -559,8 +579,14 @@ - **[HR]** H. Halberstam and H.-E. Richert, *Sieve Methods*, Academic Press, 1974, Theorem 2.2, pp. 68--69 as identified in the project source record. Cited through [KK]. Original printed pages not read in this assignment. +- **[FI]** J. B. Friedlander and H. Iwaniec, *Opera de Cribro*, AMS + Colloquium Publications 57, 2010, Theorem 6.9 with Corollary 6.10, + pp. 68--69. Second carrier of the Theorem 2.2 statement used through + [KK]; reached at OCR custody in return #158 and re-read there, labeled + OCR rather than a page reading (section 10). Original printed pages + not read at page image in this assignment. - **[O]** [OEIS A144311](https://oeis.org/A144311), definition and attribution, revision 23 dated 5 December 2024, inspected 18 September 2026. The current entry contains 22 values. They were not recomputed or reproduced as a new dataset here. @@ -582,10 +608,12 @@ [Historical quick draft](/projects/twin-primes/docs/paper/proposals/draft-kk-lower-bound.md), especially sections 3--5. Superseded finite inequality is not reused. SHA-256 `d3de944c59a8c885c599e89b8ba9d3c23c027f0b587f6719c37e1cb14e6373c5`. - **[R4]** - [A lower bound for the two-class Jacobsthal function](/projects/twin-primes/docs/paper/kk-lower-bound.md), - live manuscript, sections 2--9 and 11--12. + [A lower bound for the two-class Jacobsthal function](/files/7c375d9510a22b6fc2c6241eeffe51c1d92cb9daa17e4eba63220ed1c29c107f), + version 1 (the prior edition of this manuscript), sections 2--9 and + 11--12, pinned by content address so that the section references above + do not follow the served slug as it is revised. SHA-256 `7c375d9510a22b6fc2c6241eeffe51c1d92cb9daa17e4eba63220ed1c29c107f`. - **[R5]** [Search conventions](/projects/twin-primes/docs/research/SEARCH-CONVENTIONS.md), sections 1, 3 and 5. @@ -610,9 +638,12 @@ developed over six years of independent work, as recorded in [R7]. Formal derivations, literature audits, computations and manuscript drafting in the project have used AI assistance under the author's direction. This revision was prepared with GitHub Copilot CLI using -GPT-6 Astra. Its mathematical work consisted of source inspection, +GPT-6 Astra. The correction pass of 25 September 2026 was prepared with +Freebuff on deepseek-v4-flash, under the same author direction, and +changed the source-custody statements, the [R4] pointer and the priced +constant only. Its mathematical work consisted of source inspection, exposition and checking the displayed deductions, not a new numerical experiment. Earlier computations have their own cited code and recorded outputs. Finite checks do not establish the asymptotic argument. Refuted intermediate steps and the remaining source-access