Pith. Sign in

REVIEW

The Hardy-Littlewood asymptotic for prime pairs of fixed even difference from a uniform zeta-ratios conjecture

Number Theory · Submitted 23 Oct 2026

Pith's verdict: Serious conditional result on prime pairs of gap four; the diagonal-term factor error flagged by the stress test is real but repairable, and the central mechanism survives.

T0 · AI review

How this review was made: An AI referee (deepseek/deepseek-v4-flash) read the paper on October 26, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 2 major objections · 3 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2610.32672 (version 2)
Pith IDIB7OQRJP, Pith's permanent record of this paper and its review
CitationSeungju Lee. "The Hardy-Littlewood asymptotic for prime pairs of fixed even difference from a uniform zeta-ratios conjecture." arXiv:2610.32672 (2026). https://pith.science/paper/IB7OQRJP
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report
The paper

The paper claims

This paper proves the Hardy-Littlewood asymptotic for prime pairs of difference four from one restricted zeta-ratios formula, without the Riemann hypothesis.

The reading

This paper shows that the Hardy-Littlewood prediction for prime pairs of distance four — the claim that the number of primes $p\le x$ with $p+4$ also prime behaves like $2C_2x/(\log x)^2$ — follows from a single restricted version of the L-functions ratios conjecture, an assumed formula for averages of ratios of zeta values. That formula, Hypothesis 2.1, is the paper's only unproved input: the Riemann hypothesis is not assumed, and even the zero-free strip and zero-count bounds used in the proof are extracted from the formula itself rather than from standard theorems. The argument keeps the crossed zero residues in a Mellin inversion and uses two nonnegative weights whose Fourier transforms agree at zero but are equal and opposite at the frequency that selects the shift four, so the same prime-pair correlation is squeezed between two bounds that agree to the stated error. If the paper is right, the case $k=4$ of Conjecture B is a corollary of one statistical hypothesis about $\zeta$, with a smoothed correlation error $O_\varepsilon(x^{-1/16+\varepsilon})$ that improves to $O_\varepsilon(x^{-3/8+\varepsilon})$ under the Riemann hypothesis.

What carries the argument

The argument is carried by four objects. First, Hypothesis 2.1, the uniform two-over-two zeta-ratios formula (2.3): an integral average of a ratio of four zeta values over a segment of the critical line, asserted to equal an explicit main term plus a swapped-term integral with error $O_\varepsilon(U^{1/2+\varepsilon})$; from this one formula the paper derives the zero-free strip $35/64\le\Re s\le37/64$, the bound $\zeta'/\zeta(9/16+iv)\ll\log^2(2+|v|)$, and the zero count $N_{>}(9/16,T)\ll_\varepsilon T^{1/2+\varepsilon}$ (Lemma 2.2). Second, the two nonnegative time weights $g_\pm(t)=h(t)^2(1\pm\cos(8\pi t))$, whose Fourier transforms $\phi_\pm$ agree at zero and satisfy $\phi_-=-\phi_+$ on the side intervals that select the shift $j=4$; the two inequalities of (6.5), each bounding $I_\pm(x)$ from below by the $|Q_x|^2$ moment minus crossed pole-zero error terms, pinch the difference-four correlation between matching upper and lower bounds. Third, the Mellin decomposition $P_x(t)=Q_x(t)+R_x(t)-Z_x(t)$, which keeps the crossed zero residues $Z_x$ in play and bounds their mixed term with $Q_x$ using the zero-count estimates. Fourth, the singular-series Dirichlet series $D_S(z)=\sum_k S(k)k^{-z}=\zeta(z)\zeta(1+z)A(z)$, whose Fourier inversion collapses the main terms exactly to $S(4)=2C_2$. Section 8 adds the Nyman-Beurling approximant $a_N(d)=\mu(d)(1-\log d/\log N)$; through it the truncated Chebyshev function is expressed and the exact second-difference identity (8.7) is obtained.

Extended reading notes

Core claim

On its own terms, the paper's central claim is Theorem 1.1: under Hypothesis 2.1 — the uniform two-over-two zeta-ratios formula (2.3) with error $O_\varepsilon(U^{1/2+\varepsilon})$ for shifts with real parts in $[3/64,5/64]$ and imaginary parts of size at most $U^{1/4}$ — one obtains $\sum_{n\le x}\Lambda(n)\Lambda(n+4)=2C_2x+o(x)$, the same asymptotic for $A_4(x)$, and $\pi_4(x)\sim 2C_2x/(\log x)^2$, where $C_2$ is the twin-prime constant and $S(4)=2C_2$ is the singular series for difference four. The quantitative engine is Theorem 1.2: for a fixed real smooth weight $W$ supported in $(1,101/100)$, the correlation sum with weight $W(n/x)^2/n$ equals $2C_2\int_0^\infty W(u)^2\,du/u$ with error $O_{W,\varepsilon}(x^{-1/16+\varepsilon})$, improved to $O_{W,\varepsilon}(x^{-3/8+\varepsilon})$ if the Riemann hypothesis is added. Two corollaries extend the reach: the logarithmically weighted prime-pair sum satisfies $B_4(x)=2C_2\log x+o(\log x)$, and the second finite difference of integrals of squared increments of the truncated Chebyshev function equals $4C_2x+o(x)$, tying the pair problem to a finite Nyman-Beurling approximant. Throughout, the zero-free strip (2.6), the zero-count bound (2.8), and the differentiated ratio mean (2.14) are derived from the hypothesis itself rather than assumed.

Load-bearing premise

Every theorem rests on Hypothesis 2.1, the unproved assertion that an average of a specific ratio of four zeta-function values over an interval of length $U$ equals its two explicit main terms with error $O_\varepsilon(U^{1/2+\varepsilon})$, uniformly over the stated box of shifts; if that formula fails, the zero-free strip, the zero count, the differentiated ratio mean, and the prime-pair asymptotics all collapse with it.

Editorial extensions

If this is right

  • The full Hardy-Littlewood asymptotic for difference four — Conjecture B at $k=4$ — is a corollary of the restricted ratios formula (2.3), with the Riemann hypothesis playing no role in the main theorem.
  • For fixed smooth weights the correlation error is $O_\varepsilon(x^{-1/16+\varepsilon})$ unconditionally and $O_\varepsilon(x^{-3/8+\varepsilon})$ under RH, so a qualitative conjecture becomes quantitative control on weighted prime-pair sums.
  • The logarithmically weighted sum $B_4(x)=2C_2\log x+o(\log x)$ and the second-difference asymptotic $F_x(5)-2F_x(4)+F_x(3)=4C_2x+o(x)$ follow, the latter connecting the pair problem to the Nyman-Beurling criterion.
  • Because $S(4)=2C_2>0$, the results give eventual lower bounds: $B_4(x)\ge c\log x$ for every $c<2C_2$, and the relevant second difference is at least $cx$ for every $c<4C_2$, for all sufficiently large $x$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The pinching mechanism is not visibly tied to the number four: the same scheme would handle any fixed even difference $2k$ provided one can construct nonnegative weights whose Fourier transforms agree at zero and are opposite in sign on the side interval selecting that $k$. The paper does not claim this; it is the natural next test of the method.
  • The unconditional error exponent $-1/16$ and the RH exponent $-3/8$ are set by the zero-count bounds extracted from Hypothesis 2.1, so any future strengthening of those bounds would feed directly into the correlation error; the proof shows this coupling but does not state it as a general principle.
  • Lemma 2.2 turns a statistical averaging assumption into the concrete arithmetic fact that $\zeta$ has no zeros with real part in $[35/64,37/64]$. Because this is checkable with existing zero-location algorithms, the hypothesis carries a sharp, falsifiable fingerprint that deserves direct computational scrutiny.
  • If the same pinching argument could be run for every even difference at once under one uniform ratios formula, the entire Hardy-Littlewood Conjecture B would follow by the same mechanism; this paper proves only the case $k=4$, so the general claim remains an extrapolation.
Original abstract

We prove the Hardy-Littlewood asymptotic for prime pairs of every fixed positive even difference $h$ from a restricted uniform two-over-two zeta-ratios formula. The formula may have error $O_\varepsilon(U^{\vartheta+\varepsilon})$ for any fixed $1/2\le\vartheta<(39-\sqrt{177})/32$. The real parts of all four shifts lie in $[3/64,5/64]$; their imaginary parts need only have absolute value at most $U^\nu$, for a fixed $0<\nu\le1/4$. For a fixed real smooth weight supported in $(1,1+1/(25h))$, we obtain an error $O_{h,W,\varepsilon}(x^{-\Delta(\vartheta)+\varepsilon})$ in the correlation sum with weight $W(n/x)^2/n$, where $\Delta(\vartheta)=7/16-\vartheta+\vartheta/(3-\vartheta)>0$. Adding the Riemann hypothesis improves this error to $O_{h,W,\varepsilon}(x^{\vartheta-7/8+\varepsilon})$. The proof retains the crossed zero residues in Mellin inversion and estimates their mixed term with the logarithmic-derivative integral. Two nonnegative time weights have the same diagonal term and opposite coefficients for the difference $h$. We deduce the logarithmic asymptotic for the weighted prime-pair sum $B_h$ and an asymptotic for the second finite difference of integrals of squared increments of the truncated Chebyshev function. The latter is connected to a logarithmically weighted M\"obius approximant in the Nyman-Beurling criterion by finite identities.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-10-26: 1 request, 6,447 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.59 · human participants 0.01 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.97 · compares with prior results 0.27 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We prove the Hardy--Littlewood asymptotic for prime pairs of difference four from a restricted uniform two-over-two zeta-ratios formula. The formula has error $O_\varepsilon(U^{1/2+\varepsilon})$, real parts of all four shifts in $[3/64,5/64]$, and imaginary parts of absolute value at most $U^{1/4}$. For a fixed real smooth weight supported in $(1,101/100)$, we obtain an error $O_\varepsilon(x^{-1/16+\varepsilon})$ in the correlation sum with weight $W(n/x)^2/n$. Adding the Riemann hypothesis improves this error to $O_\varepsilon(x^{-3/8+\varepsilon})$. The proof retains the crossed zero residues in Mellin inversion and estimates their mixed term with the logarithmic-derivative integral. Two nonnegative time weights have the same diagonal term and opposite coefficients for the difference four. We deduce the logarithmic asymptotic for the weighted prime-pair sum $B_4$ and an asymptotic for the second finite difference of integrals of squared increments of the truncated Chebyshev function. The latter is connected to a logarithmically weighted M\"obius approximant in the Nyman--Beurling criterion by finite identities.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We prove the Hardy--Littlewood asymptotic for prime pairs of difference four from a restricted uniform two-over-two zeta-ratios formula. result 0.61 0.96 0.95 asserted 1.00
s1 The formula has error $O_\varepsilon(U^{1/2+\varepsilon})$, real parts of all four shifts in $[3/64,5/64]$, and imaginary parts of absolute value at most $U^{1/4}$. result 0.63 0.66 0.05 asserted 0.99
s2 For a fixed real smooth weight supported in $(1,101/100)$, we obtain an error $O_\varepsilon(x^{-1/16+\varepsilon})$ in the correlation sum with weight $W(n/x)^2/n$. result 0.97 0.93 0.06 asserted 1.00
s3 Adding the Riemann hypothesis improves this error to $O_\varepsilon(x^{-3/8+\varepsilon})$. result 0.96 0.77 0.06 asserted 0.98
s4 The proof retains the crossed zero residues in Mellin inversion and estimates their mixed term with the logarithmic-derivative integral. method 0.99 0.91 0.03 asserted 1.00
s5 Two nonnegative time weights have the same diagonal term and opposite coefficients for the difference four. result 0.58 0.67 0.03 asserted 1.00
s6 We deduce the logarithmic asymptotic for the weighted prime-pair sum $B_4$ and an asymptotic for the second finite difference of integrals of squared increments of the truncated Chebyshev function. result 0.98 0.94 0.19 asserted 1.00
s7 The latter is connected to a logarithmically weighted M\"obius approximant in the Nyman--Beurling criterion by finite identities. interpretation 0.72 0.78 0.04 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

References

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.