Shifted primes in arithmetic progressions to large moduli with linear sieve remainder weights
Abstract.
Let be a sufficiently large even integer, and fix and . Take Iwaniec’s upper or lower linear-sieve remainder weights. We estimate a signed sum of prime-counting discrepancies on . Fix and a sieve exponent . Choose . Then the complete modulus support lies below . For every fixed saving exponent , the error is . For each of the two signs , the result holds uniformly for integers satisfying for every modulus in the support of the corresponding coefficient . Call these shifts admissible; they form a subset of the interval that includes . When and , the ratio is . The proof keeps the smooth-divisor and prime-tuple factors of the linear-sieve weights. It combines dispersion with a Heath–Brown decomposition. The boundary, Type-I and Type-II terms are estimated separately.
Key words and phrases:
shifted primes, linear sieve, level of distribution, dispersion method, Kloosterman sums, primes in arithmetic progressions2020 Mathematics Subject Classification:
Primary 11N13; Secondary 11N36, 11L05, 11P321. Introduction
The Bombieri–Vinogradov theorem [2, 3] gives level for primes in arithmetic progressions on average. Related early weighted work includes Fouvry–Iwaniec [19, 20]. Consider weighted sums with a fixed residue. Bombieri–Friedlander–Iwaniec reached level with well-factorable weights [6, Theorem 10]. With a fixed residue, Maynard [7, Theorems 1.1–1.2] proved level for triply well-factorable weights and level for the upper linear-sieve weights. Parts I–III address fixed residue classes, well-factorable estimates, and uniform residue classes, respectively [21, 7, 22]. Lichtman [1, Theorem 1.7, (1.6)] obtained level for triply well-factorable weights with a fixed residue. For such weights he also obtained level , uniformly over residues for each fixed [1, Theorem 1.7, (1.7)]. His Proposition 6.6 treats Iwaniec’s modified upper and lower linear-sieve weights. There the largest prime factors are restricted to prescribed short intervals. Its admissible level is with defined in [1, (6.2)]. Take at least three prescribed factors and below the threshold in that proposition. Then the level becomes , with the function of [1, (6.4)] and fixed . The error constant in that proposition depends on the fixed residue [1, Proposition 6.6]. Lichtman’s modified linear-sieve weights reach level [25].
Pascadi [8, Theorem 1.3] gives levels approaching for triply well-factorable weights, with a fixed residue. For suitable upper linear-sieve weights his levels approach . Pascadi’s Theorem 5.4 also treats both signs of the restricted well-factorable linear-sieve weights and refines Proposition 6.6 [8, Theorem 5.4]. His Lemma 5.6 records a correction to a small error in Section 6 of [1] [8, Lemma 5.6].
Here with and , so , in the fundamental-lemma range. The cited linear-sieve levels use sifting ranges with – and are not directly comparable.
The congruence says that divides the shifted prime . So the sums below count shifted primes in the class modulo . The modulus coefficients are Iwaniec’s explicit lower and upper remainder weights [10, Theorem 4]. We retain their smooth-divisor factors, prime-tuple factors, and distinctness conditions. We estimate the complete signed sum for the admissible shifts in the stated interval. Theorem 1.2 covers the fixed parameters below. Its support exponent tends to as . This numerical endpoint matches Lichtman’s moving-residue level for triply well-factorable weights [1, Theorem 1.7, (1.7)]; the residue ranges differ. At the exponent is smaller. The coefficient family here is the full remainder in [10, Theorem 4]. It includes the smooth-only term and the distinctness masks. Lichtman’s Proposition 6.6 estimates restricted factor-pattern components of different modified sieve weights. Its implied constant depends on the fixed residue. Here uniformity is only over the support-coprime shifts specified below, an admissible subset of that includes ; no uniformity over the full interval is asserted.
The local statement uses the hypotheses of Section 3. Let be a Heath–Brown box at scale . Write for its finite source coefficient and for its modulus coefficient. Set
In Section 3, is written as a sum over the variables of ; this is the same discrepancy.
Proposition (Dispersion for a source box).
Fix and constants and . Here bounds the logarithmic difference between the prime scale and . The source boxes have relative width . Let be sufficiently large and even, , and put and . Let be a positive integer with . Suppose every supported modulus is coprime to . Suppose and satisfy (H1)–(H5) of Section 3. These include the support condition , where
For each fixed there is a finite such that
| (1.1) |
Here denotes the fixed uniform constants in (H1)–(H5). The estimate is uniform in , , and all as above. The implied constant and the threshold for are ineffective.
Theorem 3.1 in Section 3 is the abstract dispersion estimate under the support and packing hypotheses in (H3). Theorem 3.2 is the dispersion engine used for Theorem 1.2. It allows support up to .
Theorem 1.1 (Signed shifted-prime mean value at ).
Fix , , and
Set
and choose an integer ; constants may depend on this choice, as in Theorem 1.2. Let be sufficiently large and even. For either sign , let be the complete Iwaniec remainder coefficient of formula (W) in Section 5. Its prime set is , with the grid and distinctness conditions there. Let be an integer with and for every . Call these shifts admissible; they form a subset of the interval that includes . Put . Let count its primes, and those congruent to modulo . Then
and
The sum covers the complete support of formula (W). For the admissible choice , the sieve ratio equals . The implied constant and the threshold for are ineffective.
Remark (parameter conventions). In Theorem 1.1 one takes and . The shifted choice and the corresponding occur only in the auxiliary source-wide estimate (3.95), which is not used in the proofs of Theorems 1.1–1.2 or Corollary 1.3, nor in Section 5.
Theorem 1.2 (Signed shifted-prime mean value).
Fix , , , , and
Put
Set . Choose an integer box-width exponent
The implied constant and the threshold for below may also depend on the chosen . For the canonical choice this is a dependence on alone. Equivalently , with the boundary exponent of (3.24) and (B.19). This also gives the logarithm-freezing condition from (B.18). Let be sufficiently large and even. For each sign , let be the complete Iwaniec remainder coefficient defined by formula (W) in Section 5. Its prime set is , with the grid and distinctness conditions specified there. Let be any integer satisfying
Call these shifts admissible; they form a subset of the interval that includes . Put
Write for the number of primes in . Write for the number of these primes with . For every fixed in the displayed range, these coefficients satisfy
and
| (1.2) |
The sum includes the entire support of formula (W). The sieve ratio is . The condition on gives , as required for the rough-factor bounds. The implied constant and the threshold for are ineffective. The proof uses the Siegel–Walfisz theorem.
Proof of Theorem 1.1.
Apply Theorem 1.2 with . Then , and its condition on becomes the displayed condition above. All the support, coefficient, and discrepancy bounds specialize as stated. The numerical sieve ratio follows from . At the proof uses Theorem 3.2 through Theorem 1.2. That theorem allows support up to . It does not use the introductory proposition. At the support bound of (W) exceeds . ∎
In Theorem 1.2, and by the choice of . The introductory source-box estimate has the fixed local level . It assumes its support hypothesis. The packing ceiling for Theorem 1.2 is . The latter applies the dispersion theorem 3.2 together with the source estimates below. Here . Fix . Each source shell has . So, for sufficiently large ,
Thus the full support of Iwaniec’s remainder weights lies in the range of Theorem 3.2. Section 4 proves the modulus packing. Appendix B estimates the Heath–Brown, boundary, and other source terms. Section 5 assembles these estimates.
Corollary 1.3 (Logarithmic-integral comparator).
Under the hypotheses of Theorem 1.2, for each ,
The implied constant and the threshold for are ineffective.
2. Classical inputs and Theorem 2.8
Put . Write for . Unspecified arithmetic indices are positive integers. Norms of sequences are counting-measure norms. A star denotes reduced residue classes in residue sums. In character sums it denotes primitive characters. These two uses are distinguished explicitly below. Constants are uniform within each sequence family. Put
| (2.1) |
Thus , where is the unramified Ramanujan exponent. This symbol is distinct from the level parameter and the exceptional parameters .
2.1. Spectral normalization and large sieves
The spectral large sieves are due to Deshouillers and Iwaniec [5].
Let . Use Petersson-orthonormal bases at level . The measure is . Take . For a Maass cusp form,
| (2.2) |
This is the Fourier expansion of [5, (1.15)], as printed there. It has no factor ; that factor enters only through the dictionary (2.11). For a holomorphic form of even weight , write
| (2.3) |
The Eisenstein coefficients have the normalization of [5, (1.17)]. Their relation to the Whittaker coefficients of Drappeau, whose full dictionary is (2.11) in §2.2 below, is
| (2.4) |
Let run over inequivalent cusps. Use width-one scaling matrices. The continuous-spectrum measure in the DI large sieve is plain .
Theorem 2.1 (consequence of [5, Theorem 2]). Let , , and . Let be supported on . Then each of
| (2.5) |
is at most
| (2.6) |
uniformly in . By [5, Theorem 2, (1.28)–(1.30)], each expression is bounded by , with the constant depending only on . At , , giving (2.6); the source includes the endpoint . The third line of (2.5) has no factor . The cusp transport for Theorem 2.8 is in §2.7.3.
For an exceptional eigenvalue , choose , and put
| (2.7) |
Theorem 2.2 ([5, Theorem 5], the specialization used here). Let , , and . Let be supported on . Then
| (2.8) |
This is [5, Theorem 5]. It uses the notation of Theorem 2, so is allowed. The implied constant depends on alone.
Theorem 2.3 (from [5, proof of Theorem 7, (8.17)]). Let . Let be the characteristic sequence of an integer interval . Then, for some and uniformly in and ,
| (2.9) |
The range starts at because Theorem 2.8 uses level with , so there.
Proof. By [5, (8.17) and (8.4)],
for . In [5] the interval is printed as , . The sum runs over , so is the characteristic sequence of the initial interval . The source estimate (8.17) is uniform for and every real ; its final statement imposes no relation between and . In the proof, the induction first treats at , while (8.18) handles the remaining large- range, and the final comparison extends the result to every . We write all intervals in this half-open form.
(i) -blocks. Let . The blocks , , together with , cover . There are at most of them. Every summand is nonnegative. So each block may be enlarged to its full DI range. Each block has .
(ii) Intervals. Write with . Then , both initial intervals in DI’s sense, and . This costs a factor 4.
Hence the left side of (2.9) is at most . Take and .
2.2. Hecke exponents and the adopted trace normalization
Kim–Sarnak input. The bound at an unramified place is [13, Appendix 2, Proposition 2]; the Satake normalization is stated in [13, p. 175]. Independently, the archimedean input is the lower bound in [13, Appendix 2]; it is not a consequence of the finite-place estimate below. Let be a weight-zero Maass newform of congruence level. Each exceptional parameter of satisfies . For a prime not dividing the level,
| (2.10) |
Thus the preceding archimedean input gives , equivalently by (2.7). At the finite places, (2.10) gives for coprime to the level. We use these bounds for newforms of level dividing . These newforms diagonalize the unramified Hecke operators on the full level- space. For holomorphic newforms we use Deligne’s , again for coprime to the level. Both factorizations use primes coprime to the level.
Deligne input. The holomorphic bound is [14, Théorème 8.2]. Both inputs enter at primes coprime to the level, through the prime-power recurrences and multiplicativity above.
Bruggeman and Kuznetsov independently introduced the relevant trace formulas; see [5, p. 220] and their original papers [27, 26]. For the normalization and formulas used here, see [9, (4.7), (4.9)–(4.19), Lemma 4.5], in the PLMS version. The coefficient dictionary is
| (2.11) | ||||||
with (2.4) for Eisenstein series. The Maass identity follows from .
For , define the DI transforms
| (2.12) |
Values at removable singularities are limits. In Drappeau’s notation the corresponding transforms are , , and .
Theorem 2.8 and Section 3 use the following identity. Let , , and ; take
| (2.13) |
The scaling matrix and admissible moduli in (2.13) are also given in [5, (1.6) and (2.4)] and [9, Lemma 4.3]. Since , the cusps and are inequivalent. Hence the same-sign identity has no diagonal term. If a matrix in maps to the reduced fraction , its lower-left entry is . Then , so . Every application here has . For , put . In the DI coefficients, Drappeau’s formulas read
| (2.14) |
The proof uses only the identities (2.7.T16)–(2.7.T18), derived in §2.7.2. The continuous integrals carry plain . Let be finite sequences. Multiply (2.14) by , sum in , then take spectral absolute values and apply Cauchy–Schwarz. The first functional is . The spectral product is .
2.3. BFI and the classical progression estimates
For a finitely supported sequence , define
| (2.15) |
The notation of [6, (1.1)] writes for (2.15) with both sums cut at .
The progression estimates are from Bombieri, Friedlander and Iwaniec [6]. We use [6, (A2), Theorem 0(a), and proof of Theorem 0(a)].
BFI hypothesis (A2) [6, (A2)]. Fix for the sequence family. Let be in the family, with support parameter . For every and integer with , and for every , there is with
| (2.16) |
The are independent of and of in the family. As in [6], and run over all positive integers. If for a fixed , then a bound implies (2.16), after adjusting the constant.
Theorem 2.4 ([6, Theorem 0(a), (2.2)]). Let be supported on , , and satisfy (2.16). For every , there is such that, uniformly for ,
| (2.17) |
The constants depend on and the constants in (2.16). For a sequence on , replace by in (2.17).
[6, Theorem 0(b)] is not used; its discrepancy has the cutoff of [6, (1.1)], while (2.15) is a full-support discrepancy. The switched bilinear form uses the full-support bound (3.49), proved from (3.25), (3.48) and Theorem 2.4.
That bound uses [6, (1.6)]. Let be supported on . The large sieve gives
| (2.19) |
We use this initial-interval form with the upper support bound.
Bombieri–Vinogradov input. Write . For every there is such that, for and ,
| (2.20) |
This is BFI’s formulation of the Bombieri–Vinogradov theorem [6, (1.4)]; compare the original results [2, 3]. The maximum allows the varying reduced residue . We apply (2.20) at each endpoint separately, with its own level inequality. Thus (2.20) is used at fixed only.
Siegel–Walfisz input. We use the power-log form of [17, Corollary 5.29]. Remove prime powers and sum by parts. Let and be fixed. For , and ,
| (2.21) |
The constant is uniform in reduced and is ineffective. Subtraction at two comparable endpoints keeps any fixed logarithmic saving. We use (2.21) with this power-log error. Three further forms need their own proofs. The first saves a power of the interval length. The second keeps the tensor and coprimality structure of the structured sequences. The third is localized to one dyadic box of the Heath–Brown decomposition. Section 3 proves the short-interval estimates and those for its structured sequences.
2.4. The linear sieve and its structured remainder
Let be a finite integer sequence with nonnegative multiplicities. Let be a prime set. Put
| (2.22) |
Here and is multiplicative. Require for . Set for excluded primes. Set . Use the continuous linear-sieve solutions
| (2.23) |
On , decreases to 1. Also increases to 1, with through . In particular . We use this endpoint when the level is at least the sifting limit.
Let be one fixed absolute constant such that, for all ,
Such a constant exists by Mertens’ product estimate, after increasing it to cover bounded .
Theorem 2.5 ([11, Theorem 1], dimension one). Suppose, for some fixed and every ,
| (2.24) |
Let and . Then
| (2.25) |
where, for ,
| (2.26) |
See [11]. The hypotheses are (1.1)–(1.3), and Theorem 1 is (1.4)–(1.6). The dimension-one constants and appear in [11, p. 176]; the source states in [11, p. 173]. For the lower main function in (2.25) vanishes. Hence its lower main term is nonpositive.
For the later prime set , take the multiplicative function with on , off it, and for . Its product in (2.24) is over a subset of all primes in , so (2.24) holds uniformly in with the fixed value . The same data satisfy (2.27) with . Thus, whenever (2.25) is specialized to this set, its factor is . This is fixed; combining it with (2.26) changes only the absolute constant in the term there. This is a nominal sieve density: by Theorem 2.6 the constructed coefficients are independent of , , and .
The structured remainder is from [10, Theorem 4].
Assume (2.24) and nonnegativity of on prime powers. Fix . Assume, for all ,
| (2.27) |
These are [10, (1)–(2)] in dimension one, with .
Fix and . Put and
| (2.28) |
Let consist of tuples from this grid with . Define
| (2.29) |
[10, Theorem 4] gives . This bound follows the definitions of and . The grid is built from the relative level of each application.
Theorem 2.6 (from [10, Theorem 4], with ). Assume (2.22), (2.24), (2.27), with the parameters above. Then there are coefficients and of modulus at most 1. They are independent of . They satisfy
| (2.30) | ||||||
where and
| (2.31) |
with an absolute implied constant. [10, Theorem 4] contains . For the coefficient construction used here, the prime set and multiplicative function just specified give and . Hence (2.31) has the fixed factor ; it is retained in the formula and may be absorbed into the implied constant. The prime-power dependence comes from its (2), namely (2.27). In its estimate (31), put . Then
For the first bound use in (2.27). An empty prime interval contributes zero. The second bound follows factor by factor. Thus bounds the extra prime-power factors in the nonsquarefree terms. Formula (2.31) keeps the factor of the source. The signed remainders are
| (2.32) |
| (2.33) |
The sets impose distinctness on equal-label tail positions. Unequal grid intervals are disjoint. Coefficients may be zero on unused tuples. They depend only on and the distinctness conditions. In particular they are independent of . They may change with the level or the cutoff.
[10, Theorem 4] holds for general , , with the respective ranges in (2.30). Its preceding combinatorial identities give and . The coefficients come from [10, (23)–(25), (26), and Lemma 4]; these formulas also show their independence of the sequence.
Relative-level grid. Choose first, and put . For any level , substitute
| (2.33a) |
Then, term for term,
| (2.33b) |
Thus the labels, half-open prime intervals, smooth-prime cutoff, and smooth-divisor support agree term by term with (2.32)–(2.33). These are the Iwaniec parameters at level , and the tuple conditions (2.29) are unchanged. With this , Theorem 2.6 applies as stated. In the application to (W), Section 5 takes , so the grid there is exactly the global grid in Theorem 1.2. The coefficients are the values supplied by Iwaniec’s construction for at the cutoff of the application, here . The cutoff also restricts the prime variables in (2.33). The proof uses only the bound and the support of these coefficients. It never compares coefficient values at different cutoffs.
[10, Lemma 3] gives with error . In its use here the sieve constant is , fixed independently of . Therefore is absorbed into the implied constant, and the error is with that fixed constant. Likewise, in the profile (2.26), this multiplier changes only its absolute constant. The lemma cites [11, Lemmas 18 and 20]. Theorem 4 includes the closed endpoints and of (2.30), although [11, Lemma 20] has strict inequalities.
2.5. The fundamental lemma, Weil bound, and Heath–Brown identity
Fundamental lemma (cf. [6, Lemma 4]; the prime-support condition is explicit in [18, Lemma 5]). Let , and . Let be the product of all primes below . There are , supported on , , with , and
| (2.34) | ||||
The support means that every supported is squarefree and uses only primes below . In (2.34), this makes a sum over exactly the sieving divisors: if , only contributes, and otherwise FI78’s divisor-sum signs apply to . The support is also used in the remainder sum in (2.25). The explicit Bonferroni weights in (3.102)–(3.104) use the same support to sieve only primes in below and to obtain the stated divisor count. For the AA37 weights in (W), the corresponding condition separates the smooth divisor, whose primes are below , from tail primes . This is used in the unique recovery of in the proof of the slot identity (4.13) and in Appendix B, Lemma B.1.
The error suffices below. Removing the primes of an auxiliary modulus changes the local Euler product and needs its own argument. The rough-integer estimates below use explicit Brun–Bonferroni weights; see also [30]. The Iwaniec endpoint follows from Theorem 2.6.
Weil input. For every and , define
The required bound is
| (2.35) |
This is the Weil–Estermann bound with full gcd. Its gcd factor covers nonprimitive indices; see [17, Corollary 11.12]. In (2.14), (2.35) serves for absolute convergence. Each quantitative application keeps the gcd and modulus factors in its sums. For prime moduli this is Weil’s bound; prime powers use Estermann’s bound, and the general modulus follows by the Chinese remainder theorem.
Lemma 2.7 (the exact Heath–Brown identity used here). Let , be an integer, and let satisfy . Then for every integer ,
| (2.36) |
The identity is [12, Lemma 1, (6)].
Equation (2.36) is algebraic. For , set , . The coefficients of vanish at indices . The polynomial identity gives
| (2.37) |
Each nonzero factor from has index . Hence the last term has no coefficient of index . Coefficient extraction proves (2.36). For the order-three decomposition on , take , . Then . The Möbius variables have support . Dyadic restrictions are imposed after this identity. Coefficient extraction preserves both product constraints and prime ordering.
2.6. Theorem 2.8
Theorem 2.8 belongs to the line of incomplete-Kloosterman estimates of [5, Theorem 12] and [9, Theorem 2.1]; Drappeau states that his theorem extends DI82 Theorem 12. The closest refined quintilinear estimate is [1, Theorem 1.8, (1.8)–(1.9)]. Lichtman identifies [23, 24] as antecedents for the exceptional-spectrum and residue-dependence refinements. The statements are not identical: the hypotheses (2.38)–(2.40) and bound (2.42) are the variant proved here from (2.14) in §2.7. Section 3 uses the full bound (2.42) in (3.14)–(3.15).
Theorem 2.8. Let , , and . Let be supported on
| (2.38) |
Let be smooth, supported in
For each multi-index , assume
| (2.39) |
The are uniform in the family. Let satisfy , and require
| (2.40) |
Set . For every ,
| (2.41) |
where the inverse is modulo , and
| (2.42) | ||||
Here if each prime factor of divides . This includes . Also
| (2.43) |
with extended by zero outside (2.38). When , only occurs in (2.42). The implied constant depends only on the displayed parameters and the seminorm bounds . It is uniform in .
For , the condition means and . Pairs with are included, as are both signs of . The sequences and weights may be complex.
2.7. Proof of Theorem 2.8
The proof uses the large-sieve bounds above, the Hecke bounds of Kim–Sarnak and Deligne, and the trace formula (2.14). We derive the opposite-sign trace formula below.
In this subsection are the parameters of Theorem 2.8. Write for ; Section 3 uses for other scales. Put
| (2.7.T1) | ||||
on an exceptional eigenspace. All norms below use counting measure. Spectral bases are Petersson-orthonormal.
2.7.1. Completion and separation
Fix , put , and define . Group in reduced classes modulo and apply Poisson summation. This gives the exact identity
| (2.7.T2) |
The zero frequency is bounded using . Since and , Cauchy–Schwarz gives its absolute contribution
| (2.7.T3) |
This is the fourth term of (2.42).
Choose a small auxiliary exponent . Set
| (2.7.T4) |
Integrate by parts in . Use (2.39) in on . For every and , this gives . Every has , because . By (2.7.T4) this gives . Hence, for every with ,
| (2.7.T5) |
For and every , . If , the sum runs over all and is at most . If it is at most . With , the tail of (2.7.T2) is for each . Summing against over gives , using , and . Taking makes it smaller than (2.7.T3). If , the retained range is empty. Every nonzero frequency lies in this tail, including . Thus (2.7.T2) contains only the zero frequency and this tail. Equation (2.7.T3) completes this case.
For , write and , with signs . The identity makes the second Kloosterman argument . Partition the integers into
| (2.7.T6) |
Thus the first nonempty block is exactly , with . Partition into , . Shortened final blocks remain integer intervals. There are pairs of blocks; each restricted coefficient norm is bounded by the original norm. For the current block define
The slice satisfies . Restrict to the current block. By support, term by term. Thus the block estimate is exactly (2.42)–(2.43).
For one block write
| (2.7.T7) | ||||
Differentiate under the integral and use (2.7.T4). Then
| (2.7.T8) |
The block sum is times a sum with weight . Put
| (2.7.T9) |
Invert and multiply by fixed smooth cutoffs in , each equal to 1 on that variable’s range () and supported in . Since and , the resulting smooth function is supported on , hence on . Mellin inversion in its four log coordinates gives
| (2.7.T10) |
| (2.7.T11) |
For (2.7.T11), integrate three times by parts in each Mellin variable. There are four variables. Allow five -derivatives. This uses at most 17 derivatives in (2.7.T8). The chain rule uses , . Thus (2.7.T10) and all ensuing integral interchanges are absolutely convergent. For fixed set and . Estimate the following sum.
| (2.7.T12) |
2.7.2. The cusp pair, both signs, and transform bounds
Use and
| (2.7.T13) |
Multiply by (2.7.T13). With , the positive cusp moduli are , , as in (2.13). Conversely choose , , and ; this supplies every allowed modulus. Double cosets correspond to the reduced residues modulo . Insert their top and bottom entries in the cusp Kloosterman definition. This gives
| (2.7.T14) |
The numerator modulo is . Modulo it is , with . This proves (2.7.T14) for either sign and for complex Fourier coefficients.
We use the trace formula in DI’s coefficient normalization, with the transforms of (2.12). Let and . Use the same-sign Drappeau formula of Section 2. Apply the exact dictionary below.
| (2.7.T15) |
The holomorphic dictionary is . For signs , the Maass weights are as follows.
| (2.7.T16) |
For measure , the continuous weights are as follows.
| (2.7.T17) |
Only sign has a holomorphic coefficient. It is
| (2.7.T18) |
There is no in (2.7.T17).
For the opposite sign the normalization follows from the following derivation. Take a width-one scaling matrix . Let stabilize in , including . Then . Define, for ,
Each coset enters once, with weight one. The series and unfolding converge absolutely for . Unfold the first series and decompose the second into cusp double cosets of positive lower-left entry . Translation in the real variable leaves the Kloosterman factor , with the cusp convention of (2.7.T14). Explicitly, a matrix gives phase ; its negative inverse has entries , giving the same phase in . The remaining integral is
The zero-lower-left coset, if present for equivalent cusps, vanishes by the integral of over . Put , , , , and . Then
For each interior , shift to the real line. The vertical sides vanish exponentially, and the inner integral is . Let . At either angular endpoint the radial growth is of order . For , a logarithm may also occur. The remaining exponent is . Hence the original absolute integral is finite. Hence Fubini and the endpoint limits are legitimate. Applying (2.7.T20) gives the following identity for :
| (2.7.T19) | ||||
The polar substitution and contour shift above give the factor . The remaining angular integral is
| (2.7.T20) |
For an independent normalization, unfold once and use (2.2). This gives
This is the integral of . Use the standard integral representation of and a beta integral. The second factor is the same expression with , in place of , . There is no conjugation of in this bilinear pairing. Multiplication gives exactly (2.7.T21). Applying the same unfolding to the Eisenstein expansion (2.4), with its standard Parseval measure, gives (2.7.T22). Thus Parseval gives the spectral side with
| (2.7.T21) | ||||
Its Maass summand is . Its continuous integral is
| (2.7.T22) |
The factor at the second cusp has index . It arises because the second Eisenstein parameter in Parseval is conjugated: . So the continuous product pairs a conjugated coefficient at with an unconjugated one at .
For the unscaled Eisenstein series the continuous Parseval measure is . Its coefficient of is
Hence equals
The coefficient product contributes , canceling the Parseval denominator. Thus (2.7.T22) has plain and no hyperbolic-cosine denominator. The second is unconjugated at the same .
Write , , , and , with fixed . Replace both Poincaré summands by their moduli. For one double coset with positive lower-left entry, the absolute integral is
| (2.7.T23) |
The radial integral is a fixed positive factor times . For , its small-argument bound is ; for , it is . The angular weight is . Thus the power endpoint has exponent , while the logarithmic endpoint is integrable and contributes after angular integration. The implied constant depends on the fixed spectral parameters and on , and is uniform in .
Consequently the controlling absolute-sum majorant is
| (2.7.T24) |
For the cusp pair , (2.7.T14) gives , , and . The sum is bounded by a constant times , which converges because . For a general fixed cusp pair, the cited cumulative count and dyadic decomposition bound the tail by . Any bounded initial range is finite.
The logarithm in (2.7.T23) is attained: for , and the admissible moduli , odd, the absolute cell integral is . The summable majorant (2.7.T24) supplies the uniform step beyond the fixed- angular endpoint estimate.
Both sides continue to the connected domain . For the geometric side, Weil’s bound and give locally uniform absolute convergence. For the spectral side, apply Stirling and DI’s positive large sieves. These give locally uniform absolute convergence. Since , the exceptional gamma factors have no poles here. Equality therefore holds at . With
| (2.7.T25) |
this gives
| (2.7.T26) | ||||
where
The factor of (2.7.T22) is part of the spectral kernel; excludes it. The constant eigenfunction contributes to the sum over : its Fourier coefficients vanish at the nonzero frequencies and .
To integrate (2.7.T26) against a test function, set
| (2.7.T27) |
Kontorovich–Lebedev inversion gives ; see [29, §10.43(v), (10.43.30)–(10.43.31)]. Use the following kernel identity.
| (2.7.T28) |
For , the absolutely convergent product integral is
| (2.7.T29) |
Use the Bessel product representation . Integrate in . For , use . The latter follows by expanding and the partial fractions of secant. In the subsequent KL application, with ; here on the regular and continuous spectrum, while an exceptional parameter satisfies . Thus and . Apply KL inversion to , whose KL transform is, by (2.7.T29), . This proves (2.7.T28).
All interchanges here are justified as follows. Split the integral representation of at . Integrate by parts on its tail. This gives
| (2.7.T30) |
Apply the self-adjoint operator repeatedly to . Then . On real , ; exceptional parameters give an exponentially decaying function of as well. DI’s positive quadratic estimates imply convergence after the remaining bound. The geometric side is absolutely summable by Weil. These bounds justify Fubini on both sides of (2.7.T26). Equations (2.7.T27)–(2.7.T28) now give exactly (2.7.T16)–(2.7.T17) for sign . For sign , let . Insert (2.7.T15) in the classical same-sign formula. This gives the minus signs in (2.7.T16)–(2.7.T17) and the coefficient (2.7.T18). These are the normalizations of Section 2, (2.14).
Let be supported in . With , the transform bounds are
| (2.7.T31) |
| (2.7.T32) |
and the same bound as (2.7.T31) for with replaced by . To prove them, put and . Five integrations by parts give , . The exact Bessel representations are
Their absolute bounds follow by splitting at ; three integrations by parts give the cubic decay. The periodic holomorphic integral has no boundary terms. Replacing cosine by and splitting at the same point gives (2.7.T32). Truncate the oscillatory representations first. For real , the tails are . For , they are . Since , these tails tend to zero and justify the interchanges.
2.7.3. Cusp transport and all Hecke factors
Choose integers with , and let
| (2.7.T33) |
Then , with . Also . Here is an integer computation of the latter fact. For , , conjugating gives entries
| (2.7.T34) |
Both and have this form, proving both inclusions. Thus composition by is unitary, commutes with the Laplacian, and preserves each eigenspace. The weight- slash action has the same properties.
Comparison of Fourier series after the translation gives
| (2.7.T35) |
For Eisenstein series, substitute in the defining coset series for . It gives , using as a width-one scaling matrix. Changing the source-cusp representative or translating its scaling matrix does not change the Fourier coefficient at the fixed observation cusp . Meromorphic continuation therefore gives
| (2.7.T36) |
In (2.7.T12), (2.7.T14) contributes . Equations (2.7.T35)–(2.7.T36) cancel this phase exactly for both signs, in every spectrum.
For , define the normalized Hecke operator below.
| (2.7.T37) |
Sum each Fourier term, of index , over . This forces , and the term moves to index . The coefficient at is
| (2.7.T38) |
The prefactor is 1 because, in the normalization (2.2) of [5, (1.15)], the factor contributes , and . For weight , use ; the normalized coefficients satisfy the same identity at coprime .
Split , , , and put . Then . The number of pieces is
| (2.7.T39) |
The product bound is uniform in . Choose so that for . The smaller primes contribute a constant depending only on . The remaining product is at most . On a Maass eigenspace , the transported -functional is , where . By Riesz representation and unitarity,
| (2.7.T40) |
The self-adjoint unramified diagonalizes on the full level space. By Kim–Sarnak its norm is at most . For holomorphic forms replace by 1, by Deligne. For negative index, . Conjugation permutes an orthonormal basis. Hence the positive-index quadratic bound holds with conjugated coefficients. The argument allows complex coefficients and any orthonormal basis of each eigenspace.
The continuous spectrum requires its own proof. Represent a cusp by , , put . The orbit conditions in [5, Lemma 3.6, (3.9)–(3.11)] , with , give exactly
| (2.7.T41) | ||||
For a character , let . For , either sign of , the identity is
| (2.7.T42) |
To prove it, sum (2.7.T41) over . Write , where is supported on primes of and . CRT factors the inner sum as . The outer character supplies another . Replacing the Gauss-sum variable by gives on . The other factor is
by ; this divisor sum factors at . All manipulations converge absolutely for . Both sides are meromorphic Fourier coefficients, so (2.7.T42) holds meromorphically, hence at outside a discrete set. There are finitely many cusp characters. Orthogonality in gives
| (2.7.T43) |
Here the character eigenvalue is , of modulus at most . Transport (2.7.T36) permutes the complete cusp set. For negative indices, . Changing to and conjugating coefficients converts each symmetric integration window to DI’s positive-index continuous quadratic form. The discrete exceptional set is null for the -integral.
2.7.4. Regular, continuous, and holomorphic estimates
Put , . Include among the spectral windows . By (2.7.T31), the undivided transform satisfies the following bound.
| (2.7.T44) |
For Maass forms use the positive DI weights . For holomorphic forms use the positive weights . These weights are split equally between the two Cauchy–Schwarz factors. For the continuous spectrum use plain . Take the supremum of outside the positive quadratic form. By (2.7.T17), , with . Thus every norm uses a positive measure.
[5, Theorem 2] at gives the -side
| (2.7.T45) |
For the -side, Cauchy–Schwarz over costs . Apply (2.7.T40) or (2.7.T43). Then use [5, Theorem 2] at scale . The bound is
| (2.7.T46) |
On continuous and holomorphic parts (2.7.T46) holds with replaced by 1. [5, Theorem 2] allows the endpoint in (2.7.T45).
Use . The sum over dyadic of the latter factor times the cubic decay in (2.7.T44) is . The cubic decay also absorbs a factor : with it the sum is . Thus the bound (2.6) in the form gives the same estimate. Cauchy–Schwarz and (2.7.T39) therefore yield
| (2.7.T47) | ||||
The same calculation with plain proves (2.7.T47) for the continuous part. It uses the symmetry shown after (2.7.T43). The same cubic summation proves absolute convergence of its integral, justifying the window partition. Thus the continuous part uses the measure throughout.
2.7.5. Exceptional spectrum and the one-integer block
Write , , . Since ,
| (2.7.T48) |
Fix . Apply Cauchy–Schwarz, assigning to the -side and to the -side. With as in (2.7.T40), the two exceptional quadratic forms are
with over the support of . Let . Apply (2.7.T40) and Theorem 2.2 at level , length and . Since , the factor in (2.8) is . Summing over gives
| (2.7.T49) |
Put , , and
| (2.7.T50) |
The identity gives
| (2.7.T51) |
Let . Then (2.9) applies to every integer interval inside . Use the positive Hilbert space with weights . Apply Abel summation to . The norm is at most times the maximum interval norm. Take the maximum after the norm. It remains outside the spectral sum. Apply (2.9) at . Then use monotonicity
| (2.7.T52) |
For fixed , the coefficient is independent of the factorization . Put and , and let count the distinct prime factors of . Since , . In the Hilbert space over all levels and their exceptional forms, vector-valued Abel summation gives , where and ranges over integer intervals. Thus the supremum is outside the whole quadratic form. Apply (2.9) with exponent at . By (2.7.T4), when ; also . Consequently . Together with (2.7.T51)–(2.7.T52), this is absorbed in and gives
| (2.7.T53) |
[5, (8.17)] excludes . We prove that endpoint here. Let be the least prime not dividing . Every smaller prime divides . The classical Chebyshev lower bound for (see [17]) gives
| (2.7.T54) |
Here , because the product of all smaller primes divides ; the case is immediate. The implied constant in (2.7.T54) is absolute and independent of .
On an exceptional eigenspace , let represent . Self-adjointness and (2.7.T38) show that represent . The Hecke identity , with , gives
| (2.7.T55) |
Multiply by , which is constant on . Group levels by , where is an absolute constant supplied by (2.7.T54). Positivity permits enlarging each group to all . For , the singleton is an integer interval in , with , so (2.9) applies at . In DI’s terms, subtract the initial intervals and . The resulting factor 4 is included in .
For the endpoint, the same factorization count multiplies the level- quadratic form by at most . The following bound holds for any positive exponent. In its use in (2.7.T57), take and use for . This keeps their combined loss within the displayed -power after adjustment of its constant. At it gives
| (2.7.T56) |
Since , insert (2.7.T56), with its exponent taken as , in (2.7.T55). Sum over the at most possible primes:
| (2.7.T57) | ||||
for , with the implied constant including the divisor bound and the change from to . Before simplification, the sum is at most a constant times
this is , because . The loss is logarithmic and uniform in . In particular ; together with the factorization loss already included in (2.7.T57), this fits the allowance of (2.7.T53). Together with (2.7.T51), this proves (2.7.T53) also for . Since , Abel summation costs nothing here.
Apply the triangle inequality over before Cauchy–Schwarz. Then (2.7.T49), (2.7.T53), and (2.7.T32) give
| (2.7.T58) | ||||
There is no exceptional continuous or holomorphic spectrum.
2.7.6. The four terms and completion of the proof
Put
| (2.7.T59) |
The quantity is unrelated to the cell endpoint of Section 3. Then , , so . Square (2.7.T47) and multiply by . Apart from the stated auxiliary powers, sum the following over .
| (2.7.T60) |
The first, noncancelling branch of (2.7.T58) has the same bound. Termwise, use
| (2.7.T61) |
To obtain (2.42), use the following identity.
| (2.7.T62) |
Multiply (2.7.T62) by , then drop the last (nonpositive) term:
Since and , it follows that
| (2.7.T63) | ||||
The last term follows from . Using , , proves the first two terms of (2.42), with kept explicit.
For the cancelling branch of (2.7.T58), use
| (2.7.T64) |
and . Since is increasing, substitute , paying at most . The resulting identity is
| (2.7.T65) | ||||
This is the third term of (2.42). The fourth was (2.7.T3). The truncated tail is smaller than it.
To account for all losses, reconstruct the block sum as . Equation (2.7.T11) gives . The amplitude’s loss in (2.7.T63) is at most after taking its square root. The log partitions and divisor factors cost . This includes the DI small losses, , and the one-integer loss. The bound is uniform in . Consequently the final loss is
| (2.7.T66) |
Choose the freely available small enough relative to the requested . Equations (2.7.T63), (2.7.T65), and (2.7.T3) then prove (2.41)–(2.43), with loss , for both signs and including the block. This proves Theorem 2.8 in the form used in Section 3, (3.14)–(3.15).
3. Dispersion for abstract sources
This section proves a local implication for an abstract source. It uses Linnik’s dispersion method [28]. The second-dispersion setup has close precedents in Maynard [7] and Lichtman [1, §5]; the proof below tracks its own coefficient masks, restoration terms, and moving residue. The local hypotheses are (H1)–(H5). The source-wide estimate (H6) and the box-family coefficient bound (H7) are used only in the global summation in Section 3.10. Each application verifies the required conditions for its own measures. The geometric and source partition results appear below. Theorem 2.8 is stated in Section 2, (2.38)–(2.43), and derived from the classical inputs in §2.7. We keep its full moving-frequency bracket. The local estimate has three terms. The restoration error is bounded apart from the spectral term.
3.1. Notation and source hypotheses
Local notation. Put ; §3.10 writes explicitly. is the lower endpoint of the selected Type-II cell, as in Lemma B.3 for the prime source. Here . The zero-mode functional is of (3.31); is the scale of . is a Heath–Brown box. and are the scales of and in (3.62), as in Theorem 2.8. is the count (3.70). is the scale of . denotes the signed box sum in (3.12). Type I-1 and I-2 denote boxes with one and two large variables (§3.11). Since , fixed powers of and are comparable. is the selected integer interval of a Type-II cell; is reserved for the source interval of Theorem 1.2. Some letters have local meanings, fixed at each use. The letter is a fixed logarithmic exponent in (3.13), (3.92) and similar bounds, and the scale of from (3.62) on. Similarly, is the source cut of Theorem 1.2, is a small fixed exponent, and is a sign. The letter is a summation length in (3.16)–(3.19) and (3.35). It is the auxiliary scale in the spectral step near (3.70). In Theorem 1.2 it is the smooth-prime cutoff . is the tuple set of §3; it is unrelated to .
Let be a sufficiently large even integer and let be a positive integer. Fix and
| (3.1) |
The local product scale is . All implied constants in this section may depend on the fixed and the fixed source bounds. They may also depend on the parameters displayed at the point of use. Put
| (3.2) |
In particular, .
Thus and . Every prime below divides . Chebyshev’s bound gives . By C4 below, , so eventually. Write
| (3.3) |
A Class-II box consists of the following data. These are source hypotheses.
C1. Exact unrestricted coefficient. Fix a source term, a prefix cell, a sign of the well-factorable remainder in Iwaniec’s theorem [10, Theorem 4], and a tail-label vector . Its coefficient is exactly
| (3.4) |
where each ranges independently over its fixed prime set and . Here is the source’s lower cutoff for labelled tail primes, and . The variable is squarefree with the cap of that theorem. The full modulus is at most . Every supported full modulus is prime to . Selectors are constant on the block. Exact identities remove the equal-tail, prefix-diagonal, natural-comparator, cut, and selector-transfer corrections. Each is a separate contribution outside (3.4).
C2. Exact factors. There is a labelled partition , with attached to , such that
| (3.5) |
The last two factors are -rough. If for , then . The factor always contains the smooth-divisor sum of Iwaniec’s theorem. If , then . Equality (3.5) holds on all supported moduli, with repeated-prime multiplicities. The source’s labelled-tuple map proves it. It covers moduli with repeated primes as well as squarefree ones.
C3. Packing. Localize dyadically the first factor at , at , and at . Here is the lower endpoint of the selected Type-II cell; is its integer length. Enlarge the sufficiently-large threshold for to absorb fixed dyadic constants. Then
| (3.6) |
Here is the scale of the first factor (the outer slot scale, written in Appendix B). It is not the scale of the full modulus of (3.4), which is . Thus (3.6) gives the first inequality in (3.7). We list the four spectral packing inequalities together.
| (3.7) |
Each application must verify the stated packing and interval conditions for its own source. Appendix B does so for the prime source in Theorem 1.2.
Removed squareful and other restricted terms. A source may remove forbidden tails, forbidden prefixes or retained allowed repeats. Their contributions are bounded separately. One admissible bound is , after all source-label and representation multiplicities. Theorem 3.2 concerns the unrestricted coefficient (3.4). The removed terms need their own estimates.
The prime source in Theorem 1.2 is . Appendix B verifies its coefficient, interval, cutoff, support, and boundary conditions. The hypotheses above also state the local estimate for any other source that satisfies them.
Apply the finite HB expansion below. Then split into disjoint short product boxes of relative width . Boundary boxes contribute separately. On each interior Class-II box select an HB variable in the window. Maximize its lower-endpoint exponent . Break ties by the fixed variable index, as in the classification in Appendix B. Call it , and the product of the other variables .
In (3.8), allow a roughness cutoff , where is the baseline in (3.2). All estimates below are uniform in . Upper bounds use only . The SW proof (3.25) for the selected factor uses the cutoff . It remains uniform under stronger roughness.
| (3.8) |
The fixed HB binomial coefficients and tags may be kept as exterior scalars. has length . The -interval is majorized by
| (3.9) |
Fix , with and on . It is independent of , , the source and the box. It is also independent of all shell and tuple variables. For every , the seminorms and are fixed constants. The support of lies in the doubled interval. The majorant depends on the box only through and . On that entire support the cut geometry gives
| (3.10) |
C4. Moving frequency. All original moduli are prime to , and . This is the moving frequency in the spectral theorem. It may vary with .
C5. Window. The source selection gives
| (3.11) |
The second assertion follows from the first and , with chosen after fixed . Claim P (nonresonance): the doubled support satisfies (3.10). The source assumptions for the non-II extension are in §3.11.
3.2. Statement and theorem inputs
Length hypothesis for the selected integer interval (LEN). Uniformly over the selected boxes, the interval has length and satisfies . The integer interval used in (3.17) has this same length, with the endpoint convention specified by the source. Lemma B.3, (B.22)–(B.27), proves this for the prime source. Each application proves it for its own source.
For the coefficient of one Heath–Brown box define
| (3.12) |
3.3. An abstract dispersion estimate
The local argument is source-independent. We state it before the verification for specific sources. Let be a finite family of dyadic boxes at scale , and let be a moving frequency. For write for its signed modulus coefficient. Define by (3.12).
The following hypotheses define the class used in this paper.
- (H1) Exact coefficient:
-
On every box, has the exact form (3.4), with its fixed labelled prime sets, squarefree smooth-divisor variable , and repeated-prime multiplicities. Every supported modulus is coprime to .
- (H2) Three-factor decomposition:
-
The labelled variables split into three groups satisfying (3.5). The last two factors are -rough, as in C2. The identity holds on all supported moduli, including repeated-prime multiplicities.
- (H3) Geometric packing and box data:
-
After dyadic localization, the scales and the test scale satisfy (3.6)–(3.7). On each box, the Heath–Brown coefficients factor as with (3.8). The smooth majorant has the form (3.9). Its center satisfies , where is a fixed source-class constant, uniform over all boxes, shells, tuple variables, and permitted . Its full doubled support satisfies (3.10). The selected integer interval satisfies LEN, including its strong length bound and integer endpoint convention. For this abstract dispersion estimate, assume modulus support in , with as in (3.12a).
- (H4) Moving frequency:
-
The frequency is the positive integer , with even, , and all original moduli are coprime to .
- (H5) Selected window:
-
The tested scale obeys (3.11), with all parameters fixed after is fixed.
- (H6) Source-wide remainders and boundary:
-
Let a source supply a logarithm-freezing estimate and boundary estimate for the full box family. After summing over all source labels, shells, boxes, and representation multiplicities, these estimates must give
with fixed and . This condition is used in the global summation, not in the local theorems below.
- (H7) Box-family coefficient bound:
-
The finite box family carries outer coefficients , coming from the source labels and the Heath–Brown identity. At fixed they satisfy (3.91): with a fixed . This condition is used only for the aggregate bound (3.92), not for the per-box estimates.
Write for the fixed source constants in (H1)–(H5), such as , and the implied constants in (3.8)–(3.11).
The Siegel–Walfisz bound (3.25) for the selected factor follows in §3.4 from the classical theorem [17, Corollary 5.29]. BFI [6] and Theorem 2.8, proved from classical inputs in §2.7, are theorem inputs, not source hypotheses. The source-wide boundary bound (3.24) is hypothesis (H6). It is used in the source estimates, not in the per-box theorem (3.13).
Put
| (3.12a) |
The number is the small-atom empty-prefix packing level of Proposition 4.2 in §4. The exponent is a support convention in the abstract dispersion estimate. The actual support level comes from the packing inequalities (3.6)–(3.7) after all Iwaniec factors are restored. In Theorem 1.2, (B.2)–(B.4) give with ; hence on every source shell for sufficiently large . The fixed exponent belongs to the abstract support hypothesis of the introductory source-box estimate. The variable ceiling in Theorem 1.2 controls the Iwaniec coefficient family as varies. At , , whereas . The introductory estimate applies to its stated abstract support class; the Iwaniec result at this endpoint uses the theorem below. Theorem 3.1 is the abstract dispersion estimate under the support and packing hypotheses in (H3), including the stronger support . Theorem 3.2 is the dispersion engine used for the actual source support. Theorem 1.2 in the application uses that engine together with the source estimates of Appendix B. At it gives the limiting ceiling for this specified signed mean value.
Theorem 3.1 (Dispersion estimate under the (H3) packing hypotheses).
(a) Assume (H1)–(H5). Then, for every fixed and every box ,
| (3.12b) |
where and is the exponent of (3.13). The implied constant and the threshold for are uniform in the box, the even integer , and all moving frequencies permitted by (H1)–(H5). They may depend on the fixed source bounds and on . They are ineffective, since the proof uses the Siegel–Walfisz theorem in (3.25). Under (H3) every supported modulus satisfies , so the truncation in (3.12b) is vacuous and its left side is .
(b) Assume in addition (H7). Fix and take in (a). Then the weighted sum over the box family satisfies (3.92), that is, . This bound is uniform in the scales of the boxes. For one has for large , so and . Part (b) holds for any fixed . The condition of Theorem 1.2 serves only the source-wide errors of (H6).
Under the support hypothesis in (H3), the theorem gives arbitrary logarithmic saving for these signed sums through , where .
Proof.
Theorem 3.2 (Dispersion theorem).
Assume (H1)–(H5), where in (H3) the support bound may be relaxed to . Thus each box satisfies (3.8)–(3.10) and LEN. Then, for each fixed ,
| (3.13) |
Here . It multiplies only power-saving terms. It enters only the final choice of . The exponent is fixed after the proof parameters. It is uniform in the box, each class in the random partition, the residue, and the moving shift. Constants and may depend on the fixed . All bounds are for fixed as . The implied constants and the threshold are ineffective, since the proof uses the Siegel–Walfisz theorem in (3.25). The estimate (3.13) is per box and does not use (H6) or (H7). If (H7) also holds and , then the weighted sum over the box family satisfies (3.92).
Hypotheses (H1)–(H5) give the coefficient, factor identity, packing, box, frequency and window conditions, including LEN and the integer endpoint convention. BFI [6, Theorem 0(a)] supplies (3.48), Theorem 2.8 of §2.7 supplies (3.14)–(3.15), and (3.25) supplies SW. The source-wide condition (H6) enters the source error terms, including (B.29) in the proof of Theorem 1.2 and the auxiliary bound (3.95). It is not used in the per-box Theorem 3.2. The box-family bound (H7) enters only (3.92). The spectral part gives a term (§3.9). It is absorbed in , since .
The dependencies have the following order:
The hypotheses are stated independently of any particular source. Appendix B verifies them for Theorem 1.2. Source comparison and the estimates for removed squareful terms are separate steps. Aggregate logarithm-freezing estimates enter in §3.10. Theorem 3.2 uses (H1)–(H5) and the stated theorem inputs.
The inputs are the following theorems, printed in Section 2. The Siegel–Walfisz theorem (SW) [17, Corollary 5.29] gives prime distribution in reduced progressions to moduli at most a fixed power of the logarithm. [6, Theorem 0(a), (2.2)], with [6, (A2)], gives the BDH quadratic estimate. It applies to sequences satisfying its norm-normalized SW condition. On the domain , Theorem 2.8 gives
| (3.14) | ||||
Here , where is the frequency bound of Theorem 2.8, and unless . The positive scales meet the endpoint conditions of Section 2. The bracket is
| (3.15) | ||||
Here is the dyadic-block slice of with . The slice satisfies . Since is supported on the present dyadic block, term by term. Hence (3.15) is exactly (2.42)–(2.43).
The smooth derivatives in (3.14) obey the variable-based hypothesis (2.39), with the exponent displayed there: each derivative is scaled by the corresponding positive argument itself. In particular, the initial interval is not treated as a dyadic block of scale . Theorem 2.8 is used in the form of Section 2, (2.38)–(2.43). It is proved in §2.7. Its spectral identity, including the continuous spectral measure, is exactly (2.14). The I-2 estimate (Lemma 3.5) also uses the composite-modulus Weil–Estermann bound [15, 16] in §3.11.
The sum in (3.13) is a signed modulus sum; triangle inequalities over source labels and boxes are applied outside it.
3.4. Elementary preparation, moments, and SW
Divisor moments. For integers ,
| (3.16) |
At , the first inequality is . The ratio of successive right/left quotients is at least 1. This holds since for , by convexity. The second inequality follows by summing over the factors. Also .
Suppose . Select a largest factor in a -factorization. Then
| (3.17) |
Let and . Split off prime factors larger than . Greedily group the rest into factors at most . There are at most groups. The large-prime part has at most prime factors with multiplicity. Hence
| (3.18) |
For , take . Put . If , the congruence has no solutions. Otherwise it has at most solutions on . Sum (3.18) and apply (3.16). For this gives
| (3.19) |
Write for the integer support of ; it is contained in an interval of length at most . Sum (3.19) with over . The -sum of is bounded by (3.17) and LEN. Since , the term is absorbed by . Thus
| (3.20) |
Here is an upper bound; the exponent already suffices.
For the prime source, Lemma B.3 takes as the lower endpoint of the selected cell. Under threshold (B.24), it proves (B.27), namely . In (3.17) take and . The integers in of (B.22) are exactly . The stated bound implies . The mesh uses the lower endpoint of the dyadic shell, which is a different scale. For the product source, LEN gives the lower length and the integer-interval convention. Thus (3.17) applies to , after increasing for each fixed . The same argument with treats intervals of length at least . It gives by elementary means; Shiu’s estimate [4] would also suffice.
Finite Heath–Brown identity [12]. For and ,
| (3.21) |
For the proof put . The series has no coefficients of index at most . Hence has none of index at most . Expand the cube and use . Let be the dyadic shell of the tested coordinate, and . Take . Then (3.21) applies, since . For the product source use for the shell of each coordinate. There are at most 24 variables. Roughness factors exactly over the product. The identity
| (3.22) |
has its proper-prime-power error bounded at source level in §3.10.
Logarithms and boundaries. On one short box replace each by its value at the box reference point. The pointwise error is per coordinate. To sum the discrepancy absolutely, use
| (3.23) |
The first term counts divisors of . The second uses . The unrestricted labelled coefficient is . The number of prime labels is fixed, and the small-prime part is disjoint from them. For the prime source, the pointwise majorant in Appendix B gives (3.23) with . The source-wide logarithm-freezing estimate is (B.18): . It is summed over tuples, each lying in one box, so its box-count factor is 1. Here the logarithm is , and its divisor-moment input is (B.17). The box width is expressed in . Fixed powers of and are comparable. For the product source, the corresponding aggregate bound is a source condition stated in §3.10.
Write . Consider the source cuts, the HB caps, and the monomial ordering and radial cuts of the product source. On each dyadic source shell, each boundary region has relative width in an active coordinate. Counting that coordinate first and summing the geometric shell scales gives a total of boundary indices, including the fixed divisor multiplicity. An active coordinate can be chosen among the positive-power factors, so the integer endpoint terms have a fixed power saving. For the prime source, Cauchy–Schwarz with this count and the source-wide second moment in (B.17) gives
| (3.24) |
For the prime source in Theorem 1.2, (3.24) holds with by the global estimate (B.19) in Appendix B. This verifies (H6) for that source.
The prime-source estimate is invoked under Theorem 1.2, whose residue range supplies . This lower bound is compatible with the local upper bound: when . The prime-source cut and give on the doubled support. Thus resonant boxes are empty and (3.10) holds.
SW for the selected factor. For every , subinterval , integer , and reduced class ,
| (3.25) |
Here and below the interval indicator is used only once. Let . After is chosen large, the trivial bound is . The elementary bound , or , suffices. Let and put . For sufficiently large , , so no selected integer has largest prime below . Integers divisible by , , contribute . Every other integer has a unique form , with , , and . For fixed , its coefficient is , , or . The last has bounded variation on the allowed prime interval. If , both relevant counts vanish, or the coprimality with removes the term. Otherwise . Apply prime SW and partial summation, uniformly at endpoints . The endpoint errors sum to , since and . Excluding costs at most . Endpoint subtraction handles arbitrary . This proves (3.25). All errors are absolute, of size . Only the classical Siegel–Walfisz theorem is used for primes. The proof is uniform for every . A nonzero selected coefficient has all prime factors at least . Raise the lower endpoint of the sum over the largest prime variable. Its SW bound is unchanged. If , the coefficient is zero.
3.5. First dispersion with restoration before CRT
Work first with the normalized convolution in (3.5). Split all three factors dyadically. Apply the triangle inequality before squaring. There are triples, including the outer factor. For one triple put
| (3.26) |
Since is -rough and at most , . The arbitrary small-prime factor of C1 remains in the outer , as the only smooth divisor. Let be a smooth nonnegative bump, equal to 1 on , supported on . Cauchy–Schwarz in gives
| (3.27) | ||||
Write , , and
| (3.28) |
Expanding the square gives , where
| (3.29) | ||||
Let be the tuple set. Let be its union of cross-copy gcd failures
| (3.30) |
and let . Set . On every tuple subset define the formal sums
| (3.31) | ||||
Restoration lemma. Choose in the order of §3.10. Then
| (3.32) |
| (3.33) | ||||
We first prove the positive estimates needed for CRT. For , let be the positive majorant. It replaces by and deletes coprimalities. Retain the two congruences for , one for . Let be the positive versions of (3.31). We write for the positive contribution of from the complement of defined in (3.37).
The total-variation progression estimate is
| (3.34) |
Compare to its cell average on . Bound the difference by the cell variation, and sum. Möbius expansion of the coprimality then gives .
From we get
| (3.35) |
For the weight is bounded by , since . For it is . These two shapes prove
| (3.36) |
For the first failure of (3.30), fix . Choose one of its at most primes . Count in multiples of . The first shape gives . For the weight of , . So the extra congruence gives a class modulo , with choices. For a common prime of , fix . Sum the -divisible weight using (3.35). For , fix and do the same weighted sum. For , fix . Then count in multiples of , or modulo for the weight of . For , use the last estimate of (3.35). This covers all five failures, and gives (3.36).
Split the unrestricted -sum at
| (3.37) |
The complement is estimated on all tuples, coprime or not. Put and . The exceptional indicator is at most . The two divisor choices cost at most . There are also at most choices for . The resulting weight is , of degree five. To keep the progression restriction while counting, split into and . On the first part . For each fixed , sum over the at most divisors first. The condition and implies . Thus forces . There are at most such , by (3.6). This bounds the first part by . Exchanging the two copies gives the same bound for the second part. Consequently
| (3.38) |
The factor from and the factor from the two parts are absorbed in the implied constant.
For a modulus-related failure, fix . The number of with is . A common prime comes from , , or . It forces into one class modulo . For use . For use . For use . If , then gives the class directly. If only, exchange the copies. There are candidate primes and choices in each class. There are at most remaining choices of . Hence
| (3.39) |
For on , there are at most pairs . There are at most primes , . There are at most choices for . There are at most choices for . Thus
| (3.40) |
On the near-diagonal the same count replaces by . The density shapes and (3.35) give the same or smaller bound. Therefore
| (3.41) | ||||
Use the common constants from §3.10: and . They satisfy and . To check this, divide by the last term of (3.33). After this division, the right side of (3.41) is at most
Here LEN supplies , while (3.6) supplies . The chosen makes the first logarithmic exponent negative; the second term tends to zero for fixed . The same target absorbs (3.38), since . This removes bad tuples and the near-diagonal from all of before their main terms are compared.
Now use CRT on . Let . The two congruences have one class modulo precisely when and . To see this, equate and modulo . On , and are pairwise coprime.
Fixed cutoff. On the smoothed support put
| (3.42) |
These are fixed for the entire shell triple. Poisson gives exactly
| (3.43) | ||||
Put . This is the Poisson prefactor of one progression sum. In (3.43) it appears as the factor in front of and the factor inside . Integration by parts gives .
Here one may take . It is independent of the box and the tuple. The integer is fixed once is fixed. Choose after these seminorms and all fixed coefficient parameters. So the tail bound is uniform over the whole box family. If , then , since .
The tail of one progression sum is at most if , and at most otherwise. In either case it is , since . Take . After increasing , the weighted tail per tuple is at most . There are at most tuples. This proves (3.43). The cap (3.42) is the same for all tuples. So it survives the Mellin separation of the inner variable below.
On , (3.34) gives
| (3.44) |
For , retain . Möbius expansion over gives one class modulo , so
| (3.45) |
Divide by . The main term is again . The summed error is . It is absorbed using . Exchanging the two copies shows that is real. Complete and formally to , with errors bounded by (3.36), (3.41). This proves (3.32). CRT and the zero-mode identity are used on only.
3.6. Main-term cancellation and the full GR error
Put and
| (3.46) |
Expanding the product of these two centered counts gives exactly
| (3.47) | ||||
For the norm-normalized condition [6, (A2)], apply (3.25) to , with . If , the elementary estimate
| (3.48) |
suffices, since is absorbed by the factor . If , then . Then (3.25) with exponent implies [6, (A2)]. The condition implies the condition of [6, Theorem 0(a)] eventually, which then gives (3.48) in this case too. Apply in (3.47), and sum the reciprocal weights. This gives
| (3.49) |
Take . Increase it by a fixed constant to absorb any endpoint logarithm. Combine (3.27), (3.32), (3.33), (3.49), with . For a requested local precision , set before choosing as in §3.10. The resulting restoration contributions to are at most
| (3.50) |
Both terms in braces are kept. Their power savings are at least and , respectively. Each exceeds , and beats every logarithm. More explicitly, for fixed and sufficiently large , , because beats every fixed logarithm. Thus this term joins the first term in (3.51), rather than the fixed-power-saving term. The separate term in (3.50) has saving , by in (3.6), and is therefore absorbed in the displayed power-saving term. Increase after the fixed exponents. This gives
| (3.51) |
This completes the first dispersion. A later saving for changes only the middle term.
3.7. Reciprocity, the complete mask, and the second square
Split the combined products again as , where . The remaining support is
| (3.52) |
Solving the two CRT congruences and using for gives
| (3.53) |
All inverses exist by (3.52). Put . Then the outer tuple determines . The modular phase becomes
| (3.54) |
Split by sign and dyadic intervals , starting at . Split by sign and intervals , starting at . These disjoint intervals include exactly once. Write for the signs of and . The cap on the last, shortened -block depends on alone. Always .
The nonmodular factor is exactly
| (3.55) |
Its dependence on is only through . For , choose a fixed smooth cutoff. It equals 1 there and is supported in . Rewrite (3.55):
| (3.56) |
Since ,
| (3.57) |
Mellin inversion separates the ratio. Put . The zeroth and second logarithmic derivative estimates give
| (3.58) |
If , divide the outer coefficient by . The norm bounds below are for this normalized coefficient. The factor is restored before the -integration. If , the integrand is zero. So the integrable decay of is kept.
The full inner coprimality mask is
| (3.59) |
The second condition combines and . To separate the second, split at random. Each prime goes independently and uniformly into one of two classes . For an integer , let and . If all prime factors of lie in , then exactly
| (3.60) |
A common prime makes the event impossible. Otherwise the event has probability . Every prime of a supported lies in . So depends only on the primes of in . Since and , one may take
| (3.61) |
Replace the inner coefficient by and each outer representation coefficient by . Both multipliers have modulus at most 1. The original sum is . This factor is , and is an average. Fix before aggregating representations. The partition acts on and only, so (3.25) for holds for each .
Set , and
| (3.62) |
where , and on the chosen signed block. Both are 1-bounded. Dyadically localize . The outer support has . So the nonnegative majorant
| (3.63) |
equals 1 on it. Cauchy–Schwarz now gives
| (3.64) |
Fix . Factor ; then is determined. So there are at most outer representations. For fixed the permitted have divisor multiplicity. So there are representations in total. A normalized representation coefficient has modulus . Summing over representations with Cauchy–Schwarz,
| (3.65) |
This bound holds for the coefficients of each class .
Expanding , put
| (3.66) |
The terms with have at most choices of . To see this, write , , and . Sum over their ranges. Thus
| (3.67) |
where the final inequality is . For , split , , and into . The coefficient independent of is
| (3.68) |
Put . By (3.70), . So the coefficient is supported on . The off-diagonal sum is exactly
| (3.69) |
3.8. The W-prime norm, with endpoints
For , , , and , let
| (3.70) | ||||
For every nonzero integer , define its -supported part by . In particular . Set
| (3.71) |
where the maximum is over . Then
| (3.72) |
Proof. For fixed , let . Each has at most choices of . Therefore Cauchy–Schwarz and reduce the left side to
| (3.73) |
For the last inequality, majorize by . Then sum . It holds for every .
Put , , . A fibre of has at most points. It has at most one when . Expand
| (3.74) |
Here is multiplicative with ; the prime-power formula is for .
If counts with , then
| (3.75) |
For the first sum write , primitive, . There are at most choices of , and . The congruence is , . Since , a contributing primitive vector has . The case forces . There are at most choices for , then for . By , this proves
| (3.76) |
For the second sum . At most nonzero levels of are divisible by . Each has at most points. Thus . For each , sum the at most pairs. Use the exact inequality
| (3.77) |
So before the -sum, the second term of (3.75) is at most , using . Finally
| (3.78) | ||||
The last contribution of (3.76) is at most , since . This proves (3.72), also for real nonintegral .
Uniformly for , elementary prime ordering gives
| (3.79) |
For we have . The bound for the products then follows from . The divisor bound is elementary.
To apply (3.72) to (3.68), use the cap . Empty blocks have zero coefficient. Increase in (3.6)–(3.7). Then
| (3.80) |
The strict power margin in (3.6)–(3.7) absorbs the fixed logarithmic factor and the factor 40. For this gives . If the middle factor is supported at , set . Then , every nonzero-frequency block is empty, and . Thus Theorem 2.8 is needed only for ; in that case a nonempty block has . Each summand of (3.68) has modulus at most 1, so . Since , exactly. Thus
| (3.81) |
The second estimate is the same proof with . Here , as (3.72) requires; the case was treated above. If is supported at , take . If is supported at , it is a fixed coordinate. If the full modulus is 1, the discrepancy is identically zero.
3.9. Application of Theorem 2.8 and the spectral budget
For nonzero (3.69), set
| (3.82) | ||||
Let the Theorem 2.8 coefficient equal at these indices and zero elsewhere. The support conditions give exactly
| (3.83) |
Here comes from . The conditions on come from their roughness. The smoothed variable may be divisible by . Reducing the inverse modulo gives the exact phase identity
| (3.84) |
We make the dyadic support of the smooth weight explicit. Choose a fixed smooth step . It is zero on and one on . Split
| (3.85) | ||||
They sum to . They lie in the strict dyadic windows , , . Expanding the bumps gives nine weights. Multiply by fixed smooth cutoffs equal to 1 on the supported indices. At the lower endpoint use a cutoff zero below and one above 1. Its derivatives are . Each weight satisfies the Theorem 2.8 derivative conditions with . Take , . Thus (3.14), exactly as stated, applies to (3.69).
We bound the four terms of its bracket. Put
| (3.86) |
Since , all powers of in (3.15) are nonnegative. First replace them monotonically by . Then , and . Apply (3.81). Suppress only uniform and -powers. This gives
| (3.87) |
We check the regular third term directly. Up to -powers, its bracket before the coefficient norm is
| (3.88) | ||||
The factor here is ; the factor would lose . The bound is applied after passing to the envelopes. The first term is at most times the weighted norm. The second uses . The fourth uses . Substitute . This proves the other lines of (3.87).
The four packing inequalities (3.7) bound the exponents in (3.87) by . The cutoff contributes at most to . The product in (3.14) is eventually at most . This follows from and the sharper bound. The bounds on and use only . This comes from the full-modulus support in (H3), since the full modulus has scale ; dyadic constants are absorbed after enlarging . So the smoothness prefactor costs at most in the exponent.
Before the cutoff loss, the exponents relative to (from the square-root row on, relative to ), in units of , are
| (3.89) |
The Mellin allowance follows from (3.57). Any fixed logarithmic power is eventually at most . The remaining subpolynomial factors are the finitely many localizations, the divisor representation counts in (3.65), (3.71), the prime products (3.79), and powers of . Their product is uniformly . So it is at most after choosing . The multiplier from the random partition is a fixed -dependent constant. By (3.58), (3.64), (3.65), (3.89),
| (3.90) |
since . For , (see above). Inserting (3.90) in (3.51) gives a spectral contribution , since . As , it is absorbed in .
For a target , use on every shell triple, uniformly before summing. The triangle inequality over triples costs the logarithm of the outer modulus and the two logarithms of the other factors. Finally restore the factor of (3.5). It is . Equations (3.51), (3.90) prove Theorem 3.2.
3.10. Global summation, prime powers, and normalization
At fixed , assume (H7): the box family has the source and Heath–Brown coefficient bound
| (3.91) |
Source-wide error bounds. Assume the source’s aggregate logarithm-freezing bound and the boundary bound (3.24). With the exponents and of (H6), a sufficient pair of raw bounds is
They include all source labels and representation multiplicities. These bounds are separate from the interior-box hypotheses (H1)–(H5). The source-wide estimates enter through (B.29) for the prime source and through the auxiliary bound (3.95). They are not hypotheses of Theorem 3.2.
The source labels and prefix cells are . There are at most 24 HB variables. Hence there are dyadic tuples, and each dyadic tuple contains short boxes. The product shells number . The total count is . Since the coefficients are , (3.91) holds with ; the count exponent is smaller. The three factor localizations are inside (3.13). The count includes every partition.
Choose parameters in the following order. Fix and the source combinatorics. For Theorem 1.2, through (3.92) and (B.29), use the requested exponent and choose ; then set and . This is the parameter convention used in Theorem 1.2 and Theorem 1.1.
For the stronger source-wide bookkeeping in (3.95), which is outside Theorem 3.2, fix a separate final exponent and put . Choose the box width with
so that the boundary and logarithm-freezing errors are . For the Iwaniec source, by (B.19) and the logarithm-freezing exponent is by (B.18); since , the condition is the integer choice . Set and . The value of is at the maximal count in (3.91). Let dominate and every preliminary logarithmic loss denoted by . This includes the fixed loss in (3.41) and the endpoint losses before BFI. It is chosen before . Use the same for every source and every application below. Choose
Then choose and the required BFI/SW exponents. Later power-saving logarithmic losses may depend on . The constant is defined before them. Choose last. It is ineffective, as are the implied constants, because the Siegel–Walfisz theorem is ineffective.
The source may choose a larger width. Its fixed width is selected before the analytic precisions, with the same displayed formulas.
By (3.13), (H7) in the form (3.91), and ,
| (3.92) | ||||
Every positive fixed power saving beats every fixed logarithm once is chosen. The spectral term is already absorbed in (3.13), since .
Source prime powers. For the direct source the correction in (3.22) has integers before discrepancy weights. For the product source assume at most four tested coordinates, each at least , , and product . A proper power coordinate has reciprocal mass
| (3.93) |
For compare with the tail of . For sum the integer -power tail. There are possible exponents. Fix one coordinate at . For , the remaining positive coordinates have at most possibilities. For no coordinate remains, and the single admissible completion is bounded by . For the remaining coordinate is counted directly. For the reciprocal-sum argument gives the displayed logarithmic power. Take a union bound over the at most four possible power coordinates. For the product discrepancy write for the tested product. Theorem 1.2 supplies . On the product support, , so . Use (3.23) and with . Then the whole source-level correction obeys
| (3.94) |
This bound precedes the Heath–Brown subdivision, so its box multiplicity is 1. For a product, the bound uses the coordinate floor assumed immediately before (3.93). Thus (3.94) applies to every such product source.
The bounds (H6), the logarithm-freezing estimate, (3.92) (which uses (H7)), and (3.94), with the fixed choices above, give
| (3.95) | ||||
The ratio is .
For each source family, its exact source identities give the finite sum to which these bounds apply. The restoration, BFI, partition, Poisson and Theorem 2.8 errors enter once, inside .
For any normalization , (3.92) reads explicitly
| (3.96) | ||||
Consider the original direct prime source, before HB. Its mass is not yet replaced by a logarithmic-integral (Li) mass. Its exact prime mass satisfies
| (3.97) |
because for and sufficiently large . Thus the formal and natural comparators coincide on that original source. This holds for the source itself, before the split into signed HB terms. If a Li mass is substituted, the exact difference is . Its weighted sum enters once, in the main-term mass contribution, outside the natural-comparator correction. For the composite product source, (3.97) may fail.
3.11. The complete non-II cover
These results are separate from Theorem 3.2. The source-to-box identity comes from the source itself. For a direct shell , assume the following source conditions (SH1)–(SH5).
-
(SH1)
The coefficient is independent of tested variables, , , , , and on its support.
-
(SH2)
All tested restrictions are constant on each nonboundary box. 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.
Put and . Increase until . Let be the lower HB scales, and . Then (3.21) implies
| (3.98) |
There are at most six variables. Call a variable small below , and large above . Suppose no variable is in the II window. Since , some variable is large. Since , at most two are large. Möbius variables are never large. Thus there are exactly one or two large smooth variables. For a window variable,
| (3.99) |
which proves the shell-local window transfer. For one large variable,
| (3.100) |
hence its scale . With two large variables, . The at most four other factors are small. Their product is split dyadically, , with
| (3.101) |
These follow from , which uses , and . Consider a product source with three or four coordinates at least . Its smallest coordinate has exponent between and . It has at most six HB factors. One of them has exponent exceeding . Each is below . Thus, after proper prime powers and boundary boxes are removed, all its boxes are of type II.
Elementary sieve sandwich. For a finite prime set below , let , , and
| (3.102) |
Let . For , Pascal’s identity gives . The sum is 1 for . Hence
| (3.103) |
The weights are 1-bounded and supported on . Also . Let , and choose . Mertens’ bound , with , gives for large . With Stirling,
| (3.104) |
It is the sieve approximation used in I-1 and I-2.
Lemma 3.3 (Type I, one large variable (I-1)).
Assume (SH1)–(SH5). Consider a box with one large variable. Let the complementary coefficient satisfy . Uniformly for every integer residue coprime to each supported ,
| (3.105) |
Proof.
If , the summand vanishes. Otherwise put . The progression and the reduced comparator contain only integers prime to . Apply (3.102)–(3.104) to the -dependent set , with . For every , , and
| (3.106) |
After comparator normalization, the upper and lower sandwiches have the same main term. Their gap gives discrepancy , where . Endpoint subtraction and partial summation cost . By (3.100), . Thus the inner discrepancy is . Sum with , , and . Then request a larger . This proves (3.105). The sieve weights use the prime set . ∎
Lemma 3.4 (Completed hyperbola).
Let be a unit. For integer intervals , put
| (3.107) |
The full-modulus Kloosterman-sum bound [17, Corollary 11.12],
| (3.108) |
implies, uniformly in interval lengths and positions,
| (3.109) |
Proof.
Put
Additive completion then gives
The bracket vanishes if or , so complete periods cancel. For , , and
| (3.110) |
Use in (3.108) and sum . For the principal part use , so its one-variable weighted sum is . This proves (3.109). Modulo 1 the discrepancy is zero. ∎
Lemma 3.5 (Type I, two large variables (I-2)).
Assume (SH1)–(SH5) and (3.101). Consider two large smooth variables with nonnegative weights . Let . Uniformly for every integer residue coprime to each supported ,
| (3.111) | ||||
The smooth factor weights in the prime-source application of Appendix B are nonnegative. For a general real weight, write , with , and apply the lemma to the nonnegative pieces.
Proof of Lemma 3.5.
Again restrict to . Let and be the positive congruence and comparator functionals with the positive weights . Put . Apply (3.103) to all primes below , with , . Include the Brun–Bonferroni threshold for this smaller level in . For every fixed logarithmic exponent , put
and require . At fixed this holds eventually, since and . Hence , , and
Choose after the fixed logarithmic losses in (3.115). So the same final choice of covers the use of (3.103)–(3.104) in I-2. Write , . Since ,
| (3.112) |
Since are positive,
| (3.113) | ||||
The lower weights may be negative. The bound (3.113) contains only the nonnegative . Expand the first three terms over . Their coefficients are bounded by 1. Terms with vanish. Otherwise put . This is a unit, and lies on the modular hyperbola . Two-variable partial summation and (3.109) give a total .
For the two main gaps, positivity lets us drop the restriction . Full-integer progression counts and (3.104) give
| (3.114) |
The progression counts range over all integers. Summing over now gives
| (3.115) |
By (3.101), the first exponent is less than for a sufficiently small fixed . Also . So the exponents of the last gap terms are less than 0.668. Choose after the fixed log losses. This proves (3.111). Squareful moduli are covered by (3.108). ∎
Finally there are non-II direct boxes and shell pieces for a fixed . Request (3.105), (3.111) with exponents larger than . Their sum is then ; in particular, divided by it tends to zero. For the prime source these are the exponents of Appendix B. The I-1 and I-2 boxes are disjoint parts of the non-II contribution. Under its coordinate hypotheses, the product source has none. Their contributions lie outside .
4. Three-slot packing for Iwaniec’s remainder coefficients
This section proves a general packing theorem. It then verifies the hypotheses for the remainder coefficients of Iwaniec’s linear sieve [10, Theorem 4]. The packing and coefficient identities provide the modulus factorization used in the prime-discrepancy estimates below. The functions below specialize Lichtman’s optimization [1, Proposition 6.1, (6.2), (6.4)] to spectral exponent and moving-residue exponent . We prove the labelled-atom statement here; its two-bin step is related to the corrected argument in Pascadi’s Lemma 5.6 [8].
4.1. A combinatorial packing theorem
Put
Here is the fixed spectral exponent . Later in this section denotes the sieve level. For , define
For real and , put . Also put
For an ordered triple , set
Define if . If , put . For a finite non-increasing list , let for and for . Repeated values are distinct labelled atoms. The empty list is allowed.
A list satisfies if
| (4.1) |
Write
Theorem 4.1 (three-slot packing). Let , , , and . Suppose the labelled list satisfies
| (4.2) |
Then the deterministic rule below partitions the labels into . If , then
| (4.3) | ||||
The output depends only on the labelled list and on .
Lemma 4.2. For , . Thus is concave, , and .
Proof. Consider the middle affine function in the definition of . Its difference with is , which is nonnegative for . Its difference with is , nonnegative for . As , it is never the strict minimum of all three. The minimum of the remaining two affine functions is concave and has maximum . Each is zero or at most . Every branch is zero or a value of . This proves both upper bounds.
Lemma 4.3. For and :
-
(1)
for exactly when .
-
(2)
, and .
-
(3)
and .
-
(4)
and .
-
(5)
and .
Proof. The three affine branches of give , , and . These are closed inequalities. The difference decreases with and at is , proving (2). The formulas in (3) and the first bound in (4) follow by expansion. Their minima occur at . For the second bound in (4), use and . For (5), use , , and . Finally .
Lemma 4.4. If and , then .
Proof. Since , the activation in is on. Hence and . These give and , respectively.
Lemma 4.5 (two bins). Let and initial loads , . Suppose a finite list satisfies
| (4.4) |
Process the atoms in order. Place each in bin 1 if it fits, and otherwise in bin 3 if it fits. Every atom is placed, and the final loads are at most .
Proof. Suppose is the first atom fitting neither bin. Then the current loads satisfy , , and . Adding the last two inequalities contradicts (4.4).
The rule permits zero atoms and repeated values. Its three cases are:
-
(1)
If , apply Lemma 4.1 to the whole list. Use bin caps for slots 1 and 2, and leave slot 3 empty.
-
(2)
If , test in order . Put and . Call legal if and the remaining atoms, in their original order, satisfy . For the first legal , place in slot 2. Apply Lemma 4.1 to the rest in slots 1 and 3, with caps .
-
(3)
If no is legal, use caps for slots 1, 2, 3. Put atom 1 in slot 2 if it exists. Process subsequent atoms in order, placing each in the first slot in which it fits. Put the first atom fitting no slot in slot 2. Call the resulting slot-2 load . Apply Lemma 4.1 to the remaining atoms in slots 1 and 3, with caps .
Proof of Theorem 4.1. Write for the rule just defined. Since , ; also . It is enough to prove one of the following envelopes:
The second, third, and fourth left sides in (4.3) have nonnegative load coefficients. Under , Lemma 4.1(5) gives
For the fourth load, similarly,
Here . Under , use in the two expressions whose coefficient of is negative. This gives
The first line uses . In both envelopes , proving the first inequality of (4.3). Equality at the case boundary belongs to case 1; all displayed endpoint inequalities are weak.
Consider case 1. The clause of (4.2) is exactly the hypothesis (4.4) for the whole list. Here and the total cap is . Lemma 4.1 gives . Now suppose . If a tested set is legal, the remaining list satisfies (4.4) with total cap . Lemma 4.1 then gives .
We verify the rule when no tested set is legal. Two deletion facts will be used. First let be a leading set . Subtract from every later inequality in . This proves for the remaining list. Next let be , , or, when , the truncation of . Let . The only unselected atom among the first three has index or . If it is below , it is first in the remaining list, and
by Lemma 4.1(4). When this is the whole remaining list. Now take a remaining rank at least four. Its original prefix sum contains both selected atoms. Subtracting proves the reduced mask. Thus the nonconsecutive set is legal whenever these conditions hold.
Assume now that no tested set is legal. First, . Otherwise the definition of and (4.2) give . Then by Lemma 4.1(1), and is legal. The same lemma and show ; otherwise is legal. Hence every padded coordinate is below . Since , the branch condition gives . A branch in its maximum is at least . Neither nor can be that branch. Each would put the corresponding coordinate at least . A branch or would make a leading set legal. If
then , and . The only unselected atom among the first three is . So the deletion fact makes legal, a contradiction. The other branch similarly makes legal. Therefore either or . Lemma 4.1 gives, respectively,
| (4.5) |
In case 3, the slot-3 cap is
Thus all three caps are nonnegative. Atom 1 fits slot 2 because . In the first case, atom 2 cannot be a stopping atom. Slots 1 and 3 are empty. If fit neither, then by Lemma 4.1(4), contrary to . Thus any stopping atom has index and . In the second case, a stopping atom has and . If there is no stop, the final loads are bounded by . This is , also when .
If the stop is at , let be the loads before . After placing in slot 2, its load satisfies
The lower bound holds because did not fit slot 2. The upper bound follows from (4.5). The -th inequality in gives . Since did not fit slot 1, , so . For every later rank, the original mask is exactly the two-bin condition with total cap . Lemma 4.1 completes the assignment and gives . The rule processes every atom once and has fixed tie priorities, so it is well defined. All cases imply (4.3).
4.2. A local ceiling and a small-atom criterion
In this subsection write for the exponent in the unramified Ramanujan bound and . The Kim–Sarnak bound [13] gives and .
Proposition 4.6 (local ceiling and small-atom packing). Suppose , that is , and . Let satisfy the zero-loss local slot constraints
and . Then their maximum total load is
For fixed , equality holds precisely at , , .
Suppose instead that with . Let the non-increasing labelled atoms obey , with
Then they admit a three-slot partition with the four load inequalities (4.3). Here replaces . In particular, and .
Proof. Seven times , three times , and once give . Equality forces equality in these three constraints, giving the stated point. Conversely, that point has , , and total load plus at most . Substitution in the fourth constraint gives , proving the maximum and its equality cases.
For the small-atom assertion put
The denominators are positive, and direct subtraction gives
Hence is equivalent to
The second upper bound exceeds the first by . So the assumed bound on gives . Start with capacities . They are nonnegative, since the last is at least . Place atoms in order in the first slot in which they fit. If all fit, take . Otherwise, put the first failed atom in slot 2. Let be the new slot-2 load. Its failure there and give . Let be the previous loads. Then gives . Failure in slot 1 gives . For each later atom, subtract the fixed slot-2 load from its original inequality. Lemma 4.1 places the remaining atoms in slots 1 and 3 with capacities . Both cases reach
The last three left sides of (4.3), with in place of , are at most
respectively. This proves the partition claim.
These are a relaxed local spectral ceiling and a sufficient uniform small-atom packing criterion. The actual local inequalities have positive losses, so the relaxed ceiling is a supremum. For example, take the losses , , and in the first three slot constraints. They give
when the moving-frequency factor is . The small-atom bound also needs strict room in an actual source. If and , then . The next subsection applies this criterion to the structured coefficient family of Iwaniec’s construction.
4.3. Endpoint geometry for Iwaniec’s coefficients
Fix the parameters in Theorem 1.2 and put
| (4.6) |
Proposition 4.2 gives the sufficient packing threshold . The relaxed local ceiling is . The fixed support exponent for these coefficients is , and because . The margin leaves room for the smooth divisor and tail-prime ranges. Since the theorem also imposes , every nonempty tail has the required roughness floor. Lemma 4.3 verifies and the hypotheses of Theorem 4.1. Let , , and . Write and . Fix an Iwaniec sign. Write for its finite family of nonempty label vectors . They have , grid coordinates in , and the cubic conditions
| (4.7) |
The prime labels in a vector range over , with . A vector with an empty coordinate interval contributes zero and may be omitted.
Lemma 4.7 (Iwaniec coefficient packing). For every contributing vector and every , let , sorted in non-increasing order. Then holds and
| (4.8) |
Consequently Theorem 4.1 partitions the tail labels into three slots. Assign the Iwaniec smooth divisor to slot 1. Let be the resulting lower dyadic slot scales. Then
| (4.9) | ||||
where and for .
Proof. Put . The grid lower bound gives . The cubic conditions in (4.7) imply for every rank . At a cubic rank this follows by dropping one nonnegative copy of . At an intermediate rank,
using and the cubic condition at rank . For the first rank in the minus case use , which follows from . Thus . Also , so . For this range, the branch is active. Its activation threshold is at most , while
Each branch in the minimum decreases with its argument, and . Take . Each other affine branch minus is nonnegative at both endpoints. Hence it is nonnegative on the whole interval. In particular, the minimum defining is at least , so its activation condition holds. Thus . Next, , because and . Therefore
Also . The range for gives . Theorem 4.1 applies.
The smooth-only term is the empty-list case. Here , since the branch equals and its activation threshold is . Thus Theorem 4.1 applies to the empty list as well. The smooth divisor remains in slot 1, and slots 2 and 3 are units.
For the scale bounds, the slot-1 smooth divisor contributes at most to the logarithmic load. The other slot loads are bounded by . Thus
The first line of (4.3) gives
The second gives
For the third scale, (4.3) gives
For the fourth, it gives
The exact constants in (4.9) hold for the lower scales. We round each of the three aggregate slot scales once, to a dyadic representative within a factor two. Each monomial below has total degree at most in . So rounding multiplies it by at most . Individual prime labels are not rounded. This adds at most to its base- exponent. Fix . For sufficiently large , each positive margin absorbs this cost. The tightest margin, for , is .
For fixed and , put . Then , so eventually . The first exponent in (4.9), after dividing by , is negative. So conversion from base to base improves that relative inequality. Each other exponent is at most ; conversion costs at most . The displayed margins absorb this cost.
For every contributing vector, the last-rank mask gives . Since each , it also gives . Thus , and gives
where . All prime factors avoid . Thus the full coefficient is supported on with . Its coefficients are . The -smooth part of a supported modulus determines . The remaining labelled prime assignments number at most , and . For each sign the Iwaniec family has fewer than vectors. So the sum over vectors keeps a bound depending only on . The smooth-only term satisfies the same support and coefficient bounds.
The cubic-to-quadratic implication just proved is uniform in the vector length. We record the two bounds obtained above:
| (4.10) |
These bounds also control the coefficient regrouping below.
4.4. Three-slot coefficient identity
Fix a sign and a vector . The set of equal-label pairs in the Iwaniec grid is . Distinct grid labels have disjoint half-open prime intervals . Adjacent grid values differ by the power . Thus repeated primes can occur only in . Define
For the Iwaniec coefficients , define the unrestricted coefficient
| (4.11) |
The masked coefficient is defined by inserting in the inner sum. The coefficient of the smooth-only term, the sole empty-tail term in the Iwaniec formula, is . Thus the full signed coefficient is
| (4.12) |
Lemma 4.8 (slot factorization and collision support). Fix in the range of Lemma 4.3 and let be its packing partition. All and sums below use the ranges in (4.11). Define
For set when is empty; always retains the smooth-divisor sum. Then
| (4.13) |
and . Consider the full Iwaniec family. The difference between the masked and unrestricted coefficients has pointwise size . It is supported on moduli divisible by for some prime .
Proof. A labelled tuple splits uniquely into its three slot tuples. Multiplying the three normalized finite sum definitions by therefore gives (4.13). This regroups a finite sum and allows repeated primes. Fix a product . Its prime factors below determine uniquely: , and every tail prime is at least . Once is fixed, the labelled prime assignments within a slot number at most . The Iwaniec bounds give ; the same argument applies to . The smooth-only term has the corresponding bound from . Since , the scalar is .
Suppose the distinctness mask removes a tuple. Then some selected pair has , and its modulus is divisible by . For fixed , (4.10) bounds the number of labels. The Iwaniec family has fewer than vectors for each sign. The number of labelled assignments to a fixed modulus is at most . Hence the aggregate coefficient difference is .
The prime-source cost of this collision support is estimated in (B.5)–(B.6).
The smooth-only term is already a one-slot coefficient. Take , put , and . Its coefficient identity and pointwise bound follow directly. The full coefficient in (4.12) is the sum of this term and the vector terms above. Every partition is fixed before the prime realizations are summed.
This section proves the packing inequalities and the slot identity for the unrestricted coefficient. It also gives the collision support needed in Appendix B. The prime-source estimate is proved there.
5. Application to Iwaniec’s remainder weights
The source is the prime interval from Theorem 1.2. The residue satisfies and is coprime to every supported modulus. The saving is for each fixed .
5.1. Iwaniec’s remainder coefficients
All parameters are those in Theorem 1.2; in particular . Let be even. Let be the set of primes not dividing , and write
Use the grid in (2.28). The admissible vector sets are those in (2.29). The parameter substitution is (2.33a)–(2.33b), with and . The distinctness set is , the equal-label tail-position pairs. For a vector define
Let and be the coefficients of Iwaniec [10, Theorem 4]. Take and parameters at the cutoff . The proof uses only their bound and their support. It never compares coefficient values at different cutoffs. The labelled-tail cutoff of C1 in Section 3, used in (H1), is . Since , this satisfies . The smooth divisor has and . Every tail interval starts at . The exact structured remainder coefficients are
| (W) |
In particular, selects one of the two signed remainders. Each is the full remainder, not an arbitrary well-factorable sequence. Formula (W) includes the smooth-only term. Every prime-tuple term keeps its smooth divisor. The smooth-only term retains its divisor when there is no tail. The estimate below applies separately to either signed remainder. When the directed lower-sieve inequality of Iwaniec [10, Theorem 4] is used, it takes .
5.2. Proof of the interior signed mean value
Proof of Theorem 1.2.
The support and coefficient bounds in the theorem are proved in (B.2), using Iwaniec’s cubic label conditions for every vector in (W). In particular, with ,
including the smooth-only term. The choice gives the strict second inequality. Take the source of (B.1). By (B.3), for every source prime and every supported modulus . The coprimality is assumed. So the natural comparator in (B.1) is exactly , and
Before applying the dispersion theorem, (B.5)–(B.6) replace by , where has the distinctness masks removed. By the hypothesis on the support of , the difference is a collision contribution. By (B.5), its complete signed discrepancy is . The coprimality projection factors across the three slots in (4.13), as shown after (B.6); this includes the smooth-only term. Thus the retained coefficient has the exact slot form (3.5). All its moduli are coprime to . Appendix B extends the support envelope of (B.2) to and . For each source scale , (B.3) then places this entire retained support below . The residue bound gives . Hence C4 holds with . This includes for large . On the doubled complementary support, (B.28) gives . It uses and the upper source cut. Since and there, also for large . These are both parts of the nonresonance condition (3.10).
After the collision projection, the prime-power contribution is (B.8). The logarithm-freezing error is (B.18). The source-boundary error is (B.19). Lemma B.3 proves the selected-interval lengths and integer endpoint convention in (B.22)–(B.27). Lemma 4.3 supplies the slot inequalities, while (B.20)–(B.21) classify every retained box. The internal Type-I and Type-II bounds, including the box and arithmetic costs, give (B.31). The integer choice makes the logarithm-freezing and boundary errors in (B.18)–(B.19) . The aggregate exponent here is the theorem convention; the separate bookkeeping used for (3.95) requires and is outside Theorem 3.2. and absorb the box count. Appendix B verifies the box-family bound (H7), that is (3.91) with . The aggregate form of Theorem 3.2, namely (3.92), bounds the Type-II boxes. For each fixed admissible , the mask and proper-power terms have fixed power savings. Proposition B.4 combines these terms over the complete support of (W). This gives the assertion for each fixed in the stated ranges. ∎
5.3. Proof of the logarithmic-integral comparator
Appendix A Source checks
The source input used for the coefficients in formula (W) is [10, Theorem 4]. Its hypotheses are [10, (1)–(2)]. Its upper inequality permits ; its lower inequality permits . Fix and as in Theorem 1.2. Then and satisfy . Thus both ranges apply for all sufficiently large . The choice also gives . The mesh is and . The smooth-prime cutoff is , as in (2.28)–(2.33b).
Theorem 4’s printed argument list of contains the mesh parameter and box tuple. It contains neither the sequence nor the cutoff. The construction in [10, (23)–(26)] collects universal Rosser and fundamental-lemma coefficients. The sequence enters through . At each cutoff , we use the coefficients and prime-tuple support supplied by that construction. The coefficient family is independent of the sequence. It may depend on . The signed prime-source estimate is proved separately in Appendix B.
The -constant in the main-term error of [10, Theorem 4] is not given numerically.
The proof of Theorem 1.2 uses no finite computation.
Appendix B Prime-source estimate for Iwaniec’s remainder weights
This section proves the source estimate used in Section 5. Equations (B.2)–(B.6) control the coefficients and distinctness masks. Equations (B.7)–(B.19) treat prime detection, logarithm freezing and boundary boxes. Equations (B.20)–(B.32) bound the retained boxes.
Fix the parameters in Theorem 1.2 and put
Put , , , , and use the width in Theorem 1.2. Write . All thresholds below may depend on the fixed parameters. For a product shell , set . The source measure is
| (B.1) | ||||
Lemma B.1 (Modulus support and coefficient size).
For either sign in (W),
| (B.2) |
If meets , then, for all sufficiently large ,
| (B.3) |
Proof. By the definition of in (2.29), every label vector in (W) satisfies the cubic label conditions of Iwaniec’s sieve remainder [10, Theorem 4]. Write for a label vector . The cubic conditions in Iwaniec imply . For the plus sign and odd , use the last odd-rank condition. For even , use the condition at rank and . For the minus sign, if then . If is even, use the last even-rank condition. If is odd, use rank and . Thus every term of (W) satisfies
All prime factors in and in the tail avoid .
Each grid coordinate has the form and is less than . Thus there are at most choices per position, since . Also by the last-rank cubic condition and . With and , the total number of vectors of all lengths is at most
The logarithm of the left side is at most . With , this is at most , using . For fixed , the primes below determine the smooth divisor uniquely. The remaining prime factors can be assigned to the labelled positions in at most ways. The Iwaniec coefficients have absolute value at most . Summing over the displayed finite vector family proves the multiplicity bound, including the empty-tail term.
If the shell meets the source interval, then and . Impose
| (B.4) |
It gives , proving the first claim of (B.3). The second follows from .
Here , and the theorem assumes on the coefficient support. So the natural comparator in (B.1) is . Thus (B.1) is the exact prime-source discrepancy for this source.
Removing the distinctness masks
Let be obtained from (W) by replacing each by , and put . The counting argument in Lemma B.1 also gives . Its termwise product bound applies to every unmasked term. So and are also supported on , and (B.3) applies to them. Their support need not lie in . The theorem assumes when . Hence is supported on the terms removed by a distinctness mask. This holds even when an unrestricted collision modulus is not coprime to . Every such modulus is divisible by for some tail prime . The coefficient difference is . Put .
| (B.5) |
For the proof, write , use , and sum and up to . Then use . The left side bounds the discrepancy of each removed term. Its progression count is at most . Consequently
| (B.6) |
As , this error has a fixed power saving for each fixed . For a fixed Iwaniec vector, the exact factorization (4.13) survives the projection. Replace each slot factor by . Here if and only if each . The bounds are unchanged. Equivalently, the smooth divisor and each tail prime are restricted to avoid within their existing summation ranges. Thus the projected coefficient still has the labelled form (3.4). Every modulus to which the dispersion theorem is applied is coprime to .
Prime detection and the rough Heath–Brown identity
The shells meeting the source satisfy . Set
For sufficiently large , every has . Write . For every integer , and so on the whole source range,
| (B.7) |
The identity follows by checking primes, prime powers, and all other integers . It fails for primes below , which lie outside the source range. The proper powers contribute to the weighted discrepancy
| (B.8) |
in total. There are such integers in the source range . The theorem’s range gives there. Each contributes at most , where is the divisor function.
For , the order-three rough Heath–Brown identity is
| (B.9) |
Here consists of and the -rough integers, and . To verify (B.9), put
The coefficients of vanish except at through degree . Thus all coefficients of at vanish. Multiply the expansion of by to obtain (B.9). Every variable is rough; this includes the logarithmic variable .
The tested indices for shell and pattern are
| (B.10) |
There are at most six variables. Their coefficient is
The shell, pattern, and tuple are part of the index. The identity’s range is automatic on .
For every nonnegative and each ,
| (B.11) |
The product determines its shell. Roughness restrictions can be dropped in this upper bound. Consequently the sum over all three patterns is at most . The factor is absorbed in later implied constants.
For , (B.2) and its extension to after (B.5) give the pointwise majorant
The congruence term counts . The natural-comparator term uses . On the prime source, (B.1) equals . Apply (B.7) to this identity while keeping attached to the tested integer. Each HB tuple then contributes the natural PSDT discrepancy . This holds also when its product shares factors with . The proper-power terms use the same discrepancy and obey (B.8).
Equal-ratio boxes and faces
For each product shell put
For sufficiently large , . The equal-ratio partition divides every dyadic coordinate interval into the cells
It covers the full interval, including its last cell. Also
| (B.12) |
For the lower bound, set . Since ,
Use and . This proves (B.12).
The mesh is imposed on the ambient integer axes before roughness is tested. Keep as an atom. A product box is a Cartesian product of at most six cells. Let be its lower endpoints and put ; the atom has . Define . Its tested-side faces are
| (B.13) |
where and ranges over the Möbius variables. The first two are the source cuts. The next two are product-shell edges, and the last are the HB caps. Roughness is part of the coefficient, not a face. A box is called boundary if one predicate in (B.13) is not constant on it. Every other box is either empty or a full Cartesian sum.
Lemma B.2 (Lattice thin-shell count).
Let , with , and . Let , , and let be -separated. Put . Then
| (B.14) |
For a single face, take and replace by .
Proof. Assign a tuple to the least active coordinate with . Fix the other coordinates, with product , and put . The nonempty fibre has . Let . The admissible values of lie in intervals of relative length at most . Their logarithmic left endpoints have spacing at least . After clipping to and merging overlaps, there are at most components. The separated left endpoints give total length at most . Counting integer endpoints adds at most . For a singleton face there is one component. Since , this gives the coefficient in (B.14). Sum over the fixed coordinates using
This proves (B.14).
Boundary and logarithm-freezing estimates
For every shell meeting the source,
| (B.15) |
Thus, since is fixed, for every , once is large. Also and each nonempty box lower-corner logarithm are on the source.
A boundary box lies within in logarithmic distance of a face in (B.13). The source and product-shell faces give two singleton families and the lattice . The cap faces give . In each boundary tuple, an active coordinate is at least for large . For a product face, the largest of at most six factors is at least . On a cap face the capped factor is at least . Apply Lemma B.2 with , , and . The number of face families is finite and independent of the number of boxes. Let be the set of boundary indices across shells and patterns for which lies in a boundary box. It excludes ambient Cartesian points outside the source-restricted set (B.10). The number of boundary indices is therefore
| (B.16) |
The elementary divisor estimates
| (B.17) | ||||
follow from , , , the divisor-sum bound , and Cauchy–Schwarz. For the last bound, apply Shiu’s short-interval estimate [4] to : uniformly for . For the global divisor-sum bound suffices. For the interval length exceeds for all sufficiently large . Combining this with gives the exponent . The bound for follows by summing up to . In particular, the LOG part from replacing by the lower-corner value on a box satisfies
| (B.18) |
Here , , and . Sum the resulting over the tuples using (B.17). A tuple belongs to exactly one box, so there is no box-count factor.
For the boundary part, . Cauchy–Schwarz, (B.16), and the second estimate in (B.17) give
| (B.19) |
Classification and interval lengths
The thresholds in (B.4), together with
| (B.20) |
ensure and . In this appendix plays the role of the in (3.98). For a box meeting ,
| (B.21) |
Here and . The Möbius bound follows from . The corner error is independent of the lower-cut exponent .
Use the window
A box is Type II if some . Select the largest such , with ties broken by the fixed variable order. Suppose no exponent lies in . A box is Type I-1 when it has exactly one large variable and that variable is not a Möbius variable. It is Type I-2 when it has exactly two large variables and neither is a Möbius variable. There are no other nonboundary boxes. In fact, a large Möbius variable would imply . If all variables were small, (B.21) would give . If three were large, it would give . Each is impossible.
Lemma B.3 (Lengths on retained Type-II boxes).
Let be a nonboundary Type-II box. Its selected cell is
Let be the product of the other lower endpoints. At least one complementary cell is nonunit, since the source product exceeds eventually. There are such cells. Set
| (B.22) |
Then, for sufficiently large ,
| (B.23) |
The PSDT interval is contained in . It has exactly the same selected integer coefficients as the half-open cell .
Proof. The real length of the selected cell is . Both
differ from by less than . The only integer endpoints at which the half-open cell and can differ are powers of two. Every internal mesh endpoint is with , and is irrational. Write in lowest terms with . If were rational, its -adic valuation would give , contradicting . At powers of two the selected rough coefficient vanishes, since . Thus the two integer conventions agree after multiplication by the coefficient.
Put
| (B.24) |
Then , so and . Also , hence and , proving (B.23). Write , , and , for the slot scales in Lemma 4.3. The scale is the first-slot scale in that lemma; is the modulus cutoff in (B.5). The inequalities in (4.9) and give
| (B.25) | ||||
Here , , and as for fixed . The terms in (B.25) are taken in this sense. For fixed they are eventually smaller than . Thus and . It follows that
| (B.26) |
for all sufficiently large . For the first inequality, the ratio is at least
for the second, use the bound of (B.30) in (B.23).
Let , and let be the fixed smooth cutoff in (3.9). Then
equals on and is supported on . It majorizes the full complementary interval without changing its length parameter.
Since and , (B.24) gives
Together with this proves the integer-length condition
| (B.27) |
This is the selected interval length hypothesis (LEN) in Section 3.2.
The source cuts are constant on each retained box by the definition of a nonboundary box. Let be a tested product in a retained Type-II box, and let be as in Lemma B.3. Every selected integer is at most . The complementary cutoff is supported below . As and , their product is at most
for sufficiently large , using . Thus on this enlarged support the upper cut leaves
| (B.28) |
The final inequality follows from and . Thus the resonant class is absent. Also for all sufficiently large .
For each fixed Iwaniec vector, Lemma 4.3 and the exact slot identity (4.13) give the three-factor coefficient required by (3.5). The smooth-only term has all three prime slots empty. Every tail factor is at least . This is the roughness threshold of (3.2), which bounds the tail cutoff in C1. The smooth divisor is attached to the first slot. The Section 4 packing lemma verifies the spectral inequality (3.7) directly, as displayed in (4.9). Separately, (B.25)–(B.26) verify the modulus and interval inequalities in (3.6); (B.27) gives the integer-length condition (LEN), and (B.30) gives the selected-window bounds used below. Also
and by the first inequality in (B.30) below. The selected window also gives .
The interior estimate
Let be the sum of the HB contributions on retained Type-I-1, Type-I-2, and Type-II boxes. It is taken after the finite Iwaniec vector sum. The arguments above prove
| (B.29) |
The first two errors in (B.29) have fixed power savings. The choice in Theorem 1.2 makes the last two . Both estimates are over the union of tuples.
The tested measure is the prime indicator on the interval of (B.1). It does not depend on the Iwaniec vector. The sieve factors belong to the modulus coefficient in (W). The prime-detection and rough Heath–Brown identities are (B.7)–(B.10). Every variable, including the logarithmic one, is -rough. The prime-power terms are estimated before the box partition.
The exponent constraints (B.20)–(B.21) imply that the residual cells are empty by the three contradictions above. The Type-II selected exponent obeys
| (B.30) | ||||
The second line records , the Type-II upper-length condition; the first line supplies the sharper bound used in (B.23). By (B.2), its extension to and after (B.5), and the parameter choice in Theorem 1.2, with . For a Type-I-1 box, (3.100) with gives . Take a Type-I-2 box. At most four of its at most six variables are small, each with . Their product has upper endpoint at most , so . Since , , by (B.20), and ,
Also by the large-variable definition, and by the Heath–Brown product support and its dyadic scale convention. Hence (3.101) holds, and with (B.30) and (3.100) the hypotheses (3.99)–(3.101) of the Type-I lemmas hold.
The packing lemmas give, for each Iwaniec vector, the exact three-slot coefficient and the packing inequalities (3.6)–(3.7). They include the empty-tail term and retain repeated-prime multiplicity before the mask error (B.6). The selected rough unit, Möbius and normalized-log coefficients are the three classes in (3.8). The proof of (3.25) in Section 3 applies to each class, with every auxiliary coprimality parameter and every subinterval. Its bound is for every fixed . Its application to and the small-norm case in (3.47)–(3.48) give the norm-normalized BFI passage. The complementary short-interval second moment and the remaining dispersion steps are those of Theorem 3.2. On these boxes, (B.22)–(B.28) verify their interval, smoothing and nonresonance data. In the local theorem take . In particular and imply for large . The comparator is the natural PSDT comparator on every HB product. No coprimality of a composite product is asserted.
For the chosen width, the global box count in (3.91) has . The source labels, Iwaniec vectors and prefix cells number , and the HB coefficients are . There are at most six variables. So there are dyadic tuples, within the of §3.10, and each dyadic tuple contains short boxes, within the there. This verifies (H7) for the prime source. Choose the local Type-II precision and , as in (3.92). Then Theorem 3.2 with (H7), that is (3.92), bounds the sum over all Type-II boxes. The bound is plus a fixed power-saving term. Lemmas 3.3 and 3.5 give for Type-I-1 and Type-I-2 when requested with and . Thus
| (B.31) |
Here is the logarithmic exponent from (3.13). Here the local spectral, restoration, endpoint and slot-localization costs are included once in Theorem 3.2.
Proposition B.4 (Iwaniec prime-source estimate).
Take the parameters of Theorem 1.2, either Iwaniec sign , and a sufficiently large even . Let be the exact coefficient (W). Let satisfy the residue conditions of Theorem 1.2, and let be (B.1). First split off the LOG correction algebraically. Then every remaining source summand is assigned exactly once to one class. The classes are mask, proper-power, boundary, Type-II, Type-I-1 and Type-I-2. Every retained box has the scale and coefficient properties stated above, and
| (B.32) |
Proof. The Iwaniec mask partition and support are (B.2)–(B.6). The explicit identities (B.7)–(B.11) partition the remaining tested measure into proper powers and HB tuples. The equal-ratio mesh puts each tuple in exactly one box. A face-straddling box belongs to the boundary class. On every other box both source predicates are constant. The exponent-polytope argument above puts every nonempty such box in exactly one of II, I-1 and I-2. The displayed tie rule selects one II factor. LOG is split off algebraically before that assignment. The errors are (B.6), (B.8), (B.18), (B.19) and (B.31). Their sum is .
Use of AI tools
The author devised the method of proof. Codex (OpenAI) and Claude Code (Anthropic) are the AI tools used. They assisted with derivation checks, code, typesetting, and review. The author checked every proof step, table, and reference. The author takes full responsibility for the content of the paper.
Statements and declarations
Competing interests. The author declares no competing interests.
Funding. No external funding was received.
Data availability. No external data or numerical computations are used in the proof. Appendix A records analytic source checks and their scope.
References
- [1] 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).
- [2] E. Bombieri, On the large sieve, Mathematika 12 (1965), no. 2, 201–225. DOI: 10.1112/S0025579300005313.
- [3] A. I. Vinogradov, The density hypothesis for Dirichlet -series (in Russian), Izv. Akad. Nauk SSSR Ser. Mat. 29 (1965), no. 4, 903–934. MR0197414.
- [4] P. Shiu, A Brun–Titchmarsh theorem for multiplicative functions, J. Reine Angew. Math. 313 (1980), 161–170. DOI: 10.1515/crll.1980.313.161.
- [5] J.-M. Deshouillers and H. Iwaniec, Kloosterman sums and Fourier coefficients of cusp forms, Invent. Math. 70 (1982), no. 2, 219–288. DOI: 10.1007/BF01390728.
- [6] E. Bombieri, J. B. Friedlander and H. Iwaniec, Primes in arithmetic progressions to large moduli, Acta Math. 156 (1986), 203–251. DOI: 10.1007/BF02399204.
- [7] J. Maynard, Primes in arithmetic progressions to large moduli II: Well-factorable estimates, Mem. Amer. Math. Soc. 306 (2025), no. 1543. DOI: 10.1090/memo/1543; the theorem numbering cited here is from arXiv:2006.07088v1.
- [8] A. Pascadi, On the exponents of distribution of primes and smooth numbers, arXiv:2505.00653v2, 2025.
- [9] S. Drappeau, Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method, Proc. Lond. Math. Soc. 114 (2017), no. 4, 684–732. DOI: 10.1112/plms.12022; arXiv:1504.05549v4.
- [10] H. Iwaniec, A new form of the error term in the linear sieve, Acta Arith. 37 (1980), 307–320. DOI: 10.4064/aa-37-1-307-320.
- [11] H. Iwaniec, Rosser’s sieve, Acta Arith. 36 (1980), no. 2, 171–202. DOI: 10.4064/aa-36-2-171-202.
- [12] D. R. Heath-Brown, Prime numbers in short intervals and a generalized Vaughan identity, Canad. J. Math. 34 (1982), no. 6, 1365–1377. DOI: 10.4153/CJM-1982-095-9.
- [13] H. H. Kim, Functoriality for the exterior square of and the symmetric fourth of , J. Amer. Math. Soc. 16 (2003), 139–183; Appendix 2 by H. H. Kim and P. Sarnak, pp. 175–181. DOI: 10.1090/S0894-0347-02-00410-1.
- [14] P. Deligne, La conjecture de Weil. I, Publ. Math. IHÉS 43 (1974), 273–307. DOI: 10.1007/BF02684373.
- [15] A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. USA 34 (1948), 204–207. DOI: 10.1073/pnas.34.5.204.
- [16] T. Estermann, On Kloosterman’s sum, Mathematika 8 (1961), no. 1, 83–86. DOI: 10.1112/S0025579300002187.
- [17] H. Iwaniec and E. Kowalski, Analytic Number Theory, AMS Colloquium Publications 53, AMS, Providence, RI, 2004. DOI: 10.1090/coll/053.
- [18] J. Friedlander and H. Iwaniec, On Bombieri’s asymptotic sieve, Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 5 (1978), 719–756.
- [19] E. Fouvry and H. Iwaniec, On a theorem of Bombieri–Vinogradov type, Mathematika 27 (1980), no. 2, 135–152. DOI: 10.1112/S0025579300010032.
- [20] E. Fouvry and H. Iwaniec, Primes in arithmetic progressions, Acta Arith. 42 (1983), no. 2, 197–218. DOI: 10.4064/aa-42-2-197-218.
- [21] J. Maynard, Primes in arithmetic progressions to large moduli I: Fixed residue classes, Mem. Amer. Math. Soc. 306 (2025), no. 1542. DOI: 10.1090/memo/1542.
- [22] J. Maynard, Primes in arithmetic progressions to large moduli III: Uniform residue classes, Mem. Amer. Math. Soc. 306 (2025), no. 1544. DOI: 10.1090/memo/1544.
- [23] S. Drappeau, K. Pratt and M. Radziwiłł, One-level density estimates for Dirichlet -functions with extended support, Algebra Number Theory 17 (2023), no. 4, 805–830. DOI: 10.2140/ant.2023.17.805.
- [24] E. Assing, V. Blomer and J. Li, Uniform Titchmarsh divisor problems, Adv. Math. 393 (2021), article 108076. DOI: 10.1016/j.aim.2021.108076.
- [25] J. D. Lichtman, A modification of the linear sieve, and the count of twin primes, Algebra Number Theory 19 (2025), no. 1, 1–38. DOI: 10.2140/ant.2025.19.1; arXiv:2109.02851v2.
- [26] N. V. Kuznetsov, Petersson’s conjecture for cusp forms of weight zero and Linnik’s conjecture. Sums of Kloosterman sums, Original Russian version: Mat. Sb. (N.S.) 111(153) (1980), no. 3, 334–383. English transl., Math. USSR-Sb. 39 (1981), no. 3, 299–342. DOI: 10.1070/SM1981v039n03ABEH001518.
- [27] R. W. Bruggeman, Fourier coefficients of cusp forms, Invent. Math. 45 (1978), no. 1, 1–18. DOI: 10.1007/BF01406220.
- [28] Yu. V. Linnik, The dispersion method in binary additive problems, translated by S. Schuur, Translations of Mathematical Monographs 4, American Mathematical Society, Providence, RI, 1963. Reprint record, DOI: 10.1090/mmono/004.
- [29] NIST Digital Library of Mathematical Functions, §10.43(v), equations (10.43.30)–(10.43.31), https://dlmf.nist.gov/10.43.v.
- [30] J. Friedlander and H. Iwaniec, Opera de Cribro, AMS Colloquium Publications 57, 2010. DOI: 10.1090/coll/057.