The Goldbach exceptional set: an exponent 11/20
Abstract.
We prove for every . Here counts the positive even integers at most that are not sums of two primes. A four-level Harman decomposition gives a signed prime minorant. Exact rational bounds for four discarded families give a positive lower bound for its logarithmically weighted mass. We prove a Bombieri–Vinogradov estimate at level , with both maxima and a divisor weight. We also bound the exponential sum of the same weight on the minor arcs. The major arcs use classical zero-density estimates and the zero-free half-plane of OpenAI [6, Theorem 1.1].
Key words and phrases:
Goldbach problem, exceptional set, Harman sieve, Bombieri–Vinogradov theorem, Dirichlet -functions2020 Mathematics Subject Classification:
Primary 11P32; Secondary 11N35, 11M261. Introduction
Let denote the set of primes, and put
| (1.1) |
The two primes need not be distinct.
Theorem 1.
For every ,
| (1.2) |
Pintz and Althöfer obtain the exponent from the zero-free theorem (2) below, and Pintz’s method gives under . Theorem 1 improves both exponents:
The hypothesis and the precise citations are stated below. The zero-free theorem is an external input and is not reproved here.
1.1. The zero-free hypothesis
Hypothesis . For every Dirichlet character ,
| () |
This includes the character modulo , whose -function is . The functional equation then gives
| (1.3) |
for every nontrivial zero . An imprimitive character has the same nontrivial zeros as its inducing primitive character.
Theorem 2.
Assume . For every ,
| (1.4) |
(F1) [6, Theorem 1.1] Every Dirichlet -function, including , is zero-free in .
1.2. The method
We construct a signed minorant on . Every discarded term is nonnegative, and every negative term is retained or expanded. The loss of mass comes from four discarded families, and their rational upper bounds give
| (1.5) |
Only a lower bound is asserted.
Put ; this weight is used throughout. Its distribution estimate keeps both maxima inside the modulus sum and includes the factor . The minor-arc estimate is
Under the major arcs contribute at least , and the resulting dyadic exceptional-set bound is
The major-arc argument follows [7, Section 8]. We derive the required mean square from zero-density estimates and do not use [7, (8.25)]. Heath-Brown’s estimate limits this argument to levels . The mass, distribution and minor-arc estimates are all unconditional.
2. Notation and parameters
Write and . Given , choose
| (2.1) |
The decomposition level is fixed, and the analysis level is . Put
| (2.2) |
Then
| (2.3) |
Let be any integer satisfying
| (2.4) |
All estimates are uniform in this choice. We keep the three parameters
| (2.5) |
distinct; they govern arc widths, distribution and Dirichlet approximation. The choice of gives
| (2.6) |
For large ,
| (2.7) |
Implied constants may depend on fixed saving exponents and on . They are uniform in all variables within the stated ranges.
Let be the least prime factor of , with , and put
Thus , and we call with -rough. The function counts prime factors with multiplicity. In the function counts distinct prime factors; elsewhere denotes Buchstab’s function:
| (2.8) |
Buchstab’s function is continuous on .
For , put
| (2.9) |
Both maxima are part of this definition, and subadditivity and cutoff monotonicity give
| (2.10) |
for endpoints at most .
Let denote the distance to the nearest integer, and define
| (2.11) | ||||
These arcs are disjoint, since distinct reduced fractions are at distance at least and . Once is defined, put
| (2.12) |
For or , write
Finally,
A star on a character sum restricts it to primitive characters.
3. The four-level Harman weight
3.1. Two exact identities
Lemma 3.1.
For every integer ,
| (3.1) |
For and ,
| (3.2) |
Proof.
If is prime, the sum in (3.1) is empty. If is composite and -rough, only contributes, and this prime satisfies . If , every term on the right vanishes; this case includes prime powers.
For (3.2), the case is immediate. Otherwise put . For the sum is empty, and for only contributes. For , every term vanishes. ∎
Both identities hold when their left sides vanish, so we expand zero-valued terms as well.
3.2. The stopping rule
For , a node of depth consists of primes
It carries , and expanding it by (3.2) gives
| (3.3) |
The first term is a retained rough leaf, denoted , and the root is .
At depth , stop when , which gives the leaf , and expand when . At depth , stop when , which gives . Discard the nodes with , which form , and expand every node with . At depth , stop when , giving , and expand both ranges and . At depth , stop when , giving . Discard all other nodes; they form , and as specified below.
Every depth- node has . Every depth- node has , and therefore
| (3.4) |
If , then every child has , so and can arise only from . There are no nodes of depth .
Table 3.1 defines every family. Each entry is summed over decreasing primes at least with . The condition is imposed in every nonempty row. For , this condition is automatic on :
| (3.5) |
for .
| Family | Prefix conditions | Residual | Sign |
|---|---|---|---|
| Empty prefix | |||
| , | |||
| , , and or | |||
| , | |||
| , , | |||
| , , , | |||
| , | |||
| , , , | |||
| , , , | |||
| , , |
Proposition 3.2.
For ,
| (3.6) |
3.3. The weight and its support
On , define
| (3.7) |
Set off , and put
| (3.8) |
Every discarded term is nonnegative. Hence
| (3.9) |
The weight may be negative. Every nonzero term is -rough, and since , its support satisfies
| (3.10) |
A node is determined by at most four distinct prime factors of , and it contributes at most one retained term. Thus
| (3.11) |
For , write and ; the product determines its ordered prime prefix. For we have , since , and then forces . Thus is automatic here as well. Every balanced family has
| (3.12) |
Its only roughness coupling is , and no retained family is a bare prime sum.
4. The mass estimate
(F3) [1, Chapters 7 and 18] We use the prime number theorem and Mertens’ estimate in the forms
Here .
4.1. A Buchstab envelope
Put and
| (4.1) |
Lemma 4.1.
Let be the positive root of . Then
The function is continuous and non-increasing. For ,
Also , and is -Lipschitz.
Proof.
On , equation (2.8) gives
With , differentiate ; its maximum occurs at and equals . For put . Then, for ,
Thus , and the rational inequality
| (4.2) |
proves . The envelope now follows from on . On this interval , and for ,
Continuity then completes the Lipschitz assertion. ∎
4.2. Rough numbers through
Let
This count includes .
Lemma 4.2.
Uniformly for and ,
| (4.3) |
The implied constant is absolute.
Proof.
Assume , where , and take . Decomposition by the least prime factor gives
| (4.4) |
The error counts the residuals divisible by the selected prime, and it is . The base case gives
For the new parameter is at most . Hence
| (4.5) |
Here is the induction constant, and by (4),
The function is absolutely continuous, and Lemma 4.1 gives, almost everywhere,
Stieltjes integration against yields
With , the integral equals
Insert this in (4.4). Since , the term is absorbed by the error, and this proves . The recurrence gives an absolute . ∎
The subtraction of in (4.3) is needed near , so we retain it in the interval estimate.
Lemma 4.3.
Let be an integer and . Uniformly for ,
| (4.6) |
The integral is defined to be zero when .
4.3. Absolute mass and square mass
Lemma 4.4.
We have
| (4.7) |
where for . Consequently,
| (4.8) |
4.4. The four loss regions
For , let for and otherwise. Let consist of its prime prefixes in Table 3.1, without . For a prefix put
Define
| (4.9) |
Put and . The four regions are
| (4.10) | ||||
Here are the ordered coordinates, and every tuple in (4.9) lies in its corresponding region. For
the ranges are
| (4.11) |
For example, and on . On we have and . These give the two lower bounds in (4.11), and the remaining upper bounds follow from (4.10).
Lemma 4.5.
For each discarded family,
| (4.12) |
where
All errors are uniform over the indicated tuples.
Proof.
For and we have , and for we have . For , the inequalities and give . Thus in every case, and for large the residual is at least . By (3.5),
| (4.13) |
If , a counted residual would satisfy . Its count is therefore exactly zero, and we delete these tuples before making any estimate.
4.5. Rectangle majorants
Fix and . Put
where . Every point of a loss region lies in exactly one such cell. Define
| (4.15) |
Lemma 4.6.
For with ,
Proof.
Write , so . First raise to . The value decreases, since at the starting point. Then raise the other coordinates to their upper endpoints; each has slope . Thus , and also . Use the non-increasing envelope and the lower endpoints in the denominator. If , the envelope equals , so the same bound holds. ∎
For , take and retain cells satisfying
| (4.16) |
For , take and retain cells satisfying
| (4.17) |
Write these cell sets as and . Each exclusion removes only cells disjoint from the corresponding region. Define
| (4.18) |
The exact rational arithmetic in Appendix A gives
| (4.19) |
Proposition 4.7.
We have
| (4.20) |
Proof.
Group the tuples in (4.12) by cell. By (4.14) and Lemma 4.6,
Uniform continuity of gives , and . For each coordinate, (4) gives
Enlarge the sum to all prime tuples in the box product; every summand is nonnegative, including in diagonal cells. Each cell then contributes at most . The number of cells is finite and independent of , so summing proves the proposition. ∎
4.6. The two volume bounds
Lemma 4.8.
We have
| (4.21) | ||||
Proof.
By (4.11) and (4.14), for these two families. Hence and , and Lemma 4.5 gives the bound
Cover the fixed region by cubes of side anchored at . By (4), each cube contributes at most , and their total volume tends to as . Letting first and then , we get
Use the gap coordinates
The Jacobian is , with and . For the condition is
Thus
| (4.22) |
For , put and ; the two conditions become
For the -interval has length , and the density in is . Hence
| (4.23) |
Multiplying these volumes by gives and , respectively. ∎
4.7. The mass lower bound
Proposition 4.9.
Put
| (4.24) |
Then
| (4.25) |
5. Duality
For even , put
| (5.1) |
Both integrals are real, since the arcs are invariant under and the coefficients are real. If is not a sum of two primes, then
| (5.2) |
This follows term by term from (3.9). For and we also have
| (5.3) |
Proposition 5.1.
Let be the exceptional even integers in . Suppose that for every even in this interval, and that . Then
6. Minor arcs
This section is unconditional. For intervals put
We first bound these sums uniformly in .
6.1. Rational approximation and bilinear estimates
For , Dirichlet’s approximation theorem gives coprime with
| (6.1) |
A denominator would place on a major arc, since . Thus
| (6.2) |
(F4) [9, Lemma 2.2] If and , then
Lemma 6.1.
Let , and let be an interval. Then
| (6.3) |
If , then
| (6.4) |
Proof.
The inner sum in (6.3) is a geometric progression with modulus at most , so (6.1) applies. For (6.4), apply Cauchy–Schwarz in . For fixed , the conditions restrict to an interval. Group the off-diagonal terms by ; the second estimate in (6.1) gives
where denotes the left side of (6.4). Since , this proves (6.4). ∎
6.2. Exact separation of comparisons
Let , and let be the indicator of modulo . Fourier inversion gives, for integers ,
| (6.7) |
where . The norm bound follows from the geometric-sum bound . Consequently, for ,
| (6.8) |
If is integer-valued, then
| (6.9) |
These identities include equality at each endpoint, and each separated comparison costs .
6.3. The stopped Legendre identity
Lemma 6.2.
Let be a positive integer, and let . Then
| (6.10) |
where . Every term in the second sum has .
Proof.
Iterate
The selected primes decrease strictly, so their product is squarefree. Expand a node precisely when . At a stopped node, and . The terminal terms give (6.10). The rule depends only on , and no restriction is placed on repeated prime factors of the residual. ∎
6.4. The eight retained families
Proposition 6.3.
Uniformly for and intervals ,
| (6.11) |
Proof.
We use the eight terms in (3.7); the four discarded families require no exponential-sum estimate.
The families . For the sums have the form
where , with when . Here depends only on , which is -rough. Apply Lemma 6.2 and put . The rough and smooth parts of determine uniquely, so the resulting coefficients have modulus at most . The free terms have and contribute by (6.3). The stopped terms are
Here . Split into intervals with ; then . By (6.8) and (6.6), the total is .
The family . Write and . The prime conditions are
Apply Lemma 6.2 with anchor to the residual in ; the anchor is not . For free terms the outer variable is . Its rough part determines , and its smooth part determines , so the coefficient is bounded by . The inner variable is free on . Since ,
These terms contribute , for both conditions on .
For stopped terms, put , , and . Since , we have , and the sum becomes
| (6.12) |
Here includes the stopping condition, and the rough part of is . Also
The correspondence is bijective, since is determined by ; this remains true when . Put
In , is the ceiling function, and is subtracted after rounding up. Set these to zero where . All three are integers in , and
| (6.13) |
Separate the roughness condition by (6.8) and each comparison by (6.9). For fixed , the two coefficients are
Their moduli are at most and , since . With two Fourier norms and dyadic intervals, (6.6) now gives for (6.12).
The families . Each has the form
The ordered prime factorisation of determines the prefix conditions. For , the condition follows from . The residual satisfies , and one Fourier separation with dyadic intervals gives .
All Type I outer variables are below . Both variables in every Type II piece are , and the underlying products place them in up to endpoint constants. Adding the eight estimates proves the proposition. ∎
Corollary 6.4.
Uniformly for ,
Proof.
Partial summation gives
Its modulus is at most times the largest prefix sum, and Proposition 6.3 applies. ∎
7. Bilinear distribution with both maxima
Lemma B.
Let be large, , , and . Let . Suppose that satisfy the following conditions. Their supports lie in and , respectively, and consist of -rough integers greater than . Their coefficients have modulus at most . For some , every , and real satisfy
| (7.1) |
Put . For ,
| (7.2) |
The implied constant depends only on . In particular, for and , take and . Then the left side is .
(F5) [1, Chapter 17] For , , and ,
(F6) [4, Theorem 7.13] If is supported on consecutive integers, then
The star restricts the sum to primitive characters.
Proof of Lemma B.
We may assume that both sequences are nonzero and , since otherwise all prefix sums vanish. Roughness gives
| (7.3) |
For in the support, , hence . Write
Orthogonality and induction. The principal character gives the exact coprime mean in . Therefore
| (7.4) |
Let be induced by a primitive character modulo , and write . For all integers ,
No coprimality condition between is required. Put and . The induction is a bijection onto the pairs with , . Since ,
| (7.5) |
We split this sum at .
Small conductors. Only here do we remove the restriction . Since , at most four primes at least divide , and for each such prime at most products occur. Thus, uniformly in all cutoffs,
For , expand by reduced residue classes. The primitive character is nonprincipal, so (7.1) gives
Summing over gives , and there are at most primitive characters. Using , we obtain
| (7.6) |
Perron’s formula and the maximum in . Put and . Every prefix can be represented with a half-integer . The convolution is supported in , and its absolute mass is at most . For the relevant , and , so (B) gives a uniform error . Define
Then
Since for large , any finite character family satisfies
| (7.7) |
The same argument applies with positive character weights, and it keeps the maximum inside the sum over characters.
Large conductors. The intervals , where , , cover every conductor greater than . Fix , one such interval, and . Cauchy–Schwarz with weights , followed by (B), gives
The weighted Perron error is . Sum (7.7) over and these intervals; the endpoint terms form geometric sums. Using (7.3), we get
| (7.8) |
Equations (7.6) and (7.8) prove (7.2). With the stated choices of , both logarithmic terms are , and the remaining three terms have a fixed power saving. ∎
7.1. Siegel–Walfisz estimates for prime boxes
Lemma C.
Let . For , where , the left side of (7.1) is , uniformly for , and real .
Suppose satisfies (7.1) with scale and constant . If is supported on and , then satisfies it with scale and constant . Restricting any such sequence to multiplies its constant by at most .
Proof.
For large , , so every prime in is coprime to . Put . The discrepancy is zero for . For it equals , and for it equals ; the left limits preserve both half-open endpoints. All arguments satisfy , so for large we have , and (7.1) applies.
For the convolution, fix in the support of . If , neither the reduced residue sum nor its coprime mean contributes. Otherwise the residue for is , and we apply (7.1) at the cutoff . The errors sum to at most
The main terms give the coprime mean of the complete convolution. Finally, a dyadic restriction is the difference of two prefix sums. ∎
8. Distribution of the signed weight
Proposition 8.1 (Distribution of the signed weight).
For every ,
| (8.1) |
Both maxima in (2.9) remain inside the modulus sum. This estimate is unconditional.
8.1. Marked prefixes on the full support
Extend each discarded family to all positive integers . Use the prefix conditions in Table 3.1, including , and the residual . Write their sum as , and put
On this equals the sum of the four losses. It is supported on -rough integers with , and
| (8.2) |
For each four-prime prefix, the three possibilities are disjoint.
Let be squarefree, with . Put and . A marked prefix has residual roughness at its smallest selected prime. This holds precisely when that prime is , also when the residual is . Thus , where
| (8.3) |
In particular, and . For , let consist of the hyperplanes
| (8.4) |
These form a fixed finite rational arrangement. Off it, is constant in each component of the strictly ordered cone, and the bound holds there for .
8.2. Initial reductions and single primes
Partial summation and (2.10) give
| (8.5) |
We split into squarefree and nonsquarefree parts and add the divisor weight last.
(F8) [1, Chapter 28] For every , some satisfies
| (8.6) |
Since , this covers all required moduli. Prime powers contribute per modulus. Partial summation converts prime logarithmic sums to prime counts and retains the maximum in . The modulus case controls the corresponding total prime count. Removing primes that divide costs , so the three conversions have total cost
Consequently, for every ,
| (8.7) |
Single primes are handled by this estimate; Lemma B is not used for them.
8.3. Absolute-coordinate cubes
Fix . Put
For , use cubes
| (8.8) |
Let and
Every prime is at least , the box ratio is , and there are cubes. An interior cube has closure disjoint from all hyperplanes in , and every other cube is a boundary cube. Only dimensions are used, since the discarded weight vanishes when .
For an interior cube, the prime boxes are pairwise disjoint and ordered, so unique factorisation gives . It is precisely for the squarefree integers with and . Let be the constant value of on . Then, for every integer ,
| (8.9) |
The cutoff on the right is retained, and counts all admissible marked prefixes.
8.4. Distribution of each convolution
For any cube, including boundary cubes, split
Both sequences are supported on rough integers greater than , and their coefficients are bounded by and . Lemma C supplies (7.1) at every fixed level. For , use its prime-box assertion. For , convolve one prime box with the other boxes; the latter convolution has coefficients at most and bounded support ratio. All constants are uniform over the cubes.
We specify the dyadic endpoints. Put . The support of lies in , and we use the intervals
They begin at , so no integer at is omitted. Use two intervals anchored at for . Lemma C controls each restriction, and changing to the dyadic scale costs at most a factor . Lemma B therefore gives, uniformly in ,
| (8.10) |
The distribution estimate is applied to the full product before truncation, and the modulus remains throughout.
8.5. Boundary cubes and positive transfer
Define
Then and . Every relevant sorted vector lies in exactly one cube. Hence
| (8.11) |
Lemma 8.2.
If and , then
Proof.
Bound each of the two terms defining the discrepancy of by its absolute value, and replace by . The residue sum of is at most its coprime mean plus , and the two means are each bounded by . These bounds are uniform in the residue and the cutoff. ∎
By (8.10),
| (8.12) |
This includes cubes meeting the diagonals. For a term with prime boxes, split off one box as and put the remaining boxes in . The coefficients are at most , which is the bound used by Lemma B. The full convolution can have coefficients up to . There are no one-dimensional boundary convolutions.
Lemma 8.3.
We have
Proof.
A tuple in a boundary cube lies within distance , in the maximum norm, of some hyperplane in (8.4). Choose with , and fix the other primes, whose product is . The remaining prime lies in
This interval contains integers, and by (4),
for large . There are at most labelled tuples with product at most . The number of hyperplanes and dimensions is fixed, so summing proves the assertion. ∎
Using , the last two lemmas give
| (8.13) |
8.6. Repeated prime factors
The nonsquarefree part has modulus at most , and it is supported on for some prime . Fix . If , this divisibility is impossible in the reduced residue class. If , the Chinese remainder theorem gives
Summing over gives , and the coprime-average term is . Therefore
| (8.14) |
Repeated factors remain in the weight. This step counts multiples directly and needs no distribution estimate at modulus .
8.7. The divisor weight and the parameter choices
Since ,
The elementary divisor estimates
give
| (8.15) |
To prove them, expand over squarefree divisors and use ; the corresponding Euler products have logarithmic exponents and . Cauchy–Schwarz yields
| (8.16) |
9. Major arcs
Only this section uses . We first prove the prime-side mean square. The argument follows [7, Section 8], with the density exponents computed below.
9.1. Classical inputs
Let count, with multiplicity, the zeros satisfying and , summed over primitive characters of conductor at most .
(F9) [3, Theorem 1, p. 231] For ,
9.2. The prime-side mean square
On , put
| (9.1) |
The arcs are disjoint, so this defines on .
Proposition 9.1.
Assume . Let , and . Uniformly for ,
| (9.2) |
Proof.
Put , and , and write .
Character expansion. Every prime in is coprime to , since . For the character inducing ,
There is one exterior factor . For primitive , put
Short intervals. Apply (9.1) with , and let . Then
| (9.4) |
With empty intervals omitted, the three ranges are
The first has length at most .
The explicit formula. Put and . By (9.1), uniformly for ,
| (9.5) |
Here prime powers cost , the zeros with cost , and the truncation costs . The pole cancels the term up to . Constant terms cancel in the difference, and their logarithmic terms cost . Hypothesis and the functional equation keep all nontrivial zeros in , so every zero retained in (9.5) has
| (9.6) |
The squared error in the two end ranges contributes at most
The middle-range error is treated below.
Classes of zeros. Partition conductors into intervals with dyadic , including the initial interval to cover . For , , use the height intervals
Shared endpoints are assigned once. Also use , with . There are classes, and for each character. By (9.6), only occur. Within a class,
For one character the class contains zeros, and over all characters it contains at most , where
| (9.7) |
For the terminal classes , the value is valid because (9.5) already restricts to . We also have
| (9.8) |
The upper end range. For , the zero term is bounded by
Apply Cauchy–Schwarz first to the classes for one character and then to the zeros in one class. For fixed , its contribution after summing characters is
Summing all classes gives .
The lower end range. Here the window is , and its zero term is at most
Here is a power of with exponent . The numerator is a power of itself, with exponent .
The same calculation gives . This range requires the factor in place of .
The middle range. Partition it at , using . The final interval is truncated at , and every window remains inside . Write
For , the following estimate also bounds a truncated interval:
| (9.9) |
To prove it, for write
Average over and use Cauchy–Schwarz. In the first bracket substitute ; its contribution is at most times the maximum integral. In the second substitute ; its contribution is at most times that maximum. The common range is , and division by proves (9.9).
The unit-interval zero count in (9.1) gives for one character. The arithmetic-geometric mean inequality in each pair yields
Each zero contributes at most
Here is a power of itself. Since , the factor is at most the separate class factor in (9.7). We used and . Summing the class counts and the intervals gives the total zero contribution . The error in (9.5) contributes, per interval, , and after the interval and character sums it is
Combining the three ranges gives
| (9.10) |
Density estimates for the classes. Recall , and . First suppose , and use (9.1) with and . Then , and the exponent of is negative. Thus , where
| (9.11) |
The exact positivity condition is , and at its right side is .
Next suppose , and use (9.1). Here
The exponent of is . Consequently , with
| (9.12) |
The required margin is
| (9.13) |
For , use (9.1). The exponent of is nonpositive, and we obtain , where
| (9.14) |
The threshold has margin .
9.3. A variant without the first density estimate
9.4. The discrete pole and its kernel
(F15) [9, Lemma 2.8] Euler–Maclaurin summation gives .
On this is . Therefore
Its mixed contribution with is
| (9.17) |
Let and . The remaining pole term is
| (9.18) | ||||
| (9.19) |
This follows by integrating over . By (5.3), both arguments have positive gaps at least . Here, since is fixed and , we have for all sufficiently large . Differentiating (9.19) gives
| (9.20) |
On , each of and ranges within . Hence
The elementary estimates and give
| (9.21) |
We keep until the residue-class calculation is done.
9.5. Reduced residue classes
Only squarefree moduli contribute to (9.18). All non-squarefree arcs are already included in (9.16), since there and . In the rest of the pole calculation, is squarefree.
For , partial summation and (9.21) give
| (9.22) |
The bounded variation keeps a factor out of this estimate. For squarefree , multiplicativity gives
| (9.23) |
For a prime , use when , and otherwise; the Chinese remainder theorem gives the product identities. Consequently, the coprime part of (9.18) is
| (9.24) |
Proposition 8.1 bounds the error by , since it applies to this same weight, with both maxima, at level .
9.6. Non-coprime classes
The non-coprime part satisfies
| (9.25) |
If a summand is nonzero, some prime divides both . Since , there are at most four such primes in . Write . Squarefreeness gives and
Also . For the conditions and are coprime, and their count up to is at most . Thus, termwise in the absolute sum,
| RHS of (9.25) | |||
Using and , we obtain
| (9.26) |
If , sum . If , its contribution is at most , and at most ten primes at least divide . This proves uniformity in .
We next remove from (9.24). On the support of , at most non-coprime integers occur. For squarefree , write and . Then and
| (9.27) |
Together with , this bounds the removal error by
| (9.28) |
The divisor-bound exponent is arbitrary, so it absorbs the logarithm.
9.7. Completion of the singular series
The same squarefree factorisation gives, for every ,
| (9.29) |
For the first bound, use and sum over . For the second, use . These elementary estimates follow by expanding the factors over squarefree divisors. The resulting Euler products converge after the indicated logarithmic factor is removed.
9.8. The major-arc asymptotic and positivity
Proposition 9.2.
Proof.
Use (9.16) and (9.17), and evaluate the pole by (9.24) and (9.26). Then (9.28) and (9.29) give exactly the six errors in (9.31). At the stipulated ,
Each error is , and this conclusion does not require a sign for . ∎
Corollary 9.3.
Assume . For all large and every even ,
10. Proof of Theorem 2
Proof of Theorem 2.
Let and use (2.1). At each large scale , choose as in (2.4). Corollary 9.3 supplies in Proposition 5.1. Corollary 6.4 gives at the same , and both use the same signed weight . Therefore
Choose so that this holds at every scale at least , and apply it to with its own cutoff . The constants are uniform, and the geometric sum gives
Since , this is . ∎
11. Proof of Theorem 1
Appendix A The exact rational mass certificate
This appendix gives the finite arithmetic for (4.19). The regions are exactly (4.10), and the cell tests are (4.16) and (4.17). No limiting numerical integration is used.
A.1. Integer form of the cell weights
For a cell of dimension on the grid of size , put
Thus and . Write the rational envelope value as , using
| (A.1) |
Reduction to lowest terms is unnecessary, and (4.15) is exactly
| (A.2) |
For , take and ; the integer tests are
| (A.3) |
For , take and ; the integer tests are
| (A.4) |
These are the original rational cell tests after clearing denominators.
A.2. Readable rational upper sums
For each retained cell define the integer
| (A.5) |
Every cell weight is rational and nonnegative, so . Tables A.1 and A.2 list sums of these integers, with rows that partition the first-coordinate index . Each entry is obtained by the finite divisions and additions in (A.1)–(A.5).
| Retained cells | ||
|---|---|---|
| – | ||
| – | ||
| – | ||
| – | ||
| – | ||
| Total |
| Retained cells | ||
|---|---|---|
| – | ||
| – | ||
| – | ||
| – | ||
| – | ||
| – | ||
| – | ||
| Total |
The totals imply
| (A.6) | ||||
The positive differences after multiplication by are and . The final mass calculation uses the original upper bounds on the right; the slightly smaller table bounds are not used.
A.3. The four losses and the final subtraction
Table A.3 collects the rational coefficients of ; the volume calculations for are proved in Lemma 4.8.
| Family | Calculation | Upper coefficient |
|---|---|---|
| -grid rectangle sum | ||
| -grid rectangle sum |
Exact subtraction gives
In particular,
The envelope inequality is also certified rationally:
The accompanying script cert1120.py evaluates the original cell sums with exact rational arithmetic. Its output confirms the cell counts, the two upper bounds, the two volume coefficients and the displayed value of . The analytic reduction to these finite sums is proved in Section 4. The script checks only the arithmetic and supplies no asymptotic estimate.
Statements and declarations
Competing interests. The author has no competing interests.
Funding. No funding was received for this work.
Data availability. The rational certificate is specified in Appendix A. The accompanying script cert1120.py and its output reproduce the finite sums.
References
- [1] H. Davenport, Multiplicative Number Theory, 2nd ed., revised by H. L. Montgomery, Graduate Texts in Mathematics 74, Springer, New York, 1980.
- [2] P. X. Gallagher, Invent. Math. 11 (1970), 329–339, Lemma 1.
- [3] D. R. Heath-Brown, Canad. J. Math. 31 (1979), 231–240, Theorem 1 and Theorem 2(3).
- [4] H. Iwaniec and E. Kowalski, Analytic Number Theory, Section 3.4 and Theorem 7.13.
- [5] H. L. Montgomery, Topics in Multiplicative Number Theory, Lecture Notes in Mathematics 227, Theorem 12.2.
-
[6]
OpenAI, The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane
, OpenAI Math Release preprint, 30 September 2026,
family 003, Theorem 1.1.
Primary source PDF: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026/paper.pdf,
commit adc7f1241b42e322a6451854ab7e4b4c146bf78a;
PDF SHA-256 8fe93046f8cf5ef1ba5969c89addc02d76311adc4ee907509ff9cd96f7ec99e7. - [7] J. Pintz, A new explicit formula in the additive theory of primes with applications I. The explicit formula for the Goldbach problem and the Generalized Twin Prime Problem, Acta Arith. 210 (2023), 53–94, doi:10.4064/aa220728-31-3. Equation and theorem numbers cited here are from the preprint version dated 16 April 2018.
- [8] J. Pintz and I. Althöfer, The Goldbach exceptional set: an exponent and conditional refinement, preprint, arXiv:2610.15559, version 1 (11 October 2026), Theorem 1 and Corollary 2.
- [9] R. C. Vaughan, The Hardy–Littlewood Method, 2nd ed., Lemmas 2.2 and 2.8.