Pith. sign in

REVIEW 3 major objections 4 minor 24 references

The exceptional set of the Goldbach problem

T0 review · 3 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A sparse Hardy–Littlewood bound on Goldbach representations rules out Siegel zeros, and a new smoothed explicit formula exposes every L-function zero in the major arcs.

desk verdict The survey half of this paper is genuinely good; the two appended results are credible but under-supported—Proposition 7.5 lacks a proof of convergence for its zero sums, and Theorem 8.2 depends on unverified black-box imports from Pintz. read the letter →

arxiv 2607.27282 v1 pith:R32E3P5X submitted 2026-07-29 math.NT

Lasse Grimmelt , Gautami Bhowmik This is my paper · ORCID
classification math.NT MSC 11P3211M2611M41
keywords GoldbachproblemexceptionalsetHardy-LittlewoodconjecturecirclemethodSiegelzerosDirichletL-functionsgeneralizedsingularseriesexplicitformula
topics Goldbach's ConjectureThe Riemann Hypothesis
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper is mostly a survey of the exceptional set in the binary Goldbach problem, tracing how the circle method evolved from Hardy–Littlewood through Montgomery–Vaughan to Pintz's power saving. Its first new contribution is a fully explicit major-arc formula: using a smooth major-arc weight, the smoothed count of representations of N as a sum of two primes is shown, in mean square over N ≤ X, to equal the singular-series main term plus an explicit sum over all zeros of all Dirichlet L-functions of conductor at most X^ϑ, with error (X^{3−ϑ}+X^{13/5})(log X)^5. Its second new contribution is a theorem: if a sparse form of the Hardy–Littlewood conjecture holds for even multiples of a conductor r̃ at scale X = r̃^A with A > 5/2, allowing only X^{3/5} exceptions, then the associated primitive real character has no real zero above 1 − c/log X. A sympathetic reader would care because the second result shows that a plausible average statement about prime sums, even with a power-sized exceptional set, is incompatible with the existence of exceptional zeros—one of the central obstructions in the subject.

What carries the argument

The load-bearing mechanism is the smooth major-arc weight b_R(n) = Σ_{q≤R} c_q(n) G_{T_q}(n), built from Ramanujan sums c_q(n) and a compactly supported cutoff G with scale T_q = η X q/R. Its Fourier transform is approximately an oscillatory sum of translated copies of a smooth window; it is 1 + O(η²) on major arcs and O(1) on minor arcs. This lets the smoothed exponential sum S_φ(α) be expanded, via character orthogonality and the explicit formula, term by term, producing the archimedean factors I_φ_q(ρ_1,ρ_2) and the generalized singular series S(χ_1,χ_2,N), and bringing all zeros of all L-functions of conductor ≤ R explicitly into the approximation. In Section 8, the same structure, combi

What would settle it

Test the configuration directly: fix a primitive real character χ̃ mod r̃ and suppose it has a real zero β̃ > 1 − c/log X with X = r̃^A, A > 5/2. Compute r_2(N) for all even multiples N of r̃ in [X/2,X] and check whether δS(N)N ≤ r_2(N) ≤ (2−δ)S(N)N holds for all but X^{3/5} of them. If the bounds hold, Theorem 8.2 asserts the zero cannot exist; if the bounds fail, the theorem is moot. A more targeted check: verify the oscillation pattern r_2(N) ≈ (1 + χ̃(−1)B(β̃,β̃)N^{−2δ'})S(N)N across multiples of r̃, which the proof of Theorem 8.2 predicts must occur whenever β̃ > 1 − c/log X.

Watch

Extended reading notes

Core claim

The paper establishes two new results. First, Proposition 7.5: for R = X^ϑ with 0 < ϑ < 4/9, the smoothed Goldbach count r_φ(N) satisfies Σ_{N≤X} |r_φ(N) − N S(N) − M(N;R) − Z(N;R)|² ≪ (X^{3−ϑ} + X^{13/5})(log X)^5, where M and Z collect, explicitly, the contribution of every zero of every Dirichlet L-function of conductor at most R. Second, Theorem 8.2: if for some A > 5/2 and δ ∈ (0,1) the sparse Hardy–Littlewood bounds δS(N)N ≤ r_2(N) ≤ (2−δ)S(N)N hold for all but at most X^{3/5} even multiples N of r̃ in [X/2,X], with X = r̃^A, then no primitive real character χ̃ mod r̃ has a real zero β̃ > 1 − c/log X. The proof of the second result runs by contradiction: if such a zero existed, the Deu

Load-bearing premise

The proof of Theorem 8.2 depends on imported quantitative estimates from Pintz's explicit formula—the Deuring–Heilbronn zero-spacing bound, the closed-form evaluation S(χ̃,χ̃,N) = χ̃(−1)S(N), and the error terms in (8.3)—which are cited without proof here; if any of these inherited estimates fails in the stated ranges, the oscillation argument that forces the contradiction collapses.

Editorial extensions

If this is right

  • If Proposition 7.5 is correct, the smoothed Goldbach count admits a mean-square approximation in which every zero of every L-function of conductor at most X^ϑ appears explicitly, with a power saving of the form (X^{3−ϑ} + X^{13/5})(log X)^5.
  • If Theorem 8.2 is correct, a sparse version of the Hardy–Littlewood conjecture—even one allowing X^{3/5} exceptions—would rule out Siegel zeros entirely, eliminating a major source of ineffectivity in analytic number theory.
  • The explicit formula generalizes Pintz's earlier finite-over-zero formula to an infinite sum over all zeros, with the smooth weight introducing an explicit archimedean factor B_φ(ρ_1,ρ_2) that reduces to the classical beta factor when the zeros are close to the real axis.
  • The restriction ϑ ≥ 2/5 in the proof of Theorem 8.2 is forced by the Vinogradov minor-arc bound, suggesting that improvements to that bound would directly improve the allowable scale A > 5/2 in the sparse Hardy–Littlewood hypothesis.

Reading between the lines

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

  • The smooth-weight construction may be adaptable to Heath-Brown's variant of the circle method; the authors themselves note that such ideas could circumvent the interval shortening caused by η = R^{−1/4}, potentially extending the range of ϑ in Proposition 7.5.
  • Neighbouring results require only a single multiple of the conductor to exclude a Siegel zero, whereas Theorem 8.2 needs a power-sized family; the oscillatory mechanism here suggests the sparse hypothesis could be substantially relaxed, and the X^{3/5} exception threshold is likely an artifact of the current minor-arc technology rather than a fundamental barrier.
  • A concrete, testable prediction of Theorem 8.2 is that if a real zero β̃ > 1 − c/log X existed for a primitive character χ̃ mod r̃, then among the even multiples N of r̃ near X = r̃^A, the count r_2(N) would alternate between values near 0 and near 2S(N)N according to the sign χ̃(−1)—an oscillation that numerical computation at small r̃ and modest A could in principle detect.
  • Because the main term in Proposition 7.5 is a mean-square identity, it may be used to derive higher moments of the Goldbach representation function, potentially yielding exceptional-set bounds via distributional arguments rather than pointwise major-arc estimates.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper is a survey of the exceptional set in the binary Goldbach problem, covering the Hardy–Littlewood circle method, Siegel–Walfisz and Vinogradov, the Montgomery–Vaughan power saving, and Pintz's refinement. It then claims two new results: Proposition 7.5, a mean-square explicit formula for a smoothed Goldbach count r_φ(N) in terms of N S(N) plus explicit sums M(N;R), Z(N;R) over all zeros of all Dirichlet L-functions of conductor at most R, with error O((X^{3−ϑ}+X^{13/5})(log X)^5); and Theorem 8.2, asserting that a sparse Hardy–Littlewood-type lower and upper bound on r_2(N) along multiples of r̃ rules out a real zero β̃ > 1 − c/log X for the corresponding quadratic character. The survey portion is informative and largely accurate; the new results are not yet supported by the arguments as written.

Significance. If Proposition 7.5 and Theorem 8.2 could be made fully rigorous, they would be interesting contributions: the former would provide a smooth major-arc formula keeping all zeros explicit, and the latter would show that a very sparse Goldbach condition at conductor-multiples is incompatible with a Siegel zero. The survey component is genuinely useful and well organized, and the paper correctly credits the earlier literature. However, the new proofs contain load-bearing gaps in exactly the places where the claims go beyond existing results, so the current version is not ready for publication as a research article.

major comments (3)
  1. [§7.2, Lemma 7.3 (Eq. 7.8)] The proof of the second-moment bound uses Parseval to replace ∑_{N≤X} |∫ S_φ(α)^2(1−b̂_R(α))e(−Nα)dα|^2 by ∫ |S_φ|^4 |1−b̂_R|^2 dα. But S_φ(α)=∑ Λ(n)φ(n/N)e(nα) is defined with the same N that is being summed, so these integrals are not Fourier coefficients of a single fixed function. The displayed Parseval identity is therefore invalid. Relatedly, Lemma 7.2 requires 10R^2≤ηN, which cannot hold for the small N in the range ∑_{N≤X}; this part of the range is not controlled. This invalidates the derivation of (7.8) and hence Proposition 7.5.
  2. [§7.4, Lemma 7.4 and Prop 7.5 (Eqs. 7.15–7.17)] Lemma 7.4 is quoted as 'standard' with no proof or reference, but the application requires more than absolute convergence for a single fixed test function. The sums M(N;R) and Z(N;R) are infinite over all zeros of every primitive character of conductor ≤R. Lemma 7.6 bounds one archimedean factor with decay (1+(|Im ρ1|+|Im ρ2|)T_q/N)^{−A}, and T_q/N ≤ R^{−1/4}; it is never summed over the roughly R^2 characters and over the relevant zeros. In particular, zeros with |Im ρ| of size R^{1/4} are not damped, and no estimate shows that the double zero sums contribute within the claimed O((X^{3−ϑ}+X^{13/5})(log X)^5). The central explicit-formula result is therefore unsupported.
  3. [§8, Prop 8.1 and Thm 8.2] Theorem 8.2 rests on Proposition 8.1, whose proof sketch imports three quantitative facts from [20] without exact statements or verification: the Deuring–Heilbronn range (8.2), the closed form S(χ̃,χ̃,N)=χ̃(−1)S(N) in (8.1), and the error terms in (8.3), including O(S(N)X(δ̃L)^{c1}). These are load-bearing because the final oscillation argument needs the secondary main term to have the stated size and sign after subtracting the errors. If any of these inherited estimates fails in the stated ranges, the contradiction with (8.4) collapses. Please either prove these facts or quote exact theorem/lemma numbers with the hypotheses needed here.
minor comments (4)
  1. [§6.2] The text refers to 'Pintz's first paper [20]' and then to 'Pintz's second paper [20]'; one of these should presumably be [21]. The reference labels in the introduction also alternate between [20] and [21] in a confusing way.
  2. [Abstract and §7] The phrase 'fully explicit formula' is stronger than what is proved: (7.17) is a mean-square bound for a smoothed count, with an O(error) and with infinite zero sums whose convergence is not established. The wording should reflect this.
  3. [Eq. (7.10)] There is a typo: 'pbRep' should be 'b̂_R'.
  4. [General presentation] The text contains many typographical artifacts, such as missing words ('zeros', 'contribute', 'bad') and malformed mathematical expressions. These should be corrected in a final version.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; the new results are conditional on external theorems (Pintz's explicit formula) and do not assume their own conclusions.

full rationale

The paper's two new claims are Proposition 7.5 and Theorem 8.2. Proposition 7.5 is derived from a smoothed major-arc weight (Lemma 7.2), a second-moment approximation (Lemma 7.3), and a quoted 'standard' smoothed explicit formula (Lemma 7.4). While Lemma 7.4 is stated without proof or citation, and the convergence/truncation of the infinite zero sums in (7.15)-(7.16) is not discussed, these are gaps in justification rather than circularity: the asserted equality r_phi(N) ≈ N S(N) + M(N;R) + Z(N;R) is not true by definition, and the normalization ∫ φ(t)φ(1−t)dt = 1 is a convention fixing the main term, not a fitted parameter. Theorem 8.2 assumes a sparse Hardy-Littlewood-type bound (8.4) and derives the non-existence of a Siegel zero; the conclusion is not a restatement of the hypothesis, and the proof routes through Proposition 8.1, which imports quantitative facts from Pintz [20] (Deuring-Heilbronn range, closed form of S(χ̃,χ̃,N), and error terms). These are external results, not self-citations by the present authors, and the argument does not assume the conclusion. The only self-citation is contextual: the introduction to Section 8 lists 'the first author and Halupczok [1]' alongside other prior work on conditional Siegel-zero results; this is not load-bearing for the new theorem. Overall, the derivation chain is independent of its conclusions, so the circularity score is minimal.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

No data fitting occurs anywhere; the free parameters are hand-chosen analysis scales (η, T_q, ϑ) and arbitrary smoothing functions whose precise choice does not change the validity of the statements, only the constants. The genuine 'cost' of the new results is external: Theorem 8.2 presupposes Pintz's explicit-formula machinery and the Main Lemma of [20], and Prop 7.5 presupposes the unproved/unreferenced Lemma 7.4 and an asserted minor-arc bound for the smoothed sum S_φ. The sparse Hardy–Littlewood hypothesis (8.4) is a hypothesis of Theorem 8.2, not a derived fact. No invented entities are introduced; the weight b_R is a technical device.

free parameters (4)
  • η = R^{-1/4} = R^{-1/4}
    Smoothing-scale parameter set before (7.9) ('Optimising with η=R^{-1/4}'); hand-chosen to balance the η⁴X³ and X³/R errors in (7.8). Not fitted to data; the theorem holds for the whole admissible range, with constants depending on it.
  • T_q = ηNq/R = ηNq/R
    Per-arc smoothing width in Definition 7.1; chosen so that T_q·‖α−a/q‖ ≤ η on the arc around a/q, making Lemma 7.2's main-term approximation hold.
  • ϑ (major-arc cutoff exponent, R=X^ϑ) = 0<ϑ<4/9 (§7); ϑ=2/5 fixed in §8
    Theorems are stated for any ϑ in the range; §8 fixes ϑ=2/5 to match the X^{3/5} minor-arc exception density from Prop 4.1. A free parameter of the method, not fitted.
  • smoothing functions φ and G = arbitrary C_c^∞; ∫φ(t)φ(1−t)dt=1 (7.1); ∫G=1, G≡1 on [−1,1], supp G⊂[−2,2]
    The truth of (7.17) is insensitive to the choice (only implied constants change); these are conventions, not fitted values.
assumptions (6)
  • standard math Smoothed explicit formula (Lemma 7.4): for primitive χ and Ψ∈C_c^∞(S,∞), Σ_{n≥1}Λ(n)χ(n)Ψ(n) = 1_{χ=χ_0^{(1)}}∫₀^∞Ψ − Σ_ρ∫₀^∞Ψ(t)t^{ρ−1}dt + O_A(S^{-A}), the zero sum over all zeros of L(s,χ) converging absolutely.
    Invoked in §7.3 as 'the following standard result' with no proof and no citation; it is the mechanism that turns the character expansion (7.10) into the pole/zero decomposition and hence into the headline formula (7.17).
  • domain assumption The smoothed exponential sum S_φ(α) obeys the same Vinogradov–Vaughan minor-arc bound as S(α) (the RHS of (4.8)).
    Asserted in the proof of Lemma 7.3 without argument; if only a weaker bound held, the error (X³/R + X^{13/5}) in (7.9) would worsen and Prop 7.5's error term would change.
  • standard math Pintz's explicit major-arc formula (Thm 6.3 = [21, Thm 1]/[20, Thm A]) and the Main Lemma of [20] (generalized singular series bounds (6.5)–(6.7); closed form S(χ̃,χ̃,N)=χ̃(−1)S(N) for r̃|N, (8.1)).
    Imported wholesale: Prop 8.1 'starts from' [20, Thm 1] and uses (8.1); Thm 8.2 inherits them. They are published refereed derivations with stated assumptions, so the dependence is legitimate, but the paper does not verify them.
  • standard math Quantitative Deuring–Heilbronn (8.2): a Siegel zero β̃=1−δ̃ forces every other zero ϱ (cond ≤R, |Im ϱ|≤√X) to satisfy 1−Reϱ ≥ c_0(ϑ)log(1/(δ̃L))/L.
    Quoted from [20, Lem. 4.22] in §8; it is what makes the exceptional-zero set E(H1,√X,R,X) contain only (β̃,χ̃).
  • domain assumption Sparse Hardy–Littlewood-type hypothesis (8.4) in Theorem 8.2.
    The theorem is conditional on δS(N)N ≤ r_2(N) ≤ (2−δ)S(N)N holding for all but X^{3/5} even multiples of r̃ in [X/2,X] at X=r̃^A. This is an assumption of the statement — strong and unverified — not a consequence of anything proved in the paper.
  • standard math Standard background: analytic continuation/explicit formulas for ζ and L(s,χ) (§2), Siegel–Walfisz (4.1), Gallagher's zero-density/PNT (Prop 5.2), log-free zero-density (6.1), Siegel's theorem, Linnik's theorem (Thm 6.1), Vinogradov–Vaughan (Prop 4.1).
    The survey's infrastructure; all published results. Prop 4.1 is explicitly not proved ('We will not go into the proof of the crucial estimate (4.8) here', §4.3).

how reviews work

0 comments
Cite this review

Pith. "Pith review of The exceptional set of the Goldbach problem." pith.science (2026). https://pith.science/paper/R32E3P5X

@misc{pith2026260727282,
  author       = {Pith},
  title        = {Pith review of: The exceptional set of the Goldbach problem},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/R32E3P5X}},
  note         = {Machine review of arXiv:2607.27282}
}
read the original abstract

We study the estimates for the number of exceptions to the representation of integers as the sum of at most two prime numbers. Most of this article is a survey that gives an overview of existing results. We begin with the legendary Hardy-Littlewood circle method and show how it paved the way to a power saving by Montgomery-Vaughan in 1975 and Pintz in 2018. We conclude with a new result that is a fully explicit formula for the major arcs. Another new observation is the non-existence of exceptional zeros under a sparse version of the Hardy-Littlewood conjecture. The survey part of this article aims to be accessible to an audience that has not encountered these techniques before.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 2 linked inside Pith

  1. [20]

    J. Pintz. A new explicit formula in the additive theory of primes with applications I. The explicit formula for the Goldbach problem and the Generalized Twin Prime Problem.Acta Arithm., 210:53–94, 2023. arXiv:1804.05561

    arXiv 2023

  2. [1]

    Conditional bounds on Siegel zeros

    Gautami Bhowmik and Karin Halupczok. Conditional bounds on Siegel zeros. InCombinatorial and additive number theory IV, volume 347 ofSpringer Proc. Math. Stat., pages 25–39. Springer, Cham, [2021]©2021

    2021

  3. [2]

    Chudakov

    Nikolai G. Chudakov. On the Goldbach problem.Doklady Akademii Nauk SSSR, 17:335–338, 1937

    1937

  4. [3]

    Estermann

    T. Estermann. On Goldbach’s Problem : Proof that Almost all Even Positive Integers are Sums of Two Primes.Proc. London Math. Soc. (2), 44(4):307–314, 1938

    1938

  5. [4]

    An application of the Hardy-Littlewood conjecture.J

    JinHua Fei. An application of the Hardy-Littlewood conjecture.J. Number Theory, 168:39–44, 2016

    2016

  6. [5]

    J. B. Friedlander, D. A. Goldston, H. Iwaniec, and A. I. Suriajaya. Exceptional zeros and the Goldbach problem.J. Number Theory, 233:78–86, 2022

    2022

  7. [6]

    P. X. Gallagher. A large sieve density estimate nearσ“1.Invent. Math., 11:329–339, 1970

    1970

  8. [7]

    D. A. Goldston. On Hardy and Littlewood’s contribution to the Goldbach conjecture. InProceedings of the Amalfi Conference on Analytic Number Theory (Maiori, 1989), pages 115–155. Univ. Salerno, Salerno, 1992

    1989

Show all 24 references
  1. [8]

    D. A. Goldston and Ade Irma Suriajaya. Note on the Goldbach conjecture and Landau–Siegel zeros,

  2. [9]

    New large value estimates for dirichlet polynomials.Annals of Math- ematics, 203(2):53, 2026

    Larry Guth and James Maynard. New large value estimates for dirichlet polynomials.Annals of Math- ematics, 203(2):53, 2026

    2026

  3. [10]

    G. H. Hardy and J. E. Littlewood. Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes.Acta Mathematica, 44(none):1 – 70, 1923

    1923

  4. [11]

    D. R. Heath-Brown. The ternary goldbach problem.Revista Matem´ atica Iberoamericana, 1(1):45–59, 1985

    1985

  5. [12]

    D. R. Heath-Brown. Zero-free regions for Dirichletl-functions, and the least prime in an arithmetic progression.Proceedings of the London Mathematical Society, 64(2):265–338, 1992

    1992

  6. [13]

    D. R. Heath-Brown. A new form of the circle method, and its application to quadratic forms.J. Reine Angew. Math., 481:149–206, 1996

    1996

  7. [14]

    On the conditional bounds for Siegel zeros.Acta Math

    Chaohua Jia. On the conditional bounds for Siegel zeros.Acta Math. Sin. (Engl. Ser.), 38(5):869–876, 2022

    2022

  8. [15]

    Yu. V. Linnik. On the least prime in an arithmetic progression I: The basic theorem.Mat. Sbornik N.S., 15(57):139–178, 1944

    1944

  9. [16]

    Siegel zeros, twin primes, Goldbach’s conjecture, and primes in short intervals.Int

    Kaisa Matom¨ aki and Jori Merikoski. Siegel zeros, twin primes, Goldbach’s conjecture, and primes in short intervals.Int. Math. Res. Not. IMRN, 23:20337–20384, 2023

    2023

  10. [17]

    Small gaps between primes.Annals of Mathematics, 181(1):383–413, 2015

    James Maynard. Small gaps between primes.Annals of Mathematics, 181(1):383–413, 2015

    2015

  11. [18]

    H. L. Montgomery and R. C. Vaughan. The exceptional set in Goldbach’s problem.Acta Arith., 27:353– 370, 1975

    1975

  12. [19]

    Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4¨10 18.Math

    Tom´ as Oliveira e Silva, Siegfried Herzog, and Silvio Pardi. Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4¨10 18.Math. Comp., 83(288):2033–2060, 2014

  13. [21]

    A new explicit formula in the additive theory of primes with applications II

    Janos Pintz. A new explicit formula in the additive theory of primes with applications II. The exceptional set in Goldbach’s problem, 2018. arXiv:1804.09084

    2018 arXiv

  14. [22]

    J. G. van der Corput. Sur l’hypothese de Goldbach pour presque tous les nombres pairs.Acta Arith., 2:266–290, 1937

    1937

  15. [23]

    R. C. Vaughan.The Hardy-Littlewood method, volume 125 ofCambridge Tracts in Mathematics. Cam- bridge University Press, Cambridge, second edition, 1997

    1997

  16. [24]

    Bounded gaps between primes.Annals of Mathematics, 179(3):1121–1174, 2014

    Yitang Zhang. Bounded gaps between primes.Annals of Mathematics, 179(3):1121–1174, 2014. 32 Laboratoire Paul Painlev ´e LABEX-C2EMPI , Universit ´e de Lille, Batiment M2, 59655 Villeneuve-d’Ascq Cedex, France Email address:gautami.bhowmik@univ-lille.fr Department of Pure Mathe...

    2014

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.