Theorem (1 + 1.75) on the Goldbach conjecture
Abstract.
Every sufficiently large even integer has a representation , where are prime, or prime, and . In the terminology of Li and Liu, this proves Proposition for . A weighted sieve combines thirteen signed row estimates with a switched upper bound. The directed comparison gives and . The exact margin enclosure is .
Key words and phrases:
Goldbach problem, sieve methods, primes in arithmetic progressions, automorphic forms2020 Mathematics Subject Classification:
Primary 11P32; Secondary 11N36, 11N351. Introduction
We represent large even integers by two primes and one factor. Write for the primes. Chen’s theorem represents every sufficiently large even integer as a prime plus an integer with at most two prime factors [5]. Paper II supplies the quantitative smaller-factor starting point and the signed sieve sums used here. We change the exterior and switched coefficients and add retained and sixth-sum gains. Table 1.1 lists their separate costs. We use the terminology Proposition introduced by Li and Liu [19, p. 2, (1.6)]. Runbo Li proved lower bounds for [29]; we do not use that result.
Cai established a small-prime variant of Chen’s theorem [4]. Wu developed Chen’s double sieve for Goldbach and twin-prime problems [30]. His later paper continues this double-sieve program [31]. Lichtman modified the linear sieve and studied bounds for the twin-prime counting function [20]. He also proved results on large-modulus distribution and Goldbach beyond the square-root barrier [21]. Maynard’s first paper proves large-modulus estimates for fixed residue classes [22]. His second gives well-factorable estimates in that setting [23]. His third treats estimates uniform over residue classes [24]. Pascadi studies exponents of distribution for primes and smooth numbers [28]. Li and Liu proved Proposition , with a lower bound for [19, Theorem 1.1]. The present proof does not use their estimates.
Theorem 1 (Representation theorem).
Section 5 proves the retained comparison (A1) of Table 1.2. Section 6 proves the sixth-sum estimate (A2). Section 7 proves the exterior comparison (A3). Section 8 proves the switched comparison (A4). The constant bounds (A5) follow from the cited Paper I and Paper II estimates, including Paper I, Theorem 2.6, (2.31) [26, Theorem 2.6, (2.31)]. Hence a rational as in the theorem exists; may be ineffective.
The proof uses Paper I, [26, Theorems 2.6, 2.8, 3.2 and 4.1], and Paper II, [27, (1.7)–(1.12), (6.4)–(6.4d)]. We restate each input below with its precise scope.
1.1. A positive count
1.2. The comparisons
Use the sums of Paper II [27, (1.7)–(1.11)]. Put
| (1.5) | ||||
Here is the complete Paper II sum. All original coprimality conditions remain imposed. The last sum counts each eligible ordered prime pair; both orientations are counted only when both satisfy the displayed cutoff, and a square is counted once. Here and in Section 4.
Write for Paper II’s sixth upper endpoint [27, (6.1), (6.3a)]. For the optional sharper arithmetic comparison, record
| (1.6) |
Both the exterior and switched comparisons use the common coefficient
| (1.7) |
Its definition and source comparison are (7.36) and (7.67). Put
| (1.8) | ||||
The two mass constants are
| (1.9) | ||||
These are Paper II, (A.10d) and (4.84), respectively [27, (A.10d), (4.84)]. The constant bounds the switched integral. It differs from the packing ceiling . The exact rational is (8.60), with Table 8.1. It and belong to the optional certificate comparison only; neither is used to price the main count. The sixth-sum comparison uses the certified floor . The integral gain is denoted , with certified enclosure in Section 6. Thus is rational and . It is neither the integral nor its central estimate.
The required comparisons are
| (1.10) | ||||
These errors are nonnegative by (5.2), (6.72) and (8.71); the first includes the inherited envelope . Use the following error identifications:
| (1.11) | ||||
Here is (4.12). The switched quantities are (8.61) and (8.71). Their estimates form input (A4). The retained error includes the conversion errors:
| (1.12) | ||||
The row set is defined in (5.2). Its two qualified labels denote ’s lower part and retained . The inherited error is (5.11); the saved-array contribution is included once, as in (5.2). The differences are (5.22). The conversion arrays are (5.35) and (5.56); the equivalent notation and is fixed in (5.3). The saved-array identifications and conversion bounds are proved in Section 5, as part of (A1). The two finite integral bounds are Propositions B.1 and B.2.
The exterior estimate required is
| (1.13) |
Its convolution input is Paper II, [27, Lemma 5.1, (5.44)–(5.52)].
Define the constant by
| (1.14) |
Table 1.1 records each summand. Its decimals are rounded; the defining formulas are exact.
| Component | Value | Definition |
| (1.8) | ||
| (5.25) | ||
| (1.8), (1.9) | ||
| (1.8) | ||
| (1.14) | ||
| (1.8) | ||
| (1.14) | ||
Suppose the optional six-endpoint estimate is available. Then Proposition 5.10 would add of (5.18) to the retained comparison. The assembled retained-count lower bound below would then increase by . Theorem 1 does not use this. Let
| (1.15) |
Adding the established comparisons gives
| (1.16) |
By (A1)–(A5), Proposition 9.1 proves
| (1.17) |
Table 1.2 lists the five inputs, their exact statements and their contributions to the final constant. The first-line source count in (1.10) is (4.13), valid for . Lemma 9.2 gives .
| Input | Exact statement and use | Contribution and error |
|---|---|---|
| A1 | Retained comparison (5.2) with replaced by , Proposition 5.10, at ; used in line 2 of (1.10); proved in Section 5. | ; error . |
| A2 | Proposition 6.12 at , giving the sixth-sum estimate (6.72) of Proposition 6.13; used in line 3 of (1.10). | ; error . |
| A3 | Proposition 7.4 at , giving the exterior estimate (7.67) of Proposition 7.5; used in (1.13). | ; error . |
| A4 | The sieve data and the estimates (8.8), (8.53) and (8.62) of Section 8 for the source (8.3), at , giving the switched estimate (8.72) and the limit (8.73); used in line 4 of (1.10). This application uses Paper I, Theorem 2.8, at its stated inner spectral stage. | ; error . |
| A5 | The constants in (8.25) and in (7.39) are finite, positive and independent of and , and . | Fixes the caps in (9.14). |
The constants and are distinct. Here is the common maximum of the switched and Paper II sieve constants. The four-row K2 error constant is .
The exact constants satisfy
| (1.18) | ||||
The last constant is defined in (9.26). The rational bounds are shown in Section 9. They need the stated analytic comparisons; the arithmetic alone gives no positive-count estimate. The value is a scalar diagnostic for this fixed . It does not prove the theorem for smaller ; that would require comparisons at a different cutoff. The optional sharper scalar comparison (9.29) uses a separate constant ; it does not enter the main count.
1.3. Order of the parameters
Fix and all absolute error constants first. Choose one sufficiently small rational . Then put . Freeze the finite partitions and all coefficient bounds next. Fix every logarithmic precision before the common threshold. Thus the order is
| (1.19) |
The common threshold is defined in (2.5). It includes every length, structural and error threshold. Every limit is taken at fixed . These thresholds exist by (A1)–(A5) and Proposition 9.1. The final section combines the comparisons and the error bounds. For the main construction, the comparison estimates used are:
-
(1)
(A1): the actual retained-source comparison in Section 5, including all saved-array conversions. It supplies beyond the original retained bound.
-
(2)
(A2): the sixth-sum distribution and coefficient estimates in Section 6, supplying .
-
(3)
(A3): the actual semiprime-source distribution, principal-term and peel estimates in Section 7, giving the exterior cost .
-
(4)
(A4): the switched-source comparison, packing, distribution and peel estimates in Section 8, giving .
Each requirement includes its exact nonnegative error estimates and the fixed- limits allocated in Section 9. The source-counting identity and pointwise bound are supplied in Section 4. The list only records dependencies. The cited sections prove the estimates, with precise scopes and error bounds; the scalar arithmetic here combines them.
The use of AI tools is described at the end.
2. Notation and parameters
All logarithms are natural. Put . The integer is even throughout. Table 2.1 fixes the common notation.
| Symbol | Meaning |
| The set of primes. | |
| Euler’s totient and divisor function. The inherited notation has an integer argument; the scalar has none. | |
| The Möbius function; use for the sieve cutoff. | |
| Prime factors counted with multiplicity. | |
| Least prime factor; . | |
| Indicator of . | |
| Euler’s constant, with . | |
| Representation exponent and smaller-factor cutoff. | |
| Fixed truncation parameter. | |
| Fixed sieve exponents in (2.1); cutoff . | |
| Normalizations in (2.2). | |
| Partition parameters: , . | |
| Their fixed choices for the final argument. | |
| Transfer parameters in (2.3). | |
| Fixed total error bound, . | |
| The parameter in the factor-partition theorem. | |
| Profile displacement ; in (5.1), . | |
| Local sieve parameters, ; applications use . | |
| The level margin, ; separate from and . | |
| In (1.1), is prime and is either or prime; other uses are locally bound variables. | |
| Optional sharper coefficient and the logarithm in (1.6). | |
| Common K2/L3 coefficient in (1.7). | |
| Error constants in (8.25) and (7.38). | |
| The logarithmic Siegel–Walfisz level and the K2 and L3 coefficient bounds; each is local to its stated application. | |
| The signed sum in (1.5); elsewhere is a local level or remainder. | |
| Equal signed source sums; see (4.5). | |
| Arithmetic source weight and spectral operator, respectively. Neither denotes . | |
| Equal switched-integral bounds, . | |
| Equal packing ceilings, . | |
| Original Paper II lower constant and sixth upper endpoint; (1.8), (6.59). | |
| Certified floor , used in (1.14). | |
| Complete retained error and inherited envelope; (1.12), (5.11). | |
| Retained conversion differences, defined in (5.35) and (5.56). | |
| Joint-profile gain and conversion difference in (5.56). The spelling in subscripts denotes the same group. | |
| Nonnegative complete errors in (1.10)–(1.11) and (1.13). | |
| Their total, including , in (1.15). | |
| The constant in (1.14); evaluated in (9.1). | |
| Shifted-prime source, admissible factors, positive count and exterior count in (1.3), (1.5). | |
| Paper II arithmetic sums retained in (1.5); definitions in Section 4. | |
| Integral gain and its smaller rational floor; only the floor enters . | |
| Optional six-endpoint gain, shifted-profile gain and mass constants; the main proof sets , see (5.18), (1.8), (1.9). | |
| Switched gain . | |
| Common unshifted K2/L3 functional; coefficient cap ; optional sharper upper certificate ; its exact coefficient in (8.60). | |
| Retained row set and saved-array contribution in (5.2). | |
| Pointwise exceptional set and error in (4.9), (4.12). | |
| Common threshold, numerical floor and named threshold requirements in (2.5). | |
| Buffer , scalar endpoint and its exponential in (9.26). | |
| K2 source-weight bound in (7.38) and Paper II bound ; these are distinct. | |
| K2 error multiplier, peel multiplier and vanishing remainder in (9.8). | |
| Switched error multipliers and positive remainder in (8.61), (8.71). | |
| and Paper II’s fixed error allowance in (9.15). |
Cusps carry the index in spectral sums. The switched blocks carry the index . Partition cells are or . Coefficient sequences are , with dummy indices interchanged when needed. Spectral moduli and cusp numerators are locally bound variables. They do not redefine the constants and . Packing coordinates also have local scope. Bare and are local endpoints or weights; the named saved and root-A scales are , and . The exponent in distribution estimates is a logarithmic precision. The normalization factor is written .
2.1. Fixed parameters
Keep from (1.2). The sieve parameters are
| (2.1) | ||||||||
These follow Paper II’s notation [27, (1.5)]; is in [27, (1.3)]. Put
| (2.2) | ||||
We often suppress the argument .
Define the transfer parameters by
| (2.3) | ||||
Here is the exponent on the larger prime in the bound for the smaller factor. The transfer argument appears in the final section.
2.2. Order of choice
First fix all -independent constants in the estimates. These include in (8.25) and in (7.38). Then choose one rational , with
| (2.4) |
The final section gives the remaining upper restrictions. Apply every partition estimate with . Freeze its finite partitions and coefficient bounds next. Freeze the resulting finite-family bounds and logarithmic precisions too. These choices precede the common threshold.
Use the following named thresholds. Each requires its listed statement for every even above it, at the fixed . The cited comparison propositions establish these statements. The numerical floor supplies none of them. The resulting threshold exists but may be ineffective.
- (1)
-
(2)
: the retained comparison, saved-array identifications and nonnegativity of in Section 5.
- (3)
- (4)
- (5)
-
(6)
: all scale-conversion, zero-mode, factorization, packing, interval-length and logarithmic-precision conditions of the preceding applications, with the fixed finite partitions. In particular, require , , (7.61) and (8.46), and include from (8.75). The remaining application conditions are exactly those of the cited comparison propositions. The floor implies none of them.
-
(7)
: respectively the eventual bounds
All arguments are , or for .
These are finitely many requirements after all finite choices. Define the common threshold once by
| (2.5) | ||||
The floor is a convention added to Paper I’s selected-interval length hypothesis [26, §3.2, length hypothesis preceding (3.12)]. It proves none of the listed estimates. The named application estimates establish this threshold. The resulting may be ineffective.
This implements the order in (1.19). Afterwards, is even and .
Let be a real- or complex-valued error function. Write if and only if
| (2.6) |
All preceding fixed data are suppressed here. The parameter remains fixed in this limit. Uniformity in other variables is stated with each estimate.
3. Classical inputs
We use counting-measure norms. Write for . The symbols have their usual meanings. Write for the divisor function. The parameters in each fact are local. Put and . Statements (P1.x) and (P2.x) restate results proved in Papers I and II, respectively, with their original scope. The structured sieve result is Paper I, Theorem 2.6. Its classical source is Iwaniec’s Theorem 4 [13, Theorem 4]. The -form displayed below specializes the estimates of Paper I, Theorem 2.6. It follows from them by and . Theorem 4 does not state it verbatim. Each new application needs its own coefficient, support and uniformity checks.
Fact 3.1 ((F1) Prime estimates).
For every , one may take in
| (3.1) |
For fixed , uniformly for ,
| (3.2) |
These are Paper I, (2.20)–(2.21) [26, (2.20)–(2.21), p. 9]. The endpoint is fixed. The second constant is ineffective.
Fact 3.2 ((F1′) Maximal-endpoint prime estimates).
Use the prime Siegel–Walfisz estimate (3.2). For every fixed and , put . Then
| (3.3) | ||||
Here for . The level is imposed at ; the endpoints may be chosen separately for each modulus. An interval difference costs at most twice the bound. This is the classical maximal form of Bombieri–Vinogradov [6, Chapter 28]. Removing prime powers and partial summation pass from the von Mangoldt form to the prime-counting form. The constants may be ineffective through (3.2).
Fact 3.3 ((F2) Full-support bilinear distribution).
Let have supports . Assume , set , and fix . Assume . For every , assume uniformly in and integers with that
| (3.4) |
Define
For every , some gives
| (3.5) |
Both sums use the full supports. The constants depend on the family constants . This follows from the proof of BFI Theorem 0(b) [3, (A1)–(A2), p. 206; Theorem 0(b), (1.5), p. 212; proof, pp. 213–214].
Proof.
Character orthogonality and primitive induction give
| left side of (3.5) | |||
Define similarly. Split at . Since , large gives . This permits the small-conductor estimate. The hypothesis handles . The multiplicative large sieve handles . Before summing , the bounds are
Choose with . In the large-conductor bound, summing costs one more logarithm, since . Take , , and . Since , these bounds prove (3.5). The large sieve is BFI (1.6), p. 207, restated in Paper I, (2.19) [3, (1.6), p. 207][26, (2.19), p. 9]. ∎
We do not use BFI86, Theorem 0(a).
Fact (F2) is the standalone full-support bound. Section 8 checks the coefficients, relative levels and rough factors of the first three switched rows on the actual source.
Fact 3.4 ((F3) The spectral gap).
For every congruence subgroup ,
| (3.6) |
Here is the smallest nonzero Laplace eigenvalue. The implication applies to every eigenvalue of on in the indicated range. The first bound is Kim–Sarnak [17, Appendix 2]. The implications are elementary.
Fact 3.5 ((F4) Deligne’s bound).
Let be a primitive holomorphic cuspidal newform. Assume , integer weight , level , and character , with on . This agrees with Deligne’s convention . For , Deligne proved
| (3.7) |
[8, Théorème (8.2), p. 302]. The same source states that the roots of both have modulus . Since , we have and likewise for . With , this gives
| (3.8) |
Choose , . Then is real and . With , the polynomial becomes
Write , . The normalized roots are , also in the repeated case . An earlier exposition of the modular-form setting is [7].
Fact 3.6 ((F5) Averaged Kloosterman sums).
For and ,
| (3.9) |
[9, Theorem 14, equation (8.13), p. 275]. The sums run over integers , , and . Here .
Use the trivial character on . The sum over runs through a Petersson-orthonormal basis of . The sum over runs through an orthonormal basis of Maass cusp forms, including exceptional forms. The sum over runs through inequivalent cusps with width-one scaling matrices. The measure is . At infinity, the DI coefficients satisfy
| (3.10) | ||||
For , set . See Paper I, (2.2)–(2.4) [26, (2.2)–(2.4), p. 5].
Fact 3.7 ((F6) Spectral large sieves).
For , define
| (3.12) | ||||
The value at is the removable limit.
Fact 3.8 ((F7) Corrected same-cusp trace formula).
Fact 3.9 ((F8) Mixed-cusp formulas).
For , , use the trivial character and
DI82 (1.6), p. 224, gives the arithmetic identity [9, (1.6), p. 224]
Here and . The accompanying trace formulas, proved in Paper I, are
Here . The plus terms have the definitions in (F7), with their second coefficient at . For and , replace by and by only in the second Fourier coefficient. The cusps are singular, and the scaling matrices have width one. The classical width of is . For they are inequivalent. The normalization is that of Paper I, (2.13)–(2.14). Compare [10, Lemmas 4.3, 4.5, (4.7)–(4.19)] [26, (2.13)–(2.14), p. 8].
Fact 3.10 ((F9) Bessel representations).
For , , and ,
The infinite integrals are improper. These are DLMF (10.9.2), (10.9.8), and (10.32.7) [25, (10.9.2), (10.9.8), (10.32.7)]. Paper I uses them on printed p. 20, (2.7.T31)–(2.7.T32).
Fact 3.11 ((F10) Kontorovich–Lebedev inversion).
For on , the inversion pair is
It holds under either of two conditions. (a) , with and absolutely integrable. (b) Local piecewise continuity and bounded variation, with
Under condition (b), the inverse equality is asserted at continuity points of . In our applications, the inverse equality is used only at continuity points of . See DLMF (10.43.30)–(10.43.32) [25, (10.43.30)–(10.43.32)]. These hypotheses hold for , . They also hold for when . Near zero, , so the first integral in condition (b) converges absolutely. At infinity, , so the second converges too. Both functions are smooth on compact subintervals.
Fact 3.12 ((F11) Hecke operators on the full space).
For trivial character and , Paper I proves
Their proof uses the orthogonal cuspidal representation decomposition of Jacquet–Langlands, Chapter III, §16 [16, Chapter III, §16]. It also uses the holomorphic oldform classes of Atkin–Lehner [1, Lemmas 6, 13–15; Theorems 3(i), 5]. Atkin–Lehner’s weight means classical weight . For an unramified normalized newform, the algebra needed is
The Maass Satake bound is [17, Appendix 2]. The holomorphic bound is (F4). Full-space diagonalization and unitary transport give the displayed norms, as in Paper I, (2.7.T37)–(2.7.T40) [26, (2.7.T37)–(2.7.T40), pp. 21–22].
Fact 3.13 ((F12) Eisenstein inputs).
Paper I uses three classical Eisenstein properties. The Eisenstein family has a meromorphic continuation, which allows compact Fourier-coefficient extraction. It has an arithmetic Fourier normalization. There is a complete irredundant cusp set. For the cusp , let be the lower-row denominator variable in and write the printed variable as . The printed denominator is therefore , and the Fourier phase changes with this sign choice. Thus replacing by changes the congruence and the phase together, not one sign in isolation. The normalization includes the orbit conditions
With , the last condition is . The cusp set has the form
with admissible lifts chosen coprime to . The sources are Iwaniec, Chapter 6 and Theorem 3.4; DI82 (1.17), Lemmas 2.3 and 3.6; and Kiral–Young, Proposition 3.1 and Corollary 3.2 [15, Chapter 6; Theorem 3.4] [9, (1.17), p. 227; Lemma 2.3, p. 240; Lemma 3.6, p. 247] [18, Proposition 3.1, Corollary 3.2]. These are the conventions used in Paper I, (2.7.T20)–(2.7.T24) and (2.7.T41)–(2.7.T43) [26, (2.7.T20)–(2.7.T24), (2.7.T41)–(2.7.T43), pp. 18–19, 22–23].
Fact 3.14 ((F13) Further spectral estimates).
For exceptional eigenfunctions, the first line below follows from (F3), since and . Paper I derives the interval estimate from (F5), (F6), (F7), (P1.1) and this first line. The last line is its supported imaginary-transform estimate:
| (3.14) |
The last line uses the supported test class of (P1.1). The interval argument uses DI82’s proof of Theorem 7, (8.17), with the corrected same-cusp normalization (F7) [9, proof of Theorem 7, (8.17)] [26, (2.9), (2.7.T32), pp. 6, 20]. The weaker gap is also DI82, Theorem 4, p. 232, which we do not use separately. The reconstruction of the last estimate uses (F9).
Fact 3.15 ((F14) Transform identities and interchanges).
Paper I proves the following identities and accompanying interchange bounds in (2.7.T26)–(2.7.T32). Use the transforms (3.12) without rescaling. For , put
| (3.15) |
By (F10), the KL hypotheses hold for both applications, to and to . For the latter, the product-integral condition is , with . The permitted are real or exceptional, . The differentiations and contour, limit, sum, and integral interchanges in (2.7.T26)–(2.7.T32) hold in these ranges. This includes absolute summability after the spectral estimates. For each fixed smooth test family, the decay bound is
Let . The integrations by parts and differentiated estimates retain the five-derivative seminorm of (P1.1), uniformly in every auxiliary parameter. For the following bounds , and the oscillatory kernels are the normalized combinations in (3.12); these estimates are not assertions about an unnormalized tail. The hyperbolic factor in the raw Bessel representation is cancelled only after this normalization. For truncated normalized oscillatory representations, the tails are bounded by
These tails permit the stated limiting interchanges. The derivative and decay constants are uniform in the families consumed by Theorem 2.8, with the losses prescribed there. The first inversion identity follows from (F10). The product integral, second kernel identity, and uniform differentiation and interchange steps are proved in the same passage [26, (2.7.T26)–(2.7.T32), pp. 19–20]. A reconstruction from the individual Bessel representations uses (F9).
Fact 3.16 ((P1.1) Supported real transforms).
For , let and set . Then
| (3.16) | ||||
The constants are absolute. The minimum at is . This is the real-parameter part of Paper I, (2.7.T31) [26, (2.12), (2.7.T31), pp. 8, 20]. The real-transform bound uses exactly the Bessel representations in (F9). It does not cover the imaginary-parameter or interchange steps.
Write for Euler’s constant. The continuous linear-sieve functions are normalized by
| (3.17) |
Thus and for . This is Paper I, (2.23), p. 10 [26, (2.23), p. 10].
Fact 3.17 ((P1.2) Structured linear sieve).
Let be a finite integer sequence with nonnegative multiplicities, let be a set of primes, and let . For a multiplicative function , set
| (3.18) |
Assume on , off , and . Suppose fixed and satisfy, for every ,
| (3.19) |
Fix , and . Define
| (3.20) |
Let consist of the finite tuples from this grid such that . Set
| (3.21) | ||||
Each of these sets has fewer than elements. There are coefficients and , , with , independent of , for which
| (3.22) | ||||||
The implied constant in the last line is absolute. The signed remainders are
| (3.23) |
and
| (3.24) |
Here imposes distinctness between the equal-label positions in Iwaniec’s construction. Unequal grid intervals are disjoint. The coefficients may depend on and these distinctness conditions. We do not claim that coefficients at different cutoffs agree. See Paper I, Theorem 2.6, (2.22), (2.24), (2.27)–(2.33), pp. 10–12 [26, Theorem 2.6, (2.22), (2.24), (2.27)–(2.33), pp. 10–12]. Its classical source is Iwaniec, Theorem 4 [13, Theorem 4].
Below, the prime set is . Take the nominal density on , elsewhere and for . Then the second sum in (3.19) is zero. Mertens’ product estimate gives one fixed absolute with
| (3.25) |
The first product in (3.19) is no larger than this product. Hence , are valid for this nominal density. The factor in (3.22) is then . See [26, pp. 10–11]. Each actual sequence still needs its own decomposition (3.18) and error estimate.
For every relative level we use, exactly as in Paper I, (2.33a)–(2.33b), p. 12 [26, (2.33a)–(2.33b), p. 12],
| (3.26) |
Thus the prime intervals, the smooth-divisor support and the level all refer to the same . First fix . Then let tend to infinity.
Fact 3.18 ((P1.3) Finite factorization).
Let , , and . Assume . For every integer ,
| (3.27) |
This is Paper I, Lemma 2.7, (2.36), p. 13 [26, Lemma 2.7, (2.36), p. 13].
Proof.
For , set and . The polynomial identity gives
Every nonzero coefficient of has index greater than . The last term therefore has no coefficient at ; coefficient extraction proves (3.27). ∎
For , choose , . Then . Any interval partition is imposed after (3.27). The product condition and all representation multiplicities remain in the resulting coefficients. See [26, (2.36)–(2.37), p. 13].
For the packing theorem, put and define the packing ceiling by
Use this constant in the packing hypotheses below. Put
| (3.28) |
For , define
| (3.29) | ||||
These are the definitions preceding Paper I, Theorem 4.1, p. 53 [26, p. 53].
Fact 3.19 ((P1.4) Three-factor packing).
Let , , , and . Let be a finite labelled list. Equal values keep distinct labels. The empty list is allowed. Extend the list by zeros, writing for . Suppose
| (3.30) |
The rule of Paper I, Section 4.1, partitions the labels as . With and ,
| (3.31) | ||||
The partition depends only on these data. This is Paper I, Theorem 4.1, (4.1)–(4.3), pp. 53–54 [26, Theorem 4.1, (4.1)–(4.3), pp. 53–54].
Fact 3.20 ((P1.5) Continuous Hecke comparison).
Assume the three Eisenstein statements in (F12). Let , put , and let be a Dirichlet character modulo . Then Paper I, (2.7.T41)–(2.7.T43), gives
| (3.32) | ||||
The first identity initially holds for . The last extends meromorphically. For finitely supported in this coprime range,
| (3.33) | ||||
It holds almost everywhere in real , for either index sign [26, (2.7.T41)–(2.7.T43), pp. 22–23].
Proof.
In (3.32), write the modulus , where and every prime of divides . CRT factors the inner character sum as . Here is the corresponding finite Gauss sum and is the Ramanujan sum. The outer character supplies another . The coprime factor is
where omits Euler factors at primes dividing . For , its divisor sum factors at . Changing the Gauss-sum variable supplies . Absolute convergence for , followed by meromorphic continuation, proves the last identity in (3.32). At , the character multiplier is
Its modulus is at most . Orthogonality over the complete cusp set proves the inequality. ∎
Fact 3.21 ((P1.6) Exceptional parameters on the full space).
Apply (F3) to . Every exceptional eigenfunction in the full space then has
The bound depends only on the eigenvalue, so it covers oldforms. These are the parameters in Paper I, (2.7.T32), (2.7.T52), and (2.7.T56) [26, (2.7.T32), (2.7.T52), (2.7.T56), pp. 20, 24–25].
Fact 3.22 ((P1.7) The spectral estimate).
Paper I, Theorem 2.8, proves the estimate below. Its proof uses the large sieves (F6) and the trace formulas (F7)–(F8). It also uses the transform bounds (P1.1), (F13)–(F14), the full-space Hecke bounds (F11), and the continuous and exceptional comparisons (P1.5)–(P1.6). The normalized unitary cusp transport, proved in Paper I, (2.7.T33)–(2.7.T40), is as follows. Choose and use
| (3.34) |
The last line is the Maass normalization, with . For holomorphic forms use the normalized coefficients of (F11). These formulas fix the normalization of the following theorem.
Let and . Let satisfy . Let be supported on
| (3.35) |
Let be smooth, supported in , with
| (3.36) |
Set and . For every ,
| (3.37) |
where the inverse is modulo , and
| (3.38) | ||||
Here means that every prime factor of divides . It includes ; when , only occurs. The bound is uniform in . These are Paper I, Theorem 2.8, (2.38)–(2.43) [26, Theorem 2.8, (2.38)–(2.43), pp. 14–15].
Section 8 checks the masked coefficients, intervals and support of the fourth switched row.
4. Finite source identities and decomposition
Throughout this section, is an even integer with . Further size hypotheses appear at each display or just before it. Use from Section 2. We prove the finite identities of this section below. They count each occurrence with its multiplicity. The later analytic estimates are separate hypotheses. Use from (1.2)–(1.3) and from (2.1). Take the roughness cutoff from the Root–A scale definition in (6.1). Throughout, is a positive source integer. When , for a prime . In a source sum, is the integer being counted. The letters denote prime variables, is a positive modulus, and is the factor or cofactor specified by its sum. Paper-II counts use ; the marked count of Section 6 uses . These roles are local to the displayed source. Here counts prime factors with multiplicity. For squarefree with , define
| (4.1) |
Set this count to zero for other . For admissible , it is Paper II’s (1.7) count in our notation [27, (1.7)]. The zero value for other is our convention. Put . The tenth row uses
| (4.2) |
Table 4.1 lists all thirteen sums with every divisor and cutoff of [27, (1.6)–(1.7), row table]. All in the table are prime. Each admissible divisor contributes separately.
| Row | Coefficient | Divisor and domain | Cutoff |
|---|---|---|---|
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
|||
|
|
Let be the displayed divisor domain and its cutoff. Define the row occurrences by
| (4.3) |
Thus . Keep every cofactor and endpoint restriction. Define
| (4.4) |
This is the complete switched source of Paper II, (1.9) [27, (1.9)]. Every divisor prime and cofactor cutoff is at least . For the cutoff exceeds . Thus every vanishes when , so the extra roughness indicator of Paper II is redundant. Use as in Table 2.1. Finite linearity gives
| (4.5) |
4.1. The representation count
Put
| (4.6) |
When has distinct prime factors and both choices satisfy the first-factor cutoff, both orientations are counted. For , there is only the ordered pair . Hence
| (4.7) |
For the second inequality, write , , with both factors prime. If is excluded from , then
| (4.8) |
Prime squares are counted with their actual multiplicity.
Define
| (4.9) |
For ,
| (4.10) |
The prime divisors in the middle sum are distinct. Their number is at most .
Set .
Lemma 4.1 (Pointwise source weight bound).
For all , the weight bounds are
| (4.11) |
Proof.
Start from the roughness observation above. If , then . If , the coprimality conditions force every row occurrence to vanish. For and with , only occurs; only contribute, giving . For with , a prime has weight . For , with primes , the bands , , , and for give weights , respectively, directly from the row table. This agrees with Paper II, (1.11) [27, (1.10)–(1.11)]. Here is chosen so that and . Then the larger prime exceeds . The two-prime divisor rows vanish, since their products are below for – and below for –. These observations prove all three bounds, including the stronger exceptional bound with right-hand side zero. ∎
Put
| (4.12) |
The pointwise lemma gives for , within its stated scope. We still record cruder bounds. Summation gives
| (4.13) |
The transfer to is (1.4).
4.2. Signed arithmetic sums
Put
| (4.14) |
Then (4.5) gives
| (4.15) |
Define
| (4.16) |
Coefficient comparison gives
| (4.17) |
Substitution proves both equalities coefficient by coefficient. The coefficients and are fixed. The integer supports may overlap. These coefficient identities do not depend on later estimates. Take the signed normalized chains , their index set , and the stage index from Section 5. See its “original signed chains” paragraph and (5.4). Each already includes its signed normalized coefficient, so no extra multiplicity factor enters. Finite telescoping gives
| (4.18) |
This is the normalized-chain identity cited above. The arithmetic coefficient identities above keep their unnormalized definitions. Paper II uses joint endpoints for [27, (6.4)–(6.4d), pp. 70–72]. Here is Paper II’s stage-eight endpoint in the chain. The notation is a joint-chain label; it defines no new arithmetic sum. Their joint endpoint is kept before the differences are split.
4.3. A finite upper decomposition
Each original representation occurrence uses the shifted-prime set of :
| (4.19) |
The two arithmetic sources stay separate. Take from (7.2) and from the Section 7 definition (7.13); from (8.3); from (8.1); and from (8.6). The ordered prime coordinates and their prefix domains are those of (8.9) and the paragraph before it. Define
| (4.20) |
Here are the Section 7 source objects in . The objects are the Section 8 source objects in , , and . Both sequences are nonnegative. No extra factor enters. The script-font symbols , , , and denote the variable sieve families and their sifted sums. The fixed prime support is written . For , write for the corresponding line of , and put
| (4.21) |
Take from the Root–A definition (6.1). Take from (6.4), and from (6.6) and its preceding choice of fixed logarithmic exponents. Take from (6.52). Write for the level called in (6.6). This alias is distinct from every signed chain . We do not redefine these objects here. Both source comparisons require the finite threshold of Section 2. It enters the operative , the maximum of the sixth-sum comparison threshold and . We do not redefine it here.
Use the common choice from (2.4). It lies in the Section 7 range of (7.1), and the switched comparison uses it. Take from Section 7 (7.1); Section 8 uses the same values. We make no new choice or definition of here. Partition the logarithmic prime ranges into half-open intervals , with , . Clip the intervals at . Each prime has one cell. For , use the retained cells of the Section 7 retained-cell definition and the cutoff in . Write them as . For , use the Section 8 definitions and . Write them as . These definitions come from the two source sections. They form no common envelope in this section. We use no equality between the retained collections of the three sections. The closed-cell infima of Sections 7 and 8 and their endpoint rules apply only within their own source. For , the packing function is , as specified in (7.19). For , it is , as specified in (8.10) and its preceding definition of . The two functions are defined in Paper II, equation (2.17d), and the paragraph after it. We have only on the stated largest-coordinate range, and use no equality outside it. For either source write , with the lower endpoint of the third coordinate of its cell . Here is the object called in Section 8; we use only the source-indexed name. The Section 7 cutoff is defined in (7.18), with the lower-endpoint convention stated before (7.31).
The source index here is always . For the -source the underlying prime support is , so . Both sieve products use primes below not dividing . For the -source, the substitution identifies the generic sieve with of Section 7 on that source:
| (4.22) |
For , identify the generic cofactor sieve with the Section 8 sieve on precisely the following rows:
- •
-
•
, , with cutoff ;
-
•
, with dynamic cutoff , or retained-cell cutoff ;
-
•
on a retained cell, with , at cutoff or .
Here the empty prefix is , and all primes belong to and have the ordering in (8.9) and (8.11). Let be the displayed prefix or product . Every prime divisor of is at least , so . The definitions give . Write for the of Section 8 from (8.6) with . For , the Section 8 definition (8.6) gives
| (4.23) |
This identity holds on these rows only, not for arbitrary . These -terms are unnormalized source-restoration costs. The two source upper comparisons are stated separately: Here is the prime-occurrence part of , and is the removed-top cost.
Lemma 4.2 (Upper-source comparisons).
| (4.24) |
Proof.
We invoke the source comparison once, with the named hypotheses displayed above.
For real cutoffs , the least allowed prime gives
| (4.25) |
Write . If survives at but fails at , choose its least allowed prime in . Exactly one summand records that prime. Repeated copies remain in the cofactor. Thus the identity also counts prime powers correctly.
Three applications give
| (4.26) |
For , the sum is . The primes are ordered; no factorial occurs. Every multiplicity remains in .
For in a retained cell of source , put
| (4.27) |
The equality is (4.25). Nonnegativity proves the inequality. Actual cell membership gives . The closed infimum creates no additional occurrences.
Let restrict the ordered triples to , equivalently to . For either source define the peel terms
| (4.28) |
For each source , the non-retained depth-three terms are nonnegative and occur with a minus sign, so we drop them. The retained terms use the dynamic inequality above:
| (4.29) |
For even , define the two upper expressions and their slacks, one per source. The next comparison proves their nonnegativity:
| (4.30) |
Hence
| (4.31) |
These inequalities assume the two source comparisons in (4.24). They give no estimate for either restoration cost.
4.4. The conditional lower expression
Take from the Root–A definition (6.8), and with its comparison from Section 6 (6.9). We redefine neither object. This sum uses the ordinary upper Rosser weights with the odd-index cubic gates of . Their upper-sieve property is the Iwaniec upper-bound lemma [14, Lemma 1, (3.2), (3.6)] [13, Lemmas 2–3, p. 313]. This section introduces no new weight. The Section 6 comparison gives
| (4.32) |
For a mark , put and . For , the cited Iwaniec upper-bound lemmas give, for the upper Rosser divisor sum, [14, Lemma 1, (3.2), (3.6)] [13, Lemmas 2–3, p. 313],
Dropping enlarges the original nonnegative occurrence count. For even , each of exceeds . Hence take on, respectively, , , . These pieces partition the original source: belongs to , and the shared mark endpoint belongs to . Since , the mark is unique in . The condition is exactly . The original gates give . Summation gives precisely and , with all mark multiplicities. A product-cell partition only splits these exact sums. It must keep the original , the cubic gates and every clipped endpoint. In particular and keep the gates at . Subdivide each of the three marked pieces in (6.7) into cells in its two displayed coordinates. Let , and use half-open multiplicative intervals of relative width at most in each coordinate. Insert all row cuts, the points , , , and the two endpoints of as cell boundaries. Denote the resulting finite, disjoint cell families by . Use the separate piece index and the mapping
| (4.33) |
Thus each satisfies and , with on every included occurrence. Their unions are exactly the corresponding coprime marked source pieces , , and . A cell touching a boundary is kept as a boundary cell. For and , define
| (4.34) |
Here is , , or . The corresponding coefficient gates stay in the inner sum. The half-open families make every marked occurrence belong to exactly one , including and the shared mark endpoint. The one-term Rosser inequality at each occurrence gives , cell by cell. Reindexing the finite sums gives
| (4.35) |
The finite comparison uses these cellwise Rosser inequalities. Thus the displayed comparison is the sum of finitely many explicit cell inequalities. No product cell, endpoint, or boundary strip is omitted. The later complete-cell estimates and boundary-strip bound are quantitative inputs only and do not alter this finite identity. The three slacks below are cited or defined by the source comparisons above, before this substitution. Substitution in (4.15) gives
| (4.36) |
This equality follows from the source identity and the cited and local definitions. The Section 6 comparison (6.9) gives . The comparisons in (4.30) give . For even , (4.13) and nonnegativity of these slacks yield
| (4.37) |
The two expanded signs are
| (4.38) |
Use one bound for the complete . Paper II gives its coefficient-eight estimate [27, (1.9), (5.29)–(5.43)]; the Buchstab upper bound concerns the same occurrence. Sections 7 and 8 estimate these two five-term upper expressions (four principal rows and their peel term) separately. The displayed expansion fixes each peel term’s sign. The finite switched-source domination is already in the local identity above. The remaining distribution and quantitative estimates for this occurrence are separate hypotheses of the later bill. They lie outside the finite decomposition of this section.
4.5. The lower expression with the original
Keep the original throughout. Use , and from (1.8). Here is the switched integral bound. The distinct constant bounds the packing envelope. The complete normalized switched error is . The source-restoration error is unnormalized. The main route takes and excludes the optional six-endpoint improvement. Fix this common parameter and an even throughout the following conditional lemma. Take from (2.2), (1.12), and Section 5, and from (6.72). Use the complete switched and exterior errors from (8.72) and (7.67). The fixed constants are defined in (1.8) and (1.7).
Lemma 4.3 (Addition of the four comparisons).
Assume (4.11) and the following four inequalities. Write
| (4.39) |
Here denotes the original Paper II floor. The main route does not use the six endpoint replacements. Here , with denoting the lower part of and its retained part. Section 5 gives the hypotheses for this estimate.
The other three comparisons have the forms
| (4.40) |
All error terms are nonnegative.
Then the following normalized lower bound holds:
| (4.41) |
5. The retained side
Keep every original source of Paper II, including the complete sum . Fix satisfying Paper II, (1.27). Put
| (5.1) |
The choice of precedes the limit. Use from (2.2). Write for (4.14).
The comparison required in this section is
| (5.2) | ||||
In , indices and denote the lower and retained parts. Every displayed error is nonnegative. The notation agrees with (1.12):
| (5.3) |
The required limit is . Proposition 5.10 proves (5.2). Its inputs are listed in Remark 5.9. The six-endpoint lemma is optional: without it, the same proof gives (5.2) with replaced by . We display the unchanged comparisons first. Then we specify the five incremental and four saved-array conversion terms.
5.1. The original signed chains
Let index the signed chains of . Here is the set of Paper II’s nineteen row chains. The chain is Paper II’s outer chain for the upper part of [27, (2.28), (5.10), (6.1) and §6.1, condition 1]. For , let include its normalized coefficient. Paper II uses ten stages [27, (6.4)–(6.4d)]:
| (5.4) |
The initial expression is the actual arithmetic source. The last expression is a directed rational endpoint. For the stages are those of Lemma 5.1: is defined there for , and for . For the three joint groups, use
| (5.5) | ||||
The joint signs are kept before rounding. The weights are .
Signed sources and parent assignment.
Here “parent” records the assignment of an arithmetic occurrence and its source-restoration share. It does not assert that each Buchstab child is numerically bounded by the unsplit parent. Let be the nonnegative plain-source terms of Paper II, (2.19) and (3.2). Let be its signed source correction. Then
For every third-depth S1 occurrence, gives . For S2 we make this replacement only on Paper II’s selected whole- blocks , including and . There . On the strict complement keep the actual and Paper II’s strict-BV comparison. The last child of S2 keeps its negative sign on all three pieces , , and . The strict BV piece stays in S2.
For the fixed-cutoff rows use their literal divisor domains. Their signed sources are , , , , , and , respectively. On each source cell, an upper sieve bound gives when . A lower sieve bound gives when . These comparisons keep the source corrections and the row’s allocated errors. Paper II, (2.28), gives the exact assignment identity
The endpoint belongs to the upper/BV part. The split precedes the structured sieve or Heath–Brown expansion and keeps parent labels. S5-low and T5 both have parent S5. S5-low gets no restoration address of its own. For S10 the source partition is exact, with . Hence before its lower sieve bound.
The joint source keeps the representation weights . Paper II, (4.14), gives, with its stated exceptional-source and small-prime allowance ,
Make its cut-measure replacement with the original signed correction before applying (4.18). The four signed descendants of then have coefficients on the single weighted source. Their last positive term is bounded from below by its retained cells. The change from actual to label base keeps the signed peel correction of Paper II, (4.45)–(4.57). The four rows share one joint source parent and one restoration allocation. Thus S1, S2, S4, S5, S7, S10 and G1 are the seven parents of the sixteen listed retained rows. S3, S8 and S9 keep their original single-comparison parents, and T5 remains the upper part of S5. These are sign-correct source reductions for the complete parent chains. They do not discharge the distinct S6, bad-source or switched-source comparisons in Section 4.
The nineteen original row chains of are the sixteen rows of Appendix B.7 and Paper II’s original comparisons. The strict BV piece of lies inside the joint group. The source of is split at , , before any sieve step. Its lower part is the row -low of . Its upper part is the chain . The chains of and are excluded. Thus the endpoint sum over is
| (5.6) |
This follows from Paper II’s printed thirteen-term sum [27, §6.4, immediately before (6.6)]. Its joint endpoint is ; the printed sum uses . The term of (5.7) is , by Lemma 5.1. Apart from , every other term of (5.7) is an endpoint. It ends a chain of or a joint group. This is a finite coefficient identity. The printed sum is
| (5.7) | ||||
The letters denote the rational endpoints printed in Paper II, Appendix A.2–A.6 and (A.7), (A.10), (A.13)–(A.14). The constant keeps its rational definition:
| (5.8) |
The upper part of has the following outer chain. Put , , and let
| (5.9) |
which is Paper II’s directed upper endpoint for [27, (5.16), (5.20), (A.14)–(A.14a)].
Lemma 5.1 (The outer chain of the upper part of ).
Define
where the first sum is the second term of Paper II, (2.28), and is Paper II, (5.10). Then
with tending to at fixed . Both are entries of . In particular .
Proof.
Paper II splits at before the structured sieve or HB. The endpoint belongs to the upper part [27, (2.28) and the three lines after it]. The coefficient is .
Stage one. For a prefix , dropping the condition gives in the notation of Paper II, (5.9) [27, the sentence after (5.9)]. Prefixes are removed at their first failure. This is the error-table entry “Exceptional source factors”, of size [27, §6.3]. A prime equal to or divides [27, after (5.20)]. With the coefficient this gives the first inequality.
Stage two. Paper II applies the upper sieve (5.4) to each , . Its parameters are , level (), and [27, (5.12)]. For one has , , and
[27, table after (5.12), row T5]. Hence eventually , where [27, between (5.4) and (5.5)]. By (5.14) the remainders are . The main terms are (5.15), and (5.16) gives with the vanishing logarithmic loss (5.21) [27, (5.14)–(5.16), (5.21) and the sentence “S5 keeps its vanishing logarithmic loss”]. Since , this is the second inequality. Its error is the error-table entry “S5 BV remainder” plus the prime-measure and Euler conversion of that row [27, §6.3].
Stage three. By Paper II, (A.14)–(A.14a), lies in the ball of centre and radius , so . Paper II also gives the independent rational enclosure inside the same ball [27, after (A.14a)].
The chain uses , so the increment does not occur. Paper II’s allowance is a summand of in (5.10) and stays there once. Paper II, Appendix A, records the hypothetical increment and its once-booked decomposition. They are in the paragraph opening For comparison, if S5-top used and in the BV-allowance line right after it [27, Appendix A, comparison paragraph and following decomposition]. Equation (A.14a) gives only the nominal value at . ∎
The chain does not meet the changes of this section. Its three stages use no sieve level and no saved profile. They use no Class II, packing or Class I term. Paper II’s prepared Class II, packing and Class I contributions of this row are zero [27, §2.4, paragraph “S5-top and S6 use BV separately”]. The lift below changes the kernels on , , and only. The interval is disjoint from . The joint shift changes the cone only. Hence Lemma 5.1 holds unchanged after both changes.
Keep the whole fixed deduction of Paper II:
| (5.10) | ||||
These are Paper II’s six deductions [27, (6.6)]. The first remains paid although its source is excluded. The joint reconciliation also remains paid. Every adverse row difference has an absolute bound. Keep their whole vanishing envelope, . The row estimates required here are
| (5.11) |
The part is already in the endpoint sum, so the remaining chain deduction is . Their total is exactly . The fixed AA37 share is paid under the admissible condition of Paper II, (1.27) [27]. See Paper II, §6.5. This condition is part of the fixed-parameter choice made before the limit. The analytic inputs are Paper II, (6.4b)–(6.5), and its direct and estimates [27, (4.66)–(4.69), (6.4b)–(6.5)]. Their logarithmic parameters are
| (5.12) |
These are Paper II, (4.66), for the original coefficient families. This section leaves them unchanged.
Lemma 5.2 (Inherited chain errors).
The bound (5.11) holds, and as at fixed . Each row or separately listed stage difference used below has an allocated nonnegative share in Paper II’s error table. Denote it by . Paper II, §6, charges these shares once. An entry may be grouped across rows, so the lemma claims nothing for arbitrary subfamilies and does not claim pairwise disjoint entries. The only omission bounds used are those for the whole chains or stage differences named in the proof below.
Proof.
The signed-assembly theorem of Paper II proves with for the source (6.1) [27, §6.1, (6.1)–(6.2), (6.4)–(6.4d)]. Its proof bounds every adverse stage difference by an allocated share of Paper II’s error table, §6.3. Each entry is a nonnegative bound or a proved zero; some entries are grouped across rows. Paper II assigns each tuple to its first failed condition and charges each difference or part once below [27, §6.3]. The fixed entries are the six deductions of (5.10), that is [27, (6.6)]. The others tend to zero at fixed , and their sum is . The rows of are rows of (6.1). The level increment is still deducted when that chain is omitted. The part is already in (5.6). This gives (5.11). For the differences and entries are those of Lemma 5.1. Separately listed entries cover the omissions used in this chapter. The whole and chains use the S6 BV remainder, S6 level increment and entries. The whole chain uses the §4.6 table and (4.85) of Paper II [27, §4.6, (4.85)]. The stage-nine strip for the retained part of uses the S10 selector entry. These bounds apply to the named whole chains or stage difference after allocating their shares. No arbitrary omitted subfamily is asserted. For the direct rows, the stage-nine entry “Profile comparison” is zero adverse. The stage-ten entry “Directed enclosure” is zero additional [27, §6.3]. For the retained part of , the strip between the retained cells and is the entry “S10 selector”, . The term replaces it [27, §6.3, rows “S10 selector” and ].
The entries rest on the following inputs, all used by Paper II on these same sources. The linear-sieve main terms and remainders are Paper I, Theorem 2.6, (2.30)–(2.33b). This is the structured form of Iwaniec’s Theorem 4 [13, Theorem 4, p. 311], applied with , and [27, §6.2]. Before the exterior sign, applied once, each block remainder splits as
with [27, (6.4a)–(6.4b), (4.23)]. The term vanishes on the direct rows, where . On it is by Paper II, (4.64)–(4.65). The terms and are bounded jointly, once, by , with [27, (B.1)–(B.7)]. Here is the retained-side combinatorial constant; it depends on the fixed and not on . The persistent part of Paper II, (B.8), lies in ; only its secondary part belongs to . The Class II estimate (6.5) of Paper II applies Paper I, Theorem 3.2, (3.13), with the precisions (5.12). The spectral input of that theorem is Paper I, Theorem 2.8; see Fact 3.22. In the large-norm case of Paper I, (3.48), its mean-square input is Lemma 6.5(ii), in place of [3, Theorem 0(a)]. Lemma 6.5(ii) applies under the Paper I hypotheses and selected parameter box stated there. It uses neither the optional six-endpoint lemma nor any broader BFI86 scope. Its premises are checked for these sources as follows. In Paper I, conditions (3.1), (3.2), (3.6), (3.8) with the length condition, and (3.11) display its hypotheses (H1)–(H5). Paper II verifies them for these same sources, coefficients, boxes and scales [27, §6.2, hypothesis table, row “C1–C5, LEN”]. Paper I proves condition (3.25) for every selected factor of this form. The proof uses the prime Siegel–Walfisz theorem (2.21) [26, (3.25) and its proof]. Conditions (3.26)–(3.27) are the definition of and the Cauchy–Schwarz step of that proof. They hold under (H1)–(H5), with from the roughness in (H2) [26, (3.26)–(3.27)]. Stages one to eight are unchanged, so these are Paper II’s own checks. The prime-measure and Euler conversions are the prime number theorem, Mertens’ theorem and Paper II, (4.76)–(4.78). The profile lift and the shifted joint profile below act at stages nine and ten only. They change no source, cell, level, mask, box, norm or precision at stages one to eight. Hence is Paper II’s own envelope for these rows. ∎
Paper II’s rational floor satisfies
| (5.13) |
see [27, (6.3a), (6.6)]. The selected S2 endpoint used in this floor is . Paper II’s tail reserve is
| (5.14) |
Thus is deducted once inside , as in Paper II, (A.7)–(A.8). It is not a second deduction from . The separate fixed term remains outside in the S2 estimate [27, (3.22)–(3.23), (A.7)]. Combining the preceding estimates gives
| (5.15) |
This deduction uses the individual signed chains. Its analytic input is (5.11).
5.2. Six improved endpoints
Let
| (5.16) |
For , let be its Paper II profile integral. The indices and keep the preceding conventions. Let and be directed lower endpoints. The required numerical comparisons are
| (5.17) |
The old and improved directed endpoints are the following exact terminating decimals. They are given in the normalized D contributions used by the signed sum. For S4, S5-low and S7 the sign is included; for S10 the sign is included.
| Endpoint source | Directed contribution in D units |
|---|---|
| S1, [27, (A.4), (A.5a)] | |
| S2, [27, (A.8), (A.8a)] | |
| S4, [27, Appendix A.2–A.6] | |
| S5-low, [27, Appendix A.2–A.6] | |
| S7, [27, Appendix A.2–A.6] | |
| S10-Ret, [27, Appendix A.2–A.6] | |
The rational endpoint differences sum to
| (5.18) | ||||
Exact rational addition of the six entries above gives the displayed sum, and each entry satisfies . The values are Paper II’s directed endpoints, and is proved there [27, (A.4), (A.5a), (A.8), (A.8a), Appendix A.2–A.6]. The values are lower bounds read from Paper II’s printed independent enclosures. The following optional lemma states them.
Lemma 5.3 (Six directed endpoints from Paper II; optional).
For each , the Paper II profile integral , with its signed normalized coefficient, satisfies , with as tabulated above.
Proof.
For , Paper II, (A.5a), gives the printed ball; its lower endpoint is . For , Paper II, (A.8a), gives the printed interval whose lower endpoint is . Paper II states that this interval covers the continuous functional and the infinite tail. The deduction in (6.6a) is released once in . The term in (6.6b) contains no [27, (6.6a)–(6.6b)]. For , the Appendix A.3 balls include the adverse shifts. Since the profile function is nonincreasing, the shifted raw integrals are at least the -free ones. Their upper endpoints with the negative coefficient therefore give . For , the Appendix A.3 -Ret ball encloses the -free actual-coordinate profile on . Its lower endpoint gives . The separate strip is paid in the selector estimate. These are the printed enclosures in Paper II, (A.5a), (A.8a), and Appendix A.3. Its numerical-certificate section records the adverse-shift and actual-coordinate conventions [27, (A.5a), (A.8a), Appendix A.3]. The remaining directed endpoints are unchanged. ∎
5.3. Four stronger profile comparisons
Use the sieve functions of Paper I [26, (2.23), immediately before Theorem 2.6]. Put
| (5.19) |
Define
| (5.20) | ||||
The domains are
| (5.21) |
These are Paper II’s domains [27, (2.27), (2.29), (2.31), (2.38)–(2.40)]. Set
| (5.22) | ||||||
The three upper rows carry a negative sign. The lower row carries a positive sign. Their original coefficients are included in these gains, so there is no further factor .
Paper II’s actual levels give
| (5.23) | ||||||
See [27, §2.4, proof of (2.26)–(2.31); §2.5, proof of (2.40)]. The exact split behind the displayed reserve is
| (5.24) |
After the lift, Paper II’s S4, S5-low (including its B branch) and S7 comparisons leave . Its S10-Ret comparison leaves . Both are positive for . The G1-3 shift leaves and the crossing leaves , by [27, (4.72)]. These are pointwise profile-numerator inequalities. They do not change the actual level , the level , or the masks, boxes, Class-II and AA37 inputs. The other level conditions of Paper II remain pointwise and unmodified. They include the G1 guard, S1–S3, S2/S3/S8/S9, and the whole-K margin. See Paper II, (2.21), (2.40), (4.72), and (4.19). Decreasing gives the first three comparisons. Increasing gives the fourth comparison. These operations leave the actual levels unchanged. The H6 lift and the M5 shift act only at stages 9–10, after Class II at stage 7. They change no Class-II, AA37, box, mask or precision input: contains no saved profile, and (5.12) remains unchanged.
Proposition B.1 gives finite integral enclosures. With the directed calculation of the computational appendix, they prove the following. Its exact rational interval is
. This is a ball for the sum of the four rowwise lower bounds, not for . We use the terminating credit . It lies below that exact lower endpoint and leaves the existing allowance intact. This allowance is conservative; it is not an additional gain in the final constant.
| (5.25) |
The unchanged strip also satisfies
| (5.26) |
The lifted argument satisfies . Thus throughout the strip, as used in this density bound. These are finite bounds, including their stated domains. The retained cells also leave a reserve. Put
| (5.27) |
Lemma 5.5 uses (5.26) and (5.27), so its comparison over the whole of needs no deduction. Paper II’s selector entry is replaced in Paper II by , a summand of (5.10). The fixed amount is deducted once. The retained reserve above eliminates the selector deduction in this comparison. The inherited peel and its label replacement are jointly covered by that same summand.
We next define the finite profile arrays. Let . On this compact interval, use the zero extension of the profile outside its displayed domain, and put
| (5.28) |
The symbol denotes unit mass at . Define
| (5.29) |
and
| (5.30) | ||||
For , set
| (5.31) | ||||
For , set
| (5.32) | ||||
Put for , and . The original and lifted arrays are
| (5.33) | ||||||
The powers denote product measures. These formulas use from (5.17). Write . For , and then ,
| (5.34) | ||||
Thus . Define the two conversion errors:
| (5.35) |
Lemma 5.4 (Finite profile shift).
For the arrays above,
| (5.36) |
Proof.
Substitute the two definitions in (5.35). ∎
Both absolute conversion terms appear as separate summands of . We do not assume that Paper II’s original envelope contains the saved-array error. Its stage 8 converts the actual-level array before stage 9 domination [27, §6.1, stage table]. The arithmetic application uses the preceding level domination.
Restoration.
The four rows of are Paper II’s rows , the lower part of , and the retained part of . Their stage-two source-restoration shares are assigned once to the source parents , , and . The literal split at is made before the structured sieve or Heath–Brown expansion, as above. Both parts retain the parent for this restoration accounting [27, (2.28), §6.1, stage table and the list of S10, S5 and S4/S7 endpoints]. There is no separate restoration for the lower part of . The upper part of is the outer chain of Lemma 5.1, which the lift does not change. Each tuple of an actual source is assigned to one entry by Paper II’s first-failure rule [27, (6.4d) and the two sentences after it]. This section changes no source and no stage from one to eight, so the assignment is Paper II’s. Appendix B.7 lists the finite correspondence between these rows and Paper II’s error entries. It is an index of that assignment, and each entry occurs once.
Lemma 5.5 (Lifted direct comparison).
Let , and let be Paper II’s stage-eight quantity for this row. It is the continuum mass of the actual-level main term after the prime-measure and Euler conversion. There each actual cell carries its actual relative level . Put . Then .
Proof.
Stages one to eight are Paper II’s. Paper II passes from to by pointwise domination of the actual-level integrand by the specified profile. The cells and the continuum measure are the same [27, §6.1, stage table; §2.4, after (2.31); §2.5, after (2.40)]. We repeat that domination with the lifted profile. For each B-labelled parent contributing to , or -low, we first rederive the buffer used below. Write
Paper II gives . The branch comparison is the exact identity
Thus the decreasing branch is active exactly when . Equality is assigned to A, where both bounds agree. This active branch test is applied to every B-labelled parent. The branch is never inferred from the largest completed coordinate alone. Paper II keeps the inherited label through clipping. In S4 and S7 the B parents are separate intersections of their respective row domains with . No common parent interval is asserted. S5-low has and , so because . It is therefore entirely B. Let a parent in S4 or S7 be A-labelled. Then , and Paper II’s first branch in (2.17f) [27, (2.17f)] gives . Take an actual exponent . The S4 and S7 row domains are clipped by [27, §2.1, fixed-cutoff rows], and the retained bin gives . The residual is therefore
Here is the retained cutoff parameter; the symbol elsewhere denotes the Möbius function. Thus the A pieces also have the required buffer. This is a row-local calculation. It does not merge the distinct S4 and S7 parent domains. For any B parent, Paper II’s floor gives
| (5.37) |
The first bound is Paper II’s linear branch of the full-anatomy floor [27, (2.17d)–(2.17f)]. Using , , , and proves the second line by direct subtraction. The B pieces of S4 and S7 use the same row-local calculation. Their parent intervals stay distinct.
For the row coefficient is negative. At a point of an actual cell, the actual sieve argument is and, by (5.23),
These are Paper II’s margins for , and the branch of the lower part of . Here has moved into the profile [27, §2.4, display before “The S4/S7 A/B levels give the same buffer”]. Since is decreasing, . For the coefficient is positive, and on the retained cells
which is Paper II’s with moved into the profile [27, §2.5, proof after (2.40)]. Since is nondecreasing, . Paper II uses the same monotonicity of and for these comparisons [27, §2.4]. For the cells cover , and integrating the pointwise inequality against gives .
For the retained cells need not cover . Let be their union, put , and write . Then
Strip. Let lie in a cell with labels , . The cell is dropped, so . This uses the two deficit bounds of Paper II, §2.5, and the fact that is nonincreasing [27, §2.5, proof of (2.40)]. Also . On one has and , so . With and , this gives , where is the constant in (5.26).
Reserve. On a retained cell the margin in (5.23) satisfies , so . Here . For , and
since . As is nondecreasing, at every point of .
A fixed retained rectangle. Let , in a cell with labels , . Then and . On we have , because . Hence , and the cell is retained: . Also .
Combining the three steps with the pointwise inequality above,
by (5.27). No deduction is made. The reserve is the part of Paper II’s level margin left after the lift . It exists on cells of only and is used only here. ∎
5.4. The internal joint shift
The joint occurrence is . Its six-branch function is Paper II, (4.70) [27, (4.70)–(4.72)]:
| (5.38) | ||||
Subtract before testing each guard. Set
| (5.39) |
Shift the output of by . Keep its guards and actual source unchanged:
| (5.40) | ||||
Use for . Keep its true values at every larger argument. The new margins are
| (5.41) |
The second margin concerns a parent interval crossing . Both follow by subtracting in Paper II, (4.72); see Lemma 5.6. They hold throughout . If , the retained-cell condition follows:
| (5.42) |
Thus the canonical restriction still loses zero. At fixed numerator, use the increase of . This is the same comparison as Paper II, (4.72).
Lemma 5.6 (Shifted retention).
The margins (5.41) hold for . On the original joint source, every positive shifted lower contribution lies in an original retained whole cell of Paper II, (4.19). On such a cell the actual lower main term dominates the shifted canonical one.
Proof.
Use an original G1-3 cell with inherited labels , and order its distinct actual prefix primes as . Put . Unequal parent bins enforce the actual order, while within an equal-label group we order the primes. Hence , including clipped bins. No strict inequality between the labels is required.
Let be the original full-anatomy infimum and . Put . The function is -Lipschitz. On the closed ordered parent a coordinate changes by at most . A sum of at most three coordinates changes by at most . If a saved guarded branch is active at , its buffered guard has nonnegative gap, including equality. Removing its buffer adds . Throughout the parent its unbuffered gap is therefore at least . Thus it stays available in the full anatomy. Take an unguarded or active guarded saved branch. The corresponding full branch is at least its value at plus . Taking their maximum and then the parent infimum preserves this lower bound. Ties between maximizing branches cause no loss. Therefore
For a parent crossing , the largest exponent is within of , and . Every saved branch is at most , so the crossing comparison gives instead . Clipping only shrinks the infimum domain. These arguments also apply when two or all three labels coincide. For we have .
If , then and hence
Thus the whole original cell is retained by Paper II, (4.19). On positive support and imply
These use only nonnegativity and monotonicity of . Equal labels invalidate none of the weak inequalities. Also , so . At zero shifted contribution the required comparison follows from nonnegativity without any assertion that .
Keep the original orbit normalization. If the equal-label groups are , put . For a full labelled realization , write for its decreasing rearrangement within the equal-label groups. The shifted comparison above is evaluated at and is invariant under these group permutations. For every nonnegative, invariant main-mass weight , therefore,
Each distinct ordered triple has exactly labelled realizations. The prefix mask and its correction are kept exactly as in Paper II, (4.22)–(4.23). No repeated-prefix realization is reclassified. The tail mask and all remainder coefficients are likewise unchanged. This proves the finite lower-main-term comparison with the cell mass divided by . The corresponding continuum comparison uses the preceding inequality with the and factors. Equal-label bins are kept. Their strictly ordered actual triples lie in the original cone. The orbit identity converts the full-block sum to that ordered sum exactly. Only actual coordinate diagonals have zero continuum measure. The proof imposes no disappearance of equal-bin regions. ∎
Put . Paper II’s remaining terms satisfy
| (5.43) | ||||
Its constant terms cancel exactly [27, (4.73)–(4.75)]:
| (5.44) |
The shifted upper comparison is therefore
| (5.45) |
The source-mass integrals are [27, (4.77)]
| (5.46) | ||||
We have and . Thus . The finite shifted enclosure gives
| (5.47) |
Paper II’s mass enclosure gives [27, (A.10d)]. The exact constants are
| (5.48) |
Paper II, (4.84), gives
| (5.49) |
Define
| (5.50) |
Their exact substitution gives
| (5.51) |
The finite enclosure and identity are proved. They concern the shifted profile integral. The required actual-source inequality is
| (5.52) |
Proof of (5.52).
Paper II proves
from (4.73)–(4.77) [27, (4.75), (4.78)]. Run the same argument with replaced by . The first three residual rows and the bound do not change, and neither does the cancellation (5.44). In the fourth row, Lemma 5.6 replaces Paper II’s comparison after (4.72). The canonical restriction loses zero, and the actual lower main term dominates the shifted one. The source and its weights do not change, and neither do the peel (4.45)–(4.57) and the mass conversion (4.76)–(4.78). Hence
with the same . By Proposition B.2, , which is (5.47), with the residual bound supplied by (5.43). By Paper II, (A.10d), . Both factors are nonnegative, so by (5.50)
This gives (5.52) even without . That term is nonnegative and is kept so that the error agrees with (1.12). ∎
The existing is a disjoint component of the original allowance. Its fixed peel is covered by , and its fixed share by . Its vanishing part belongs to . When replacing the joint chain, carry these same components once. The reconciliation in (5.10) remains paid. These components are the comparator term of Paper II, (4.64)–(4.65), and the share of the joint bound. That bound treats and in Paper II, (B.1)–(B.7). Both are attached to the original source measure and not to the profile. Hence the shift neither creates nor removes them.
5.5. Conversion of the finite arrays
We give the remaining definitions before stating the lemma. All representation variables in the following table are prime. Their product is , with . Let and count the first two forms. Let and count the last two forms. Put . These are Paper II’s representation weights [27, (4.4), source table preceding (4.4)].
| Count | Product | Restrictions |
|---|---|---|
| , , , . | ||
| The same conditions on ; . | ||
| , , . | ||
| , , . |
For the last form the endpoint orders are distinct. Every permitted representation keeps its multiplicity. Define the upper cut and masses by
| (5.53) | ||||||
The cut precedes the sieve decomposition [27, (4.16)–(4.17)]. The source-mass input used below is
| (5.54) | ||||
Lemma 5.7 (Source masses).
The formulas (5.54) hold.
Proof.
On , define the zero-extended kernel
| (5.55) |
Its arrays and integral are
| (5.56) | ||||
Equivalently,
| (5.57) | ||||
These definitions specify all five additional conversion errors.
Lemma 5.8 (Conversion of the five profile differences).
Proof.
Step 1: convergence of the harmonic measures. Let . Mertens’ theorem and partial summation give
| (5.59) |
Replacing by costs . There are at most prime divisors of . Each omitted divisor above has mass . Their total cost is . The largest endpoint atom is . The total masses therefore satisfy
| (5.60) |
Let be continuous on . Choose a finite interval partition and a step function on it, uniformly within a prescribed error of . The integrals of the step function converge by (5.59). The integral errors are at most the uniform error times , which is bounded by (5.60). Hence [2, Theorem 2.2 and Example 2.3]. For , rectangle masses are products of interval masses. The same argument with rectangular step functions gives
| (5.61) |
For a coordinate diagonal ,
| (5.62) |
Thus strict prime order costs nothing in the limit, and no orbit factor enters.
Step 2: the source and Euler normalizations. For ,
| (5.63) |
Mertens’ product formula and the convergent second product yield
| (5.64) |
uniformly in . The prime is omitted because is even. The missing divisors above contribute . The ordinary product error is uniform for . By Lemma 5.7 and (2.2),
| (5.65) |
For example, . This is exactly the main factor in . Thus both the truncation factor and the representation multiplicities cancel once.
Step 3: restriction and bounded kernels. Write and . These are probability measures, and their products converge weakly. Let have , and let be bounded and -almost everywhere continuous. Apply the mapping form of the portmanteau theorem [2, Theorems 2.1 and 2.7] to and the probability measures. Then multiply by . This gives
| (5.66) |
The intervals have finitely many boundary points. The boundary of is piecewise affine, since is continuous and piecewise affine. Both have zero -measure. On the argument lies in a compact subinterval of , where is continuous. On , gives , and ; there is continuous. Hence and are bounded and continuous off a null set, so (5.66) applies to them. With (5.65), it gives
| (5.67) |
Step 4: the ordered three-dimensional kernel. The cone has affine boundary faces, so its boundary is -null. The function is piecewise affine. Its possible jumps lie on finitely many guard hyperplanes, and its branch switches add finitely many affine faces. On every remaining open piece, and are continuous. The denominator satisfies , so the arguments of remain in a fixed compact interval. On it , extended by zero below , is continuous. Since , . Thus is bounded and -almost everywhere continuous. Apply (5.66) to the zero extension on :
| (5.68) |
The normalization costs at most
| (5.69) |
The cone’s coordinate-order inequalities are strict, so counts strictly ordered triples, as in (5.57). Hence , and with Step 3 all limits in (5.58) and follow. ∎
Whole cells, retained cells and the label cutoff.
For the four direct rows, the arithmetic identification is Lemma 5.5. For the joint row it is the proof of (5.52). Both are made at stage eight on Paper II’s actual cells, with their inherited signed coefficients. Hence no further whole-cell kernel is needed. For the retained part of , the actual whole cells cover up to a strip. Lemma 5.5 absorbs this strip by the retained reserve (5.27). For , the retained cells are those of Paper II, (4.19). By Lemma 5.6, the shifted profile has no positive support outside them. The arrays (5.33) and (5.56) enter only through the nonnegative errors in , which vanish by Lemma 5.8.
The array (5.57) carries at the actual coordinate. The arithmetic lower main term carries , , at the inherited label. Since , . In the lower part of the joint upper bound this replacement is favourable. We nevertheless bound it absolutely and include it once in Paper II’s peel allowance (4.57). No fixed cost is added. By (5.64), uniformly for actual label/coordinate pairs in the same cell with and ,
For a weight on the strictly ordered cone, the replacement therefore costs at most
| (5.70) |
where the sum runs over the primes of (5.57). The limit follows from Steps 2–4 of the proof of Lemma 5.8 applied to the bounded kernel . We evaluate by (5.44). Since and the quadratic increases for ,
At fixed , eventually and , so . We include once. Paper II’s peel bound before its final rounding is
[27, (4.47), (4.56)], and its printed allowance is [27, (4.57)]. The per-layer coefficient 502002 in Paper II, (4.53), includes the Selberg remainder. The printed allowance (4.57) uses that coefficient; we therefore use its slack with the Selberg remainder already included. Exact subtraction gives
| (5.71) |
Hence the peel and the label replacement together stay below , the entry already contained in . The fixed deduction is unchanged.
5.6. The resulting lower comparison
Remark 5.9 (Inputs).
The proof of Proposition 5.10 uses the cited statements of Paper I and Paper II. They are applied to Paper II’s unchanged sources. It uses Paper I, Theorem 2.8, through Fact 3.22, and the prime Siegel–Walfisz theorem, Paper I, (2.21). It uses Lemma 6.5(ii) at Paper I, (3.48), and the finite enclosures of Propositions B.1 and B.2. The optional endpoint improvement also uses Lemma 5.3. The table of Appendix B.7 is an index, not an input.
Proposition 5.10 (Retained comparison).
Proof.
Write each chain of , including , by (5.4) and each joint group by (5.5). Lemma 5.2 covers the differences at stages one to eight and the remaining Paper II differences at stages nine and ten. Their sum is at least . For , replace the stage-nine object by . Then Lemma 5.5 gives . For , Lemma 5.3 gives the stage-ten difference , so the endpoint rises by . Only the endpoint changes, so enters once. By Proposition B.1, , which is (5.25). For the joint occurrence, (5.52) replaces Paper II’s bound. Its is the part of and is counted once. These modifications concern disjoint profile terms, so their gains enter once. The endpoint sum (5.6) and the floor (5.13) give . Hence
| (5.72) | ||||
The nine conversion errors are nonnegative, so (5.72) is weaker than the same bound without them. This is (5.2). By Lemmas 5.2 and 5.8, ; the threshold depends on the fixed . No fixed increment is added. The only new fixed cost is the label replacement, and by (5.71) it lies inside Paper II, (4.57). Without Lemma 5.3, take ; then the same argument gives (5.72) with replaced by . ∎
6. The sixth sum at
Put and fix for the common error allocation. No estimate in the sixth-sum construction depends on . Fix
| (6.1) |
Write for with . Paper II, (1.7), gives the original sum [27, (1.7)]:
| (6.2) |
Each prime mark remains a separate occurrence.
6.1. Three upper weights
For squarefree , order its primes decreasingly. The ordinary upper Rosser weight is
| (6.3) |
The weight is zero outside its stated squarefree support. Its divisor sum is a nonnegative upper sieve weight [14, Lemma 1, (3.2), (3.6)] [13, Lemmas 2–3, p. 313].
For and , define
| (6.4) |
Require and . Set the coefficient to zero otherwise. Since , the mark is unique. Thus . On supported moduli with , the gates give . For the gate product is empty, and suffices. Every marked prime has . Each sieve level below is for large . Hence
| (6.5) |
The equality is claimed on supported moduli only. Off that support the coefficient is zero.
Choose fixed logarithmic exponents. Put
| (6.6) | ||||||
The last two arrays keep the gates at .
6.2. The exact discrepancy identity
For a bounded interval and a finitely supported modulus array , put and define
| (6.10) | ||||
Also put
| (6.11) | ||||
Finite expansion gives
| (6.12) | ||||
Since ,
| (6.13) |
Therefore
| (6.14) | ||||
No low natural-coprime term is estimated separately.
For large , each prime in exceeds . Hence
| (6.15) |
The elementary identity
| (6.16) |
follows by multiplicativity and a convergent Euler product. Thus Paper I, (2.21), bounds (6.15) by for each fixed [26, (2.21)].
For the three -terms we use the maximal-endpoint prime form of Bombieri–Vinogradov. Here it is conditional on the prime Siegel–Walfisz input [26, (2.21)]. Define the prime progression error by
| (6.17) |
Fact 3.2 gives, for each fixed ,
| (6.18) |
Here for . The level sits at , not at the variable endpoint , so intervals with endpoints chosen separately for each modulus cost at most twice this bound. This is the maximal prime statement. We do not substitute the fixed-endpoint von Mangoldt statement of Paper I, (2.20). The source and the fixed logarithmic buffer are those of Fact 3.2.
Set , , and choose the half-level buffers so that
| (6.19) |
Lemma 6.1 (The three low discrepancies).
Under (6.19),
| (6.20) |
Proof.
The arrays , and are supported on , and , respectively. Each is one-bounded. Since , every such has . This is the level of (6.18) at . Every supported is coprime to , so is a reduced class. Since for ,
Write for the left limit at . Then
A left limit is a limit of values at points of . Hence each value on the right is at most . Therefore the left side of (6.20) is at most five times the left side of (6.18), with and . This is the maximal prime statement of Fact 3.2. ∎
6.3. The high coefficient
Put
| (6.21) |
The von Mangoldt identity gives three sums:
| (6.22) | ||||
These come from
| (6.23) |
Roughness is multiplicative, including shared prime factors. The short -term vanishes on .
The detector retains proper prime powers whose bases exceed . For , hence ,
| (6.24) |
Consequently
| (6.25) | ||||
Let . A supported with divides , and by unique marking. The comparator part is at most . Hence (6.16) gives
| (6.26) |
Here , and is fixed. The second bound follows from the first, and . The high-coefficient estimate uses the mask of in (6.25). That mask excludes bases , so the displayed decomposition needs no separate add-back.
Proposition 6.12(3) proves the high-coefficient estimate
| (6.27) |
Its modulus coefficient is exactly (6.6). The estimate permits no joint arithmetic mask. Table 6.1 gives its decomposition. Each power boundary belongs to the interval on its right.
| Sum and range | Tested array | Required estimate |
|---|---|---|
| , all | Rough-factor estimate | |
| , | Two-factor convolution | |
| , | Central estimate | |
| , | Central estimate | |
| , | Rough-factor estimate | |
| , | Two-factor convolution | |
| , | Central estimate | |
| , | Central estimate | |
| , | Two-factor convolution |
6.4. The three distribution estimates
Lemma 6.2 (Rough-factor distribution under parent-scale and strict-roughness conditions).
Let , , and , with fixed . Assume the two explicit conditions used by the direct rows:
-
(W1)
The original parent satisfies , for a fixed . In the row ; in the right row .
-
(W2)
Use the strict roughness convention , as in (6.21). It is not replaced by .
For every fixed , uniformly in real intervals (so ; open, closed or one-point), supported with , and reduced residues ,
| (6.28) |
The interval may be arbitrarily short. The saving is measured at its original parent. The estimate is an integer-sieve statement and uses no prime distribution input.
Proof.
Put and . The Euler product at gives for sufficiently large . Choose the fixed constant after , with
| (6.29) |
Let . The two adjacent Bonferroni truncations bracket the strict exclusion of all primes in . Their normalized gap satisfies
| (6.30) |
Every divisor in the truncation is at most . By CRT, each divisor contributes its expected interval mass with error . This is uniform for open, closed, or singleton intervals. The same expansion applies to the comparator after using
Thus the main terms cancel. The accumulated lattice error is , and . Under (W1), . The Bonferroni remainder is at most because . Hence both are absorbed by once the fixed truncation precision is raised. This proves (6.28).
The strict convention in (W2) has no threshold atom. An application might instead use . Then the only possible difference is the atom when is prime. That weak convention requires its separate CRT boundary correction. It is not used in (6.28). ∎
The positive gap absorbs the lattice error in (6.30). For , the free scale is at least . For the right -part, it exceeds a fixed multiple of . Partial summation then gives
| (6.31) |
Both kernel terms remain in this estimate. Here is the outer endpoint of the current row. It is in the row and the corresponding low-row endpoint in the decomposition.
The other tested arrays need uniformity under coprimality with an auxiliary integer. Write and . For any sequence on its original parent , define
| (6.32) | ||||
Lemma 6.3 (Prime-variable transfer).
Let , , and . Let and
where is prime and . For each the allowed primes lie in a real interval . Assume on and on . For every fixed , uniformly in intervals , , and , prime Siegel–Walfisz, Paper I (2.21), implies
| (6.33) |
Proof.
Put . If , the two terms in the discrepancy are bounded by a constant times . For each represented , a prime divisor determines at most one pair , since . Hence
using , , and . Since and , the resulting discrepancy is . The two spare powers in absorb . The additive is absorbed because .
Now let . Terms with vanish from both sides. Otherwise the prime progression is on . Primes dividing are excluded on the progression side and in the comparator. For each the two exclusions differ by at most . There are at most possible values of , so these terms contribute .
For the remaining primes define
The reduced-class sum equals . Thus this is the centered prime discrepancy without the primes dividing . Apply (2.21) to the class and average its uniform error over all reduced classes. This gives , with no factor of . Since , . Hence, for all sufficiently large , . Therefore (2.21), with modulus exponent and fixed saving , applies throughout each interval of integration. Stieltjes partial summation bounds each -contribution by . Sum over and take . This gives . The estimate is measured at the original parent , including for short intervals. Finally, because , and . This proves (6.33). ∎
Lemma 6.4 (Four-family auxiliary-coprime Siegel–Walfisz).
By prime Siegel–Walfisz, Paper I (2.21), for each of , the bound
| (6.34) |
holds uniformly for every and . The parents are the central ranges in Table 6.1 and the convolution parents . The proof uses the lower bound only to absorb the large-modulus lattice term and to exclude . It uses for the remaining weight bounds. The divisor exponent is the single fixed value , independent of . The implied constant may depend on and the fixed family parameters, but not on . The error is measured at , even when is short.
Proof.
For sufficiently large , every parent has , so is excluded. The rough and signed-rough arrays have exact prime-variable decompositions. For , take , , and . Use . The largest prime factor gives the unique term. For , take , , and . The strict inequality excludes repeated largest primes, where .
For , the terms in , , use , , and . For , the terms use , , and the same weight. In each case . The four tested arrays are one-bounded on their parent ranges. For the last two arrays this follows from and . On the central ranges . There the weight bound follows from for and for , since .
The mean-square estimate below has five uses. Section 7 uses it for the zero mode of the exterior sum. Section 5 uses it for the Class II estimate of Paper II inside the retained side. Section 8 uses it for the row-three dispersion estimate of the switched sum. These three apply Paper I, Theorem 3.2. In the large-norm case of Paper I, (3.48), part (ii) below replaces [3, Theorem 0(a)]. The other two uses are the central rectangular estimate of Lemma 6.9 and the small-modulus norm-relative step of Lemma 6.8. Part (i) derives the conclusion of that published theorem (Paper I, Theorem 2.4). Its inputs are the norm-relative condition (6.35) and an elementary large sieve, so the argument is self-contained at this step. We do not correct [3]. Paper I’s use of it is unaffected. The norm-relative premise is not deduced from the absolute parent-scale estimate (6.34) alone. Let be complex and supported in , . Fix . Consider the following condition. For every , uniformly in integers and reduced classes ,
| (6.35) |
The constants are common to the family of pairs under consideration. Write for the centered discrepancy at . The norm conclusion is
| (6.36) |
In the selected-factor form of Paper I, (3.48), , , and
| (6.37) |
where is the interval mass in Paper I, (3.8).
Lemma 6.5 (Transferred mean-square estimate).
- (i)
-
(ii)
Assume the hypotheses (3.1), (3.2), (3.6), (3.8) with its length condition, (3.11) and (3.25)–(3.27) of Paper I. Then the estimate (6.37) holds uniformly over the parameter boxes and selected factors of Paper I, Theorem 3.2. Hence that theorem holds with this input in place of [3, Theorem 0(a)] at (3.48).
Proof.
(i) Expand in Dirichlet characters modulo and pass to primitive characters. For conductors up to a fixed power of , apply (6.35). Take the auxiliary divisor to be the imprimitive part of the modulus. For larger conductors use the multiplicative large sieve inequality. Its elementary proof uses finite Fourier identities and the spacing of reduced fractions. Summing over the moduli gives (i). (ii) If , the elementary bound in Paper I, (3.48), applies. Otherwise (3.25), with auxiliary divisor , and (3.26) give (6.35) for with divisor exponent one. Also (3.6) gives the modulus range in (6.37). Part (i) then applies. The complete argument is in Appendix A.2, with its row index in Appendix B.8. We assert no implication from (6.34) alone to the norm bound. ∎
For the three convolution rows, let
| (6.38) |
where . A supported modulus has the unique form of (6.4). Here is the marked prime and the squarefree cofactor.
| (6.39) |
Lemma 6.6 (Deterministic allocation).
For each supported , the following rule defines a unique coprime split satisfying (6.39). Put in . Order the cofactor primes exceeding as . Here . Process them in this order. Put in exactly when the current , and put it in otherwise. Let and be the resulting factors. Order the remaining cofactor primes as . Set . If , take , . Otherwise let be the least index for which , and take
Call the resulting pair .
Proof.
The marked prime fits, since , even at the fixed lower endpoint . The accepted big-prime partial products stay below . Thus , and the least index exists when needed. Write all cofactor primes in decreasing order as . The odd cube gates in (6.4) imply
For odd , drop one factor from the cube gate. For even , use the preceding odd gate and .
Suppose , and let be the last big prime rejected into . The rejection test gives . The two-gate inequality then gives
If no big prime is rejected, . In the prefix case, minimality gives , hence and
The factors partition the squarefree prime factors of . Thus , , and . ∎
Define the exact joint coefficient on each dyadic Cartesian modulus shell by
| (6.40) |
Here is the rule in Lemma 6.6. The expansion is exact on the full Cartesian parent, including zero values off the selected pairs.
Lemma 6.7 (Global tensor for the selector).
The coefficient has a rank-one expansion satisfying (6.40), with the sharper bound
| (6.41) |
Proof.
Fix a pair of dyadic shells. A branch fixes the merge order of the at most 29 big cofactor primes. It also fixes the final large-prime/prefix case. In the prefix case it fixes the parity of the number of factors assigned to . There are at most branches. Within a branch, unary conditions impose squarefreeness, coprimality with and the unique marked prime in . They also impose the bounds and , assigned big-prime counts, , , and . The remaining unary data are the case indicator, the parity of the small-prime count, and the sign .
Every cross-condition is a comparison or its weak counterpart. Let be the number of distinct values of on the -shell. For ranks , , put and
Finite Fourier orthogonality gives the exact separator
| (6.42) |
Rank among its shell values, and count the values below . Each shell has at most values, so . The cross-comparisons are exactly:
-
(1)
the adjacent strict comparisons in the fixed merge order of the big primes (at most 28);
-
(2)
for each -letter , the greedy rejection test (at most 29);
-
(3)
the odd cube gates at odd indices among the big primes (at most 15);
-
(4)
the remaining odd cube gates on the small-prime part, grouped by the fixed parity into the two maxima of the - and -side partial products (two comparisons);
-
(5)
in the prefix case, the prefix-order test and the least-prefix test (two comparisons);
-
(6)
the support range (two comparisons).
There are at most 78 comparisons in total. Once a merge branch is fixed, each displayed test compares an -only quantity with an -only quantity. The small-prime maxima combine all gates of the same parity and side. The branch conditions are exactly the greedy tests, the cube gates and the least-prefix condition. Hence their union is precisely . Multiplying the separators in (6.42) gives (6.41). The unary factors remain one-bounded. The bound in (6.41) is per dyadic shell pair. The resulting shell pairs are absorbed by the chosen logarithmic precision. ∎
For the convolution rows, split with , where and . The aggregate with is bounded by Rankin’s method. The mean-square modulus in the proof of Lemma 6.8 is , not the full . Its scale is
| (6.43) |
The inner factor is -rough and is removed in , with cost . No bound for and no roughness condition on is used. The required range is
| (6.44) |
where is the fixed source-level precision in the supplementary Lemma 6.5(i). This holds since . The full-modulus range is not asserted for these parents.
Lemma 6.8 (Two-factor convolution estimate).
Let and . Let , , be one-bounded, supported on , and satisfy (6.34) at the original parent , where . Let , , be one-bounded. Let be dyadic modulus scales, allowing the singleton scale for the integer , such that
Let , , and , , be arbitrary one-bounded arrays. Keep the unary restrictions , , . Neither a pointwise condition nor a joint condition is imposed on the pair. Then, for every fixed , uniformly in these occupied-parent scales, , , unary interval cuts of and , and intervals ,
| (6.45) |
Proof.
We use the dispersion method of Paper I, Theorem 3.2. It runs on the whole Cartesian shell , , with residue class . Its occupied-parent scale conditions are , , and . The second follows from the displayed bound by after dropping . The tested sequence is strictly -rough. The unary supports carry and the individual caps. No pointwise product cap is needed for the rank-one arrays. After Cauchy’s inequality in , the split above reduces the modulus of the mean square to in the range (6.44). The mean square is split at a fixed power of below its target. Below it the trivial bound suffices. Above it (6.34) gives (6.35) with a loss of that power, so Lemma 6.5(i) applies. The prime Siegel–Walfisz input is Paper I, (2.21). No joint condition is used, because are not the moduli of Paper I, Theorem 2.8. Write as above and . A prime with divides and only enlarges . The Chinese remainder step needs only that are pairwise coprime. The smooth–rough split gives . A prime with divides and a rough . Such tuples are the bad type . If , the second progression places in one class modulo . If only, exchange the two copies first; the absolute square majorant is symmetric, and the same statement then applies. We therefore remove these tuples before the Chinese remainder step. The cost in the square is . After the factor of the first Cauchy step this is . That is , since and . The zero-mode identity holds for all tuples, including those with gcd failures. After the second Cauchy step, Paper I, Theorem 2.8 bounds the nonzero frequencies. It is applied with , the product of two -rough inner variables, and , the least prime not dividing . Since , , exactly as in Paper I, (3.82)–(3.83). This is the form of Paper I, Theorem 2.8 (Sections 5.3 and 7.4) used here. Its statement allows arbitrary one-bounded with only . The product restriction is kept as in Paper I, Theorem 3.2. The finite product partition used there also handles the endpoints. Neither (6.37) at the full modulus nor a norm-relative consequence of (6.34) for small norms is used. The complete argument is in Appendix A.3, with its row index in Appendix B.8. ∎
The central rows use , . Choose the largest divisor with . Since and , . Hence a next divisor exists. The cube gates control adjacent divisors and give
| (6.46) |
This allocation keeps a one-bounded joint modulus coefficient. The required central estimate has
| (6.47) |
Lemma 6.9 (Central rectangular distribution).
Let be even, , and let the bounds in (6.47) hold with replaced by , with fixed comparison constants. Let be one-bounded on the complete dyadic rectangle . Let the tested satisfy (6.34) at its original parent. The divisor exponent is fixed, and the constants are uniform at every requested precision. Write
Then, for every fixed ,
| (6.48) |
The constant is uniform over these families, rectangles, squarefree modulus supports and unary interval restrictions of and . All errors are measured at the original parents. One outer residue is chosen before varies. In the application it is .
Proof.
This is the rectangular dispersion theorem proved in Appendix A.4 and indexed in Appendix B.8. The restriction only removes nonnegative terms. Its proof opens the inner modulus by dispersion with the outer residue fixed. It uses the mean square over all moduli of Lemma 6.5(i), which gives Paper I, (2.17), under its hypothesis (2.16). The supplementary proof applies the mean square twice. The second application is repeated over two correlations. At each application a constant sequence on the same parent is added. Its sign is chosen by the parallelogram identity to make the tested sequence norm-large. The resulting sequence and the constant sequence satisfy (6.35) uniformly. Their squared norms are at most the original parent times a fixed power of . Fix the requested logarithmic modulus buffer first. Then choose the source-level parameter so that the moduli lie in the range of (6.36). Apply part (i) to both sequences, subtract by linearity, and absorb that fixed power by increasing the requested precision. This uses neither part (ii) nor a mean-square conclusion for an arbitrary small-norm sequence from absolute Siegel–Walfisz alone. The other inputs are Paper I, (2.21) (prime Siegel–Walfisz), (2.35) (Weil–Estermann) and Lemma 3.4 (completed hyperbola count). It does not use Paper I, Theorem 2.8. For the four tested arrays of Table 6.1, Lemma 6.4 supplies (6.34) with divisor exponent one. ∎
Lemma 6.9 concerns complete dyadic rectangles and one-bounded sequences. Lemma 6.10 below reduces the four central rows, with their product cuts, to it. The raw exponent checks are
| (6.49) | ||||
The three margins verify the numerical range only. They do not establish the rectangular-support or family hypotheses for a selected product region.
Product cuts require an additional finite reduction. For , put
| (6.50) | ||||
Here is unary, and , and
Thus uniform product-prefix estimates restore the exact weights by Stieltjes summation, including the minus sign of . Use multiplicative cells of relative width . The original-source boundary strips satisfy
| (6.51) |
Each unnormalized source multiplicity is at most . Cauchy and give (6.51). Sum the boundary strips before the modulus expansion. For a final saving , fix
| (6.52) |
Then fix every Siegel–Walfisz and half-level precision. Choose the common threshold last.
Lemma 6.10 (Product-region reduction for the central rows).
Proof.
Selector. Let be supported, with the primes of in decreasing order . As in the proof of Lemma 6.6, the cube gates give for every , hence
Consecutive divisors of a squarefree have ratio at most . Write . The divisors of form the two chains and . If , the only new gap is . If , the ranges and overlap. A gap of the union below lies inside a gap of . One above lies inside a gap of . Induction on gives the claim. Since , the largest divisor of has a successor with . This proves (6.46). The pair is determined by , and . Put on selected pairs and otherwise. This coefficient is one-bounded and supported on squarefree with . Its dyadic shells satisfy and , where and . There are shell pairs.
Parents. In the first central row the tested variable and array are and . In the second they are and . In the central rows they are and in the first. In the second they are and . The other variable carries the remaining one-bounded array, with the sign of . On , every relevant pair of dyadic parents has and with fixed constants. There are such pairs. Lemma 6.4 gives (6.34) for the tested arrays at these parents.
Restriction. Let be a tested array on its parent and an interval. On the same parent, satisfies for every interval . It therefore satisfies (6.34) with the same constants, measured at the original parent. The other array may be restricted to any interval.
Mesh. Put . Divide each parent into intervals with endpoint ratio at most . All unary cut points of the row are endpoints. For fixed , call a cell complete if it lies inside . Any other cell meeting this region has all its products within a factor of or of . The part of the region it covers lies in the set of integers with or . Here . For a complete cell apply Lemma 6.9 with , saving , the restricted arrays, and . Both classes are reduced since , and . Thus
There are choices of cell and shell pair, so the complete cells contribute .
Strips. Sum the incomplete cells together before expanding the modulus coefficient. For fixed , the factorizations in the row carry total normalized weight at most . Also (6.26) bounds the modulus sum by . Their contribution is therefore
by Cauchy’s inequality twice, and . This is (6.51).
Conclusion. With and , the two contributions are and , uniformly in . This proves (6.53). Since , Stieltjes summation against gives the weighted bound, with the sign of kept. ∎
6.5. The main coefficient
For primes , set , and put for . Extend multiplicatively to squarefree integers, with for . For primes in the fixed reduced class modulo , and primes , the condition has density . Put
| (6.54) |
with as in Paper II, (1.2). For a marked prime and a level , put and . Let be the product of the primes with .
Lemma 6.11 (Upper-sieve application).
-
(a)
The comparison (6.9) holds.
-
(b)
There is an absolute constant such that, for every even ,
(6.55) -
(c)
For the three pairs , uniformly in the mark and in even ,
(6.56) and, with ,
(6.57)
Proof.
We use Iwaniec’s upper bound for the linear sieve [13]. Let be a finite sequence and a level. Let be the product of the sifting primes below . The upper weight of [13, p. 313] is when , , and for every . Otherwise it is . With these are the gates of (6.3), so (6.3) is this weight on . By the definition of [13, p. 310] and Lemma 2 there [13, p. 313],
for every , since is plus nonnegative sifted counts. If the density satisfies (6.55) with a constant and , Lemma 3, (12), of [13, p. 313] gives, with ,
(a) Let be a prime in one of the pieces (6.7) and a mark with . If , then . The inequality for the one-term sequence at level gives
| (6.58) |
This holds for every , in particular when . Omitting in (6.2) only enlarges the count. The condition is , and by (6.5). The pieces (6.7) partition . The point lies in and lies in . Summing (6.58) over and , each mark with its multiplicity, gives by (6.8).
(b) For odd ,
The factors with equal one. Omitting them only lowers the product. Mertens’ theorem, with its uniform error term, bounds the product of the first factors over by . The product of the second factors over is at most . The constants are absolute. This gives (6.55) with one , independent of and of .
(c) The limiting ranges of for the three pairs are
all inside . The factors move by . Hence and for . Then (12) gives (6.56), with an error uniform in the mark, the pair and . For (6.54), use the factorization in (b) for odd and restore the factors with . The primes with number at most and change the product by a factor . By (6.5),
The outer weights are positive, so (6.56) may be summed termwise. Since is Lipschitz on the compact range above, the prime number theorem and partial summation give (6.57). Marks dividing number at most , and endpoint atoms and the logarithmic buffers contribute . ∎
The delayed branch of occurs only for , when , where .
Define
| (6.59) |
The rational endpoint is as in Paper II [27, (A.13)]:
| (6.60) |
The inequality is certified by outward interval evaluation. No central approximation is rounded. Since , the interval masses give
| (6.61) | ||||
Here . No mark multiplicity or singular-series factor is suppressed.
On , the explicit upper-sieve formula gives
| (6.62) | ||||
The last integrand is increasing on this interval. Put
| (6.63) |
Combining (6.61) with (6.60) gives
| (6.64) |
The remaining integral is elementary. The linear-sieve functions and are as in [14, (1.8)–(1.9), pp. 172–173]. Set . On the ranges here,
| (6.65) |
This is the linear-sieve normalization [14, p. 202][26, (2.23)]. Write the delayed contribution as
| (6.66) |
Substitution gives
| (6.67) | ||||
Swap the order in (6.66) to obtain
| (6.68) | ||||
For , set . The composite midpoint sum has error at most
Directed interval differentiation on covering boxes gives . An independent directed-interval replay encloses in . Outward rounding therefore gives
| (6.69) |
Thus we may use the certified rational floor
| (6.70) |
The exact integral and its certified floor are distinct.
Proposition 6.12 (Sixth-sum source applications).
On the exact arrays above, the following hold.
- (1)
-
(2)
The three low discrepancy bounds (6.20).
- (3)
Proof.
Items 1 and 2 are Lemmas 6.11 and 6.1. For item 3 fix . Choose in this order: ; ; the saving in Lemma 6.8 and the saving in Lemma 6.9. Then fix the Siegel–Walfisz precisions that these require, the buffers (6.19) and , and the constant . Choose the common threshold last. The rows partition : is all of . The sums in and in are split at , and . Each boundary goes to the interval on its right.
Direct rows. These are and the part of with . Fix the outer variable , respectively . Terms with , respectively , vanish in . Otherwise is the kernel of (6.28) for in the reduced class , and similarly for . The parent is , respectively . The free variable runs over , intersected with in the -row and with any prefix cut. This interval lies in . Condition (W1) holds. For we have . If the right -row is nonempty, then , since . Thus Lemma 6.2 applies with this . (Equivalently, split at into and . Each lies inside a dyadic parent with . This only doubles the constant.) The weights and are bounded and monotone in . Partial summation and (6.31) with bound both rows by .
Convolution rows. These are with (tested , ), with (tested , ), and with (tested , ). Each tested array contains the strict roughness factor . This is explicit for . It follows from and from . Lemma 6.4 gives (6.34) on these original parents. Write as in (6.40). Lemma 6.6 places the joint support in (6.39). Discard a dyadic shell pair , if vanishes identically there. Otherwise a supported pair in it satisfies , , and . Hence this occupied shell satisfies all scale conditions of Lemma 6.8. Lemma 6.7 expands on the whole Cartesian shell into rank-one terms with . The unary caps and coprimality are kept. Each rank-one term is estimated on that whole shell. Its factors need not preserve the joint condition or the condition , since Lemma 6.8 imposes neither. Apply Lemma 6.8 with saving to each term on each occupied shell pair and each product prefix . Since , the total is , uniformly in . The factor is then restored by Stieltjes summation, as in (6.50).
Central rows. The four central rows are bounded by Lemma 6.10.
Proposition 6.13 (Sixth-sum estimate).
Fix in the range stated above before taking . Then, along even integers,
| (6.71) |
In particular, the certified floor in (6.70) gives
| (6.72) |
Proof.
By Proposition 6.12(1), . Use (6.14), obtained from (6.12) and (6.13). Fix , so that . The three low discrepancies are by Proposition 6.12(2). The term (6.15) is . Also by Proposition 6.12(3). Hence , and (6.64) gives (6.71). Enlarge the vanishing error to make it nonnegative. The certified floor (6.70) gives (6.72). ∎
The precisions are fixed in the order (6.52). All constants precede the common threshold. Their dependence through prime Siegel–Walfisz may be ineffective. The final section uses only (6.72). It uses the certified rational floor in (9.2). Its gain is independent of the common coefficient used in the balanced-semiprime and switched comparisons.
7. The balanced semiprime term
We bound the complete occurrence sum . The two prime orientations keep their multiplicities. In this section, fix
| (7.1) |
The final argument uses (1.2). Every limit below fixes and first. For row three, write . This is the fixed floor of Paper I, §3.1.
7.1. The convolution source
Define
| (7.2) | ||||
The last bound counts integers in the removed interval. A prime square contributes one occurrence. No new ordering or coprimality restriction is imposed.
For a finite sequence , put
| (7.3) |
Both terms use the full support. For this source, PNT and partial summation give
| (7.4) |
This is the calculation of Paper II, [27, (5.44)–(5.51)]. The moving top removes at most mass.
The required convolution estimate is
| (7.5) |
for every fixed . Its proof keeps the complete occurrence source and the moving top. Fix a top . Before the discrepancy estimate, compare the exact cell sources (7.10) with their upper and lower convolutions. Each signed child keeps the natural coprimality comparator . It is not replaced after summing the blocks. The step from to costs the endpoint bands (7.11). It also costs the removed top mass in (7.2). The actual moving-top application is proved below.
We use the following convolution input. Let have supports . Put , and fix . Assume
| (7.6) |
uniformly for every fixed , , and . Here is the divisor function. Then Fact 3.3 gives
| (7.7) |
The constants depend on all family constants in (7.6). This specializes Fact 3.3. It is Paper II, Lemma 5.1 [27, (5.23)–(5.28)]. It applies to complete rectangular supports.
We make the interval reduction explicit. Fix a target , and put . Choose
| (7.8) |
Close the final upper endpoint. For the fixed top , put
| (7.9) | ||||
For on the positive integers write , and put . The exact cell source is
| (7.10) |
The definitions give the pointwise envelopes . Their difference is supported in multiplicative boundary bands at and . Put . Let . Then , with support in . Each integer has at most two ordered factorizations into primes. Since and satisfies ,
Since , counting integers in the two complete boundary bands gives the displayed mass bound. Paper II, (5.47), gives the aggregate boundary discrepancy
| (7.11) |
The term includes the bounded-multiplicity changes at exact endpoints. Split the second factor into dyadic blocks :
For each block meeting the support, , so , with only blocks. Here means , as in Section 3. For the short factor, the theorem-scale parent is ; since eventually, lies in that parent. The norms are
| (7.12) |
The prime number theorem on these intervals also gives a matching lower bound. It is for all sufficiently large . This lower bound normalizes the conversion of the absolute prime Siegel–Walfisz error to (7.6). The prime-interval form of (7.6) holds uniformly in . For a fixed target , write for the chosen logarithmic level. For auxiliary moduli , this is prime Siegel–Walfisz at arbitrarily high fixed logarithmic precision. The divisor loss from excluding primes dividing the auxiliary integers is absorbed into . For , use
and , taking larger than the requested saving. For every fixed target , choose . The grid has intervals. The prime number theorem gives the norm bounds (7.12). With , Fact 3.3 and Paper II, (5.23)–(5.28), bound the rectangular blocks by . The boundary term in (7.11) is . Increasing the single fixed logarithmic level buffer absorbs the constants. Thus the complete moving-top source, including the actual top , satisfies (7.5). No fixed-width truncation estimate is substituted.
7.2. Four directed sieve rows
Let . Put
| (7.13) |
There is no prefix–cofactor coprimality condition. Both source primes exceed eventually. Thus, for every supported modulus ,
| (7.14) |
Here is the largest prime factor, with . For the squarefree sieve divisors, use the multiplicative density
| (7.15) |
This is the squarefree-divisor density of the linear-sieve application. That input requires its zero prime-power tail. The full arithmetic density is for and . No estimate uses its prime-power tail. The two densities agree at active primes. These are the only local factors used by the main-mass calculation. In Paper I, Theorem 2.6 notation, this density is
Thus , and condition (2) has zero left side. For ,
The product of the second factors over is . Hence Mertens’ product estimate gives condition (1) with exponent one and one fixed . We may take . These are the dimension and prime-power inputs of Iwaniec’s linear sieve [13].
If is prime, it is at least . It therefore exceeds eventually. Hence
| (7.16) |
Use the ordered primes in . The exact decomposition of (4.26)–(4.30) gives
| (7.17) |
Here
| (7.18) | ||||
Every prime in these sums belongs to . The last sum keeps the half-open cells it inherits. The symbol restricts by
| (7.19) |
Here is the full eight-branch packing function, (3.29). The infimum uses the complete closed ordered cell. It does not use a quadrature node.
The four directed applications are
| (7.20) |
The first three cutoffs are . The fourth cutoff is . The canonical functions are Iwaniec’s linear-sieve functions [13]. Extend by zero for . No shifted beta-sieve profile is substituted.
For each prefix product , let be the cofactor sequence indexed by , with multiplicity when . Put . Write for the row cutoff, for its level, and . Every prefix prime is at least , and each squarefree sieve modulus has prime factors below . Thus , and the local identity (7.14) gives the exact remainder identity
| (7.21) |
Since and , the local main term is , as required by Theorem 2.6. For rows , put , with for row zero, and . The clipped exponent cells give
Hence . The upper rows satisfy . The lower row satisfies . For sufficiently large , with fixed, . Apply Paper I, Theorem 2.6, (2.30), with density on , for , and sieve parameter . With , the resulting directed inequalities are
| (7.22) | ||||
Only the upper bound is used. No sign of is assumed. Since , replacing by weakens each inequality. The actual dimension and prime-power constants, the level lower bound, and the fixed- threshold are in (7.40).
The superscript below marks errors from this linear-sieve theorem. It does not denote a separate family of profiles. For row , sum over its actual prefix set . Let be on the upper rows and on the lower rows. The definitions used in the signed equalities are
| (7.23) | ||||
Summing (7.22) over prefixes proves . Also , so . These nonnegativity statements are proved at source level for the exact signed remainders in (7.21). No sign of these remainders is assumed. Write the directed equalities as
| (7.24) | ||||||
Lemma 7.1 (Signed row identity).
With ,
and every occurs with coefficient .
Proof.
Substitute (7.24). The lower rows carry the row sign , which turns into . ∎
For rows , the total moduli in these remainders fit the level of (7.5). A tail tuple satisfies . In the parity ending in a defining cubic condition, remove two copies of the last label. In the other parity, use the preceding cubic condition and the ordering of the last two labels. The empty and one-label cases follow from the tuple definitions. Each lies in the interval , and . Thus, with the same as above,
This power buffer is below for every fixed , once is large enough.
The factors of such a modulus that are at least are exactly the ordered prefix primes. They determine and its clipped cell. Factoring the remaining part at determines the squarefree smooth divisor and the tail-prime multiset. The number of tail labels is at most . Equal-label permutations contribute at most . Each AA coefficient has modulus at most one. The number of label vectors is less than . Hence the total coefficient at each modulus is at most , independent of . Apply (7.5) with target . Divide by ; here by Paper II, (1.2). This proves
| (7.25) |
The low-row bound uses Fact 3.3, the prime Siegel–Walfisz theorem, the prime number theorem and the Paper II convolution inputs. It gives no estimate for the principal masses or row three.
The are the directed main terms. The are signed arithmetic remainders. Thus, with ,
| (7.26) | ||||
This step is finite algebra. The directed source comparisons are proved separately.
The canonical row masses are explicit. For a prefix cell , put
Since the prefix primes exceed every sieve prime, the product over sieve primes at each row is . With the ordered cell sets from (7.31),
| (7.27) | ||||
The masses are these sums with and replaced by . In particular, the row-three retention indicator appears in both sums.
7.3. The principal functional
We display the numerical functional used for . Set
| (7.28) | ||||
The subtraction of precedes both guards. This is Paper II, (4.70)–(4.72) [27, (4.70)–(4.72)]. Put
| (7.29) | ||||
We keep the true delay-function tail. Paper II, (4.73)–(4.75), gives the constant cancellation
| (7.30) |
The finite-parent comparison also needs its direction. Fix a finite clipped partition of . Its cells have endpoint ratios at most . Each clipped cell is a product of half-open exponent intervals with . Here is the lower endpoint, so , i.e. . The closure is used only for infima and lower bounds. The cutoffs in and the factors in use this convention. For a clipped cell , let . Define
| (7.31) | ||||
Here . Each cell is intersected with this ordered domain. Its weight includes the actual ordered multiplicity. The required comparisons are
| (7.32) |
The last line is an upper comparison. It asserts no equality between finite sums and integrals.
Compare the six canonical branches of with their matching branches among the eight parent branches of the packing function in (3.29). Adding to an unguarded canonical branch gives the matching parent branch. For an active canonical guarded branch, the parent guard is also active, and adding again gives the matching parent branch. An inactive canonical guarded branch is zero and cannot maximize the canonical ceiling, since its first unguarded branch is positive on the ordered domain. The two extra parent branches can only increase . Hence pointwise on that domain. On a closed anchored cell, each coordinate moves by at most . Fix a point and a maximizing canonical branch there, and use its matching parent branch. If it is guarded, its guard has reserve throughout the cell. This selected branch changes by at most across the cell. Therefore
| (7.33) | ||||
Monotonicity of , together with this reserve, gives the directed kernel comparison
| (7.34) |
Summing over cells gives the upper comparison in (7.32). It does not identify a finite sum with the integral.
Put . We need the arithmetic-to-integral estimate
| (7.35) |
The quantity contains only the canonical values of and . The linear-sieve errors and the remainders lie outside it. They are paid in (7.38) and (7.47). Fix . Three inputs enter. The first is the two-orientation arithmetic-mass estimate for the source (7.2). The second is its four signed canonical AA main masses (7.27). The third is the finite functional in (7.31). For all sufficiently large even they give
Here the error tends to zero with and the cell count fixed, as tends to infinity. This estimate is for the finite functional in (7.31). It gives (7.35) directly, so can be the threshold of this fixed- statement. This bound controls only the principal-mass term. It does not control the AA remainders, the optional numerical certificate, the complete exterior comparison or the endpoint terms. No sharper arithmetic-mass estimate is used here.
For the exterior comparison we use the common coefficient
| (7.36) |
For , use the tight endpoint of Paper II, (A.10a). It holds for the exact profile (7.29) [27, (4.73), (4.75), (A.10a)]. Its weaker displayed endpoint is not used. The Taylor-model delay certificate is used for this coefficient comparison and is not an input to the shifted replay itself. It gives the explicit bounds
Since , (7.29) then gives
The finite delay calculation and this rational budget do not replace the source-to-profile comparison or its fixed-parameter hypotheses. For the scalar inequality, define
| (7.37) |
The rational enclosure follows from Euler–Maclaurin for at , through . The next-term remainder is bounded by . Both and are enclosed outwards by the certified exact-input record. For , the even Taylor partial sum of is an upper bound. Thus the exact rational comparison in (7.37) proves .
The switched comparison uses the same coefficient. At , the common final-margin inequality (9.24) has slack on the stated route . Both comparisons use the same bound. Scalar positivity does not establish the required source estimates.
7.4. The complete error bound
The analytic hypotheses are stated below. The sums are over the original applications. The four principal linear-sieve errors satisfy
| (7.38) |
Let be the absolute constant in Paper I, Theorem 2.6, (2.31), and define
| (7.39) |
The coefficient four is the factor two in (7.43) times the factor two in the common bound . The sum over the four rows is already included in . It is independent of . It is unrelated to the global tensor constant in (6.40). All four actual levels satisfy . We use (2.31) with the actual fixed dimension constant . For the squarefree density in (7.15), the left side of (2.27) is zero. Hence the actual prime-power constant is . This value is used in the exponential below.
| (7.40) |
once . Name the corresponding even threshold
It is chosen at fixed . Every satisfies the displayed decay bound. The four ordered harmonic row masses, before the common Euler and source factor, are bounded by
| (7.41) |
For the last inequality use . The factor allows the anchored-bin endpoint enlargement. The first three identities are the volumes of ordered logarithmic simplexes. For the fourth, bound and integrate over the ordered simplex. The sum of the four displayed upper envelopes is , the four-row envelope used here. It is distinct from Paper II’s coarser global sieve-error bound. Let . PNT and Mertens’ theorems, uniformly over the finitely many fixed- cells, give
For the retained row, on each cell. Dropping the retention restriction only increases its mass. Consequently
| (7.42) | ||||
The bracket is smaller than , with relative gap greater than for . The coarser bound still leaves relative gap greater than . Consequently, for each fixed , there is a threshold such that, for every even , . Define
Thus both the density estimate and (7.40) hold above , as required for (7.38). The maxima defining and below include this combined threshold. The displayed source-density bound below is weaker by a factor of two. Let be the nonnegative principal mass multiplying the relative sieve error in row . The resulting bound is
| (7.43) |
Multiplying it by gives (7.38) with (7.39). The Euler factors and the actual-source mass identification are included above. The secondary decay is paid once.
The positive peel is bounded by the two-form argument of Paper II, [27, (4.46)–(4.56)], applied to the original source. Put with multiplicity . For in , put and . Write . Every in the support is a product of two primes at least . Hence is odd and -rough. Write . Then is odd. A prime dividing and would divide , which is impossible. Hence both forms and are free of all primes below . Therefore is at most the two-form Selberg majorant of [27, (4.48)–(4.53)] on , once for each layer. All prime factors of are at least and lie in . Hence , and is as in [27, (4.48)]. Retention gives, as in [27, (4.55)],
| (7.44) |
Consequently [27, (4.47), (4.53), (4.54)] give, eventually and uniformly in ,
| (7.45) |
since one layer is at most with , and . The bin sums are [27, (4.56)]: , and lie in one parent bin. Therefore
| (7.46) |
and with , for . The coefficient includes the two layers. No orientation factor is added.
The remaining estimates are
| (7.47) | ||||
The first line is (7.25). The second is Proposition 7.3 below. Its displayed terms come, in order, from the squareful mask, proper powers, logarithm freezing and the boundary. The last two are the combined logarithmic Type-II and Type-I-2 bound and the Type-II power-saving term.
7.5. The row-three remainder
We bound the complete third-row remainder of the actual source (7.2) by Paper I, Theorem 3.2. Every other contribution is bounded separately. Fix . Write for the retained cells with . Its size is . For put , and . Let be the actual half-open exponent interval of coordinate of the clipped cell. Then . Put . For every , and , also for a clipped interval. Write for the upper endpoint of . On the actual coordinates satisfy . Two of the intervals are equal or disjoint.
Exact occurrence map.
By (7.21) and Paper I, (2.30), (2.32)–(2.33), applied to at level , cutoff and ,
| (7.48) |
Here with no tail (). For , and . All coefficients have modulus at most one and depend only on . The identity is exact at every supported modulus. Let be the number of orderings of the equal intervals among . Let be times the same sum, with independent and no tail distinctness. Then
| (7.49) |
where collects unrestricted terms with for some forbidden pair . collects the remaining unrestricted terms with for an equal-interval pair . A prefix prime is at least , and every tail prime is below it. The primes of are below . Unequal grid intervals are disjoint. Hence every modulus in the support of or is divisible by for a prime . Here .
Support, cutoffs and constants.
Every supported modulus is coprime to . The cells are clipped to , and on . Thus . The actual coordinate bound on also gives . Hence
| (7.50) |
and . By the cubic tail conditions, for . Thus every supported modulus satisfies
| (7.51) |
Since the cell ceiling gives and , . Thus . The cutoff comparison uses only this exponent inequality.
Every labelled prime is at least , so the number of labels is below . With and the vector count , one has , and .
The squareful terms.
Since , Paper I, (B.5), with and gives
| (7.52) |
Prime detection and the two Heath–Brown expansions.
Put , so for every occurring box scale . Both source primes exceed . Apply Paper I, (B.7), to and to . Apply Paper I, (B.9), with roughness , to with cap and to with cap . The identities apply since and . For patterns the tested index is a labelled tuple , at most twelve coordinates, with
the Möbius coordinates of at most , and coefficient . Here is the coefficient after (B.10). For a fixed product , put
| (7.53) |
Thus the Heath–Brown tuple map uses the point-mass discrepancy . The exact weighted point-mass expansion is
The weight keeps both eligible ordered orientations, as in (7.2). A prime square is counted once. The proper-power remainder consists of the pairs in which or is a proper prime power. For every fixed ,
| (7.54) |
exactly. Each tuple keeps the natural discrepancy of its own product. The per-cell coefficient bound is the factorial bound above; the sum over cells uses the separate aggregate bound defined there. Since , and with . The tuple multiplicity is at most . The divisor bounds , and Cauchy–Schwarz give
| (7.55) |
There are proper-power pairs, and . Therefore
| (7.56) |
Boxes, logarithm freezing and faces (H6).
Put . Use the equal-ratio mesh of Paper I, (B.12), with replaced by , on every ambient coordinate axis. Keep as an atom. A box is a Cartesian product of cells. Its lower endpoints are , and . Let be the sums of over the two sides. Then on every box meeting the source, so . Replacing by changes the weight by , since . By (7.55),
| (7.57) |
The faces are , , , , and the cap faces , on Möbius coordinates. All are singletons. On each, an active coordinate is at least . Paper I, Lemma (B.14), with , and , gives at most boundary tuples. Cauchy–Schwarz with (7.55) gives
| (7.58) |
Thus (H6) holds with , . On a nonboundary box every source cut and cap is constant. The coefficient is the outer scalar , times with . Each side carries exactly one logarithmic coordinate, and , hence the scalar norm bound . Each coordinate meets at most cells, so
| (7.59) |
Classification.
Let , , and . A box is Type II if some . Select the largest such , breaking ties by the fixed coordinate order. Otherwise every Möbius coordinate is small, since and are below . On the -side, . On the -side, . These are the only side bounds needed to rule out an all-small side. Together with the global Heath–Brown sum bound , the threshold permits at most two large variables. Hence each side has exactly one large smooth coordinate. Every other box has exactly two large smooth coordinates . It has at most ten small coordinates, of product , with
| (7.60) |
There are no Type-I-1 boxes.
Type-II boxes: Paper I, (H1)–(H5) and LEN.
Fix and a Type-II box. Let its selected lower endpoint be , put , and let the other lower endpoints have product .
- H1.:
-
has the form (3.4). Here is the three prefix labels and the tail labels. The prime sets are and , , and is squarefree. Repeated primes are kept. We have by (7.51) once . Also . The selector is constant on the block. The removed corrections are and . There is no comparator correction, since the comparator is natural on every tuple.
- H2.:
-
Take the upper exponents and . For , the merged list satisfies . The reserves are , , . For a tail rank, the reserve is times the strict inequality from the conditions. Put , , . Then , , ,
The upper requirement has reserve at least , since . Also because and . Paper I, Theorem 4.1, gives . Put in slot one, with as in Paper I, (3.5). The tuple map gives , , . Slots two and three are -rough, and empty slots carry the atom . The scalar is an outer coefficient.
- H3.:
-
Let be the scales of . The loads (4.3), the slot-one load of , and give reductions . They are, in turn, in , , , . The required reductions are , with losses at most , . We also have , so with reserve . Next, with reserve , and . Thus (3.6)–(3.7) hold. The selected coefficient is , with and . The complementary coefficient , the product of the other at most eleven weights, satisfies . Here is the 23-fold divisor function, with . As in Paper I, (B.22)–(B.23), with at most eleven complementary cells, , , , so . On the doubled support, , because for every tested product of the box. Hence and , which is (3.10). The integer convention of is that of Paper I, Lemma B.22, since the mesh and the roughness are the same. LEN follows from the condition
(7.61) It gives and .
- H4.:
-
, , and every supported modulus is coprime to .
- H5.:
-
, and (3.99) gives and .
The selected-factor Siegel–Walfisz bound is Paper I, (3.25). It is proved for these three coefficient classes with any . In the large-norm case of Paper I, (3.48), the zero mode uses Lemma 6.5(ii) in place of [3, Theorem 0(a)]. Its premises (3.1), (3.2), (3.6), (3.8) with LEN, (3.11) and (3.25)–(3.27) are those verified above. Theorem 2.8 of Paper I enters only inside the proof of Theorem 3.2, with the dictionary
| (7.62) |
both signs, all nine smooth weights and the full bracket. Paper I, Theorem 3.2, (3.13), gives, uniformly in the box, the block and the cell,
| (7.63) |
With , , and (7.59), Paper I, (3.92), gives
| (7.64) |
Here already contains , hence its factor from (7.49). The coefficient norm (7.59) sums only , so the orbit factor is paid exactly once.
Lemma 7.2 (Relaxed Type-I-2 estimate).
The source hypotheses are the Type-I-2 conditions (SH1)–(SH5) stated in Paper I:
For a direct shell , assume the following source conditions (SH1)–(SH5).
- (SH1)
The coefficient is independent of tested variables, , , , , and on its support.
- (SH2)
The tested geometric source and cap restrictions are constant on each nonboundary box; the roughness sieve is separate as in (SH3). Smooth factor weights have .
- (SH3)
All HB factors are rough at the threshold or .
- (SH4)
The discrepancy is exactly (3.3).
- (SH5)
The assignment priority is proper prime powers, boundary boxes, Type II, Type I-1, then Type I-2.
Assume (SH1)–(SH5) for a nonboundary K2 box. Let the two large smooth variables have nonnegative weights and . Let the remaining small variables, at most ten, have product . Assume
and . Then, for every fixed , uniformly in the supported unit residues,
The same statement holds for a fixed finite sum of signed weights. Split each bounded real weight into its two nonnegative parts.
Proof.
Restrict first to , and write for the positive congruence and comparator functionals. In the K2 application the inner product is , the residue is , and . If , then , so both and the comparator vanish. The omitted range contributes zero. Apply the Brun–Bonferroni sandwich of Paper I, (3.102)–(3.104), at , . For a requested fixed logarithmic precision , put
and increase the common threshold until . Since and , this is eventual at fixed , and .
For the two large factors put and . Positivity gives
so the three signed gaps and the two nonnegative comparator gaps bound , as in Paper I, (3.113). Expand the three gaps over . The completed hyperbola estimate (3.109) gives . Here we fix . Squareful moduli are included by the full-modulus Weil–Estermann bound.
The two one-dimensional sieve gaps satisfy
Thus the total is bounded by
| (I-2’) |
The ten-variable check uses the following upper bound. The expression is increasing throughout , so its maximum is evaluated at :
where absorb all fixed dyadic factors, so , consistently with (7.60). Eleven small variables would give , which exceeds the allowed bound. With , the first exponent in (I-2’) is at most
leaving slack . Also, using , , and ,
The coefficient bound uses , so is fixed. Finally, a family of at most boxes is absorbed by requesting , after all fixed logarithmic losses. This proves the lemma. ∎
Type-I-2 boxes: the complementary estimate.
Lemma 7.2 is a relaxed form of Paper I, (3.111), for this source. Below we check each displayed hypothesis against the actual K2 source.
For the present K2 Type-I-2 box, the nontrivial SH2 check is the display
| (7.65) |
Thus the two tested large factors have the required nonnegative weights and bounded supremum plus variation. The roughness condition is not hidden inside the weight.
For the Type-I-2 boxes above, (SH1) has . The support and bound are (7.51) and (7.49), , and the residue is the unit . The partition construction proves the geometric constancy in (SH2) on each nonboundary box. In this two-large-variable case the two tested large factors are the selected smooth factors. The roughness restriction is kept as the separate condition in the inner sum. Their smooth weights are then individually or , not . Hence they are nonnegative with as required by (SH2). The factor occurs only among the complementary small factors. Condition (SH3) is . Condition (SH4) is the natural full-product discrepancy fixed above. Condition (SH5) is the priority in the preceding boundary and Type-II classification.
On a large-coordinate cell , , one has . The smooth weight has supremum plus variation equal to 1. The alternative is nonnegative and increasing, with
The roughness restriction remains a separate tested condition under (SH3) and inside the sieve, and it is not claimed to be constant on a box.
Thus the relaxed estimate of this chapter applies with , the two large smooth weights nonnegative, and
Each of the at most ten small labels contributes one factor. Normalized logarithmic weights are at most one on the support. Thus the coefficient hypothesis uses the fixed divisor exponent , independent of . The first term of (I-2’) uses the following values. The slack is at exponent . The two final terms have the bound . The absorption is , and the divisor bound is with . By (7.60), Lemma 7.2 applies to every K2 Type-I-2 box. Requesting for the fixed box family (here ) gives
| (7.66) |
Proposition 7.3 (Row-three remainder).
Proof.
By (7.48) and (7.49), is the -sum minus the squareful sum (7.52). By (7.54), the -sum is plus the tuple sum. Every tuple lies in exactly one box. The boundary tuples give (7.58). On the other boxes logarithm freezing costs (7.57). Each box is of Type II or Type I-2. Sum (7.52), (7.56), (7.57), (7.58), (7.64) and (7.66), with pairs . Dividing by gives the claim. ∎
Proposition 7.4 (Exterior source estimates).
Proof.
Proposition 7.5 (Exterior comparison).
For fixed there is a nonnegative such that, for with as defined below,
| (7.67) | ||||
Here . The threshold is from the fixed-parameter estimate at (7.35). is from item 2 of Proposition 7.4. Both exist with fixed. Finally, is the named length and application threshold of Section 2. In addition,
| (7.68) |
In particular, let be the least even threshold above which , and set . These thresholds exist at fixed .
Remark 7.6 (Single payment of each error).
In [26, Theorem 2.6, (2.30)] the three summands , and are distinct. The first is paid only by (7.38), the other two only by (7.47). The decaying part of (7.40) and the in (7.42) are absorbed by thresholds at fixed . The peel term contains no linear-sieve application. Thus
and no error is counted twice.
Proof.
Use (7.26) and divide by . The principal term is bounded by plus its positive part. Also by (7.36)–(7.37). Proposition 7.4(2),(3) pay the sieve and peel terms above . By definition, includes , and . The remaining terms form . First, . The positive part contributes by (7.35). The row remainders are by (7.47). Hence . The convergence is ineffective through Siegel–Walfisz, so exists but is not computed. ∎
8. The switched sum
We estimate the single term . The normalization is (2.2). Fix as in (2.4). Put
| (8.1) |
All limits in this section fix first.
8.1. A common nonnegative source
We use the prime-coordinate cells of Paper II [27, (5.29a)–(5.31)]. Their rules are
| (8.2) |
The and increase in and . The outer sentinels are infinite. Let contain the cells with . For such a cell, put
| (8.3) | ||||||
Since , we have
For , maximize at , ; the resulting concave quadratic has maximum at . The cases give at most . The strict cells are disjoint, so this proves the bound for . Every prime is permitted in . In particular, has no factor . Keep the selector in the switched source. The required pointwise comparison is
| (8.4) |
Here denotes the Möbius function. Paper II gives zero positive part when [27, (1.7), (4.9), (5.29a)–(5.31)].
Proof of (8.4).
Let satisfy the side conditions and write , , . If , every occurrence in (4.3) vanishes, because it requires and [27, (1.7)]. Then . Assume . Since and , we have . If , the selector vanishes. If , Paper II, (4.9), gives . Its hypotheses are exactly squarefree , , and [27, (4.9)]. Let . The table after Paper II, (5.29a), shows that the three negative pair counts vanish, so
where counts first-band coordinates below [27, (5.29a), (5.30)]. The bins determine . If , then exceeds every first-band coordinate, so . If , then , and is the unique with (infinite sentinels). It is nonincreasing in . Thus lies in exactly one cell of (8.2), and [27, (5.31)]. If , the left side of (8.4) is zero. Otherwise and , so the left side equals . This proves (8.4). The same argument, without the upper cut, gives
| (8.5) |
for squarefree with and .
Put
| (8.6) |
The definitions give the finite identity
| (8.7) |
Under (8.4), the required bound is
| (8.8) |
There are at most rough squareful integers. Each costs at most , by the pointwise weight bound of Paper II, proof of Lemma 1.1, immediately after (1.11) [27, Lemma 1.1, proof after (1.11)]. The last two terms cover the top strip and small primes.
Proof of (8.8).
Write for , . Every prime has , and . Hence , and
Here unless and , and always [27, Lemma 1.1, proof after (1.11)]. Split the summands into three classes; overlaps only enlarge the bound. (i) Non-squarefree with number at most ; they cost at most . (ii) Squarefree with number at most ; by (8.5) they cost at most . (iii) The primes with squarefree cost at most , again by (8.5). For the remaining squarefree with and , (8.4) gives a zero summand. This proves (8.8). Since , .
8.2. Four rows and the lower-sieve cutoff
Use the clipped intervals . Let comprise the ordered prefixes
Write . The empty prefix has . Define
| (8.9) |
This is Buchstab’s finite identity [27, (4.18)]. Its coefficient is for . At it equals .
At depth three, let be the infimum of on the closed clipped parent. The underlying prime cells stay half-open. The closure is used only for this infimum. Use the whole anatomy function before choosing a branch [27, (2.17d)–(2.17e), (4.19)]. Set
| (8.10) |
Retained prefixes have . For these prefixes define
| (8.11) | ||||||
The union bound gives . Therefore
| (8.12) |
The favorable term enters exactly once [27, (4.45)].
8.3. Capping the first three levels
At depths , replace the relative level by
| (8.13) |
Here at depth zero. Depth three keeps (8.10), with . The elementary bounds are
| (8.14) |
The modulus includes the smooth divisor and every tail prime. The exponent is kept. The cap changes no row-three level.
The lower floor changes the repeated-prime argument. Put
| (8.15) |
(P2.8b) Rough-coordinate and repeated-prime bounds.
Assume the support and rough-coordinate hypotheses stated below. These are the capped version of Paper II’s Lemmas B.1–B.4. The coefficients and masks are defined in (8.30). Every rough coordinate is at least . On an active block, count these coordinates by . The capped modulus bound gives
| (8.16) |
The prefix orbit size is . The small-prime part of fixes the smooth divisor. The rough multiset fills at most labelled positions. Thus
| (8.17) |
Define . The forbidden and allowed-repeat masks satisfy
| (8.18) |
Writing and overcounting gives
| (8.19) |
The tested measure has and support below . For , throughout . Consequently
| (8.20) |
Per block, these bounds give
| (8.21) |
There are finitely many blocks at fixed . Division by proves the conditional estimate
| (8.22) |
These are Paper II, Lemmas B.1–B.4 and (B.3)–(B.7), with replaced by on rows [27, Appendix B.1, Lemmas B.1–B.4, (B.3)–(B.7)]. Row three keeps , since its level floor in (8.43) exceeds .
Verification for the capped rows.
Fix a block in row . Prefix primes lie in , so their product is below . The tail tuple satisfies by its last cubic constraint, and the tail primes are below ; also . Thus
Every prime of lies in and , so . Tail primes are at least . Prefix primes are at least , because . Also . For an active block choose a nonzero realization. Then , so , and . This is (8.16). The primes of below determine . The rough multiset fills the labelled positions in at most ways, and . This gives (8.17). It also gives (8.18). A forbidden tuple repeats a prime . An allowed non-squarefree tuple has with , since is squarefree and coprime to the rough part. The grid count of Paper II, Lemma B.1(4), gives finitely many blocks at fixed . These are Paper II, Lemmas B.1–B.2, with replaced by [27, Appendix B.1, Lemmas B.1–B.2]. Lemma B.4 with and gives (8.19). Lemma B.3, with , support in and , gives (8.20). Then gives (8.21). Row three is Paper II, Lemmas B.1–B.4 as printed: its modulus bound and floor are (8.43). Hence (8.22) holds for all four rows.
8.4. The signed sieve identity
Put . For all four rows, define
| (8.23) |
Let for even , and for odd . For a prefix , set
| (8.24) |
All cutoff primes lie below the prefix primes. Thus the density product on the sieve support is . The squarefree remainder is . Apply Fact 3.17 with , , and . Choose a common nonnegative majorant
| (8.25) |
The signed sieve error satisfies .
Verification of the sieve data.
Fix a row, a cell and a prefix , and sieve the finite multiset with multiplicity by below . Every prefix prime is at least : on rows it is at least , and on row three . Hence for . In particular for these ; the primes are all and are never sifted. For squarefree such ,
so . Each remainder modulus in (8.26) is squarefree. Here uses primes below . Tail primes are at least and distinct (equal labels by the mask, unequal grid intervals disjoint). Prefix primes are at least . Next, for every (all such are odd), off , and for . Hence the second condition in (3.19) holds with . For the first, , and Paper II, (5.5), gives
with one absolute , uniformly in [27, (5.5)]. Take in (8.25) to be the maximum of this and the constant of (3.25). It remains absolute and is fixed before . The product of Fact 3.17 is then . The levels satisfy on rows () and on rows (, resp. , i.e. ). Fact 3.17 with , , therefore applies to every actual sequence, and (8.28) follows with , .
For each cell fix one coefficient construction. Use it for every prefix realization in that cell. Write its remainders as
| (8.26) | ||||
The coefficients satisfy [26, Theorem 2.6, (2.29)–(2.33b)]. Define the finite quantities
| (8.27) | ||||
The sums keep strict prefix order. Under the stated sieve hypotheses,
| (8.28) |
Multiplying the signs gives
| (8.29) |
Every remainder in has sign .
8.5. The natural coprime comparator
A block fixes a row, a cell, and either remainder type . The tail vector is empty for . Prefix realizations stay inside the coefficient. Let impose prefix and tail distinctness. Let be the unrestricted labelled coefficient. Define
| (8.30) | ||||
The two comparator discrepancies are
| (8.31) |
For , put
| (8.32) | ||||
This is a finite coefficient identity [27, (4.22)–(4.26), Appendix B.1–B.4]. All moduli satisfy . That restriction does not puncture .
8.6. The full-support bilinear application
Split each prime coordinate into relative-width intervals. An interior box has constant order and descriptor predicates. For , put
| (8.33) |
The box contributes exactly . For and ,
| (8.34) |
A composite has a smaller prime divisor. This is Paper I, (3.8), option 1 [26, (3.8)–(3.9)]. Its logarithmic replacement error is zero.
Define the full-support discrepancy
| (8.35) | ||||
There is no condition in these sums. The exact interior decomposition is
| (8.36) | ||||
For rows , apply Fact 3.3. Its Siegel–Walfisz sequence must be the selected prime sequence. The dictionary with Fact 3.3 is , , and . Thus the prime sequence carries the Siegel–Walfisz hypothesis. We need Paper I, (3.25), in the form
| (8.37) |
The normalized hypothesis also needs
| (8.38) |
Use Fact 3.1, specifically (3.2). Its endpoint estimate gives, for every fixed ,
| (8.39) |
Full mesh intervals satisfy . Thus uniformly. This implies (8.38). The discrepancy in (8.37) is identically zero. The counting input is the endpoint estimate just displayed.
Proof of (8.37) and (8.38).
Let , , , and let be an arbitrary subinterval, so . (Paper I, (3.25), is quantified over all such [26, (3.25)].) The condition removes at most primes from each sum. If , apply (3.2) at and , with . Since , and the error is at each endpoint. Hence . The same holds for the unrestricted count divided by , up to the primes dividing . If , since both terms are at most , using . This proves (8.37) with , ineffectively, uniformly in . For the norm, on a full mesh interval, and (8.39) with gives eventually. Hence . Both bounds are uniform over all interior boxes, since only enters.
Assume (8.37) and (8.38) uniformly. Taking verifies (3.4) with divisor exponent one. Both factor lengths exceed eventually. Split each of the complementary prime intervals at any dyadic boundary. This gives at most pieces. Localize each resulting product on . Since eventually, there are at most two product dyadic intervals per piece. This bounded splitting changes no logarithmic exponent. Set . There are at most selected integers in and at most integers in a product dyadic interval. Unique factorization gives . The required application is
| (8.40) |
Use , , and in (3.5). The source has weighted boxes. There are finitely many blocks at fixed . Since , summation gives
| (8.41) |
Verification of (8.40).
The coefficient bound is (8.17), proved above, and the modulus range is (8.14). Every supported is prime to , so is a reduced class and the maximum in (3.5) covers it. The selected sequence is supported in , and , after at most two dyadic pieces, in . For , and , because . The hypothesis (3.4) holds with by (8.37), (8.38) and . Interior boxes have constant order predicates, so has one labelled representation and . Thus . On each interior box, with , and Fact 3.3 gives . Fact 3.3 is the full-support bilinear estimate derived from Bombieri–Friedlander–Iwaniec, Theorem 0(b). We verified its hypotheses above for this source.
8.7. The source-level row-three estimate
Row three keeps the full anatomy level. Its factorization keeps every labelled occurrence. The smooth divisor stays in the first factor. For and , the prefix inequalities are
| (8.42) | ||||
The anatomy branch gives . The condition gives the last inequality. In particular, with ,
| (8.43) |
Here bounds the full modulus exponent . The inherited anatomy and rough-factor estimates are Paper II, (4.20) and Appendix B, Lemma B.1(1)–(2) [27, (4.20), Appendix B, Lemma B.1(1)–(2)]. For the tail exponents , the cubic conditions give
| (8.44) |
Theorem 4.1 of Paper I then supplies the load surpluses
| (8.45) |
The required length data are
| (8.46) |
Here is the selected integer interval length. The complement has length scale . The letters are the three factor scales. Each condition holds only above its fixed- application threshold. The floor is imposed separately. See Paper I, (3.6)–(3.9) and (4.9) [26, (3.6)–(3.9), Theorem 4.1, (4.9)]. We verify them for this source below.
The remaining analytic estimate is
| (8.47) |
It is uniform over the permitted boxes and blocks. Here is arbitrary; is fixed by the local theorem. Paper I, Theorem 3.2, (3.13), supplies the local dispersion theorem. Its Theorem 2.8 enters only in the inner spectral stage. There we use the form (P1.7), Fact 3.22, with the full bracket (3.38). The inner substitution is
| (8.48) |
The auxiliary and are those of Paper I’s dispersion proof. Both signs and the mixed cusp pair are kept. Let be smooth, zero below zero and one above one. For the fixed bump , define
| (8.49) | ||||
They sum to . Their strict dyadic windows are , , and . The two smooth modulus coordinates use all nine products , . Multiply each by the fixed cutoffs on the supported . These cutoffs equal one on the actual coefficient support. The derivative hypothesis is (3.36) with and .
Write and . The coefficient in (P1.7) is zero outside the actual indices , , . Use its supported norm
| (8.50) |
Here is the coefficient of (P1.7). It is distinct from the complementary sequence . The norm includes no coefficients outside that support. After substitution, the four bracket contributions divided by are bounded by
| (8.51) | ||||||
Only uniform factors and powers of are suppressed. These are precisely Paper I, (3.81), (3.85), and (3.87) [26, (3.69), (3.81)–(3.87)]. Each term carries the actual-use hypotheses.
8.8. The row-three local dispersion estimate
The source-wide estimate also has boundary and comparator contributions. The local argument gives only its interior row-three block.
We treat one row-three block with and one full interior prime-coordinate mesh box. We do not assert the source-wide boundary, comparator, or row-zero-to-two estimates. Fix , , , and a retained closed clipped parent , used only for the displayed infimum and endpoint checks. The actual prime cells are half-open. Keep its inherited labels , , , , and . On the whole block . The inequalities (8.42)–(8.43) apply with the inherited labels, including clipped endpoints. Here an interior source box is a full relative-width mesh box whose closure lies on one side of every source, order and descriptor face. A clipped terminal mesh fragment belongs to the boundary contribution. LEN is not applied to it.
The prefix constants can be checked without an unclipped replacement. Put . Since and , the first two gaps are at least and . For the third, and retention gives ; their maximum is at least . Likewise . Thus all three prefix WF inequalities have strict room. The whole anatomy infimum is taken before this branch bound is used.
Exact coefficient and labelled factorization (H1–H2).
Write . Give the three prefix occurrences their independent prime sets . For , append each tail occurrence, independently, with prime set . For the tail list is empty. In both cases put equal to this complete labelled list, and set or , respectively. Thus, exactly,
Neither distinctness mask is inserted here. The orbit divisor , the source weight , and the two distinctness corrections remain outside this coefficient, as in (8.30)–(8.32). In particular its supports include repeated-prime moduli, and . The prime sets are the actual clipped sets, not their unclipped parents. All labelled primes are at least with , since and .
For packing use the actual upper exponents of the clipped prime sets. The first three are at most ; all tail upper exponents are at most . The prefix masks in (8.42) and the tail masks show that their merged decreasing list satisfies , where . For a tail rank, this follows after adding at most to its tail inequality. The top three upper exponents are the prefix endpoints, belonging to the closed clipped parent. Hence their anatomy value is at least . Put , and . Every point of the closed clipped parent satisfies . On this interval the branch of Paper I gives ; hence . Therefore ; also , since . Theorem 4.1 of Paper I applies to this same labelled list, with . Let its partition be , with the smooth divisor attached to slot one. Define, using precisely the preceding prime sets,
Empty slots two and three mean the atom . Slot one always keeps the sum, even if is empty. The finite tuple map gives
The primes below determine uniquely. At most assignments have a fixed slot product. The count allows repeated primes. The rough coordinate count is less than , so and , with . For the tested boxes below, take . Uniformly for sufficiently large ,
The same tested box (H3–H5).
Use exactly (8.33) and (8.35): , , , and . No product truncation is added to . Take ; throughout this family. For sufficiently large , and , so
Thus (3.8), option , holds with . The complementary sequence is the actual of (8.33); in particular . There is no Heath–Brown expansion, logarithm freezing, or proper-power replacement error for this selected direct-prime representation. The selected-factor Siegel–Walfisz bound is Paper I (3.25), uniform in this stronger cutoff and every endpoint and auxiliary coprimality. Its relative-norm alternative is kept as in (3.48). We assume no lower bound on any coprimality-truncated selected norm. In the large-norm case of (3.48), use Lemma 6.5(ii). Its premises (3.1), (3.2), (3.6), (3.8) with LEN, (3.11), (3.25), (3.26) and (3.27) are the data verified in this subsection.
Let , , , , and , with the fixed bump of Paper I (3.9). Then on the full complementary product interval. Since and the mesh boxes are full, , , and , where . For fixed enlarge the threshold so that ; then
These follow from and . The integer convention is ; no continuous interval length replaces .
The doubled support lies in . Since , eventually. On this entire support and for every selected integer, . Consequently
This verifies nonresonance on the full doubled rectangle, including both Cauchy–Schwarz copies. Checking only where would not suffice.
After localization, denote the scales of , respectively. Theorem 4.1 gives, before fixed dyadic rounding and base conversion, reductions
in , , and , respectively, relative to their bounds . Here . The first slot includes the additional load . Each listed reduction strictly exceeds the required losses . Hence fixed dyadic constants and are absorbed for fixed . In particular the exact requirements (3.6)–(3.7) hold:
For use the positive fixed gap and . The complete modulus, including and all labelled primes, obeys
Because , impose to obtain . Take the moving frequency and : eventually and every supported modulus is prime to . This proves H1–H5 with the support relaxation of Paper I Theorem 3.2.
Application and restoration.
Apply Paper I Theorem 3.2, (3.13), to this full unrestricted coefficient and this full-support natural-coprime discrepancy. For every fixed it gives exactly
Constants are uniform in these boxes and in blocks with after fixing and source constants. The threshold is ineffective. Theorem 3.1’s smaller abstract support class is not used. The proof includes all local restorations (3.32)–(3.50): with and ,
Keep both terms in braces. They come from restoring the five cross-copy gcd failures of (3.30), the close-pair set, and the zero-mode main-term cancellation. The spectral estimate alone does not give them. The term joins the arbitrary logarithmic saving, and the remaining terms have savings exceeding .
Theorem 2.8 enters only at Paper I (3.69)–(3.90). In that inner stage, with , set , , , , and . Both signs are kept. The coefficient is exactly of (3.68) on these indices and zero elsewhere. In particular
with no coefficients added outside that support. The unweighted norm has the same bound. These are the endpoint norm bounds (3.70)–(3.81). When slot two is a unit, and every nonzero-frequency block is empty. Otherwise (3.82)–(3.85) identify the exact phase, permit , and use all nine dyadic weights from (8.49), with and . The full bracket of (3.38), including its moving-frequency and mixed-cusp terms, yields all four quantities in (8.51). No bracket term is discarded. The full bounds (3.87)–(3.90) then control the inner spectral term. After that, the restoration terms above and are put back.
Finally, this estimate concerns . The outer identity is still
Thus and enter once. The forbidden and allowed-repeat masks remain in . The natural-to- comparator remains in . The source cutoff, peel, boundary and terminal-mesh restorations, capped rows zero to two, and complete-family coefficient counts require their own estimates. This local estimate alone gives neither the complete L3 bound nor the RSW bound.
8.9. The complete box family
The required complete-family bounds are
| (8.52) |
There are at most face families per . Their integer normals have maximum coefficient five. Their coefficient sums are at most eleven.
Proof of the complete-family bounds.
Use the unclipped geometric mesh , , , in every coordinate. Boxes with a coordinate carry no source mass, since and every prime is at least . So there are no terminal fragments, and every interior box is a full mesh box. Box count. Each coordinate has at most mesh intervals for . With , finitely many cells and , . Boundary count. Let . A source integer in a boundary box has its vector within in each coordinate of a face. A radial face forces into with . There are at most such . Every other face is with integers , [27, (5.29a)–(5.31) and the facet discussion after (5.40)]. Write . For fixed , lies in an interval of relative width at most below , which contains at most integers. Here is a product of at most ten primes in , and . By Mertens, eventually. Hence one face family contributes at most . The number of face families is finite ( for each ). Thus with an absolute . No numerical value is required below. Boundary discrepancy. Let be restricted to boundary boxes. Then . By , , Cauchy–Schwarz, , and ,
with finitely many blocks at fixed . This proves (8.52), with the first bound in the form . Under (8.47), take . The box count and then leave . Equations (8.41) and (8.52) then give
| (8.53) |
provided (8.22) and the coprime-comparator bound hold.
8.10. The principal term and its price
(P2.8d) The source-independent profile comparison.
We use Paper II, (4.70)–(4.75), in the following form. Put
| (8.54) | ||||
The subtraction of precedes both guards. This is the same guard convention as equation B.14. It agrees with Paper II’s zero guard because an unguarded branch is positive, as explained immediately after that display. Define
| (8.55) |
Extend by zero below two. These are Paper II, (4.70)–(4.75) [27, (4.70)–(4.75)]. Their source-independent comparison uses
| (8.56) |
Hence a positive canonical lower term lies in a cell with . The capped rows still satisfy . Their residuals are bounded by the same . Thus the cap changes neither nor its price.
Let be the signed prefix profile:
| (8.57) | ||||
The required mass and comparison statements are
| (8.58) |
The first bound is Paper II, (5.34)–(5.42). The last comparison uses (4.72)–(4.75) [27, (4.72)–(4.75), (5.34)–(5.42)].
Proof of (8.58).
Mass. The cells are Paper II’s cells with , and the radial range is Paper II’s. The outer-box majorant of Paper II, (5.34), counts labelled factorizations into all primes in , and for the box containing the ordered factor vector of , which lies in . Hence pointwise directly (no comparison with the intermediate is used). Paper II, (5.34)–(5.42), then gives [27, (5.32), (5.34), (5.42)]. In particular eventually, since . Principal term. As in Paper II, Lemma B.9, uniformly for , [27, (B.9) and its proof]. The proof of (B.9) gives an exact factorization. Mertens’ theorem gives the asymptotic. The primes with change the product by . Every actual cutoff is at least [27, Lemma B.8]. At fixed the cells are finitely many, with fixed exponent boxes. Mertens gives , the primes dividing costing . Also is bounded. Summing gives , with supplying the factor . Profile comparison. Write , . On rows , , and decreases and increases. With and , the residuals are at most [27, (4.73)]. For row three, if at an actual point of a cell, then (8.56) gives and [27, (4.72) and the two paragraphs after it]. For , monotonicity of at fixed numerator gives . Integrating over each retained cell, . The constant parts give by [27, (4.74)]. Hence , which is [27, (4.75)] for this source.
Use the same coefficient bound as the exterior comparison:
| (8.59) |
The functional bound is Paper II, [27, (4.73), (4.75), (4.79), (A.10a)], for the identical canonical functional (8.55). Its scalar rounding is the same as (7.36). The mass bound is Paper II, (A.11) [27, (A.11)]. The optional unshifted certificate in the unshifted-comparison subsection of Appendix B is outside this proof.
The constant is optional, non-certified appendix material outside the L3 proof. In the optional scalar comparisons below, denotes the rational from (1.6). No functional comparison with is needed here. Its rational definition is
| (8.60) |
with the integers in Table 8.1.
| 0 | 4790995369589327356095267 | 5033118760359274030825472 |
| 1 | 6963256824825772577191322 | 8266496527677353149933429 |
| 2 | 8996423827217290029713216 | 9138360880901719297497815 |
| 3 | 4916164251930472277375479 | 4671424972330288696699300 |
| 4 | 329572634628519073712385 | 939590108467331323910141 |
| 5 | 9317769528669888650546075 | 5634060699913223990647374 |
| 6 | 8280830054071768648850166 | 2330146450712536415611653 |
| 7 | 389762593301325772 | 57030507720277440 |
(P2.8c) Density product and prefix sums.
Put and . The two bounds used in the first multiplier are
| (8.64) |
These are Paper II, Appendix B, Lemmas B.9 and B.11, (B.9) and (B.11) [27, Appendix B, Lemmas B.9, B.11, (B.9), (B.11)]. Each half-open prefix cell is counted once. Using from (P2.8d) now gives
| (8.65) |
Division by gives .
(P2.8e) The upper mass and the peel.
The source mass is (8.58), Paper II, (5.34)–(5.42). The native lower-sieve cutoff uses the finite peel (8.11) and the estimate
| (8.66) |
For the uniform two-form calculation, put and . The required ranges are
| (8.67) |
For each sieve prime , every prime factor of is at least , so . The local two-form root count is then for , and otherwise. For squarefree , define multiplicatively by . The denominator and one-layer bound are
| (8.68) |
Here is the product of all primes below . The last step uses . The exponent saving in (8.67) absorbs its remainder. There are at most source layers. For the parent-bin prime sums , the needed estimates are
| (8.69) |
The pair belongs to one parent bin. Multiplication of (8.68) by and this sum, then division by , gives (8.66). These are the exact steps of Paper II, (4.45)–(4.56), with the layer ceiling changed from three to [27, (4.45)–(4.56), (5.34)–(5.42)]. The uniform two-form estimates are proved here under the stated ranges.
Proof of (8.62).
Principal. Since and , the mass bound gives . Secondary sieve. uniformly, since . Lemma B.9, Lemma B.11 and give (8.65). Every prefix lies in one row, so the four depths together contribute at most [27, (B.9), (B.11)]. Peel. For in , all primes of are at least , and . Since , [27, (4.55)]. Write . Each layer consists of -rough . With , both and are -rough, . A prime dividing and would divide , and is odd. The two-form Selberg bound [27, (4.48)–(4.54)] gives (8.68) for each layer, with remainder absorbed by (8.67). The prime sums (8.69) are [27, (4.56)], since and lie in one parent bin. Multiplying by gives (8.66). Comparator. For squarefree , . A common prime of and is at least , so with ,
Summing finitely many blocks and dividing by gives , which implies the stated . This is the coprime-comparator bound used in (8.53).
8.11. The finite signed identity and its consequence
(P2.8a) Finite signed identities.
For the finite source (8.3) and stated sieve data, combine (8.7), (8.12) and (8.29). Their conditional signed identity is
| (8.70) |
Define
| (8.71) | ||||
Under the stated sieve hypotheses, all three terms are nonnegative. Consequently
| (8.72) | ||||
The favorable is used once. Every adverse remainder remains in (8.71).
Proof of (8.73).
All estimates above are proved for the same , the same cells and the same blocks. By (8.8), . By (8.62), are . For , (8.32) and (8.36) give
The terms are by (8.41); by (8.47) with , and ; by (8.52); and , . Hence . After fixing , choose the eventual threshold so that
| (8.74) |
That threshold may be ineffective. It also covers
| (8.75) |
These structural thresholds alone do not imply (8.74).
Relative to the comparison , the constant difference is
| (8.76) | ||||
The exact cost of using the common coefficient instead of the optional coefficient is
This is scalar arithmetic. Its use in the final count requires (8.72) and the common error bounds. The capped-row application is (8.40)–(8.41). The row-three estimate is (8.47), proved in the row-three subsection. All errors use the common source (8.3). The inputs are Paper I, Theorem 2.8; Fact 3.3; Lemma 6.5(ii) for (3.48); and the prime estimates of Fact 3.1. Hence (8.72) holds at the threshold of (8.74). The constant (8.76) is a gross coefficient difference. It enters the final count only together with the switched error of (8.72). In the final count this error is bounded by the caps (9.14) (, ) and by (8.74), in total at most .
9. The final bound
We keep the notation of Sections 1 and 2. All error terms below are nonnegative. The analytic inputs are (A1)–(A5) of Table 1.2.
9.1. Addition of the comparisons
Put . The constant of (1.14) is
| (9.1) | ||||
Here is Paper II’s original lower constant [27, (6.3a)]. The six endpoint gains of (5.18) are not used. The two profile gains enter separately. In particular,
| (9.2) | ||||
The last line is the conservative rational floor for the integral gain . It is not a central estimate. Section 6 separates it from the integral gain. The certified integral enclosure is . We take and as defined in [27, (A.10d), (4.84)]. Their exact values are
| (9.3) | ||||
Thus exactly, where
| (9.4) |
The coefficients are printed in Table 9.1.
| 0 | 66922148532305907989 | 0 |
| 1 | 34893223604885136721 | 0 |
| 2 | 3973350097562772509 | 0 |
| 3 | 87266878234046404033 | 48635364229120000000 |
| 4 | 28374567121249055735 | 73384187692692674921 |
| 5 | 3998 | 680564 |
The exact rational is defined in (8.60) and Table 8.1. It records only the coefficient from the historical, non-certified sharper comparison. The main count uses in both comparisons. The common functional comparison is (8.59). For comparison with the optional sharper coefficient, exact rational arithmetic gives
| (9.5) |
This is a rational comparison only. It gives no bound for . The further cost of the common coefficient relative to is exactly
The resulting main switched gain is exactly
The optional sharper comparisons are not required for (9.1). Each gain is proved on the original arithmetic source of its comparison. The gains and come from Proposition 5.10, through Propositions B.1 and B.2. The gain comes from Proposition 6.13, and from (8.72). Table 9.4 lists the bindings.
Table 9.2 itemizes the constant. Its decimal column gives approximations only. The defining formulas determine the exact sum.
| Term | Value |
|---|---|
9.2. Ten error allocations
Use the exterior error from (9.8). For the table below, a conservative majorant is convenient:
| (9.8) | ||||
Here is the exterior remainder-weight bound. It belongs to the source in Section 7. The extra factor four only enlarges this nonnegative error. It leaves the principal constant unchanged. Similarly, the switched comparison requires
| (9.9) | ||||
Here is the positive part in (8.71). The conditional limit is (8.73). These two limits concern the actual sums stated there. Both majorants are the error terms of (7.67) under (A3) and of (8.72) under (A4), with from (8.61). By (A5), and do not depend on . The exterior weight is of (7.38):
| (9.10) |
Since , this gives . In particular .
The retained and Root–A comparisons require
| (9.11) |
For Root–A, use from (6.72). The first includes every conversion and the saved-array contribution in (1.12); that contribution is not charged again. The pointwise error may use the coarser bound
| (9.12) |
Here is defined in (4.12). The explicit pointwise argument in Section 4 gives for . The coarser majorant retains the same error bound. The inequality follows from (4.13), using both the pointwise bound and the exceptional-set cardinality. Since and , the coarser majorant tends to zero: . No sharper exceptional coefficient is needed. Proposition 5.10 gives , and Proposition 6.13 gives under (A2), each at fixed . Lemma 4.1 gives for .
Fix , all absolute constants, and the source geometry first. Choose positive absolute constants and for the Section 8 and Paper II sieve bounds. Define
| (9.13) |
By (A5), these constants are independent of and . Here by (7.39). The constant dominates the absolute constant of (3.22) used in (8.25). The underlying sieve bounds come from Paper I, Theorem 2.6, (2.31) [26, Theorem 2.6, (2.31)]. Choose one rational satisfying
| (9.14) | ||||
By (9.10) and (A5), every right side in (9.14) is positive and independent of . Hence such a rational exists. The second restriction preserves Paper II’s fixed error bound. It is exactly
| (9.15) |
The other four restrictions control new fixed errors. Freeze every finite partition and logarithmic precision next. Only then choose the common threshold.
The ten allocations are printed in Table 9.3. The two zero rows are unused capacity.
| Error term | Allocation | |
|---|---|---|
| 1 | ||
| 2 | ||
| 3 | ||
| 4 | ||
| 5 | ||
| 6 | ||
| 7 | ||
| 8 | ||
| 9 | ||
| 10 |
Its capacities sum exactly:
| (9.16) |
The first four bounds follow from (9.14). The five remaining nonzero bounds follow from the stated limits. Each limit is taken at fixed .
Proposition 9.1 (Error budget).
Assume (A1)–(A5), and let be rational with (9.14). Then every even satisfies
| (9.17) |
Proof.
Rows 1 and 3. The third and fifth lines of (9.14) give
Rows 2 and 4. The first line gives . This is below and , so the fourth and sixth lines hold, and
Rows 5, 7 and 8. At the fixed , by (A1), by (8.73) under (A4), by (A2), and by (A3). By (2.6), the thresholds of (2.5) exist, and above them , , and . Row 9. Lemma 4.1 gives for , so . Rows 6 and 10 are zero. Every threshold used is bounded by the common maximum in (2.5). Also by Lemma 9.2. Hence all of them hold for . By (1.11), (9.8) and (9.9),
The bounds above give at most , which is below the nonzero allocations of Table 9.3. ∎
Take the named source, application and error thresholds listed in Section 2. The Section 7 definitions of and already include the main-mass threshold and the AA threshold . Thus the common maximum in below includes both requirements at the fixed . The common threshold is the single definition
| (9.18) |
Its existence depends on all those estimates. The floor alone supplies none of them. By its definition and Lemma 9.2, . The Section 2 threshold definitions include through and through . The bound enters directly in the common maximum. Lemma 4.1 holds for and Lemma 4.2 for . Thus the order is
| (9.19) |
No parameter is used.
9.3. The numerical margin
All constants in (9.1) have exact definitions. The exterior price uses the G0 coefficient in (7.36). The same coefficient prices L3. No sharper domination is used in this arithmetic or in the main-count hypotheses. The constants have the following outward enclosures:
| (9.22) |
Here
| (9.23) |
The coefficient is defined in (7.36). The final comparison is (7.67). Hence
| (9.24) |
The table below identifies each exact constant by its defining display and lists the comparisons that use it unchanged.
| Constant | Definition | Comparison |
|---|---|---|
| (1.8), [27, (6.3a)] | Proposition 5.10, by (5.13) | |
| (5.25) | Proposition 5.10, by Proposition B.1 | |
| , , | (9.3), Table 9.1 | Proposition 5.10, by Proposition B.2 |
| (6.70) | Proposition 6.13, (6.72) | |
| , | (9.1), (7.36) | (8.72), with (8.61) |
| , | (9.23) | Proposition 7.5, (7.67) |
| , , | (9.10), (7.39), (7.67) | Table 9.3, rows 1 and 2 |
| , | (8.61) | Table 9.3, rows 3 and 4 |
| (9.1) | Proposition 9.1 |
No other constant enters or the error budget.
The logarithm enclosure uses rational arithmetic. Put and
| (9.25) |
Here and . Bounding each remaining denominator by proves the upper bound. Taking gives (9.22). Thus no rounded logarithm enters the margin test.
For reference, put and . The buffered critical exponent is
| (9.26) |
To derive it, write . The equation gives (9.26). For the present constants,
| (9.27) |
This enclosure also uses rational bounds. For and , put
| (9.28) |
Here . The tail ratio is at most . The function in (9.26) decreases with . Substitution of the two rational bounds proves (9.27).
The endpoint in (9.27) is equivalent to the positive scalar margin at this fixed . It supplies no theorem at a smaller without new comparisons at the corresponding cutoff. If the optional Lemma 5.3 is used, increases by of (5.18). The margin then becomes , and becomes . Theorem 1 does not use this.
For an optional arithmetic comparison, define . Using in both K2 and L3 would require two further inputs. This paragraph concerns the optional scalar comparison at the same fixed cutoff; it supplies no new cutoff-dependent estimate. The first is the separate sharper functional domination from equation B.28. The second is a certified . It does not follow from the coarse interval in equation B.27. The main proof uses neither. Its scalar endpoint is
| (9.29) |
The same rational Taylor enclosure gives
| (9.30) |
Thus, on the optional sharper branch, is . The main theorem uses the explicitly certified G0 coefficient defined and bounded in (7.36); the display above is only the optional exponent endpoint.
9.4. The transfer
Lemma 9.2 (Transfer).
Proof.
Since , , and gives . Also , and . For we have , so and . Finally exactly when . ∎
Proof of Theorem 1
Use the established inputs (A1)–(A5) and fix a rational satisfying (9.14). Let be even. Then . Lemma 4.1 gives the first line of (1.10). At , the established comparisons (A1), (A2) and (A4) give its other three lines, and (A3) gives (1.13). The zero-gain combination Lemma 4.3 adds these four comparisons to (9.7). Proposition 9.1 gives (9.20), hence (9.21). Equation (9.24) then gives , since by (2.2). Hence the set in (1.3) is nonempty.
Choose one counted integer . If is prime, take and . Otherwise with primes and , and Lemma 9.2 gives . Therefore and .
Appendices
Appendix A proves three auxiliary estimates. Appendix B records finite calculations, numerical certificates, and exact arithmetic. All cross-references to these appendices are internal to this document.
Appendix A Proofs of three estimates of Section 6
This section proves Lemmas 6.5, 6.8 and 6.9. Numbers (6.) and 6. refer to Section 6. Numbers (A.1) and later refer to this section. The only inputs are Papers I and II and the classical results cited at the point of use. Throughout, is the -fold divisor function and . Let be the number of distinct prime divisors of . Let and be its largest and least prime factors. The sum runs over reduced residues.
A.1. Elementary inequalities
For integers , and ,
| (A.1) |
The first is multiplicative. At a prime power it is , which follows by induction on from
The right side is the coefficient of in the convolution of two -fold divisor functions. Each of its terms is at least the left factor , since for . The two sums in (A.1) follow by writing , enlarging the constraint to , and summing one factor last. Also
| (A.2) |
prime power by prime power, and .
For a finitely supported sequence , a modulus and an integer , put
| (A.3) |
| (A.4) |
If is supported in an interval of length at most , then
| (A.5) |
Here is the deviation of the reduced class sums from their mean. The variance is at most the second moment. Cauchy’s inequality in each class gives the second bound.
The sequence satisfies, for all and ,
| (A.6) |
By inclusion–exclusion over , , the class count equals , with error at most in absolute value. The comparator has the same main term and error at most .
Let , and . Here is the large parameter of the lemma at hand. For each fixed , Rankin’s method gives
| (A.7) |
with a fixed . With , the left side is at most
For one has and , so the factor at is . Mertens’ theorem gives . Hence the product is . Since , the right side of (A.7) is for every fixed .
A.2. Lemma 6.5
Recall the setting of Section 6. Let be complex, supported in , , and fix . The hypothesis (6.35) is that, for every , uniformly in and reduced ,
| (6.35) |
with constants common to the family of pairs . The conclusion (6.36) is
| (6.36) |
In the selected-factor form of Paper I, (3.48), , , and (6.37) reads
| (6.37) |
where is the interval mass in Paper I, (3.8).
Lemma 6.5 (Transferred mean-square estimate).
-
(i)
If (6.35) holds, then (6.36) holds for every fixed . Here and the implied constant depend only on , and the common constants.
-
(ii)
Assume the hypotheses (3.1), (3.2), (3.6), (3.8) with its length condition, (3.11) and (3.25)–(3.27) of Paper I. Then the estimate (6.37) holds uniformly over the parameter boxes and selected factors of Paper I, Theorem 3.2. Hence that theorem holds with this input in place of [3, Theorem 0(a)] at (3.48).
Proof of (i).
Put , and, for ,
Since , .
Characters. Orthogonality on the reduced classes gives . The centring removes exactly the principal character. Hence
| (A.8) |
Each modulo is induced by a unique primitive with , . Write . Then , since already vanishes on primes of . The pair determines , and by (A.2). Therefore
| (A.9) |
Small conductors. Let and . Since ,
The bracket is the left side of (6.35) with and . For a fixed it is at most . There are at most primitive characters modulo , so
| (A.10) |
Large conductors. The multiplicative large sieve, Paper I, (2.19), applied to with support in and , gives
If are the primes of , then and . Thus for , and
Summing over gives, uniformly in ,
| (A.11) |
If , this range is empty.
Proof of (ii).
Fix a box and a selected factor of Paper I, (3.26). Put , with as in Paper I, (3.8). Then is supported in , , , and . Its discrepancy (A.3) at is of Paper I, (3.46). The support of in Paper I, (3.27), gives .
High norm. Let . For and ,
which is the discrepancy of Paper I, (3.25), with and auxiliary divisor . Hence, for each ,
| (A.14) |
By Paper I, (3.26), is -rough and . With from Paper I, (3.2), the number of prime factors with multiplicity satisfies , so
By Paper I, (3.8), , hence
By Paper I, (3.11), , so . Take in (A.14). This gives (6.35) for with , at every precision . The constants depend only on , , , and the constants of Paper I, (3.25). These are common to all boxes and selected factors.
By part (i) with and , the range parameter is . Paper I, (3.6), gives , hence
for all sufficiently large . Part (i) yields
This is (6.37), uniformly in the box and the selected factor.
In the proof of Paper I, Theorem 3.2, [3, Theorem 0(a)] is used only to obtain the second case of (3.48). See the list of inputs after the statement of that theorem in Paper I. The two cases above give (3.48) for every box and selected factor, with the same constants and quantifiers. The rest of that proof is unchanged. ∎
A.3. Lemma 6.8
Recall the notation of Section 6. Put , ,
and, for an integer and a residue ,
| (6.21) |
(the last line of (6.21)). For a parent with , (6.38) defines
| (6.38) |
For a sequence on , (6.32) defines as (A.3) with restricted to the interval . Then (6.34) is the bound
| (6.34) |
uniformly for and .
Lemma 6.8 (Two-factor convolution estimate). Let and . Let , , be one-bounded, supported on , and satisfy (6.34) at the original parent , where . Let , , be one-bounded. Let be dyadic modulus scales, allowing the singleton scale for the integer , such that
Let , , and , , be arbitrary one-bounded arrays, with the unary restrictions , , in force. Neither a pointwise condition nor a joint condition is imposed on the pair. Then, for every fixed , uniformly in these occupied-parent scales, , , unary interval cuts of and , and intervals ,
| (6.45) |
Write . Fixed-factor enlargements of the parents change by , so
| (A.15) |
All implied constants below may depend on , on the fixed comparison constants and on the constants in (6.34). They do not depend on , , , , or . All fixed precisions are chosen before the final threshold for .
Step 0: reductions
A unary cut satisfies (6.34) with the same constants, since . The error is still measured at . A unary cut of keeps it one-bounded. The product cut is removed in Step 9. Until then we prove, for every fixed ,
| (A.16) |
Step 1: a shifted divisor moment and the mean square
For each fixed and each interval of length in ,
| (A.17) |
Let . Its prime factors above have total multiplicity at most . Group the others greedily into at most factors, each at most . Submultiplicativity of gives
For fixed and , put . The congruence has no solution unless , and otherwise solutions . Using and (A.1),
Put . For each fixed and every ,
| (A.18) |
First let be fixed. If , then (A.5) gives . If , then . Taking in (6.34) at precision gives (6.35) for with , and common constants, since . This argument is uniform at every requested precision (after choosing accordingly). Lemma 6.5(i) with and gives
The range contains , because beats every fixed power of . Thus in both cases . To insert , split at . Below the split the cost is . Above it, , and by (A.5); hence by (A.1)
Choosing and then proves (A.18).
Step 2: large smooth parts
Write with . Consider the pairs with . Then the -smooth part of exceeds . A modulus has at most factorizations , and . For , counting for each coprime to gives
By (A.2), the contribution of these pairs to is
Here and the sum over is bounded by (A.1). By (A.7) the first term is . The second is at most , since . It remains to treat .
Step 3: the first Cauchy square
Split and into dyadic shells , , with , . There are choices of and of . Put
Then , , and on the supports. One block of is
Fix a smooth supported in , equal to on . Cauchy’s inequality in gives
| (A.20) |
The indicator is part of the original support and is kept. The scale conditions and (A.15) give, for large ,
| (A.21) |
because , and . In particular and .
Expand over tuples with coefficient
In the factor is automatic, since .
Step 4: restoration before the Chinese remainder theorem
Call a tuple gcd-bad if one of
| (A.22) |
holds. Call a tuple near-diagonal if ; this condition is charged separately below. On the other tuples are pairwise coprime. For a set of tuples define the formal terms
| (A.23) |
We show
| (A.24) |
where is the nonzero-frequency sum on good tuples defined in Step 6. The exponent is fixed after and the truncation parameters.
Resonant . If , then . There are such . For fixed and such , the congruence terms over number at most . The comparator terms are . Hence these contribute to and to every subset of tuples below. This is the last term of .
Divisor truncation. For the other put . Let be the event . On the part of the complement with , the triples with number at most . The number at most , and lies in one class modulo , with choices. With , (A.17) gives a contribution to of
| (A.25) |
The other part is symmetric. Choose .
Bad tuples in . In this paragraph, “bad” means intersected with the five gcd failures in (A.22); the near-diagonal set is not included in this term and is charged separately below. On fix . There are at most triples and at most candidate primes for a failure in (A.22). Once is fixed, there are at most choices of . Every witnessing prime exceeds : it divides a -rough or . Since and , we have and . Each failure places in one class modulo :
-
•
: ; combine with .
-
•
, : , since and ; combine with . If , then and give .
-
•
: and ; combine with .
-
•
: ; combine with .
-
•
: since , . If , then gives . If only, exchange the two copies first.
The number of in one class modulo is . Hence
| (A.26) |
The near-diagonal is counted in the same way, with replaced by . Choose . This gives the first two terms of . No joint condition has been used. A prime dividing divides and only enlarges . A prime dividing divides and some . This is the last case of (A.22).
Bad tuples in the density terms. For , and , dropping coprimality leaves the positive density
since and for . (In the -sum is nonzero only if is invertible modulo , by and . Then lies in one class modulo .) For retain and , with weight . In particular there. Without the bad condition these weights sum to and , using , and, in , values of in one class modulo . As in every witnessing prime exceeds . In each case below the prime divides or , which is fixed first together with . Since , there are choices of . We use
the last two have no , because they count multiples of in and .
-
•
: fix and . In there are values of . In , since ; combining with leaves values of .
-
•
: fix and ; the -sum is at most . The -count is unchanged; is allowed.
-
•
: fix and ; the -sum is at most , and the -count is unchanged.
-
•
: fix and . In there are values of . In , would contradict , so ; combining with leaves values of .
-
•
: the weights are symmetric in the two copies, so let ; fix and . Since , , and there are at most values of . The -, - and -counts are unchanged.
In every case the bad part of each density term is . This is part of . The near-diagonal is counted in the same way, with replaced by . There are values of , and in one class modulo . Hence the near-diagonal is . This is part of once also . Thus all bad tuples may be removed from at the cost .
Good tuples. On good tuples the two congruences in are compatible exactly on the support and . Then lies in one class modulo , with
| (A.27) |
Poisson summation gives
| (A.28) |
The term gives . All three expanded summands vanish unless . The following main-term computations are on that support. For the smooth coprime -sum is . Division by gives with total error . For expand by Möbius inversion. The main term is , with error . Division by gives with total error . Completing and back to all tuples costs . This proves (A.24).
Step 5: the zero mode
Expanding the centred class counts gives the exact identity, valid for all tuples including those with gcd failures,
| (A.29) |
For fixed both sides equal
Use and
The sums are , a given has at most factorizations , and . By (A.18) with and (A.19),
| (A.30) |
Only is used, so may vary with . The factor is cancelled by in (A.20).
Step 6: nonzero frequencies
Fix and let be the part of with this :
Put and
| (A.32) |
with larger than every . Since , the terms contribute in total, taking . If , is negligible. This covers , , where . Hence we may assume and .
Reciprocity. For coprime , . Applied to the first term of (A.27), with and , it gives
Put , a nonzero integer on good tuples. Cancelling ,
| (A.33) |
The conditions on are
| (A.34) |
The first is kept. To separate the second, colour every prime in blue or red independently with probability . Since is -rough,
| (A.35) |
where counts the primes of . A shared prime makes the event empty. Otherwise its probability is the reciprocal of the power of . Both counts are , so the multipliers are . Fix one colouring.
Split and into signed dyadic blocks and , with and . Below, is renamed . Fix , this block, a sign , and one prime colouring from (A.35). The outer tuple is , with , , and . Its support contains , the near-diagonal exclusion, and the conditions on inherited from the good tuples and . It also requires every prime of to be red. The remaining -conditions are , and all primes of blue. The colouring enforces . Write
where is a fixed smooth cutoff supported in and equal to on . Since , , , and , uniformly in all outer tuples, . On the original support, the remaining Fourier weight is exactly . Define the Mellin transform and its uniform majorant by
The compact support, two integrations by parts, and the bounds on give
with the fixed constant chosen large enough. Mellin inversion is the outer-dependent identity
In particular is not an inner -weight: it depends on and the fixed sign and block.
The -integral precedes Cauchy. Let and on this block, with . For fixed real Mellin parameter set
The factor is the one-bounded mask on a terminal frequency block; it is independent of the outer tuple. The sum over is restricted to the outer support just specified. Choose the fixed cutoff with . On the dyadic support . By the definitions of , and , every other factor above has modulus at most one. Hence and , uniformly in the real and all original outer parameters. Using , the contribution of this block and colouring to is
Here on the good support. The colour average and the signed dyadic blocks are taken after the estimate. Their cost is .
Second square, pointwise in . Group the outer tuples by . For fixed , the factorization has at most choices. Then and are determined. The number of outer tuples is . Let be a smooth majorant, at least on their ranges , . Since is -rough, for the least prime not dividing , as . Define, for each real ,
| (A.36) | ||||
Here is formed with a fixed block and colouring; the supremum is taken afterwards. The displayed bound for the full follows from the colour expectation and the sum over the blocks. Their cost is a uniform . Thus no outer coefficient is moved through Cauchy or the -integral. Cauchy is applied inside the integral for each . No outer-dependent Mellin factor appears in .
For every fixed , expand the square with , and . Since , the diagonal obeys, uniformly in ,
| (A.37) |
For , write and separate the two signs of . The off-diagonal is a sum of expressions
| (A.38) |
where depends only on , and not on or the original outer tuple. Its summands are products of the one-bounded weights , and for the counting majorant defined below. The support has .
Coefficient norm. Fix . For , and let count , , , , with and . Write for the largest divisor of composed of primes dividing . Then
| (A.39) |
At fixed there are at most choices of . By Cauchy’s inequality the left side is at most
where counts with . Since , the -sum is at most , with .
Write , , and . A fibre of is an arithmetic progression with step . It has at most points, and at most one if . Also
by telescoping each prime power. Let count with and . Then
| (A.40) |
For the first sum write with primitive, . There are at most such and . Put . Since is prime to , a contributing has (and forces ). Counting and then in one class modulo , and using ,
| (A.41) |
For the second sum . There are nonzero levels of divisible by . Each has points, so . Summing over , with ,
| (A.42) |
Finally
Since , . Both and are : with the primes of in increasing order, . This proves (A.39).
With we have by (A.21). For every real Mellin parameter , fixed and colouring, the coefficient sequences in (A.38) satisfy the uniform weighted estimate
This follows from (A.39), since the inner complex weights have modulus at most one. In particular the implied constant is independent of and of all original outer data . The dependence on these data was placed in before Cauchy. Writing for the slices of Paper I, (2.43), with and , gives
| (A.43) |
Since , the -part of is precisely . This is the norm required by Paper I, (2.42)–(2.43), for every , without any Mellin factor in the inner coefficients.
Application of Paper I, Theorem 2.8. In (A.38) put
| (A.44) |
with . Since , , which meets two dyadic windows. Split the -sum into and . Apply the theorem to each, with and respectively. This costs a factor in the final bound, and in both windows. Then and , since is even and . The support has . The domain of the theorem is exactly
and holds by roughness. Exactly as in Paper I, (3.82)–(3.84), reducing the inverse modulo gives
also when . Split into finitely many smooth pieces on strict dyadic windows in . Multiply by fixed smooth cutoffs equal to on the supported . At use a cutoff vanishing below . All derivatives satisfy Paper I, (2.39), with uniform seminorms. Take . All parameters lie in , so in Paper I, (2.41). The prefactor there satisfies for large . Write for this fixed loss. This loss and the factors are far below three power savings obtained below. These are , and , one for each term of the bound. It leaves the final saving intact. Powers of are .
Put and . Then , since (see (A.47)). On a nonempty -block the near-diagonal removal gives , hence . All exponents of in Paper I, (2.42), are nonnegative. By (2.42) and (A.43),
the regular spectral product is . With , and (A.32),
| (A.45) |
Fix a real . Apply the diagonal bound (A.37), Paper I, Theorem 2.8 with the uniform coefficient norm (A.43), and (A.45). The resulting estimate is the same for every real . Thus their supremum satisfies
| (A.46) |
All Mellin and colouring costs remain as recorded in (A.36). No outer-dependent coefficient enters the norm.
Step 7: exponent reserves
Step 8: parameter order and conclusion of (A.16)
Fix . Choose ; then ; then . Here is the absolute exponent with . The smooth weights, , and are fixed numbers. Choose the threshold for last. By (A.31) and Step 7,
since and beats every power of . Sum over the shells of and the shells of , and add Step 2. This proves (A.16), uniformly in and the scales. Of and we used only one-boundedness and the unary support .
Step 9: the product interval
Let and . Divide and into consecutive intervals of relative length at most . Call a rectangle interior if , exterior if , and boundary otherwise. On each interior rectangle apply (A.16) to and , with saving . By Step 0 the first array satisfies (6.34) at the original parent . For fixed , the in boundary rectangles lie in intervals of total length . A modulus has at most factorizations . Counting for each ,
with a fixed . The last term saves a fixed power, since . Taking proves (6.45). ∎
A.4. Lemma 6.9
Recall (6.47):
| (6.47) |
Lemma 6.9 (Central rectangular distribution). Let be even and . Let the bounds in (6.47) hold with replaced by , with fixed comparison constants. Let be one-bounded on the complete dyadic rectangle . Let the tested satisfy (6.34) at its original parent, with one fixed divisor exponent and uniform constants at every requested precision. Write
Then, for every fixed ,
| (6.48) |
The constant is uniform over these families, rectangles, squarefree modulus supports and unary interval restrictions of and . All errors are measured at the original parents. One outer residue is chosen before varies. In the application it is .
Write , , , , , . Let be the fixed divisor exponent in the hypothesis, so that for every , uniformly in intervals , and ,
| (A.49) |
Since , a unary restriction of satisfies (A.49) with the same constants. A unary restriction of keeps it one-bounded. We may therefore assume that and are the restricted arrays. We keep in (6.48) and throughout the signed residue-difference argument. The individual maxima in (6.48) are nonnegative, but the signed differences in Step 2 are not. Enlarging their support does not preserve order. Every selected coefficient below is extended by zero outside and . On this support and . Throughout, with , and .
Step 1: the projected comparator
For and reduced put and
Then exactly
| (A.50) |
With ,
| (A.51) |
Mean square for . The identity and (A.2) give
Put , which is one-bounded, and . By the parallelogram identity , there is with
Let and . By (A.49) for , by (A.6) for , and since and , both and satisfy (6.35) with . The constants are independent of , the sign and the restriction. Here , as . Lemma 6.5(i) applies to both. Since and , for every fixed ,
| (A.52) |
The range condition holds for large , because .
Bound for . Each reduced class modulo contains at most values . The map permutes the reduced classes. Cauchy’s inequality in (A.51) gives, uniformly in ,
Cauchy’s inequality over and (A.52) then give
since by a fixed power. Summing over with (A.2) and (A.1),
| (A.53) |
choosing after (the full order is fixed in Step 8).
Step 2: residue differences
For coprime there are exactly reduced lifts of . Every coprime to with lies in exactly one of them. Hence
| (A.54) |
For each , choose one reduced class maximizing the masked sum of the projected differences, before varies. For each with and , choose a reduced lift maximizing . By (A.54) and the triangle inequality, some reduced lift satisfies
Choose to make this difference nonnegative real, and put outside the masked squarefree support. By (A.50), (A.53) and (A.54), it suffices to prove, uniformly for all these residues and phases,
| (A.55) |
This signed sum keeps the original mask.
Step 3: large smooth parts and large divisor functions
We quote the completed-hyperbola lemma of Paper I:
Let be a unit. For integer intervals , put
(3.107) The Weil–Estermann bound [11, 12]
(3.108) implies, uniformly in interval lengths and positions,
(3.109)
For (A.56), set the lemma’s , , , and take or . Both are units modulo by the reduced-lift condition. Here . The source’s is an unweighted counting discrepancy. It differs from our weighted . Define
The quoted lemma gives , where . Since , one has . This is the only passage from unweighted counts to the arbitrary complex arrays. Every pair counted has automatically because is a unit. No coprimality hypothesis on the arrays is inferred. Consequently,
| (A.56) |
using . The mask remains on the summation support but is not a hypothesis of Lemma 3.4. In the smooth-part and divisor-function eliminations below, we first take absolute values termwise. Only then are the nonnegative majorants enlarged. Write with . If , then the -smooth part of is at least . A given has at most factorizations . By (A.56), (A.2), (A.1) and (A.7), the sum of the absolute values of these masked terms in is at most
and . In the same way the pairs with contribute
Choose after the requested precision . From now on , and every remaining modulus and every divisor of it has .
Step 4: the first Cauchy square
Rename the outer modulus as and write the inner one as , with smooth and squarefree and -rough. Then . On the support of (A.55), are pairwise coprime and squarefree, , and . There are choices of . Extend the selected coefficients by zero and put
The are identical in both choices of residue. For one shell the masked signed sum is
where and does not depend on . Put
With as in Step 3 of the proof of Lemma 6.8,
| (A.57) |
For chosen from , the four correlations, with signs , are precisely
We prove at arbitrary fixed precision that
| (A.58) |
where contains the same mask and selected coefficients. It is independent of the choices of . Since the coefficients and support are the same in all four correlations, their main terms cancel. Equation (A.57) then gives before the shell sum.
Write , , , , with dyadic. Put and . Then are pairwise coprime. The product of the two -supports imposes . This modulus-only restriction remains in the correlation and its zero mode. It may be omitted only from a termwise absolute-value majorant. It may not be omitted from a signed expression or from an inner sum before squaring. The two congruences , are soluble exactly when
| (A.59) |
and then lies in one reduced class modulo . Modulo both residues equal , so .
Step 5: large common factor
Let , with fixed later. The target is . In the large- estimate we first take absolute values of each weighted correlation term. Hence its nonnegative counting majorant may be enlarged to all , while itself stays masked. For fixed the pairs in (A.59) lie in a congruence lattice of determinant . Let be a shortest nonzero vector. If the line meets the positive rectangle, choose its sign so its coordinates are positive; otherwise the contribution is empty. Complete it to a reduced basis . The component of orthogonal to has length . In a disc of radius the points with have and, for fixed , values of . Such points exist only if . Then and , so they number . Each such pair has values of . Hence these points contribute
For , with , and the two congruences fix in one unit class . Here , and is a unit. Each original congruence has a unit right-hand side . Hence and are units modulo every factor of on this line. For , cover the positive integer hyperbola by the integer rectangles , , and, for with ,
These rectangles may overcount. This is harmless for the positive quantity . Each has , and their number is . Apply the quoted Paper I, Lemma 3.4 with its modulus , unit , and these two integer intervals. Empty intervals contribute zero. The positive counts give, uniformly in and ,
| (A.60) |
uniformly in the unit and . A modulus has at most representations . Summing (A.60) with (A.1),
With , and , on this range of ,
and , while . So the large- part of is at any requested fixed precision . The mask was removed only after taking absolute values.
Step 6: small common factor, Poisson and the zero mode
Let . For one class ,
| (A.61) |
and the terms contribute per tuple. We take .
The zero mode is times the weighted number of compatible . It still carries the product of the two -supports, and thus . After taking absolute values of the error, its positive majorant can be enlarged. This is the only use of the unmasked range in (A.62). Put . For fixed , the -sum in (A.59) is a sum of over one reduced class modulo . Replace it by . The error is . The map hits each reduced class times, so Cauchy’s inequality gives
A given has at most representations, and . Multiplying by and summing over , the zero-mode error is
| (A.62) |
Since divides a remaining modulus, . The identity and (A.49) show that satisfies (A.49) at precision . As in Step 1, add to make the norm at least . Both sequences satisfy (6.35) with and uniform constants. Lemma 6.5(i) and linearity give, uniformly in ,
because once . With fixed in Step 3, choose first , then , then the threshold for . Since , (A.62) is .
What remains of the zero mode is the masked main term
| (A.63) |
with the previously imposed coprime/squarefree and dyadic conditions understood. This expression depends on the modulus support and , but not on . Put .
Step 7: the second square
It remains to bound the frequencies in the masked correlation. Write
the second factor is a product of bounded weights in , in and in . The mask factors exactly as
Keep the first factor with the outer data and the last two with the -sum, together with . No masked term is reintroduced into a signed sum.
Every -rough has prime factors. Colour each prime below red or blue independently. A coprime pair is covered if all primes of are red and all of blue. This has probability at least . With independent colourings, the probability that one of the at most pairs is never covered is . Fix such a list and assign each pair to its first covering colouring. This partitions the coprime pairs into classes, and for any two pairs in one class.
On one class let be the sum over compatible , and , after removing , where
| (A.64) |
If there is nothing to bound. By CRT the class of in the phase is
Cauchy’s inequality over the masked outer data , , with removes and gives
| (A.65) |
since there are at most outer tuples (). Here and keep the -mask. The sum runs over and . Its terms are a smooth majorant times the square of the -sum. This inner sum contains and the selected coefficients. The congruence modulo stays inside the square. In the expansion of this square each pair of copies keeps its zero–one masks. The later diagonal, Weil and Ramanujan bounds are termwise bounds after taking absolute values of the expanded contributions. Hence they may discard zero–one factors. We do not use the false inequality .
Expanding gives and with . Put , , , and
The two congruences modulo must agree, or the term vanishes. Let . The -sum is
All inverses exist, since and both are prime to . Completing first in and then in ,
| (A.66) |
with and the Kloosterman sum of Paper I, (2.35). The first completion produces the phase , which combines with the -phase to give . Let
| (A.67) |
Frequencies with contribute per tuple. If , only remains.
The target for is . By (A.65), a bound gives .
Diagonal . Then , so for fixed there are choices of . Bounding trivially by , as ,
The divisor-counting bound for the tuple count immediately above is loose. Only this factor is used in the estimate for .
Gcd bound. Put , , , , , . Then
| (A.68) |
The four factors are supported on disjoint sets of primes. If , , then with a unit multiplier, so . The cases only, only and only are identical, with , and . If , the numerator of is with , . Thus the -part of is at most . The case is similar. Modulo all four residues equal , so and . For we use only . Hence
| (A.69) |
Long dual range, , . There are pairs . Paper I, (2.35), gives
Use the square root of (A.69) and . Then
The averages
follow from and counting multiples. Summing over the choices of ,
using , , ; the possible absolute factor is absorbed in the implied constant and in , and then
Short dual range, , . Now
with Ramanujan sums , and . By (A.69) each term is
With and the averages above,
since .
Step 8: conclusion
After the factors the three ratios are at most . These factors include , the divisor bounds, and fixed powers of . Take . Then on each masked colouring class. Restoring and the classes, the nonzero frequencies contribute to each small- block of . The modulus mask was preserved through both Cauchy squares. Only termwise absolute-value majorants were enlarged. There are common-factor blocks. Together with Steps 5 and 6 this proves (A.58) with the same masked in each of its four choices of residues. Their signed combination is . Fix a requested final exponent . First choose the correlation precision . Then choose (Step 3). Then choose , also large enough to make (A.53) smaller than . Next take , and finally the threshold for . Equation (A.57) gives on each shell. Sum over its choices of and add the masked Step 1 and Step 3 errors. This proves exactly (6.48), with as stated. Every constant depends only on , the comparison constants in (6.47) and the constants in (A.49). ∎
Appendix B Finite calculations
This appendix gives the finite quantities used above. Each terminating decimal denotes an exact rational number. All decimal interval endpoints are rounded outwards; decimal approximations in explanatory prose are not additional certified bounds. The comparisons with prime sums occur in the main text.
B.1. Series bounds
For ,
| (B.1) |
Write any positive rational as , where . Then use
| (B.2) |
Also, for ,
| (B.3) |
These inequalities enclose the elementary functions below. Integer comparisons then give the printed rational bounds.
B.2. Four profile differences
Put
| (B.4) |
Define the elementary functions
| (B.5) | |||||
| (B.6) | |||||
The two sieve normalizations satisfy
The raw multiplier , a signed row coefficient , and or combine to the displayed factor. The directed integrals below use these hatted functions. No further or factor is applied. Also for . Write
For the three intervals in Table B.1, put
| (B.7) | ||||
| (B.8) |
These are those of equation (5.22). Closed or half-open interval endpoints have measure zero. The curved domain is that of [27, (2.38)–(2.40)].
Proposition B.1.
A directed interval computation certifies the following outward enclosure of the four elementary integrals:
| (B.9) |
In particular, their sum minus exceeds . Also,
| (B.10) |
| lower bound | upper bound | ||
|---|---|---|---|
| curved domain | |||
| sum |
Proof.
The profiles are evaluated with directed interval arithmetic. An independent verifier rechecks the directed output. Put , , and let be the right-branch derivative profile for , so for and by continuous extension. The three one-dimensional rows each use 2048 equal cells:
For a cell , define
Since , the code’s lower and upper cell contributions are exactly
| (B.11) |
These hold because for every and ; also .
For the fourth integral, split at
On each piece of , the S10 routine uses and for . For a cell , with , put
The substitution is . Its executed lower and upper contributions are
| (B.12) |
For every point in this cell and , , and
Hence the two positive factors are bounded separately, as in the code. The two rectangular grids contain cells. The total executed cell count is
The endpoint bounds use the following branch formulas. For ,
They extend continuously to with and right derivative . Thus the branch profile is positive and decreasing on . For positivity: the numerator decreases, and at it is , since . For , put . Then
At the two pieces give , so is continuous there; the displayed differential identities are used on . The exact directed evaluation at gives . Hence throughout the required range , and there and . For , is also positive and decreasing. The S10 mixed-corner range is
These inequalities justify using the decreasing positive in (B.12). The lower bound refers only to the executed mixed-corner interval.
The code evaluates the formulas by rational geometry and 256-bit Arb
ball arithmetic. In profile_
the Arb expression equals the displayed formula. Arb supplies outward ball enclosures. The code does not use the atanh and dilogarithm tail inequalities above. The exact directed rational endpoints are written to the result record. The terminating decimals in the table are outward projections of each row’s directed endpoint. Their displayed column sums are and . The sharper bound (B.9) adds the unrounded rational endpoints in RESULT.json before decimal projection. Summing before rounding proves the stated integer comparisons. Finally, 64 terms of and its geometric remainder give . This proves (B.10). ∎
Proposition B.1 concerns elementary integrals and one strip coefficient. Its application to the prime sums requires the source comparisons, uniform errors and a single charge of the strip.
B.3. The shifted three-variable integral
Here are the linear-sieve functions. Their normalization is
| (B.13) |
These classical properties are the inputs to this calculation. Put , and . Define
| (B.14) | ||||||
The unguarded branches include for . Thus replacing the inactive value by leaves this maximum unchanged. For , put
| (B.15) | ||||
The unshifted profile and functional come from [27, (4.70)–(4.75)]. The parameter and the shifted functional are defined in this paper. The retained-side argument uses the instance , constructed in (5.52). Paper II’s (5.4)–(5.5) are not the source of this shifted functional.
Proposition B.2.
The shifted scalar satisfies
| (B.16) |
Let , , and be the directed table endpoints. Define
| (B.17) | ||||
The construction has , . Thus . This directed endpoint comparison is the monotonicity step of [27, §4.6, (4.73)]. Table B.2 encloses these finite upper bounds. The constants and are printed exactly in (5.48) and (5.49), with their Paper II locators. The normalization identities are
| (B.18) | ||||
| Quantity | lower endpoint | upper endpoint |
|---|---|---|
Proof.
For the outer partition put , , , and
| (B.19) |
It is strictly increasing. For the inner integral write
| (B.20) |
Each branch residual decreases in . Each guard’s active set is a down-set. Thus is nondecreasing in , guard jumps included.
Let be an outward upper bound for , on the lattice. Let enclose upwards on that lattice. The diagonal cell has half the logarithmic square’s area. Hence
| (B.21) |
Split the inner interval at every affine crossing. Include every guard crossing and each branch kink. On each resulting interval the argument is . If , then
| (B.22) |
The trivial bound is . The smaller of the two upper bounds may be used. For , the argument is constant.
The delay equations give the primitive explicitly:
| (B.23) |
For , monotonicity gives
| (B.24) |
We bound the trapezoid error. If is either or and is one mesh panel, then
| (B.25) |
with one-sided interpretations at the integer breakpoints. The mesh has and every breakpoint is a mesh node. We prove the derivative bound independently of the quadrature table. Write . The elementary inequality and the first three positive terms of the atanh series give
Thus and . The defining functions satisfy
Induction on unit intervals gives . If the delayed functions are in this range, the integrals have length , so and . For either companion pair or , differentiating on open unit intervals gives
For , the first-derivative delay identity holds already for . For on , use . Hence for . Since , for
On the initial intervals,
The formulas imply on , on , and on . Inside the last parentheses each negative term has magnitude at most . The positive term is at most . Therefore on all smooth panel interiors of , with one-sided limits at the integer breakpoints.
The archived outward intervals and the independently computed exact rational intervals are recorded with the reproducibility materials. The derivative check starts from the proved invariant and then rebuilds the delay table. It checks every computed unit-interval enclosure against the archived coarse intervals. It confirms that the computed global bound is , the recorded value:
The computed bound is 8. Hence the absolute local remainder is at most . The verifier checks this radius against the panel allowance before it accepts the regenerated table. The M5 computation builds the delay table with DEN=65536, S=128, 160-bit Arb interval arithmetic, and 1,900,545 generated nodes. The shifted computation then evaluates the exact triangular grid, with inner-grid evaluations. It stores one aggregated row per outer index. Hence SHIFT-N512-fresh.json contains 512 rows for the 131,328 evaluations. The M5 computation uses no Taylor model and no width- step. The historical Taylor certificate provides background information and is not an input to this calculation. The table and shifted rows are regenerated before the directed inclusion check. The verifier compares recorded JSON fields and exact row values. It also checks SHA-256 hashes of the canonical compact-JSON integer arrays used by the real-inclusion verifier. These canonical-array hashes differ from hashes of regenerated JSON files. File formatting is not used as a certificate. Directed summation gives Table B.2. The positive last row proves the strict cap. The 512 aggregated rows give the exact 131328-term sum used for . The directed real-inclusion result records the directed tail and the cap check. The reproducibility report documents the execution boundary. The two normalization identities follow by expansion. ∎
The proposition concerns the scalar functional only. The prime-sum comparison is required separately in Section 5.
B.4. Unshifted comparison (historical and not used)
Status: historical and non-certified.
This historical unshifted comparison records an earlier calculation for context only. No current computation reproduces it. None of its values, table, constants or comparison is an input to the main proof. The comparison concerns the unshifted functional . It is distinct from the main-line coefficient bound . The main K2 and L3 comparisons use the latter via [27, (4.73), (4.75), (4.79), (A.10a)]. They do not use . The cited bound is the coefficient used in the main argument. It does not assert the separate, sharper comparison. This appendix proves that comparison only conditionally, as an optional one. Its historical delay table was constructed separately, but no such table or producer is part of the current proof package. The panel width is . At 192-bit precision, each trapezoid receives radius . On smooth panel interiors, . The panels meet the integer breakpoints. This bounds each local truncation remainder. The endpoint enclosures pass through the delay recursion in Arb ball arithmetic. Accumulated input radii are thus kept before outward rounding. All table endpoints are then rounded outwards to . The primitive and true tail use (B.24). This table gives a historical directed bound for . It is kept only to reproduce the earlier non-certified calculation. The separate earlier Taylor models are not part of the M5 computation. Let , , and be these directed endpoints. Define
| (B.26) |
The earlier finite calculation used in (B.19). The outer sum has nodes. Write for that upper-corner sum. Table B.3 groups its eight consecutive row ranges. Each row lists a lower and upper bound for the sum. The diagonal half-weights are already included.
| Rows | nodes | lower endpoint | upper endpoint |
|---|---|---|---|
| – | 524800 | 0.000002727813799350 | 0.000002727813799351 |
| – | 1573376 | 0.001226034866061399 | 0.001226034866061400 |
| – | 2621952 | 0.019651743682986805 | 0.019651743682986806 |
| – | 3670528 | 0.080548405705743750 | 0.080548405705743751 |
| – | 4719104 | 0.146720281588383935 | 0.146720281588383936 |
| – | 5767680 | 0.200161682376550457 | 0.200161682376550458 |
| – | 6816256 | 0.242188572133550572 | 0.242188572133550573 |
| – | 7864832 | 0.275672089024516687 | 0.275672089024516688 |
The earlier, non-certified calculation reported
| (B.27) | ||||
The term bounds directed outer-sum rounding. The shifted computation does not use this interval. The comparison with the continuous functional is one-sided:
| (B.28) |
No claim follows from the printed interval. The finite row sums alone prove no prime-sum estimate. The source comparison and its error terms remain required.
B.5. The sixth-sum constant
The certified finite enclosure is
| (B.29) |
Here denotes the integral quantity in Section 6. The constant used in the final bound is
| (B.30) |
Thus the certified enclosure gives
| (B.31) |
Only this conservative lower constant enters the final bound.
B.6. Computer checks
Table B.6 lists the supplementary scripts. The second column states what each one checks. The partitions and defining formulas are printed above. The exact-arithmetic checks use Python’s integer and fraction types. Environment and timing details are recorded in the reproducibility materials. They are not theorem inputs. A full numerical regeneration is distinguished from a compact check. The certificate bundle is available at the location given in the Data availability statement; its SHA-256 manifest hash is 81fc00441c3a3f0924995cd41263feddece827d9b40376dae531191c86f90ed3. The recorded M5 regeneration agrees with the exact 512-row certificate. The reproducibility certificate set is independent. It consists of the H6 RESULT.json, the 512-row M5 output, the Root–A enclosure, and the verifier scripts for those records. Each record is checked against the source hashes and the manifest. None replaces an analytic estimate.
| Script | Statements checked | Time |
|---|---|---|
| Reproducibility replay verifier | manifests, source hashes, TeX structure, finite consistency checks, and the producer verification run | replay |
| H6/M5 producer verification | executes the H6 computation and M5 table, shifted probe and real-inclusion verifier, computing the derivative enclosure and comparing regenerated outputs | replayed |
| H6 directed verifier | regenerates the directed H6 rows from the source inputs and Arb runtime | replayed |
| M5 derivative verifier | exact rational unit-interval bounds for and and the panel radius | replayed |
| M5 table, shift and inclusion verifiers | regenerates the delay table, rows, and real inclusion | replayed |
| Finite consistency verifier | exact finite arithmetic, orbit, and sign checks for the patches | replayed |
The reproducibility verifier checks the recorded inputs and then runs the producer verification. That run regenerates the H6 output, the M5 delay table, the shifted rows and the real inclusion on the recorded platform. The earlier unshifted calculation used Python 3.12.3 and python-flint 0.9.0, with four workers. Its slowest worker took seconds, rounded upwards. The historical unshifted comparison is optional and not certified. The main proof does not use it, and it does not affect the shifted computation. Neither these scripts nor their agreement establishes a uniform estimate. The final proof requires the analytic comparisons in Sections 5–8.
B.7. Rows of the retained side
The index set of Section 5 consists of Paper II’s nineteen original row chains and one outer chain. The outer chain covers the upper part of , Lemma 5.1. Sixteen of the row chains are listed below, each with its source parent and raw coefficient. The remaining three are Paper II’s single-prefix comparisons for , and . They keep Paper II’s own sources, restorations and error entries unchanged. The four rows of are restored to their parents , , and . The lower part of has no separate restoration address. The four joint rows are restored once to the joint source of with weights .
| Row | Parent | Coefficient | Row | Parent | Coefficient |
|---|---|---|---|---|---|
| S1-0 | S1 | S4 | S4 | ||
| S1-1 | S1 | S5-low | S5 | ||
| S1-2 | S1 | S7 | S7 | ||
| S1-3 | S1 | S10-Ret | S10 | ||
| S2-0 | S2 | G1-0 | G1 | ||
| S2-1 | S2 | G1-1 | G1 | ||
| S2-2 | S2 | G1-2 | G1 | ||
| S2-3 | S2 | G1-3 | G1 |
These sixteen rows, their seven source-parent restorations and four outer terms carry error addresses. Each address occurs exactly once. One outer term is the chain . The others are the strict BV piece of , inside its joint group, and two comparator entries. The same table has seven further rows with addresses. They treat , and another way, and this paper does not use them.
B.8. Statements for the sixth sum
The sixth-sum argument uses the following statements.
| Statement |
|---|
| Lemma 6.2 (rough-factor distribution) |
| Lemma 6.4 (four-family Siegel–Walfisz); range |
| Lemmas 6.6 and 6.7 (selector and tensor, applied per shell pair) |
| Lemma 6.5 (transferred mean square) |
| Lemma 6.8 (two-factor convolution) |
| Lemma 6.9 (central rectangles) |
| Proper powers, (6.26) |
| Fact 3.2 (maximal prime estimates) |
| Paper I, (2.21), as used in Paper I, (3.25) |
Use of AI tools
The author devised the method of proof. Codex (OpenAI, Astra 6) derived and checked the estimates, wrote the Python code for the certificates in Appendix B and ran blind reviews of the manuscript. Claude Code (Anthropic, Claude Fable 5) checked the proofs, the numerical certificates and the references. The author checked every step of the proof, every table and every reference, and takes full responsibility for the content of the paper.
Statements and declarations
Competing interests. The author has no competing interests.
Funding. No funding was received for this work.
Data availability. The supplementary scripts, exact inputs and compact outputs are archived as paper-iii-public-certificates-v1.tar.gz with release v1 at https://github.com/ryzfsu/goldbach-1plus1.75-theorem/releases/download/v1/paper-iii-public-certificates-v1.tar.gz.
The SHA-256 hash of the archive’s internal SHA256SUMS manifest is 81fc00441c3a3f0924995cd41263feddece827d9b40376dae531191c86f90ed3.
References
- [1] A. O. L. Atkin and J. Lehner, Hecke operators on , Math. Ann. 185 (1970), 134–160. https://doi.org/10.1007/BF01359701.
- [2] P. Billingsley, Convergence of Probability Measures, 2nd ed., Wiley Series in Probability and Statistics, John Wiley & Sons, New York, 1999. https://doi.org/10.1002/9780470316962.
- [3] E. Bombieri, J. B. Friedlander and H. Iwaniec, Primes in arithmetic progressions to large moduli, Acta Math. 156 (1986), 203–251. https://doi.org/10.1007/BF02399204.
- [4] Y. Cai, Chen’s theorem with small primes, Acta Math. Sinica (N.S.) 18 (2002), 597–604. https://doi.org/10.1007/s101140200168.
- [5] J.-R. Chen, On the representation of a larger even integer as the sum of a prime and the product of at most two primes, in The Goldbach Conjecture, 2nd ed., World Scientific, 2002, 275–294. https://doi.org/10.1142/9789812776600_0021.
- [6] H. Davenport, Multiplicative Number Theory, 2nd ed., revised by H. L. Montgomery, Graduate Texts in Mathematics, vol. 74, Springer-Verlag, New York, 1980. https://doi.org/10.1007/978-1-4757-5927-3.
- [7] P. Deligne, Formes modulaires et représentations -adiques, Séminaire Bourbaki 1968/69, exposé no. 355, Lecture Notes in Mathematics, vol. 179, Springer-Verlag, 1971, 139–172. https://www.numdam.org/item/SB_1968-1969__11__139_0/.
- [8] P. Deligne, La conjecture de Weil. I, Publ. Math. Inst. Hautes Études Sci. 43 (1974), 273–307. https://doi.org/10.1007/BF02684373.
- [9] J.-M. Deshouillers and H. Iwaniec, Kloosterman sums and Fourier coefficients of cusp forms, Invent. Math. 70 (1982), no. 2, 219–288. https://doi.org/10.1007/BF01390728.
- [10] S. Drappeau, Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method, Proc. Lond. Math. Soc. (3) 114 (2017), no. 4, 684–732. https://doi.org/10.1112/plms.12022.
- [11] A. Weil, On some exponential sums, Proc. Natl. Acad. Sci. U.S.A. 34 (1948), 204–207. https://doi.org/10.1073/pnas.34.5.204.
- [12] T. Estermann, On Kloosterman’s sum, Mathematika 8 (1961), 83–86. https://doi.org/10.1112/S0025579300002187.
- [13] H. Iwaniec, A new form of the error term in the linear sieve, Acta Arith. 37 (1980), 307–320. https://doi.org/10.4064/aa-37-1-307-320.
- [14] H. Iwaniec, Rosser’s sieve, Acta Arith. 36 (1980), no. 2, 171–202. https://doi.org/10.4064/aa-36-2-171-202.
- [15] H. Iwaniec, Spectral Methods of Automorphic Forms, 2nd ed., Graduate Studies in Mathematics, vol. 53, American Mathematical Society, Providence, RI, 2002. https://doi.org/10.1090/gsm/053.
- [16] H. Jacquet and R. P. Langlands, Automorphic Forms on GL(2), Lecture Notes in Mathematics, vol. 114, Springer-Verlag, Berlin–New York, 1970. https://doi.org/10.1007/BFb0058988.
- [17] H. Kim and P. Sarnak, Refined estimates towards the Ramanujan and Selberg conjectures, Appendix 2 in H. Kim, Functoriality for the exterior square of and the symmetric fourth of , J. Amer. Math. Soc. 16 (2003), no. 1, 139–183; Appendix 2, 175–181. https://doi.org/10.1090/S0894-0347-02-00410-1.
- [18] E. M. Kıral and M. P. Young, Kloosterman sums and Fourier coefficients of Eisenstein series, Ramanujan J. 49 (2019), no. 2, 391–409. https://doi.org/10.1007/s11139-018-0031-x. The cited proposition numbering refers to arXiv:1710.00914v1 (2017).
- [19] J. Li and J. Liu, Theorem on the Goldbach Conjecture, arXiv:2606.05224v2, 2026.
- [20] J. D. Lichtman, A modification of the linear sieve, and the count of twin primes, Algebra Number Theory 19 (2025), no. 1, 1–38. https://doi.org/10.2140/ant.2025.19.1; arXiv:2109.02851v2.
- [21] J. D. Lichtman, Primes in arithmetic progressions to large moduli, and Goldbach beyond the square-root barrier, arXiv:2309.08522v1, 2023 (with an appendix by S. Drappeau and J. D. Lichtman).
- [22] J. Maynard, Primes in arithmetic progressions to large moduli I: Fixed residue classes, Mem. Amer. Math. Soc. 306 (2025), no. 1542. https://doi.org/10.1090/memo/1542.
- [23] J. Maynard, Primes in arithmetic progressions to large moduli II: Well-factorable estimates, Mem. Amer. Math. Soc. 306 (2025), no. 1543. https://doi.org/10.1090/memo/1543.
- [24] J. Maynard, Primes in arithmetic progressions to large moduli III: Uniform residue classes, Mem. Amer. Math. Soc. 306 (2025), no. 1544. https://doi.org/10.1090/memo/1544.
- [25] F. W. J. Olver et al., eds., NIST Digital Library of Mathematical Functions, Release 1.2.8, September 15, 2026. https://dlmf.nist.gov/ (accessed November 5, 2026).
- [26] R. Zhang, Shifted primes in arithmetic progressions to large moduli with linear sieve remainder weights, preprint, Zenodo, 2026. https://doi.org/10.5281/zenodo.23615525.
- [27] R. Zhang, Theorem (1 + 1.8) on the Goldbach conjecture, preprint, Zenodo, 2026. https://doi.org/10.5281/zenodo.23649264.
- [28] A. Pascadi, On the exponents of distribution of primes and smooth numbers, arXiv:2505.00653v2, 2025.
- [29] R. Li, On Chen’s theorem, Goldbach’s conjecture and almost prime twins II, Math. Rep. (Bucur.) 28(78) (2026), nos. 1–2, 39–61. https://doi.org/10.59277/mrar.2026.28.78.1.2.39.
- [30] J. Wu, Chen’s double sieve, Goldbach’s conjecture and the twin prime problem, Acta Arith. 114 (2004), no. 3, 215–273. https://doi.org/10.4064/aa114-3-2.
- [31] J. Wu, Chen’s double sieve, Goldbach’s conjecture and the twin prime problem, 2, Acta Arith. 131 (2008), no. 4, 367–387. https://doi.org/10.4064/aa131-4-5.