> Full-text translation from Chinese. The original remains authoritative for its research claims; this translation is not independent mathematical verification. # SRBRD-20 ## Goldbach-Shift Uniform Convolution / Low–High Row Split ### Maynard-II Fixed-Residue Dependency, Maynard-III Uniform Type-II Coverage, Balanced-Residue Embedding, and Minimal Missing Lemma **Parent program:** RG-SCP / Reverse Goldbach Structural Closure Program **Branch:** SRBRD — Symmetric Root-Bounded Relation Domain **Round:** SRBRD-20 **Date:** 2026-09-30 **Version:** v0.1 **Authors:** Neo.K; Aletheia (GPT-5.6 Sol) **Nature:** Proof-Dependency Audit / Low–High Row Analytic Split / Minimal Missing-Theorem Extraction **Prerequisites:** SRBRD-00 through SRBRD-19 **Status:** Substantially narrows the external analytic gap: high-row residue uniformity and prime-coefficient compatibility already have Maynard-III-type theorems; the main unclosed region is concentrated in low-row Goldbach-shift uniformization and sieve-weight factorization / constant strength; Goldbach remains unproved --- # 0. Purpose of This Round SRBRD-19 wrote the external-provider requirements for switched semiprime rows along five axes: $$ \boxed{ C+U+W+P+B } $$ where: - $C$: convolution; - $U$: growing Goldbach residue uniformity; - $W$: well-factorable / sieve-weight compatibility; - $P$: prime first-factor support; - $B$: the full row band: $$ X^{1/3} Yang 2026 supplies the closest $C+W$; > Maynard-III supplies $U$; > but the intersection is missing. After further auditing the technical propositions of Maynard-II / Maynard-III, SRBRD-20 obtains a more precise and more optimistic band structure: $$ \boxed{ \text{Maynard-III itself already directly supplies uniform-residue convolution estimates, and the prime indicator can directly enter the coefficient class.} } $$ Therefore: > Uniform residue + convolution is not missing throughout the entire row band. The actual remaining hard gap can be compressed into the narrower: # Low-Row Goldbach-Shift Uniformization --- # 1. SRBRD Switched Prime-Product Row Retain: $$ X=2m-3. $$ For a semiprime least factor: $$ r=X^t, \qquad \frac13\le t\le\frac12, $$ Prime cofactor: $$ u\asymp X^{1-t}. $$ Core convolution: $$ \boxed{ r\,u \equiv 2m \pmod q. } $$ Both variables are prime. Thus, a dyadic row block has: $$ \boxed{ \alpha_r = \mathbf1_{\mathbb P}(r), } $$ $$ \boxed{ \beta_u = \mathbf1_{\mathbb P}(u). } $$ --- # 2. Prime Indicator Satisfies Maynard-III Siegel–Walfisz Condition Maynard-III Definition 1 defines a Siegel–Walfisz condition for coefficient sequences, and explicitly states that: $$ \boxed{ \alpha_n=\mathbf1_{\mathbb P}(n) } $$ satisfies that condition. Therefore: ## Theorem-Match SRBRD-20-M01 For the Maynard-III Type-II propositions, one can legitimately take: $$ \boxed{ \alpha_n = \mathbf1_{\mathbb P}(n) } $$ and: $$ \boxed{ \beta_m = \mathbf1_{\mathbb P}(m), } $$ Since: - $\alpha$ is Siegel–Walfisz; - $\alpha,\beta$ are both $1$-bounded; - they therefore also satisfy the divisor-bounded coefficient condition. Thus: $$ \boxed{ P\text{ is not a main obstacle in the Maynard-III convolution propositions.} } $$ --- # 3. Maynard-III Proposition 5.1 Maynard-III Proposition 5.1 is a genuine bilinear convolution estimate: $$ \sum_{q\sim Q} \sum_{s\sim S} \sup_{(a,qs)=1} \left| \sum_{n\sim N} \alpha_n \sum_{v\sim M} \beta_v \left( \mathbf1_{nv\equiv a\pmod{qs}} - \frac{ \mathbf1_{(nv,qs)=1} }{ \varphi(qs) } \right) \right|. $$ Its key feature: $$ \boxed{ \sup_a } $$ appears directly in the estimate. Thus: $$ \boxed{ \text{the residue is fully uniform}. } $$ --- # 4. Middle-High Row Coverage The Maynard-III paper explicitly states: when the modulus factor: $$ S\approx X^{1/10}, $$ and: $$ \delta $$ small， Proposition 5.1 covers arbitrary convolutions with one factor： $$ \boxed{ N \in \left[ X^{2/5+\varepsilon}, X^{1/2-\varepsilon} \right]. } $$ Thus, for an SRBRD row exponent: $$ t, $$ taking: $$ N=R=X^t, $$ we obtain: ## Theorem-Match SRBRD-20-M02 $$ \boxed{ \frac25+\varepsilon \le t \le \frac12-\varepsilon } $$ as the range of prime × prime convolution, its: - convolution; - prime coefficients; - growing residue uniformity; all match the Maynard-III Type-II architecture directly. The remaining gate is: $$ \boxed{ \text{sieve modulus factorization / quantitative level}. } $$ --- # 5. Near-$2/5$ Bridge Maynard-III Proposition 5.2 specifically handles: $$ N\approx X^{2/5} $$ as a technical gap. The paper's example parameters can cover the vicinity of: $$ \boxed{ N \in \left[ X^{2/5-1/2000}, X^{2/5+1/100} \right] } $$ as displayed above. Thus: ## Theorem-Match SRBRD-20-M03 $$ \boxed{ t\approx2/5 } $$ is not a uniform-residue gap. Maynard-III already has a direct bridge. --- # 6. Balanced Row Maynard-III itself explicitly states: Propositions 5.1 and 5.2 cannot handle: $$ \boxed{ N,M\approx X^{1/2} } $$ as balanced convolution. It therefore introduces Proposition 5.3. --- # 7. Maynard-III Proposition 5.3 Residue Structure The residue uniformity of Proposition 5.3 is not a fully independent supremum. It takes the form: $$ \boxed{ \sup_{(b,q_1)=1} \sup_{\substack{ (a,q_1q_2)=1\\ a\equiv b\pmod{q_1} }} |\Delta(a,b;q_1,q_2)|. } $$ Thus: > $a$ must be compatible with some $b$ modulo $q_1$. The paper therefore describes the balanced case as not completely uniform. --- # 8. Goldbach Shift Automatically Satisfies the Restriction SRBRD needs only one global integer: $$ \boxed{ A=2m. } $$ For each: $$ q_1, $$ Define: $$ \boxed{ b_A = A\bmod q_1. } $$ For: $$ q_1q_2, $$ Define: $$ \boxed{ a_A = A\bmod q_1q_2. } $$ Clearly: $$ \boxed{ a_A \equiv b_A \pmod{q_1}. } $$ --- # 9. Global-Integer Residue Embedding ## Theorem SRBRD-20-T01 If an estimate controls: $$ \sup_b \sup_{a\equiv b\pmod{q_1}} |\Delta(a,b;q_1,q_2)|, $$ it automatically controls any single global-integer residue: $$ \boxed{ A\bmod(q_1q_2) } $$ while simultaneously taking: $$ \boxed{ b=A\bmod q_1. } $$ The proof is only reduction compatibility. Thus: $$ \boxed{ \text{The residue restriction of Maynard-III Proposition 5.3 does not exclude the Goldbach shift }A=2m. } $$ --- # 10. Balanced-Row Residue Verdict Thus, in the balanced band: $$ t\approx1/2 $$ the actual problem is not: $$ \boxed{ a=2m \text{ grows as }X\text{ increases}. } $$ For the Goldbach shift, Maynard-III's restricted uniformity already accommodates this residue family. The remaining issues are still: - modulus-factor geometry; - exact variable ranges; - sieve weights; - quantitative constant quality. --- # 11. Updated Row-Band Map One can divide: $$ t\in[1/3,1/2] $$ into four regions. | Band | $t$ range | Best audited template | Residue status | |---|---|---|---| | A | $1/3$ to below $2/5$ | Maynard-II Prop. 5.1 | fixed-$a$ only | | B | near $2/5$ | Maynard-III Prop. 5.2 | uniform | | C | $2/5+\varepsilon$ to $1/2-\varepsilon$ | Maynard-III Prop. 5.1 | fully uniform | | D | balanced near $1/2$ | Maynard-III Prop. 5.3 | restricted uniform, **Goldbach-compatible** | Thus: $$ \boxed{ \text{The genuinely evident residue-uniformity hole is now concentrated in Band A.} } $$ --- # 12. Maynard-II Proposition 5.1 Fits the Low Variable Range Maynard-II Proposition 5.1: $$ NM\asymp X, $$ and: $$ \boxed{ X^\varepsilon \le N \le X^{2/5}. } $$ Modulus weight: $$ \lambda_q $$ is triply well-factorable, with level: $$ \boxed{ Q \le X^{3/5-10\varepsilon}. } $$ Thus, for: $$ \boxed{ N=R=X^t, \qquad 1/3\le t\le2/5, } $$ the variable range matches exactly and completely. --- # 13. Maynard-II Coefficient Class Proposition 5.1 requires: - $\alpha_n,\beta_m$ divisor-bounded; - $\alpha_n$ satisfies Siegel–Walfisz; - $\alpha_n$ is supported on: $$ P^-(n)\ge z_0. $$ The prime indicator, in: $$ N\ge X^{1/3} $$ as its range, automatically has: $$ P^-(n)=n\gg z_0. $$ Maynard-III explicitly states that the prime indicator satisfies the same Siegel–Walfisz condition. Therefore: ## Theorem-Match SRBRD-20-M04 The Maynard-II low-row Type-II coefficient architecture is compatible with: $$ \boxed{ \alpha=\mathbf1_{\mathbb P}, \qquad \beta=\mathbf1_{\mathbb P} } $$ as displayed above. The actual gap is not coefficient type, but: $$ \boxed{ a\text{ fixed}. } $$ --- # 14. Fixed-Residue Declaration Is Explicit Maynard-II §4 notation explicitly declares: > The residue class $a$ is regarded as a fixed positive integer; > all implied constants may depend on $a$. Thus, the theorem takes the form: $$ \ll_{a,A,\varepsilon} \frac X{(\log X)^A}. $$ SRBRD requires: $$ \boxed{ a=2m=X+3 } $$ In: $$ X\to\infty $$ to grow simultaneously as the scale tends to infinity. Thus, it cannot be applied directly as a black box. --- # 15. Fixed $a$ Enters the Proof Core In the Maynard-II reduction to exponential sums, $a$ occurs in more than just the congruence indicator. After Poisson / dispersion reduction, phases of the following form occur: $$ \boxed{ e \left( \frac{ a h n_1 }{ q d r_1 } \right) } $$ and inverse / Kloosterman-type phases at later stages. Therefore: $$ \boxed{ \text{uniformizing }a \text{ is not merely removing the theorem's initial }\ll_a\text{ dependence.} } $$ The spectral / exponential-sum stages must be audited. --- # 16. Three Classes of $a$-Dependence It is suggested that all: $$ a $$ dependencies in the Maynard-II proof be divided into three classes. ## Class I — Coprimality Only For example: $$ (q,a)=1. $$ SRBRD can restrict directly to: $$ (q,2m)=1. $$ Since: $$ p\mid m $$ has local bad density, in the switched opposite sieve, equal to: $$ 0. $$ Thus, this kind of dependence is: $$ \boxed{ \text{harmless / compatible}. } $$ --- # 17. Class II — Modular Numerator For example: $$ e \left( \frac{ a h \bar n }{q} \right). $$ If the underlying Kloosterman / complete-sum bound depends only on: - the modulus; - the gcd of numerator and modulus; then: $$ (a,q)=1 $$ may already suffice for uniformity. This kind of dependence is: $$ \boxed{ \text{potentially removable}. } $$ But this must be checked lemma by lemma. --- # 18. Class III — Genuine Archimedean / Constant Dependence If some step produces: $$ |a|^\theta, $$ or: $$ C(a) $$ that cannot be controlled as: $$ X^{o(1)}, $$ then: $$ a=X+3 $$ will genuinely destroy the uniform theorem. This is the: $$ \boxed{ \text{fatal fixed-residue dependence}. } $$ This round has not yet found theorem-level evidence that Class III must occur, but the published proof allows it to exist, so its absence cannot be assumed. --- # 19. Important Audit Observation In the Maynard-II statements / reductions checked so far: - $a$ is explicitly fixed; - coprimality conditions occur extensively; - exponential-phase numerators occur extensively; - theorem constants may depend on $a$. But no explicit: $$ \boxed{ |a|^c } $$ loss has yet been seen in the main bound. Thus, the currently correct verdict is not: $$ \boxed{ \text{uniformization impossible}. } $$ but: $$ \boxed{ \text{uniformization unresolved and now line-by-line auditable}. } $$ --- # 20. Maynard-III Shows Uniformity Is Technically Achievable The main feature of Maynard-III is precisely: $$ \boxed{ \text{complete / near-complete residue uniformity beyond }X^{1/2}. } $$ Its technical propositions even directly estimate bilinear convolutions using: $$ \sup_a $$ as displayed above. Thus: > Fixed-residue dependence is not an unavoidable law of the entire Maynard dispersion architecture. The actual question is: $$ \boxed{ \text{In which variable ranges can Maynard-II's stronger well-factorable level and Maynard-III's uniform-residue technology be retained simultaneously?} } $$ --- # 21. Minimal Missing Lemma Since SRBRD needs only: $$ \boxed{ a_X=X+3, } $$ and not the full: $$ \sup_a. $$ the minimal target should not initially be written as: > An arbitrary uniform-residue theorem. Instead, write: # GSHIFT-TII --- # 22. Goldbach-Shift Uniform Type-II Lemma — Target Form The hoped-for statement is: For: $$ \boxed{ a_X=X+3, } $$ $$ \boxed{ X^{1/3+\eta} \le N \le X^{2/5-\eta}, } $$ $$ NM\asymp X, $$ and compatible well-factorable / upper-sieve modulus weights: $$ \lambda_q, $$ we have: $$ \boxed{ \sum_{\substack{ q\le Q\\ (q,a_X)=1 }} \lambda_q \sum_{n\sim N} \mathbf1_{\mathbb P}(n) \sum_{v\sim M} \mathbf1_{\mathbb P}(v) \left[ \mathbf1_{nv\equiv a_X\pmod q} - \frac{ \mathbf1_{(nv,q)=1} }{ \varphi(q) } \right] \ll_{A,\eta} \frac X{(\log X)^A}. } $$ The implied constant must be: $$ \boxed{ \text{independent of }X } $$ through： $$ a_X=X+3. $$ --- # 23. Why GSHIFT-TII Is Strictly Weaker Than Full Uniformity A full uniform theorem requires: $$ \sup_{(a,q)=1} |\Delta(a;q)|. $$ GSHIFT-TII requires only one deterministic path: $$ \boxed{ a_X=X+3. } $$ Thus: $$ \boxed{ \text{GSHIFT-TII} < \text{full uniform residue Type-II}. } $$ This may substantially reduce the technical burden. --- # 24. Congruence Size Is Not Intrinsic congruence： $$ nv\equiv a_X\pmod q $$ depends only on: $$ a_X\bmod q. $$ Thus: $$ |a_X|\asymp X $$ need not intrinsically cause a loss. Only if the proof method produces, for the integer representative: $$ a_X $$ nonmodular dependence, does a uniformity problem arise. This is the core of the next round's audit. --- # 25. Goldbach Coprimality Reduction SRBRD switched local density: $$ g_m(p) = \begin{cases} 0,&p\mid m,\\ 1/(p-1),&p\nmid m. \end{cases} $$ Thus, the sieve modulus can directly be restricted to: $$ \boxed{ (q,2m)=1. } $$ That is: $$ \boxed{ (q,a_X)=1. } $$ GSHIFT-TII therefore need not handle noncoprime residues. --- # 26. Balanced Proposition 5.3 as a Goldbach-Specific Uniformity Lesson Maynard-III Prop 5.3 is not an arbitrary independent-residue theorem, but the Goldbach shift can still be embedded. This shows: $$ \boxed{ \text{We should not seek uniformity stronger than what the Goldbach structure actually needs.} } $$ GSHIFT-TII should follow the same philosophy. --- # 27. Modulus-Factorization Gate Even once the Type-II residue / coefficient match is complete, another independent issue remains: $$ \boxed{ \text{Can SRBRD upper-sieve weights factor into the modulus windows required by Maynard-III?} } $$ Maynard-II handles this issue for linear-sieve weights with a very delicate factorization proposition. The Maynard-III main theorems instead concern: > Moduli with suitably sized divisors. Thus, these must be separated: ### Residue Match Most of this has PASS in this round. ### Sieve-Weight / Modulus Match Still: $$ \boxed{ \text{PENDING}. } $$ --- # 28. Constant-Strength Gate The SRBRD-18 warning must also be retained: Even if a theorem's: - convolution; - uniform residue; - prime coefficients; all match, if it gives only: $$ Q=X^{1/2+\delta} $$ and the resulting linear-sieve constant is still too large, it still cannot enter the final positive ledger. Therefore: $$ \boxed{ \text{theorem legality} \neq \text{constant sufficiency}. } $$ SRBRD-20 addresses only theorem-shape localization, and does not claim crossing. --- # 29. Revised External-Theorem Map ### Band A $$ \frac13\le t<\frac25-\eta. $$ - Maynard-II range: excellent. - well-factorable level: strong. - coefficients: compatible. - residue: fixed-$a$ gap. Verdict: $$ \boxed{ \text{GSHIFT uniformization target}. } $$ --- # 30. Band B $$ t\approx\frac25. $$ Maynard-III Prop 5.2: - convolution: PASS; - residue uniformity: PASS; - prime coefficients: PASS; - modulus factorization: PENDING. Verdict: $$ \boxed{ \text{analytic shape largely available}. } $$ --- # 31. Band C $$ \frac25+\eta \le t \le \frac12-\eta. $$ Maynard-III Prop 5.1: - arbitrary convolution; - full residue supremum; - prime-coefficient compatibility. Verdict: $$ \boxed{ \text{residue + coefficient gap closed}. } $$ --- # 32. Band D $$ t\approx\frac12. $$ Maynard-III Prop 5.3: - balanced convolution; - restricted residue uniformity; - the global Goldbach residue satisfies the restriction exactly. Verdict: $$ \boxed{ \text{Goldbach-residue match PASS}, } $$ But: $$ \boxed{ \text{modulus / constant integration pending}. } $$ --- # 33. Correction to SRBRD-19 SRBRD-19 stated: > The missing theorem may require, across the full band, > Yang-type convolution + Maynard-III uniformity. SRBRD-20 corrects this to: $$ \boxed{ \text{full-band uniformity gap was too pessimistic}. } $$ The Maynard-III technical propositions already supply uniform bilinear convolution across a substantial middle/high band, and the balanced restriction also accommodates a single global Goldbach residue. What is clearly still uncovered is: $$ \boxed{ \text{low row }t\approx1/3\to2/5 } $$ as the range requiring uniformization of stronger fixed-residue technology. --- # 34. Repositioning the Role of Yang 2026 Yang 2026 remains important, but its role changes from: > The only possible full-row convolution provider to: > **A quantitative enhancement provider for higher levels / better constants.** Qualitatively: - convolution; - prime coefficients; - residue uniformity; already have direct templates in the Maynard-III middle/high band. Yang/Pascadi may still supply: - a stronger modulus range; - a better constant; - high-level well-factorable weights; to address the SRBRD-18 constant ledger. --- # 35. Low-Row Proof Dependency Graph Maynard-II low-row route: $$ \boxed{ \text{Prop 5.1} } $$ is supported by: $$ \boxed{ \text{Prop 8.2 convolution estimate} } $$ as displayed above, with the proof reduction proceeding through: 1. separation; 2. Poisson; 3. Cauchy–Schwarz; 4. exponential sums; 5. Kloosterman / spectral estimates. Along this chain, $a$: - occurs in gcd restrictions; - occurs in exponential-phase numerators; - theorem constants may depend on $a$. Thus, SRBRD-21 can conduct a genuine dependency-by-dependency audit. --- # 36. Uniformization Classification Table | Dependency form | Goldbach shift risk | Intended treatment | |---|---|---| | $(q,a)=1$ | low | restrict $(q,2m)=1$ | | $a\bmod q$ | low | modular reduction | | gcd factors involving $a$ | low/medium | coprimality or divisor bounds | | $\tau(a)^{O(1)}$ | medium but absorbable | $X^{o(1)}$ | | $e(a\bar n/q)$ numerator | unknown | audit Kloosterman uniformity | | $|a|^\theta$ | fatal at present | new estimate needed | | exceptional modulus depending on $a$ | unknown | isolate / average / exclude | --- # 37. Acceptable Uniform Loss GSHIFT-TII need not necessarily have complete: $$ O(1) $$ independence in: $$ a_X. $$ If the proof causes only: $$ \boxed{ \tau(a_X)^C } $$ or: $$ (\log a_X)^C, $$ this can be absorbed by: $$ \boxed{ X^\varepsilon } $$ or by the logarithmic budget. Thus, what is genuinely fatal is: $$ \boxed{ a_X^\theta } $$ type loss. --- # 38. Minimal Uniformization Objective The next round's actual proof objective should be: $$ \boxed{ C(a_X) \le X^{o(1)} } $$ for： $$ a_X=X+3. $$ If this holds, the Maynard-II fixed-$a$ estimate may have a chance to be upgraded to: # Goldbach-Shift Uniform Type-II without obtaining: $$ \sup_a. $$ --- # 39. Prime-First-Factor Gate Is Smaller Than Previously Thought Maynard-III explicitly states that: $$ \mathbf1_{\mathbb P} $$ satisfies SW. Maynard-II uses the same type of SW condition, and a prime in a low row automatically satisfies: $$ P^-(n)\ge z_0. $$ Thus: $$ \boxed{ \text{prime first-factor support is no longer a main conceptual gap}. } $$ What actually remains: - low-row $a_X$ uniformity; - weight factorization; - constants. --- # 40. High-Row Balanced Cap May Be Thin Anyway Even if Prop 5.3 integration is not ideal, Maynard-III Prop 5.1 can push the upper endpoint to: $$ X^{1/2-\varepsilon} $$ for an arbitrarily small fixed: $$ \varepsilon. $$ Thus, the genuinely balanced cap can be narrowed to: $$ \boxed{ t\in [1/2-\varepsilon,1/2]. } $$ Its continuum width: $$ \varepsilon. $$ One can therefore also consider: - a trivial upper bound; - Brun–Titchmarsh; - transport-heavy treatment; without requiring a full balanced theorem. This supplies a backup route. --- # 41. Low-Row Cannot Be Made Thin in the Same Way The low gap: $$ [1/3,2/5] $$ has fixed width: $$ \boxed{ \frac25-\frac13 = \frac1{15}. } $$ Thus, it cannot, like the balanced cap, be removed merely by: $$ \varepsilon $$ as a shrinking parameter. It is a band that genuinely needs an analytic theorem. --- # 42. New Minimal Architecture The SRBRD analytic providers can be replanned: ## Low $$ t\in[1/3,2/5]. $$ Target: $$ \boxed{ \text{GSHIFT-TII uniformized Maynard-II} } $$ or an equivalent new lemma. ## Middle $$ t\approx2/5. $$ Maynard-III Prop 5.2. ## High $$ t\in[2/5+\eta,1/2-\eta]. $$ Maynard-III Prop 5.1. ## Balanced Cap Prop 5.3 or explicit small-cap treatment. --- # 43. Theorem Strength vs Ledger Strength This split states only: $$ \boxed{ \text{distribution error can be controlled}. } $$ The final ledger must still ask: > How large an upper-sieve multiplier does the corresponding level / sieve weight produce? Therefore: $$ \boxed{ \text{Band Coverage Pass} } $$ and: $$ \boxed{ \text{Constant Crossing Pass} } $$ must be separated into two gates. --- # 44. Formal Target — GSHIFT-TII v0.1 ```yaml GSHIFT_TII: global_scale: X: large: true residue: a_X: X + 3 factor_range: N: X^(1/3+eta) to: X^(2/5-eta) M: asymptotic: X/N coefficients: alpha_n: prime_indicator: true beta_m: prime_indicator: true modulus: coprime_to_a_X: true weight: target: triply_well_factorable_or_linear_upper_variant: true estimate: uniform_in_X_through_a_X: true error: X/log(X)^A ``` --- # 45. Goldbach-Shift Residue Lemma GSHIFT-TII can first be decomposed further into: ## GSHIFT-Phase Lemma All occurrences of the following in the Maynard-II reductions: $$ a $$ Take: $$ a=X+3 $$ after this substitution, the relevant complete / incomplete exponential-sum bounds retain: $$ \boxed{ X^{o(1)} } $$ as their uniformity. If this step holds, most of the remaining combinatorial factorization need not be changed. --- # 46. Possible Easy Outcome If a proof-by-proof audit finds: > All $a$ dependence actually enters only through: > - gcd; > - reduced residues; > - the divisor function; > - root-of-unity phases; then GSHIFT uniformity may only be a case of: $$ \boxed{ \text{constants not tracked in the published theorem, rather than a genuinely new obstruction}. } $$ This is the possibility most worth checking first in the next round. --- # 47. Possible Hard Outcome If the Deshouillers–Iwaniec / Kuznetsov stage, as: $$ a $$ grows, produces: $$ |a|^\theta $$ or conductor-scale loss, then: $$ \boxed{ \text{GSHIFT-TII is a genuinely new analytic theorem}. } $$ Then consider: - Maynard-III algebraic-uniform methods; - Yang/Pascadi convolution; - a dispersion reformulation. --- # 48. Research Integrity Firewall Until SRBRD-21 is completed, one must not write: $$ \boxed{ \text{Maynard-II can be used with }a=2m. } $$ The only correct wording is: $$ \boxed{ \text{variable ranges / coefficients match; uniformity remains unverified}. } $$ --- # 49. External Source Audit Summary ### Maynard-II The paper explicitly states: $$ \boxed{ a\text{ fixed}, } $$ Constants may depend on: $$ a. $$ Prop 5.1 exactly covers: $$ N\le X^{2/5}. $$ ### Maynard-III The paper's main feature: $$ \boxed{ \text{uniform residue classes}. } $$ Definition 1 explicitly states that the prime indicator satisfies SW. Props 5.1–5.2: $$ \boxed{ \text{uniform arbitrary convolutions around }2/5\text{ to }1/2. } $$ Prop 5.3： balanced convolution with residue compatibility, into which the Goldbach shift can be embedded. --- # 50. Current Exact Gap Thus, as of: $$ \boxed{ 2026\mbox{-}09\mbox{-}30 } $$ the SRBRD row analytic gap can be rewritten as: $$ \boxed{ \text{LOW ROW} : \text{fixed-residue stronger Type-II} \to \text{Goldbach-shift uniform Type-II} } $$ together with: $$ \boxed{ \text{ALL BANDS} : \text{sieve-weight factorization + constant sufficiency}. } $$ This is more precise than the full-band missing theorem of SRBRD-19. --- # 51. Formal Theorem Queue ```yaml SRBRD_20: T01: global_integer_residue_embeds_in_MaynardIII_balanced_restriction Match01: prime_indicator_is_MaynardIII_SW_compatible Match02: middle_high_row_uniform_convolution_available Match03: near_two_fifths_uniform_bridge_available Match04: MaynardII_low_row_variable_and_coefficient_match Gap01: MaynardII_growing_Goldbach_shift_uniformity_unverified Gap02: sieve_weight_modulus_factorization_unclosed Gap03: constant_ledger_still_unclosed ``` --- # 52. Acceptance Gate Before SRBRD-20 is formalized, the following are needed: 1. the Maynard-III SW prime-indicator citation; 2. checking the Prop 5.1 range; 3. checking the Prop 5.2 near-$2/5$ range; 4. checking the Prop 5.3 restricted residues; 5. the global-integer embedding proof; 6. checking the Maynard-II Prop 5.1 low range; 7. checking the fixed-$a$ declaration; 8. checking the exponential-phase occurrence; 9. marking uniformization as unresolved; 10. an independent modulus-factorization gate; 11. theorem coverage not equated with constant crossing; 12. no Goldbach proof claim. --- # 53. Verdict This round can give: $$ \boxed{ \mathrm{SRBRD\mbox{-}20\ LOW\mbox{-}ROW\ GAP\ LOCALIZATION\ PASS}. } $$ The largest correction: $$ \boxed{ \text{Maynard-III already directly covers a substantial middle/high convolution range, and the Goldbach residue can be embedded in the balanced restricted-uniform proposition.} } $$ Thus: $$ \boxed{ \text{uniform convolution is not an unknown problem throughout the full row band.} } $$ The genuinely cleanest analytic target has narrowed to: $$ \boxed{ \text{Goldbach-Shift Uniformization of Maynard-II Low-Row Type-II}. } $$ However: $$ \boxed{ \mathrm{GSHIFT\mbox{-}TII\ NOT\ YET\ PROVED}. } $$ $$ \boxed{ \mathrm{CONSTANT\ CROSSING\ NOT\ YET\ PROVED}. } $$ and: $$ \boxed{ \mathrm{GOLDBACH\ STILL\ OPEN}. } $$ --- # 54. Suggestion for the Next Round # SRBRD-21 ## Fixed-$a$ Spectral Dependency / Goldbach-Shift Uniformization Audit The next round does only one thing: Trace step by step, in Maynard-II: $$ \text{Prop 5.1} \leftarrow \text{Prop 8.2} \leftarrow \text{exponential-sum reductions} $$ every: $$ a $$ dependency. Classify each occurrence: ```yaml a_dependency: gcd_only: harmless residue_only: harmless divisor_function: absorbable_if_X_o_1 Kloosterman_numerator: inspect_uniformity spectral_conductor: inspect_uniformity polynomial_absolute_size: fatal_without_new_bound ``` The final target: $$ \boxed{ C(a_X) \le X^{o(1)} \qquad a_X=X+3. } $$ If this holds: $$ \boxed{ \text{GSHIFT-TII upgrade candidate}. } $$ If it does not, precisely locate the lemma that must be replaced by Maynard-III / Yang / Pascadi technology, rather than redesigning the entire SRBRD again. --- # Appendix A: Updated Row-Band Ledger ```yaml row_band: low: t: 1/3_to_2/5 template: Maynard_II_Prop5_1 variable_match: PASS prime_coefficients: PASS_LIKE residue: FIXED_A_GAP status: MAIN_ANALYTIC_TARGET near_two_fifths: template: Maynard_III_Prop5_2 residue: UNIFORM prime_coefficients: PASS status: SHAPE_PASS middle_high: t: 2/5_plus_to_1/2_minus template: Maynard_III_Prop5_1 residue: UNIFORM prime_coefficients: PASS status: SHAPE_PASS balanced: t: near_1/2 template: Maynard_III_Prop5_3 residue: RESTRICTED_UNIFORM Goldbach_global_integer: compatible: true status: RESIDUE_PASS_WEIGHT_GATE_PENDING ``` --- # Appendix B: Maynard-II Fixed-$a$ Dependency ```yaml paper: Primes_in_AP_large_moduli_II notation: a: fixed_positive_integer: true implied_constants: may_depend_on_a: true low_TypeII: N_range: X^epsilon_to_X^(2/5) reduction: exponential_phase_contains_a: true SRBRD: a_X: X+3 grows_with_X: true conclusion: direct_black_box_use: false ``` --- # Appendix C: Maynard-III Uniformity Facts ```yaml SiegelWalfisz_examples: prime_indicator: satisfies: true Prop5_1: convolution: arbitrary_divisor_bounded: true residue: supremum_uniform: true useful_N_range: approx_2/5_plus_to_1/2_minus Prop5_2: near_2/5: true residue: supremum_uniform: true Prop5_3: balanced: true residue: a_congruent_b_mod_q1 Goldbach_shift: choose: b: A_mod_q1 a: A_mod_q1q2 compatibility: automatic: true ``` --- # Appendix D: GSHIFT-TII Target ```yaml name: GoldbachShift_Uniform_TypeII residue: a_X: X+3 range: low_factor: X^(1/3+eta) to: X^(2/5-eta) coefficients: prime_times_prime: true uniformity: implied_constant_independent_of_X_through_a_X: true acceptable_losses: polylog_a: true divisor_a_power: true_if_absorbable_X_o_1 absolute_a_positive_power: false status: open_target ``` --- # Appendix E: Correction to SRBRD-19 ```yaml old_view: full_row_missing: Yang_convolution_plus_MaynardIII_uniformity new_view: middle_high_uniform_convolution: already_present_in_MaynardIII: true balanced_global_Goldbach_residue: embeds_in_restricted_uniformity: true clearest_uniformity_gap: low_row_MaynardII_fixed_a: true Yang_role: higher_level_and_constant_enhancement: true sole_full_row_shape_provider: false ``` --- # Appendix F: Commit Decision ```yaml research_round: SRBRD-20 decision: middle_high_uniformity_gap_reduced: true balanced_Goldbach_residue_embedding: true prime_coefficient_compatibility: true low_row_GSHIFT_target_identified: true low_row_uniformization_proved: false modulus_factorization_closed: false constant_crossing: false goldbach_proved: false next: SRBRD-21_FixedA_SpectralDependency_GoldbachShift_Uniformization_Audit ``` --- # References / Audited Sources 1. James Maynard, **Primes in arithmetic progressions to large moduli II: Well-factorable estimates**, *Memoirs of the American Mathematical Society* 306 (2025), no. 1543; arXiv:2006.07088. Key audited facts: - §4 fixes $a$ and allows implied constants to depend on $a$. - Proposition 5.1 covers $X^\varepsilon\le N\le X^{2/5}$. - Proposition 5.1 uses a bilinear convolution with well-factorable modulus weights. - the exponential-sum reduction retains $a$ in Fourier/Kloosterman-type phases. 2. James Maynard, **Primes in arithmetic progressions to large moduli III: Uniform residue classes**, *Memoirs of the American Mathematical Society* 306 (2025), no. 1544; arXiv:2006.08250. Key audited facts: - Definition 1 explicitly states the prime indicator satisfies the Siegel–Walfisz condition. - Proposition 5.1 gives uniform-residue Type-II convolution estimates over a broad middle/high factor range. - Proposition 5.2 extends the range near $X^{2/5}$. - Proposition 5.3 treats balanced convolutions under a residue-compatibility condition. - the paper explicitly notes that completely uniform balanced convolution is harder. 3. Zhiyuan Yang, **Convolution-type Bombieri-Vinogradov theorem with well-factorable Weights, and its applications**, arXiv:2608.13299v2 (2026-09-03). Current role after SRBRD-20: - stronger convolution / modulus-level technology; - potential constant improvement; - no longer treated as the only possible qualitative high-row convolution template. 4. Alexandru Pascadi, **On the exponents of distribution of primes and smooth numbers**, arXiv:2505.00653 (2025). Used as a higher-level structured-weight technology source for future constant optimization, not as a direct SRBRD provider in this round.