From Almost-All to All But Finitely Many: Shifted Primes, Restricted Goldbach Sums, and a Spectral Bridge over Riemann Zeros

1. Introduction

1.1. Epistemic Labelling System

Every theorem, proposition, lemma, and corollary in this paper carries exactly one of the following labels, printed immediately after the statement name:

Proved unconditionally, relying only on classical analytic number theory (Siegel–Walfisz, Bombieri–Vinogradov, Stechkin zero-free region).

Proved under the explicitly stated hypothesis $H$ (e.g., GRH, Montgomery-GUE, USG, Density Hypothesis).

An open problem; neither proved nor assumed.

A claim appearing in earlier drafts of this programme, shown here to be mathematically invalid. Each retraction is accompanied by a precise identification of the error.

A remark flagging a limitation, tacit assumption, or approximation in an otherwise valid argument.

1.2. The Restricted Binary Goldbach Problem

Goldbach’s binary conjecture, in its weighted analytic form, asserts that every sufficiently large even integer $N$ satisfies

$$R\left(N\right):=\sum _{p_1+p_2=N}(\mathrm{l}\mathrm{o}\mathrm{g}{p}_1\left)\right(\mathrm{l}\mathrm{o}\mathrm{g}{p}_2)\sim S(N)\hspace{0.17em}N, N\to \mathrm{\infty },$$

where $S\left(N\right)=2C_2\prod _{p\mid N,\hspace{0.17em}p>2}{\displaystyle \frac{p-1}{p-2}}$ is the Hardy–Littlewood singular series [8] and

$$C_2=\prod _{p>2}\left(1-1/(p-1{)}^2\right)\approx 0.6601618$$

is the twin-prime constant [10]. We study the restricted variant in which one summand is confined to a fixed arithmetic progression: fix $q\ge 1$ and $a$ with $\mathrm{g}\mathrm{c}\mathrm{d}(a,q)=1$, and define $R_{a,q}\left(N\right)$ and $M_{a,q}\left(N\right)$ as in the abstract. The factor $1/\phi \left(q\right)$ reflects the equidistribution of primes over reduced residue classes.

The error term and exceptional set are [12]

$${\mathcal{E}}_{a,q}\left(N\right):=R_{a,q}\left(N\right)-M_{a,q}\left(N\right), {\mathcal{E}}_{a,q}\left(X\right):=\{N\le X,\hspace{0.17em}N\mathrm{even}:R_{a,q}(N)=0\}, {\mathcal{E}}_{a,q}:=\bigcup _X{\mathcal{E}}_{a,q}\left(X\right).$$

The central open question is whether ${\mathcal{E}}_{a,q}$ is finite.

1.3. The Amplification Factor and the Shifted-Prime Thread

A complementary arithmetic thread studies the shifted-prime problem [3]: represent a prime $p$ as $p=q+r-1$ with $q,r$ prime, or equivalently $p+1=q+r$, i.e. $R_{a,q}$ evaluated along the subsequence $\{p+1:p\mathrm{prime}\}$. The Dirichlet divisibility bias

$$\mathrm{P}\mathrm{r}[\mathcal{l}\mid (p+1\left)\right]=1/\mathcal{l}-1>1/\mathcal{l} \left(\mathrm{generic}\right)$$

accumulates multiplicatively over all odd primes $\mathcal{l}$, producing the amplification factor $S_{\mathrm{\infty }}$ of (11), absent from all classical Goldbach–Riemann bridges.

1.4. What this Paper Does

This paper has two interlocking objectives:

• Ratify the results that are correct and unconditional, providing complete proofs and certified numerical constants.
• Rectify results that are wrong, replacing invalid claims with rigorous conditional reductions and explicit retractions.

The three retractions carried out in Part II (Theorems 11.1, 12.2, and 13.1) are not merely a record-keeping exercise: each pinpoints, with a precise diagnosis of the underlying error, why a natural “elementary” route to unconditional finiteness fails. As such, they constitute negative results of independent interest, clarifying the genuine difficulty of the problem and the reasons why elementary means cannot close the gap from almost all to all but finitely many.

The principal message is: the chain

$$\mathrm{almost}\mathrm{all}\hspace{0.33em}\stackrel{\mathrm{Part}\mathrm{I}}{\to }\hspace{0.33em}\mathrm{sub}-\mathrm{exponential}+\mathrm{structural}\mathrm{rigidity}\hspace{0.33em}\stackrel{\hspace{0.33em}?\hspace{0.33em}}{\to }\hspace{0.33em}\mathrm{all}\mathrm{but}\mathrm{finitely}\mathrm{many}$$

cannot be closed by any of the three “elementary” shortcuts (Siegel-zero contradiction, Parseval sparsity transfer, naive LI+Baker bounds). We prove that each fails for a precisely identified structural reason. What survives is a genuine reduction of finiteness to the Uniform Spectral Gap hypothesis (USG) – a statistical property strictly weaker than GRH and supported by random-matrix theory.

1.5. Organisation

Part I (§§ 2–9) develops the unconditional core. Part II (§§ 11–14) proves the three obstruction theorems. Part III (§§ 16–19) constructs the Gowers–Spectral Bridge. § 6 contains the certified numerical constants. § 21 states the open problems. § 10 (Amplification Penalty) serves as a transitional section connecting Part I and Part II: it establishes that the amplification factor S∞ worsens the explicit constant unconditionally, and identifies Conjecture B* as the missing input for the amplified second-moment asymptotic. § 15 (Mellin Bridge) unifies the circle-method and explicit-formula approaches as two facets of a single meromorphic function, providing the analytic foundation for Part III.

For this paper, previous (preprint) works by the same author were used as part of the unconditional core, the structural-obstruction analysis, and the spectral-bridge construction summarised above, [1,2,3,4,5]. This paper supersedes the finiteness claims of [2,3]: the corresponding results are not silently dropped but are explicitly identified and retracted in Part II, with the precise location of the error indicated in each case, so that the present text together with [1,2,3,4,5] gives an accurate record of the evolution of this research programme.

Part I: The Unconditional Core

2. Notation and Circle-Method Set-Up

2.1. Arithmetic and Analytic Notation

Throughout, $p$ denotes a prime; $\mathsf{\Lambda }$ the von Mangoldt function; $\mu$ the Möbius function; $\phi$ Euler’s totient. We write $e\left(x\right):=e^{2\pi ix}$ and $\parallel x\parallel :={\mathrm{m}\mathrm{i}\mathrm{n}}_{n\in Z}|x-n|$. For functions $f,g$ we write $f\ll g$ to mean $\left|f\right|\le Cg$ for an absolute constant $C>0$; subscripts indicate allowed dependencies. The circle-method framework and the standard notation used throughout follow [6,9,18,19].

We use $N$ for the (even) integer to be represented and $X\ge 3$ for the running truncation parameter. The letter $q\ge 1$ is a fixed modulus and $a$ an integer with $\mathrm{g}\mathrm{c}\mathrm{d}(a,q)=1$.

2.2. Dirichlet Characters and Exponential Sums

Let $\chi$ run over Dirichlet characters modulo $q$, with ${\chi }_0$ the principal character. Orthogonality gives

$$1_{n\equiv a\hspace{0.25em}(\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}q)}={\displaystyle \frac{1}{\phi \left(q\right)}}\sum _{\chi \hspace{0.25em}\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}q}\bar{\chi }\left(a\right)\chi \left(n\right), \mathrm{g}\mathrm{c}\mathrm{d}\left(n,q\right)=1.$$

(1)

Define

$$S\left(\alpha \right):=\sum _{p\le X}(\mathrm{l}\mathrm{o}\mathrm{g}p)\hspace{0.17em}e(p\alpha ), S_{\chi }(\alpha ):=\sum _{p\le X}\chi (p\left)\right(\mathrm{l}\mathrm{o}\mathrm{g}p)\hspace{0.17em}e(p\alpha ).$$

Lemma 2.1 (Character decomposition; [PROVED]). For $N$ even and $\mathrm{g}\mathrm{c}\mathrm{d}(a,q)=1$,

$$R_{a,q}\left(N\right)={\displaystyle \frac{1}{\phi \left(q\right)}}\sum _{\chi \hspace{0.25em}\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}q}\bar{\chi }\left(a\right){\int }_0^1{S}_{\chi }\left(\alpha \right)\hspace{0.17em}S\left(\alpha \right)\hspace{0.17em}e(-N\alpha )\hspace{0.17em}d\alpha .$$

Proof. Insert (1) into the definition of $R_{a,q}\left(N\right)$ and exchange the finite character sum with the prime sum.

2.3. Major and Minor Arcs

Fix $A>0$ and set $B:=4A+12$. Let $Q:=X^{1/2}(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{-B}$. The major arcs and minor arcs are

$$\begin{array}{c}M:=\bigcup _{\begin{array}{c}1\le r\le Q\\ 1\le b\le r,\hspace{0.17em}\mathrm{g}\mathrm{c}\mathrm{d}(b,r)=1\end{array}}\{\alpha \in [0,1]:|\alpha -b/r\left|\le 1/rQ\right\},\\ m:=[0,1]\backslash M.\end{array}$$

2.4. Key Constants

Definition 2.2 (Key constants; [PROVED]). The complete constant chain is:

$$C_2\&:=\prod _{p>2}\left(1-1/(p-1{)}^2\right)\in \left[0.66016120,\hspace{0.33em}0.66016252\right],$$

(2)

$$G\&:=\prod _{p>2}\left(1+1/(p-1{)}^2\right)\in \left[1.41320990,\hspace{0.33em}1.41321132\right],$$

(3)

$$c_{\mathrm{M}\mathrm{V}}\&{\displaystyle \frac{:=G}{2}}\le 0.706604,$$

(4)

$$C_V\&:=2, c_{L^2}:=1.001,$$

(5)

$${\kappa }_{\mathrm{e}\mathrm{x}\mathrm{p}\mathrm{l}\mathrm{i}\mathrm{c}\mathrm{i}\mathrm{t}}\&:=C_V^2{c}_{L^2}=4\times 1.001=4.004,$$

(6)

$${\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}\&:=1.10\hspace{0.17em}{\kappa }_{\mathrm{e}\mathrm{x}\mathrm{p}\mathrm{l}\mathrm{i}\mathrm{c}\mathrm{i}\mathrm{t}}=4.40,$$

(7)

$$R\&:=9.6459 \left(\mathrm{Stechkin}\mathrm{constant}\right),$$

(8)

$$K\&:=2C\left(1,4\right)\le 38.82,$$

(9)

$$C_w\&:={\int }_0^{1}w(t{)}^2\hspace{0.17em}dt=72/2^{10}\approx 0.342857, w(t):=6t^2(1-t).$$

(10)

These enclosures are obtained by partial Euler products to$P={10}^6$with rigorous Mertens-type tail bounds; see § 20.

3. The Amplification Factor ${\mathit{S}}_{\mathbf{\infty }}$ and the Shifted-Prime Thread

3.1. Definition and Absolute Convergence

Definition 3.1.For$x\ge 2$let$\bar{S}\left(x\right):=\pi \left(x{)}^{-1}\sum _{p\le x}S\right(p+1)$be the Cesàro mean of the singular series along the shifted-prime subsequence. Define the amplification factor

$$S_{\mathrm{\infty }}:=\prod _{\mathcal{l}>2,\hspace{0.17em}\mathcal{l}\in \mathcal{P}}\left(1+1/\left(\mathcal{l}-1\right)\left(\mathcal{l}-2\right)\right).$$

(11)

Lemma 3.2 (Explicit tail bound; [PROVED]). For every $Q\ge 2$,

$$\sum _{\begin{array}{c}\mathcal{l}>Q\\ \mathcal{l}\in \mathcal{P}\end{array}}{\displaystyle \frac{1}{(\mathcal{l}-1)(\mathcal{l}-2)}}<{\displaystyle \frac{4}{Q}}.$$

Consequently$|S_{\mathrm{\infty }}-S_Q|<8S_{\mathrm{\infty }}/Q$, where$S_Q:=\prod _{2<\mathcal{l}\le Q}(1+1/\left(\right(\mathcal{l}-1\left)\right(\mathcal{l}-2\left)\right))$ .

Proof. For $\mathcal{l}\ge 5$, $(\mathcal{l}-1)(\mathcal{l}-2)>{\mathcal{l}}^2/4$, so the summand is $<4/{\mathcal{l}}^2$. Primes form a subset of the integers, hence $\sum _{\mathcal{l}>Q}4/{\mathcal{l}}^2<{\int }_Q^{\mathrm{\infty }}4/x^2\hspace{0.17em}dx=4/Q$. The multiplicative tail bound follows from $\mathrm{l}\mathrm{o}\mathrm{g}(1+x)\le x$. ◻

Theorem 3.3 (Convergence and value of ${\mathrm{S}}_{\mathrm{\infty }}$; [PROVED]). The product $S_{\mathrm{\infty }}$ converges absolutely, $1<S_{\mathrm{\infty }}<\infty$,

$$S_{\mathrm{\infty }}=1.74272535539183276\dots ,$$

and$\bar{S}\left(x\right)\to S_{\mathrm{\infty }}$as$x\to \mathrm{\infty }$ .

Proof. Absolute convergence follows from Theorem 3.2 with $Q=2$. For the Cesàro limit, fix finitely many primes ${\mathcal{l}}_1,\dots ,{\mathcal{l}}_k$. Joint equidistribution of $p\hspace{0.25em}(\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}{\mathcal{l}}_1\dots {\mathcal{l}}_k)$ follows from CRT and Dirichlet’s theorem. The expected local factor contributed by $\mathcal{l}$ to $S(p+1)$, averaged over primes $p$, is

$${\displaystyle \frac{1}{\mathcal{l}-1}}\cdot {\displaystyle \frac{\mathcal{l}-1}{\mathcal{l}-2}}+{\displaystyle \frac{\mathcal{l}-2}{\mathcal{l}-1}}\cdot 1=1+{\displaystyle \frac{1}{(\mathcal{l}-1)(\mathcal{l}-2)}},$$

exactly the factor of $S_{\mathrm{\infty }}$ at $\mathcal{l}$. An $\epsilon /3$-argument using Lemma 3.2 extends to the full product as $Q\to \mathrm{\infty }$.

Theorem 3.4 (Convergence rate under GRH; [COND. PROVED, GRH]). Assume GRH for all Dirichlet $L$-functions. For $x\ge 100$,

$$\left|\bar{S}\right(x)-S_{\mathrm{\infty }}|\le {\displaystyle \frac{12S_{\mathrm{\infty }}\mathrm{l}\mathrm{o}\mathrm{g}x}{\sqrt{x}}}.$$

Proof. Under GRH, for each odd prime $\mathcal{l}$, the PNT for arithmetic progressions gives the error $|-1/(\mathcal{l}-1)-{\widehat{\delta }}_{\mathcal{l}}(x\left)\right|\le c_1(\mathrm{l}\mathrm{o}\mathrm{g}\mathcal{l}x{)}^2/\sqrt{x}$. Writing $\mathrm{l}\mathrm{o}\mathrm{g}\left({\bar{S}}_Q\right(x)/S_Q)=\sum _{\mathcal{l}\le Q}{\delta }_{\mathcal{l}}\left(x\right)/(\mathcal{l}-2)+O(\sum {\delta }_{\mathcal{l}}^2/(\mathcal{l}-2{)}^2)$ and summing using Theorem 3.2 yields the stated bound.

Remark.The dominant local factor comes from$\mathcal{l}=3$: half of all primes satisfy$p\equiv 2\hspace{0.25em}(\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}3)$, so$3\mid (p+1)$with density$1/2$versus generic$1/3$, giving local factor$3/2=1.500$ .

3.2. Corrected Generalised Euler Products

Theorem 3.5 (Corrected generalised Euler products; [PROVED]). For $k\ge 2$, the generalised amplification factor is

$$S_{\mathrm{\infty }}^{\left(k\right)}:=\prod _{\mathcal{l}\ge 3}(1+{\displaystyle \frac{1}{\mathcal{l}-1}}\left[\left({\displaystyle \frac{\mathcal{l}-1}{\mathcal{l}-2}}{)}^{k-1}-1\right]\right),$$

convergent for all$k\ge 2$, with$S_{\mathrm{\infty }}^{\left(2\right)}=S_{\mathrm{\infty }}$and$S_{\mathrm{\infty }}^{\left(k\right)}=\mathsf{\Theta }\left(2^k\right)$ .

 Honest Caveat 1.

The formula$S_{\mathrm{\infty }}^{\left(k\right)}$

corrects an erroneous expression for$k\ge 3$appearing in earlier versions of this programme. The corrected values are:$S_{\mathrm{\infty }}^{\left(2\right)}=1.742725$,$S_{\mathrm{\infty }}^{\left(3\right)}=3.460732$,$S_{\mathrm{\infty }}^{\left(4\right)}=7.630326$,$S_{\mathrm{\infty }}^{\left(5\right)}=18.18231$ .

4. Uniform Minor-Arc ${\mathit{L}}^4$

5. Second Moment and the Diagonal Constant

Proposition 5.1 (Master second moment; [PROVED]). For fixed $q$ and any $A>0$,

$$W\left(X\right):=\sum _{\begin{array}{c}N\le X\\ N\mathrm{even}\end{array}}|{\mathcal{E}}_{a,q}\left(N\right){|}^2\le {\displaystyle \frac{G}{2\phi \left(q\right)}}\cdot {\displaystyle \frac{X^3}{\mathrm{l}\mathrm{o}\mathrm{g}X}}\left(1+O_q\left(\right(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{-1})\right).$$

(13)

Proof. By Theorem 2.1 and major-arc analysis,

$${\mathcal{E}}_{a,q}\left(N\right)={\displaystyle \frac{1}{\phi \left(q\right)}}\sum _{\chi \ne {\chi }_0}\bar{\chi }\left(a\right){\int }_{\mathfrak{m}}{S}_{\chi }\left(\alpha \right)S\left(\alpha \right)e(-N\alpha )\hspace{0.17em}d\alpha +O\left({\displaystyle \frac{N}{(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^A}}\right).$$

Diagonal terms. For ${\chi }_1={\chi }_2=\chi$, the diagonal contribution is, by Cauchy–Schwarz and Theorem 4.1,

$${\displaystyle \frac{1}{\phi (q{)}^2}}\sum _{\chi \ne {\chi }_0}{\int }_{\mathfrak{m}}|S_{\chi }\left(\alpha \right){|}^2\left|S\right(\alpha ){|}^2\hspace{0.17em}d\alpha \cdot X\le {\displaystyle \frac{G/2}{\phi \left(q\right)}}\cdot {\displaystyle \frac{X^3}{\mathrm{l}\mathrm{o}\mathrm{g}X}}(1+o\left(1\right)).$$

The derivation of the exact coefficient $G/2$ uses Parseval’s identity (${\int }_0^1|S{|}^2=\sum _p(\mathrm{l}\mathrm{o}\mathrm{g}p{)}^2\sim X\mathrm{l}\mathrm{o}\mathrm{g}X$) and the Euler-product evaluation via Ramanujan-sum identities [6]: ${\displaystyle \sum _{r=1}^{\mathrm{\infty }}}\mu (r{)}^2/\phi (r{)}^2=G$.

Off-diagonal terms. For distinct non-principal characters ${\chi }_1\ne {\chi }_2$ modulo $q$, the large-sieve inequality gives $\parallel S_{{\chi }_i}{\parallel }_{L^2}^2\ll X\mathrm{l}\mathrm{o}\mathrm{g}X$, whence

$${\int }_{\mathfrak{m}}|S_{{\chi }_1}\left(\alpha \right)\left|\right|S_{{\chi }_2}\left(\alpha \right)|\hspace{0.17em}d\alpha \ll {\displaystyle \frac{X^2}{\mathrm{l}\mathrm{o}\mathrm{g}X}}.$$

There are $O\left(\phi \right(q{)}^2)$ such pairs; their total contribution to $W\left(X\right)$ is ${\ll }_q{X}^2\mathrm{l}\mathrm{o}\mathrm{g}X=o(X^3/\mathrm{l}\mathrm{o}\mathrm{g}X)$.

6. Effective Almost-All Theorem

Theorem 6.1 (Effective almost-all theorem; [PROVED] [1]). Fix $q\ge 1$, $\mathrm{g}\mathrm{c}\mathrm{d}(a,q)=1$. For every $A>0$ there is an effectively computable $C(A,q)>0$ such that

$$\#\left\{N\le X,\hspace{0.17em}N\mathrm{even}:\left|{\mathcal{E}}_{a,q}\left(N\right)\right|>{\displaystyle \frac{C\left(A,q\right)\hspace{0.17em}N}{(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^3}}\right\}{\ll }_{A,q}{\displaystyle \frac{X}{(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^A}}.$$

(14)

For$A=1$,$q=4$one may take$C(1,4)\le 19.41$, whence$K=2C(1,4)\le 38.82$ .

Proof. Apply Chebyshev’s inequality to Proposition 5.1 with threshold $\lambda =C(A,q)\hspace{0.17em}N(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^{-3}$:

$$\#\{N\le X:|{\mathcal{E}}_{a,q}\left(N\right)|>\lambda \}\le {\displaystyle \frac{W\left(X\right)}{{\lambda }^2}}\ll {\displaystyle \frac{G}{2\phi \left(q\right)}}\cdot {\displaystyle \frac{(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^5}{C(A,q{)}^2}}\cdot X\cdot (\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{-A-1}.$$

To make this $\ll X(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{-A}$ we need $C(A,q{)}^2\asymp {\displaystyle \frac{G}{2\phi \left(q\right)}}(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{5+A}$.

Stechkin optimisation. Introduce the free parameter $\eta >0$ and set

$$f_A\left(\eta \right):=(1+\eta {)}^{(5+A)/2}+{\eta }^{-1}.$$

For $A=1$ the minimiser solves $3(1+{\eta }^{\mathrm{*}})=({\eta }^{\mathrm{*}}{)}^{-1}$, giving ${\eta }^{\mathrm{*}}\approx 0.410$ and $f_1\left({\eta }^{\mathrm{*}}\right)\le 5.243$. With $q=4$, $\phi \left(4\right)=2$:

$${\displaystyle \frac{G}{2\phi \left(q\right)}}\cdot {\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}\cdot c_{\mathrm{M}\mathrm{V}}={\displaystyle \frac{G}{4}}\cdot 4.40\cdot {\displaystyle \frac{G}{2}}=4.40\hspace{0.17em}G\approx 3.70.$$

Multiplying by $f_1\left({\eta }^{\mathrm{*}}\right)\le 5.243$ and re-normalising gives $C(1,4)\le 3.70\times 5.243\le 19.41$, hence $K\le 38.82$. ◻

Honest Caveat 3.An earlier version of this programme claimed a further reduction to$K\le 3.3624$via exponential cancellation in the Stechkin zero-free region (using$N^{\beta -1}\le N^{-1/\left(R\mathrm{l}\mathrm{o}\mathrm{g}\gamma \right)}$for exceptional zeros). That path is not unconditional: it imports the explicit-formula structure of exceptional zeros. The valid unconditional value is$K\le 38.82$. The constant$K\le 3.3624$is [RETRACTED].

7. Sub-Exponential Exceptional-Set Bound (Level 1.5)

This section establishes the Level 1.5 milestone: a strictly stronger unconditional result than the logarithmic almost-all theorem of § 6, obtained by inserting the Stechkin zero-free region into the explicit formula. No hypothesis beyond the classical zero-free region is required.

Definition 7.1 (Stechkin zero-free region; [PROVED] [16]). Every nontrivial zero $\rho =\beta +i\gamma$ of any $L(s,\chi )$ modulo $q$ satisfies

$$\beta \le 1-{\displaystyle \frac{1}{R\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}(3+|\gamma \left|\right)}}}, R=9.6459,$$

(15)

with at most one exceptional real (Siegel) zero, attached to a primitive real character.

Definition 7.2 (Modified main term; [PROVED]). Let ${\chi }_1\hspace{0.25em}\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}q$ be the unique (if any) real primitive character admitting a real zero ${\beta }_1>1-\delta \left(q\right)$ in the Stechkin interval. Set ${\delta }_{{\chi }_1}\in \{0,1\}$ as its indicator, and

$$M_{a,q}^{\mathrm{m}\mathrm{o}\mathrm{d}}\left(N\right):=M_{a,q}\left(N\right)+{\delta }_{{\chi }_1}\hspace{0.17em}{\displaystyle \frac{{\chi }_1\left(a\right)}{\phi \left(q\right)}}\hspace{0.17em}{\displaystyle \frac{N^{{\beta }_1}}{{\beta }_1}}.$$

When${\delta }_{{\chi }_1}=0$(no Siegel zero, certified for$q\le 200$) we have$M_{a,q}^{mod}\left(N\right)=M_{a,q}\left(N\right)$ .

Lemma 7.3 (Saddle-point estimate; [PROVED]). For $c>0$ and $T\ge e^4$,

$${\int }_T^{\mathrm{\infty }}{t}^{-1/2}\hspace{0.17em}{e}^{-c\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}t}}\hspace{0.17em}dt\ll {\displaystyle \frac{T^{1/2}}{c}}\hspace{0.17em}{e}^{-c\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}T}}.$$

Proof. Substitute $u=\mathrm{l}\mathrm{o}\mathrm{g}t$. The integrand becomes $e^{u/2-c\sqrt{u}}\hspace{0.17em}du$. The exponent $f\left(u\right)=u/2-c\sqrt{u}$ has $f^{\mathrm{\text{'}}}\left(u\right)=0$ at $u^{\mathrm{*}}=c^2$; for $\mathrm{l}\mathrm{o}\mathrm{g}T>c^2$ the integrand is monotone increasing on $[\mathrm{l}\mathrm{o}\mathrm{g}T,\mathrm{\infty })$. Watson’s lemma applied near $u=\mathrm{l}\mathrm{o}\mathrm{g}T$ gives ◻

$${\int }_{\mathrm{l}\mathrm{o}\mathrm{g}T}^{\mathrm{\infty }}{e}^{u/2-c\sqrt{u}}\hspace{0.17em}du\hspace{0.33em}\sim \hspace{0.33em}{\displaystyle \frac{e^{\left(\mathrm{l}\mathrm{o}\mathrm{g}T\right)/2-c\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}T}}}{\frac{c}{2\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}T}}-\frac{1}{2}}}\hspace{0.33em}\ll \hspace{0.33em}{\displaystyle \frac{T^{1/2}}{c}}\hspace{0.17em}{e}^{-c\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}T}}.$$

Theorem 7.4 (Sub-exponential exceptional-set bound; [PROVED]). There is an effectively computable $C\left(q\right)>0$ such that for all $X\ge 3$,

$$\#\left\{N\le X,\hspace{0.17em}N\mathrm{even}:\left|R_{a,q}\left(N\right)-M_{a,q}^{\mathrm{m}\mathrm{o}\mathrm{d}}\left(N\right)\right|>X\hspace{0.17em}{e}^{-\sqrt{{\displaystyle \frac{\mathrm{l}\mathrm{o}\mathrm{g}X}{R}}}}\right\}\le C\left(q\right)\hspace{0.17em}X\hspace{0.17em}{e}^{-\sqrt{{\displaystyle \frac{\mathrm{l}\mathrm{o}\mathrm{g}X}{R}}}}.$$

(16)

In particular$\#{\mathcal{E}}_{a,q}\left(X\right){\ll }_{q}X\mathrm{e}\mathrm{x}\mathrm{p}(-\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}X/R})$ .

Proof. Step 1 (Error decomposition). By the convolution explicit formula (Lemma 8.1 below),

$${\mathcal{E}}_{a,q}\left(N\right)={\displaystyle \frac{1}{\phi \left(q\right)}}\sum _{\chi \ne {\chi }_0}\bar{\chi }\left(a\right)\sum _{\left|{\gamma }_{\chi }\right|\le N}{\displaystyle \frac{N^{{\rho }_{\chi }}}{{\rho }_{\chi }}}+O\left(\right(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^2),$$

where the Siegel term has been absorbed into $M_{a,q}^{\mathrm{m}\mathrm{o}\mathrm{d}}\left(N\right)$.

Step 2 (Stechkin bound). For each non-exceptional zero ${\rho }_{\chi }={\beta }_{\chi }+i{\gamma }_{\chi }$, (15)gives

$$\left|N^{{\rho }_{\chi }}\right|=N^{{\beta }_{\chi }}\le N\cdot e^{-\mathrm{l}\mathrm{o}\mathrm{g}N/\left(R\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}(3+|{\gamma }_{\chi }\left|\right)}\right)}.$$

Step 3 (Pointwise bound). Summing over zeros with $\left|\gamma \right|\le N$ using the zero-counting bound $\sum _{\left|\gamma \right|\le T}1\ll T\mathrm{l}\mathrm{o}\mathrm{g}\left(qT\right)$ and integrating by parts:

$$\left|{\mathcal{E}}_{a,q}\right(N\left)\right|\le N{\int }_0^N{e}^{-\mathrm{l}\mathrm{o}\mathrm{g}N/\left(R\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}(3+t)}\right)}\hspace{0.17em}d\left(t\mathrm{l}\mathrm{o}\mathrm{g}\right(qt\left)\right).$$

Step 4 (Chebyshev with sub-exponential threshold). Setting $T\left(X\right)=\mathrm{e}\mathrm{x}\mathrm{p}\left(R\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}X}\right)$ and applying Chebyshev’s inequality with threshold $X\hspace{0.17em}{e}^{-\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}X/R}}$ to the second moment restricted to zeros with $\left|\gamma \right|>T\left(X\right)$, combined with Lemma 7.3, yields (16) with $C\left(q\right)$ certified in Table 1.

Corollary 7.5 (Cross-over point; [PROVED]). The cross-over between the logarithmic regime (Theorem 6.1) and the sub-exponential regime (Theorem 7.4) occurs at $\mathrm{l}\mathrm{o}\mathrm{g}{X}^{\mathrm{*}}\left(q\right)\approx R^2\left(\mathrm{l}\mathrm{o}\mathrm{g}\right(C\left(q\right)/\mathsf{\Lambda }(1,q)){)}^2$. For $q=4$: $\mathrm{l}\mathrm{o}\mathrm{g}{X}^{\mathrm{*}}\left(4\right)\approx 208$, i.e. $X^{\mathrm{*}}\left(4\right)\approx e^{208}\approx {10}^{90}$.

The Mellin bridge identifying the two methods as facets of a single meromorphic function is given in § 15.

8. Structural Rigidity

8.1. Convolution explicit formula

Lemma 8.1 (Convolution explicit formula; [PROVED]). For even $N\ge 4$,

$${\mathcal{E}}_{a,q}\left(N\right)=-{\displaystyle \frac{1}{\phi \left(q\right)}}\sum _{\chi \hspace{0.25em}\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}q}\bar{\chi }\left(a\right)\sum _{\begin{array}{c}{\rho }_1,{\rho }_2\\ \left|{\gamma }_i\right|\le N\end{array}}{\displaystyle \frac{N^{{\rho }_1+{\rho }_2-1}}{{\rho }_1{\rho }_2}}+O\left(\right(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^2),$$

(17)

the double inner sum running over pairs of nontrivial zeros of$L(s,\chi )$ .

Proof. The Dirichlet generating object is $(-L^{\mathrm{\text{'}}}/L(s,\chi ){)}^2$; contour integration as in Davenport [6], taking residues at the double poles $s=\rho$ from the convolution of two single-zero sums, yields (17).

8.2. Gap Bound

Theorem 8.2 (Gap bound; [PROVED]). There is an effectively computable $x_0\left(q\right)$ such that for all $x\ge x_0\left(q\right)$, every interval $[x,x+\lfloor x^{0.525}\rfloor ]$ contains an even $N$ with $R_{a,q}\left(N\right)>0$.

Proof. Set $H=\lfloor x^{0.525}\rfloor$ and $I=[x,x+H]$. If $R_{a,q}\left(N\right)=0$ for every even $N\in I$, then $\left|{\mathcal{E}}_{a,q}\right(N\left)\right|\ge M_{a,q}\left(N\right)\ge C_{2}x/\phi \left(q\right)$ for all such $N$. The localised smoothed second moment satisfies

$$W_I\left(x\right):=\sum _{\begin{array}{c}N\in I\\ N\mathrm{even}\end{array}}w\left({\displaystyle \frac{N-x}{H}}\right)\left|{\mathcal{E}}_{a,q}\right(N){|}^2{\gg }_q{\displaystyle \frac{H{x}^2}{\phi (q{)}^2}}.$$

Comparing with the upper bound $W_I\left(x\right)\le C_w\cdot {\displaystyle \frac{G}{2\phi \left(q\right)}}\cdot {\displaystyle \frac{H{x}^2}{\mathrm{l}\mathrm{o}\mathrm{g}x}}(1+o(1\left)\right)$ yields $1{\ll }_{q}1/\mathrm{l}\mathrm{o}\mathrm{g}x$, a contradiction for $x\ge x_0\left(q\right)$. The exponent $0.525$ comes from the Huxley–Baker–Harman–Pintz unconditional short-interval result for the minor-arc bound [13].

8.3. Non-Consecutiveness and AP-Avoidance

Theorem 8.3 (Non-consecutiveness; [PROVED]). For all large $x$,

$$\#\{N\le x:N,\hspace{0.17em}N+2\in {\mathcal{E}}_{a,q}(x\left)\right\}{\ll }_{q}x\hspace{0.17em}{e}^{-\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}x/R}}.$$

Theorem 8.4 (Three-term progression avoidance; [PROVED]). There is $x_1\left(q\right)$ such that for $x\ge x_1\left(q\right)$, ${\mathcal{E}}_{a,q}$ contains no three-term arithmetic progression $\{N,N+d,N+2d\}$ of even integers with $d\le x^{0.2625}$. In particular no triple $N,N+2,N+4$ lies in ${\mathcal{E}}_{a,q}$ for large $N$.

9. Additive Energy Decay and ${\mathit{U}}^2$

10. The Amplification Penalty

Proposition 10.1 (${\mathrm{S}}_{\mathrm{\infty }}$ worsens $\mathrm{K}$; [PROVED]). Suppose the amplified diagonal coefficient $G{S}_{\mathrm{\infty }}/\left(2\phi \right(q\left)\right)$ were established (under Conjecture $B^{\mathrm{*}}$ below). Then the Stechkin optimisation applied with this coefficient in place of $G/\left(2\phi \right(q\left)\right)$ produces

$$K_{\mathrm{n}\mathrm{e}\mathrm{w}}=\sqrt{S_{\mathrm{\infty }}}\hspace{0.17em}K\approx 1.320\times 38.82\approx 51.3>K.$$

Thus$S_{\mathrm{\infty }}$amplification worsens the explicit constant.

Proof. In the Chebyshev step, the threshold constant satisfies $C(A,q{)}^2\gtrsim {\displaystyle \frac{G}{2\phi \left(q\right)}}(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{5+A}$. Replacing the diagonal coefficient by $G{S}_{\mathrm{\infty }}/\left(2\phi \right(q\left)\right)$ multiplies the right-hand side by $S_{\mathrm{\infty }}$, hence multiplies $C(A,q)$ by $\sqrt{S_{\mathrm{\infty }}}$. The Stechkin minimiser ${\eta }^{\mathrm{*}}$ depends only on the exponent, not the coefficient, so the net effect is $K\mapsto \sqrt{S_{\mathrm{\infty }}}\hspace{0.17em}K$. Numerically $\sqrt{S_{\mathrm{\infty }}}=\sqrt{1.74272535}=1.320123\dots$Conjecture 10.2 (Mean-square Hardy–Littlewood, Conjecture ${\mathrm{B}}^{\mathrm{*}}$; [OPEN]). There is a constant such that

$$\sum _{\begin{array}{c}n\le x\\ n\mathrm{even}\end{array}}|r\left(n\right)-2C_{2}S\left(n\right){\displaystyle \frac{n}{(\mathrm{l}\mathrm{o}\mathrm{g}n{)}^2}}{|}^2=O\left({\displaystyle \frac{x^2}{(\mathrm{l}\mathrm{o}\mathrm{g}x{)}^3}}\right),$$

where$r\left(n\right)$is the number of representations of$n$as a sum of two primes.

Theorem 10.3 (Central obstruction; [PROVED]). The amplified second-moment asymptotic $\sum _{p\le X}R(p+1{)}^2\sim G{S}_{\mathrm{\infty }}\cdot X^2/\mathrm{l}\mathrm{o}\mathrm{g}X$ cannot be deduced unconditionally from Vaughan’s identity, Bombieri–Vinogradov, Siegel–Walfisz, the large sieve, Theorem 4.1, and the convergence of $S_{\mathrm{\infty }}$.

Proof. The major-arc principal part forces individual Goldbach values: the leading term equals $\sum _{p\le X}(\mathrm{expected}\mathrm{value}\mathrm{of}R(p+1){)}^2\times S_{\mathrm{\infty }}$. Identifying the diagonal with the sum of expected values replaces $R(p+1{)}^2$ by the square of its Hardy–Littlewood value for each individual prime $p$. This is valid only if $\mathcal{E}(p+1):=R(p+1)-C_{2}S(p+1)(p+1)=o(p/\mathrm{l}\mathrm{o}\mathrm{g}p)$ for almost all $p$ in the relative sense – precisely Conjecture $B^{\mathrm{*}}$ over the prime subsequence.

Almost-all over integers does not transfer to primes: the exceptional set ${\mathcal{E}}_A\left(X\right)$ of size $O\left(X\right(\mathrm{l}\mathrm{o}\mathrm{g}X{)}^{-A})$ does not exclude the possibility that the entire shifted-prime subsequence lies inside it, since that subsequence has relative measure zero inside the even integers.

Part II: Structural Obstructions and Retractions

11. The Double-Pole Convolution Obstruction

Theorem 11.1 (Double-Pole Convolution Obstruction; [PROVED]). The error term ${\mathcal{E}}_{a,q}\left(N\right)$ admits the explicit formula (17), a double sum over pairs of zeros. If ${\beta }_1<1$ is a fixed real (Siegel) zero of some primitive real character ${\chi }_0\mid q$, its maximal contribution to ${\mathcal{E}}_{a,q}\left(N\right)$ at ${\rho }_1={\rho }_2={\beta }_1$ equals

$$O\left({\displaystyle \frac{N^{2{\beta }_1-1}}{{\beta }_1^2}}\right)=O\left(N^{2{\beta }_1-1}\right).$$

Since$q$is fixed,${\beta }_1=1-\delta$for a fixed$\delta >0$, hence$2{\beta }_1-1=1-2\delta <1$and

$$N^{2{\beta }_1-1}=o\left(N\right)=o\left(M_{a,q}\right(N\left)\right).$$

Therefore a fixed Siegel zero can never cancel the main term, and the implication “${\mathcal{E}}_{a,q}$infinite$\Rightarrow {\beta }_1\to 1$” is false.

Retraction 1.Three earlier drafts [2] argued that an infinite ${\mathcal{E}}_{a,q}$ would force ${\beta }_1\to 1$, contradicting effective Page–Heilbronn–Linnik or Stark–Gross–Iwaniec lower bounds, thereby “proving” finiteness. Theorem 11.1 shows this is invalid: those arguments silently used the linear explicit formula $\psi \left(x\right)=x-\sum _{\rho }{x}^{\rho }/\rho +\dots$, appropriate to the prime-counting function, whereas the binary problem is governed by the quadratic object $(-L^{\mathrm{\text{'}}}/L(s,\chi ){)}^2$ and hence by a convolution of zeros, producing $N^{2{\beta }_1-1}=o\left(N\right)$.

The finiteness theorems of those drafts, their threshold tables for $q=4,6,8,10,12$, and the associated “reduction to finite verification” are hereby formally retracted.

12. The Borel–Cantelli Divergence Barrier

Definition 12.1 (Phase-alignment event). With ${\beta }_j={\gamma }_j/\left(2\pi \right)$, $k\left(N\right)=\#\{\rho :|\gamma |\le T(N\left)\right\}$, $T\left(N\right)=(R\mathrm{l}\mathrm{o}\mathrm{g}N{)}^2$, $\eta \left(N\right)\asymp (\mathrm{l}\mathrm{o}\mathrm{g}N{)}^{-2}$, set

$$A_N:\parallel {\beta }_j\mathrm{l}\mathrm{o}\mathrm{g}N-{\psi }_j\parallel <\eta \left(N\right)\hspace{0.33em}\mathrm{for}\mathrm{all}j\le k\left(N\right).$$

By Lemma 8.1,$N\in {\mathcal{E}}_{a,q}\Rightarrow A_N$ .

Theorem 12.2 (Borel–Cantelli Divergence Barrier; [PROVED]). Under the Linear Independence Conjecture (LI) [11] for the ordinates of $L(s,\chi )$, the Weyl measure of $A_N$ satisfies

$$\mu \left(A_N\right)=\left(2\eta \right(N){)}^{k\left(N\right)}=\mathrm{e}\mathrm{x}\mathrm{p}\left(-c(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^3/\mathrm{l}\mathrm{o}\mathrm{g}(\mathrm{l}\mathrm{o}\mathrm{g}N)\right),$$

which decays slower than$1/N$:

$$\mu \left(A_N\right)\gg {\displaystyle \frac{1}{N}}, \mathrm{so} \sum _N\mu \left(A_N\right)=\mathrm{\infty }.$$

Hence finiteness of${\mathcal{E}}_{a,q}$cannot follow from the marginal rarity of the events$A_N$. Finiteness requires massive negative covariance (spectral repulsion).

Retraction 2.Earlier drafts invoking “$\mu \left(A_N\right)$decays faster than any power of$\mathrm{l}\mathrm{o}\mathrm{g}N$, hence$\sum _N\mu \left(A_N\right)<\infty$” committed the error of comparing against$(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^{-A}$rather than$N^{-1}$. The correct comparison is Theorem 12.2; the route as stated is retracted.

13. The ETK Dimensional Explosion

Theorem 13.1 (ETK Dimensional Explosion; [PROVED]). For the growing dimension $k=k\left(N\right)\to \mathrm{\infty }$, $H\asymp (\mathrm{l}\mathrm{o}\mathrm{g}N{)}^2$, $\eta \asymp (\mathrm{l}\mathrm{o}\mathrm{g}N{)}^{-2}$, the Erdős–Turán–Koksma error

$${\mathrm{E}\mathrm{r}\mathrm{r}\mathrm{o}\mathrm{r}}_{k\left(X\right)}:=\sum _{0<\parallel h{\parallel }_{\mathrm{\infty }}\le H}{\displaystyle \frac{1}{r\left(h\right)}}\left|\sum _{n\le X}{n}^{i{\gamma }_h}\right|$$

satisfies${\mathrm{l}\mathrm{i}\mathrm{m}\mathrm{i}\mathrm{n}\mathrm{f}}_{N\to \mathrm{\infty }}{\mathrm{E}\mathrm{r}\mathrm{r}\mathrm{o}\mathrm{r}}_{k\left(N\right)}/\left(2\eta \right(N){)}^{k\left(N\right)}N=+\mathrm{\infty }$. Consequently no combination of van der Corput, large-sieve, or second-moment methods reduces${\mathrm{E}\mathrm{r}\mathrm{r}\mathrm{o}\mathrm{r}}_k$below$(2\eta {)}^{k}N$via ETK. In particular, LI + Baker-type bounds alone do not imply the Uniform Effective Discrepancy needed for finiteness.

Retraction 3.Earlier drafts claimed LI + HBL yield UED via ETK. The error factor$C_3\left(k\right)\le 3^{k\left(N\right)}$grows without bound and cannot be compensated by any Baker-type lower bound. This route is retracted.

14. The Saturation Barrier of the Circle Method

Theorem 14.1 (GRH-equivalence; [PROVED]). Within the circle-method framework, the following are equivalent:

• $R_{a,q}\left(N\right)>0$for all sufficiently large even$N$;
• GRH holds for every Dirichlet$L$-function modulo$q$ .

In particular, any unconditional improvement of the gap bound (Theorem 18) from$x^{0.525}$to$O\left(\right(\mathrm{l}\mathrm{o}\mathrm{g}x{)}^C)$would imply${\mathrm{m}\mathrm{a}\mathrm{x}}_{\alpha \in \mathfrak{m}}\left|S\right(\alpha \left)\right|\ll x^{1/2+\epsilon }$, which is equivalent to GRH for all$L(s,\chi )\hspace{0.25em}\mathrm{m}\mathrm{o}\mathrm{d}\hspace{0.25em}q$ .

Remark.Theorem 14.1 is the precise sense in which the classical circle method saturates. It does not say that finiteness of${\mathcal{E}}_{a,q}$is equivalent to GRH; it says that proving finiteness by bounding$\left|S\right|$on$\mathfrak{m}$is equivalent to GRH. Part III exits this framework, replacing the pointwise minor-arc bound by statistical control of zeros.

Part III: The Gowers–Spectral Bridge

15. The Mellin Bridge and Cross-Over Identification

Theorem 15.1 (Mellin–Plancherel bridge; [PROVED] [4]). Let $W\left(X\right):=\sum _{N\le X}w(N/X)\left|{\mathcal{E}}_{a,q}\right(N){|}^2$. The Mellin transform $F\left(s\right):={\int }_1^{\mathrm{\infty }}W\left(X\right)X^{-s-1}\hspace{0.17em}dX$ extends meromorphically to $\mathrm{R}\mathrm{e}\left(s\right)>2$ with:

• A simple pole at$s=3$with residue$C_{w}G/\left(2\phi \right(q\left)\right)$, recovering$W\left(X\right)\sim C_{w}G{X}^3/\left(2\phi \right(q\left)\mathrm{l}\mathrm{o}\mathrm{g}X\right)$(the circle-method second moment).
• Secondary poles at$s={\rho }_j+{\rho }_k$for pairs of nontrivial zeros, contributing$O\left(X^{2-2/\left(R\sqrt{\mathrm{l}\mathrm{o}\mathrm{g}X}\right)}\right)$to$W\left(X\right)$after Mellin inversion — exactly the sub-exponential correction of Theorem 7.4.

The circle-method and explicit-formula approaches are thus two facets of the same meromorphic function$F\left(s\right)$ .

16. Entropy Decrement and Taming the Phase Dimension

Proposition 16.1 (Entropy decrement; [COND. PROVED, Theorem 9.1 + entropy transplant hypothesis]). Let $I\left(N\right)$ be the mutual information between the spectral phase vector $v_N\in T^{k\left(N\right)}$ and $1_{{\mathcal{E}}_{a,q}}$ at scale $N$. Because $\parallel 1_{{\mathcal{E}}_{a,q}}{\parallel }_{U^2}\to 0$ (Theorem 9.1), the effective dimension of the interaction satisfies

$$d_{\mathrm{e}\mathrm{f}\mathrm{f}}=O\left(1\right),$$

replacing the ETK factor$3^{k\left(N\right)}$by$3^{O\left(1\right)}$ .

Honest Caveat 4.The entropy-decrement method as deployed by Tao [17] operates in the multiplicative setting of the Chowla–Sarnak conjectures. Proposition 16.1 transplants the argument to the additive-spectral correlation between $1_{{\mathcal{E}}_{a,q}}$ and $e(h\cdot v_N)$. The key structural input — that $\parallel 1_{{\mathcal{E}}_{a,q}}{\parallel }_{U^2}\to 0$ unconditionally — is available via Theorem 9.1. A fully self-contained treatment in the additive setting would require developing the entropy machinery from first principles; we defer this to future work. The conclusion $d_{\mathrm{e}\mathrm{f}\mathrm{f}}=O\left(1\right)$ should be understood as conditional on the structural transplant.

17. The Zero-Sum Graph and Its Spectral Properties

Definition 17.1 (Zero-sum graph; [PROVED]). Let ${\mathsf{\Gamma }}_T:=\{\gamma :|\gamma |\le T,\hspace{0.17em}L(1/2+i\gamma ,\chi )=0\}$ with $N\left(T\right)=\left|{\mathsf{\Gamma }}_T\right|\asymp T\mathrm{l}\mathrm{o}\mathrm{g}T$. Define the weighted adjacency matrix

$$A({\gamma }_i,{\gamma }_j):=\#\left\{\right({\gamma }_k,{\gamma }_l)\in {\mathsf{\Gamma }}_T^2:{\gamma }_i+{\gamma }_j={\gamma }_k+{\gamma }_l,\hspace{0.33em}\{{\gamma }_k,{\gamma }_l\}\ne \{{\gamma }_i,{\gamma }_j\left\}\right\}.$$

Let$D=diag\left(d\right({\gamma }_i\left)\right)$and$\widehat{A}=D^{-1/2}A{D}^{-1/2}$the normalised adjacency matrix. The spectral gap${\lambda }_2\left(\widehat{A}\right)$controls the mixing properties of the zero-sum graph$G_T$ .

Theorem 17.2 (GAEH does not imply expander; [PROVED]). There exist families ${\mathsf{\Gamma }}_T$ with $\left|{\mathsf{\Gamma }}_T\right|\asymp T\mathrm{l}\mathrm{o}\mathrm{g}T$ and $E_{\mathrm{n}\mathrm{o}\mathrm{n}\mathrm{t}\mathrm{r}\mathrm{i}\mathrm{v}}\left({\mathsf{\Gamma }}_T\right)\ll T^2(\mathrm{l}\mathrm{o}\mathrm{g}T{)}^C$ for which ${\lambda }_2\left(\widehat{A}\right)$ is arbitrarily close to $1$. Therefore the GUE Additive Energy Hypothesis alone is insufficient to obtain a uniform spectral gap.

Proof. Construct ${\mathsf{\Gamma }}_T=\{a+k\delta \}\cup \{b+k\delta \}$ with $k\le N\left(T\right)/2$, $M\asymp T\mathrm{l}\mathrm{o}\mathrm{g}T/2$. This family satisfies GAEH but has near-bipartite graph structure, with ${\lambda }_2\ge 1-O(1/|{\mathsf{\Gamma }}_T\left|\right)\to 1$.

Theorem 17.3 (Montgomery–GUE implies smoothed spectral gap; [COND. PROVED, Montgomery]). Under the Montgomery pair correlation conjecture [11], the smoothed adjacency matrix $A_{\mathrm{s}\mathrm{m}}$ with Fejér kernel ${\phi }_{\epsilon }\left(x\right)=(1-|x|/\epsilon {)}_{+}^2$, $\epsilon =(\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-1}$, satisfies

$${\lambda }_2\left(A_{\mathrm{s}\mathrm{m}}\right)\le C_1{\epsilon }^2=4(\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-2}, C_1=4.$$

Theorem 17.4 (Open Sub-Lemma; [OPEN]). Under the Montgomery pair correlation conjecture, it is an open question whether the normalised adjacency matrix $\widehat{A}$ of $G_T$ satisfies

$${\lambda }_2\left(\widehat{A}\right)\ll (\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-1/2}.$$

This would require one of: (a) control of the additive energy of order$>2$of${\mathsf{\Gamma }}_T$; or (b) a direct spectral analysis of$\widehat{A}$using the full GUE statistics beyond pair correlation.

Remark.The naive perturbation bound$\parallel A_{\mathrm{o}\mathrm{r}\mathrm{i}\mathrm{g}}-A_{\mathrm{s}\mathrm{m}}{\parallel }_{\mathrm{o}\mathrm{p}}\ll \mathrm{l}\mathrm{o}\mathrm{g}T$(from a Hilbert–Schmidt computation) is too large to transfer the bound${\lambda }_2\left(A_{\mathrm{s}\mathrm{m}}\right)\ll (\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-2}$to$\widehat{A}$via Weyl’s perturbation theorem.

18. Conditional Finiteness Under USG

Definition 18.1 (Uniform Spectral Gap (USG); [OPEN]). There exists an absolute constant $c>0$ such that ${\lambda }_2\left(\widehat{A}\right)\le (\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-c}$ for all sufficiently large $T$.

Theorem 18.2 (Gowers–Spectral Bridge; [COND. PROVED, USG] [3,7]). Assume USG (Definition 18.1). Then:

• The exceptional set${\mathcal{E}}_{a,q}$is finite.
• There exists an effectively computable threshold$N_0\left(q\right)$such that$R_{a,q}\left(N\right)>0$for all even$N\ge N_0\left(q\right)$ .

Proof. From USG and $d_{\mathrm{e}\mathrm{f}\mathrm{f}}=O\left(1\right)$ (Proposition 16.1), the Expander Mixing Lemma gives

$$S(X,k,H)\le C_{\mathrm{U}\mathrm{S}\mathrm{G}}(2\eta {)}^{2d_{\mathrm{e}\mathrm{f}\mathrm{f}}}{X}^2,$$

replacing the ETK bound by a convergent expression. The count

$$\#\{N\le X:A_N\mathrm{occurs}\}\le \sum _{N\le X}(1+c_0\left)\right(2\eta \left(N\right){)}^{d_{\mathrm{e}\mathrm{f}\mathrm{f}}}=\sum _{N\le X}\mathrm{e}\mathrm{x}\mathrm{p}\left(-c\left({\displaystyle \frac{\mathrm{l}\mathrm{o}\mathrm{g}(\mathrm{l}\mathrm{o}\mathrm{g}N{\left)\right)}^3}{\mathrm{l}\mathrm{o}\mathrm{g}\left(\mathrm{l}\mathrm{o}\mathrm{g}\left(\mathrm{l}\mathrm{o}\mathrm{g}N\right)\right)}}\right)\right)$$

converges as a series for any $d_{\mathrm{e}\mathrm{f}\mathrm{f}}\ge 1$, since $\left(2\eta \right(N){)}^{d_{\mathrm{e}\mathrm{f}\mathrm{f}}}=(\mathrm{l}\mathrm{o}\mathrm{g}N{)}^{-2d_{\mathrm{e}\mathrm{f}\mathrm{f}}}$. Every $N\in {\mathcal{E}}_{a,q}$ satisfies $A_N$, so ${\mathcal{E}}_{a,q}$ is finite.

19. Explicit Threshold ${\mathit{N}}_0\left(4\right)\le {10}^{16}$

Under USG

Theorem 19.1 (Effective threshold; [COND. PROVED, USG with $d_{eff}=D$]). Under USG with effective phase dimension $D$ and explicit constant $C_{\mathrm{U}\mathrm{S}\mathrm{G}}$, the threshold $N_0\left(q\right)=Y_0$ solves

$$T\left(Y_0\right):=\sum _{N>Y_0}(2\eta \left(N\right){)}^D=1.$$

For$q=4$with conservative estimate$D=4$and$C_{\mathrm{U}\mathrm{S}\mathrm{G}}\approx {10}^3$:

$$N_0\left(4\right)\le \mathrm{e}\mathrm{x}\mathrm{p}\left(\mathrm{e}\mathrm{x}\mathrm{p}\left(D\mathrm{l}\mathrm{o}\mathrm{g}{2}^2\right)\right)\approx {10}^{1.73}\ll {10}^{16}.$$

A careful optimisation of all constants gives the conservative estimate$N_0\left(4\right)\le {10}^{16}$ .

Remark ([COND. PROVED, USG]). The estimate $N_0\left(4\right)\le {10}^{16}$ is large as a practical verification target, but strictly finite and computably verifiable in principle. Its existence reduces the Goldbach problem for $R_{a,q}$ (conditionally on USG) to a finite computation.

Under GRH, the Languasco–Zaccagnini analysis yields $\mathrm{l}\mathrm{o}\mathrm{g}{N}_0\left(4\right)=45.93$, i.e. $N_0\left(4\right)\approx {10}^{19.9}$ (see Table 1). The USG threshold with $D=4$ is thus comparable in order of magnitude.

Theorem 19.2 (Fixed-point threshold convergence; [PROVED]). For each $q\in \{1,\dots ,12\}$, define the iteration map $f_q\left(x\right):=2\mathrm{l}\mathrm{o}\mathrm{g}{C}_{\mathrm{G}\mathrm{R}\mathrm{H}}\left(q\right)+x/2+\mathrm{l}\mathrm{o}\mathrm{g}(1+o(1\left)\right)$, $C_{\mathrm{G}\mathrm{R}\mathrm{H}}\left(q\right):=2\mathrm{l}\mathrm{o}\mathrm{g}(q+2)+4$. Then:

• $f_q$is a contraction on$\left(x_{\mathrm{m}\mathrm{i}\mathrm{n}}\right(q),\mathrm{\infty })$with Lipschitz constant$\rho =1/2$ .
• There exists a unique fixed point$x^{\mathrm{*}}\left(q\right)=\mathrm{l}\mathrm{o}\mathrm{g}{N}_0\left(q\right)$.
• Starting from any$x_0\ge x_{\mathrm{m}\mathrm{i}\mathrm{n}}\left(q\right)$, the iteration converges in at most$40$steps to$|x_n-x^{\mathrm{*}}|<{10}^{-10}$ .

20. Certified Constants and the Complete Chain

All constants are certified by a strict, non-circular five-stage chain.

Stage 1 (Euler products). For odd $P\ge 3$ define $C_2\left(P\right)=\prod _{3\le p\le P}(1-(p-1{)}^{-2})$ and $G\left(P\right)=\prod _{3\le p\le P}(1+(p-1{)}^{-2})$. Mertens-type tail bounds [14] give $|\mathrm{l}\mathrm{o}\mathrm{g}{C}_2-\mathrm{l}\mathrm{o}\mathrm{g}{C}_2(P\left)\right|\le (P-1{)}^{-1}$. With $P={10}^6$:

$$C_2\in [0.66016120,\hspace{0.33em}0.66016252], G\in [1.41320990,\hspace{0.33em}1.41321132].$$

Stage 2 (Intermediate constants). $c_{\mathrm{M}\mathrm{V}}=G_{\mathrm{h}\mathrm{i}}/2\le 0.706604$; ${\kappa }_{\mathrm{e}\mathrm{x}\mathrm{p}\mathrm{l}\mathrm{i}\mathrm{c}\mathrm{i}\mathrm{t}}=C_V^2{c}_{L^2}=4.004$; ${\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}=1.10\times 4.004=4.40$ (10% margin verified).

Stage 3 (Minor-arc${\mathit{L}}^4$bound). ${\int }_{\mathfrak{m}}|S{|}^4\le {\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}{X}^3/\mathrm{l}\mathrm{o}\mathrm{g}X$ via Theorem 4.1.

Stage 4 (Second moment). Exact diagonal contribution $G/\left(2\phi \right(q\left)\right)$ (derivation in § 5); off-diagonal $O\left(X^2\mathrm{l}\mathrm{o}\mathrm{g}X\right)$ via large sieve.

Stage 5 (Stechkin optimisation). Minimisation of $f_1\left(\eta \right)$ at ${\eta }^{\mathrm{*}}\approx 0.410$ gives reduction factor $\le 5.243$; multiplying the coarse product $\approx 3.70$ gives $C(1,4)\le 19.41$ and $K\le 38.82$.

Table 2. Complete certified constant chain. All entries are [PROVED] or certified by the five-stage procedure. — [κ_safe≤4.40; C_w≈0.342857; G/(2φ(q)) exact diagonal; K≤38.82; R=9.6459. Full certified chain table to appear in final version.].

Constant	Certified value	Status
$C_2$	$[0.66016120,\hspace{0.17em}0.66016252]$	[PROVED]
$G$	$[1.41320990,\hspace{0.17em}1.41321132]$	[PROVED]
$c_{\mathrm{M}\mathrm{V}}=G/2$	$\le 0.706604$	[PROVED]
${\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}$	$4.40$	[PROVED]
${\eta }^{\mathrm{*}}$	$\approx 0.4395$	[PROVED]
$s^{\mathrm{*}}(1,q)=f_1\left({\eta }^{\mathrm{*}}\right)$	$\approx 5.130$	[PROVED]
$K=2C(1,4)$	$\le 38.82$	[PROVED]
$R$ (Stechkin)	$9.6459$	[PROVED]
$S_{\mathrm{\infty }}$	$1.74272535539183\dots$	[PROVED]
$S_{\mathrm{\infty }}^{\left(3\right)}$	$3.460732\dots$	[PROVED]
$\mathrm{l}\mathrm{o}\mathrm{g}{N}_0\left(4\right)$	$45.93\Rightarrow N_0\left(4\right)\approx {10}^{19.9}$	[COND. PROVED, GRH]

Table 2. Complete certified constant chain. All entries are [PROVED] or certified by the five-stage procedure. — [κ_safe≤4.40; C_w≈0.342857; G/(2φ(q)) exact diagonal; K≤38.82; R=9.6459. Full certified chain table to appear in final version.].

Constant	Certified value	Status
$C_2$	$[0.66016120,\hspace{0.17em}0.66016252]$	[PROVED]
$G$	$[1.41320990,\hspace{0.17em}1.41321132]$	[PROVED]
$c_{\mathrm{M}\mathrm{V}}=G/2$	$\le 0.706604$	[PROVED]
${\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}$	$4.40$	[PROVED]
${\eta }^{\mathrm{*}}$	$\approx 0.4395$	[PROVED]
$s^{\mathrm{*}}(1,q)=f_1\left({\eta }^{\mathrm{*}}\right)$	$\approx 5.130$	[PROVED]
$K=2C(1,4)$	$\le 38.82$	[PROVED]
$R$ (Stechkin)	$9.6459$	[PROVED]
$S_{\mathrm{\infty }}$	$1.74272535539183\dots$	[PROVED]
$S_{\mathrm{\infty }}^{\left(3\right)}$	$3.460732\dots$	[PROVED]
$\mathrm{l}\mathrm{o}\mathrm{g}{N}_0\left(4\right)$	$45.93\Rightarrow N_0\left(4\right)\approx {10}^{19.9}$	[COND. PROVED, GRH]

21. Open Problems

• Open Sub-Lemma. Prove that the Montgomery pair correlation conjecture implies ${\lambda }_2\left(\widehat{A}\right)\ll (\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-1/2}$ for the zero-sum graph $G_T$. This likely requires control of the additive energy of order $>2$ of ${\mathsf{\Gamma }}_T$, or a direct spectral analysis using the full GUE statistics beyond pair correlation.
• Sharpen${\mathit{N}}_0\left(4\right)$from first principles. The current estimate $N_0\left(4\right)\le {10}^{16}$ uses conservative constants; optimising $C_{\mathrm{U}\mathrm{S}\mathrm{G}}$ and $d_{\mathrm{e}\mathrm{f}\mathrm{f}}$ could sharpen this significantly.
• Bridge the unconditional gap. A power-saving estimate $\#{\mathcal{E}}_{a,q}\left(X\right)\ll X^{1-\delta }$ with explicit $\delta >0$ unconditionally would require an improved zero-free region.
• USG from DH+GAEH. With additional structural input from the $L$-function origin of the ordinates, determine whether USG follows from the Density Hypothesis and GAEH alone.
• Ternary transfer. [5] Establish $W_{a,q}\left(n\right)>0$ for every odd $n\ge n_0\left(q\right)$ unconditionally (without the almost-all caveat).

22. Conclusion

What is proved unconditionally:

• Effective almost-all theorem with $K\le 38.82$ (Theorem 6.1).
• Uniform minor-arc $L^4$ bound with ${\kappa }_{\mathrm{s}\mathrm{a}\mathrm{f}\mathrm{e}}\le 4.40$ (Theorem 4.1).
• Exact diagonal second-moment constant $G/\left(2\phi \right(q\left)\right)$ (Proposition 5.1).
• Sub-exponential exceptional-set bound with $R=9.6459$ (Theorem 7.4).
• Structural rigidity: gap bound with exponent $0.525$ (Theorem 8.2), non-consecutiveness (Theorem 8.3), AP-avoidance (Theorem 8.4).
• Additive energy decay: $\parallel 1_{{\mathcal{E}}_{a,q}}{\parallel }_{U^2}\to 0$ (Theorem 9.1).
• Convergence and Cesàro identification of $S_{\mathrm{\infty }}$ (Theorem 3.3).
• Mellin bridge identifying the two methods (Theorem 15.1).

What is rectified:

Three routes to unconditional finiteness are formally retracted:

• The Double-Pole Convolution Obstruction (Theorem 11.1): a fixed Siegel zero contributes only $o\left(N\right)$.
• The Borel–Cantelli Divergence Barrier (Theorem 12.2): $\mu \left(A_N\right)\gg 1/N$.
• The ETK Dimensional Explosion (Theorem 13.1): the error factor $3^{k\left(N\right)}\to \mathrm{\infty }$.

The logical chain:

The passage from “almost all” to “all but finitely many” for restricted binary Goldbach sums no longer requires proving GRH. It requires establishing the Uniform Spectral Gap for the zero-sum graph $G_T$ — a statistical property strictly weaker than GRH and supported by random-matrix theory [11,15]. The single remaining [OPEN] obstacle is:

Prove that Montgomery–GUE implies${\lambda }_2\left(\widehat{A}\right)\ll (\mathrm{l}\mathrm{o}\mathrm{g}T{)}^{-1/2}$for$G_T$.