Indexed metadata

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

Ibar Federico Anderson

Source record

Source: Crossref

Published: Aug 17, 2026

DOI: 10.20944/preprints202607.2077.v4

Open original source ↗

Source abstract

For q≥1 q≥1 and gcd(a,q)=1 gcd(a,q)=1 consider the restricted weighted Goldbach sum Ra,q(N):=∑p1+p2=Np1≡a (mod q)(log⁡p1)(log⁡p2) 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 q , then on a positive-density set of even N N the sum Ra,q(N) R_{a,q}(N) collapses to O(logN) O(logN) , so no main term of size ≍N/φ(q) ≍N/φ(q) can hold uniformly; for powers of two q=2k q=2^{k} this obstruction is absent, and we identify the correct local main term Ma,q(N)=2C2 S(N)N/φ(q) 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=2k,Ra,q(N)=Ma,q(N)+oq(N) q=2^{k}, R_{a,q}(N)=M_{a,q}(N)+o_{q}(N) for all but oq(X)evenN≤X 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.