Submitted:
28 October 2026
Posted:
30 October 2026
You are already at the latest version
Abstract
We study uniformity in Goldbach representations and the signed correlations arising in a reflected-prime comparison. From classical analytic inputs we derive a common exceptional set for all compatible residue prescriptions modulo sufficiently small fixed powers of the location parameter. We also prove weighted Type I distribution, convex factor regularity, a mixed prime–rough estimate approaching the square-root scale, a balanced rough-pair asymptotic and an uncentered two-prime upper bound. For a sharp bilinear boundary component, we compute the exact unit mean and coefficient moments, remove a repeated-prime contribution with its variance cross terms, and obtain a restricted Möbius product identity. A lower bound for the rowwise absolute character majorant shows why that particular relaxation cannot deliver arbitrary logarithmic savings. Multiplicative prime-factor markers and a rational-target CRT kernel clarify the remaining distribution requirements. Additional results treat almost-all prime-product representations, a conditional implication for real zeros, and finite paired-congruence criteria. All exceptional sets and unproved hypotheses are retained. The results do not establish the required full signed correlation estimate or resolve the binary Goldbach conjecture.
Keywords:
binary Goldbach problem
; short intervals
; arithmetic progressions
; exceptional sets
; sieve methods
; prime correlations
MSC: 11P32; 11N13; 11N36; secondary 11L05; 11N37
1. Introduction and Statements
The circle method separates the binary Goldbach problem into a local arithmetic main term and an analytic remainder. In an almost-all theorem, a mean-square estimate can absorb the minor arcs. Prescribing the residue classes of both primes introduces a second uniformity question: whether a single exceptional set can accommodate all the prescriptions under consideration. If the allowed moduli grow with the location of the primes, the cost of taking this common set must be included in the error budget.
Montgomery and Vaughan [8] developed an effective treatment of Goldbach exceptional sets which retains a possible exceptional real character. Kawada [6] studied prime tuples in arithmetic progressions and, in particular, already treated the geometry in which both primes lie in the same short interval. Halupczok [5] obtained related distribution results with short prime intervals and arithmetic progressions. Thus the same-interval geometry itself is classical. We give the precise comparison with Kawada’s norm in Section 6; that norm implies a common relative asymptotic for polylogarithmic moduli, whereas it does not by itself imply the power-saving simultaneous conclusion formulated below.
The first part of this paper gives an explicit derivation of the latter conclusion. The subsequent parts examine what is still required to pass from averaged representations and rough comparisons to a signed estimate at the balanced scale. The argument keeps the exceptional character fixed while refining the requested modulus, proves a finite arithmetic norm for the prescribed residue fibres, and distinguishes the location from the short interval length . It gives a lower bound, rather than a relative asymptotic, uniformly in the possible exceptional-character signs. The underlying analytic inputs are classical. We make no assertion of an optimal exponent or of an exhaustive priority comparison with the literature on exceptional sets.
Organization and Status of the Additional Results
The principal short-interval theorem is proved in Section 2, Section 3, Section 4 and Section 5; its classical comparison and prime-power normalization appear in Section 6 and Section 7. The appendices make the other obtained results part of the same mathematical framework. Theorems B.1, B.2 and B.4 concern the actual rough comparison, while Theorem C.2 is a quantitative subendpoint consequence of maximal Bombieri–Vinogradov. Theorems D.2 and D.4 provide, respectively, a rough benchmark and a two-prime upper bound at the balanced scale. Propositions D.5 and E.3 are sufficient conditions with unproved arithmetic hypotheses, rather than assertions that these hypotheses hold. Theorem F.2 and Corollary F.3 retain an exceptional set. Theorem G.2 assumes an external positive-density band for the actual Goldbach convolution. Appendix H proves finite congruence criteria. Appendix I, Appendix J, Appendix K and Appendix L study an explicitly defined sharp boundary component: its coefficient moments and exact mean, a repeated-prime error, the resulting Möbius product weight, a failed absolute-value method, and a restricted rational-target kernel estimate. These different logical statuses are essential to the interpretation of the results. Proofs below are complete deductions from the explicitly stated classical analytic inputs; they do not reprove the general analytic machinery of the cited sources. No exhaustive novelty or priority certification is claimed for these deductions.
Put . We use , , , and for Euler’s totient, the Möbius function, the von Mangoldt function, the divisor function and the number of distinct prime divisors, respectively. Parameters in subscripts on and are fixed before the asymptotic limit. Unless stated otherwise, implied constants are independent of the residue classes. Pairs of primes in this paper are ordered, and equal primes are permitted. For define
For reduced classes , let
Theorem 1.1. Fix . There exist positive constants and such that, for every real and , there is a set with the following properties:
For every such , every ordered pair of units , and every with , one has
One may take
where is sufficiently small in terms of and the absolute constants in the classical input estimates.
The set in the theorem is common to all the requested moduli and residue pairs at a fixed anchor . It is not one set for all real anchors. The representing pair can change with the prescription. Since , the lower bound tends to infinity uniformly over the allowed moduli. Also . Neither these observations nor (1.2) removes the exceptional set.
The finite kernel estimate in Section 3 is the arithmetic step used to preserve both small factors when the exceptional character suppresses both residue classes. Section 2, Section 3, Section 4 and Section 5 give the proof of Theorem 1.1. Section 6 records the classical comparison, and Section 7 gives a normalization result for proper prime powers. Section 8 identifies the separate prime-correlation estimate which remains open in a reflected-prime comparison approach. Appendix A proves a classical mixed prime–rough average for every fixed row exponent below , while keeping the balanced endpoint unresolved.
2. Classical Analytic Inputs and Interval Localization
We use the following form of Montgomery–Vaughan [8, Lemmas 4.1–4.3]. There are absolute positive constants with the stated properties. Let
At level select the possible exceptional primitive real nonprincipal character , of conductor , and its real zero , according to the source convention. If it is selected,
For each primitive character of conductor at most define the finitely supported coefficients, for , by
The last term is absent if no exceptional character is selected; denotes the primitive principal character of conductor one. Set
The supremum is inside the primitive-character sum. The source estimate gives
In particular the exceptional-zero factor multiplies the whole aggregate. Half-open intervals follow from the source’s endpoint convention by limits, without adding a logarithmic endpoint error. We cite this analytic theorem, including its zero-density input; its proof is not part of the present argument.
We also use Gallagher’s finite-frequency inequality [3] in the form of [8, Lemma 4.2]. If and has finite support, then
The version for complex coefficients follows by applying the real version to their real and imaginary parts.
Lemma 2.1. Let , , and , where and . Put . Then
Proof. Take in (2.4), after truncating the coefficients to . Each sliding interval intersects that box in an interval of length at most , and hence has corrected sum at most . The set of sliding positions has length at most . Thus the integral is , since . The zero-frequency assertion follows directly from the interval norm. All endpoints here remain bounded by , the location-scale parameter.
Our final analytic input is Vaughan’s estimate [9, Theorem 17.1]: if and , then
We apply it to two prefixes of size comparable to . Their difference does not replace the factor by .
3. A Character-Kernel Norm on Prescribed Residue Fibres
Let be even, units modulo , and with . Write for the Ramanujan sum. Define
All primes in these products are odd, and .
For a primitive character whose conductor divides , put
Set this coefficient to zero if the conductor does not divide . For two primitive characters define
The second coefficient is not conjugated: this kernel belongs to an additive convolution.
Proposition 3.1. Uniformly in the above data and in both primitive characters,
Proof. Writing and first summing over gives
The quotient is integral and is defined modulo . The Chinese remainder theorem factors the original finite sum into local kernels; the additive CRT multipliers are units and can be absorbed into the local summation variables.
Put , , and let be the local conductor exponents. Suppose first that . For a nonzero factor requires ; the residue fibres are singletons and its modulus is . For , let . A fibre Fourier coefficient vanishes if its character has conductor exponent less than : summation over the last lifts cancels its nontrivial additive phase. Thus a nonzero product requires . Expanding in the local version of (3.2), the second term vanishes by primitive last-lift cancellation. The remaining factor is
Both arguments are units, and there are terms. Its modulus is at most . For fixed only one value of can contribute, including the case . This argument also applies to .
Now suppose , so is odd. If both local characters are principal, the only supported exponents are , with factors and . If at least one local character is nonprincipal, there is at most one supported exponent, . For , both characters must be primitive at that exponent; for , one may be principal. These statements again follow by summing the last additive lifts. The nonzero kernel is
For the discarded Ramanujan term vanishes by the complete sum of the nonprincipal character; for use last-lift cancellation. The number of terms in the displayed sum is if , and otherwise. Its modulus is consequently at most or , respectively.
Thus in every case the local sum of absolute values at a prime not dividing is bounded by . Multiplication and monotone convergence yield
At this Euler factor agrees with that of . At the other primes the ratio is at most . Their product over converges. This proves (3.3).
4. The Major Arcs at the Short Interval Scale
Fix the parameters in (1.4), initially with
Put , , , and . For large , (2.1) holds. Make the exceptional-character selection once at . For a requested even choose
The first branch has , so a selected character with induces no character on its major-arc moduli. In the second branch and ; no new character is selected.
The following inequalities all hold with a fixed power reserve:
For instance . Hence, eventually,
For units put
In the first branch let and . In the second set
Use the analogous definitions for , and put . On ,
This follows from , monotonicity, and . Equation (2.3) gives
Lemma 4.1. Uniformly in these residue classes,
Proof. Character orthogonality at zero has coefficient modulus for each inducing primitive character. The corrected model is , and Lemma 2.1 bounds the aggregate error by . Apply (4.5) and (4.6). Parseval and prove the second bound.
Define disjoint major charts on by
For use . Distinct centres have distance at least , while the sum of their radii is at most ; (4.4) proves disjointness, also across the circle boundary. Let their union be . Write
Since every box prime exceeds , exact character orthogonality gives
In the refined branch , which accounts for the signed weight. The same primitive function occurs on every chart which induces it.
For let be the Fourier coefficient of , and let be its two-model counterpart. Summing the centre phases before taking absolute values gives the kernels (3.2). Each chart window is contained in . Cauchy–Schwarz, Lemma 2.1, and discrete Parseval for bound the linear and quadratic error integrals by and . Applying Proposition 3.1 before summing the primitive characters yields
There is no multiplicity loss from induction in this estimate.
Completion of the Signed Model
The principal coefficient is supported on squarefree coprime to . Summing the aliases in (4.8) gives exactly
In particular, the Ramanujan factor is , not . Factoring an analytic phase from the interval model does not change this arithmetic factor.
Unit-cell quadrature, with the two partial endpoint cells separated, and integration by parts give
Indeed the total variation of is ; the phase has modulus one. It follows for that
The continuous product tail outside is .
Let
For the overlap length is at least . Continuous Fourier inversion gives the coefficient for . For fixed , the Euler product also gives
To see this, nondivisor primes give a convergent product. The extra logarithm at primes dividing is . Splitting at and bounding the number of larger divisors by proves (4.14).
Consequently, with ,
Here (4.13) handles the discrete-to-continuous change, handles the integral tails, and (4.14) handles the omitted moduli. For and either branch the right side is at most
for sufficiently large .
By (4.5), for an absolute . Decrease the fixed in (4.1) so that the constant in (4.10) times is at most ; then increase to absorb (4.15). We obtain
The source allowance is a fixed small constant, whereas the completion error tends to zero as a power of .
5. Minor Arcs and the Common Exceptional Set
Let . For any and any additive-filter shift , Dirichlet approximation with gives a reduced such that
The last inequality follows from , separately from the width bound. If , reducing produces a denominator and places in (4.8). This is impossible. Hence for every shift.
Apply (2.6) to the prefixes at and . Proper powers contribute at most , which is absorbed by . Since and , the additive residue filter yields
The filter is an average of shifted sums; it supplies no additional factor in this supremum estimate.
Use Lemma 4.1 on the coordinate with smaller and (5.1) on the other. With , we obtain
where in the first branch. The worst case is two suppressed classes, for which the mass factor divided by costs . The multiplier is essential. In the refined branch (2.2) gives
Using , the powers of in (5.2) are
All are strictly smaller than for the parameters (1.4), . For the closest one the reserve is . The logarithmic factors are at most , so eventually
Let be the Fourier coefficient of . For a fixed refined pair define the bad set by the threshold
Full Parseval, (5.2) and (5.3) give
Restriction to a target residue class does not yield an extra . Outside this set, (4.16) implies that the actual log-weighted prime-pair count is at least
For a coarse pair in the refined branch, consider each class above . Choose one unit lift for which is a unit above . Such a choice exists by CRT. At a prime already dividing both classes are units; at a new prime, necessarily odd, excluding leaves at least choices. Lift to the relevant prime powers and fix one pair for the entire class . There are such classes. The union of their restricted bad sets has size
There is no union over all refined residue pairs. In the dense branch and the same estimate is immediate.
Take the union over all requested coarse pairs and all even . It is one set , and
Since , this proves (1.1). Any grid intersection is at most the total size, and then proves (1.2).
Finally (2.2) implies in the refined branch, hence . The dense value satisfies this weaker bound too. As , and , (5.5) is at least . Dividing by the upper bound for the weight of one ordered pair proves (1.3). This completes the proof of Theorem 1.1.
6. The Classical Polylogarithmic Comparison
For even let
For admissible , meaning , set
Write in the inadmissible case and otherwise. The local product is the specialization of Kawada’s singular series to the forms . In particular for even admissible targets.
Proposition 6.1. Classical corollary of Kawada. Fix , and . Put , , . There is a common set with
for all even and all . Outside , simultaneously for all compatible reduced pairs modulo these moduli,
Proof. In [6, Theorem 2], set the source location , length , and use the fixed coefficient forms . Its mean-value estimate gives, for every fixed ,
where is the two- convolution in the common box and is the set with positive real overlap. The source gates and hold eventually for our fixed parameters. Restricting the nonnegative error sum to the interior is legitimate.
Declare an admissible triple bad if its error exceeds . For a fixed , Markov’s inequality and a union over at most classes give at most bad targets. Summing (6.3) yields . Take . The grid estimate follows from the total bound and . There is no second independent residue union: is determined.
Since and , the good weighted sums have relative error . At a fixed , proper powers in either coordinate contribute at most : each such coordinate determines the other. This is smaller than for . Finally throughout the box; as , its relative error is smaller than every fixed inverse logarithm. This proves (6.2).
Remark 6.2. The same-box geometry and Proposition 6.1 are classical consequences and are not claimed as new. The parameters in Theorem 1.1 concern a different modulus/error tradeoff: fixed-power moduli and power-small common exceptions, at the cost of a much weaker lower count and a nonoptimized interval exponent. The larger range of moduli in (6.3) alone is insufficient to make that tradeoff.
For completeness, the following logical example makes the last point precise. Fix and let be a power of two. Start with the nonnegative main-term array , and set it to zero only for , in the interior, and . This preserves pair-swap symmetry. There are affected targets. Since , the entire norm change in (6.3) is
for each fixed . Nevertheless, all these targets fail for the pair modulo , contradicting any common exceptional-set bound of order with fixed . Here follows, for example, by ordering the odd prime divisors and bounding their product of by one plus their number. This example is an abstract real array, not a prime convolution. It proves a non-implication between norms, not a counterexample about primes or a priority claim.
7. Uniform Removal of Proper Prime Powers
The following elementary estimate is useful when translating a progression statement between and ordinary prime log weights.
Lemma 7.1. Fix positive . Uniformly in integers , reduced classes , and intervals ,
Proof. Choose a fixed integer . For , reducedness forces the base to be a unit modulo . The fibre of the th-power homomorphism of is either empty or a coset of its kernel. Odd prime-power factors give at most roots each. The -primary unit group has at most two cyclic factors, one of order at most two, and gives at most . CRT therefore bounds the number of roots by . For fixed and , : the finitely many primes below contribute a constant, and every larger prime absorbs its factor into .
Each root class has positive representatives below , because . Taking shows that the contribution of is . For , count all integer bases up to ; there are possible exponents and each weight is . The result is . Dropping membership in only increases these bounds.
Corollary 7.2. Let be a fixed function with , and let be any set of distinct reduced classes with . For every fixed ,
The eventual threshold may depend on the chosen function . Consequently, an anchored maximal-variance estimate of size for every fixed transfers between and ordinary prime log weights on this family.
Proof. There are at most classes. Apply Lemma 7.1 with a sufficiently small fixed , square, and use . For , the resulting error is smaller than the asserted variance scale at every fixed logarithmic precision. The two normalizations have the same interval-length main term; apply in either direction. This transfers an estimate if it is proved; it proves neither variance.
8. A Separate Mixed-Correlation Question
The simultaneous representation theorem above does not close a pointwise reflected-prime comparison. We state the distinction precisely. Let , , , , , and . On , put
and set these sequences to zero elsewhere. For distinct , , take a real interval , , such that both throughout it, and define
Bonferroni truncation of the last factor involves squarefree with , where and is fixed after the desired logarithmic precision. Thus .
For a retained reduced term the conditions are . If , the exact prime-coordinate progression is
Indeed gives the product modulus , also when . The class is reduced: at primes dividing , use , and at primes dividing , use .
Lemma 7.1 removes proper powers from these actual retained sums at a total cost , even with fixed weights and the factor . There are slope pairs and at most choices of ; all other displayed factors are subpower. This is negligible against for every fixed when .
What remains is an estimate for the actual prime discrepancy in (8.1), including its selected residues and pair-dependent endpoints. The modulus exponent alone does not provide it. For example, a triply well-factorable weight of level vanishes on any integer with a prime factor greater than : use the factorization into three equal support lengths. Thus the prime-row instance cannot be represented directly by the triply well-factorable weights in [10, Theorem 1.3]. For the signed two-factor theorem of [7, Theorem 1.1], the conditions are and . A prime must divide one factor: placement in the first violates the first condition, and placement in the second violates the second. These are restrictions on those direct applications, not lower bounds for the actual errors or impossibility results for other methods.
In particular, no bound for every separated pair of coefficients in
is established here. Even a mixed prime–rough estimate would leave the prime–prime part of the centred quadratic form to be controlled. This separation is necessary when interpreting the scope of an almost-all representation result.
Funding
This research was supported by the initial scientific and technological project of the Institute of Information Technology (IOIT), Vietnam Academy of Science and Technology (VAST), “Training a large language model integrating formal logical thinking for solving general mathematics problems,” grant number NVKN02.05/26-27.
Use of Artificial Intelligence
Generative AI tools were used substantially in developing and checking arguments, comparing sources, drafting the text, and preparing the document. These activities do not constitute independent human peer review or formal proof verification. No computer experiment is used as a proof of an asymptotic statement.
Data and Reproducibility
The results are analytical. Definitions, endpoint conventions, parameter dependencies, and proofs of the deductions are included in the text; the general analytic inputs are identified in the cited primary sources. No empirical dataset is required for the stated deductions.
Appendix A. A Classical Mixed Theorem Below the Square-Root Scale
Let be even, , , , , and . Fix . Take distinct integers with , and any interval , , on which . Put and
Intervals and row subsets may depend on ; empty intervals contribute zero. No primality restriction is imposed on . Let count roots of modulo , and set
If , then . Otherwise its value is if divides both rows, if it divides exactly one, and, when both are units, or according as or not. Thus the factor is positive. For distinct rows the product converges positively, since outside the divisors of its factors are .
Theorem A.1. Fix and set . For every fixed , uniformly for each even , all allowed row subsets and all the above intervals,
The same assertion holds with , retaining the same common interval.
Proof. We first keep the exact sieve-divisor progressions. For squarefree , let denote the ordinary-prime log sum with . If , the congruence is impossible. Otherwise choose . The relation gives, in both directions,
This is the product modulus, also when . Since and for , the class is reduced precisely when . Inadmissible classes contribute zero: their prime values would be divisible by a prime at most , whereas all values are in . The complete condition is .
For reduced classes write
Literal endpoints then give
For empty intervals put the remainder equal to zero.
Let be the least even integer at least , with a sufficiently large fixed precision reserve. For , put
Even and odd Bonferroni inequalities, multiplied by the nonnegative prime weight, bracket by the two signed remainders and their local main terms. The squarefree multiplicative coefficient has for and otherwise. The full finite main coefficient is exactly
To check this identity, primes dividing , exactly one row, or with both rows units contribute ; primes dividing both rows contribute ; the remaining primes contribute . These are exactly the root factors above.
The included sum to , and . The elementary-symmetric tail after order is at most . Choosing after any required logarithmic precision makes this tail negligible. Also , , and the extra product in (A.3) is . For the tail ratio, the exceptional integer has polynomial size: at most of its prime divisors exceed , while the other prime-square tail is . Consequently, for every fixed reserve ,
Every retained is at most . No single fixed is required to serve every precision.
The classical maximal Bombieri–Vinogradov theorem [12, printed pp. 1,3] implies, whenever with fixed ,
for all fixed . Here the fixed divisor weights cost only logarithmic reserves: for the corresponding -error the individual trivial bound is ; divisor harmonic moments and Cauchy–Schwarz with arbitrary-precision unweighted maximal BV give the weighted statement. Removing proper powers costs , and changing endpoint convention costs . Both are power smaller than in this fixed-gap range, so the displayed form concerns ordinary prime log weights.
Since is fixed, eventually for some fixed . Write for the maximum in the last display. From (A.2), . Summing the other row costs . There are at most decompositions , and . Hence
There is no multiplicity factor after grouping the modulus. Apply maximal BV with adequate reserves, absorb , and sum the deterministic term in (A.4) against the two divisor envelopes. This proves (A.1). Exchanging the rows proves the assertion.
Remark A.2. This is a classical-method absolute slope average for each fixed , with no average over . It is neither a per-pair asymptotic nor a theorem at . At the balanced endpoint may reach ; the proof does not place those moduli inside the arbitrary-accuracy BV range. Failure of this sufficient maximal-error relaxation is not a lower bound for the actual signed errors. The theorem estimates neither the two-prime term nor every separated coefficient test, and does not imply binary Goldbach.
Appendix B. Distribution and Factor Regularity of the Rough Comparison
The sequences are those of Section 8. This section concerns actual distributional properties of and a Type I comparison with . None of these statements estimates Type II.
Theorem B.1. Weighted Type I with interval maxima. For fixed , and ,
No coprimality restriction on is imposed in this assertion.
Proof. On the finite common support, an interval selects an integer block ; write and . For , the exact reflected ordinary-prime progression has real main term . Weighted maximal BV and the proper-power conversion in Appendix A bound its summed maximal error by . If , an ordinary prime would have to equal a prime divisor of , a contradiction. Define .
If a prime divides both and , the rough count is zero. Otherwise primes at most not dividing each exclude one class of . Finite Bonferroni through adjacent orders , , counts the block with error , uniformly in its position and length. This follows by counting one residue class for each squarefree divisor and bounding the reciprocal tail by . After dividing by , its density in the variable is
The total rough-count error is with adequate fixed log reserves. It remains to match densities without declaring rows with only large common prime factors to be zero. For ,
Sum with , put , and use and divisor harmonic moments. This costs . For and no small common factor, the corresponding upper bound is . Multiplication by makes either density correction . Choosing after the requested precision and subtracting the two actual block sums proves the result.
Theorem B.2. Prime mass and local factor. Uniformly in each even and all real , for every fixed ,
In particular for large .
Proof. On prime support , each sieve prime excludes one reduced class ; primes exclude none. Bonferroni truncation at order gives distinct squarefree moduli at most , all inside any fixed sub-square-root BV range. Weighted maximal BV, ordinary prime-power removal and the elementary-symmetric tail estimate give
where . Partial summation removes the log weight. Its local factors are those of ; the good-prime tail is and the primes dividing above contribute to its logarithm. Thus uniformly. Both factors are polynomially bounded in , and , proving the theorem.
Definition B.3. Sorted factor coordinates. Fix and an integer . Let
Write an integer with exactly prime factors, counted with multiplicity, uniquely as with , and put . For a convex subset and a bounded one-Lipschitz , , define
Here , so the integral uses projection measure, not Euclidean surface measure. Degenerate convex sets have zero measure; the discrete sums retain their literal boundary atoms.
Theorem B.4. Uniform convex factor regularity. For each fixed , uniformly in the above and even ,
Repeated prime factors and arbitrary convex endpoint conventions are included. The constants need not be uniform as .
Proof. First fix a rough integer with and let lie in , with fixed . The proof of Theorem B.2 works at this last-prime scale: the active classes are for , and every truncated modulus is at most eventually. After partial summation and PNT it gives, for every fixed ,
No coprimality between and is required.
Fix a sorted initial tuple , including repeats, put , and . On its last-prime section the exact factor vector is , where . Convexity makes the section an interval in , also after sorting and product restrictions. Nonempty sections have , , hence all initial factors are rough and (R1) applies with . The path length as traverses is , so has bounded variation there. Discrete Abel summation using (R1), including left limits, gives a row error . Its sum over all initial tuples is , since
Writing for the sum with replaced by one, we have proved .
For completeness we evaluate uniformly in the convex region. Lift to the convex logarithmic slab
Convexity follows by writing the normalized vector of a convex combination as the convex combination with weights proportional to the two positive radial coordinates. For large , . Partition the ambient cube into cubes of side with . A convex subset of a bounded -cube meets boundary cubes: assign supporting normals by their largest coordinate and its sign; within a column perpendicular to that coordinate, the supporting inequality bounds the vertical separation by . There are columns and finitely many assignments. The same argument on the closure covers lower dimensional sets and all boundary choices.
For a cube meeting , its coordinate upper endpoints satisfy , hence eventually. Ordinary PNT with fixed error exponent ten gives in each coordinate
The integral is comparable to . Multiplying the coordinate counts and summing the errors over at most cubes costs . Boundary cubes cost ; the variation of the uniformly Lipschitz function on interior cubes costs the same. Thus
Ties between sorted factors are contained in the boundary cover and are counted once, including actual repeated primes. Under the Jacobian is , so the integral equals exactly
Combine this with and . The positive lower bound for and make the normalized error . Only finitely many occur for fixed , completing the assertion.
Appendix C. A Mixed Estimate with an Accuracy Dependent Moving Endpoint
The fixed exponent in Theorem A.1 cannot simply be allowed to vary. The quantitative form of the input does, however, give the following more explicit classical consequence. The notation and the local product are those of Appendix A.
Lemma C.1. Weighted maximal distribution in a logarithmically shortened range.
For every fixed and there is a fixed such that, whenever ,
Proof. Write and let denote the corresponding von Mangoldt maximum, enlarged to . The quantitative maximal theorem in [12, p. 3] gives
For , integer counting and give . The elementary divisor inequalities
follow by dominating by the -fold divisor function and expanding its ordered factors. Put . Cauchy’s inequality yields
Choose and . The total proper-prime-power log weight up to is . Its weighted aggregate over the moduli is ; enlarge to absorb it. The change from to costs at most per modulus, whose weighted sum is . These estimates prove the stated ordinary-prime version.
Theorem C.2. Moving subendpoint mixed estimate. For every fixed , and there is a fixed such that, uniformly for
the conclusion (A.1) holds, with constants depending only on . It holds for each even , all the allowed row subsets, and all pair dependent interval endpoints.
Proof. The exact reduction (A.4) holds for arbitrary ; only its subsequent distribution estimate used a fixed exponent. Fix its local precision sufficiently large in terms of . Choose its fixed Bonferroni constant and let be the least even integer at least , where . The two truncations have orders , so
Take . For the total modulus range satisfies
eventually, for every fixed , since . Apply Lemma C.1 with and sufficiently large accuracy to the modulus grouping in Appendix A:
The factor is absorbed by the logarithmic reserve. The local error in (A.4), summed over the two row envelopes, is and is absorbed by our choice of . All constants are now fixed independently of ; in particular no constant from a fixed- theorem has been passed to a limit. Exchanging the two rows proves the version.
Remark C.3. At the largest permitted , the exponent tends to , while . The constant is chosen after the accuracy. There is no assertion that one works for all , or that the original proportional square-root band is covered.
Appendix D. Balanced Rough Pairs, Two Prime Upper Bounds, and a Covariance Criterion
Throughout this section , , and the rows lie in with . For a common-support interval of length define
For distinct rows let count roots of modulo , and put
Lemma D.1. Root densities and completion. One has and for every prime. The product converges for . If denotes its truncation at , then, for large ,
In particular for every fixed .
Proof. If , the unit slopes have one common root. If , there are no roots when both slopes vanish, one when just one vanishes, and otherwise one or two according as or not. This proves the table and positivity. Outside the nonzero integer , which has size , the factor is . Its logarithmic tail is . The bad-prime tail is at most a constant times . This proves the displayed bound. Finally by the root table and the elementary prime harmonic estimate, and the superlogarithmic size of absorbs this factor.
Theorem D.2. Uniform rough-pair benchmark. For every fixed , uniformly in distinct rows and all endpoints,
Proof. Let and . Bonferroni inequalities through the adjacent orders , with the least even integer at least , bracket . For each squarefree , CRT gives
All divisors in either bracket are at most , and . The total endpoint error is at most . Also . The tail of the elementary symmetric expansion of is at most
when is sufficiently large. Choose fixed after so that this is smaller than the required logarithmic reserve. Multiplying by pays both errors by . The main term is ; use Lemma D.1. This proof is uniform even when the real interval is very short.
Lemma D.3. A finite Selberg normalizer. Let be the root densities just defined and fix . Let be the squarefree integers whose prime factors have , and write
There are real weights , supported on , such that
Consequently, if , the number of actual prime pairs on is at most .
Proof. Zero-density primes have been excluded before any division by . For the multiplicative identity
diagonalizes the quadratic form as . Finite Möbius inversion gives . The minimum under is therefore , attained at . Inverting once more gives
The fraction is at most one; since , . At a prime pair both prime values are at least , so . Squaring majorizes the prime-pair indicator. CRT and half-open interval counting give the main term and an error at most
□
Theorem D.4. Balanced two-prime upper bound. For every fixed , uniformly in all the above distinct balanced rows and real intervals,
Proof. Put , , with . The full finite product of over primes at most is
where zero-density factors equal one. After normalization by , the product has independent inclusion probabilities . It is a probability law on explicit squarefree products, not a model for prime pairs. The elementary estimate gives
For completeness, follows from ; induction gives the stated bound, and partial summation gives . Markov’s inequality retains at least of on products . These are included in , even though other primes may also occur in . The Euler expansion of contains , so . By Lemma D.1, eventually, uniformly in the rows. Hence
Lemma D.3 bounds the unweighted prime-pair count by . The logarithmic pair weight is at most . Finally , so .
Proposition D.5. A sufficient covariance condition. Let consist of rows coprime to , and let be a real interval. Define
where support in is included in . Fix , choose an integer , and put . If, for a fixed ,
then for all , . The displayed covariance hypothesis is an assumption.
Proof. Cauchy in bounds by
The first factor is . The quadratic form is real and nonnegative, as follows from its original sum-of-squares form. The weighted diagonal is , since and there are columns for each row. Its resulting contribution to is , smaller than . The assumed off-diagonal estimate pays the other term. At distinct rows the exact identity is , with the same interval and zero-support conventions. Thus neither Theorem D.2 nor the uncentered upper bound in Theorem D.4 proves the assumed cancellation.
Appendix E. Selected Progressions and Exact Quadratic Identities
This section records reductions with complete centering terms. They are useful statements of the remaining arithmetic problem.
Definition E.1. For squarefree with let
Only distinct pairs with are counted in selected norms.
Lemma E.2. Exact recovery and multiplicity. Every retained residue in (8.1) determines and . Conversely, an element of determines the other slope class
Moreover
Proof. The chosen is a unit, so . Conversely this gcd identity makes a unit modulo and permits the displayed inversion. The admissible slope classes are precisely the units with . At a prime dividing only the zero class is forbidden; otherwise the two distinct classes are forbidden. CRT proves the product, including by empty-product conventions.
Proposition E.3. A selected anchored variance is sufficient.
Let range over a fixed-accuracy Bonferroni collection. Put
For each fixed divisor envelope , if
then the balanced weighted mixed estimate follows for every fixed . The variance estimate is not asserted here.
Proof. Recover using Lemma E.2. The total weight of the other slope class at is
with the actual row restrictions retained. Since , each class has representatives. Cauchy within each class and the divisor moment bound imply, for some fixed ,
Here . Every actual interval error is at most , including when its endpoints depend on . Hence its aggregate is bounded by
The assumed variance, the factor , and the deterministic sieve completion error give the claim with sufficient fixed log reserves.
Proposition E.4. Exact selected interval variance. Choose arbitrary class-dependent intervals in , and write , , and . Then
The first term is uniformly in all interval choices. If an anchored supremum is used, its near-maximizing interval must still be chosen separately for each class.
Proof. The identity is the finite expansion of each centered square. For fixed , selected classes partition a subset of the primes with . There are integers in this progression in the ambient interval. There are rows and at most moduli, and each squared log weight is . This proves the diagonal estimate without any prime-distribution theorem. Changing the interval in each finite summand does not change that argument; it does not remove the off-diagonal term or either subtraction.
Lemma E.5. Signed truncation with controlled prime weight. For each prescribed , choose a sufficiently large fixed and . With the actual signed remainders of Appendix A, at distinct balanced rows,
Proof. Let . The binomial identity gives . Apply it with and multiply by the nonnegative prime log weight, bounded by . Expanding the binomial as a sum of squarefree divisors with exactly factors and counting each linear congruence yields an error at most
Stirling’s bound and sufficiently large fixed pay the first term; pays the second. On actual prime support all inadmissible divisors have zero contribution. The finite main term completion in (A.4), with sufficient log reserve, then proves the equality. Thus renaming this signed remainder supplies no independent estimate for the balanced mixed error.
Proposition E.6. Support obstruction for factorable weights. If a sequence is -fold well-factorable at level , meaning it admits a supported convolution for every splitting , then it vanishes at every integer containing a prime . The same holds for any finite linear combination of such weights at levels at most .
Proof. Choose the equal splitting . In any factorization of an integer divisible by , one of the factors contains , and therefore exceeds its support. Every convolution summand is zero. Taking a finite linear combination preserves a zero coordinate.
This is a statement about the specified functionals, not a lower bound for actual prime errors or an exclusion of other dispersion arguments.
Appendix F. Balanced Prime Products with a Prime Remainder
This is a distinct almost-all result for ; its composite summand must not be identified with a binary Goldbach representation. Put and .
Definition F.1. Let and , where and . Define
For each application of a fixed-box estimate, these intervals are held fixed as varies; their endpoints may depend on .
Theorem F.2. Fixed-box prime-product mean square. For every fixed , uniformly over the indicated boxes,
Here is the usual binary singular series. The assertion is not a supremum over boxes inside the sum.
Proof. The geometry gives and . Thus the fixed remainder interval contains every possible prime remainder. Set
Their product has Fourier coefficient . Because the intervals are disjoint, unique factorization makes the map injective. Orthogonality and the ordinary prime number theorem give .
Choose , , and major arcs with , . They are disjoint for large . On the minor arcs, Dirichlet approximation with gives and : if , then puts in a major arc. Vaughan’s bound [9, Theorem 17.1], weakened to log power four, applied to the two remainder prefixes gives
The proper powers cost and are absorbed. Parseval therefore bounds the minor-arc squared error by .
For define
Siegel–Walfisz and partial summation give, for ,
for every fixed . For the second formula first fix , sum in unit classes modulo , and use , since . Summing the error over costs at most . Apply ordinary PNT and partial summation to the remaining integral; its variation is . Choosing after pays these costs uniformly in the boxes.
The total major-arc measure is . Thus their contribution is
where integrates over . Integration by parts gives
Fourier inversion for the integrable product, using the above geometric inclusion, gives , and its tail is . Also , by .
For clarity, the singular-series completion is averaged rather than pointwise. Rankin’s inequality bounds its absolute tail by , where
Indeed the unchanged good-prime Euler product has excess . Write with squarefree support and . Positivity and give
The product converges, so . As , the total mean-square error is
Take . Every source precision above was chosen after these fixed exponents, completing the proof.
Corollary F.3. Moving balanced boxes. For let
For each fixed , outside targets in , one has
In particular, outside such a set with suitable fixed ,
Proof. Chebyshev applied to Theorem F.2 supplies any fixed logarithmic exceptional saving for each fixed pair of boxes. To retain moving endpoints, mesh at spacing , with fixed . On each cell , define inner intervals by taking the lower endpoints at and the upper endpoints at in the displayed formulas; use the reverse choices for outer intervals. They lie in the permitted compact box family and bracket the exact moving intervals, respecting all strict endpoints. There are such tests. Apply the fixed-box consequence with exceptional exponent and error , and take their finite union. Its size is . The summands are nonnegative, so the inner and outer counts bracket the moving count. Each product changes by ; makes the main-term displacement . This proves the first assertion. Direct integration gives . Finally uniformly, so positivity permits removal of the prime log weight with relative error . Take, for example, and use .
Corollary F.4. One actual prime-mask comparison. For the moving boxes in Corollary F.3 and each fixed , outside targets,
Proof. The prime products lie in . Apply the inner comparison (R1) in the proof of Theorem B.4 with and the actual interval of ; it is a subinterval of , , and . Summing its errors costs at most times an arbitrary negative log power. PNT for the two boxes and therefore give for each target. Subtract Corollary F.3 with sufficient precision. This tests one prime-mask family only; its exceptional set is retained.
Appendix G. A Conditional Fixed Margin Implication for Real Zeros
This section states the hypothesis on actual Goldbach counts explicitly. It is not supplied by the preceding lower bounds outside exceptional sets.
Definition G.1. Let be the full ordered von Mangoldt convolution. For a conductor and let .
Theorem G.2. Conditional fixed margin exclusion. Fix , , and , and put . There is a sufficiently small fixed with the following property for sufficiently large . Suppose at least a proportion of satisfies the external band
Then no primitive real nonprincipal character of conductor has a real zero with . For odd characters only the lower half of (FM) is needed; for even characters only the upper half is needed.
Proof. We first specify the cited analytic inputs, so the scope of the deduction can be assessed. Pintz’s original explicit formula [11, Theorem 1, Sections 4–5 and 9–11] uses a large fixed , a source-selected with , and the pole together with primitive zeros of conductor at most in
Its major-arc expression has an error after the fixed arc reserves are chosen, with fixed. The first constant is the fixed-reserve constant in the source’s tail bound; no uncontrolled is used. Its original minor-arc estimate is
These classical analytic theorems and zero-repulsion lemmas are cited inputs, not claims of a new proof of their full analytic machinery.
Choose and fixed . Then every allowed selected exceeds . If , the source’s zero-free region, Landau uniqueness and Deuring–Heilbronn repulsion clear the retained set to the pole and , for fixed large followed by fixed small . The repulsion is used over the full retained height range: with another zero and conductor , the source uses
Also . The fixed-parameter repulsion conclusion [11, Section 11, equations (11.3)–(11.5)] gives for all other retained zeros, once is sufficiently small. Choosing the right side greater than , and meeting the fixed uniqueness threshold, removes them.
We record the aligned arithmetic exactly. Write for the Gauss sum of the induced character on modulus . For the real characters used here, the generalized series is normalized as
with the primitive conductors; the principal primitive character has conductor one. In the aligned cases below the evaluated series converge absolutely, or vanish term by term. For , the mixed generalized singular series obey
For the first identity the principal Gauss factor is , which kills nonsquarefree . For squarefree , , CRT makes the conductor component an unweighted sum of the nonprincipal character, equal to zero. If is nonsquarefree every multiple was already killed. For the second identity the induced Gauss formula restricts to with squarefree coprime to , and . The local term becomes
The factors away from form the principal series, and the missing factors at primes dividing multiply to . Absolute convergence for fixed justifies the Euler product and also covers primitive real conductors divisible by or .
Writing , and , the pole–zero formula and (Z2) give, on the conductor grid,
Uniformly for and , by differentiability at and . At a fixed tolerance , (Z1) and leave at most bad targets.
The source truncates ordinary primes below . Restoring these coordinates costs at most per target. Restoring proper powers costs . Both are , so the full convolution is compared in both directions. Choose fixed after , then fixed after , then , and finally large . Since and , the resulting normalized count outside the bad set satisfies
The number of grid points is
The bad-set proportion is because . Thus the positive proportion in (FM) contains a good point, contradicting its lower band when and its upper band when . This proves the implication with the stated parameter order.
Remark G.3. The arithmetic band (FM) has not been established by this article. A positive lower floor tending to zero after normalization is insufficient. No parameters here are moved with or , and no new unconditional zero-free region is claimed.
Appendix H. Paired Congruences and Local Ambiguity
These finite statements describe integer geometry. The target sum in this section is , which need not equal the anchor .
Definition H.1. Let be positive integers, , , , , and let be a nonempty contiguous integer interval. Put , . An alternate at base is a pair with and .
Lemma H.2. Generalized CRT and exact offsets. For any integer pair , the conditions , are equivalent to . Every alternate therefore has the form
Proof. The two differences are divisible by and exactly when they are divisible by . Substituting into and gives the displayed indices, and conversely. This least-common-multiple modulus concerns paired congruences; it does not replace the product modulus in the sieve-row transformation.
Theorem H.3. Uniform paired uniqueness. Every base has only the zero-offset alternate if and only if .
Proof. Let . If the two alternate indices are separated by , impossible in an interval of diameter less than . Conversely, when , take , , . All three belong to , and Lemma H.2 with gives a distinct alternate.
Lemma H.4. Exact local filter. Assume in addition that is even, , , and the base values are units modulo . Then both alternate values are units modulo if and only if .
Proof. The slopes and are odd. Preservation of parity forces even. Modulo , either , in which case , or . In the latter case, if , the two values include zero; thus local admissibility forces and again . Shifting two equal nonzero residues by opposite nonzero amounts modulo makes one zero. Since is a unit modulo , preservation forces . Conversely preserves both base values modulo .
Proposition H.5. Exact phase-sensitive count. Under Lemma H.4, suppose and put
For an integer interval let
with empty intervals contributing zero. The exact number of locally admissible bases with a supported nonzero locally admissible alternate is .
Proof. The base values are units modulo precisely for indices in . By Lemma H.4, a positive alternate offset has , . If its two indices fit in , the nearer indices for also fit; their bases are exactly . Negative offsets give by the same argument. Inclusion–exclusion and literal residue counting give the formula. None of these local tests asserts primality.
Remark H.6. Finite checks and their scope. The integer instance , , has common-support . At , the pairs and have the same sum ; their indices exhibit the nonzero offset in Theorem H.3. They are integer witnesses, not claimed prime pairs. The local equivalence and phase count also have preserved bounded residue checks (24 and 5208 setups, respectively); their general validity follows from the proofs above, not from these finite checks.
Appendix I. A Sharp Prime Boundary and Its Exact Unit Mean
We now isolate a sharply truncated bilinear component. The parameters in this and the following three appendices are local to these appendices; in particular, their is different from a major-arc denominator cutoff. The statements below concern the explicitly defined component. No equivalence between a bound for this component alone and the binary Goldbach conjecture is asserted.
Definition I.1. Boundary coefficients. Let , with , and put
Thus and all are odd. Fix and set
Let and consist of the primes in and , respectively. For a finite prime set , define . On odd positive integers put
Fix intervals and , and define
For a right coefficient , let be the sum of over odd , with and . Let be times the same box sum with the congruence replaced by . Write and .
All assertions in these appendices hold for sufficiently large , with thresholds allowed to depend on the fixed . The two cofactor slabs are then disjoint. The lower slab has . The relevant finite harmonic sums are
Lemma I.2. Rough moduli and unique prime labels. Uniformly for , one has , , , and . For , at most one pair contributes to . Every such prime satisfies
Proof. Every prime divisor of exceeds . The prime number theorem gives , whence
The Euler product proves the totient assertion. In a slab of length comparable to , the reciprocal mass removed by multiples of a prime is . Summing over removes , since is a fixed positive power of . Odd harmonic sums on either slab are . This proves the mass assertions and boundedness of . The displayed prime bounds follow from and . All further inequalities follow from and . Two distinct eligible primes would have product greater than , so cannot both divide . For each prime the cofactor is determined. This proves uniqueness.
Theorem I.3. Marginal moments and the optimal constant subtraction.
For every fixed and every interval , uniformly in its endpoints and in ,
If , the second moment is
For endpoints in this compact range with , where is fixed, these imply
In particular, the least possible squared norm after subtracting a constant is of order :
Also .
Proof. Use the classical prime number theorem with an arbitrary fixed logarithmic precision. Partial summation gives
The usual estimate for follows as well. All endpoints are between fixed positive powers of . Expanding and applying the two prefix estimates costs after summation, since . The same argument with proves the absolute first-moment bound. Primes dividing must be removed: at most cofactors occur for each such prime, so their first- and second-moment costs are and , respectively. Both are smaller than for each fixed .
Lemma I.2 makes the expansion of the square exactly diagonal in . Summing the second prefix formula gives (I.3); the first gives (I.2). Changing either endpoint convention costs at most. These are absolute estimates at scale , even when is very short. They are not relative prime asymptotics on singleton intervals.
On the lower and upper slabs, respectively, and . Thus , which proves (I.4). For the support count use the corresponding prime-counting prefix formula. Uniformly for on a slab ,
Integration in , followed by summation over , proves (I.5); removing is again harmless. The positive lower bound for proves the asserted orders.
Finally inclusion–exclusion on the odd lattice gives the exact-unit count . If denote the first two moments, completion of the square gives
Here and . This proves (I.6), including complex constants.
Theorem I.4. Exact recentering of the principal average.
Put and . For every fixed ,
If the additional estimate holds uniformly on , with fixed , then
The estimate in this last assertion is an explicit hypothesis.
Proof. Subtract times from (I.2). Since , the result is for every interval . For each odd unit row use , retaining its endpoints. There are rows, and , proving the estimate for without cancellation in the rows. The displayed identity is exact algebra. The congruence selects only partners per row in the bounded boxes, whereas the principal box has pairs. Thus . Under the stated hypothesis their difference is . The difference-of-squares inequality, summed over at most moduli, proves (I.7).
The raw is not asserted to be small: the exact formula is . In particular, the terms remain in . Replacing by an unrestricted harmonic mean with only an error would not preserve arbitrary logarithmic precision.
Appendix J. Combining a Prime Label with the Möbius Variable
Retain Definition I.1. Let and be the parts of and in which the prime in divides , and put .
Theorem J.1. A negligible repeated-prime contribution. For every fixed and every ,
Consequently, their squared sums are . These assertions hold also for nonsquarefree physical moduli.
Proof. Write . With , enlarge the positive representation sum by discarding the guards and primality. Its mass is at most
For a selected term, divides the nonzero integer , and the product window forces this integer to lie between and . The divisor bound gives possible moduli for each triple. For the principal sum the factor gives . These estimates prove the first assertion.
For the pointwise bound, and . If there is no selected solution. Otherwise . Each odd prime power has at most two square roots of a unit: roots modulo its prime lift uniquely because is a unit at a root. CRT gives at most roots, and gives at most one eligible representative per root. The result is . Multiplying the supremum and first-norm bounds, with smaller preliminary values of , gives the squared-sum assertion.
Definition J.2. Restricted prime-divisor weight. For odd put
and define
Let be its selected part and .
Theorem J.3. Exact restricted product identity. One has and . Furthermore,
At a fixed , all retained prime representations have the same sign . There are at most two distinct eligible primes in .
Proof. Eligible primes are outside . If , then and , including the case when both Möbius values vanish. If , the collapsed coefficient vanishes and the original term belongs to . Summing these identities over the eligible prime divisors proves both exact formulas, with all box restrictions retained. Each eligible prime is at least and . Three such divisors would imply , which is impossible eventually. Thus .
The absolute selected mass is , by uniqueness of the right prime label and partners per right index; the principal mass has the same bound. These bounds also apply to the collapsed expressions and to their centered versions. Apply the difference-of-squares inequality and the first-norm estimate in Theorem J.1 to obtain (J.1). This step includes the cross terms, not just the squared discarded mass.
Proposition J.4. The exact remaining progression. For choose with , and put . Then
Its ambient size is and .
Proof. Since are odd, the conditions and are equivalent to with . The required divisibility by is exactly . Substitution proves the identity. The product window gives , and the claimed scale follows.
For and the prime window in is , with the additional prime cutoff. It moves with . A bound for an unweighted Möbius progression does not automatically survive this arithmetic multiplier.
Appendix K. Two Obstructions to Losing the Joint Signs
The following lower bound is for a positive majorant of the actual component, not for its signed value.
Theorem K.1. Failure of a rowwise absolute character bound.
Take and in Definition I.1. Put , and
Then , but
The lower bound already comes from prime moduli and characters of conductor . It does not give a lower bound for .
Proof. Character orthogonality gives exactly
Two triangle inequalities yield the majorant. Restrict its nonnegative sum to primes and primes . Here . The full interval lies in , with length . Thus it equals , and its integers are distinct nonzero residues modulo . Theorem I.3 and boundedness of give
The principal transform is by the proof of Theorem I.4. Orthogonality therefore yields
Since every , the sum of their absolute values is . There are such prime rows, so . There are also such prime moduli. This proves (K.1) by the ordinary prime number theorem in fixed-ratio intervals. Every nonprincipal character modulo a prime has conductor that prime. All restrictions made in this argument were in a positive sum; making them in the signed identity would not be valid.
Proposition K.2. Multiplicative marking of a fixed prime window.
Let and . For put . This is multiplicative, , and
For one has exactly
Any uniform norm bound for a finite linear functional on therefore passes to without a degree factor, and to the fixed logarithmic window with cost at most when .
Proof. The prime factors of coprime integers are disjoint, which proves multiplicativity; nonsquarefree values vanish. On squarefree integers . The integral extracts the coefficient of in a finite polynomial. A divisor prime has zero coefficient on the right of (K.2); a prime has coefficient . This proves the identity. Apply the triangle inequality in the finite coefficient integral and then in (K.2). The total coefficient variation is .
The construction preserves the Möbius sign and the avoidance factor. Its prime values are piecewise constant, so it is compatible with the type of class considered by Fouvry and Tenenbaum [2]. This observation does not replace the hypotheses on the modulus norm, the target residue or the moving window. In particular, their Theorem 1.5 controls a signed inner modulus average with a short outer absolute average, while their Theorem 1.8 with individual modulus absolute values has a range below the square-root scale.
Proposition K.3. Small representatives are rare. Let be a positive integer and satisfy . For every fixed ,
Thus almost every prime modulus in this interval has no such representative for any fixed power of , or for with fixed .
Proof. For each integer , the modulus divides the nonzero integer in . Apply the divisor bound and sum over the at most choices. For the last assertion, and ; choose and compare with the prime number theorem count .
There is also a purely norm-theoretic distinction. List these prime moduli as and put , with elsewhere. Every signed prefix has modulus at most , whereas . For and , one has for every fixed . Hence even such arbitrary-logarithmic prefix bounds do not imply the required squared norm. This is a counterexample between abstract norms, not an arithmetic counterexample for prime discrepancies.
Appendix L. A Rational-Target CRT Kernel
An elementary reciprocity identity permits a restricted large-target estimate without replacing the rational target by a small integer. The resulting estimate is a corollary of the Kloosterman-fraction bound of Bettin and Chandee [1]; it is not an estimate for the whole sum in Proposition J.4.
Lemma L.1. Reciprocity with the cofactor retained. Let be odd, let be primes coprime to , and let be primes exceeding . Let modulo be specified by
Put , , and let denote the inverse of modulo . Then for every integer ,
The last term is zero modulo one when .
Proof. CRT expresses the left side as the sum of and modulo one. Write and choose (take for ). Then is divisible by , and is an inverse of modulo . The first CRT term is consequently . The second is . For coprime , ordinary reciprocity is ; it follows directly by multiplying by . Combining gives , which is (L.1). All numerators are integers, so the modular substitutions are legitimate even when is not integral.
Proposition L.2. A bound for separate physical-modulus weights.
Suppose is odd, , , and . For arbitrary complex supported on primes in , let
For every fixed ,
The implied constant is uniform in these weights; no arbitrary joint weight depending on both is permitted.
Proof. On expand in multiplicative characters: . Parseval gives and . For use the single constant character. Thus the last factor in (L.1) separates at a cost at most .
For each character apply [1, Theorem 1] with its third variable supported at one, and with
Here denotes the source scale, not our primorial. The two coefficient sequences are supported on and ; their Euclidean norm product is . Coprimality of is exactly . The cited bound is
It also holds on every rectangular prefix, by restricting the coefficients. The smooth middle factor in (L.1) is retained by two-dimensional partial summation. On the rectangle , the sum of its corner, edge-variation and mixed-variation norms is : differentiating once in each variable gives, after integration, at most a constant times , where . Also .
Finally use , and multiply by . The first term becomes , and the second becomes . Since all source scales are bounded powers of , a smaller preliminary epsilon absorbs their epsilon factors into . This proves (L.2).
Corollary L.3. A lower-cofactor frequency budget. Under Proposition L.2, suppose , and . Then
For this is .
Proof. Use frequencies and . The two total delta exponents are and , both at most . Since , and . Taking the displayed epsilon to be leaves a saving strictly larger than in both terms.
This result treats prime physical moduli and separate weights for a specified kernel. It does not freeze the moving weight , justify a full Poisson frequency range, sum over the dilation primes, or control the upper cofactor slab . In that slab the first exponent in the corollary gives no saving. Green’s method for multiplicative functions in large progressions [4] motivates this kernel, but its small common integer target hypothesis cannot be replaced by the present rational target without these additional arguments. The elementary identity above keeps the archimedean reciprocity factor precisely because it is not negligible for a numerator of size comparable to .
Concluding Remarks
The proof of Theorem 1.1 isolates three uniformity costs: the correction for a possible exceptional character, the loss from location-scale prime prefixes, and the finite union over all prescribed residue pairs and moduli. The arithmetic kernel norm allows the first cost to retain both suppressed factors, while the deliberately small fixed parameters pay the other two. Improving the admissible exponents would require sharper analytic input or a more efficient treatment of these costs.
The classical polylogarithmic asymptotic and the fixed-power lower bound have different strengths and should be kept separate. The proper-power estimate is an elementary normalization device; it does not replace a prime-distribution theorem. All results retain their stated exceptional sets or hypotheses, and the binary Goldbach conjecture is not resolved by them. The appendices also show the extent of the comparison method: its Type I and convex regularity properties can be established without the missing Type II input. An uncentered upper sieve bounds balanced two-prime mass, but does not yield a centered covariance asymptotic or a positive lower bound. The fixed-margin zero implication remains conditional on its explicitly stated arithmetic band. Thus none of the additional statements changes the every-target limitation.
The sharp-boundary analysis separates three further issues. Its exact unit mean makes the principal average small, but subtraction of even the best constant leaves coefficient energy of order . A specific rowwise absolute character majorant has squared norm at least , so that majorant cannot prove the desired arbitrary-logarithmic saving. After the repeated-prime contribution is removed, the remaining product weight preserves both original boxes and the common Möbius sign. The rational-target kernel estimate supplies a restricted lower-cofactor bound; it does not control the upper slab or the moving prime window. These results therefore leave a concrete signed correlation problem, as well as the other components needed for an every-target conclusion.
References
- Bettin, S.; Chandee, V. Trilinear forms with Kloosterman fractions. Adv. Math. 2018, 328, 1234–1262. [Google Scholar] [CrossRef]
- Fouvry, É.; Tenenbaum, G. Multiplicative functions in large arithmetic progressions and applications. Trans. Am. Math. Soc. 2022, 375, 245–299. [Google Scholar] [CrossRef]
- Gallagher, P.X. A large sieve density estimate near 4. Invent. Math. 1970, 11, 329–339. [Google Scholar] [CrossRef]
- Green, B. A note on multiplicative functions on progressions to large moduli, preprint. arXiv 2024, arXiv:1604.04481v4. [Google Scholar]
- Halupczok, K. Goldbach’s problem with primes in arithmetic progressions and in short intervals. J. Théor. Nr. Bordx. 2013, 25, 331–351. [Google Scholar] [CrossRef]
- Kawada, K. The prime 𝑘‐tuplets in arithmetic progressions. Tsukuba J. Math. 1993, 17, 43–57. Available online: https://tsukuba.repo.nii.ac.jp/record/15690/files/3.pdf. [CrossRef]
- Li, R. Primes in arithmetic progressions to large moduli and refinements of Harman’s sieve. arXiv 2026, arXiv:2602.20917v6. [Google Scholar]
- Montgomery, H.L.; Vaughan, R.C. The exceptional set in Goldbach’s problem. Acta Arith. 1975, 27, 353–370. Available online: https://matwbn.icm.edu.pl/ksiazki/aa/aa27/aa27126.pdf. [CrossRef]
- Montgomery, H.L.; Vaughan, R.C. Multiplicative Number Theory II: Primes and Sieves. author-hosted draft, Chapter 17, Theorem 17.1. pp. 65–66. Available online: https://personal.science.psu.edu/rcv4/571s25/montgomery-vaughanII.pdf.
- Pascadi. On the exponents of distribution of primes and smooth numbers. arXiv 2025, arXiv:2505.00653v2. https://arxiv.org/abs/2505.00653v2. [Google Scholar]
- Pintz, J. A new explicit formula in the additive theory of primes with applications I. The explicit formula for the Goldbach and Generalized Twin Prime Problems. arXiv 2018, arXiv:1804.05561v1. https://arxiv.org/abs/1804.05561v1. [Google Scholar]
- Vaughan, R.C. The Bombieri–Vinogradov Theorem. author-hosted lecture note, pp. 1, 3. Available online: https://personal.science.psu.edu/rcv4/Bombieri.pdf.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.