Preprint
Article

This version is not peer-reviewed.

Restricted Goldbach Sums in Arithmetic Progressions: Local Obstructions, an Explicit Almost-All Framework, and Structural Extensions

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: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

1.1. The Restricted Binary Problem

For even N the classical weighted Goldbach function is
R ( N ) : = p 1 + p 2 = N ( l o g p 1 ) ( l o g p 2 ) ,
and the Hardy–Littlewood conjecture predicts R ( N ) S 2 ( N ) N , where
S 2 ( N ) : = 2 C 2 l N l > 2 l 1 l 2 , C 2 : = l > 2 1 1 ( l 1 ) 2 = 0.6601618158
is the twin-prime constant (here and below p , l denote primes). We study the asymmetric restriction in which only the first prime is prescribed modulo q :
R a , q ( N ) : = p 1 + p 2 = N p 1 a ( m o d q ) ( l o g p 1 ) ( l o g p 2 ) , g c d ( a , q ) = 1 .
The expected main term for q = 2 k is
M a , q ( N ) : = 2 C 2 φ ( q ) S ( N ) N , S ( N ) : = l N l > 2 l 1 l 2 ,
and we set E ( N ) : = R a , q ( N ) M a , q ( N ) and E a , q ( X ) : = { N X   even : R a , q ( N ) = 0 } .

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 X 1 δ ; 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 R a , q ; (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 q = 2 k , 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 E a , q 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 q 200 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 L ( s , χ D ) between grid points without a genuine interval-arithmetic argument (Open Question 33). These statements are accordingly recorded only as open problems (§11).
This paper is based on previous work by the same author [14]-[18].

2. Notation and Fundamental Constants

Write e ( α ) : = e 2 π i α and x : = m i n n Z | x n | . For X 1 define
S ( α ; X ) : = p X ( l o g p ) e ( α p ) , S χ ( α ; X ) : = p X χ ( p ) ( l o g p ) e ( α p ) ,
S a , q ( α ; X ) : = p X p a ( m o d q ) ( l o g p ) e ( α p ) ,
for a Dirichlet character χ modulo q . Character orthogonality gives, for g c d ( n , q ) = 1 ,
1 n a ( q ) = 1 φ ( q ) χ ( m o d q ) χ ¯ ( a ) χ ( n ) .
Lemma 2.1 (Exact character decomposition). Let g c d ( a , q ) = 1 and let N X be even. Then R a , q ( N ) = 1 φ ( q ) χ ( m o d q ) χ ¯ ( a ) 0 1 S χ ( α ; X ) S ( α ; X ) e ( N α ) d α . Proof. Insert (4) into the congruence p 1 a ( q ) in (2); every prime with p 1 a ( q ) is coprime to q because g c d ( a , q ) = 1 . Expanding the two exponential sums and using 0 1 e ( ( p 1 + p 2 N ) α ) d α = 1 p 1 + p 2 = N gives the identity. The diagonal term p 1 = p 2 contributes O ( ( l o g N ) 2 ) , absorbed into the implied error where relevant.
Remark 2.2 (A correction concerning L 2 orthogonality). It is not true in general that distinct character twists are orthogonal as prime sums: one has
S χ , S χ ' = p X ( l o g p ) 2 χ ( p ) χ ' ¯ ( p ) ,
which need not vanish for χ χ ' . Consequently the squared norm of S a , q must be evaluated directly. By the prime number theorem in arithmetic progressions, for fixed q ,
S a , q L 2 ( [ 0 , 1 ] ) 2 = p X p a ( q ) ( l o g p ) 2 = X l o g X φ ( q ) 1 + o q ( 1 ) .
This is the correct input to every second-moment argument below.
Definition 2.3 (Certified numerical constants). We record the following certified enclosures.
C 2 = l > 2 1 1 ( l 1 ) 2 [ 0.6601617536 , 0.6601618197 ] ,
G = l > 2 1 + 1 ( l 1 ) 2 [ 1.41320990 , 1.41321000 ] ,
R M c C = 9.645908801 ( McCurley s   zero - free - region   constant ,   [ 8 ] ) .
Proposition 2.4 (Enclosure verification). The enclosures for C 2 and G hold unconditionally.
Proof. Direct evaluation of the partial Euler products up to P = 2 × 10 6 gives C 2 ( P ) = 0.66016184 and G ( P ) = 1.41320995 , matching the stated intervals to the digits shown. The tail is bounded, for either product, by
l o g l > P 1 ± 1 ( l 1 ) 2 n > P 1 ( n 1 ) 2 < 1 P 1 ,
which for P = 2 × 10 6 is below 5 × 10 7 , 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 P ; a reader wishing to reproduce the certificate should sum l o g ( 1 ( l 1 ) 2 ) over primes l P and add the tail bound.) The constant R M c C is quoted directly from McCurley [8] and is not re-derived here.

3. The Local Obstruction

Theorem 3.1 (Local obstruction). Let q 1 , g c d ( a , q ) = 1 , and suppose an odd prime l divides q . If N is even and N a ( m o d l ) , then every representation counted by R a , q ( N ) has p 2 = l . Hence R a , q ( N ) = ( l o g ( N l ) ) ( l o g l ) , if   N l   is   prime   and   N l a ( q ) , 0 , otherwise , so R a , q ( N ) = O q ( l o g N ) on a set of even integers of density 1 / l > 0 .
Proof. Write N = p 1 + p 2 with p 1 a ( q ) . Since l q we have p 1 a ( l ) , and the hypothesis N a ( l ) forces p 2 = N p 1 0 ( l ) . As p 2 is prime and divisible by l , necessarily p 2 = l ; thus at most the single ordered pair ( p 1 , p 2 ) = ( N l , l ) is counted. The conditions “ N even” and “ N a ( l ) ” cut out one class modulo 2 l (as l is odd), which has density 1 / l among even integers.
Corollary 3.2. If q has an odd prime divisor, then R a , q ( N ) M a , q ( N ) cannot hold for all large even N : on the density- 1 / l set of Theorem 3.1 the left side is O q ( l o g N ) while M a , q ( N ) 2 C 2 φ ( q ) N . Thus the restriction to q = 2 k in the almost-all theory below is forced by the truth of the statement, not by convenience.
Lemma 3.3 (No obstruction at q = 2 k ). Let q = 2 k , k 0 , g c d ( a , q ) = 1 , and N even. Then g c d ( N a , q ) = 1 . Moreover the odd part of the singular series is unaffected: S ( N q ) = S ( N ) .
Proof. Since g c d ( a , 2 k ) = 1 , a is odd; as N is even, N a is odd, hence coprime to q = 2 k . The odd prime divisors of N q = N 2 k coincide with those of N , so the product (1) is unchanged.

4. The Corrected Local Main Term

For a single prime restricted to a ( q ) , the singular series vanishes unless both local admissibility conditions g c d ( a , q ) = 1 and g c d ( N a , q ) = 1 hold. The locally corrected main term is therefore
M a , q c o r r ( N ) : = 1 g c d ( N a , q ) = 1 N φ ( q ) S 2 ( N q ) .
Proposition 4.1 (Simplification for powers of two). Let q = 2 k , g c d ( a , q ) = 1 , N even. Then g c d ( N a , q ) = 1 and S 2 ( N q ) = S 2 ( N ) , so M a , 2 k c o r r ( N ) = S 2 ( N ) φ ( 2 k ) N = 2 C 2 φ ( 2 k ) S ( N ) N = M a , 2 k ( N ) . Proof. Immediate from Lemma 3.3 and the definition of S 2 .

5. A Rigorous Almost-All Theorem for q = 2 k

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 L 2 input of Remark 2.2, and standard major/minor-arc mean-value theory.
Theorem 5.1 (Qualitative almost-all theorem). Fix k 0 , put q = 2 k and g c d ( a , q ) = 1 . Then X < N 2 X N   even R a , q ( N ) M a , q ( N ) 2 = o q X 3 . (6) Consequently R a , q ( N ) = M a , q ( N ) + o q ( N ) for all but o q ( X ) even N ( X , 2 X ] ; in particular # { N X : N   even , R a , q ( N ) = 0 } = o q ( X ) . Proof. By Lemma 2.1, write φ ( q ) R a , q ( N ) = χ ( m o d q ) χ ¯ ( a ) I χ ( N ) with I χ ( N ) = 0 1 S χ S e ( N α ) d α . Dissect [ 0 , 1 ] into major arcs M and minor arcs m with Q = X 1 / 2 ( l o g X ) B .
Major arcs, principal character. By the prime number theorem in arithmetic progressions for the finitely many characters modulo the fixed modulus q (Siegel–Walfisz), together with the standard Ramanujan-sum evaluation of the singular series, the principal-character contribution reproduces the main term: φ ( q ) 1 I χ 0 ( N ) = M a , q ( N ) + o q ( N ) uniformly for N X , using Lemma 3.3 to confine to admissible residues.
Major arcs, non-principal characters, and minor arcs. For χ χ 0 the major-arc contribution is o q ( N ) by Siegel–Walfisz, again because q is fixed. On the minor arcs, Vaughan’s identity yields the standard bound s u p α m | S ( α ) | = o ( X / l o g X ) (indeed X ( l o g X ) 4 / Q 1 / 2 ), and the same estimate holds for S χ since every step bounds coefficients in absolute value and | χ ( n ) | 1 . Combining Bessel’s inequality
N m S χ S e ( N α ) d α 2 s u p m | S | 2 m | S χ | 2 d α s u p m | S | 2 S χ L 2 2
with S χ L 2 2 X l o g X (Remark 2.2) gives a total minor-arc contribution o q ( X 3 ) after summing over N ( X , 2 X ] and over the φ ( q ) characters. This proves (6).
From the mean square to the exceptional set. Since S ( N ) 1 we have M a , q ( N ) 2 C 2 φ ( q ) N . If R a , q ( N ) = 0 with X < N 2 X then | R a , q ( N ) M a , q ( N ) | 2 C 2 φ ( q ) X , so
# E a , q ( 2 X ) 2 C 2 φ ( q ) X 2 o q ( X 3 ) ,
whence # E a , q ( 2 X ) = o q ( X ) 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 R a , q ( N ) = M a , q ( N ) + o ( N ) for every large even N . Such a pointwise statement would immediately give restricted Goldbach positivity for all sufficiently large admissible N (Proposition 10.1), which lies far beyond the circle-method mean value used here.
Remark 5.3 (On effectivity). For fixed q the theorem is effective only in the qualitative Siegel–Walfisz sense: the threshold hidden in o q ( ) 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 o q ( X ) exceptional count can be replaced by an explicit, X -independent threshold on | E ( N ) | = | R a , q ( N ) M a , q ( N ) | . 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 N X | E ( N ) | 2 X 3 / l o g X holds. Then no constant K = K ( A ) independent of X , and no X 0 , can satisfy # { N X   even : | E ( N ) | > K N ( l o g N ) 3 } X ( l o g X ) A for   all   X X 0 . Proof. Suppose for contradiction that all but o ( X ) even integers N X satisfy | E ( N ) | K N ( l o g N ) 3 A K X ( l o g X ) 3 . Summing squares over N X gives
N X | E ( N ) | 2 K X K 2 X 2 ( l o g X ) 6 + o ( X ) X 2 = O K X 3 ( l o g X ) 6 .
For large X , X 3 ( l o g X ) 6 = o ( X 3 / l o g X ) , contradicting the hypothesis N X | E ( N ) | 2 X 3 / l o g X . Thus the exceptional set for any fixed threshold must have size K X .
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 X -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 m | S ( α ) | 4 d α 9.2 X 3 ( l o g X ) A , obtained by combining s u p m | S | 2 9 X 2 ( l o g X ) A 1 with the classical bound 0 1 | S ( α ) | 2 d α < 1.03883 X l o g X (Rosser–Schoenfeld [11]), was proposed at an earlier stage of this programme. Multiplying the two displayed constants gives 9 × 1.03883 = 9.34947 , which exceeds 9.2 ; the proposed constant 9.2 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 s u p m | S ( α ) | = o ( X / l o g X ) , which does not depend on this constant.

7. Ternary Transfer via Prime Anchoring

For odd n 9 set
W a , q ( n ) : = p 1 + p 2 + p 3 = n p 1 a ( m o d q ) ( l o g p 1 ) ( l o g p 2 ) ( l o g p 3 ) .
Lemma 7.1 (Anchoring). For every odd n 9 , W a , q ( n ) ( l o g 3 ) R a , q ( n 3 ) .
Proof. Restrict the ternary sum to p 3 = 3 :
W a , q ( n ) p 1 + p 2 = n 3 p 1 a ( q ) ( l o g p 1 ) ( l o g p 2 ) ( l o g 3 ) = ( l o g 3 ) R a , q ( n 3 ) .
Corollary 7.2 (Qualitative ternary consequence). Fix q = 2 k , g c d ( a , q ) = 1 . Then # { n X : n   odd , W a , q ( n ) = 0 } = o q ( X ) .
Proof. If R a , q ( n 3 ) > 0 then W a , q ( n ) > 0 by Lemma 7.1. The exceptional odd n 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 l e q and n in the relevant residue class, let ρ l ( n ) be the normalized local solution density of x + y + z n ( m o d l k ) with x , y , z units and x a ( m o d l e ) , in the limit k .
Theorem 8.2 (Local densities). Let 2 e q with a odd. Then for odd n , ρ 2 ( n ) = 2 1 e = 1 / φ ( 2 e ) . For an odd prime l q (so e = 1 ) and a a unit modulo l , ρ l ( n ) = 1 l 1 , n 0 ( l ) , l 1 l 2 3 l + 3 , n a ( l ) , l 2 l 2 3 l + 3 , n 0 , a ( l ) . In every case ρ l ( n ) > 0 ; hence the restricted singular series l ρ l ( n ) S l ( n ) is strictly positive for every admissible n .
Proof. Each ρ l ( n ) is a finite count of units in ( Z / l k Z ) subject to one linear congruence, normalized by the unconstrained unit count; the values follow by direct inclusion–exclusion over the unit conditions on x , y , z , and stabilize for k e . Positivity is manifest from the closed forms (the denominators l 2 3 l + 3 > 0 for l 3 ). Compatibility of the constrained system for each residue of n gives the case distinction.
Remark 8.3. For the model case ( a , q ) = ( 3 , 4 ) the associated ternary singular series is S 2 ( n ) / 2 C 2 0.3300 > 0 for every odd n 9 , 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 E a , q 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 β 1 = 1 δ of a real character contributes at most O ( N 2 β 1 1 ) = O ( N 1 2 δ ) = o ( N ) = o ( M a , q ( N ) ) to E ( N ) . Consequently a fixed Siegel zero neither cancels the main term nor forces infinitude of E a , q : the naive implication “ E a , q infinite β 1 1 ” is invalid.
Proof. A single real zero β 1 contributes a term of size N β 1 / β 1 to the (smoothed) prime-counting explicit formula, and correspondingly a term of order N 2 β 1 1 to a second-moment/convolution expression for the binary Goldbach error, since the binary problem convolves two such sums. As β 1 < 1 is fixed, N 2 β 1 1 = o ( N ) , which is smaller than the main term M a , q ( N ) N . Hence no fixed Siegel zero can, by this mechanism alone, produce an error term comparable to the main term at infinitely many N .
Remark 9.2 (Borel–Cantelli Divergence Barrier). Modelling membership N E a , q by a phase-alignment event among the low-lying ordinates of L -functions mod q , a natural heuristic marginal probability for this event decays only sub-polynomially in N (under standard pair-correlation-type hypotheses for the ordinates), so N P r ( N E a , q ) diverges under the heuristic. Marginal rarity of the phase-alignment event alone therefore cannot yield finiteness of E a , q 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 L -function ordinates relevant to a fixed-precision approximation of E ( N ) grows with N , 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 s u p α m | S ( α ) | X 1 / 2 + ε holds for every ε > 0 on the minor arcs of a pointwise (not merely mean-square) treatment of R a , q ( N ) , then GRH holds for every L ( s , χ ) with χ ( m o d q ) ; 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 E a , q and GRH itself.
Proof sketch. The classical explicit-formula bound for S χ ( α ; X ) 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 L -functions) to the absence of zeros of L ( s , χ ) with R ( s ) > 1 / 2 ; this equivalence is classical and we do not reproduce its proof here. Granting the pointwise minor-arc bound for every χ ( m o d q ) and combining with the major-arc evaluation of Theorem 5.1 gives a pointwise asymptotic for R a , q ( N ) , 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 q = 2 k , g c d ( a , q ) = 1 . Suppose there is η ( N ) 0 with | R a , q ( N ) M a , q ( N ) | η ( N ) N for every sufficiently large even N . Then R a , q ( N ) > 0 for every sufficiently large even N .
Proof. Since M a , q ( N ) 2 C 2 φ ( q ) N , once η ( N ) < C 2 / φ ( q ) we get R a , q ( N ) 2 C 2 φ ( q ) η ( N ) N > 0 .
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 R a , q . Producing a valid η ( N ) from a named classical hypothesis is exactly Open Question 36.
Remark 10.3 (Reliable external constants). Only classical, externally verified constants are used above: C 2 = 0.6601618 (twin-prime constant, Proposition 2.4), and, where cited for context, McCurley’s zero-free-region constant R M c C 9.65 for χ L ( s , χ ) [8], together with L ( 1 , χ 163 ) = π / 163 from the class number formula with h ( 163 ) = 1 . 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 q = 2 k , prove # { N X   even : R a , q ( N ) = 0 } q X 1 δ q for some explicit δ q > 0 , with a proof tailored to the one-progression restriction.
Open Question 29 (Second-moment lower bound). Prove or disprove the lower bound N X   even | E ( N ) | 2 X 3 / l o g X 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 X ; 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 r ( l o g X ) C 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 q with odd prime factors, determine the strongest almost-all theorem after restricting to the admissible set g c d ( N a , q ) = 1 and using M a , q c o r r of (5).
Open Question 32 (Matching lower bound for the corrected main term). Determine the true order of N X   even R a , q ( N ) M a , q c o r r ( N ) 2 ; in particular prove or disprove a lower bound of order X 3 / l o g X . Such a lower bound would render the X -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. | D | 200 ), construct a genuinely rigorous, reproducible interval-arithmetic proof that L ( s , χ D ) > 0 throughout 1 1 / R M c C l o g ( | D | + 2 ) , 1 , 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 # E a , q ( X ) q X e x p ( c ( q ) l o g X ) for an effectively computable c ( q ) > 0 , and whether this can be strengthened to a pointwise bound | R a , q ( N ) M a , q ( N ) | C ( q ) N e x p ( l o g N / R M c C ) for all large even N . 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 [ x , x + x 0.525 ] contains an even N E a , q for x large; (b) non-consecutiveness of E a , q up to a bounded exceptional count; (c) additive-energy decay E ( E a , q [ 1 , X ] ) = o ( X 3 ) , showing E a , q 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 η ( N ) 0 , derived from a stated classical hypothesis (GRH for L ( s , χ ) , χ ( m o d q ) ; the Density Hypothesis D H ( A ) ; 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 N N 0 ( q ) 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 W a , q ( n ) 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 S 2 ( N ) N / φ ( 2 k ) (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 q = 2 k (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

  1. Bhowmik, G.; Grimmelt, L. The exceptional set of the Goldbach problem. arXiv 2026, arXiv:2607.27282. [Google Scholar]
  2. H. Davenport, Multiplicative Number Theory. In Graduate Texts in Mathematics 74, 3rd ed.; Montgomery, H. L., Ed.; Springer, 2000. [Google Scholar]
  3. 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]
  4. 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]
  5. Iwaniec, H.; Kowalski, E. Analytic Number Theory. In AMS Colloquium Publications; American Mathematical Society, 2004; p. 53. [Google Scholar]
  6. Johnston, D. R. An effective Bombieri–Vinogradov error term for sifting problems. arXiv 2025, arXiv:2510.10853. [Google Scholar]
  7. 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]
  8. McCurley, K. S. Explicit zero-free regions for Dirichlet-functions. J. Number Theory 1984, 19(no. 1), 7–32. [Google Scholar] [CrossRef]
  9. Montgomery, H. L.; Vaughan, R. C. The exceptional set in Goldbach’s problem. Acta Arith. 1975, 27, 353–370. [Google Scholar] [CrossRef]
  10. 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]
  11. Rosser, J. B.; Schoenfeld, L. Approximate formulas for some functions of prime numbers. Ill. J. Math. 1962, 6, 64–94. [Google Scholar] [CrossRef]
  12. R. C. Vaughan, The Hardy–Littlewood Method. In Cambridge Tracts in Mathematics 125, 2nd ed.; Cambridge University Press, 1997.
  13. Vinogradov, I. M. The Method of Trigonometrical Sums in the Theory of Numbers; Interscience: London, 1954. [Google Scholar]
  14. Anderson, F. Restricted Goldbach Sums in Arithmetic Progressions: Analytic Hierarchy, Sub-Exponential Bounds, and Riemann Zero Detection; Preprints.org, 2026. [Google Scholar] [CrossRef]
  15. Anderson, F. An almost-all theorem for a restricted Goldbach sum over arithmetic progressions with explicit unconditional constants. Preprints.org 2026. [Google Scholar] [CrossRef]
  16. Anderson, F. A conditional proof of the restricted Goldbach conjecture for every even integer beyond 10^19.9. Preprints.org 2026. [Google Scholar] [CrossRef]
  17. 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]
  18. 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.
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.