Submitted:
14 August 2026
Posted:
17 August 2026
You are already at the latest version
Abstract
For \( q≥1 \) and \( gcd(a,q)=1 \) consider the restricted weighted Goldbach sum \( R_{a,q}(N) :=\sum_{\substack{p_1+p_2=N \\ p_1 \equiv a \ (\mathrm{mod}\ q)}} \left({\log{p}}_{1}\right)\left({\log{p}}_{2}\right),\\ \),thesum over primes. We give a fully rigorous, self-contained treatment of the restricted binary, ternary, and quaternary Goldbach problem in this setting. We first prove an elementary but decisive local obstruction: if an odd prime l divides \( q \), then on a positive-density set of even \( N \) the sum \( R_{a,q}(N) \) collapses to \( O(logN) \), so no main term of size \( ≍N/φ(q) \) can hold uniformly; for powers of two \( q=2^{k} \) this obstruction is absent, and we identify the correct local main term \( M_{a,q}(N)=2C_{2}\,\mathfrak{S}(N)N/\varphi (q) \). Within this scope we prove a qualitative almost-all theorem, with a complete major/minor-arc derivation: for fixed \( q=2^{k}, R_{a,q}(N)=M_{a,q}(N)+o_{q}(N) \) for all but \( o_{q}(X) even N≤X \), so the exceptional set has density zero. We record a conditional (hypothesis-explicit) impossibility theorem showing that no threshold independent of X can upgrade this to an effective almost-all statement once a matching second-moment lower bound is granted, and we prove positivity of the restricted quaternary singular series through explicit local densities. We isolate, as honestly labelled structural cautions rather than theorems, the four classical routes (Siegel-zero absorption, Borel–Cantelli divergence, discrepancy explosion, and circle-method saturation at GRH) that fail to upgrade the almost-all theorem to unconditional finiteness of the exceptional set. Throughout we distinguish carefully between what the classical circle method establishes and stronger statements (pointwise asymptotics, explicit numerical thresholds, sub-exponential exceptional-set bounds) that it does not, collecting the latter as precisely stated open problems rather than asserting them.
Keywords:
Goldbach's conjecture
; restricted Goldbach sums
; arithmetic progressions
; singular series
; circle method
; almost-all theorems
; exceptional sets
; local obstructions
1. Introduction
1.1. The Restricted Binary Problem
For even the classical weighted Goldbach function is
and the Hardy–Littlewood conjecture predicts , where
is the twin-prime constant (here and below denote primes). We study the asymmetric restriction in which only the first prime is prescribed modulo :
The expected main term for is
and we set and .
1.2. Historical Benchmarks
The almost-all theory of the binary Goldbach problem originates with Van der Corput, Estermann and Chudakov in the 1930s. Hardy and Littlewood [4] predicted the asymptotic and introduced the singular series; Vinogradov [13] gave the definitive circle-method treatment of the ternary problem; Montgomery and Vaughan [9] proved the power-saving exceptional-set bound ; refinements of the unconditional exponent are due to Pintz [10] and, most recently, Bhowmik and Grimmelt [1]. Restricted and progression variants appear in Liu–Liu–Wang [7] and Halupczok [3]. Effective variants of the Bombieri–Vinogradov theorem tailored to sieve-type problems, which would be needed to make the results below effective, are due to Johnston [6].
1.3. Purpose and Scope
This paper is a rigorous, unified consolidation of the author’s restricted-Goldbach programme. Its content is: (i) the exact character decomposition of ; (ii) the local-obstruction theorem; (iii) the correct local main term; (iv) certified numerical enclosures for the constants that occur; (v) a qualitative almost-all theorem for fixed , proved in full via major/minor-arc analysis; (vi) a conditional impossibility theorem for a fixed effective threshold, with its hypothesis stated explicitly and left as an open problem; (vii) the ternary anchoring lemma and its consequence; (viii) positivity of the restricted quaternary singular series; and (ix) an honest account, isolated from the theorem stream, of why four natural routes to unconditional finiteness of do not succeed with methods presently available.
We do not assert a pointwise Goldbach asymptotic, an explicit numerical threshold for the almost-all theorem, a sub-exponential exceptional-set bound, an unconditional pointwise bound for any fixed modulus, or any spectral implication of Goldbach positivity. Precise numerical constants proposed for these statements in earlier stages of this programme (an explicit minor-arc fourth-moment constant, a Siegel-zero-freeness certificate for obtained from a finite grid of values, and the resulting sub-exponential and structural-rigidity bounds) do not survive independent verification: the arithmetic underlying the claimed fourth-moment constant is checked in Remark 6.3 below to be internally inconsistent, and a finite grid of positive values together with a Dirichlet-series tail bound does not certify positivity of between grid points without a genuine interval-arithmetic argument (Open Question 33). These statements are accordingly recorded only as open problems (§11).
2. Notation and Fundamental Constants
Write and . For define
for a Dirichlet character modulo . Character orthogonality gives, for ,
Lemma 2.1 (Exact character decomposition). Let and let be even. Then Proof. Insert (4) into the congruence in (2); every prime with is coprime to because . Expanding the two exponential sums and using gives the identity. The diagonal term contributes , absorbed into the implied error where relevant.
Remark 2.2 (A correction concerning orthogonality). It is not true in general that distinct character twists are orthogonal as prime sums: one has
which need not vanish for . Consequently the squared norm of must be evaluated directly. By the prime number theorem in arithmetic progressions, for fixed ,
This is the correct input to every second-moment argument below.
Definition 2.3 (Certified numerical constants). We record the following certified enclosures.
Proposition 2.4 (Enclosure verification). The enclosures for and hold unconditionally.
Proof. Direct evaluation of the partial Euler products up to gives and , matching the stated intervals to the digits shown. The tail is bounded, for either product, by
which for is below , placing both values strictly inside the stated intervals once the partial product itself is computed to that precision. (The partial product computation above used all primes up to ; a reader wishing to reproduce the certificate should sum over primes and add the tail bound.) The constant is quoted directly from McCurley [8] and is not re-derived here.
3. The Local Obstruction
Theorem 3.1 (Local obstruction). Let , , and suppose an odd prime divides . If is even and , then every representation counted by has . Hence so on a set of even integers of density .
Proof. Write with . Since we have , and the hypothesis forces . As is prime and divisible by , necessarily ; thus at most the single ordered pair is counted. The conditions “ even” and “” cut out one class modulo (as is odd), which has density among even integers.
Corollary 3.2. Ifhas an odd prime divisor, thencannot hold for all large even: on the density-set of Theorem 3.1 the left side iswhile. Thus the restriction toin the almost-all theory below is forced by the truth of the statement, not by convenience.
Lemma 3.3 (No obstruction at ). Let , , , and even. Then . Moreover the odd part of the singular series is unaffected: .
Proof. Since , is odd; as is even, is odd, hence coprime to . The odd prime divisors of coincide with those of , so the product (1) is unchanged.
4. The Corrected Local Main Term
For a single prime restricted to , the singular series vanishes unless both local admissibility conditions and hold. The locally corrected main term is therefore
Proposition 4.1 (Simplification for powers of two). Let , , even. Then and , so Proof. Immediate from Lemma 3.3 and the definition of .
5. A Rigorous Almost-All Theorem for
The following is the strongest conclusion obtainable from the classical circle-method framework without invoking unverified numerical constants. It rests on the exact decomposition of Lemma 2.1, the corrected input of Remark 2.2, and standard major/minor-arc mean-value theory.
Theorem 5.1 (Qualitative almost-all theorem). Fix , put and . Then (6) Consequently for all but even ; in particular Proof. By Lemma 2.1, write with . Dissect into major arcs and minor arcs with .
Major arcs, principal character. By the prime number theorem in arithmetic progressions for the finitely many characters modulo the fixed modulus (Siegel–Walfisz), together with the standard Ramanujan-sum evaluation of the singular series, the principal-character contribution reproduces the main term: uniformly for , using Lemma 3.3 to confine to admissible residues.
Major arcs, non-principal characters, and minor arcs. For the major-arc contribution is by Siegel–Walfisz, again because is fixed. On the minor arcs, Vaughan’s identity yields the standard bound (indeed ), and the same estimate holds for since every step bounds coefficients in absolute value and . Combining Bessel’s inequality
with (Remark 2.2) gives a total minor-arc contribution after summing over and over the characters. This proves (6).
From the mean square to the exceptional set. Since we have . If with then , so
whence on each dyadic block; summing over dyadic blocks gives the stated density-zero conclusion.
Remark 5.2 (This is not a pointwise theorem). Theorem 5.1 does not assert for every large even . Such a pointwise statement would immediately give restricted Goldbach positivity for all sufficiently large admissible (Proposition 10.1), which lies far beyond the circle-method mean value used here.
Remark 5.3 (On effectivity). For fixed the theorem is effective only in the qualitative Siegel–Walfisz sense: the threshold hidden in is not made numerical here, because Siegel’s ineffective constant enters. Effective Bombieri–Vinogradov error terms developed for sieve problems, such as Johnston’s [6], cannot be inserted into this circle-method argument to make Theorem 5.1 numerically explicit without a separate, effective treatment of a possible Landau–Page exceptional modulus on the major arcs, extended from a single fixed modulus to the growing family of arc denominators the effective bound requires; we record this precisely as Open Question 30 rather than carrying out the extension here, since the authors’ unpublished attempts at this step have not yet been independently checked.
6. A Conditional Impossibility Theorem for a Fixed Threshold
Theorem 5.1 leaves open whether the exceptional count can be replaced by an explicit, -independent threshold on . The next result shows this is impossible provided a genuine second-moment lower bound holds; the lower bound itself is not established here and is recorded as Open Question 29.
Proposition 6.1 (Conditional impossibility of a fixed threshold). Suppose the second-moment lower bound holds. Then no constant independent of , and no , can satisfy Proof. Suppose for contradiction that all but even integers satisfy . Summing squares over gives
For large , , contradicting the hypothesis . Thus the exceptional set for any fixed threshold must have size .
Remark 6.2. Proposition 6.1 is an honest if–then statement: it does not assert the second-moment lower bound, only that the lower bound (if true) rules out a fixed-threshold effective almost-all theorem. Establishing the lower bound, and hence upgrading Theorem 5.1 to an effective statement with an explicit, necessarily -growing threshold, is Open Question 29.
Remark 6.3 (On a proposed explicit minor-arc constant). An explicit fourth-moment minor-arc bound of the shape , obtained by combining with the classical bound (Rosser–Schoenfeld [11]), was proposed at an earlier stage of this programme. Multiplying the two displayed constants gives , which exceeds ; the proposed constant is therefore not a valid consequence of the displayed inputs, and no corrected derivation of this specific fourth-moment bound has yet been independently verified. We do not assert any explicit numerical fourth-moment constant in this paper; Theorem 5.1 only needs the qualitative bound , which does not depend on this constant.
7. Ternary Transfer via Prime Anchoring
For odd set
Lemma 7.1 (Anchoring). For every odd , .
Proof. Restrict the ternary sum to :
Corollary 7.2 (Qualitative ternary consequence). Fix , . Then .
Proof. If then by Lemma 7.1. The exceptional odd inject, up to a bounded initial range, into the exceptional even integers of Theorem 5.1, which form a density-zero set.
Remark 7.3. The anchoring lemma transfers exactly the information actually proved for the binary problem: a density-zero exceptional set, not pointwise positivity.
8. Positivity of the Restricted Quaternary Singular Series
We record the local densities underlying a restricted three-primes-plus-shift (ternary/quaternary) singular series, since these are elementary, exact, and positive; they show that no local obstruction beyond the one of §3 arises.
Definition 8.1. For a prime power and in the relevant residue class, let be the normalized local solution density of with units and , in the limit .
Theorem 8.2 (Local densities). Let with odd. Then for odd , . For an odd prime (so ) and a unit modulo , In every case ; hence the restricted singular series is strictly positive for every admissible .
Proof. Each is a finite count of units in subject to one linear congruence, normalized by the unconstrained unit count; the values follow by direct inclusion–exclusion over the unit conditions on , and stabilize for . Positivity is manifest from the closed forms (the denominators for ). Compatibility of the constrained system for each residue of gives the case distinction.
Remark 8.3. For the model case the associated ternary singular series is for every odd , consistent with Theorem 8.2.
9. Structural Obstructions to Unconditional Finiteness
We explain, honestly and without overclaiming, why four natural attempts to upgrade Theorem 5.1 to finiteness of do not succeed with methods presently available. These are structural cautions accompanied by what can actually be proved about each route; they are not claims of new unconditional bounds.
Proposition 9.1 (Double-Pole Convolution Obstruction). In the explicit-formula representation of the binary error term, a fixed real (Siegel) zero of a real character contributes at most to . Consequently a fixed Siegel zero neither cancels the main term nor forces infinitude of : the naive implication “ infinite ” is invalid.
Proof. A single real zero contributes a term of size to the (smoothed) prime-counting explicit formula, and correspondingly a term of order to a second-moment/convolution expression for the binary Goldbach error, since the binary problem convolves two such sums. As is fixed, , which is smaller than the main term . Hence no fixed Siegel zero can, by this mechanism alone, produce an error term comparable to the main term at infinitely many .
Remark 9.2 (Borel–Cantelli Divergence Barrier). Modelling membership by a phase-alignment event among the low-lying ordinates of -functions mod , a natural heuristic marginal probability for this event decays only sub-polynomially in (under standard pair-correlation-type hypotheses for the ordinates), so diverges under the heuristic. Marginal rarity of the phase-alignment event alone therefore cannot yield finiteness of by a Borel–Cantelli argument; a genuine negative-correlation (spectral repulsion) statement between distinct ordinates would be required, and no such statement is established here or, to the author’s knowledge, in the literature at the needed strength.
Remark 9.3 (Discrepancy Explosion). As the number of -function ordinates relevant to a fixed-precision approximation of grows with , classical Erdős–Turán–Koksma-type discrepancy bounds for the resulting multi-frequency equidistribution problem degrade faster than the target measure shrinks, so standard equidistribution inputs (e.g. linear-independence-of-ordinates hypotheses, Baker-type linear-forms bounds) do not by themselves deliver a summable exceptional count.
Proposition 9.4 (Circle-Method Saturation at GRH). If holds for every on the minor arcs of a pointwise (not merely mean-square) treatment of , then GRH holds for every with ; conversely GRH implies such a pointwise minor-arc bound. Hence the pointwise circle method for this problem saturates exactly at GRH: this is a statement about the strength required by that specific route, not an equivalence between finiteness of and GRH itself.
Proof sketch. The classical explicit-formula bound for on the minor arcs, when strengthened from the mean-square estimate used in Theorem 5.1 to a pointwise square-root-cancellation estimate, is equivalent (by the standard zero-density/explicit-formula dictionary for Dirichlet -functions) to the absence of zeros of with ; this equivalence is classical and we do not reproduce its proof here. Granting the pointwise minor-arc bound for every and combining with the major-arc evaluation of Theorem 5.1 gives a pointwise asymptotic for , which was never claimed to follow from GRH alone in the converse direction without this specific circle-method route; we record the forward direction only, since it is the direction load-bearing for this section’s conclusion.
10. What Remains Legitimately Conditional
A sound conditional statement should assume a hypothesis genuinely strong enough to yield its conclusion.
Proposition 10.1 (Safe conditional formulation). Fix , . Suppose there is with for every sufficiently large even . Then for every sufficiently large even .
Proof. Since , once we get .
Remark 10.2. Proposition 10.1 is correct but does not identify GRH, a classical zero-free region, or a pair-correlation hypothesis as a sufficient input for its own hypothesis: a zero-free region yields prime-counting errors, not directly a pointwise binary-Goldbach-coefficient bound, and GRH alone does not by any argument known to the author deliver the required pointwise asymptotic for . Producing a valid from a named classical hypothesis is exactly Open Question 36.
Remark 10.3 (Reliable external constants). Only classical, externally verified constants are used above: (twin-prime constant, Proposition 2.4), and, where cited for context, McCurley’s zero-free-region constant for [8], together with from the class number formula with . None of these is used here to assert a pointwise Goldbach bound.
11. Open Questions
Open Question 28 (Power-saving restricted exceptional set). For fixed , prove for some explicit , with a proof tailored to the one-progression restriction.
Open Question 29 (Second-moment lower bound). Prove or disprove the lower bound used as a hypothesis in Proposition 6.1. A proof would show that any effective version of Theorem 5.1 must carry a threshold growing with ; a disproof (e.g. a genuinely smaller true order for the second moment) would leave open whether a fixed-threshold effective almost-all theorem is possible after all.
Open Question 30 (Effectivity). Make Theorem 5.1 effective by giving a complete, effective major-arc treatment of a possible Landau–Page exceptional modulus, extending the fixed-modulus Siegel–Walfisz input to the growing family of arc denominators via an effective Bombieri–Vinogradov-type input such as Johnston’s [6], and by tracking all constants in the minor-arc estimate (see Remark 6.3 for the state of the one attempted explicit constant).
Open Question 31 (General moduli). For with odd prime factors, determine the strongest almost-all theorem after restricting to the admissible set and using of (5).
Open Question 32 (Matching lower bound for the corrected main term). Determine the true order of ; in particular prove or disprove a lower bound of order . Such a lower bound would render the -growth identified in Open Question 29 necessary rather than merely conditional.
Open Question 33 (Rigorous Siegel-zero-freeness certification). For a stated range of discriminants (e.g. ), construct a genuinely rigorous, reproducible interval-arithmetic proof that throughout , including explicit, rigorous bounds for truncation, derivative/monotonicity control between sample points, and rounding error. A finite grid of positive sampled values together with a Dirichlet-series tail bound, without such a monotonicity or derivative bound covering every intervening interval, does not constitute a proof of positivity between grid points.
Open Question 34 (Sub-exponential exceptional-set bound). Contingent on Open Question 33 (or on an unconditional Siegel-zero-freeness input obtained by other means), determine whether the exceptional set satisfies for an effectively computable , and whether this can be strengthened to a pointwise bound for all large even . Both statements were proposed at an earlier stage of this programme; neither is asserted here, since both rest on the certification requested in Open Question 33 and, for the pointwise form, additionally require exactly the kind of individual-coefficient control that Proposition 9.4 shows already saturates at GRH-strength input.
Open Question 35 (Fine structural rigidity of the exceptional set). Contingent on a resolution of Open Question 34 (or of Open Question 28), establish: (a) a gap bound, that every interval contains an even for large; (b) non-consecutiveness of up to a bounded exceptional count; (c) additive-energy decay , showing carries no linear Fourier structure. Proposed derivations of (a)–(c) from short-interval prime theorems and a phase-alignment heuristic have appeared at an earlier stage of this programme but do not currently constitute complete proofs, and are not reproduced here.
Open Question 36 (Pointwise bound under a named hypothesis). Exhibit an explicit function , derived from a stated classical hypothesis (GRH for , ; the Density Hypothesis ; or Montgomery’s pair-correlation conjecture in a stated strength), satisfying the hypothesis of Proposition 10.1, together with a complete derivation. An explicit numerical threshold of the form under GRH was proposed at an earlier stage of this programme but its derivation relied on an unidentified effective constant inserted into a fixed-point iteration and is not reasserted here pending an independently checked derivation.
Open Question 37 (Direct restricted ternary and quaternary asymptotics). Prove, directly rather than via anchoring (Lemma 7.1), an almost-all asymptotic for with the correct ternary singular series and the local factors of Theorem 8.2, and correspondingly for the restricted quaternary sum whose singular series positivity is established in §8.
12. Conclusion
The decisive correction is local: for general moduli the naive main term fails on a positive-density set (Theorem 3.1), while for powers of two it reduces to (Proposition 4.1). The decisive logical distinction is between an almost-all theorem and a pointwise theorem: the classical circle method delivers a density-zero exceptional set for fixed (Theorem 5.1), transferable to a restricted ternary sum (Corollary 7.2), and the restricted quaternary singular series is unconditionally positive (Theorem 8.2); but the almost-all theorem does not give eventual positivity for every even integer without substantial new input, and a fixed effective threshold is impossible once a plausible second-moment lower bound is granted (Proposition 6.1). Four natural routes to unconditional finiteness of the exceptional set are examined honestly in §9 and none succeeds with methods presently available. The sub-exponential, pointwise-GRH, and structural-rigidity statements proposed at earlier stages of this programme are not retained as theorems here, because the specific arguments supplied for them do not survive independent verification (Remark 6.3; Open Questions 33–35); they are recorded instead as precisely stated open problems. The framework retained here is smaller than at some earlier stages of this programme, but every theorem in it is proved in full.
References
- Bhowmik, G.; Grimmelt, L. The exceptional set of the Goldbach problem. arXiv 2026, arXiv:2607.27282. [Google Scholar]
- H. Davenport, Multiplicative Number Theory. In Graduate Texts in Mathematics 74, 3rd ed.; Montgomery, H. L., Ed.; Springer, 2000. [Google Scholar]
- Halupczok, K. Goldbach’s problem with primes in arithmetic progressions and in short intervals. J. Théor. Nr. Bordx. 2013, 25, 331–351. [Google Scholar] [CrossRef]
- Hardy, G. H.; Littlewood, J. E. Some problems of ‘Partitio Numerorum’; III: On the expression of a number as a sum of primes. Acta Math. 1923, 44, 1–70. [Google Scholar] [CrossRef]
- Iwaniec, H.; Kowalski, E. Analytic Number Theory. In AMS Colloquium Publications; American Mathematical Society, 2004; p. 53. [Google Scholar]
- Johnston, D. R. An effective Bombieri–Vinogradov error term for sifting problems. arXiv 2025, arXiv:2510.10853. [Google Scholar]
- Liu, J. Y.; Liu, M. C.; Wang, T. Z. The number of powers of 2 in a representation of large even integers, II. Sci. China Ser. A 1998, 41, 1255–1271. [Google Scholar] [CrossRef]
- McCurley, K. S. Explicit zero-free regions for Dirichlet-functions. J. Number Theory 1984, 19(no. 1), 7–32. [Google Scholar] [CrossRef]
- Montgomery, H. L.; Vaughan, R. C. The exceptional set in Goldbach’s problem. Acta Arith. 1975, 27, 353–370. [Google Scholar] [CrossRef]
- Pintz, J. A new explicit formula in the additive theory of primes with applications II: The exceptional set in Goldbach’s problem. arXiv 2018, arXiv:1804.09084. [Google Scholar]
- Rosser, J. B.; Schoenfeld, L. Approximate formulas for some functions of prime numbers. Ill. J. Math. 1962, 6, 64–94. [Google Scholar] [CrossRef]
- R. C. Vaughan, The Hardy–Littlewood Method. In Cambridge Tracts in Mathematics 125, 2nd ed.; Cambridge University Press, 1997.
- Vinogradov, I. M. The Method of Trigonometrical Sums in the Theory of Numbers; Interscience: London, 1954. [Google Scholar]
- Anderson, F. Restricted Goldbach Sums in Arithmetic Progressions: Analytic Hierarchy, Sub-Exponential Bounds, and Riemann Zero Detection; Preprints.org, 2026. [Google Scholar] [CrossRef]
- Anderson, F. An almost-all theorem for a restricted Goldbach sum over arithmetic progressions with explicit unconditional constants. Preprints.org 2026. [Google Scholar] [CrossRef]
- Anderson, F. A conditional proof of the restricted Goldbach conjecture for every even integer beyond 10^19.9. Preprints.org 2026. [Google Scholar] [CrossRef]
- Anderson, F. A restricted weak ternary Goldbach theorem via prime anchoring and an explicit almost-all bound with effective constants. Preprints.org 2026. [Google Scholar] [CrossRef]
- Anderson, F. The Restricted Goldbach Hierarchy: Explicit Unconditional Bounds, Structural Rigidity, and a Spectral Bridge to Finiteness; Preprints.org, 2026. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.