The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane
Abstract
We prove that all finite-order Hecke L-functions over and all Dirichlet L-functions are zero-free in the half-plane , with the principal pole at s = 1 allowed. In particular, the Riemann zeta function is zero-free in this half-plane, proving the quasi-Riemann hypothesis.
Introduction
Let , let be its ring of integers, and write for the norm of a nonzero integral ideal. A finite-order Hecke character modulo a nonzero integral ideal is a character of the ray class group modulo , extended by zero to ideals not coprime to . This agrees with the usual finite-order idelic definition: the complex place contributes no nontrivial finite-order continuous character [22 Chapter VI, Section 1]. For , put
The same notation denotes its meromorphic continuation. For a Dirichlet character modulo , extended by zero on nonunits, we likewise write
and then continue meromorphically; the character modulo gives the Riemann zeta function . The problem here is uniform exclusion: to find a constant , independent of the character, its conductor, and the height, such that these functions have no zeros in .
For alone, the existence of a fixed for which in is called the quasi-Riemann hypothesis [3 Section 1]. It asks for one gap valid at every height, not merely nonvanishing on . The corresponding uniform formulation over all Dirichlet characters appears in [9 p. 288, Equation (1.4) and the following paragraph].
The connection between these functions and prime distribution has a long history. Dirichlet’s 1837 proof of infinitude of primes in every reduced arithmetic progression introduced the character -series that separate residue classes [7]. Riemann’s 1859 memoir related the zeros of to the distribution of primes and formulated the critical-line conjecture [25]. Hadamard and de la Vallée Poussin independently proved in 1896 that has no zero on , obtaining the prime number theorem [15, 28]. Hecke subsequently developed the character zeta functions and their analytic theory over number fields [18].
Classical zero-free regions for Hecke -functions approach the line as the conductor or height increases and can allow one simple real exceptional zero; a precise form for abelian extensions is given by [27 Theorem 3.1]. Such regions do not give uniform exclusion in a fixed half-plane. Zero-density estimates address a different question: they bound the number of zeros to the right of a given vertical line. For example, Guth and Maynard’s large-value estimates improve zero-density bounds for [14 Theorem 1.2], but these zero-density bounds do not exclude every zero.
Theorem 1.1. Every finite-order Hecke -function over has no zero in . The same holds for every Dirichlet -function, including . A pole at for a principal character is allowed.
In particular, Theorem 1.1 resolves the quasi-Riemann hypothesis affirmatively: the supremum of the real parts of the nontrivial zeros of , namely its zeros in , is at most . The boundary is not included, while any exceptional real zero in is excluded. The theorem does not establish the Riemann hypothesis or its generalized versions, which place nontrivial zeros on . The Riemann hypothesis remains open [5].
Kubota’s metaplectic theory and Patterson’s cubic theta series provide the automorphic setting [20, 24]. We use the unconditional explicit cusp expansions recorded by Dunn and Radziwiłł [8 Section 5 and Appendix A]; their GRH-conditional prime asymptotic is not an input. The corresponding first-moment asymptotic is proved unconditionally in an independent manuscript [23 Theorem 1.1]; that result is also not used here. Proposition 5.1 derives the reflection used here while retaining the characters’ zero-on-nonunit restrictions.
The character large-sieve arguments build on the quadratic Hecke-family estimate of Goldmakher and Louvel [13 Definition 1 and Theorem 1.1], the higher-order norm recursion of Blomer, Goldmakher, and Louvel [4 Theorem 1.3 and Section 3], and Heath-Brown’s cubic estimate [17 Theorem 2]. We prove the precise sextic specialization needed here in Lemma 9.1, using paired residue characters to carry out that recursion in the primary-generator convention. An Eisenstein-integer form is also recorded by Gao and Zhao [12 Lemma 2.9]. The recursive moment arguments are related to the framework of Heath-Brown’s quadratic method [16 Section 2]. We also use the ordinary Hecke functional equation [11 Equation (1.1)] and prime counting in a fixed ray class [27 Theorem 1.1].
The planar additive large sieve used in the first stage is classical; compare Huxley’s multivariable and number-field inequality [19] and the Poisson proof in [1 Section 3, Theorem 3]. We include a direct Eisenstein-lattice proof to record the normalization needed for the reduced-fraction expansion. David, de Faveri, Dunn, and Stucky combine Patterson’s coefficients, the cubic large sieve, and mollified moments to prove nonvanishing at for a positive proportion of a cubic Hecke family [6 Theorem 1.1 and Section 1.2]. The zero detector below uses the classical truncated-inverse mechanism; compare [21 Appendix C], and for a higher-order-character density application [4 Corollary 1.6 and Section 5].
The proof has two stages, each comparing two representations of a completed cubic-theta sum but using a different normalized sum in the continuation argument. Part I proves the corresponding assertion in Theorem 3.1, already obtaining a fixed zero-free half-plane for both families. Part II starts from that conclusion and introduces prime compensation, asymmetric scales, and two additional moment estimates. The contribution developed here is the construction of these compatible reflected and Poisson comparisons, including the principal residues, with positive exponent margins chosen independently of the target character.
Proof overview
A common continuation principle. The analytic argument begins with the family of primitive finite-order Hecke characters over . Let be the supremum of and the real parts of their zeros in ; poles are not included. Imprimitive characters have the same possible zeros in , because the finitely omitted Euler factors are nonzero there. If exceeds a proposed boundary , the task is to continue every target reciprocal across a common positive distance to the left of .
Section 2 gives the precise criterion. For each target and large real scale , it compares a normalized character sum with a Mellin integral containing , after deletion of finitely many Euler factors and multiplication by a holomorphic factor bounded away from zero. A direct bound for the sum and a power-saving bound for its difference from that integral imply the required continuation. The two parts use this same principle with different affine powers of in the Mellin integral:
Thus the common analytic principle does not identify the two normalized sums. Only the positive power margins must be independent of ; fixed-character constants and lower thresholds may depend on it.
The completed sum. Section 4 sets up the sextic residue characters over , always retaining their zero values on nonunits. The base sum in Section 6 averages smoothed cubic-theta Fourier coefficients against these characters and a fixed target . After the fixed rescaling in the theta expansion, the completed indices are , where are congruent to 1 modulo 3 and is squarefree. The variables and may share prime factors. Here completion means retaining the full cubic factor , rather than restricting the index to its squarefree part. The target character and a finite ray-class phase act on the whole product , rather than separately on its two factors.
The resulting completed base sum has two exact representations. The reflection in Proposition 5.1 transforms its theta coefficients while retaining the character zeros in the resulting formula. Poisson summation transforms the averaging variable. Its nonzero frequencies have the form , where and is sixth-power-free: every prime valuation of is at most five. Section 7.2 then expresses the contribution of each such row through a quotient of Hecke -functions and a controlled Euler product. For , this quotient contains the reciprocal of the target function.
The balanced first stage. In Part I, the two averaging scales are both . On the reflected side, the base sum separates into a completed theta row and an additive polynomial. The quadratic large sieve bounds the mean square of the reflected rows. Expanding the additive polynomial produces reduced fractions in ; their separation and coefficient mass give the required planar large-sieve bound. The Cauchy–Schwarz inequality combines the two norms in Proposition 6.3. This direct estimate does not use the later inverse-moment recursion.
On the Poisson side, the intermediate rows are grouped by their norm and by the location of zeros in bounded-height rectangles for the finite family of Hecke twists that each row determines. Section 8 assigns zero-free rectangles to these families. When a row has a selected zero above the detector’s fixed floor for the real part, it produces two large Dirichlet polynomials: one with ideal Möbius coefficients, representing a truncated reciprocal, and one without those coefficients. They have one common row character and one common twist height. Part I uses only the inverse polynomial in its row count. After the part of the row with prime valuations at least two is fixed, the sextic large sieve applies to its squarefree factor; Proposition 9.2 gives the resulting count. Rows at the floor and the remaining small and large norm ranges are bounded directly.
The principal row is treated separately. Its residues, together with the local Euler identity, give a nonzero scalar multiple of the target Mellin integral. After normalization, the direct estimate and the remaining-row estimate verify the common continuation criterion with . This proves Theorem 3.1. The entire family is needed even for the consequence about , because the Poisson rows introduce finite-order Hecke twists of the target.
The refined second stage. Part II retains the completed support and the shared arithmetic identities, but it modifies the base sum. Selected prime factors provide a local compensation that cancels an unwanted Euler contribution, and the two averaging scales are no longer equal. After the new residue calculation and scalar normalization, the corresponding Mellin signal uses . The low estimate for the normalized sum again follows directly from reflected energy and an additive mean-square estimate; Section 15 proves it for the modified sum.
The high estimate uses both polynomials supplied by the zero detector. For a smooth compactly supported on , a scale , and a finite-order Hecke character , their basic forms are
where is the ideal Möbius function. In the specified intermediate norm ranges above the detector floor, each retained row has a large inverse polynomial and a large plain polynomial with one common row character and twist height. Bounds for their moments limit the number of such rows. Section 19 combines the two bounds, using integer powers and selected prime factors in the larger intermediate norm ranges. Small and large norm ranges, and the floor class, remain direct estimates.
The two moment bounds require separate inductions. Section 17 proves the second-moment estimate for an inverse polynomial multiplied by sums over disjoint prime sets (Lemma 17.1). Its recursive step uses two finite Poisson transformations to shorten the row range, with reflected energy providing the terminal bound. Section 18 proves a mean-square estimate for products of two plain polynomials, again with permitted prime factors (Lemma 18.1). Ordinary Hecke reflection reduces the length ranges at each stage; the recursive step uses two finite Poisson transformations.
The plain estimate retains different row families according to whether prime factors are present. With them, it excludes rows whose primitive inducing character belongs to the fixed finite group generated by the target and the auxiliary ray characters; without them, it excludes only principal inducing characters. Transformed rows in that finite family are treated separately within the induction. Direct volume bounds handle uncentered products. For a difference of two products with the same two profiles and equal products of scales, the common main terms cancel. This cancellation is used only for that centered expression, not for every row in the finite inducing-character family.
Section 20 combines the resulting row counts with the compensated expansion, its local errors, the contour tails, and the principal residue. After normalization, their bound verifies the second comparison in the continuation criterion at .
Transfer to Dirichlet -functions. The final transfer is the same at both boundaries. Composing a Dirichlet character with the ideal norm gives a Hecke character over . Away from finitely many Euler factors, quadratic factorization writes its -function as the product of the Dirichlet -functions attached to and to , where is the quadratic character of . The omitted factors are nonzero in , and the principal pole is handled separately. Thus each Hecke half-plane transfers to all Dirichlet characters, completing the two stages.
Least nonresidues and square roots over prime fields
The fixed Dirichlet zero-free half-plane also makes the following classical consequences unconditional.
Corollary 1.2. There are absolute constants such that, for every odd prime , the least positive quadratic nonresidue satisfies
In particular, for every , proving Vinogradov’s least quadratic nonresidue conjecture [26 Conjecture 1.1] [Conjecture 1.1]. Given an odd prime and in binary representation, there is a deterministic algorithm, with running time polynomial in , that returns a square root of or reports that none exists.
Proof. By Theorem 1.1 and the functional equation, the nontrivial zeros of every primitive Dirichlet -function lie in . They therefore lie in the strictly larger strip . This supplies the weak-GRH hypothesis of Bhargava, Ivanyos, Mittal, and Saxena [2 Conjecture 6.3 and Theorem 6.7] with . Their bound for the least quadratic nonresidue gives the asserted inequality, for example with ; no optimization is needed here. The assertion for each follows because every fixed power of is .
For the algorithm, first handle and test a nonzero by Euler’s criterion. If is a square, scan until a quadratic nonresidue is found, testing each candidate by its Legendre symbol. The bound just proved makes this a polynomial-time deterministic search; its stopping rule does not require knowing . Use the resulting nonresidue in the Tonelli–Shanks algorithm [10 Section 2.9, Algorithm 3 and Lemma 2.9.5]. All remaining steps are deterministic and polynomial in . Writing with odd only requires removing factors of two, not factoring . ☐
From a common signal to a zero-free half-plane
Both parts of the proof use the same analytic principle. A character sum is bounded directly and is also compared with a Mellin integral containing the reciprocal of a target -function. A power saving in both comparisons then continues that reciprocal across the rightmost possible zeros. We prove this principle for a variable boundary, so that it can be applied at and at without repeating the argument.
Throughout the paper, . It suffices to consider primitive target characters. Indeed, a character induced from a primitive character has -function differing from by finitely many factors , all nonzero for . Define
Poles are not included. Absolute convergence of the Euler product excludes zeros in , so .
For a finite set of prime ideals, a superscript means that the corresponding Euler factors have been deleted:
The local value is zero at a ramified prime. Each displayed factor is nonzero for , so deleting finitely many factors neither creates nor removes a zero there.
Proposition 2.1 (Continuation from a common signal). Fix and suppose . Let , where is fixed. Suppose that numbers satisfying
can be chosen independently of the target character. For every primitive finite-order Hecke character , suppose there exist a finite set , a holomorphic function on , and a function defined for all sufficiently large real , such that
For , define
Assume that, as ,
The implied constants, lower thresholds, excluded set, and function may depend on . Then these assumptions contradict .
Proof. Put
Because has slope one, the triangle inequality gives
Moreover , so . We also need control as . By (2.2), is bounded on . The reciprocal Euler product is absolutely and uniformly bounded on . On every fixed strip , the Gaussian in (2.3) is . Cauchy’s theorem on rectangles therefore moves the contour to any fixed , with horizontal integrals tending to zero. Hence
Since is arbitrary, the signal has arbitrarily rapid power decay at zero. This bound and (2.6) show that
converges locally uniformly on . On each compact subset, choose larger than all occurring real parts for the integral near zero, and use (2.6) near infinity. Thus is holomorphic on that half-plane.
We identify this Mellin transform without moving a contour across a zero. Set
The function is continuous and integrable in . Writing , (2.3) becomes
The left side is integrable in by the two endpoint estimates. Ordinary Fourier inversion therefore gives for every real . Both sides are holomorphic on , so the identity theorem gives
(2.2) implies on . Consequently
is a holomorphic continuation of . The number was chosen independently of . By the definition of , some target has a zero with . Its reciprocal has a pole at , and the deleted factors are nonzero there. This contradicts the continuation.
The high estimate in Proposition 2.1 is measured relative to , not to . This distinction matters when a row contribution reaches the low scale but still has a power saving relative to the hypothetical rightmost zero. Part I uses
whereas Part II uses
Only the positive power margins must be uniform in the target. Fixed-character constants, excluded sets, and sufficiently large lower thresholds may depend on it in both applications.
Part I
The quasi-Riemann hypothesis
A first zero-free half-plane
We first prove a fixed zero-free half-plane using the basic completed cubic-theta sum. This isolates the mechanism that excludes zeros before the additional estimates needed for the sharper boundary are introduced.
Theorem 3.1 (The 11/12 half-plane). Every finite-order Hecke -function over has no zero in . The same holds for every Dirichlet -function, including . A pole at for a principal character is allowed.
For the Hecke assertion, suppose for contradiction that
The proof will construct one character sum with two exact representations. Cubic-theta reflection bounds the sum after an elementary additive large-sieve estimate. Poisson summation expresses the same sum as a principal Mellin signal and a family of remaining character rows. A zero detector and the sextic large sieve control those rows. These estimates verify Proposition (2.1) with boundary .
The fixed family in Equation (2.1) is essential even when the desired consequence concerns : the Poisson representation introduces finite-order Hecke twists of the target. Proving the family-wide assertion also supplies the precise input used at the beginning of Part II.
Arithmetic and analytic preliminaries
The two parts use the same arithmetic conventions and analytic estimates. This section fixes the residue symbols, retaining their zero values even for principal powers, and proves the Gauss and reciprocity identities used to transform character sums. It then establishes a calculus for smooth norm profiles and uniform bounds for a Hecke -function on a disk known to be zero-free. These are the common preliminaries for the balanced argument.
Arithmetic notation and coefficient classes
Let , let , and put
For an element write , and for write . The same notation denotes the norm of a nonzero ideal. The ring is Euclidean for this norm: a point of is at distance at most from the triangular lattice , which gives Euclidean division. In particular every ideal is principal. The six units are , and their images are the six units of . Consequently every ideal coprime to has a unique generator congruent to (mod ); we call this generator primary. Products of primary generators are primary.
In the character-polynomial estimates below, a row is an outer index for a character polynomial, while a column is an ideal index, or a tuple of ideal indices, summed inside it. A label is an auxiliary index distinguishing parts of the family. Whether a label is averaged or locally frozen refers to the current sum; freezing it does not make it part of the fixed arithmetic datum.
For the arithmetic datum in any given invocation, fix from the outset a finite set of prime ideals containing the primes above and the prime supports of the defining moduli of every finite-order character presentation in that datum and of the fixed finite ray group used to present them. For a character presentation, its defining-modulus support consists exactly of the primes at which it is extended by zero, including any redundant primes of an imprimitive presentation. A fixed character includes its entire zero-extended presentation and the finite ray group through which it is presented, all fixed independently of , the current rows, and the averaged labels. The fixed datum may depend on a target fixed beforehand. In particular every such character has modulus one at every prime outside . We also write . We call primes outside good, and call an ideal good if all its prime divisors lie outside . Unless a different support is specified, ideal sums exclude and use primary generators. We write “sf” for squarefree and for the ideal Möbius function. Element rows, in contrast, may have arbitrary prime powers and unit factors.
For define
Its extension to is . The measure makes self-dual for the pairing . Indeed, writing with real , the conditions say , hence ; and the covolume of for is one. Lattice point counting in a disk, followed by division by the six units, gives the unrestricted ideal count
For example, the error follows by covering the boundary of the disk with fixed fundamental parallelograms.
If is prime, its residue field has order : the six roots of unity remain distinct in that field. Define the sextic symbol to be the unique sixth root of unity satisfying
For a primary outside , define , and put for every . For every integer , including and negative , the notation means its usual power when and means zero otherwise. Thus an exponent divisible by six is the function , not the constant function one. The square is the cubic symbol. For squarefree set
Lemma 4.1 (Fixed numerators give ray characters). Fix . At a prime ideal , let be the unique sixth root of unity congruent to ; at a prime outside this is . The extension is finite abelian and unramified outside the primes dividing , and
where is arithmetic Frobenius. Hence the multiplicative extension of this symbol to ideals coprime to is a finite-order ray character whose conductor is supported on the primes dividing . No bound on its conductor exponents at those primes is asserted. This identification is only on ideals coprime to ; it does not erase the prescribed zero of when a good ideal meets .
In particular, choose one generator for each . On primary ideals outside , the characters
belong to one finite family of ray characters with a common modulus supported on ; this family is determined by and the residues .
Proof. Let . Since contains all sixth roots of unity, all roots of lie in , and embeds its Galois group into . The extension is therefore abelian. A prime outside is unramified; for example this follows from the discriminant of , which is supported on . At such a prime, arithmetic Frobenius is characterized on the residue field by . Consequently its quotient on reduces to . Reduction is injective on outside , proving the displayed identity. Multiplicativity of the Artin map gives the assertion for ideals. Artin reciprocity makes this map factor through a ray group with modulus supported on the primes dividing ; these are the power-residue and ray-group assertions in [22 Chapter VIII, (5.3) and (5.5)]].
For the last statement, an ideal outside is coprime to every and to every unit. Its symbol therefore has no zero there, and the power of each depends only on (mod 6). There are at most possible displayed numerators after this reduction. Apply the first assertion to each and take a common multiple of their ray moduli. Their prime supports are all contained in because contains the primes above 6.
The word fixed in this lemma is essential: a numerator containing a moving good prime does not thereby enter a ray group fixed independently of . Its character and its natural zero support remain moving data.
At a base , a plain polynomial of real log-length is
and the centrally normalized inverse polynomial of log-length is
Every mask in is retained in both definitions. At base , when , we also denote the latter polynomial by , or by when .
An annular test is a smooth function with support in a fixed compact subinterval of . Families of annular or coupled profiles are used only with fixed logarithmic support and uniform bounds for every logarithmic derivative that is invoked. The precise separation norm is given in Lemma 4.5. In a product of two plain factors, both factors have the same row character, including the same fixed finite-ray twist. Conjugating a whole factor inside its absolute value permits the opposite orientation; conjugating only part of its coefficients does not.
We use the following uniformity convention. Log-lengths range over fixed bounded sets, and every estimate allows any specified positive power loss. The exponents of the norm scales depend only on those real parameter ranges, the strict margins, and the specified losses. Write for this fixed arithmetic datum: the complete zero-extended presentations of the fixed finite characters, their defining moduli and the fixed finite ray group used to present them, the excluded set, and any fixed arithmetic normalization. It is chosen independently of , the current rows, and the averaged labels, though it may depend on a previously fixed target. Finite seminorm orders, polynomial height orders, implied constants, and lower thresholds may depend on . They are uniform over the declared moving moduli and outer labels in their stated ranges, even when an outer label is fixed during one row sum.
For a nonzero ideal , let , where the count includes all integral ideal divisors, including those meeting , and for put . A nonnegative multiplicity is called divisor-bounded only if
for one fixed , independent of , the current rows, and the averaged labels. The constant may depend on . This convention does not relax any separate condition that depend only on . For every it implies uniformly. Indeed, for prime ideals of sufficiently large norm, for every integer , by for . For each of the finitely many remaining prime ideals, ; multiplying these bounds over the prime factorization of proves the assertion.
Gauss sums and the finite reciprocity phase
We first evaluate the prime Gauss sums. This also fixes the orientation of the cubic symbol in all subsequent formulas.
Lemma 4.2 (Prime Gauss identities). Let be the primary generator of a prime ideal outside , and put and . Then
For , one has .
Proof. Let and let be its nontrivial additive character. For a multiplicative character of , extended by zero, put
If is nonprincipal, the change of variables gives
The inner sum is for and otherwise, and . Conjugation also gives . When is nonprincipal, grouping the product by gives
The group with vanishes because is nonprincipal; for a nonzero sum, division by gives the displayed Jacobi factor. In particular if are all nonprincipal.
The number of solutions of is . Summing times this identity and using gives . Write . The Gauss–Jacobi identity and now give
Here because is a cube.
It remains to fix the cubic Jacobi sum, including its unit. Put . The definition of gives, in ,
Indeed the polynomial has degree , and the sum over of each monomial of degree less than is zero in (the constant case is in ). The Jacobi sum belongs to and has absolute value .
For , choose such that . The products of and of over these are both , so . Hence . Since
we obtain . Divisibility by and equality of norms imply for a unit . As is primary and the six units have distinct residues modulo , the congruence forces . Finally, . Dividing the two Gauss identities by the appropriate powers of proves the lemma.
The remaining phase is quadratic. Its evaluation below is valid even for odd elements that are not squarefree or primary.
Lemma 4.3 (Quadratic four-term formula). For a nonzero odd , define
Then
For the right side is . In particular depends only on and for every odd . The units modulo have square subgroup and square-class representatives . The function never vanishes on these units, and satisfies
Thus and is a symmetric -valued bicharacter of the square-class group.
Proof. Use the Fourier transform with kernel and measure . For apply Poisson summation on to . Direct Gaussian integration gives, with ,
To check the normalization, rotate by half the argument of . The quadratic matrix of the resulting real two-variable Gaussian is
Its eigenvalues are conjugates with positive real part. The positive square root of the determinant, the factor in , and completion of the square give the formula above.
Put . For a fixed ideal , a fixed class , and , Gaussian Poisson summation on gives
The zero dual vector gives the limit and every nonzero dual vector is exponentially small. The phase is periodic modulo . Consequently the normalized left side of Poisson’s identity tends to .
On the right side one may replace by . For fixed , the total error from the phase is at most
because the sum is . The amplitude error is , as is the damping error, by the same lattice estimate. All three are . The phase is periodic modulo . In the preceding Gaussian mean take and ; each of its four classes has normalized mean . The normalized right side therefore tends to , which proves (4.3).
The representatives modulo give the asserted four-term expression. Multiplication by an odd permutes these classes, so the same formula gives . The group of units modulo has order . Squaring a lift modulo depends only on its class modulo , and its three possible squares are . The four representatives in the statement are distinct modulo this subgroup; also . Evaluating the four-term expression on them gives the table. Evaluating on the two generators gives the displayed exponent, proving the last claims.
Lemma 4.4 (Sextic reciprocity and the fixed Gauss phase). For coprime primary outside ,
On all primary pairs outside , including noncoprime pairs, define by the bicharacter of Equation (4.4). Define, on every primary index outside ,
It has modulus one and factors through a fixed ray group supported at . For all such ,
Moreover , and at good primes
On every primary outside , one has . The diagonal is a character of the fixed ray group. In the square-class notation of Equation (4.4), it is , where denotes its residue square class modulo , not the ideal ray class of the unit ideal . For squarefree the complete Gauss identities are
All occurrences of on nonsquarefree indices mean the finite-ray function just defined, not a nonsquarefree Gauss sum.
Proof. At a good prime, counting square roots in the residue field gives
The additive sum without the character is zero. Hence , and replacing by for a unit multiplies the sum by . For squarefree , representing a residue as gives, in both sums,
The cross terms in the square are integral in the additive character. Thus for squarefree . In particular, for distinct good primes ,
We use cubic reciprocity in the following precise form: for coprime primary one has ; see [8 Equation (1.4)]. Thus the quotient is a sign. At its cube is , so this sign equals . Multiplicativity in both arguments and the bicharacter property extend the equality to every coprime primary pair. The definition by on noncoprime pairs involves no division of zero symbols.
The element is primary and is a cube. Cubic reciprocity therefore gives
This is a character of mod 2. Together with the dependence of on mod 4, this proves that is a function on a fixed ray group (for example the ray group modulo 12 suffices here). Indeed, if two primary generators represent the same ray class modulo 12, their quotient differs from an element congruent to one modulo 12 by a unit; reduction modulo 3 forces that unit to be one. The generators therefore have the same residue modulo 4. Its multiplicative refinement is the definition of . Since and has order dividing three, .
The table also gives
For the last equality use and the equality of these parities. Now , and , proving . Finally , as this square is a sign.
For a symmetric sign-valued bicharacter its diagonal is multiplicative:
The prime identity consequently gives for every primary outside . On the square class , the table gives both this diagonal and the value . This use of is in the residue square-class group; the ideal is the identity in an ideal ray class group and is not being substituted there.
For coprime squarefree primary outside , the Chinese remainder theorem gives
One obtains this by representing a residue as with mod and mod . Cubing the factor for gives one. The product of the factors for and is . The prime identities from Lemma 4.2, followed by (4.5), therefore prove (4.7) by induction on the number of prime factors. □
For later element rows, fix the generators from Lemma 4.1. Every has a unique expression
where is a unit and is the primary generator of the part of outside . On every primary outside , multiplicativity and sextic reciprocity give the zero-preserving identity
For this is the reciprocity formula just proved; if they meet, both sides are zero and is evaluated as its separately defined bicharacter. Once the good part’s fixed ray class and the -valuations modulo six are fixed, the first two factors on the right range over a fixed finite family of characters of . The product over good primes retains the moving character factors and all their zeros.
Every function on a fixed finite abelian ray group has a finite Fourier expansion in its characters. For example, if , then
Parseval and Cauchy–Schwarz bound by . Applying the same statement on separates as a finite sum of products of characters. These expansions remain valid at noncoprime primary pairs because there is the fixed-ray bicharacter, not a symbolic quotient. For example, for a good prime and every primary outside ,
On coprime pairs this is sextic reciprocity, and on the remaining pairs both sides vanish. Thus cancellation of the moving local characters can leave both a coprimality indicator and a fixed-ray phase; neither may be discarded.
Smooth norm profiles
The following conventions make the smooth dependence in character-polynomial estimates quantitative. They distinguish derivatives of a fixed test from powers of a spectral height. This distinction is needed when a Fourier tail is removed only after the height range has been chosen.
For a profile on with logarithmic support in a fixed compact set , put
We always understand that is smooth and supported in . Define
For a fixed finite tuple , possibly of different fixed dimensions, we use .
Lemma 4.5 (Smooth calculus). For integers ,
Logarithmic Fourier inversion separates any fixed norm monomial. More precisely, if with and fixed real exponents , then
If the coefficient measure in this formula is common to a collection of rows, Minkowski’s inequality passes any separated row bound through the integral using whenever the separated bound has height growth at most .
For a unit box and a smooth scalar function on ,
Consequently, under the corresponding derivative bounds, rowwise choices of scales in a polynomial range cost powers of , and rowwise choices of norm-twist heights of absolute value at most cost a fixed power of .
For and integers ,
With the Mellin convention , a pure twist obeys
Let , let be compact, and let be an integer. Suppose the integrals below are finite and the boundary terms in logarithmic integrations by parts vanish. Then, uniformly for and ,
These hypotheses hold for annular on every such . They also hold when is smooth at zero and Schwartz at infinity and is a compact subset of . In particular a horizontal contour join, whose imaginary coordinate is fixed, is estimated by this pointwise bound, not solely by the integrated tail in Equation (4.10).
The following joint version will also be useful. For measurable functions for which the right side is finite, and integers ,
Thus the product of a Gaussian in the sum of two heights and rapidly decreasing Mellin transforms in the other two heights has rapid pointwise decay on a fixed-height slice. For integrated tails, the linear map is invertible, so all fixed weighted moments of this product also control complements of boxes in the original heights. Appending finitely many separating frequencies and fixed linear translations of these three arguments gives the same conclusion by a block triangular change of variables.
After translating a pure twist in the Mellin variable, a discarded separated integrand bounded by has absolute tail at most . Here and must be fixed before is chosen. Further derivatives of a uniformly smooth separating profile change this last seminorm, not the previously fixed height order. On a join of bounded real length at height comparable to , Equation (4.11) with order gives times the corresponding finite weighted derivative norm of the external test, provided the other factors have the stated bound there. This is when those external norms are uniform.
Proof. For an integer with , integration by parts gives
Its absolute value is bounded by the volume of times . The weighted integral is finite because ; one can choose . Fourier inversion gives the monomial formula. For row vectors in , the precise inequality used there is
In one dimension, the fundamental theorem of calculus, averaging a base point over the enlarged interval, and Cauchy–Schwarz give . Applying this successively in each coordinate proves Equation (4.9). It can be summed over rows before the derivative integrals, since all terms are nonnegative. A logarithmic scale range of length needs unit intervals; a height range needs intervals. Derivatives with respect to a logarithmic scale insert , together with the constant derivative of a central normalization. Derivatives of a normalized twist insert powers of . These are again annular profiles with finite seminorm bounds. For example, if a fixed-parameter squared row bound is and there are height parameters, the covering and integration cost at most a fixed multiple of .
On one has , proving Equation (4.10). The Mellin shift is immediate from its definition. To prove Equation (4.11), put . For , integration by parts gives
Taking absolute values gives the bound on a compact real strip. For , the absolute integral gives it after increasing the constant. The two stated classes of have the required endpoint decay: compact support suffices in the first case, while at and Schwartz decay at suffice in the second.
For Equation (4.12), use
Move to the left, bound the weighted pointwise, and integrate the remaining polynomial weight against the Gaussian in . The remaining integral is the one displayed. This proves the joint bound and also the asserted join estimate. For the integrated assertion, both the map and its inverse have fixed operator norm. A fixed polynomial weight in the original variables is therefore bounded by a fixed polynomial weight in the transformed ones. On a complement of a box one inserts the additional inverse power of that weight and integrates the Gaussian and the two Mellin factors separately. The appended block triangular map has the same property because all of its coefficients and those of its inverse are fixed.
A kernel depending on a common product, such as , gives the same norm power on both variables in the monomial formula; this preserves an equal-product-scale difference. A nonsmooth arithmetic mask has no such derivative bound and must instead be resolved before this lemma is applied.
Lemma 4.6 (Gaussian annular decomposition). Put
This function is not annular. Choose a fixed such that , and define
The profiles have one fixed compact logarithmic support and, for every fixed and integer ,
Consequently Lemma (4.5) may be applied on each annulus after , and the resulting weighted separation norms are summable. For fixed , , and one also has
Directly, , and the weighted logarithmic derivatives in Equation (4.11) are finite uniformly on every compact real strip.
Proof. Such a partition is obtained by normalizing the integer translates of a nonnegative compactly supported smooth function positive on . Let . Each logarithmic derivative of is a polynomial in times the same Gaussian. The product rule therefore gives
This is summable after multiplication by for every fixed . The first assertion follows, and the separation norms follow from Lemma 4.5. In the profile’s logarithmic Fourier transform, rescaling an annulus inserts only the unit phase , so it does not change these norms; any real normalization of a surrounding polynomial remains explicit. On the indicated tail, the logarithm of the last bound after multiplication by is at most for some fixed ; summing the Gaussian tail proves the stated estimate for every . Finally, set and complete the square in its Gaussian integral to obtain . The same Gaussian bounds every in , uniformly for in a compact interval.
We record explicit finite-order continuity statements for the two types of kernels that accompany this separation. They make no assertion about an arithmetic transform; that transform must supply the stated kernel and its available real lines.
Lemma 4.7 (Finite seminorms for Fourier and Mellin kernels). For a Schwartz function on , put
For every and multi-index , the ordinary Fourier transform satisfies
The same conclusion, with a fixed change in the constant, holds for any fixed nondegenerate linear Fourier pairing. For a radial transform written as , any prescribed bound
is therefore controlled by finitely many Schwartz seminorms of .
For the Mellin assertion, let be holomorphic on a fixed closed vertical strip and suppose, uniformly there, for a fixed . On an available line in that strip define
where has the finite weighted logarithmic derivatives needed to make the integral absolutely convergent, with the boundary terms in the logarithmic integrations by parts vanishing. For every integer ,
*The integral on the right is bounded by finitely many integrals of , uniformly for in the fixed strip. For the same bound costs at most an additional factor . After multiplication by a fixed annular cutoff, these conclusions also bound every fixed logarithmic seminorm of , with the factor .
Proof. Differentiating inserts , and multiplication by a monomial in differentiates before Fourier transformation. The bound for the Fourier transform, the product rule, and the bound of by a finite sum of monomials of degrees at most give the first assertion. For a radial function, corresponds to . Expanding its th power gives finitely many polynomial multiples of Fourier derivatives, so the first assertion gives the radial one. A fixed linear change of coordinates changes only its constants.
For the Mellin assertion, differentiation under the absolutely convergent integral inserts . On the fixed strip this is bounded by a constant times . Write and integrate the Fourier transform of by parts more than times. The product rule bounds the resulting derivatives by the stated weighted logarithmic derivatives, because ranges over a fixed set. For a pure twist the Mellin integrand is . Substitute and use . Finally the product rule for a fixed annular cutoff and the chain rule for give the last statement.
Growth and logarithmic control for Hecke functions
The disk estimate will be applied only after zeros have been excluded from that disk. The following elementary growth bound provides the input for the complex-analytic argument and makes clear which constants are uniform in the conductor. When is a Hecke character, abbreviates . In this subsection denotes Euler’s gamma function; the finite quadratic function was confined to the arithmetic identities above.
Lemma 4.8 (Hecke strip growth). Let be a primitive nonprincipal finite-order Hecke character of , with conductor norm . Then
For the principal character, the same bound with holds for , with the removable value used at .
Proof. A finite-order character has trivial infinite type, since is connected. The primitive Hecke functional equation in this case is
This is the functional equation for primitive characters of trivial infinite type stated in [11 Equation (1.1)]; a nonprincipal is entire. Absolute Euler convergence bounds uniformly in . Applying the functional equation and Stirling’s formula on gives
The estimate for bounded follows by continuity of the gamma quotient on that line, so the constant is uniform there as well.
For completeness, the growth hypothesis needed to use the strip principle can be obtained directly from a lattice theta integral. Let be the conductor and define the periodic residue character when , with value zero otherwise. For the principal conductor put for all , including . Since the ideal class group is trivial, conductor one has no nonprincipal character. Periodicity modulo follows from the ray character property; is trivial on the six units because for a unit. Thus, for ,
The factor six counts the generators of each ideal. If , finite Fourier inversion and Gaussian Poisson summation give
Changing the generator only reindexes the finite sum. For each fixed conductor, the nonzero dual vectors have a positive minimum length. With , this proves
for some . Splitting the Mellin integral at one consequently gives
Both integrals are entire and bounded in height on each bounded real strip, with constants that may depend on the fixed conductor. Stirling’s formula for therefore gives at most exponential height growth for on that strip. In the principal case the same conclusion holds after multiplication by . Only this qualitative growth, for each fixed conductor, is used in the strip principle.
To see explicitly that the fixed-conductor growth constants do not enter the uniform strip bound, put
It is holomorphic in the closed strip and is bounded by one absolute constant on both vertical boundary lines, by the bounds already proved. For , apply the maximum principle on the rectangle of height to . On the vertical sides the exponential has modulus at most , because . On the horizontal sides its modulus is at most , which tends to zero faster than the qualitative fixed- exponential growth as . First let for this fixed , and then let . The result is throughout the strip, with the same constant for every . Multiplication by proves Equation (4.14).
For the principal function, the factor removes its only pole in the strip and is bounded on the boundary. Its functional equation gives the same boundary bounds with . This equation also follows from the preceding Poisson formula with : after writing , the theta relation is , whose split Mellin integral is invariant under . Apply the same damped-rectangle argument to .
Lemma 4.9 (Logarithmic control). Let be a primitive nonprincipal finite-order Hecke character of conductor norm , and put . For the principal character put and , with its removable value at one. Fix and . Suppose has no zero in the open disk of radius centered at . Uniformly on the closed concentric disk of radius ,
On the disk of radius one also has
In particular, for every fixed and , these bounds hold on , with constants depending on (and with the height of in place of ). In the principal case the reciprocal bound passes to ; the upper and logarithmic-derivative bounds are for the regularized function .
Proof. Write and . All the disks used here lie in , where the principal regularizer is holomorphic. On the zero-free disk choose a holomorphic logarithm whose value near the center is the Euler logarithm, together with the logarithm of the regularizing factor in the principal case. The value is uniformly bounded. Lemma 4.8 and Euler convergence to the right of give
The possible heights differ from by at most , which is included in . Borel–Carathéodory on radii , whose difference is , now gives on the disk of radius .
On the disk of fixed radius , one has . The absolutely convergent Euler logarithm is uniformly bounded there. For the principal function the logarithm of is also bounded on this disk, using its branch in . Since , Hadamard’s three-circles theorem applied to gives
For fixed , continuity on the compact interval makes uniformly smaller than one. For every , . Applying this to both and proves Equation (4.15). Cauchy’s estimate between radii and gives the stated bound for .
For the global assertion first suppose . Choose and put . The disk of radius is contained in , so it is zero-free by the definition of and absolute Euler convergence beyond one. The disk of radius covers the points at its center’s height; Euler convergence covers . The preceding constants are uniform in . If , Euler convergence on suffices. Finally
which proves the principal reciprocal assertion.
Lemma 4.10 (Deleted Euler factors). Let be a squarefree ideal and let for . Put . For fixed and every ,
On a bounded real strip one has, uniformly in the height,
In particular a support with bounded costs any prescribed positive power of on a fixed positive real half-plane. For an imprimitive function , both the primitive conductor and the deletion radical must be included when applying logarithmic control.
Proof. Every factor is nonzero on . For , both its absolute value and the absolute value of its inverse are at most . For sufficiently large , depending on , . The finitely many smaller primes contribute a fixed constant. This proves the first estimate. For any real ,
The last inequality follows by separating the finitely many primes with . Finally, logarithmic differentiation gives
If , choose the exponent in the first estimate smaller than the desired exponent of divided by the bounded value of ; the case is immediate. This proves the stated interpretation for deleted factors.
Completed cubic reflection and unmarked row energy
This section first transforms a completed sum of Gauss coefficients while retaining every zero extension in its character. It then combines that identity with the quadratic large sieve to bound its mean square over arbitrary nonzero element rows. At equal row and completed lengths, the result is the bound needed in the balanced argument.
The theta function and its Fourier coefficients at three fixed cusps are the unconditional input from Dunn and Radziwiłł [8 Section 5 and Appendix A]]. The original coefficient and cusp calculations are in Patterson [24 Theorem 8.1 and Sections 7–8]]; the formal input here remains the formulas in [8]. The finite transform below derives the masked formula, including its local factors and phase. The later mean-square argument uses this phase only after fixing its finite cusp sectors.
The completed reflection
Write
On , the exponent in is . For every integer exponent, a power of a residue character is understood to be zero at a nonunit. In particular, .
Proposition 5.1 (Completed cubic reflection). Fix a finite family of finite-ray characters whose conductors are supported on . Choose one fixed integral modulus with prime support exactly , divisible by every conductor in this family. On primary elements extend each member of by zero away from the -units. Choose a single with prime support , with and , large enough that, for every , the function on
is -periodic. The zero branch is evaluated without evaluating either character. Such a choice of exists by the cubic supplementary law and the ray periodicity, as verified below. Both and are fixed for the entire family before any moving prime is chosen. Fix a member and put . Let be any finite set of distinct primary primes not dividing , choose for each , and set, on primary elements,
No coprimality between the two variables in the following product is imposed:
Both series and their product converge absolutely for .
Let . Suppose that and that, for every and every integer , is as and as . Define
The smoothed expression to be transformed is the completed sum
This equality follows by absolute convergence and Mellin inversion. The character acts on the whole index , with its zero values retained; and may share prime factors.
The reflected test is defined by
The integral defining is absolutely convergent and is independent of .
The product has an entire continuation. On every fixed vertical strip it has polynomial growth, with constants allowed to depend on , , , and the strip. There is one fixed triple of cusp coefficient functions from to , constructed from the theta expansions in the proof. The same triple is used for all choices of the arithmetic data, scale, and test profile. For each fixed arithmetic choice above, there is a finite family of terms, indexed as in (1), independent of , , and the contour parameter . In each term, is selected from this triple and is an additive character of modulo a fixed modulus depending only on ; their sectorwise dependence is exactly that stated in (3), and the remaining data have properties (1)–(3). For these terms and every , the identity is
Every inner sum is absolutely convergent. The terms have the following precise properties.
A term is specified by mod and a subset of active primes. Every with is active, while a prime with may be active or inactive. Write . Then , where is the reduced denominator of , with a normalizing unit. Thus ranges over a fixed finite set and its prime divisors divide . There are terms, or after splitting each Ramanujan factor in the next display into its two summands.
The local column factors are
The function is one of three fixed cusp coefficient functions. Writing for an Eisenstein unit, their support and size satisfy
The bound refers to the displayed representation of a supported index. It permits common primes of and , and it imposes no exclusion at the primes of other than the displayed restriction at . The character is an additive character of a quotient of by a fixed modulus depending only on .
The scalar is independent of and satisfies . Its moving-prime dependence can be specified exactly. For , put
For each active , define units modulo by
and put
The indices of are read modulo six. With , there is a number of absolute value one, depending only on and the class of modulo , such that
In each of the finitely many classes of and mod , both and are fixed. Consequently these are common column factors within that sector. Apart from the displayed scale , all other moving-prime dependence outside the is in the scalar , which may depend on the whole active set.
The branch conventions are simultaneous for all local prime sets with the same and . In particular, if a good prime is added to the local set with exponent zero and is declared inactive, the resulting branch has the same , , , , , the same data at every other active prime, and the same kernel as the branch in which is absent. Its scalar is multiplied by . This compatibility includes every , not only the unit classes modulo .
Bounds for the transformed test. For and an integer , put
For every integer ,
If is fixed, , and is an integer, then
These are finite smooth seminorms. More precisely,
Replacing by multiplies by at most .
Proof. We first express the character masks through finitely many translated theta values. We then transform their rational cusps and compute the resulting automorphy multipliers and local Fourier factors; the final Mellin comparison gives the reflection identity and the bounds for its transformed test.
The fixed theta input. Let , , and . The unconditional formulas of [8 Equations (5.4), (5.7), (5.9), and (5.12)–(5.17)], give a smooth cubic theta function on with
Here is one on and is one on an element of with lower left entry zero. The subscript 3 denotes the ordinary cubic residue symbol; for a good prime , one has . These automorphy and coefficient formulas have no hypothesis about zeros of -functions.
Put
If , then is a product of an element of and a lower translation in with multiplier one. The analogous assertion holds for upper translations. Therefore
because and . If with , and , then
and hence . These are the only cusp representatives needed below.
For any of them, define by
Here is independent of . The three functions are respectively in [8]. Its Appendix A, rows 1, 19, 10, expresses their coefficients in terms of in its Equations (5.7), (5.13), and (5.14). In their notation the conjugate expansion uses , as in their Equation (5.16). Those formulas give the support inclusion in Equation (5.2). For completeness, the two possible magnitudes from at are
and have magnitude and . Here the Gauss sums use only the cubic symbol, including at primes in . To make their domain explicit, for every primary squarefree define, as in [8 Equation (1.7)],
The ordinary cubic symbol is defined at every prime other than and is extended by zero on nonunits and multiplicatively in the denominator. Every primary is prime to . At each prime divisor of the cubic character is nontrivial, and is primitive because is a unit there. The finite-field Gauss identity and the Chinese remainder theorem therefore give for every such squarefree . This includes the primary prime of norm ; no sextic character with that denominator is used. Also, whenever , the change of variable gives
This covers the twists in the other source coefficient families. Thus the unnormalized Gauss sums occurring in all three cusp families have magnitude . Consequently each coefficient magnitude displayed above is at most , including . The formulas require only that be squarefree and that be primary; they do not require . Prime valuations of also show that its representation by such , when it exists, is unique. In particular the same bound is valid when the variables share primes or contain primes excluded from the primal sums.
At infinity the condition isolates exactly with primary and squarefree. The infinity support has ; every other ramified exponent in Equation (5.7) of [8] makes divisible by , and the negative sign in the remaining pair gives . At the isolated index the coefficient in is
This is the unmasked source formula, valid for every primary squarefree and every primary , with no coprimality condition between them. Only when may it be expressed in the global sextic notation: substituting in gives
The cubic supplementary laws in [8 Equation (1.5)] make periodic on all primary modulo . On primary elements prime to it equals . A character in is periodic on primary elements prime to modulo its conductor, and the zero condition is periodic modulo . Thus a sufficiently divisible with prime support works for every member of the fixed finite family. This verifies its choice before the moving local primes are selected.
Finite Fourier inversion with the zero extensions. For define
The character pairing furnished by is nondegenerate on . Changing variables in a Gauss sum, and using the orthogonality of a nontrivial multiplicative character, gives
Here and below means . Each nontrivial power of is primitive modulo the prime , so the usual finite-field Gauss-sum identity gives .
Fourier inversion on and on each now gives
This uses every additive frequency, including nonunit and zero local frequencies. We do not invoke the twisted formula in [8 Lemma 5.2 and Corollary 5.1], whose unit-Fourier-support hypothesis need not hold for these masks. The theta function with this multiplier on its infinity coefficient is the finite sum
For an isolated infinity index , the piecewise definition of first discards every term for which . This is a mask on the whole completed index: if and only if both and are -units. Only on that remaining domain do we use complete multiplicativity, including , to write
It remains true when share a moving prime, since the corresponding local powers retain their zero values, including for . For the discarded terms the completed coefficient is defined to be zero directly; no value of is evaluated there. Combining Equations (5.9) and (5.10) on the retained domain now identifies the direct Mellin series with the product . The dual coefficient functions keep the full source support in Equation (5.2); no -mask is placed on them.
Fix and declare active precisely when . Equation (5.11) forces all primes with to be active. Choose once for each a representative and a reduced expression . Multiplying numerator and denominator by one unit, normalize the numerator to be if and the denominator to be otherwise. Since every active prime is primary, this unit depends only on . For , Equation (5.12) then gives
At a prime dividing , the numerator is congruent to and is a unit. At , it is congruent to and is again a unit. Thus this fraction is reduced, even when is a nonunit modulo . The empty product is allowed. Replacing any lift by another changes by an element of , a period of .
Choice of the cusp matrix and its multiplier. The next construction determines the automorphy multiplier and reflected additive phase for each reduced cusp fraction just obtained. Set . For every active , the Chinese remainder theorem permits the chosen nonzero class mod to be lifted with . Restrict to one class modulo . Equation (5.13) shows that is then fixed modulo ; in fact its moving terms are divisible by , and is fixed modulo , which is divisible by because divides up to a unit. It also shows if , and otherwise.
Choose by the following compatible local congruences:
The first line means the indicated prime-power parts of . All inverses exist because is reduced. Put and . Then , and division of by gives
Consequently have fixed residues at the needed powers of every prime dividing , independent of the classes . Whenever a zero entry would occur in a residue-symbol calculation, one may first translate by and then add a multiple of the combined congruence modulus to . These changes preserve all displayed congruences and avoid the finitely many values making an entry zero. They do not change the translated theta function.
There are three cases, distinguished by . If , put . Then , and cubic reciprocity for the primary and the primary primes of gives
If , take the unique with and put ; these are the two possibilities because . The congruences above show that . Write . Both and are primary, and they are coprime: and . The determinant equation gives
It follows, by cubic reciprocity for , that
For the second equality, reduce modulo and use ; the cubic symbol of is one. Finally suppose . Choose with and put . Here , , and , so
Both and are primary. Moreover . Factor with primary. The supplementary laws make ; cubic reciprocity makes because the numerator after reciprocity is . Thus
The last inverse uses .
In all three cases we have proved
The factor is constant as the active vary in the fixed sector. If , it is : the unit and -power factors are determined by , and reciprocity determines the remaining fixed-prime factors from the residue of at the primes of . In the middle case it is , determined in the same way by the fixed residues of and . In the last case it is , which is determined directly by the fixed denominator and . The displayed congruences for therefore determine using only and . They also determine the chosen one of the three functions .
The reflected additive phase. Write and . At each , Equation (5.13) gives . Hence . Additive Chinese remaindering for the coprime factors of gives the exact identity
Here is the class of modulo , and in the formula for is taken modulo . For example, the local numerator at is ; this verifies the signs and the powers of . The chosen congruences fix , since divides the corresponding local moduli, and the sector fixes . A common multiple of the finitely many is therefore a fixed modulus for all the characters .
Conjugating Equation (5.15) contributes . For , multiplication by Equation (5.11) leaves the local sum
Upon putting , the sum is a Gauss sum of exponent . If , its value is , also at because both sides then vanish. If , it is the Ramanujan sum
For an active , the same substitution gives
These are exactly ; an inactive zero exponent contributes . This proves every local factor, including its zero extension. The choices of and the active subset give at most terms. Splitting the factors multiplies this by at most , proving the stated counts.
The denominator and the fixed-sector data constructed before these local sums depend on the local prime set only through and the active radical ; the remaining active-frequency dependence is exactly the local dependence just summed. We use the same representatives and normalized fractions for each , and the same fixed-sector choices of cusp function, fixed additive character, and whenever those data recur. An absent prime and an inactive zero-exponent prime have the same active radical; their other active are therefore also identical. The inactive coefficient is the only change. This proves the simultaneous branch compatibility in the statement.
The marked reflection in Section 14.2 will use the following dependence on pairs of active primes. Since
there is a scalar of absolute value one, depending on but on no other active prime such that
For this uses ; for the other exponents it follows immediately by inserting the expression for . Thus the contribution of another active prime to the phase at has exponent exactly modulo six. In particular an active exponent has column coupling .
Mellin normalization and continuation. Let
The Bessel identity used in [8 Lemma 5.3] is
On the coefficient sums converge absolutely, so we may differentiate and integrate their expansions term by term. Since , the identity with gives
First use the whole-index mask to restrict to as above, then insert Equations (5.9) and (5.10). Using and gives
For one translated term , use the matrix constructed above. The coordinate action of on hyperbolic space, from [8 Equation (5.1)], gives
At , the derivative of its first coordinate with respect to is ; the derivatives of its conjugate coordinate and of its vertical coordinate with respect to are zero. The chain rule and therefore give
In particular the derivative removes from every cusp expansion in Equation (5.7). Substituting that expansion and then in the integral gives, for , the contribution
To verify the scalar directly, before applying the Bessel integral the factor is and the remaining integral is . The Bessel identity with , together with , gives exactly the display.
We justify both the continuation and the contour operations here. The coefficient bound in Equation (5.2) implies absolute convergence of the reflected series when : the separate majorants are
Each converges in that region. The fixed support has a positive lower bound for . The exponential decay of and of all its derivatives, the coefficient bound, and the direct expansion imply exponential decay at for every logarithmic derivative of each translated derivative. The chain-rule formula just obtained implies exponential decay at as well, with constants depending on the fixed translated term. Repeated integration by parts in now shows that is entire and decreases faster than every power of on each fixed strip.
Equation (5.18), with reciprocal gamma functions on its right, continues to an entire function. Its direct series is bounded on any line to the right of . Equation (5.19) and Stirling’s formula give a polynomial bound on any line to the left of ; the exponential parts of the two gamma products cancel. On a strip between such lines, the rapid bound for and the reciprocal gamma factors first give for some . Divide by a sufficiently large power of , with chosen so that has no zero on the strip, and multiply by . The horizontal sides of a growing rectangle tend to zero for each . The maximum principle, followed by , transfers the polynomial bounds on the two vertical sides to the strip. This proves the stated polynomial strip growth.
Shift the integral on the left of Equation (5.1) from to with . The entire continuation, polynomial strip bound, and rapid Mellin decay justify the shift: Equation (4.11) applied to the weighted logarithmic derivatives of makes the horizontal joins tend to zero. Inserting Equation (5.19) divided by Equation (5.18), and putting , gives the gamma quotient and the factor
Indeed and . The reflected coefficient series is absolutely convergent on this line, so it may be interchanged with the integral. Summing its finite local factors using Equation (5.16) and the computed Gauss sums proves Equation (5.1) and Equation (5.3). Since , we have ; every other factor in the scalar has absolute value at most one. This proves .
Uniform estimates for the transformed test. The first negative pole of the numerator of is . The reciprocal denominator gamma functions are entire. Hence the integrand defining is holomorphic for . On , Stirling’s formula gives
The estimate is uniform also for bounded , since this closed strip has no numerator pole. Equation (4.11) makes rapidly decreasing pointwise on every vertical strip. Rectangular contour shifts are therefore valid within , including between any two nonnegative lines. Applying contributes . The three lines bound the resulting integral respectively by constant multiples of
Combining them proves Equation (5.4). The rapid large- bound, with arbitrarily large, also makes every dual sum in Equation (5.1) absolutely convergent when is represented on the zero line. Thus the shift of the kernel contour does not require a termwise shift of a conditionally convergent Dirichlet series.
For Equation (5.5), set . This is supported on a fixed compact interval. Integrating its Fourier transform by parts times and using the trivial bound for gives
Leibniz’s rule and Equation (5.4) bound each norm by the right side of Equation (5.5), because stays in a fixed compact subinterval of . Finally, for , integrations by parts give
For use the corresponding undifferentiated integral. On , , proving Equation (5.6). The identity and give the asserted norm-twist bound. In particular the Gaussian test , whose Mellin transform is , satisfies the hypotheses of this Proposition directly. □
Element rows and fixed sectors
To apply the reflection to a character , we separate the fixed supplementary phases from the good prime divisors of the row. The separation retains the zero at every shared good prime.
Lemma 5.2 (Fixed ray sectors for nonzero rows). Let range over a fixed finite family of finite-ray characters with conductors supported on , extended by zero off the primary elements prime to . Use the fixed generators for from Lemma 4.1. For , write uniquely
where the good prime generators are primary and is a unit. On every primary element prime to one has
All powers on the right retain their zero values, including when . Fix , the valuations modulo six, and the class of in the fixed ray group through which factors. In such a sector define
The nonzero branch is a member of a fixed finite family of finite-ray characters with conductors supported on . Therefore a single in Proposition 5.1 works for all these sectors. The local prime set contains every , with exponent modulo six, even when this exponent is zero. No moving good prime is absorbed into .
Proof. If , multiplicativity and the symmetric reciprocity factor in Lemma 4.4 give Equation (5.20). If a good prime is shared, both sides are zero: the left side is the zero extension of , and its local factor on the right is zero even for a six-divisible exponent. This proves the identity on the entire stated domain.
On this domain depends only on and the -valuations modulo six, because every numerator factor is a unit modulo . For each of the finitely many representatives , , Lemma 4.1 identifies with a finite-ray character whose conductor is supported at primes over , all in . Once the good ray class is fixed, is one of a fixed finite family of characters supported at the primes over . Their products with the finite family of base characters give the asserted fixed family. Choosing a common multiple of its conductors and the -mask gives the common and then . Additional good local residue-symbol factors in a completed coefficient are placed in and combined at a shared prime with the same zero convention; they do not alter this fixed modulus. The argument requires and makes no local-prime assertion for the row .
Common profiles and lattice tails
The reflected series has a scale depending on its row. We keep that dependence inside one joint smooth profile until after Fourier inversion; this gives one coefficient measure for the whole row norm.
Lemma 5.3 (Common annular kernel profile). Let satisfy the hypotheses of Proposition 5.1. Fix an integer , a compact set , and real exponents . Let be one smooth profile with logarithmic support in , common to all rows in a given block, and let be fixed within that block. Put
For and integers ,
Here is the homogeneous seminorm of a single profile, not the inhomogeneous seminorm of a tuple. The constants are independent of and of the actual norm labels within the block.
Proof. On the support of , the monomial is bounded above and below by positive constants depending only on and the exponents. Each operator acting on is times the Euler derivative of at . It produces no additional power of . Leibniz’s rule and (5.4) prove (5.22). Applying Lemma 4.5 with gives (5.23).
Here is the norm consequence, including its order of operations. Let be the original row set, and suppose a row vector is linear in the whole profile . The profile includes the cutoffs for the full fixed logarithmic boxes of its row and column norm variables. Assume that simultaneous logarithmic Fourier inversion expresses the vector using one density common to every row. After the relevant arithmetic coefficient independences have been verified, write . Minkowski gives
Here is the separated row vector, whose norm powers all have absolute value one. The identity underlying this inequality is a Bochner integral in ; the finite separation norm above ensures its absolute integrability whenever the separated norm has the stated polynomial height growth. Uniform bounds for densities chosen separately for individual rows would not give this identity. Only inside the nonnegative norm on the right may the row set subsequently be enlarged, using the same separated formula for on the added rows. No comparison of the kernel argument with is asserted on the added rows. Squaring this inequality gives the factor . If only the small-argument bound is being used, the same argument permits the weaker scalar , whose square is . The normalized profile has bounded tuple seminorms; they are not claimed to be small, since the tuple seminorm includes a constant one. A kernel occurring once in an already expanded quadratic expression instead contributes its scalar once, not automatically its square.
The Gaussian test in Proposition 5.1 is directly admissible there and in Lemma 5.3: only the joint factor in the latter lemma needs compact logarithmic support. If the compact-support calculus is instead applied to the Gaussian itself, Lemma 4.6 supplies the required absolutely summable annular decomposition.
Lemma 5.4 (Lattice kernel tails). Let be either or . Suppose satisfies for , where . Then, for and ,
For one may take .
Proof. The shell contains points of either fixed lattice. Its contribution is at most . Summing the two geometric series gives , which implies the display because . The last assertion follows from Equation (5.4).
A quadratic norm for completed indices
The next estimate bounds the quadratic character left by reflection on a squarefree factor times a cube. We begin with the imported sieve. For squarefree primary ideals outside a fixed set containing the primes over , the quadratic kernel satisfies
This is Goldmakher–Louvel’s quadratic large sieve [13 Definition 1 and Theorem 1.1]. To verify its family hypotheses, let denote the quadratic residue symbol evaluated at the primary generator of . The adjustment of to its primary generator contributes , where is the nontrivial character modulo and . The powers of contribute nothing because they are squares. CRT therefore gives exact primitive conductor and trivial infinite type. We use the primitive inducing character: the displayed formula first specifies its restriction to the -units, and the factor at is absent when . This does not change any value on the indices in Equation (5.26). In a fixed primary square class modulo , two indices have the same ; for coprime such indices the primitive product has conductor exactly their product. The reciprocity factor is the fixed bicharacter of Equation (4.4). These are precisely the family conditions of the cited theorem. A finite ray partition and transpose duality give Equation (5.26) in the displayed orientation.
A fixed restriction on the row set decreases the positive outer sum. A fixed restriction on the coefficient support is implemented by setting the omitted coefficients to zero. Neither observation permits an arbitrary mask depending simultaneously on a row and a column. The next reduction resolves the collision mask produced by square factors of a completed index.
Lemma 5.5 (Quadratic reduction for completed indices). Let . Let be any set of squarefree primary good ideals with . Let range over squarefree primary ideals with , and let range over primary ideals with . The ideals may contain primes of other than . Let be arbitrary complex coefficients independent of . Fixed restrictions on and fixed restrictions on the -support are allowed.
Write uniquely with squarefree, and set , , . Thus are pairwise coprime and squarefree. Fix one set of dyadic ranges
where all comparison constants are fixed. Let be the sum over of the squared absolute value of the -sum restricted to this set of ranges, with summand . For a squarefree good ideal and a fixed , let be the set of triples for which
belongs to the original support and to these ranges, with the stated squarefreeness and pairwise coprimality of . Then
Empty quotient ranges contribute zero; all bounded ranges, including the unit ideal, are included by the fixed comparison constants. Fixed ray sectors and bounded row scalars are permitted. In particular, if , then
The constants may depend on the fixed support comparisons and on , but are uniform in the coefficients and in the permitted support restrictions.
Proof. The factorization permits and to share primes. Since , the zero convention gives the exact identity
Indeed a square has sixth power under the displayed quadratic character; this is one on units and zero at a collision. The identity therefore also holds when or shares a prime with .
For the chosen ranges there are possible . Hilbert-space Cauchy gives
Fix in the positive sum. The condition is now a fixed row restriction. For the remaining condition use the full identity
For each the number of possible is at most . Rowwise Cauchy followed by summation over costs and gives a positive sum over fixed squarefree good . Write and . Squarefreeness gives the fixed row restriction and the coefficient restriction ; terms with vanish, and otherwise is another fixed row restriction. There is no remaining condition in an individual -summand: the full collision mask was already expanded. A fixed ray sector for becomes a fixed sector for once is fixed.
The factor is a bounded column factor. Split the squarefree parts of supported on from their good parts: and . There are only finitely many choices of . Their symbols are bounded row factors, while is squarefree and good, of norm . For fixed , group the remaining columns by . If is the resulting coefficient, the quadratic large sieve gives
The outer sum may retain all its fixed restrictions. On a nonempty range, both quotient lengths in the last display are bounded below by a fixed positive constant; replacing them by their maxima with one changes only the comparison constant.
For each , the number of factorizations into is divisor-bounded. There are possible in its range. Cauchy over these two choices therefore gives
The bounded column factor from has been discarded only in this positive sum. The fixed bad-part symbols were row factors of unit modulus and were removed from the outer modulus before applying the sieve. The ideals here are the original ideals, reconstructed from their fixed -parts; the -part of is untouched. Combining the displays proves Equation (5.27).
Suppose now . Ideal counting gives
For , its product with the preceding factor is . There are possible in this range and possible . Since , their contribution to Equation (5.27) is at most
Here are bounded below on a nonempty range and . The number of dyadic choices for is logarithmic in the norm ranges. Hilbert-space triangle over the blocks, followed by a rescaling of , proves Equation (5.28).
The unmarked reflected energy
For a fixed finite-ray character , extended by zero away from primary elements prime to , and for , define the central completed sum
Here may share primes. The defining series is absolutely convergent for every when satisfies the hypotheses of Proposition 5.1. Complete multiplicativity, with the zeros retained, gives . Thus for every ,
Indeed, absolute convergence permits termwise Mellin inversion on that line.
We bound the mean square of this completed sum over nonzero element rows. At equal completed and row norm scales, the goal is
for every fixed and , with suitable finite orders . Lemma 5.8 below gives the more general estimate that tracks the repeated prime factors of the row.
The reason for the quadratic sieve is already visible for squarefree rows. Take primary, squarefree and good, with , and set . Fix a row sector, a cusp sector, a dual unit , and one integer in the dual support. There are no frozen good local primes in this case. Every prime of enters reflection with exponent one, so for its column factor gives
This identity retains all zeros, and may share primes. The first factor depends only on ; the cusp coefficient and additive character are common throughout the sector. Their coefficient bound leaves the column normalization , up to a constant depending on the fixed . Thus the only arithmetic interaction between the row and the two column indices is the kernel of Lemma 5.5.
On dual dyads , , the reflected kernel has argument comparable to . Its rapid decay permits discarding whole blocks with for any fixed ; the tail argument below makes this restriction uniform when the ramified exponent and the other parameters vary. On the retained blocks, Lemma 5.3 separates the kernel with one common coefficient measure while retaining the actual row annulus. Write for this dyadic piece of the reflected sum. For a retained block, the quadratic norm and the squared column normalization give
Here and give the last inequality. This explains the balanced energy scale. The general argument must also sum the ramified exponents, retain the kernel saving at unequal scales, and treat repeated prime factors of the row. We freeze the prime powers of the row whose exponents are at least two and apply the same quadratic norm to its squarefree residual factor. The next definition records the resulting local terms; the completed-row lemma then sums them.
Definition 5.6 (An unmarked reflected block). Fix , , one of the fixed characters and its common modulus from Proposition 5.1, and put . For the current norm over , freeze a finite set of good primes with exponents . Let range over squarefree primary good ideals coprime to every prime of , in one fixed class modulo and with any further fixed row restrictions. These restrictions are independent of the dual variables. On primary elements prime to set
Every local power retains its zero. In the reflection for , fix , the active or inactive decision at every prime of , and one of the two summands of every Ramanujan factor. All primes of are active and have exponent one. Let be the product of the active primes in .
For each chosen divisibility summand at , use the exact partition
Choose one term. Let be the product of the primes assigned to the squarefree ideal , and let be the product assigned to but not . Write and . In the first assignment only the occurrence in is extracted, even if contains that prime; in the second exactly one occurrence is extracted from . All remaining source restrictions are retained on , . Let be the product of the small summands and the active primes, and put
Empty products have log-norm zero.
Fix a unit , an integer , and dual ranges
where . The squarefree and the primary retain the full source support of Equation (5.2), including permitted primes of and shared primes. Let , and choose a common smooth profile on a fixed compact logarithmic box, where
Choose fixed smooth annular cutoffs for these three ranges, and put
The supports and invoked seminorms are fixed uniformly over the block. Denote by the specified term of the right side of Equation (5.1), restricted to this dual representation and multiplied by . The original row set consists of the allowed for which . This definition is made separately for every fixed choice above.
The frozen primes in this definition may vary between invocations; they are not added to the fixed arithmetic modulus . The definition fixes them only before taking the current norm over .
Lemma 5.7 (Unmarked reflected block). For an unmarked reflected block, set
Let all these log-lengths range over fixed bounded sets. Put
There are functions and , with absolute values at most one, such that is independent of and
The sum retains all the fixed dual restrictions from the definition. The only arithmetic factor here that depends simultaneously on and the dual variables is the displayed zero-extended quadratic symbol. Moreover,
This is an exact identity on the original support, including when shares primes with .
For every and every fixed ,
The constants may depend on the fixed kernel order , the fixed arithmetic data, the bounded log-length ranges, and the fixed support box, but not on the moving frozen local set . Norm twists in have the polynomial cost supplied by its finite seminorms.
Proof. For the fixed and the fixed class of modulo , the class of is fixed. Proposition 5.1 therefore gives one common and one common additive character for the whole row set. Write , so that . The residual local factors are exactly
Both equalities include zeros; no unit symbol has been divided. In particular, any collision with is a restriction depending only on . Every remaining local factor is fixed and depends only on the dual index. The scalar of the reflection depends on but not on .
Define on the specified dual support
The coefficient bound gives . Its denominator is nonzero, and the definition remains valid when the numerator is zero. Using gives the exact factorization
A small Ramanujan factor or an active zero-mask factor contributes . A divisibility factor contributes ; for a prime assigned to it cancels from the squarefree denominator, and for a prime assigned to it leaves after extraction. When a prime assigned to also divides , its entire occurrence in remains in and in . These facts give exactly the common power .
Absorb , the signs of small Ramanujan terms, the bounded fixed local characters, and the fixed dual indicators into . This function is bounded by one and is independent of . Put ; it is bounded by one because . The factor now proves (5.32). Multiplicativity of the norm proves (5.33). It does not use any coprimality between and .
By the definitions of the log-norms,
The finite set of possible depends only on . Consequently . Apply Lemma 5.3 in dimension three and (5.24) to the structural identity. The single density is common to all because uses the row and both dual norms as coordinates. At each Fourier mode the norm powers have absolute value one and can be absorbed into the bounded row scalar and the common dual coefficient. Only now enlarge the positive row norm from to squarefree good with , retaining any fixed restrictions. No kernel estimate is used on the added rows.
Equation (5.28), with , , and , bounds the separated squared norm by
The squared common coefficient in the structural identity has exponent . The square of the extracted profile scalar contributes . Combining these exponents and the dimension-three separation norm proves (5.34). ∎
For later summation, call a dual block retained when
On the fixed support box, Equation (5.33) places the kernel argument in times , for one fixed . If , every unretained whole block has actual argument greater than throughout its support. These blocks can be removed before Fourier inversion with arbitrary power saving when the other log-lengths lie in bounded ranges. Here are the details needed for that uniform assertion.
On the full source support,
After its indicator is discarded, each local factor is bounded by , uniformly in . The product of these bounds has a fixed polynomial size when the active log-norm is bounded. For a fixed row put . Its factor also has a fixed polynomial bound on the stated row and conductor ranges. The finite local choices and bounded row counts have a further fixed polynomial cost; call the sum of these norm-scale exponents . The fixed profile seminorms and their polynomial height costs remain multiplicative factors outside this exponent. It is chosen before the kernel order and does not count discarded dual indices. The remaining dual sum is the unrestricted lattice sum in Lemma 5.4, with . For any , choosing
makes the discarded contribution times a finite seminorm of and the fixed profile bounds. The assertion holds either for the absolute total or, after increasing to include the bounded row count, for the row norm. The dyadic cutoffs have bounded overlap, so this lattice estimate controls their whole sum. In particular no bound on the discarded dual lengths has been assumed.
We finish by summing the reflected blocks for an element row. The following norm observation records the actual support that governs this summation. Suppose an element row has an ideal factorization , with integral factors, and the fixed support constants give
Since , multiplicativity gives
This inequality does not require to have bounded norm, and it need not be an equality. We will use it with the three factors on disjoint prime supports and with the unit residual ideal in the bounded dyad.
Lemma 5.8 (Unmarked completed-row moment). Let range over a fixed finite family of multiplicative finite-ray characters with conductors supported on , all extended by zero away from the primary elements prime to . Fix bounded ranges for and , a constant , and fixed dyadic support comparisons. For a nonzero element , let
be its maximal powerful ideal factor. Use nonnegative centers for its dyadic ranges, with center zero for the unit range.
For every there exist a finite and an integer such that, for every test satisfying Proposition 5.1, every actual -dyad, and all sufficiently large ,
The finite orders, constant, and lower threshold may depend on the fixed arithmetic data, the parameter ranges, , the dyadic support comparisons, and . They are uniform in the element rows and in in the fixed family. The estimate directly includes the Gaussian test; no annular support assumption is made on . Replacing by has at most a fixed polynomial cost in .
Proof. Fix one character . Lemma 5.2, with , supplies a fixed finite family of literal characters for the reflection of . Choose their common before any good row prime varies. Partition the rows into the finitely many unit, -valuation residue, and good-ray sectors from that lemma. This keeps every good local prime, including those whose row valuation is divisible by six.
For a row in the prescribed -dyad, split its valuation-one primes into supported on and the squarefree good product . Thus on disjoint prime supports. Freeze the unit, the actual ideals , and then partition into actual smooth annuli , with and the unit in the bounded zero dyad. Keep this row cutoff in each reflected vector. Equation (5.35) gives
The fixed row restrictions, including coprimality with the frozen factors, are independent of the dual variables.
After the row-sector conversion, take in Definition 5.6 to be the good primes of , with their valuations reduced modulo six. The primes of have exponent one. Fix , a class of modulo , and the local active and Ramanujan choices at the frozen primes. Every active frozen good prime divides to exponent at least two. Consequently
This uses the actual powerful dyad’s upper comparison. The possible -prime factors of only increase its norm.
Apply Equation (5.1) at to the Mellin representation in Equation (5.31). Its dual sum is absolutely convergent. Insert fixed smooth dyadic partitions in the residual squarefree and cube norms, and fix the unit and ramified exponent of the dual index. These operations give the blocks of Definition 5.6 with uniformly bounded seminorms for . No partition of the primal test is needed: the compact profile here is the product of the dual and row cutoffs with the normalized inverse roots, and remains the kernel.
Fix a small . The row lengths , the active length , and lie in fixed bounded ranges. The same is true of , since their prime products divide . The tail argument following Lemma 5.7 therefore removes all unretained whole dual blocks with any prescribed power saving, with a finite seminorm of . Its polynomial cost includes the row and local counts below but not the discarded dual indices. Choose its kernel order first, and increase in the statement so that dominates this tail seminorm and the block seminorm. This is possible because increasing widens the supremum defining and increasing increases its weight.
Write . The source restriction gives . For a retained block,
Since and is bounded, this also bounds every retained dual length. There are only logarithmically many retained choices for the dual annuli and for . Choose a nonnegative large enough to cover the support offsets in Equations (5.37) and (5.38), and to ensure .
The exponent in Equation (5.34) satisfies
To see this, use and discard the nonpositive kernel term. The first branch is at most , since . In the second branch, retention gives , so it is at most . Moreover,
by Equations (5.37) and (5.38). Thus every retained block, with its frozen row parts fixed, has exponent at most
It remains to count the frozen parts and the finite expansions. Every powerful ideal is uniquely with squarefree: at a prime, the exponent of is the parity of the powerful exponent, and an odd positive exponent is at least three. Ideal counting and therefore give
The squarefree is a divisor of the fixed radical of and has only finitely many choices. The local branches at the good primes of have divisor-bounded multiplicity, as do their Ramanujan assignments. Rowwise divisor Cauchy and then summation of the local choices cost an arbitrarily small power of . The choices of , fixed ray sectors, and units are finite, and the actual row and retained dual annuli cost only powers of . This counts the powerful contribution exactly once.
Choose and the local small-power losses within the prescribed allowance. Then increase the fixed-data threshold for so that the terms lie within that allowance. The block bound, the preceding counts, and the already chosen tail saving prove Equation (5.36). The twist assertion follows from the norm-twist bound for in Proposition 5.1. □
For clarity about the test used at equal lengths, put
It satisfies the hypotheses of Proposition 5.1 directly, has , and has finite for every finite . Thus the preceding lemma applies to it without an additional annular extension. At its exact Mellin form is
In the defining sum the coefficients remain normalized by ; the scale occurs in .
Finally take . The exponent in an actual -dyad is . The nonnegative -dyads are logarithmically many, and their unit dyad is included. Summing them, with a smaller preliminary loss, gives the equal-length conclusion for every admissible :
The base probe and its balanced low estimate
We now place the completed sums of the preceding section inside one average . Its original representation separates into an additive polynomial and a completed theta row. At the balanced scales , their mean-square estimates give the direct bound . We first define the average for independent positive scales ; only the final proposition in this section specializes them. The next section applies Poisson summation to this same average and identifies the reciprocal of the target -function in its principal row.
Definition and separation of the two factors
Choose a finite ray group , independently of the target character, through which the functions , , and the fixed primary and supplementary phases supported over in Lemma 4.4 factor. The target-dependent fixed-numerator characters below need not factor through . For a finite-order Hecke character , write
Use one excluded set for the finite family . It contains the primes over , the prime supports of the defining moduli of the fixed zero-extended presentations of and the characters in , and every prime of norm at most a fixed . These full presentations belong to the fixed arithmetic data. They are fixed before and the varying row and prime parameters are chosen. Enlarging will not change .
The finite transform should exclude frequencies meeting , including zero, and should leave coefficients that factor prime by prime. The following character and phase corrections arrange these two properties.
Let generate the squarefree product of the primes in . Choose a residue character modulo whose restriction to each prime factor is nonprincipal and whose order divides six. Such a choice exists: at a prime of odd residue characteristic one may use the quadratic character, and the residue field at the prime over has order four and has a character of order three. The Chinese remainder theorem makes primitive modulo . All residue characters below are extended by zero on nonunits. Put
Finite character orthogonality at each prime gives . By Lemma 4.1, the fixed-numerator symbol is a finite ray character whose conductor is supported on . Thus is a fixed finite character for this target, although it need not factor through .
The primitive character at the primes in will force the Poisson frequency to be prime to . The accompanying normalizations cancel the unit factors introduced by the auxiliary modulus . For the completed index , the factor cancels the cross-prime reciprocity phases between and , while cancels the remaining pair phases within . We verify these cancellations coefficientwise in Section 7.2.
Define the corrected row at spectral parameter by
Here and below the ideal variables avoid . In particular every factor in is evaluated on a unit. The value is the finite-ray extension in (4.5), also when is not squarefree.
Fix nonnegative, nonzero functions and put . Define
The masks in this definition remove nonunits at . All sums in Equation (6.1) are absolutely convergent on the displayed line; the and sums are finite because the weights are annular.
The fixed finite Fourier expansion of the correction is
Parseval and Cauchy–Schwarz give . For a ray class choose a representative and put
Extend by zero away from the primary elements prime to , without evaluating there. The function here is the completed product in Equation (5.1), with its original zero masks. Since for , the displayed Mellin integral of the corrected row equals throughout that class.
For , the central Mellin identity (5.31) gives the direct specialization
The characters form one fixed finite family whose conductor and defining-modulus supports are contained in . They need not factor through . Their original zero extensions are those in the completed-row moment, so that estimate applies directly to this family of row sums. The triangle inequality in the row Hilbert space costs only the fixed factor . The row-sector conversion used by that estimate retains the zeros at shared good primes, including when a row valuation is divisible by six.
Write . Choose a smooth compactly supported function on equal to one on every value of that can occur on the support of . For , set
Our Mellin convention for is . Since , Mellin inversion gives the exact identity
The omitted term vanishes by the annular support of . The factor has absolute value one. In , the arithmetic coefficient is fixed and bounded independently of ; all dependence on occurs in a norm power of the annular variable.
The Gaussian has Mellin transform and satisfies the reflection hypotheses directly. Thus Lemma (5.8) applies without an annular decomposition of this test.
The balanced low estimate
For the balanced estimate, the completed-row moment already bounds the mean square of . It remains to bound the additive factor . Its Gauss expansion gives distinct reduced fractions in ; their separation and coefficient mass give the required mean square. The planar additive large sieve is classical; compare Huxley’s multivariable and number-field inequality [19] and the Poisson proof in [1 Section 3, Theorem 3]. We include the lattice proof to record the normalization used here.
Lemma 6.1 (Planar additive large sieve). Let , let , and let be a finite set of points in satisfying
Then, for arbitrary complex numbers ,
The implied constant is absolute for the lattice, additive character, and self-dual measure fixed above. A fixed multiple of in the row ball is allowed by changing this constant.
Proof. The assertion is immediate when . The characters are well defined on by self-duality. Choose representatives in for the other cases. We use the Fourier transforms
Choose a nonnegative of integral one, supported in a sufficiently small disk about zero. Since , its support can be chosen so that
Thus is a nonnegative Schwartz function and on the unit disk. If , Fourier inversion and the product formula, with convolution taken with respect to , give
In particular, is bounded and supported in a disk of some fixed radius . This is the bandlimited majorant we need.
Put . Positivity of first gives
All sums on the right converge absolutely. For any , the Fourier transform of at is . The factor is the Jacobian of the real two-dimensional dilation; no lattice-volume factor occurs because has covolume one on . Poisson summation therefore expands the right side as
For each fixed , a term in the inner sum can be nonzero only if the lift lies within distance of . The set of all lifts is -separated in . Distinct classes have this property by hypothesis, and two distinct lifts of one class differ by a nonzero Eisenstein integer, whose absolute value is at least one and hence at least . The disks of radius about lifts in a disk of radius are disjoint and lie in the concentric disk of radius . Comparing their Euclidean areas bounds the number of these lifts by
The same bound holds with and interchanged. Taking absolute values in the Poisson expansion, using the fixed bound for , and then using , we obtain
Since , this is the asserted estimate. Replacing by a fixed multiple proves the final statement.
We apply this estimate to the full residue classes in the Gauss sums. The zero extension of the character is important here: it makes the fractions reduced with respect to the displayed modulus, not merely with respect to an inducing conductor.
Lemma 6.2 (The balanced additive norm). Fix the arithmetic data of the probe, the annular weight , a ray class , and a row-ball constant . For and every real , the polynomial satisfies
The bound is uniform in . In particular, when ,
Proof. For a primary outside , put and
The inverse is evaluated only on these elements prime to . Here , , and , because is supported on . Thus . The definition of and the Gauss expansion give the exact identity
The sum is over primary ideals outside . For every such , the character is zero exactly when , and has absolute value one otherwise. This includes nonsquarefree : a local exponent divisible by six is the indicator of the units at that prime, not the constant function one. For the single residue class is included and .
We verify that the fractions for the contributing pairs are distinct modulo . Suppose that and . Then is divisible by . Reducing this divisibility modulo and using the inverse of modulo gives . The symmetric argument gives . The primary generator of an ideal outside is unique, so ; the original congruence then gives (mod ). The same conclusion includes the unit modulus. Changing a residue representative only translates its fraction by an element of .
Let be fixed with . For two distinct contributing fractions and every , the Eisenstein integer is nonzero. Hence
The last inequality uses . Thus these fractions are -separated in , where .
Writing the expanded polynomial as , with only the unit residue classes retained, its coefficient square mass is exactly
There is no dependence on in this expression. Since , on the support, and there are ideals with , this mass is . Lemma 6.1, applied to the points with separation , now proves the first bound. Finally , so implies , proving the second.
The additive norm now has precisely the scale needed to pair with the unmarked completed-row norm. The following proposition performs that pairing for the original probe.
Proposition 6.3 (Balanced low estimate). Fix the arithmetic data and smooth weights used to define . For every , as ,
The exponent is independent of the target character; the implied constant and lower threshold may depend on its fixed arithmetic data.
Proof. Set and . The function in Equation (6.2) is bounded and supported in a fixed compact subinterval of . Thus all rows in that identity lie in for a fixed constant .
The specialization of Lemma 5.8, followed by the finite ray decomposition defining , gives for every
Indeed, is fixed, so the row ball is a fixed multiple of the ball. The completed scale is , which is in that lemma. The lemma applies directly to the Gaussian profile in the completed integrals defining ; the fixed finite Fourier sum over ray characters costs only a fixed factor by the triangle inequality in the row Hilbert space. In particular this application retains the original row zero masks.
Apply Cauchy–Schwarz to the row sum in Equation (6.2). The factor has absolute value one, with its zero extension, and is bounded. Lemma 6.2 is uniform in , while is independent of . Since is smooth and annular, . The finite sum over therefore gives
Taking proves the proposition. ∎
The Poisson representation and its Euler factors
The direct estimate is now available. To compare the probe with the Mellin signal in Proposition , we return to independent positive scales , , and apply Poisson summation in the element variable . The resulting rows are indexed by the sixth-power-free part of the frequency. We will factor each row into Hecke -functions and a holomorphic Euler product; the row will contain the reciprocal of the target function.
The exact Poisson series
The correction is independent of , and the varying character in the completed row is precisely , including its zeros. Consequently Poisson summation uses the full modulus , even if and share primes. Expand the -Gauss sum and first sum the lifts of a residue modulo . The lifts impose and give the coefficient
Indeed, the finite Fourier transform of modulo is . The Poisson prefactor for the row scale is . After the outer square-root normalization in Equation (6.1), leaving its separate outside, their product is . This also verifies all factors of in the transformation.
At the primes of the primitive Gauss sum vanishes unless . It therefore also removes . Every remaining element has a unique expression , where is a sixth-power-free element, including its unit factor, and is the primary generator of an ideal. Write for the sum over such nonzero with .
Let be the planar Fourier transform of for the self-dual measure and character fixed in Section 4. The radial Fourier argument after Poisson is . Put
Smoothness at zero and Schwartz decay show that is holomorphic for . On every compact positive real strip it has arbitrary polynomial decay in : every derivative of is integrable in , uniformly on that strip, so repeated integration by parts applies. The same argument gives arbitrary polynomial decay for on every fixed real strip.
We will need the strict positivity
Here is a proof that does not require the Fourier transform itself to be nonnegative. For ,
The pairing of the left side with is absolutely integrable. Fubini and Fourier duality express it as
The inner integral is strictly positive for every , since is nonnegative and nonzero. Absolute integrability follows either from the displayed representation on the Fourier side or from the annular support of on this side. Polar integration identifies the original pairing with , proving Equation (7.2).
Set after Mellin inversion of the two weights. For a nonzero sixth-power-free with , define
where and the coefficient, with all normalizations retained, is
For convenience define the common Mellin weight
For example, the lines , , correspond to the original line and lie in absolute convergence. The complete high identity is
One may justify all interchanges on these lines by the elementary bound and by the annular weights. In particular, Equations (6.2) and (7.5) are identities for the same probe, not estimates for separately chosen test expressions.
The scalar Euler identity
We next evaluate the coefficient in Equation (7.4). Our objective is to prove that the high series is a scalar Euler product for the target . The calculation also records separately the terms with positive valuation of the completed index at a given prime. We keep every ray phase until it has been cancelled or assigned to a local factor.
Fix a nonzero sixth-power-free row with and a prime . Set
The values , , have absolute value one, and . No ray-class restriction on is imposed.
The finite scalar and its unit factors. Write , with , and for . For and , summing the lifts of a residue modulo gives
The second line is the Ramanujan sum for the principal character extended by zero. Orthogonality also gives .
Let , , , , and , so . The part of Equation (7.1) at , before its unit factors are restored, is
At modulus one both factors in this formula mean one. Its complete evaluation is
For and , the congruence fixes modulo , whose zero-extended character is nonzero exactly when . For the fourth line the congruence first forces . Expanding the inner Gauss sum, the sum over is
which changes the Gauss character from to . If and , the permitted lifts do not change , but their Gauss phase is with the Gauss variable a unit. Their sum is zero. This proves Equation (7.8), including the cases where the Gauss character is principal and zero-extended.
For the original units write , , and . Chinese remaindering and the substitution give the additional unit factor
More explicitly, the outer residue character gives , while the Chinese remainder factor and the rescaling of the Gauss argument give . Their product is Equation (7.9). Since , one has .
At the primes of , one has . The local factor in the complete Gauss sum is . Here because . This cancels every displayed factor in Equation (7.4). The product of the last factors in Equation (7.9) cancels . This cancellation is coefficientwise. For any fixed enlargement of , the same calculation uses the same ray group .
Cancellation of the remaining pair phases. With and , reciprocity at each pair of distinct primes gives
Indeed, for the two orientations have opposite symbol exponents, and their quotient is ; this cancels the corresponding pair in the bicharacter . Only its diagonal remains. Equation (4.7) gives . The Chinese remainder formula
removes the squarefree part of the remaining pair product. If and , its exponent at a pair is . The cube of is , whose square is one. Thus the pair product left after this division is
The equality follows by expanding the quadratic refinement Equation (4.5) on the prime factors of . The same refinement gives , which is cancelled by the inserted . Finally Equation (4.6) gives and . These identities account for all pair phases, with no restriction on the ray class of .
The coefficient in Equation (7.4) has therefore separated into prime factors. In absolute convergence, its factor at is the series
Let be the same sum restricted to , equivalently to positive valuation of the completed index .
Lemma 7.1 (The complete local identity). For every nonzero sixth-power-free with and every prime , the factors just defined are
where the six values of are
| 0 | |
| 1 | |
| 2 | |
| 3 | |
| 4 | |
| 5 |
Put and , with the original zero extension at , and define
Then the series in Equation (7.3) has the scalar factorization
Write , , and . For every fixed , the correction product converges normally on a neighborhood of every point in each of the following regions, and hence defines a holomorphic function there:
Uniformly in imaginary parts and unit phases, , with the constant also depending on in the first region. For in the second region, with, for example, . Equation (7.13) begins in absolute convergence and supplies a meromorphic continuation through these regions.
The first region will contain the buffered contours for nonprincipal rows, including the reflected numerator line. The second contains the principal residue point , and the contours used to reach it.
Proof. There are four families with : , where . In each family, increasing by one and the first permitted by one multiplies the summand of Equation (7.10) by . In fact the phase ratio is : the remaining ratio is one because , , and . Increasing further multiplies a summand by .
For transparency, the following table lists every nonzero summand after division by . In its first row is arbitrary; all other conditions are as displayed. Every omitted case is zero by Equation (7.8).
Here is a direct check of its entries. In the first family . For , the principal Gauss lift is for ; its extra boundary value at is . For , the product allows only . These give the first three rows. In the second family . For the nonprincipal equality gives the fourth row. For , the principal Gauss lift has its negative boundary at , giving the fifth row, and its value for , giving the sixth row. The latter condition is exactly .
For the two odd families and . Their lines require and their lines require . The phase reductions are
The first is Equation (4.7) at ; the second follows from the first and . Substitution gives the last four rows, including both terms. Thus the table covers all five ramified valuations as well as .
Summing gives , and the two unbounded ranges give . These sums are precisely the formula for in Equation (7.11). If , then . The terms give , while the terms require and give . This proves the formula for as well.
It remains to justify the analytic assertions, especially where is negative. Put . The contribution from is , so an exact simplification gives
This expression has no denominator. At , where , it reduces to . In both stated regions , , and , uniformly away from one, so these are holomorphic local expressions.
For and , the row gives
In the first region and . The extra factor in Equation (7.17) therefore leaves this contribution at most . The term is at most ; the other terms in that equation are smaller. For , the strict second-family term has exponent . The closest other exponents in the table are
and all remaining ones are no larger than . Consequently, with ,
In the second region the same comparison gives the stronger bounds
The closest good-prime term here is , and the closest ramified term is .
The sum over primes not dividing converges normally, and the finite product over primes of is by the divisor-product bound. The estimates are uniform in all imaginary parts and unit phases. When , the good-prime tail above is by the ideal count, which implies the asserted estimate for the product. Finally extracting at every prime gives Equation (7.13). The normal convergence of the remaining product proves its claimed continuation.
For , Equation (7.13) contains , and its numerator has the two principal factors and . Their residues will produce the target Mellin signal. For intermediate row norms, the next section assigns one zero-free rectangle to the finite family of twists associated with each row and produces simultaneous polynomial witnesses from a selected zero. The principal and bounded rows, together with the outer norm ranges, are treated in Section 10.
A zero detector with saturated witnesses
The high expansion contains a sum over sixth-power-free rows . We associate each nonprincipal row with a buffered zero-free rectangle for the finite family of character presentations that it determines. Whenever the resulting bin lies above a fixed floor, a zero produces an inverse polynomial and a plain polynomial with simultaneous lower bounds. These witnesses can then be counted using different mean estimates. The analytic inputs here are Lemma 4.9, the smooth calculus of Lemma 4.5, and the global growth estimate in Equation (4.14), together with the deleted Euler-factor bounds of Lemma 4.10.
Throughout this section, assume , where is the global supremum in Equation (2.1). This setting does not select either of the two boundaries in the continuation criterion.
Buffered rectangles and pointwise bounds
Fix the arithmetic data independently of , as in Section 4. In particular, the finite group
contains the target and the fixed ray twists used in the high-row family, and every conductor prime of a member of belongs to . For a sixth-power-free element , define the finite collection of presentations
At a nonunit the value of , like every other power of the symbol, is zero. The group property of shows that is closed under conjugation. It contains the numerator character , the denominator character , and every zero-extended presentation obtained by multiplying either orientation of the sextic symbol by a member of .
Let be the primitive character inducing a presentation , and let be its conductor norm. Reciprocity and the fixed conductor primes give
The radical of the deleted product has norm . These identities retain the original zero extensions; in particular, they do not replace a row-dependent mask by an independently chosen mask.
If at a prime , the local character of on units at has order . A character in is unramified there, so it cannot cancel this local character. Consequently a presentation in can induce the principal character only when is supported on . There are finitely many such sixth-power-free rows, including unit factors. Remove them for the present detector; each application must estimate these bounded physical rows separately.
Fix and write , where . The rows in the present dyad satisfy , with fixed comparison constants. Let
The value of will be chosen after the fixed height orders are known. For now it is fixed independently of . In particular .
Lemma 8.1 (Buffered zero-free bins). For every retained row , there are an index and a grid point
with the following properties. For , set
Then
If , some has a zero with
For every , every , and sufficiently large , uniformly in the retained row,
On the reflected line in the same height range,
where depends only on the fixed real strip and the field. There are possible pairs , independently of the row and its conductor.
Proof. Each maximum exists: the collection is finite, the zeros of each nonprincipal primitive -function are discrete in compact rectangles, and absolute Euler convergence excludes zeros with real part greater than one. The sequence is nondecreasing and lies in . If every one of its increments exceeded , then
which is impossible. Choose an index with , and round down on the stated grid. This gives the two inequalities. When , the maximum is attained by an actual zero, giving . This reasoning allows a zero on the line one.
For , the closed disk centered at with radius has real part at least . Its radius is less than , so every point in it has imaginary part of absolute value less than . The bound therefore excludes every zero of every primitive function in this disk. Lemma 4.9 controls the concentric disk of radius . Apply it with center , and use absolute Euler convergence farther right. Since and , the arbitrarily small power in that lemma can be chosen so that its contribution is . The estimates for polynomial-size deleted Euler products following that lemma supply the other .
For the last assertion, the primitive functional equation recalled in the proof of Lemma 4.8 [11 Equation (1.1)] relates the value at to the conjugate primitive function at . The conjugate presentation is in . The conductor and gamma quotient contribute at most
The reflected primitive value has an arbitrarily small -power by the preceding disk bound. Finally, , so the upper bound for the deleted product is , after reducing the preliminary losses. This proves the reflected estimate. The ranges of and give pairs.
We call the bin of the row and put
Every primitive character inducing a presentation in is a finite-order Hecke character. The definition of , together with , therefore gives . In particular, the bin satisfies the exact inequalities
The bin will be bounded by the trivial row count. For , the zero in Lemma 8.1 produces large polynomials to which the moments can be applied.
Lemma 8.2 (Pointwise dyadic estimates). Fix bounded nonnegative ranges for , , and let
denote the polynomials of Equations (4.2) and (4.1), now at base . Suppose , the untwisted profiles have uniformly bounded smooth seminorms on a fixed annulus, and any pure norm twist has height at most . All additional Mellin frequencies entering the same -argument are required to have total absolute value at most .
For every , there are , depending only on and the bounded length ranges, and a finite height order , uniform in the moving rows and profiles, such that, when
the following estimates hold for sufficiently large :
The external tail order may be chosen after the positive number . It does not change .
Proof. We spell out the height restriction because a full infinite contour shift would not be justified by the bin. For a fixed annular , a bounded real number , and a pure twist , Mellin inversion on a line gives
Here is the Mellin transform defined in Lemma 4.5. The twist occurs in the -argument, not in the transform whose tails are estimated. Shift only the portion with added frequency at most the assigned fraction of to . The horizontal joins and the shifted portion remain in the zero-free rectangle of Lemma 8.1. Its bound gives for the central portion.
Leave the remaining tails on the absolute line, which we may take to be . There the reciprocal Euler product is absolutely bounded. On the inverse joins the reciprocal remains inside the buffered rectangle. Since the real join interval and the length range are bounded, the remaining arithmetic and scale factors on a join are for fixed chosen before the external tail order. The pointwise Mellin bound in (4.11), applied on that compact real interval with derivative order , bounds each horizontal join by . The separate vertical tails have the same bound by (4.10). Both estimates apply to the untwisted profile, uniformly in the stated family. Because , , and all lengths lie in a fixed bounded interval, a sufficiently large fixed makes these errors smaller than the claimed bound. Taking and small in the prescribed proves (8.1).
For the plain polynomial the same calculation uses instead of its reciprocal. Shifting to gives
Alternatively shift its central portion to . The function is entire because the row is nonprincipal. The reflected estimate of Lemma 8.1 gives
The joins here need only the global upper strip bound and the negative-strip bound for the deleted product, since no reciprocal is present. These give fixed as above, so the pointwise Mellin estimate bounds the joins and the integrated Fourier estimate bounds the absolute-line tails. Taking the better central bound, choosing to dominate also the possibly negative exponent when , and using the displayed height hypothesis proves (8.2). A primitive conductor smaller than reduces the reflected conductor factor. The original deleted Euler factors have already been included in Lemma 8.1.
There are only finitely many separated variables in any one -argument. Assign each a fixed fraction of the single allowance; do not assign that allowance anew at successive shifts. The profile windows and the finite height orders used in the row estimates are fixed before . Lemma 4.5 differentiates only the untwisted separating profiles when increasing , which proves the last assertion.
Simultaneous saturated witnesses
At a selected zero, the truncated-inverse construction below produces a product with squared size at least . The pointwise estimates bound the same product by . Since , these two bounds force . Each factor then attains its own pointwise exponent up to the prescribed loss; this is the saturation asserted in the next proposition.
Proposition 8.3 (Two saturated witnesses). Let have a bin with , and assume the loss and height hypotheses of Lemma 8.2. For every , and every prescribed , after reducing its preliminary losses, there are , a zero as in Lemma 8.1, dyadic lengths , , and two polynomials for the common row character such that
Their lengths and individual values also satisfy
The constants in the terms are absolute on the stated parameter ranges. Both polynomials have the same twist height , where for a fixed chosen within the cumulative frequency allowance. Their untwisted profiles form a uniformly smooth annular family. For each row, both witnesses use one presentation , selected by a label in the fixed finite set . The presentation itself varies with . The dyadic pair can likewise be selected separately for each row from possibilities.
Proof. The truncated-inverse and Gamma-integral construction is a form of the classical zero detector; compare [21 Appendix C] and [14 Section 13.1]. The buffered row-dependent rectangle and the simultaneous lower bounds needed here are established below. Choose the zero supplied by the bin and set
Let be a fixed smooth function equal to one on and zero on . Define
The row character is nonprincipal, so is entire. Moving the line to crosses only the pole of at zero, and its residue vanishes because . The global strip bound in (4.14), together with the deleted Euler factors, bounds the new line by
Indeed , so the deleted product has an arbitrarily small -power; the deliberately weaker includes the primitive conductor bound. The finite polynomial is bounded by the displayed power of using the ideal count. Finally, the fixed polynomial in the added height is integrable against , since . Uniformly for ,
Thus . This Gamma integration uses only global upper bounds and consumes no reciprocal height allowance.
On the original line, absolute convergence and the Mellin formula for the exponential give
For , the coefficient of is . For it is one. When , . Consequently insertion of removes exactly the unit contribution . The resulting tail has absolute value . Multiplying it by a fixed smooth terminal cutoff equal to one for and zero for changes it by ; this follows from , exponential decay, and the ideal count. Partition , by a fixed smooth dyadic partition. There are relevant pairs, and their support satisfies
With , , the profile for a pair is
where is a fixed annular cutoff equal to one on the product of the supports of , and
Every fixed logarithmic derivative is bounded uniformly in . On a cutoff transition its argument is bounded, and a logarithmic derivative of the exponential is a polynomial in its argument times that exponential. Logarithmic Fourier inversion therefore gives
for every fixed . The coefficient -norm on the full line is also uniformly bounded. Trivial bounds for the two finite polynomials have a fixed -power because their lengths are bounded by . After is fixed, choose so that the discarded Fourier tail is .
The absolute value of the remaining sum of integrals is bounded below by a positive constant. The number of dyadic pairs and the uniform -norm show that, for one pair and one , the product of the two unnormalized blocks has absolute value . Both profiles have the same height :
The first extra cutoff remains part of the inverse annular profile and creates no second frequency. Removing the factors and by central normalization gives
for sufficiently large . The support inequalities give the two length bounds in Equation (8.3). Apply Lemma 8.2 to these profiles, choosing its loss smaller than the present . Comparison of the product lower bound with the two upper bounds gives
Since , this implies with an absolute constant. The support inequality then gives . Dividing the product lower bound in turn by each individual upper bound gives the two individual lower bounds in Equation (8.4). Only the dyadic support errors are ; all other losses are arbitrarily small fixed powers. Lemma 4.5 permits the stated rowwise choices with a fixed polynomial height factor.
A sextic-sieve row count
The zero detector supplies a large inverse polynomial for each row above the floor bin. We now turn that lower bound into a count of physical rows. We first prove the required squarefree sextic large sieve in the primary convention, using the norm-recursion method of Blomer, Goldmakher, and Louvel [4 Section 3]. We then fix the part of a physical row whose prime valuations are at least two and apply the sieve to its squarefree factor. The size of the fixed part also gives an independent upper bound for the number of rows; the better of the two bounds produces the required exponent.
The sextic large sieve in the primary convention
We continue to use the fixed finite set of prime ideals, containing the primes above 6 and all fixed conductor primes. All ideal indices in the next lemma are prime to and are represented by their primary generators. In particular, “squarefree” refers to ideals of , not to their rational norms.
Lemma 9.1 (Sextic large sieve). Let , let , and let be any sequence of complex numbers indexed by the squarefree ideals outside . The sequence is fixed independently of the row . For every ,
Every symbol in this formula has its original zero value on a nonunit. A fixed restriction of the row set is allowed. A fixed restriction of the coefficient support is allowed by extending that coefficient sequence by zero. Such a restriction may depend on an object fixed before the row sum, but the coefficients may not otherwise depend on .
Proof. We follow the higher-order large-sieve recursion of Blomer, Goldmakher, and Louvel [4 Section 3], giving the local verification for the present primary normalization. In the finite Fourier calculation the individual residue characters act on elements; their unit-trivial quotient is the character on ideals to which we apply Poisson summation.
For good ideals , represented by their primary generators, put
This uses the original zero-extended symbol, also when is not squarefree. It is multiplicative in both and . In every power below, including a multiple of six, a nonunit still has value zero. For let
For a sequence supported on write , and define
An empty support gives norm zero. These norms include all finite ray classes. We will prove the symmetric bound for ; the matrix in the lemma is its transpose with the two lengths exchanged.
The squarefree norm is our target. We also need , since Poisson summation produces arbitrary evaluation ideals. Opening the square in its defining sum and pairing the column characters will replace a row length by a dual length of order . A power decomposition then returns the unrestricted row sum to squarefree norms. It selects either the first-power or the second-power factor, so the exponents are kept together: this set is closed under (mod 6). We will use this cycle to improve a provisional exponent in the bound for .
The paired summation formula. Use the fixed finite group
The primary normalization identifies these with the ray classes modulo : each unit orbit has a unique representative equal to one modulo 3. In particular is multiplicative. This subdivision is fixed, since the primes above 2 and 3 belong to .
For a global unit and a good prime , reduction modulo gives . Since , multiplication over the prime factors of gives
The exponent is read modulo six: expanding a product of integers proves the equality of exponents. Thus equal -classes have the same restriction to the six global units. They also have the same residue modulo 4, which controls the reciprocity factor of Lemma 4.4.
Let be coprime squarefree good ideals with and let . The raw character on elements
is trivial on global units by Equation (9.2). It therefore defines a finite-order ray character on ideals by
For fractional ideals prime to , the residue symbols are evaluated on local unit fractions; the same unit cancellation makes this definition independent of the generator. At each good prime the sextic residue character has exact order six, since the residue multiplicative group is cyclic. Hence its powers and are nontrivial. CRT shows that has raw conductor , and the ray character has the same conductor: omitting a prime would contradict this nontriviality by varying only its residue. It is extended by zero on ideals meeting . For the pair define to be principal.
Sextic reciprocity, with its factor fixed by , gives for every good ideal
For coprime inputs the two reciprocity factors cancel; on the other inputs both sides are zero. With the Gauss sums already defined in the arithmetic preliminaries, CRT using gives
where depends only on the common class. Every here has modulus one by prime Gauss orthogonality and CRT. Formula (9.4) retains itself, including its factor at under conjugation.
Choose once a nonnegative with on . For the Fourier transform and self-dual measure in the arithmetic preliminaries, put and define by
The transform is radial, smooth at zero, and rapidly decreasing. Thus
Here denotes the Mellin transform. The second assertion follows by integration by parts in the Mellin integral; all logarithmic derivatives are bounded at zero and rapidly decreasing at infinity. Scaling the Fourier transform gives for .
For , finite Fourier inversion for the primitive raw character is
For a nonunit the left side vanishes because one nontrivial local character is summed against the trivial additive character. For the stated and , the trace pairing on the basis has matrix , of determinant , and the -covolume of is one. Thus the dual of is , while the covolume of is . Coset Poisson summation, followed by division by the six generators of each ideal, therefore gives
Both sums here are over all nonzero integral ideals. The division by six uses unit-triviality of and radiality of the weight. The zero frequency vanishes since this character is nontrivial. Poisson transformation of the squared norm. For supported on one -class in , set
We claim, for every ,
The maximum runs over dyadic shells and is zero if empty. If , only the unit good ideal can occur and the annular ideal count proves the term. Also when is below a fixed positive constant, because has a fixed upper support endpoint and nonzero ideals have norm at least one.
Suppose and normalize . Then every pair in is nontrivial and . Apply Equation (9.6) and take the triangle inequality over the dual ideals. For a small put . Cauchy gives . By Equation (9.5), the part with is, for any , at most
The same bound holds if the cutoff is below one. Taking large makes this an arbitrary negative power error.
In the remaining sum write , with good and supported on , and choose one generator for each fixed . Equations (9.3) and (9.4) give the separated factors
All have modulus one. Split into shells , where , and insert Mellin inversion for on . Apart from a bounded factor depending on , , , the two coefficient sequences are
They are fixed across the sum and have absolute values . Detecting by Möbius inversion and applying Cauchy in gives
Here the divisor bound absorbs the sum over . Conjugating the entire first polynomial uses the same norm. The factors with have just the unit evaluation ideal and satisfy . There are only a fixed power of choices of and of the dyadic shell, because is fixed and a nonzero has bounded below. Equation (9.5) integrates the variable. Choosing sufficiently small in terms of proves Equation (9.7), including the allowed global loss on its term.
We now apply this paired estimate to . Partition its inner sum by , insert , and open the square. Write the two squarefree indices as , , where is their gcd, , and . Their residual classes agree because is multiplicative. Index multiplicativity and Equation (9.3) give on every good
Let . Möbius inversion for writes with . Choose one generator of each fixed . The value of at separates as , so the common residual sequence is
It is supported on in one class. Apply Equation (9.7) with lengths and . The summed coefficient mass is at most
Writing and , we have and . We obtain the recursive interface
The maxima may be restricted to nonempty ranges. This is the combination of the gcd and Poisson steps in [4 Lemmas 3.2–3.3]]; every sequence used here is common within its norm sum, and remains fixed.
The initial and power bounds. Row inclusion gives . Hilbert space duality and sextic reciprocity, splitting one matrix variable by its finite -class, give
The phases are unit-valued and the noncoprime entries are zero in both orientations. We also have the initial estimate
Indeed, for the squarefree row , finite Fourier inversion gives on every , including nonunits,
Cauchy costs at most . The reduced fractions from are distinct modulo and separated by at least : a nonzero numerator of has absolute value at least one, while ; equality modulo forces the same primary denominator and residue. The dual of Lemma 6.1, with the coefficient generators in the ball , proves Equation (9.10).
We need the following near-monotonicity, also used in the large-sieve recursions of [13 Lemma 4.4 and Remark 5]] and [4 Lemma 3.1]]:
Here is a direct verification. The assertion is immediate for a zero norm. Otherwise choose a maximizing unit coefficient vector for , and split the row shell at ; one part carries at least half its mass. Put . For the first part use good prime ideals of norms in , and for the second use norms in . Then when . The fixed-field prime ideal theorem supplies such primes. An ideal of norm at most contains at most of them. For and , multiplicativity gives
The first coefficient is zero at and cancels the factor at otherwise. Squaring and summing over the chosen rows and primes gives
For the stated threshold with sufficiently large, , proving Equation (9.11).
We finish with the power decomposition and recursion of [4 Lemmas 3.4–3.5]]. Suppose, simultaneously for , that for every positive loss
for ; the unit shells satisfy the same bound directly. The initial estimate gives this with . Write a good evaluation ideal uniquely as
where are pairwise coprime and squarefree, and is arbitrary. Insert and put ; here and . Choose with . After the other factors are fixed, the coefficient
has absolute value at most , and the remaining kernel is exactly that of . Enlarging its fixed positive row restriction gives this norm bound. This includes the zero of the sixth power factor. The set is closed under . Counting the fixed ideals and forgetting their coprimalities in positive sums gives
To verify the factor, the number of fixed choices is . For it is at most a constant times both and ; for it is at most a constant times . The number of boxes is a fixed power of .
Substituting Equation (9.12) into Equation (9.13) yields
The three terms before simplification are bounded by , , and ; the last is bounded by one of the first two according as or . Use this estimate in Equation (9.8). All auxiliary nonempty scales are bounded by fixed powers of : here and . The unit column shell satisfies the same estimate directly. Thus preliminary losses can be chosen smaller to give any specified final loss. The two scale factors are
Consequently, for ,
Put and . If , the middle term in Equation (9.14) is at most . If , apply Equation (9.11) with a fixed multiple of in place of . Equation (9.14) there gives , since and . Thus in both cases
Symmetry gives Equation (9.12) with in place of , simultaneously for every . Starting from , the map decreases to . For a requested loss take finitely many iterations until the remaining exponent gap is smaller than a fixed fraction of that loss, and absorb it into . Combining the bound and its symmetric form, using when and the analogous inequality when , proves
Dyadic subdivision of both norm balls, with Cauchy across the column shells, converts Equation (9.15) to the same bound for the ball matrix with entries . The logarithmic factors are absorbed by a smaller preliminary loss, and the unit shells are bounded directly. The matrix in Equation (9.1) for is the transpose of this matrix at lengths . A complex matrix and its transpose have the same operator norm, by the adjoint identity followed by whole-vector conjugation. The bound is symmetric in the two lengths, so it gives precisely . Conjugating the entire inner sum gives , with unchanged zeros. Finally, a fixed row restriction removes nonnegative terms, and a fixed coefficient restriction is imposed by zero extension. This proves all assertions of the lemma.
Physical rows and their inverse witnesses
With the sieve proved, it remains to apply it to the detector witnesses. We apply the lemma only to a squarefree factor of the physical row. The separation of squarefree and powerful row factors is also used in the proof of Corollary 1.4 of [4]; here we keep the actual norm of the powerful factor because it controls both the moment and the number of rows.
Proposition 9.2 (Sextic-sieve row envelope). Fix the arithmetic data , the bounded physical range , and the height and loss hypotheses of Lemmas 8.1 and 8.2. Put and retain the notation of those lemmas. Let be any set of retained sixth-power-free element rows with , all in one bin with . Put , so .
For every , after reducing the preliminary losses in Proposition 8.3, for all sufficiently large ,
The finite order is uniform in the physical dyad, the bin, and all moving rows. It may be fixed before the positive exponent in is chosen. The estimate is valid for each fixed retained tuple of external parameters and for the original row restrictions. The implied constant may depend on the fixed comparison constants and finitely many of the shared profile seminorms. The rowwise profile choices are precisely those permitted by Proposition 8.3 and Lemma 4.5; no arbitrary row-dependent coefficients are allowed.
The floor bin is excluded from the witness assertion. For that bin the elementary bound applies; it agrees with the numerical value .
Proof. Fix a small preliminary loss . Apply Proposition 8.3 with to every row in . Subdivide by its presentation labels in and its dyadic pair of polynomial lengths. There are a fixed finite number of presentation labels and pairs. Within one such subdivision, the inverse length and the pair are fixed. In this subdivision write
for the inverse polynomial of that presentation. The witness gives
The notation retains the permitted rowwise norm-profile parameters. The polynomial here is the original one for the displayed presentation, not the polynomial of its primitive inducing character. We first bound it when those parameters are fixed, and then handle their rowwise choice.
For each sixth-power-free row, factor its ideal uniquely as
Thus is squarefree, , and is powerful, meaning that each of its positive prime valuations is at least two. There are only finitely many possibilities for , because its valuations lie in on the fixed set . Choose one generator for each of these ideals. Writing for the primary generators of , there is a unique unit such that
We fix and whenever a row sum is taken.
Insert dyadic ranges , including the unit ideal in the bounded range . Only can occur, and there are such ranges. The original annulus gives the actual residual annulus
We keep this restriction when forming the sum. It will be enlarged to the ball only when applying a positive row bound. Let denote the rows of the current witness subdivision in this powerful-part dyad, with all original physical restrictions retained.
The number of powerful ideals of norm at most is . Indeed, every powerful ideal has a unique expression with squarefree; the two factors need not be coprime. The ideal count from the arithmetic preliminaries gives
The last series converges by the same ideal count. For each fixed in its dyad, the ball containing (9.18) has ideals. A nonempty annulus has bounded below by a fixed positive constant, which also covers the unit residual ideal. Since the factorization of and its unit are unique, the number of rows in this powerful-part dyad satisfies
Discarding any of the restrictions defining in this upper count can only add rows.
For fixed , put . Multiplicativity in the numerator gives the exact identity
It includes the zero extensions: if meets either factor, both sides are zero, and otherwise it is ordinary multiplicativity. In particular, the inverse polynomial for a fixed profile is the row sum in Lemma 9.1 with coefficients
The factor keeps the columns squarefree. The factor retains every original zero at and is fixed across the residual row . The only remaining zero depending on both and is the zero of the displayed sieve kernel itself. The restriction , and any restriction inherited from the physical row set for fixed external parameters, is a fixed row restriction in this application. We do not enlarge to contain the primes of . Consequently the constant in the sieve is independent of , even though its fixed coefficient mask may have large norm.
The common annular support and ideal counting give, uniformly for the fixed profile parameters,
The same statement holds for each of the finitely many profile derivatives used below, with the corresponding fixed seminorm. Apply Lemma 9.1 after enlarging the positive residual row sum from its actual annulus to . A fixed enlargement makes the row bound at least one on every nonempty quotient range and includes the annular column support. Summing the result over the choices of and the finitely many choices of yields
All coefficient sequences in this derivation are fixed within the row sum to which the sieve is applied. They may differ for different frozen values of , which are summed only after those positive bounds.
We now restore the rowwise choice of in Equation (9.17). Here the detector was used with , so . After the presentation and dyadic pair are fixed, its inverse profiles have the form
where is the fixed smooth dyadic cutoff and is the Fourier frequency from the detector. The factor is common to the row sum; the varying parameters are and . Differentiating in either parameter inserts a power of , which is bounded on the fixed annulus. Cover these two parameter ranges by unit boxes. There are at most a fixed power of such boxes. The parameter Sobolev inequality in Lemma 4.5 bounds the supremum on a box by a finite sum of integrals of squared profile derivatives. Sum over the rows before these integrals. At each fixed parameter value, differentiation changes only the fixed profile coefficient, inserting the allowed logarithmic weights or profile derivatives. Equation (9.21) therefore applies to every such integral. This proves
The derivative order and hence are fixed before choosing . The height intervals and the total allowance for additional frequencies are exactly those in the shared detector estimates; the Sobolev step does not assign a new frequency allowance or change a contour. It does not permit a coefficient to be selected separately for each .
It remains to combine this moment with the independent count Equation (9.19). Write
These are the parameters of the actual dyads. A nonempty dyad has ; the unit dyad has . Since the witness lengths stay bounded, the arbitrarily small power of in Equation (9.22) can be written as an arbitrarily small power of . Dividing that equation by the spike in Equation (9.17), and also using Equation (9.19), gives for this subdivision
after decreasing the sieve loss denoted by if necessary.
We compute the largest exponent in this expression first on and . Put and . Then
The minimum of with a maximum of three real numbers is the maximum of its minima with those numbers. The first such minimum is . For fixed , the second is the minimum of an increasing and a decreasing affine function of . They cross at , so its maximum over is
Both functions in the third minimum increase with . Its maximum over is therefore
The affine expression in takes the values and at the two endpoints. It follows, and equality is attained at one of those endpoints, that
This computation is uniform for .
The functions just used are maxima and minima of affine functions whose slopes are uniformly bounded on a fixed neighborhood of these compact ranges. Replacing the actual by its nearest point in , and the actual witness by its nearest point in , changes the exponent by at most , by (9.17) and the actual dyad bounds. Thus this replacement is made only in the final optimization, not in the row sum or its sieve application. Choose and the preliminary sieve loss small enough in terms of the prescribed . The witness pairs and powerful-part dyads cost only another arbitrarily small power. Summing (9.23) proves (9.16).
Finally, the bin need not contain an actual zero, so no use of Proposition 8.3 is made there. Counting all elements in its physical annulus gives rows. Since , the displayed formula for gives , as claimed.
For use in the high estimate, the row envelope has the explicit form
The argument uses only the inverse witness. No estimate for a product with the plain witness is needed in this row count.
Analytic estimates for the high expansion
The row envelope now enters the Poisson representation of the base probe. For the first-stage application, retain the supposition and set . Write for the first Mellin variable called in Section 7.2. Equations (7.5) and (7.13) give the actual integral to be estimated:
Here
The rows are the nonzero sixth-power-free elements, with their unit factors and the physical restriction . Both character presentations retain their original zeros at primes dividing . The coefficientwise calibration of the base probe is already included in this identity.
The row contains the reciprocal of the target function. For the intermediate row norms we will keep one buffered bin fixed, move its integral to
and apply the envelope there. Apart from small real losses and a fixed height factor, the numerator on this contour costs for a row norm ; the row envelope controls how many such terms occur. We first identify the principal signal, then carry out this contour move and its concrete first-stage estimate. Principal residues and direct bounds for the outer row norms complete the comparison.
The principal row and the normalization
We identify the row whose numerator is principal. A physical row with a prime factor outside has nonprincipal numerator by the ramification argument in Section 8. Because the physical mask imposes , the remaining rows are units. If a unit had a sixth root in , that root would have valuation zero at every prime, hence would be a unit of ; every unit of has sixth power one. Thus is nontrivial. It is finite Galois because contains the sixth roots of unity. Chebotarev applied to a nonidentity Frobenius class supplies a prime outside the fixed set where the associated sextic character is nontrivial [27 Theorem 1.1]. By the Kummer description in Lemma 4.1, this is . Therefore is the sole principal numerator row. A denominator attached to a bounded unit row may be principal; its reciprocal has a zero at one and will be kept on a global line below.
Define
Lemma 7.1 makes holomorphic on . Its uniform estimate permits a choice of before the target, because the local bound is uniform in the target unit phases. Fix large enough that
Enlarging by these primes leaves the fixed ray group unchanged, as the calibration in the local identity holds coefficientwise. The excluded set and hence the particular function may differ between applications, but within one application they are exactly those of the exact high representation being used.
The constant is positive. Indeed because is nonnegative and nonzero, and by (7.2). The simple pole of has positive residue: deletion multiplies the positive residue of by .
For the first stage put
Let be the integral in (2.3) with , , and the function just defined. The two scalar poles at and will give ; our remaining objective is a common power saving for every other term, measured relative to .
The exact identity used in contour moves
The contour proof uses the full holomorphic correction in the displayed integral. To reuse that proof with the compensated probe, we record the identity and bounds that it requires. In the present application the correction is , independent of , and the parameters below are and .
The scalar quotient in (7.13) is the part of the high expansion that determines both the contour move and the principal residues. We keep that quotient fixed and state explicitly what may be changed around it. Put
These are the two regions in Lemma 7.1. A real box below means a compact rectangular subset of for .
Definition 10.1 (Data for an exact high representation). Fix real numbers and such that
These real numbers are fixed before the target character. For each primitive finite-order target , fix the data of Section 6, independently of . Data for an exact high representation consist of the following objects and assertions.
First, is an independently specified complex-valued quantity for every sufficiently large real . In each application it is given by a finite linear combination, for that , of the completed sums in Equation (6.1), allowing specified restrictions on the completed index and specified rescalings of its three positive scales. The number of terms and coefficients in this finite combination may depend on . Any direct estimate for refers to this expression, not to a separately defined high integral.
Second, for every nonzero sixth-power-free element with and every such , there is a function . It is holomorphic on a neighborhood of each point of and of every . For every and every real box contained in one of these regions, there are finite constants and such that, uniformly for , all imaginary parts, and real parts in ,
The constants and exponents are independent of , and of any later order of integration by parts. No nonvanishing of or of any of its local factors is assumed.
Finally, the following identity is asserted for the independently given , with absolute convergence of the sum and integrals on the displayed lines:
where the sum has the physical restrictions of Equation (7.5), and
Thus Equation (10.5) is a hypothesis to be proved for the physical expression, not its definition.
For the base probe, the physical expression is , , and . Equations (7.5) and (7.13) prove the required identity, and Lemma 7.1 gives the holomorphy and Equation (10.4). More generally, the function in the definition always means the full correction after the displayed scalar quotient is removed. If that correction is a sum of products of local factors, the products themselves must be holomorphic in the stated regions. Writing a quotient by an individual local factor at its zeros does not establish this condition. The decompositions used only to estimate a retained contour will be stated separately below.
External tails on vertical lines and horizontal joins
The product of our three Mellin tests decays in three independent height directions. The following estimate turns that decay into bounds both off a large box and on the horizontal sides of a contour rectangle.
Lemma 10.2 (External integrated and trace tails). Let , let be a compact set of real contour parameters, and, for and , let be a nonnegative Borel measurable kernel on . Suppose it is jointly Borel measurable in and, for every integer ,
uniformly in , , . Let be Borel measurable, and suppose a Borel measurable factor satisfies on
where are fixed independently of and of the integer below. Write for the vector obtained by omitting the th coordinate of . Uniformly for and ,
The second assertion holds for either sign of and every , using coordinate Lebesgue measure on . Both assertions remain valid after integration over a real contour interval of bounded length when the hypotheses are uniform there and the kernels, domain indicators and arithmetic factors are jointly Borel measurable in that real parameter and the remaining coordinates.
Proof. Multiply the kernel bound by (10.6). Integrating outside the box proves (10.7) when . On , integration in the other coordinates gives
Taking proves (10.8). Restricting to decreases these positive integrals, and a bounded real interval contributes only its length.
For our triple integral, take
The change of height variables has determinant one. On a fixed real box with in a compact subinterval of , the Mellin estimates of Section 7 give arbitrary polynomial decay of and . The Gaussian has the same property. Their product is therefore for every , hence also . The omitted factor is bounded on that real box.
After the residue only remain. The same proof applies to the kernel
This supplies the trace bound needed for the subsequent -join.
The same kernel test handles additional external separating variables. For , let with a fixed , and multiply the three-factor kernel by a Borel density , jointly Borel in , satisfying
For the density is one on the zero-dimensional space. The product is again rapidly decreasing in all coordinates, since and its inverse are fixed. For the two-factor kernel, the identical argument uses a density on and , with density one when . Thus both product-kernel forms have the integrated and trace bounds above.
Uniform annular profiles separated by logarithmic Fourier inversion satisfy (10.10) by repeated integration by parts, as in Lemma 4.5. Translate every pure norm twist into its Mellin argument first. The additional height coordinates then append a block triangular matrix with fixed inverse to the three-dimensional change of variables.
An internal coefficient measure known only through a fixed weighted norm is not thereby covered by the pointwise density hypothesis or by its trace conclusion. Such a measure remains integrated at its already fixed moment order inside the factor . Any additional external coordinate on which a trace estimate is used must separately satisfy (10.10).
The domain in the lemma is important. Suppose a reciprocal is bounded only while the imaginary part of its argument lies in a buffered interval. A coordinate with may be integrated only over the range that preserves this condition; the lemma does not extend the reciprocal bound beyond it. Coordinates with may be extended when the other factors satisfy (10.6) there. All factors on an extended axis must use their global or absolute estimates, not an estimate valid only on a retained interval. In particular, an integrated tail alone does not justify a horizontal join: that join uses (10.8).
Increasing in this lemma increases only the decay orders of the external smooth tests. It does not differentiate . Thus a fixed moment-profile order or a fixed arithmetic height exponent in is unchanged when is chosen later. This is the same order distinction made in Lemma 4.5.
Moving a fixed bin
We first move the full row integral. The row envelope will be applied only after this step, on the retained contour.
Lemma 10.3 (Contour transformation for a fixed bin). Assume Definition 10.1. Fix with , put , and let with . Let be a finite set of retained physical rows in one bin of Lemma 8.1, fixed before any Mellin variable is moved. The comparison constants in this annulus are fixed. Take and , where . The real ranges and are independent of the target.
Fix positive constants , independently of and the rows. Retain the original heights , and . The contribution of on the starting lines in (10.5) equals its integral on these retained segments of
up to for every fixed . The finite exponent is fixed before . An empty row set contributes zero. The transformation uses the full holomorphic correction; no decomposition of that correction or subdivision depending on a contour point is needed.
Proof. Section 8 gives , including the floor bin. Isolate the finite sum over on the absolute lines in (10.5). Move from 2 to , keep , and move from 3 to . These moves stay in for a fixed positive , the two numerator arguments remain to the right of their poles, and the reciprocal stays in . Its global bound follows from Lemmas 4.9 and 4.10, using the conductor and deletion radical bounds in Section 8. The correction obeys (10.4). Lemma 10.2 with therefore justifies these moves.
Now move from 3 to while stays on that global line. Throughout the move,
The numerator character of every retained row is nonprincipal, so its -function is entire. Also and . Thus the correction remains holomorphic in , for example with , and no pole is crossed. On a -join the reciprocal is still global. The global upper strip bound for the numerator, the deleted-factor bound and (10.4) give a majorant of the form (10.6) on the axes integrated there. The trace estimate makes the joins tend to zero.
Before moving farther, restrict the three original Mellin heights to the stated box. On the discarded part keep on . There the global reciprocal bound, the global numerator bound, the deleted factors and the all-height correction bound give times a fixed polynomial in the heights: the row range is bounded by , and the number of rows is . The integrated tail in Lemma 10.2 gives .
Move only the retained segment to . On this rectangle,
and the other inequalities defining still hold. The real part of the reciprocal argument is at least . The stated height box places both scalar arguments strictly inside for sufficiently large . Lemma 8.1 therefore excludes its zeros throughout the retained rectangle. Since , the scalar zeta factor has no pole on this move. Thus no pole is crossed.
For an -join, its imaginary coordinate is fixed at a constant multiple of . The scalar denominator in (10.5) depends only on , so its buffered estimate remains valid when the and integrations are extended to their whole axes. On those extended axes use the global numerator estimate and (10.4). The trace estimate then gives . No - or -join in this argument extends an -axis that has been moved into a merely buffered region.
The exact high representation is a triple integral with a majorant for its full correction. We can therefore perform this transformation before introducing any auxiliary separating variable. If a central estimate later uses such variables, their retained domains and discarded parts must be justified in that estimate; they are not new coordinates of the contour identity just proved.
Applying the row envelope
For the base correction, Lemma 7.1 verifies the hypotheses of Lemma 10.3. Indeed uniformly in all three heights in both Euler regions; for , taking gives (10.4) with and height order zero. We now estimate the retained integral, using and throughout this subsection.
Fix
For a dyad in this range, fix one dynamic bin before moving any Mellin variable, and put . Proposition 9.2, with requested loss , gives its cardinality at most up to a fixed constant. For the floor this is the direct count , since ; it uses no witness.
The numerator is precisely the original zero-extended presentation with in Section 8. On the retained line , Lemma 8.1 bounds it by for any . This also holds in the floor bin. The central point lies in , so the stronger local estimate in Lemma 7.1 gives there, for any . Consequently
Here is finite and is fixed before the final external tail order.
Put . The buffered reciprocal costs for any , and is absolutely bounded. The tests have bounded joint norm in the three independent height coordinates above. The outside powers, including , are
Multiplying these bounds gives, for every , a retained bin contribution at most
Here we have harmlessly enlarged the bound by so that the losses use the same form as the later general estimate, and
There is no additional Mellin integral in this application. Its scalar buffered arguments have heights and . The witness frequencies and profile choices in the row count stay within the detector’s existing allowance and do not enter either scalar argument.
At , the three pieces of the row envelope give, respectively,
The first two pieces are at most . In the third, the exact bin ceiling from Section 8 is
It follows in every piece that
This is the comparison with required here; itself need not be negative. The frequency slope has the three forms
It therefore lies in . Positivity controls all , and the extension to costs at most . Thus, before adjustable losses, every central dyad has saving at least
relative to .
Central estimates for a correction split into pieces
The preceding calculation multiplied one aggregate absolute row bound by the outside Mellin powers. We record its form when the full correction is estimated by several pieces and the available bound varies between sets of rows. The contour has already been justified for the fixed bin; these sets will be used only to estimate its retained integrand.
Lemma 10.4 (A retained integral and its exponent). Assume the data of Definition 10.1. Fix with , and put . Let , with , and let be a finite set of physical rows with in one retained bin of Lemma 8.1. The comparison constants in are fixed. Put , take as in that lemma, and let with . The real ranges and are chosen independently of the target.
The bin is fixed before any Mellin variable is moved. On the retained central contours of Equation (10.11), suppose that there is a decomposition
where is finite, nonempty and fixed before . This equality is required only on the retained contours; the summands need not be holomorphic away from them. For each and each retained , suppose is partitioned into at most sets , with fixed . For each set at each retained point let be real numbers in a fixed bounded range. Assume that, for fixed and a finite ,
The bound is uniform in the retained point, row set and moving labels. The number and the bounded range for are fixed before the target; may depend on , the pointwise set and the global number , but not otherwise on . Let be the set of all pairs that occur at any retained point in this decomposition.
Here “retained” has the following precise height meaning. List once all external coordinates that enter a buffered -value, reciprocal, or logarithmic derivative in the verification of Equation (10.13), and include all three original Mellin heights, with zero coefficients when they do not occur in an argument. After pure-twist translations, every such argument has imaginary part , where the finite matrix is fixed and . Restrict
Coordinates with zero coefficients may be restricted by the same rule. Then every added height is at most in total. Fixed bounded enlargements are included by increasing the lower threshold for . If extra Mellin integrals are used to establish Equation (10.13), that inequality is required for its full left side after those integrations. Any discarded parts must have been left on their global or absolute lines, bounded by Lemma 10.2 or Lemma 4.5, and included in the displayed bound before the hypothesis is asserted. The allowance is not renewed at successive estimates.
The common ideal exponent associated with a pair is
If is empty its contribution is zero. Otherwise put
For every , the total contribution of on the central contours is, for sufficiently large ,
The supremum is finite because the pairs lie in a fixed bounded range. The power absorbs the pointwise logarithmic multiplicity. No separate integral for a pointwise piece or row set is asserted. All discarded portions and horizontal joins in this contour move are for every fixed , where is finite and is fixed before .
Proof. Apply Lemma 10.3 to the original triple integral, using for its three box constants the corresponding in (10.14). These constants are positive and at most . The full correction and the fixed bin therefore give the retained integral and the asserted errors before any pointwise pieces are introduced. Any auxiliary integrations used for the central bound are subject to the additional hypotheses in the statement.
Now use the central decomposition and form the pointwise sets . At each retained point apply the triangle inequality to the original row sum, and then apply (10.13) to the sets present at that point. There are at most a fixed multiple of such sets pointwise. Bound each of their exponents by the supremum over and integrate only the original holomorphic row sum. Thus neither measurability of an individual pointwise subdivision nor one common label set across contour points is needed. On the retained contours, Lemma 8.1 bounds the reciprocal by . The tests have a uniformly bounded joint norm, since the transformation is invertible. The scalar factor is absolutely bounded. It remains to compute the real power of .
The outside factor, including and the real displacements in (10.11), contributes
(10.13) adds . The reciprocal adds . Subtracting and using gives (10.15) and the remaining terms in (10.16). The pointwise logarithmic multiplicity is bounded by for sufficiently large . This proves the claim. □
The lemma separates two uses of the correction. Its holomorphy and all-height majorant justify the contour move before the rows are subdivided by their pointwise sizes. The pieces in (10.13) are used only after the move; they may be defined using local divisions whose nonvanishing has been proved on that retained region. Such a division supplies no continuation or tail bound outside that region. For the base correction there is only one piece, and Lemma 8.1 supplies the reflected numerator factor appearing in the central hypothesis.
Extracting the principal signal
The intermediate-row estimate leaves the principal row and the two outer norm ranges. We first cross the two scalar poles in the principal row. The following formulation also records the precise condition under which a different correction has the same target signal.
Lemma 10.5 (Extraction of the principal signal). Assume Definition 10.1 and (10.2). Fix with and . Suppose that for every , uniformly in all imaginary parts on
one has
with finite fixed before any external tail order. Suppose also that for every sufficiently large real , that for every , and that on , uniformly in ,
Here either is identically zero, or there is a number , chosen independently of , such that on that entire line.
Let be the term of (10.5), and define
Then , and, for every ,
The last term is omitted when is identically zero. The implied constants and lower thresholds may depend on the target, but the displayed real exponents do not.
Proof. For , the scalar factor in the high identity is
Isolate this term on the absolute contours. Move to , and . The reciprocal stays in , and both zeta arguments stay to the right of one. The paths lie in , so the correction is holomorphic. The all-height majorant and Lemma 10.2 justify the horizontal limits.
Move to , crossing its simple pole at . In that residue move to , crossing its simple pole at . The unresidued integral keeps . All these paths lie in , and is holomorphic for . Thus the two stated scalar poles are the only poles crossed. The reciprocal remains on its global line throughout, even when is principal. Every extended vertical - or -axis used to bound a tail lies strictly on one side of its scalar pole; and occur only as residues, and the horizontal joins have large nonzero height. On those axes the zeta functions have fixed polynomial bounds. Consequently the integrated and trace estimates of Lemma 10.2 apply without an unremoved pole in their majorants. After the residue, its Mellin factor has become the constant . The remaining heights use the two-dimensional kernel in (10.9), with ; its trace estimate justifies the subsequent -join.
On the principal contours, (10.17) and the outside powers give the raw exponent
For the unresidued integral this is ; for the leftover integral in the residue it is . The reciprocal on has an arbitrarily small power of its fixed target conductor and a fixed polynomial in height by Lemmas 4.9 and 4.10. The tests integrate those height powers. Requesting the small powers in the correction and in to be sufficiently small gives the first two terms of (10.19).
The product of the scalar residues is : the residue of at is one sixth of the residue of at one. Positivity of was proved when the normalization was defined.
At the double residue the outside power is
(10.18) therefore makes the normalized double residue
When present, the error factor is estimated on this line; the global reciprocal bound and Gaussian give . No continuation of that error factor is required.
Move only the main integral right to . The reciprocal is holomorphic for by the definition of and absolute Euler convergence beyond one. At a principal pole its reciprocal has a zero, so that case adds no residue. The function is holomorphic there by Lemma 7.1, and is bounded there by (10.2). The global reciprocal estimate is polynomial in height uniformly on the fixed real strip, while the Gaussian is . Rectangular contours therefore have vanishing horizontal sides, and the shifted integral is exactly . This also covers . The three remainders give the asserted bound.
The function in this lemma is the correction of the unmodified scalar Euler product at the double residue. A different full correction is permitted only when it verifies (10.18) with a nonzero normalizer. For the base correction that equation holds with and . The normalized physical quantity in any application is ; the same normalizer must be used for its direct estimate and for this principal comparison. The raw central and outer-row bounds acquire only an arbitrarily small additional power after this division, by the hypothesis on .
The base correction. Take and . On the principal rectangle of Lemma 10.5, the local correction is bounded uniformly in every height because that rectangle lies in . Thus Equation (10.17) holds with and height order zero. At the double residue it satisfies exactly
Hence and the residue error is identically zero. In the row , the outside factor is one; the sole factor is already in from the residue of . Lemma 10.5 therefore has just its two remainder terms. Their savings before losses are
Small and large row norms
The buffered bin estimate is needed only on a bounded interval of positive row exponents. The following direct bounds cover its two complements. They ask for explicit absolute estimates on the full correction and do not use its central decomposition.
Lemma 10.6 (Outer row norms). Assume Definition 10.1. Fix with , , , and . For a dyadic number , let denote the contribution in Equation (10.5) of physical rows , omitting .
Suppose that for every , for all such rows with , and uniformly in all imaginary parts on ,
Then, for every and ,
In particular the sum of these dyads is
For the other end, suppose that for every fixed and , for every physical row, uniformly in all imaginary parts on ,
Write . Then, for every dyad ,
For every fixed , if , its sum over is
Thus a fixed sufficiently large makes this last contribution smaller than any prescribed power of .
Proof. Every row under consideration has nonprincipal numerator by the classification preceding Lemma 10.5. The denominator may be principal for a bounded unit row; its reciprocal is nevertheless holomorphic and bounded on by the principal specialization of Lemma 4.9.
For all rows, the conductor and deletion radical bounds in Section 8, together with Lemma 4.10, give an arbitrarily small power of and a fixed height polynomial for that reciprocal.
For a small dyad move its finite sum to . The reciprocal stays global. The numerator is entire, and the scalar zeta argument stays to the right of one. These paths may be taken in : at the final point , and the other inequalities are immediate. The all-height correction bound and Lemma 10.2 justify the moves. On the final lines, Equation (4.14) and the deletion bound give times a fixed height polynomial for the nonprincipal numerator. There are element rows in the dyad, including unit factors, and . The correction is bounded by Equation (10.20). The tests integrate all fixed height powers. The resulting exponent outside the row power, relative to , is
and the row power is . Requesting the component small powers to sum to the displayed proves Equation (10.21). The row exponent is positive, so dyadic summation up to gives Equation (10.22), after decreasing the preliminary losses.
For each fixed and large dyad, move its finite row sum to the absolute lines . The path from remains in and , so the scalar factors are holomorphic there. For this fixed dyad choose large enough to contain its rows in ; Equation (10.4) and the external trace bound make its horizontal limits vanish. Constants used only to justify this equality may depend on the fixed dyad. The estimate on the final lines is uniform in the dyad by Equation (10.23). The scalar -factors are absolutely bounded there, as is , and Equation (10.23) applies. The outside power, including the correction but not the row count, is
The rows and give ; the tests integrate the fixed height polynomial. This proves Equation (10.24). Because , summing its geometric dyadic tail gives Equation (10.25). For fixed , the coefficient of in that exponent is , proving the last assertion. The original row series is absolutely convergent on its starting lines, and the displayed bounds give an absolutely summable final tail, so the individual dyadic contour identities may be summed. The number and the finite test orders it requires are fixed before tends to infinity. □
The first-stage outer ranges. Use , , and , as in the intermediate-row estimate. For the small rows, the line lies in , since . The local bound , uniform in all heights, verifies Equation (10.20) for all the prescribed rows, with height order zero. Equation (10.22) then has the following relative exponent before its losses:
For the large rows, with lies in . The same all-height local bound verifies Equation (10.23) for every physical row. Here , so Equation (10.25) has exponent
It tends to as the fixed number increases. For example, makes it less than when , whereas . This more than supplies the saving needed below. The three ranges , , and cover every physical dyad. The row was already assigned to the principal term.
The 11/12 conclusion
For the normalized base probe the central estimate, principal extraction, and outer-row estimates now give the following margins before adjustable losses:
| contribution | saving relative to |
| intermediate rows | |
| unresidued principal integral | |
| remaining principal integral | |
| small rows | |
| large rows () |
The smallest margin comes from the principal remainder. We retain a common positive margin after all real losses, then choose the analysis height for each target. The physical sum and the signal do not depend on that height.
Choosing the final height
The preceding estimates separate real powers from finite powers of the analysis height . The following elementary step records the order of choices needed to obtain one power saving for every target.
Lemma 11.1 (Late choice of height and external order). Fix with and an affine function . Suppose that all real parameters and finite structural choices in an application have been fixed independently of . Suppose there are common numbers and such that, for every primitive finite-order target, functions , independent of satisfy
Assume that after a finite sum of estimates, for every integer ,
where and are finite and independent of . Suppose there is a number , fixed after the real choices and the finite profile orders for the target but before and , such that the estimate is valid for sufficiently large whenever and , with a fixed . This additional ceiling may encode a height condition in a preceding estimate, such as the one in Lemma (8.2). The lower threshold may depend on . Increasing is assumed to change only external test seminorms, not or the already fixed real powers in Equation (11.1).
Then and can be chosen after so that
In particular the common saving , together with the displayed low estimate, has the target quantifier required by Proposition (2.1).
Proof. For the fixed target choose
Then , so the first term in Equation (11.1) is . Next choose a fixed integer such that
This is possible because and is finite. The second term is then bounded by the required power. Increase the lower threshold for after these choices. Both and were fixed before the target, whereas , and the threshold may depend on it. Since and do not contain , this proves the asserted family-wide exponent without changing either function. □
Proposition 11.2 (Balanced high estimate). Under the supposition , for every primitive finite-order target and all sufficiently large ,
The displayed saving is independent of the target; the implied constant and lower threshold may depend on it.
Proof. Use , and . The exact identity and local correction were verified at the start of Section 10; Equation (10.12) estimates its intermediate rows, and the principal and outer specializations there give the margins listed above. It remains to choose their losses.
Order of choices. We give a common loss budget. Put
The error-free central, small, principal, and large savings just proved are all at least . Fix the displayed geometry, row ranges, and before the target. Request loss in the row count, numerator, local correction, buffered reciprocal, central multiplicity, and each principal or outer estimate. Reserve a further loss for the physical dyads. The witness-pair and powerful-part logarithms are already included in the requested row-count loss; the bins and fixed presentation choices cost constants.
To obtain the requested row-count loss, first choose its preliminary witness, dyadic, and sieve losses sufficiently small in terms of . These choices are independent of the target. Indeed the witness length error has an absolute coefficient, and the affine slopes in the optimization of Proposition 9.2 are uniformly bounded. The target-dependent constants in the actual dyadic endpoints multiply only , which changes a fixed constant or lower threshold. Apply Lemma 8.2 on the enclosing pre-saturation ranges : the detector’s terminal product cutoff is before it proves the shorter witness lengths. Its number depends only on the requested dyadic loss and these bounded ranges. We may thus fix, still before the target,
With , this gives . Since , the explicit central losses in Equation (10.12), together with the reserved physical-dyad loss, are at most
The two principal losses are at most and ; the small-row loss is at most . Each is less than . The displayed large-row estimate already uses its requested loss. Therefore all these terms, after division by the fixed , retain at least before the height factor. We use only , leaving a further power available below.
It remains to check when the height hypotheses hold. Let be the fixed dyadic loss chosen above, and, after fixing a target, let dominate the finitely many orders in its uses of Lemma 8.2. Set
For and sufficiently large ,
This verifies the detector height condition uniformly over the physical range. The fixed factor from is absorbed by the lower threshold. We also impose as required by the bins. The internal tail orders used to establish the witnesses are chosen after this and are separate from the final external order below. Their increase does not change the retained profile or height orders. Any fixed constants introduced by those internal choices are absorbed into the unused power by increasing the lower threshold, which may depend on and .
For every final integer , Lemma 10.3 bounds the discarded high portions and joins by , with fixed before . The bounded real and row ranges and the finite set of bins permit one such for all the central dyads. Summing the dyads can be absorbed by increasing by one, again before . Combining the preceding estimates gives
for some finite , whenever and is sufficiently large. Both functions are independent of . Proposition 6.3, applied with loss and divided by the same fixed , supplies
All hypotheses of Lemma 11.1 are now verified. It gives the saving asserted in the proposition.
Transfer to Dirichlet -functions
The continuation criterion concerns the Hecke family over . We prove once that a strict zero-free half-plane for that family has the corresponding Dirichlet consequence.
Proposition 11.3 (Quadratic transfer). Let . Suppose every primitive finite-order Hecke -function over is zero-free on , with its principal pole at one allowed. Then every finite-order Hecke -function over and every Dirichlet -function is zero-free on that same strict half-plane, again allowing the principal pole at one.
Proof. Passing from a primitive Hecke character to one that it induces changes only finitely many factors . They are nonzero for , so the Hecke assertion extends to all finite-order characters. The same observation for factors reduces the Dirichlet assertion to a primitive Dirichlet character of conductor .
Let be the quadratic character of conductor three, and let be the finite-order Hecke character given by on ideals coprime to . It is a ray character: if , then , so the norm character is trivial on the corresponding principal ray subgroup. Let be the rational primes dividing , and let be the primes of above them. Superscripts by these sets denote deletion of those Euler factors.
For , the local factors agree as follows. If splits in , then , the two prime ideals have norm , and the Hecke factor is . This is the product of the Dirichlet factors for and . If is inert, then , the unique prime ideal has norm , and its factor is
These exhaust the primes outside . Absolute Euler convergence for , followed by uniqueness of meromorphic continuation, gives
The product character on the right may be imprimitive; deletion of makes the identity independent of that choice. Every deleted factor is nonzero for .
Both Dirichlet factors are holomorphic in . A zero of there would therefore give a zero of the Hecke factor, with no cancellation by a pole, and the assumed Hecke half-plane excludes it when . Absolute Euler convergence handles . On with , neither Dirichlet factor has a pole, so the same product argument applies.
At , a pole-zero cancellation could occur only if one primitive inducing character among and were principal. The other would then be . Its Dirichlet series converges at one by bounded partial sums of the nonprincipal periodic character, and grouping consecutive terms gives
The first integral follows by monotone convergence of the nonnegative paired integrands. Thus there is no zero in this last case either; a principal pole is allowed. This proves the strict half-plane assertion with no claim on its boundary.
Proof of Theorem 3.1. Suppose that . Lemma 7.1 and (10.2) give the required holomorphic, nonzero on for every primitive target. The low and high bounds established in Proposition 11.2 and its proof verify Proposition 2.1 with
These two positive losses are independent of the target, while the allowed constants, excluded sets, and thresholds may depend on it. The continuation criterion contradicts the supposition. Therefore . By its definition and absolute Euler convergence in , every primitive finite-order Hecke -function over is zero-free in the strict half-plane , with the principal pole allowed.
Proposition 11.3, applied at the same boundary, extends this assertion to all finite-order Hecke characters and all Dirichlet -functions, including . It preserves the strict half-plane and the allowed principal pole. This proves the theorem.
II The seven-eighths zero-free half-plane
The compensated probe
Theorem 3.1 applies to every primitive character entering the supremum in Equation (2.1), and therefore gives . Suppose for contradiction throughout Part II that , and put
The exact bin ceiling in Section 8 applies, since . For every retained nonprincipal row and its bin it gives
Indeed, the finite set defining consists of the floor and real parts of actual zeros, all at most . This uses only the definition of the supremum, not its attainment. The boundary case remains part of the argument.
For the second application of Proposition 2.1, write throughout Part II
Our task is to construct a normalized probe from the finite expression below. It is distinct from the balanced probe . Its low-side target is for a common ; its high side must satisfy the signal estimate in (2.5) with this . The nonzero scalar normalization will be specified after the principal term is evaluated.
For each primitive target , use an admissible fixed instance of the data , , , , , , , from Section 6. The permitted choice of will be made in the parameter order below. These data may differ from those used in Part I, but within this application they are independent of and are the same in the physical probe and its high representation.
We first define the two-term modification on the original probe, before moving any contour. The subsequent low and high estimates will concern this same finite expression.
Use the fixed geometry
Fix positive slot lengths of total length , and put . Each physical slot has a nonnegative, nonzero smooth annular weight . Its allowed prime set is
The underlying window sets for distinct slots are required to be disjoint before imposing the ray and restrictions. In particular, the sets are disjoint, and every tuple in consists of distinct primes. The number and lengths of the slots will be chosen later, but they are fixed independently of . A sum over for slot below always retains this same exclusion and annular support.
For a squarefree product of slot primes, let denote Equation (6.1) with the indicator inserted in its completed row. Thus . For a tuple and write , with . The subset indexes the rescaled slots and the marked slots; this subset notation is distinct from the normalized probe . Define the modified probe by the finite identity
Equivalently, at each prime the operation is the marked term minus the rescaled term . Formula (12.5) specifies their composition: every slot window stays at its original scale , including when another slot changes the completed scale. On one has for every . Thus marking commutes with the Fourier decomposition of and preserves the same excluded set and zero masks in every summand. The subtraction is designed to cancel the scalar prime contribution on the high side, leaving the sextic-character prime factor used by the moment estimates. Section 16 proves the exact identity and bounds the remaining local errors.
Coefficient conventions and finite correlations
We record the additional coefficient conventions for the prime factors, then prove a fixed-ray prime normalizer and the full finite Fourier correlations needed below. The latter retain shared prime powers and will be used in the additive Gram bound as well as the fourth moment. The residue-symbol and fixed-data conventions of Part I remain in force.
Additional coefficient conditions
We use the plain and inverse polynomials, annular profiles, and fixed arithmetic datum from Section 4. The following conditions specify the extra prime factors and moving zero supports used in this part.
A prime slot of log-length is
Here is a fixed finite-ray character or a fixed finite linear combination of such characters. It is independent of the row and of the other selected primes. Distinct slots have disjoint underlying prime supports before any common mask or row zero extension is imposed. For the fourth moment of Section 18, a fixed finite group of ray characters is part of the data, and every character component with nonzero coefficient in every positive-length slot must belong to . The inverse moment of Section 17 also allows a bounded coefficient chosen independently for each slot and independently of the row and all other columns; the coefficient of a prime tuple is then the product of its individual slot coefficients. The restriction does not apply to these separate inverse-moment weights.
For an auxiliary fourth moment the rows are elements , and
The twist is common to the row sum after its outer labels are fixed, and its displayed factorization into fixed finite-ray and moving residue-symbol factors is part of the data. Let be the squarefree product of all good primes at which at least one displayed moving factor has its natural zero on nonunits. This includes a prime even when that factor has exponent divisible by six, including exponent zero, or when local characters cancel after multiplication. We require , counting an overlapping prime once.
An additional puncture is an indicator with squarefree, , and in a prescribed bounded range. It must be common to the current row sum and to every plain and prime factor in that sum; it may depend on previously frozen outer labels. A prime may be removed from and put in only through an exact factorization of its displayed local factor into that coprimality indicator and the local or fixed-ray character phases that remain. Those phases must be retained, the refactored zero must be removed from the displayed moving factor, and the common puncture is deleted before the natural reflection in Section 18. No zero prime may be omitted from both supports. If a moving character still ramified at that prime remains, the prime stays in ; only a redundant zero may be transferred to . A fixed finite-ray character here has its complete zero-extended presentation and ray group fixed in the preceding sense; a character with moving conductor cannot be relabeled as fixed. A locally frozen moving twist factor or redundant zero mask retains the stated moving-support and puncture requirements. In particular a -varying redundant mask cannot be included in the fixed arithmetic datum. The zero extension of is allowed to vary naturally with , but cancellation between that varying row factor and a fixed twist may not be recast as a separately chosen puncture for each row. Externally chosen row-dependent punctures and row-dependent column coefficients are not part of this class. This full-support convention governs every fourth-moment invocation in Section 18.
The common uniformity convention has the following additional clauses for these coefficient classes. Any required slot mesh depends only on the fixed real log-length ranges, the strict margins, and the specified positive power losses. Finite seminorm orders, polynomial height orders, implied constants, and lower thresholds may also depend on a specified fixed number of slots. They are uniform over the moving moduli, the radicals included in , the admissible punctures, and the outer labels in their stated ranges, even when an outer label is fixed during one row sum. The constant in the definition of a divisor-bounded multiplicity may also depend on this fixed slot count. The independence of from , the current rows, and the averaged labels, and any separate requirement that the multiplicity depend only on , remain as in Section 4. The slot count is a separate fixed parameter, and moving labels remain outside .
Prime counting in a fixed ray class
Lemma 13.1 (Fixed-ray prime normalizer). Let be a fixed quotient of a ray class group of , and write when the image of an unramified prime ideal is the identity. For a fixed nonnegative, nonzero smooth annular weight ,
Deleting any further fixed finite set of primes does not change this asymptotic. Its lower threshold may depend on all the fixed data.
Proof. For the fixed abelian extension of corresponding to , the prime ideal theorem in a fixed Frobenius class gives
This is the fixed-extension consequence of Chebotarev in [27 Theorem 1.1]; the extension and its conductor are fixed as . If , the error is uniform for as . Stieltjes integration by parts therefore changes the left side of Equation (13.3) by when is replaced by . The resulting integral is
The last ratio tends uniformly to one. This proves the formula and its positivity. A fixed finite set is eventually outside the annular window. No error exponent uniform in the ray conductor is used.
Full finite Fourier correlations
We now allow arbitrary prime powers in a modulus. The two-argument notation below is a finite Fourier sum; it is distinct from the one-argument finite-ray function of Lemma 4.4. Define
All characters in this subsection have the zero extensions specified in Section 4, and we put .
Lemma 13.2 (Prime-power Fourier sums). For and every integer ,
Proof. Write a residue modulo as , with and . The sum over is zero unless , and equals otherwise. In the latter case write . The remaining normalized sum is
If , its inner sum vanishes when and otherwise has absolute value . If , the inner sum is the sum of the additive character over the units, namely . These are exactly the two cases in the statement.
Lemma 13.3 (Full correlation and common factors). For primary moduli outside and , put
Then
At zero frequency, unless , and , where is the number of units modulo .
Let and write , , where . Then unless . For ,
For and , the local factor is
If divides exactly one of , the local factor is . On the genuine residual locus , means the congruence sum in Equation (13.7). When is used on all residual pairs, it instead denotes the artificial product extension of these local formulas, with the local value defined to be zero if . Outside the genuine residual locus this is not the original congruence sum. The genuine function and this artificial extension both satisfy , and the extension is periodic modulo in each residual column.
Proof. Expanding both Gauss sums in the displayed Fourier transform leaves
Additive orthogonality makes the inner sum when the congruence holds and zero otherwise. If and a summand is nonzero, and are units modulo and . Reducing the congruence modulo gives , and reducing modulo gives . Since the generators are primary, . The congruence then says and gives . This argument uses the zero masks also when a local character power is principal.
The divisibility by is immediate. After division by , the congruence for is
Reduction modulo and gives, with zero values retained,
The product of the two unit factors is . It remains to identify the multiplicity of lifts of the congruence modulo . This can be checked at each prime. If and neither residual modulus contains , there is no additional lift. If, say, and , then is free and the congruence uniquely determines from it. Reduction modulo is exactly the common congruence in Equation (13.7). The case is symmetric, and this argument includes . The Chinese remainder theorem thus gives a bijection with the common solutions used in , even when meets one residual modulus.
For the local calculation put and , a character of extended by zero. Since at least one of is a unit at , each solution modulo has lifts modulo . If both are units and , the unit variables are proportional and the field sum is . If , put and . The field sum becomes
It is for nonprincipal and for principal . If and , the field equation forces . For its character is zero. For the remaining sum over is zero unless is principal, in which case it is . The other case is symmetric. This proves all local formulas on the genuine residual locus. Extending them by the stipulated zero when both residuals meet gives functions of the residual columns modulo , each of absolute value at most . Their product proves the final assertions for the artificial extension as well; no congruence-sum identity is asserted at a newly added pair.
For some applications it is preferable to remove all primes common to the two full moduli, with their entire multiplicities. The next form leaves one common row character on each remaining product.
Lemma 13.4 (Complete-common-support correlation). Suppose , are primary and outside , with and . Then, for every ,
The moduli may contain any prime powers, including shared auxiliary prime factors.
Proof. At primes of and , solving the congruence in Equation (13.6) gives respectively and . These statements remain valid when a character of is zero; only the displayed unit factors are inverted. At primes of change variables , . The congruence becomes and its character factor changes by . The remaining unit factor is
All denominators here are symbols of units by the hypotheses. The Chinese remainder theorem and the definition of complete the proof.
The hypotheses of (13.9) are not removed by extending as a bicharacter. To state exactly the extension used with Möbius inversion, fix and define to be the right side of that equation for all primary outside with , retaining its zero symbols even when . For any finite coefficient array on this locus,
Indeed the full inner divisor sum is , and the two correlation expressions agree on that locus. The value of elsewhere is artificial, not a formula for . In particular the full divisor sum must be inserted before a factorwise estimate separates the two residual columns; extra common primes introduced by an individual divisor term do not become primes of the genuine correlation.
Marked completion and reflected row energy
The compensated low estimate and the inverse moment use the same marked completion. We establish its reflected mean square here. The low estimate will use the case with no additional squarefree label or puncture; the more general form allows the labels and masks introduced by the inverse moment’s Poisson transformations.
We retain the notation of Section 4. In particular, ideal variables have their multiplicative primary generators, the fixed excluded set contains the primes over 6, and every power of a residue symbol is zero on nonunits, even when its exponent is divisible by six. Element rows need not be squarefree or prime to .
Completed sums and product-form marks
Fix a finite index set and pairwise disjoint lists of primes outside , with for . The lists and their bounded individual coefficients are independent of the current row and squarefree label. Their nominal lengths lie in fixed bounded ranges.
Here and below a fixed puncture means a function
where is squarefree and is required to be fixed only within the indicated current row and label sums. A bounded product of such functions has this form with equal to the radical of the product of their moduli. The norm of this radical will be bounded explicitly. It may depend on previously fixed outer ideals, but not on either current averaging variable.
Let be a squarefree ideal outside , with for a nonnegative in a fixed bounded range, and let . For a fixed multiplicative finite ray character whose full zero-extended defining modulus has prime support in , define only for squarefree primary outside , and define for every primary outside by
The finite character, puncture, and all slot lists are independent of , . A fixed function on a finite ray group is always expanded into genuine group characters before this definition is used; thus is multiplicative even when an earlier step produced a finite linear combination of characters.
For a subcollection of disjoint prime lists with bounded coefficients, define its mark by
We omit from the notation when it is understood. Because the lists are disjoint, a tuple has a squarefree product. For every fixed , the number of tuples dividing is . The coefficient in Equation (14.1) is a product of functions of the individual primes; this property, not merely the pointwise divisor bound, will be used when some slots are assigned to an extracted factor.
For a smooth annular , put and define the completed marked sum
Both primal ideals avoid ; they may share primes. The mark belongs to the whole index . With , this is the Mellin completion on the left of Equation (5.1). The Gaussian Mellin test from that Equation is also permitted when only the completed estimate is used.
For the reflection formula we use Lemma 5.2, only for a nonzero row. Write as in that Lemma. After fixing the unit, the -valuations modulo six, and the good row ray class, its literal sector character is
The zero branch is evaluated before either character. The Lemma supplies one finite family and hence one common , with prime support , before the good primes vary. Write ; the full reflection sector modulus is . All good primes of , , remain in the local prime set, with their exponents combined modulo six and every zero retained. The fourth power at has no extra reciprocity sign, since . The puncture is the product of the local zero powers at its good primes. Thus the local presentation gives exactly on the stated primal support, including at shared good primes; no moving good prime enters .
Whole-index marked reflection
The next corollary adds the product-form marks to the exact reflection in Part I. Its branch data are important: an inactive marked prime is absent from the conductor, so the marked transform is not obtained by multiplying one fixed-conductor dual sum by independent local factors.
Corollary 14.1 (Completed reflection with whole-index marks). Fix an invocation of Proposition 5.1, with base local prime set , powers , fixed multiplier , and test . Put for this invocation. Let be a finite set of distinct good primes disjoint from . In the direct completed coefficient sum, insert the factor ; denote this sum by . It has the same normalization as Equation (14.2), with replaced by . The primal squarefree and cube ideals may share primes.
There is an exact finite expansion
Here a branch specifies mod , the base active and inactive sets , , and a partition . All base primes with are active. Put
The base factors and the canonical functions are those of Proposition 5.1 for this active radical. With every computed using this branch’s whole , the scalar is
In particular . The functions and the scalar have the canonical dependence on and mod from Part I. Every dual sum is absolutely convergent and has the same full source support as there. If a marked prime instead belongs to the base local set, the corresponding primal term is identically zero and is removed before this formula is used.
Proof. For every good prime and every , the zero convention gives the pointwise identity . Expand its product over , and apply Proposition 5.1 to each of the resulting finitely many completed sums. For a fixed and active radical, the Proposition uses the same , other local phases, and kernel whether an absent prime is omitted from the local set or included with exponent zero in its inactive branch. Thus the two inactive contributions at combine with coefficient . The active contribution comes only from the subtracted zero-mask transform and has local factor and scalar . Collecting these choices at all marked primes proves (14.3) and (14.4). The inactive prime is absent from , hence from that branch’s conductor and kernel scale. This is finite inclusion-exclusion between compatible branches, not a new theta identity.
If a marked prime is a base local prime, the mark forces it to divide , while the zero-extended base factor at that prime then vanishes, including for exponent zero. This proves the last assertion without any division of a zero symbol. It also covers the case where the primal squarefree and cube ideals share the marked prime. □
For the row norm, the phase consequence of this corollary must be stated with its exact scope. For distinct active good primes , Equation (5.17) and cubic reciprocity give
For an active mark the exponent is ; its changed sign occurs only in its one-prime scalar. A residual row prime with and a marked prime therefore have pair factor . A row prime and a moving prime would instead leave , which need not be one. All nonresidual base primes, especially every prime, are therefore fixed before the inner row norm.
Write for the product of the residual row primes and for the product of active marked primes. Primal row-mark collisions are removed first by the last assertion of the corollary, and are subsequently represented by . If the frozen active base product is , then . Fix separate classes of and modulo the full , not merely their product and not merely their smaller reciprocity classes. This fixes the cusp data without adding a pair-dependent restriction. Row-row phases are row scalars, mark-mark phases are tuple scalars, and their interactions with frozen primes depend on only one of those sets. The angular conductor scalar factors in the same way.
After fixing the dual unit, its -valuation, and extracted frozen factors, write the remaining dual part as . The moving columns are exactly
These identities include every zero. A zero caused by a row or a tuple meeting an extracted frozen factor is a fixed restriction on that row or tuple. The source coefficient, fixed additive factor, and all frozen local column factors are functions of the full extracted dual index alone. Hence, after common smooth separation, the tuple coefficient may be a general bounded function of the tuple independent of , while the dual coefficient is independent of . The earlier product form of the marks remains required when slots are assigned to extracted factors.
A quadratic–cubic norm estimate
Part I established the required orientation of Goldmakher–Louvel’s quadratic large sieve and proved the zero-preserving completed reduction in Lemma 5.5. We add Heath–Brown’s cubic large sieve:
where both stars mean squarefree in , and the coefficients are arbitrary complex numbers [17 Theorem 2]. The indices need not have squarefree rational norm, and there is no exclusion of rational prime factors. Conjugation and cubic reciprocity allow the opposite orientation. In this sieve and (5.26), a fixed restriction on the row set decreases the positive outer sum. A fixed restriction on the coefficient support is instead implemented by setting the omitted coefficients to zero and applying the same theorem; no column-support monotonicity is claimed. This observation does not allow an arbitrary pair-dependent mask; the next lemma resolves the two such masks that it uses.
Lemma 14.2 (A quadratic–cubic norm bound). Let . Let be squarefree primary ideals with , , and ; let be any primary ideal with . The ideals avoid the current excluded set ; additional fixed exclusions are allowed. The source ideals may contain primes of other than . Let and satisfy
Here is independent of , and is independent of . Then
Fixed restrictions on the -set and fixed restrictions on the - or -supports are allowed, as are fixed ray sectors. All such restrictions must preserve the two coefficient-independence conditions above. Divisor-bounded multiplicities may be included if they preserve those conditions; otherwise they must first be removed by the divisor Cauchy inequalities in the proof.
Proof. Write for the left side of (14.7). First remove the complete moving row-mark mask:
For each row the number of such divisors is at most . Rowwise divisor Cauchy, followed by the positive sum over rows, therefore costs a permitted factor . In a fixed -summand write and . Squarefreeness gives the fixed restrictions . Define
All these factors retain their zeros and . Factoring gives
Here , , and all inherited fixed restrictions are retained. The outer ’s are the squarefree good divisors allowed by the split, so . In particular, no mask is reinstated inside an individual -summand. Its cancellation belongs to the complete Möbius sum already bounded by rowwise Cauchy.
For fixed , the product of and the inner -sum is an arbitrary complex coefficient independent of . Apply Equation (5.27) with row length . Use its notation
so , and write for its complete -mask divisor. The ideals are pairwise coprime and squarefree; no coprimality between and is imposed. The cited reduction already includes the natural - restriction and the complete Möbius expansion of the - mask. It does not reinstate a mask between the remaining row and .
For one block its positive output, inserted in Equation (14.8), is at most
where the positive -sum keeps the original support and
The factorization used here is, including all zeros,
The character already supplies the missing zeros at , , and . Thus the -factor is tuple-only, including its zero when . The fixed -phases remain inside until this positive bound. The quadratic reduction has already separated the finitely many squarefree -parts of before sieving their good product; in Equation (14.9) are the original ideals.
We may now discard . For fixed , the -coefficients are independent of , and ideal counting gives
The product is squarefree primary and has norm . It may contain a permitted prime of other than , since only the quadratic column was stripped of its fixed -part. Grouping by costs at most a divisor factor. Enlarge only this positive squarefree -range. Cubic reciprocity, conjugation, and Equation (14.6), followed by the choices of , give, on , ,
The fixed mask at is a coefficient restriction in this cubic sieve, not a row-dependent mask. The reduction supplies , with possible , and the factor . Together with the -count, these contribute
There are possible in its dyad, while the sum of over its dyad is , up to a permitted small power. Both sieve factors increase when are replaced by 1, and . Summing the logarithmically many dyads proves Equation (14.7). Subunit quotient ranges are empty, and bounded ranges are included by changing the fixed annular constants. This argument has introduced neither a condition nor a new pair-dependent mask.
The reflected energy bound
We next quantify the reflection of Equation (14.2). The following description also specifies the dyadic contribution used in the statement.
Reflected block data. Fix and put . For an element row , define the maximal powerful part of its ideal by
Split the valuation-one primes into the squarefree product supported on and the squarefree product outside that set. These three prime supports are pairwise disjoint, and their product is the ideal of . A powerful ideal here means that every positive prime valuation is at least two. Fix the unit of . Insert smooth dyadic partitions in
Choose these ideal centers nonnegative, with center zero for the unit dyad. In particular, an actual annular factor is kept in the row sum. The bounded dyad includes . Choose fixed constants , from these supports, such that
Since , the general norm inequality Equation (5.35) gives here
The inequality need not be an equality, because may have positive norm length. Freeze the actual ideals . At every prime outside , combine the local exponents of modulo six, always retaining the zero extension. The primes of have exponent . All other such primes, including every non-slot prime of exponent , are now fixed. In the reflection formula call a prime active when it occurs in . For a fixed choice of the active zero-exponent primes and a fixed splitting of each Ramanujan factor, let: be the log-norm of all active non-slot primes outside , be the log-norm of the small Ramanujan terms and active zero-mask terms among them, be the log-norm of the divisibility terms assigned to the squarefree dual ideal, be the log-norm of the divisibility terms assigned to the cube ideal but not the squarefree ideal.
Here a log-norm is of the norm of the indicated product. The assignment uses . Let be the sum of their nominal slot lengths. The product of the active primes has norm divided by in a fixed compact interval, including for zero nominal lengths or the empty list. After extracting the forced squarefree and cube primes, restrict the remaining dual ideals to
Choose the ideal centers nonnegative. These are source dual ideals: they retain every prime of permitted by Equation (5.2); no extra -mask is placed on them. Only the displayed -valuation support is imposed. The unit and the integer are fixed in this dyad. For these choices, denote by the right side of Equation (14.3), summed with the product-form tuple coefficients, with the specified local choices and dual restrictions, and the actual factor . Active slot tuples are still summed in this definition. This definition is made separately for each fixed powerful and supported row part and each sector obtained by fixing separate classes of the residual row product and active slot product modulo the full reflection modulus .
Lemma 14.3 (Reflected energy). Retain the reflected block data above. Let , and suppose their log-lengths range over fixed bounded sets. In the completed sum of Equation (14.2), the fixed character, puncture, and slot coefficients are independent of , , the slot supports are disjoint, and the slot coefficients are products as in Equation (14.1). The fixed row restrictions after freezing must be independent of the active slots and dual variables, apart from the explicit zero mask . Fix a small , put . Define and call a dyad retained by the following formula:
Terms with
have arbitrarily small total size, with a fixed polynomial height cost, after a sufficiently far kernel contour shift and a threshold for depending only on the fixed support intervals and . Every retained dyad has coefficient exponent, per active tuple,
Define
and
For every , the contribution with fixed satisfies
Summing the fixed parts in their -dyad and the local choices changes this to . The bounds are uniform in the moving ideals and punctures in the stated ranges, with finitely many smooth seminorms and a fixed polynomial cost for norm-twist heights. The negative value of , when present, is . In particular, the formula is used only on actual residual-row dyads satisfying Equation (5.35).
Proof. First remove the inactive slots by triangle inequality in the row Hilbert space. At such a slot the absolute coefficient mass is
uniformly under any fixed restriction, including for a bounded or zero-length list. It therefore suffices to prove a uniform bound with those primes fixed. Each such branch has its own conductor, cusp sector, and kernel scale, with the inactive prime absent from the conductor. Its earlier collision exclusion is now a fixed row restriction.
Fix , , , , the non-slot local choices, , and separate classes of the residual row product and active slot product modulo the full . Also fix the unit and ramified exponent of the dual index. No non-slot label remains averaged. We use only the algebraic frozen-base extraction in Equation (5.32), inside the original sum over active tuples. Corollary 14.1 and the subsequent phase separation make that extraction simultaneous across the tuples: the base coefficient is common to the residual rows and tuples after their separate sectors are fixed, while the remaining scalar separates into a row factor and a tuple factor. We do not apply the numerical unmarked estimate separately to each tuple.
The structural extraction gives the common central coefficient
times normalized inverse-root factors and bounded coefficients. Its -assignment extracts a forced prime only from the squarefree dual ideal, even if the cube ideal shares it; the entire shared cube part remains in its residual norm and coefficient. Its -assignment extracts one occurrence from the cube ideal and leaves the factor . These are statements about the full source support, including the permitted primes of . Every active marked column in Equation (14.3) contributes . Since lies in a fixed compact interval, this proves the per-tuple coefficient exponent in Equation (14.12).
We now record the precise marked instance of the common profile. Let , , be the actual frozen products with log-norms , , . Put , . The branch denominator and a supported dual index are
With the fixed block centers, define
Multiplicativity gives the exact identity
It remains true if shares primes with . All frozen factors in are their actual products, and every moving norm remains a coordinate. The actual row cutoff and the individual dual and slot cutoffs therefore place the kernel argument in
for one depending only on the fixed support intervals and the common fixed modulus. In particular this comparison has not used any shorter row added by positivity.
Put . On this full product of actual annuli, Lemma 5.3 permits
to be factored from the entire homogeneous linear row vector, at a factor at most in its fixed seminorm constants. The normalized profile has bounded fixed Euler seminorms; no inhomogeneous tuple seminorm is claimed to become small. The profile includes the normalized inverse roots from the structural extraction and every other common smooth norm window.
The tail is removed on the genuine, unseparated sums. If , every whole dyad with center excess greater than has actual kernel argument greater than . Apply Lemma 5.4 with lattice , , and . On the full source support, the coefficient bound used in Part I gives
Each base or marked local factor is at most after its indicator is discarded. The bounded row, tuple, and local log-length ranges, the local branch counts, and have a fixed polynomial cost , with chosen independently of the kernel order. For any desired saving , the choice
in that shell lemma makes the absolute total of these whole dyads times a finite test seminorm. Norm twists have the fixed polynomial height cost of that seminorm. The shell sum counts all discarded dual indices, so no count at a retained dual length is used for this tail. It is removed before Fourier absolutization.
For a retained dyad, apply the common-profile lemma and Equation (5.24) to the one joint profile in Equation (14.15). Its density is common to the entire current row Hilbert space, including the active-tuple sum: the actual row, dual, and individual slot norms are its coordinates, not parameters of separately chosen measures. The full fixed support boxes govern every invoked weighted Fourier norm and height cost. At a separated mode the norm powers have absolute value one and preserve the row, tuple, and dual coefficient independences. Only inside this separated nonnegative row norm may the row set be enlarged from the original annulus to , using the same separated formula on the added rows. The kernel is never evaluated there.
After extracting the common coefficient but before using , the separated squared norm is bounded by
where
The ideals retain their stated dyadic norms and fixed coefficient restrictions. After extracting common bounds, .
We verify the two independence hypotheses before invoking the norm bound. Every residual prime has exponent , every active slot is a whole-index mark, and all other active primes are frozen. The separate full classes fix the cusp coefficient and additive factor. Equation (14.5) cancels every row-slot phase, while the preceding marked-reflection discussion assigns all row-row, slot-slot, and frozen interactions to a row scalar or a tuple scalar. The angular conductor scalar separates in the same fashion. The remaining source and frozen local columns depend only on the full extracted dual index; their zeros at a frozen factor give fixed row, tuple, or dual restrictions. Finally the exact zero-preserving column identities leave only and in addition to the character zeros. Hence is independent of , and is independent of , exactly as required in (14.16). The function need not retain product form at this norm step.
Apply Lemma 14.2 with
Aggregating tuples with the same costs only a divisor factor. Since
the hybrid bound and the outside coefficient give exponent
Only now does the squared scalar supply the last term in (14.14). This proves the fixed-part assertion.
Every powerful ideal is uniquely with squarefree. Ideal counting and give such ideals in the -dyad. The supported squarefree part divides the radical of , so it has choices in the stated ranges; the local choices have the same divisor bound. Rowwise divisor Cauchy on the local expansion followed by the positive sum over these fixed parts therefore adds once. The active tuples were already inside the hybrid norm and are not counted again. This proves the aggregate assertion.
The dependence on the original row length can be bounded without identifying with . At one active non-slot prime the contribution to is as follows:
| local choice | coefficient of its log-norm |
| odd, or | |
| active | |
| small or assigned to | |
| assigned to | |
| inactive |
A residual row prime contributes two through . Prime by prime, these coefficients are bounded by the valuations in
Indeed, a powerful prime of row valuation has valuation in the first factor, a squarefree row prime has valuation two, and a prime belonging only to the squarefree or to has valuation one. Intersections only increase the valuation of this upper bound. Fixed excluded primes contribute only a fixed factor . Equivalently, summing over primes gives the actual norm inequality
Choose a fixed with , and put . The preceding inequality and the definition of imply
For empty slot lists, . Choose and then take so large that the two displayed constant errors are at most and ; the latter follows from .
On a retained dyad, Equation (14.14) and give
For the first branch, drop the nonpositive terms after using the lower bound for ; for the second, use . The maximum is increasing in each argument. We may therefore use Equation (5.35) for its first argument and Equation (14.17) for its second, then sum the logarithmically many actual -dyads. Taking , and the local small-power losses sufficiently small in terms of proves
The prime on the sum restricts the powerful part to its -dyad. A bounded dual range is included in the first term; an empty range is negligible. No equality has been used.
The compensated low estimate
We now bound the finite compensated probe defined in Equation (12.5). Its exact low separation has two factors. We first bound the completed row after summing the marked slots by applying Lemma 14.3 directly. We then prove a quantitative Gram bound for the additive polynomial from Section 6. Cauchy–Schwarz will combine these estimates to give the exponent .
The marked completed row
For a fixed rescaled subset , with marked subset , put
For a squarefree product of slot primes, define the marked completed series
The ideals are the original ideals prime to , represented by their primary generators, with squarefree; they may share primes. All character powers retain their original zero extensions. For the empty product this is the completed . For this fixed , let
Thus is exactly the completed-row factor for the summand of Equation (12.5) after the marked slots have been summed. The fixed tuple affects only in its low separation.
Lemma 15.1 (The compensated completed-row norm). For every , every fixed rescaled subset , and every , with ,
The bound is uniform in the fixed rescaled tuple and has no loss depending on the mesh of the surviving slots.
Proof. Put and for . Since even when share primes, and , Mellin inversion of the displayed integral defining gives the physical smooth factor
Here is the Gaussian of Lemma 4.6. Empty products are one.
Use the fixed translate partition from that lemma on . On the annulus , retain the single joint profile
The logarithms of and of all the lie in fixed compact sets on this support. Thus the logarithm of the Gaussian argument is . The derivative estimate in Lemma 4.6, with this bounded shift and the fixed slot windows, gives for every fixed , , , and fixed seminorm order ,
The constants may depend on the fixed slot system, but not on its moving prime labels. On an annulus , an absolute bound for the row norm is at most for some fixed exponents, by the elementary row, slot, and ideal counts. Choose larger than the fixed logarithmic radius of and discard only whole annuli with . Summing their norm bounds and then squaring gives less than any prescribed power of . Every annulus meeting is retained.
For each remaining annulus, keep fixed individual annular cutoffs equal to one on the support of and apply Lemma 4.5 to this whole profile. Its logarithmic Fourier inversion uses one coefficient density common to every row and every surviving slot tuple. The normalized slot ratios remain variables of the joint profile until separation; they do not index separately chosen densities. For fixed Fourier variables, each resulting slot coefficient is a product of the original arithmetic coefficient and an individual annular cutoff and norm power. It remains bounded and independent of the row and of every other slot. The completed factor is an annular test at length
These retained lengths lie in a fixed bounded range. The weighted Fourier norms have a summable total by the displayed Gaussian estimate; the small annular weight stays in this homogeneous single-profile Fourier norm, not in an inhomogeneous tuple seminorm. Minkowski’s inequality passes the separated row norm through this common density. The existing normalization stays unchanged when the test scale is recentered, so no additional power of is introduced. Choose within the final allowance. For each fixed , Lemma 5.2 supplies the row-sector reduction of with every original zero mask. It covers all nonzero element rows, including those meeting ; no factor is used in this row norm. The row ball depends only on the fixed rescaled tuple , through , and is independent of the surviving marked slots and dual variables. The physical slot sets remain disjoint and their separated coefficients are product-form. Finite triangle over and Lemma 14.3 therefore give the exponent in (14.14) at this actual , taking the retention parameter and the independently prescribed output and separation losses all at most a small . We use the exponent after the fixed row parts are summed; their count is already included in , with principal exponent , and is not counted again.
Here and the puncture is , so the only moving non-slot primes are those of the row. After the finite unit and reflection-sector splits in Lemma 14.3, freeze its powerful part of norm length and its valuation-one part supported on , and split its residual squarefree good product into actual dyads of norm . Let be nonnegative and large enough to contain all fixed annular and fixed-conductor logarithmic offsets in this calculation. Then
The actual row and dual annular cutoffs are kept in one joint profile while its common Fourier density is separated. The small kernel amplitude is extracted from that homogeneous density before the row norm is squared, and only then may the positive sieve sum be enlarged, as in Equation (5.24). In particular the kernel saving in Equation (14.14) uses this ; it is not reevaluated on any shorter rows added by the positive enlargement.
In the notation of that energy estimate, every moving non-slot prime counted in divides the powerful row part to exponent at least two. The comparison of its exact norm with the powerful dyad, and any fixed-conductor contribution, therefore gives
The available dual length at the actual completed scale is
Since , direct subtraction gives
As in the proof of the reflected energy, dual ranges below a fixed negative length are negligible after a positive Mellin shift, and the bounded boundary range costs an arbitrarily small power. The source dual ideals in these dyads retain the support of Equation (5.2): they may share primes and may contain the permitted primes of ; no additional -mask or coprimality condition between and is imposed. On each remaining dual dyad, put . Retention gives , while the nonzero unit ranges give after increasing its fixed constant. It follows that
Write for the quantity called in Equation (14.13). If , then , the kernel term is nonpositive, and
Here the standalone is the powerful-row logarithmic length. It follows that
Otherwise , and the bounded unit ranges imply
The last inequality holds separately for and . Here the squared kernel saving is obtained by first extracting from the common Fourier density and only then squaring the row norm. Relative to , the saving before the remaining is exactly
The second numerator is nonnegative. Since , the energy in this branch is at most
After using and absorbing , the two upper bounds are
They are nonincreasing in . Since , their formal values bound every actual dyad up to , whether or not an endpoint dyad occurs. Their maximum is therefore at most . At one has and the clipped unit range falls in the first branch; bounded negative unit dyads change only . Choose and within the prescribed allowance, and then increase the fixed-data lower threshold so that also lies within it. Summing the logarithmically many row and dual dyads proves the lemma.
The additive Gram bound
We next estimate the additive factor in the range . The full correlation of Lemma 13.3 retains the collision zeros that determine both its cancellation and its exceptional frequencies.
Proposition 15.2 (A quantitative additive Gram bound). Fix the arithmetic data , the annular weight , and a ray class . Let be in fixed polynomial ranges in , and suppose
For a real height , put as defined in Section 6. For every fixed row ball and every , one has
Here is a fixed seminorm order, independent of the moving scales and of . The same assertion holds for any fixed finite linear combination of the ray coefficients . No arbitrary row-dependent arithmetic coefficient is asserted.
Proof. Majorize the row ball by a fixed nonnegative radial Schwartz function. Put and, on the primary elements prime to , , extended by zero elsewhere before the inverse character is evaluated. The exact annular rewriting of the polynomial is
Thus the expanded square has the common normalization and the joint annular profile contains the factors . Write , , with . Poisson in the row variable has factor , whereas the complete transform of the two unnormalized Gauss sums is . It therefore gives the exact prefactor and the correlation of (13.7). Here again denotes the full correlation of (13.6), not the local coefficient of (7.1). The first Fourier kernel has argument comparable to .
On coprime residuals the factor in that correlation has . For the subsequent signed extension use its specified bounded extension, periodic modulo in both columns, including when shares primes with a column. Its value is defined to be zero when a prime of divides both columns; this is a definition of the extension, not a claim about the genuine correlation there. Before any factorwise estimate, insert the complete Möbius identity
and write . No coprimality condition on is then imposed. Nonzero terms have . Throughout this step use the fixed ray extension of ; a quotient of zero residue symbols would not be defined.
We specify a common fixed modulus for that coefficient. For write using the unit convention and the fixed -prime generators of Lemma 4.1, with and . For a primary residual ideal outside , reciprocity gives
Every displayed good local power retains its zero on a shared prime, including when . Lemma 4.1 places the finitely many in a fixed ray group supported on . Also belongs to a fixed finite family in .
Choose once to contain the primary-class modulus and the zero masks, the moduli of every fixed ray coefficient in , a period for in each variable, and the conductors of all the preceding characters. The extended coefficient is zero off the primary class or at a fixed nonunit before any inverse character is evaluated. This modulus is independent of , and may have higher powers at than . After reciprocity the joint arithmetic coefficient in is periodic modulo
If has a valuation not divisible by six at a prime outside and , call nonexceptional. At that prime the first residual column has the nonprincipal zero-extended factor up to a unit scalar. The lift, the fixed phases, and the other prime factors are independent of modulo . Its complete mean, and hence the complete joint mean by the Chinese remainder theorem, is zero. The substitution by does not change this conclusion because . Principal zero masks at valuations divisible by six remain present in the exceptional case.
The frequency contributes only the diagonal: the correlation forces and equals . There are possible of norm comparable to , each with . Its contribution is therefore .
For , split the Fourier argument into dyadic shells , with and the first shell including all arguments at most two. Choose dyadic centers for and , with the first dyads containing the bounded unit ranges. Use the nominal positive residual scale
The actual residual norms lie in fixed multiples of ; the nominal value is allowed to be below one. Fix arbitrary and . For each fixed , the one joint annular profile for the two columns has the finitely many homogeneous single-profile seminorms used below bounded by , with one fixed chosen after these derivative orders and . This follows by differentiating the first Fourier kernel, whose Schwartz decay absorbs every resulting power of ; derivatives of the norm powers cost a fixed power of . This factor remains in the single-profile Fourier estimate and occurs once in the linear lattice sum below; no small inhomogeneous tuple seminorm is used.
Let be this periodic arithmetic coefficient. For a nonexceptional frequency its normalized complete Fourier transform, with normalization on the two residue variables, has absolute value at most and vanishes at . Since every ideal of is principal, the period lattice has linear scale . Four-dimensional lattice Poisson therefore gives, for this ,
For , the zero frequency vanishes and the other dual vectors have linear scale . Fourier decay of order bounds their sum by . For , use the point count in the two annuli. A nonempty subunit annulus has bounded below by a fixed positive constant, so it still contains lattice points; below that constant it is empty. This proves Equation (15.5) without any primitivity or tensor-product assumption on .
Put . The fixed shell comparison constants give for a fixed . Hence the nonzero frequency range is empty when . On a nonempty range, elementary lattice counting gives
There are therefore choices of on these dyads. Multiplying Equation (15.5) by this count and by the common prefactor gives at most
For the required positive dyadic sum is
For , split the two geometric tails at ; for , the left side is bounded and the displayed right side is larger than a positive constant. Thus the nonexceptional frequencies contribute
after the sum, on choosing a fixed .
It remains to count the exceptional nonzero frequencies. They have , where is sixth-power-free and supported on the primes of and the fixed support. There are at most possible . For each of them the shell bound permits only . If this range is nonempty, its upper bound is at least one, and the ideal count gives choices; if it is empty. Unit factors cost only a fixed factor. Hence there are such elements , including the bounded subunit range of .
Use , , and the trivial two-column point count. Before multiplication by , the contribution on these dyads is
The sums over converge after reducing the arbitrary small power, and the sum converges for the same fixed . This gives the term . Adding the diagonal and nonexceptional terms proves the proposition.
Completion of the low bound
The two preceding estimates now apply to the two factors of the same rescaled summand in the exact low separation.
Proposition 15.3 (The compensated low estimate). For the probe in (12.5), the geometry in (12.4), and every ,
The exponent is independent of the target and the slot mesh; the constant and lower threshold may depend on the fixed arithmetic data, slot system, and smooth tests.
Proof. For a fixed rescaled subset and tuple, put . Its separation is (6.2) with and . Put ; the fixed annular supports give uniformly in the tuple. Exactly,
In particular for . Enlarge the allowed fixed-data lower threshold so that uniformly over the tuple ratios as well; this is possible because and . The remaining length inequalities are
The last one gives
and hence . Proposition (15.2) therefore gives
Cauchy–Schwarz in the row sum, Lemma 15.1, and the integrability of now bound this tuple’s unscaled separation by times
Since is bounded, this is .
For there are at most rescaled tuples, the coefficient is , and . The total additional exponent is consequently
Choose the small powers in the component estimates so that their sum lies within the prescribed . Summing the finitely many subsets proves (15.6). For the already defined of (12.3), the normalization used for the principal signal satisfies
Thus, under the contradiction assumed in Part II, this low bound is smaller than by the exact power , apart from the arbitrarily prescribed .
The local compensation and its errors
The physical modification in Section 12 has already been estimated from its separated low representation. We now identify its full Euler correction and bound the local errors left by the two-term operation. Throughout, the local notation , , , , , , is that of Lemma 7.1; in the shared analytic estimates its variable is called . Fix a nonzero sixth-power-free physical row with . All slot primes belong to the sets of Section 12; for each such prime put . As in Lemma 7.1, write , , and . The factor inside is distinct from : at , the latter and vanish, while the former retains its unit phase.
The full holomorphic correction
For a fixed slot prime , restricting the completed index to replaces by in the high series. Changing to multiplies its Mellin weight by . The marked term of Equation (12.5) therefore has, at points where is defined and nonzero, multiplier . The rescaled term has multiplier
Thus, on the same locus, the exact local multiplier of the two-term operation is
Define the combined local replacement by
At points in the Euler regions where the raw quotient in Equation (16.1) is defined, one has . The displayed formula defines also where that quotient is not defined. There is neither a nor a denominator on the right. The bounds in Lemma 7.1, together with its formula for , show that is holomorphic in both stated Euler regions, including at zeros of or .
At points in the Euler regions where the selected quotients are defined, write the full slot multiplier
The correction used for contour moves is defined without these quotients:
This is the full correction after the scalar quotient in Equation (7.13) has been extracted. To verify this assertion, fix an allowed tuple and put . On the absolute starting lines the selected operation replaces by
The equality follows by substituting into Equation (16.2). It extracts the same scalar local factor as at an unselected prime. Each selected prime occurs exactly once, because the slot supports are disjoint. The complete factor for this tuple is therefore the scalar quotient in Equation (7.13) times its summand in Equation (16.3). This reasoning involves no division by or . At points in the Euler regions where all raw selected quotients are defined, the same finite sum also factors as .
The unselected product in each summand converges normally in both Euler regions. More quantitatively, in any fixed subregion of Equation (7.14), put . The primewise defect bounds in Lemma (7.1) give, uniformly in the selected tuple,
The first positive product converges by the ideal count, and the second satisfies the divisor-product bound. Omitting selected factors only removes factors from these positive majorants. In the second Euler region the same argument uses the respective defect exponents and . Thus Equation (16.5) holds there as well, with the corresponding positive majorants. No non-vanishing of is asserted by these upper bounds.
For each fixed , Equation (16.3) is a finite sum of products of holomorphic selected factors and normally convergent unselected products. It is therefore holomorphic on a neighborhood of every point in both Euler regions. It also satisfies the all-height requirement in Definition 10.1. Indeed, on a fixed real box in either region, the formula for and the denominators bounded away from zero give for some fixed , uniformly in all imaginary parts and unit phases. There are ideals in a slot and there. The finite tuple sum and Equation (16.5) consequently give
for a fixed on that box. For this is Equation (10.4), even with height exponent zero. All constants here are fixed before any later order of integration by parts.
Combining the exact finite operation with Equations (7.5) and (7.13) now gives
This identity is absolutely convergent on the displayed lines, because for fixed it is obtained from finitely many absolutely convergent rescaled base-probe identities. It has no additional outside Euler factor. It verifies the exact high representation of Definition 10.1 for the physical expression , with the geometry in Equation (12.4). In particular, , as required by Equation (12.3). It is an identity for the very probe bounded in Proposition (15.3). Every continuation uses the full correction in Equation (16.3), not a globally defined product of individual quotients.
Dynamic local errors
At an identity-ray prime every fixed phase from is one, although may be any unit. Suppose first that and put . Then , and . Using and gives the exact normalized cancellation
This is an identity of holomorphic local expressions in the Euler regions. Within these regions, on the raw quotient locus its left side is . To see the cancellation directly on that locus, substitute and into the left side before normalization. The constants , and sum to zero. The resulting rational identity has only the denominators , , and , which are nonzero in the Euler regions; hence it gives the displayed holomorphic identity there. For , the main term is zero by the original zero extension, and Equation (16.2) instead becomes
We now give the bound on the remaining error slots. Its analytic input is stated explicitly: the reflected primitive numerator must be small at the retained height. Instantiate Section 8 with the current fixed data and , using its zero-extended presentations for and . The numerator and its conjugate belong to with fixed multiplier , while the denominator belongs to with fixed multiplier . The buffered estimates there, together with the inverse deleted-factor bound of Lemma 4.10, therefore supply the reflected-numerator hypothesis below at the retained heights: for the points used below, and , within the buffered rectangle. The identity-ray restriction makes every fixed phase equal to one at a slot prime, without changing the physical row or any nonunit zero.
Proposition 16.1 (Dynamic local errors and conductor allocation). Let , , and take
Choose sufficiently large in terms of and the fixed data. For and a sixth-power-free row with and , let be the primitive character inducing . Let be any subset of . Suppose is nonprincipal and, uniformly for ,
with any prescribed small power. For this row on the displayed dynamic region, define by its preceding slot sum, interpreting each as , with from Equation (16.2). The stated choice of makes there for every slot prime, as proved at the start of the proof. This statement asserts individual continuation only on this dynamic region. Define the main and error parts of a slot by
Then, for every subset of the slots and the same points ,
The main parts retain the physical row, all zero masks, and the fixed identity-ray restriction. In particular, their central normalization is
At the same points , and on this dynamic region only, the full correction has the finite decomposition
Proof. In this region . The estimates in the proof of Lemma 7.1 sharpen to for and for . Increase the fixed so that for all these primes. The holomorphic factor in (16.2), divided by , now defines throughout this region. It is , not the possibly singular raw factor , that is bounded away from zero when .
Consequently the tuple sum in (16.3) factors as on this dynamic region. Substituting proves (16.10). This factorization is not used to continue the correction outside the present region.
For , (16.8) and the estimate for give
The four exponents are bounded respectively by , , , and . Division by the bounded preserves this estimate. The number of primes in a slot is by the ideal count; hence its total contribution from , including , is .
For there are only divisor-many possible labels. A monomial in is multiplied by in , so after separating its exponent is plus the exponent of that monomial. For the non-tail boundary terms of the six-valuation table, these exponents at are
| 1 | 2 | 3 | 4 | 5 | |
At positive their changes are respectively , , , , . They are all strictly below in the stated range. The common term is smaller still: its exponent after separating is at most . Additional valuation pairs and values have ratios and , so their geometric sums preserve these bounds. The strict second-family term with an additional is also smaller than after this normalization.
The sole remaining term is the strict term, which occurs for and is . Its exponent after separating is . The explicit rescaling term has exponent after separating , so it needs no further estimate.
Let be the conductor of . Write , with a unit. For primary coprime to , reciprocity gives
The unit exponent is read modulo six. The prime formula extends to composite : when ,
Thus the unit factor depends only on modulo 36, and the product depends only on modulo 4. Together with the multiplicativity of and the local symbols, the displayed norm congruence makes the right side multiplicative on integral ideals prime to ; extend it to their fractional ideal group. A generator congruent to one modulo is already primary and makes every displayed factor one. This character therefore has a ray presentation with that fixed modulus times . It agrees with the Kummer character of Lemma 4.1 on ideals avoiding . These characters induce the same primitive character: in the principal ideal ring , the Chinese remainder theorem supplies a representative avoiding the additional finite set in every ray class of a common modulus. At a good prime , hold the fixed class and all other good residues at one and vary the residue modulo by the Chinese remainder theorem. The remaining local character has exact order . Its conductor exponent at is therefore exactly one: the displayed ray modulus has only the first power of , and the character cannot descend to a modulus omitting . This is a local assertion; the ideal character may still need the fixed normalization modulus at 2, 3.
It follows that, for any set of distinct selected ramified labels,
The functional equation for the primitive numerator [11 Equation (1.1)], the assumed reflected bound, and Stirling give a cost , where
At a selected the primitive character already has value zero, so restoring the original local factor there multiplies by exactly one. The remaining deleted Euler factors have radical and cost at most , because .
Expand a product of error slots into their coprime-prime terms, their already bounded ramified terms, and their strict ramified terms. For each fixed tuple in this triangle expansion, let be precisely its strict ramified labels. They are distinct because the slot supports are disjoint. Apply the single inequality (16.11) to this entire before summing the labels. The numerator together with these local factors, including at each selected prime, is then bounded by
because and . Thus different selected labels use different factors of the conductor deficit, and the bounds hold simultaneously. Summing the divisor-many ramified labels costs , while the coprime labels have the stronger exponent . This proves (16.9).
This argument uses triangle only on error labels. It never changes the physical row or the coefficients and masks in any main slot. The tuple-independent factor separately costs by Lemma 7.1. Relative to the central scale of a main slot, an error slot thus has no positive amplitude exponent in the later row count.
The principal local factor. In the second Euler region of Lemma 7.1, take and . Then in (16.8), and is bounded away from zero after the same fixed enlargement of . For this principal row on this region, define and define by the same slot sum as above. The lower bound and the disjoint supports give the separate principal factorization
in the second Euler region.
This does not extend the central main/error decomposition beyond its stated dynamic region. The four error exponents are now
Each is at most in that region. Hence the principal multiplier satisfies
uniformly in the imaginary parts and the target unit phase. This is the local estimate used to normalize the principal residue.
It also gives the absolute principal correction required by the shared residue estimate. Indeed here, and the unselected product has a bounded positive majorant by the second-region version of (16.5). Ideal counting in each annular slot therefore gives, on every fixed real box in the second Euler region and uniformly in all imaginary parts,
This uses the separate principal-row lower bound only to obtain the local approximation; it asserts no nonvanishing of a general .
Absolute bounds for the remaining contour lines
The dynamic decomposition is not available on every contour used by the shared analytic estimates. The following bounds instead retain each selected factor before taking absolute values.
Lemma 16.2 (Absolute local tuple bounds). Let , and let be a nonzero sixth-power-free row with and , with fixed comparison constants. Retain the fixed physical slot system of Section 12. The following bounds are uniform in all imaginary parts and unit phases.
On
one has at selected primes and at selected primes .
For every fixed , on
one has at every selected prime.
In either case the positive sum over the full selected tuples satisfies
The constants may depend on the fixed data, , and, in the second case, , but not on , or the imaginary parts. These estimates remain valid at zeros of or .
Proof. Both sets of lines lie in the first Euler region with . Its primewise defect estimates give , while (16.5) bounds the positive product of all unselected factors by .
Consider first , , and . For a selected , (16.8) gives
The four exponents are at most , , , , respectively. Consequently off , without division by .
For a selected , one has and . Equation (16.2) becomes
After multiplication by , the strict term of the local table has exponent at most ; for it also contains the factor . The exponents of the boundary terms , in order , are
They are bounded above by , , , , , respectively. The common term has exponent . All further terms in the geometric families decrease these powers, since and . Finally . Hence on , also at a zero of .
The labels dividing are divisor-many, while a slot contains ideals. Its positive sum is therefore
Using the positive majorant for the unselected product and distributing the requested among the fixed number of slots proves Equation (16.15) on the first lines.
Now fix and . For a selected prime off , the four exponents in Equation (16.8) are , , , , so . On , the strict term after multiplication by has exponent at most . The boundary exponents are , , , , , the common exponent is , and , . The rescaling term is . Thus on as well. A positive slot sum is consequently . Together with Equation (16.5), this proves Equation (16.15) on the second lines.
Equation (16.7) supplies the full high representation of the physical function just bounded on the low side. Proposition 16.1 controls the error factors jointly with the numerator, and Lemma 16.2 supplies the bounds on the remaining contour lines. The main factors are the prime polynomials displayed in Proposition 16.1. To count rows on which those factors and a detector witness are large, we next prove the inverse and fourth-moment estimates used in Section 19.
The inverse moment with prime factors
We now bound an inverse Dirichlet polynomial multiplied by independently weighted prime sums. The estimate applies to the inverse witness in Section 8 together with selected main factors from the local compensation. Its proof uses the completed row energy of Section 14. A final amplification gives an unmarked estimate on sixth-power-free rows at longer column lengths.
Statement of the marked estimate
Let be a fixed finite-order ray character whose full zero-extended defining modulus has prime support in . This entire presentation belongs to the fixed arithmetic datum; a locally frozen moving zero support is instead retained as a puncture whose radical is included in the explicit norm bound below. Fix one sign , and set
The only masks in this definition are the fixed exclusions and the zero extension of . For a smooth annular function , define
For a fixed finite set of slots, let be disjoint sets of primes outside , with for . The sets and the coefficients are independent of , and . Given fixed smooth annular functions , put
The empty product is one. A fixed finite sum of whole products is also allowed by triangle inequality, provided each summand uses one common in its inverse and all of its slots.
Lemma 17.1 (Marked inverse moment). Fix bounded ranges for the nonnegative parameters , a bound for , and positive constants . Suppose
Then, for every ,
The implied constant may depend on the fixed arithmetic data, , the bounded parameter ranges, and finitely many smooth seminorms of the tests, but is uniform in the prime supports and their bounded coefficients. The assertion holds for either common sign , and for every subcollection of the slots. Norm twists of the tests have a fixed polynomial cost in their heights. There is no lower bound on the individual slot lengths other than the existence of their stated prime supports, and no mesh condition on those lengths.
The proof passes through the canonical family defined next, in which a fourth-power residue symbol is averaged over an additional squarefree ideal. Lemma 17.2 is proved by a terminal application of Lemma 14.3 and a recursive step using two masked Poisson transformations. After the principal contributions and tails have been handled, the retained part is bounded in terms of new admissible sums of that family with a shorter row range. A separate initialization using one masked Poisson transformation then deduces Lemma 17.1, and the final subsection gives its longer unmarked consequence for sixth-power-free rows.
The canonical estimate
Use the fixed puncture, squarefree coefficient, row character, and product-form mark defined in Section 14. The additional squarefree label is now averaged, with a divisor-bounded weight depending on that label alone.
The following is the statement closed by the two Poisson transformations. Its puncture bound is part of the hypothesis, because a frozen moving modulus cannot be treated as part of the fixed arithmetic data. For the recursive Poisson large-sieve framework, compare [16 Section 2], [17 Section 4], and [13 Sections 4–7]; the present marked recursion is proved below.
Lemma 17.2 (Canonical marked estimate). *Fix bounded nonnegative ranges for , a bound for the number of slots, and . Let range over squarefree ideals outside with . Let be a nonnegative function of alone satisfying for one fixed . Neither nor the choice of depends on , the current rows, or any other averaged variable. The implied constant below may depend on , but is uniform over all satisfying this fixed bound. Let be a fixed multiplicative finite ray character whose full zero-extended defining modulus has prime support in , and let be a fixed puncture. Both are independent of . Let have the product form in (14.1), with disjoint fixed prime lists of total length at most and bounded coefficients independent of . No other row-dependent column coefficient or puncture is allowed. There is no additional residual coefficient , even one independent of , : arbitrary bounded weights are permitted only as the stated product of individual prime-slot coefficients.
Put . Suppose
For every smooth annular and every , define
Then . The constant is uniform in the moving moduli and the frozen outer ideals within the stated ranges. It depends on finitely many smooth seminorms and has a fixed polynomial dependence on separated norm-twist heights. The same conclusion holds for all subcollections of the slots with the original cap , including the empty collection.
The reflected energy in Section 14 supplies the terminal estimate for this family. The remaining ranges will be reduced to the same family with shorter rows. Before the two Poisson transformations, we give the common analytic rule for propagating smooth seminorm and height orders through the finite induction.
Finite propagation of seminorm and height orders
We use the following abstract statement about a finite sequence of estimates. It does not assert that any particular arithmetic reduction has its hypotheses. Its purpose is to state exactly which uniform bounds on transformed profiles and Fourier coefficient measures suffice to choose all internal derivative orders before an external height cutoff.
Write . Let a finite rooted directed graph have no directed cycles, and let every directed path have at most edges. At each vertex let be a nonnegative quantity, where , is a fixed finite tuple of annular profiles, and is a finite-dimensional height vector. The profile dimensions, supports, and height dimensions may depend on , but are fixed throughout the graph. Additional labels are allowed in these quantities; every bound below is required uniformly in those labels.
Lemma 17.3 (Finite seminorm propagation). Suppose that at each vertex there is a terminal bound
with fixed real and finite nonnegative . Suppose also that
where are fixed bounded linear maps and is the child profile tuple. Empty edge sums are allowed. Assume the following two bounds for each edge. For every fixed there are finite nonnegative numbers and a constant such that
For every fixed there are finite nonnegative numbers , , and a constant such that
The seminorm indices may be rounded up to integers. All these constants and indices are uniform in and the additional labels; the exponents are fixed real numbers independent of the requested seminorm and height orders.
Then there are finite , , and such that, at the root ,
The indices , , can be selected backward through the at most stages. In particular they are fixed before any restriction is imposed.
The same conclusion holds for a finite product of children in an integral. Precisely, an edge term may instead have the form
where is a fixed integer and are fixed, all children have smaller remaining depth, and each child profile satisfies its own version of the stated profile bound. The joint coefficient measure satisfies the same weighted bound. In this case define the norm exponent recursively by
The conclusion holds with . This form includes the square roots of two nonnegative child estimates arising from Cauchy–Schwarz.
Proof. At a terminal vertex the assertion is its stated bound. Suppose a child has already been bounded by . Since the linear maps are bounded,
The child-profile bound adds the power to each of these two height exponents and replaces its profile factor by . Use the coefficient-measure bound with . The contribution of this edge is at most
Every displayed index is finite. Take the maximum of these indices and of the terminal indices over the finitely many outgoing edges, increasing the profile exponent when necessary because . This proves the parent bound with exponent equal to the maximum path exponent through that vertex. Reverse induction on the acyclic graph completes the proof. None of these choices mentions an external cutoff or a late derivative order.
For the product form, insert the already proved bound of each child and raise it to . The total power of that the coefficient measure must integrate is
The powers of the parent profile and of are the corresponding finite sums, followed by the single coefficient-measure bound at . The powers of add as in the displayed recurrence for . Taking maxima over the finitely many terms proves this extension by the same reverse induction. ∴
Corollary 17.4 (Indexed finite propagation). In Lemma 17.3, let denote any admissible length and outer labels at a vertex , and let be its desired norm exponent. Suppose the terminal bound, after division by , has the form in that lemma with a fixed exponent . An edge may be indexed by a -dependent family with a nonnegative measure , and may have the form
where the child labels may depend on . Assume uniformly in those labels that
with fixed , and that the child-profile bounds of the lemma hold. Assume also that for every fixed ,
where is fixed independently of . When the quantities are squared Hilbert-space row norms obtained by separating a profile, this hypothesis must use the coefficient measure common to those rows. There need only be finitely many edge types at each of the finitely many depths; the cardinalities of the may vary with .
Then has the conclusion of Lemma 17.3, uniformly in , with terminal exponents and edge exponents . In particular all required seminorm and height orders are finite and independent of an external cutoff.
Proof. Set . Substitution in an edge and (17.4) bound its norm power by times the product of the normalized children. Insert their inductive bounds. As in the product proof of Lemma 17.3, the required coefficient moment is
which is finite and independent of . (17.5) at this order contributes and only finite profile and height orders. Backward induction over the finite edge types therefore gives exactly the stated normalized recurrence. A label averaged inside a child remains inside that child throughout this argument; it is not a second integration variable of .
We make explicit how discrete labels are normalized in this corollary. After the relevant weighted Cauchy inequality, suppose a nonnegative outer measure satisfies , with fixed and selected before the height orders. For a per-label prefactor common on the block, put
Here denotes unit point mass. For nonnegative for which the displayed integrals are finite, the exact identity is
Uniform weighted moments of now give (17.5) with only the remaining mass. Thus a displayed exponent that already includes the count must use this normalized measure; retaining the unnormalized sum would count the same labels twice. The rule concerns weighted mass, not cardinality in addition to that mass. It is applied only after any row-dependent eligibility remains within the child or has been removed by a nonnegative inequality. Labels still averaged in a child norm are not included in .
There is a separate normalization for a small kernel amplitude. The single-profile seminorm is homogeneous, whereas is not. Suppose a joint annular profile on a fixed block satisfies, for a scalar ,
One may keep in the Fourier coefficient measure, whose weighted norm then contains the factor . Alternatively, write and put outside that measure. If a polynomial or row vector is linear in this whole profile, then
The tuple containing has bounded, not small, seminorms. A scalar may be removed from a centered difference only when it multiplies the whole difference. A kernel occurring once in an already expanded quadratic expression contributes one factor , not automatically its square. These conventions use either the small measure or the outside scalar, never both. If the positive row range will later be enlarged, the scalar and the common profile are first fixed on the actual annuli, and the norm inequality containing that scalar is obtained before the enlargement.
Here are sufficient analytic ways to verify the two edge hypotheses. Let be a fixed norm monomial and let be a smooth cutoff with compact logarithmic support in a product of fixed annuli. Suppose a normalized kernel has Euler bounds
where is an increasing family of specified finite input seminorm and polynomial height bounds, and is taken nondecreasing in . The product and chain rules give, uniformly for ,
Indeed acting on the kernel is the fixed exponent of in times , and is bounded above and below on the cutoff support. There is no extra factor from differentiation. The same argument preserves a bound with , when those three kernel estimates are available. The decay order is the same at every requested ; only the input order and its finite height degree increase. For an old window with , Euler derivatives are bounded by the global logarithmic seminorms of and introduce no power of depending on the derivative order. Normalized real powers such as obey the same rule. Pure twists of normalized norms insert only fixed powers of their heights.
Ordinary radial Fourier seminorms must be used only after the radial scale has been normalized. For a fixed annular in two real dimensions, satisfies
for any fixed directional derivative of order , by . Thus an unnormalized shrinking radial test could introduce a scale power depending on . Sufficient hypotheses are a fixed-shape radial Schwartz test at its stated row scale, or a radial test constant near zero at that scale. After normalization, Lemma 4.7 applies to its fixed transform, and moving scale ratios enter only as in Equation (17.7). For example on ; the central power belongs to the norm exponent, and the annular factor has order-independent scale bounds. Likewise , and the central unit phase is factored as a scalar before differentiating the normalized profile.
Logarithmic Fourier separation uses a joint cutoff in a coordinate list containing every normalized norm occurring in a coupled smooth factor. Derived nonsmooth row and label masks remain outside that factor and need no coordinate. A nonzero norm used as such a coordinate and initially ranging in a ball down to norm one must first be partitioned into common whole annuli fixed for the current sector; the zero frequency is separate. In bounded logarithmic ranges there are such blocks for a fixed number of variables, so their count costs a preselected small power. The cutoff and its full support depend only on the block centers and fixed data, not on the individual values of the labels inside a row norm. Provided the coupled smooth factor is this one joint function with no further dependence on the individual labels, its Fourier density is common to those rows, as required by Lemma 4.5; separate uniform bounds for row-dependent densities would not imply the same Hilbert-space inequality. Nonsmooth masks are retained or resolved by exact arithmetic identities, never differentiated or incorporated as label-dependent sharp Fourier selectors.
Finally, suppose an internal dyadic ratio , with fixed , has absolute arithmetic count at most . A coefficient bound with the factor gives, for ,
Choose from the fixed , , and the desired internal saving. The actual bound may also have finite input seminorm and polynomial height factors; these enter the finite propagation graph. This tail estimate is not a height-free assertion uniform in all heights. Parameter Sobolev adds only a fixed number of profile derivatives and height dimensions, and all these internal orders are chosen before an external cutoff.
Finally suppose the graph and all of its kernel and annular orders have been fixed, giving height degree . Suppose an additional, external separation uses annular profiles with bounded uniformly in for every fixed , or nonannular profiles with the weighted Mellin or annular norms in the preceding lemmas uniformly bounded at every fixed order, and its discarded integrand has bound with fixed . The external truncation is required to remain outside the graph: it does not replace a profile or a kernel by a cutoff-dependent profile. Given a retained-height allowance , first choose . Then for . After this choice, (4.10) with weight and any fixed integer makes an integrated external tail for any prescribed . For a horizontal join use (4.11) with the additional fixed height weight, or (4.12) for a joint Gaussian slice. When other coordinates on such a slice are extended to the whole real line, the accompanying arithmetic factors must have global bounds on those coordinates; a coordinate entering a denominator controlled only in a buffered region must remain restricted to that region. The external constants may depend on and on the fixed data. This late choice does not alter any internal profile or the internal orders , which is the asserted order of dependence.
Finite Poisson summation with a mask
We now prove Lemma 17.1, using the arithmetic conventions of Section 4 and Lemma 14.3 for the terminal case. The recursive reduction uses two applications of the following form of Poisson summation, and the initialization uses one. Its explicit divisor variable retains every zero extension.
Lemma 17.5 (Masked primitive Poisson). Let be a primitive finite character modulo an ideal , extended by zero on nonunits, and let be any ideal. Let be a radial Schwartz function on , and let denote its Fourier transform for the self-dual measure and the kernel . For ,
where . For a nonprincipal primitive character, and the term is zero. For the primitive principal character the conventions are , , , including at .
Proof. Expand the mask as and write . The scale becomes and the character contributes . Poisson summation in residue classes modulo has prefactor . Its finite transform is
For unit this follows by changing variables. For nonunit the transform is zero by primitivity; for the stated principal convention applies. This proves (17.8). For a nonprincipal primitive character, finite Parseval gives . Writing , there are unit 's, all with magnitude , and . Thus .
A fixed ray restriction can first be expanded into finitely many characters. Each is then replaced by its primitive inducing character, with the removed local zero extensions kept in ; the same formula applies term by term. For the principal modulus the absolute sum of the nonzero frequencies is . Indeed, for all ,
Lattice counting proves this when , and Schwartz decay proves it when . Sum this bound with over . At every use below the relevant nonempty row scale has , so this is also . When principal nonzero frequencies are added or removed while separating a nonprincipal sum, they will carry the same outer row mask as that sum; their absolute contribution is no larger than this full principal bound.
The canonical reduction and its induction
We now prove Lemma 17.2. The reflected energy handles the short completion; the remaining blocks undergo two Poisson transformations to produce admissible canonical sums with shorter rows.
Proof of Lemma 17.2. The order of the analytic choices is organized by Corollary 17.4 in Section 17.3. Its indexed conclusion will be used on each positive Cauchy-side sum separately; the proof below verifies the required common coefficient measures, fixed norm losses, and finite depth.
At each node, every joint Hilbert space uses the current label measure , and that factor is retained exactly once in every parent -sum until (17.32) removes the old label.
At each node keep the parameters fixed, and write
Here is the real length sum , so at the starting node. The two hypotheses at a node with margin are exactly
In particular . The number is the actual logarithmic norm of the already fixed puncture radical, not a dyadic center. The parameter is the fixed logarithmic row length; the first Poisson test has scale .
Let bound the starting row lengths. Choose and put
We use positive parameters , , , , , chosen in the quantified order at the end of the proof. Here is a localization tolerance bounding only the logarithms of fixed annular ratios, is the common tolerance in the two Poisson tail comparisons, and bounds the aggregate freely chosen local small-power losses. At depth set
and impose the row cap . We prove the estimate by backwards induction on . Every retained row parameter below is nonnegative. We shall show that a nonterminal passage decreases it by at least , loses at most in either required margin, and increases the energy exponent by at most . No invariant will be transferred from the fixed to an actual column norm.
The short completion. Möbius inversion of the cube factor in Equation (14.2) gives the exact identity
To check both the mark and the normalization, expand the right side and put . The factor changes the absolute coefficient to
The mark is , independent of the divisor . The divisor sum vanishes unless , proving the identity. Multiplicativity of , including its punctures, is used here.
Use one fixed smooth dyadic partition with nonnegative ideal centers, the unit dyad having center zero. Suppose and that the center of the -dyad is less than . Freeze , assign to it the slots it divides, and retain the others on the completed index. A surviving slot then has the individual coefficient . Since is fixed, this is a bounded coefficient independent of the current , , on the same nominal annulus and with the same cap. It is not the unrestricted original coefficient; the recursive branch below restores its original slot lists separately by the child zeros. For an active subcollection define to be the sum of its nominal slot lengths. Assignments only delete slots, so exactly; an actual tuple norm is never used as this cap. Triangle inequality in the joint Hilbert space uses for the fixed annulus, apart from the separately chosen divisor loss for assignments. The bounded factor is a contraction in that space.
Write . The completion is at the actual scale . Its fixed support gives once the fixed annular threshold specified below is imposed. In Lemma 14.3, keep the actual residual-row dyad and choose the same threshold so that
These are Equations (5.35) and ((14.17)), not estimates for an enlarged row range. Substituting and the first inequality in Equation (17.9) gives
Indeed, the additional terms are .
Take the threshold also to ensure , and discard the whole reflected tail dyads as in Lemma 14.3. Thus every retained dyad satisfies . The row branch of Equation (14.14), after dropping its nonpositive terms, obeys
For the column branch with , the retained dual bound first gives . Equation (17.12) and the first invariant then give
If , its definition implies . The retained dual bound now first gives
Using Equation (17.12), , and then the second invariant yields
Use the reflected estimate with aggregate local loss , including its freely chosen exponent, the label divisor bound, and the finitely many logarithmic sums. If
all three bounds, after adding , are strictly below . In the last bound . For only occurs. The reflected estimate was applied for each fixed ; the weighted mass bound shows that summing its squared bounds over costs at most this amount, already included in the aggregate loss, and cancels the outside . Thus no moving fourth-power label entered the hybrid norm, and these terminal terms satisfy the canonical estimate.
The remaining terms and their marks. At every factorization, assign a slot first to an extracted factor which its prime divides, and otherwise retain it on the residual column. The basic identity for the completion is
More generally, for an ordered list of extracted factors , the exact priority identity is
It holds even when extracted factors share primes. Applying it to each slot and each copy of a square gives a disjoint partition for each tuple of primes; the two copies of one slot have independent prime choices. There are at most choices at one single-factor assignment, and at most for the displayed ordered list. The assigned slots have divisor-bounded coefficients on the extracted factor. Because the original coefficient is , removing assigned slots leaves exactly a subcollection with its original product coefficients. An ideal which will remain an averaging variable is not fixed merely because a slot was assigned to it.
If and , reopen the completion on the right of Equation (17.10). If its cube ideal is , first isolate its dyad with center and the -dyad by triangle inequality in the joint Hilbert space, before squaring. Put and define the fixed centers
Both copies in the resulting square have this same nominal center ; their actual norms need not agree. The mark is , independent of the choice of the divisor of . Multiplicativity gives a factor ; the fourth power in is exactly the mask . The remaining sum over divisors of has absolute value at most a divisor function. After dyadic decomposition and separation of , each squared block is bounded by a small power times
Here is a fixed nonnegative radial Schwartz function majorizing the original row ball, and independently of . Its -dependence includes the original mask ; all other original cube masks are retained. There is no condition . The exponent in front is correct because the original normalization is . If , use the same block with , , . Thus every remaining block has exactly , by the center classification and . The added row can only contribute in the principal cases counted below.
The two-transform reduction. We prove the following conditional estimate for every remaining block in Equation (A). Let . Suppose every energy of the form (17.3), with all coefficient and support hypotheses of Lemma 17.2, the same fixed slot cap, parameters
and both margins at least , satisfies . The hypothesis is uniform over the bounded ranges used in this induction, with finite-seminorm and fixed polynomial-height dependence as in that lemma. For , the remaining block satisfies
with the same kind of uniform dependence. The freely chosen local losses sum to ; the principal terms and discarded tails are included in this estimate. Thus the reduction supplies exactly the implication needed for backwards induction. Its proof occupies the two transformations below: the first produces a positive inverse-polynomial norm, and the second constructs the smaller canonical energies to which the hypothesis applies.
We next specify the support and localization conventions used in both transformations. For an actual ideal or nonzero element , write . For a named scalar center, hat will denote the actual logarithmic norm of its indicated ideal. All ideal centers introduced below are nonnegative centers from the fixed dyadic partition. The already fixed puncture and the ideal introduced below are used at their actual logarithmic norms, without independently rounded centers.
Every individual dyad introduced in the two transformations has a fixed compact normalized support. If is its ideal and its named logarithmic center, we use
This convention applies to the original , , windows and to each extracted-ideal dyad when it is introduced. Errors for products and quotients are the sums of these individual errors; the fresh residual windows below have the explicitly stated bounds , and . These estimates concern fixed compact normalized-ratio intervals, not annuli of ratio .
For clarity, the intervals are fixed uniformly through the whole finite depth as follows. At each factorization choose fresh individual smooth cutoffs equal to one on the quotient supports, and include the full supports of these cutoffs, of the larger cutoffs used in Fourier separation, and of the enlarged label windows. Include also the bounded clipping families used below. Products and quotients of endpoints locate the initial quotient supports, such as those of , the residual , and the child column and label. Iterating this construction through levels gives a finite collection of compact normalized-ratio intervals. If is the maximum absolute logarithm of their endpoints, the threshold implies (17.18) and all the fresh-support bounds specified below. After a positive sum is enlarged, its newly added columns or labels need not satisfy an old parent product identity. Their norm bounds at this and the next node come directly from the full independent fresh windows in . Separated norm powers do not change these supports.
We use the following specialization of the common joint Fourier calculus in Lemma 4.5. Every normalized norm occurring in a coupled smooth factor to be separated from the columns is a coordinate of one ambient profile. A derived outer mask or label cutoff retained in the weight remains outside and needs no profile coordinate. Keep the current individual dyad cutoffs and fresh column cutoffs outside the inversion, until the weighted Cauchy inequality where they are used. Multiply the coupled profile by larger individual cutoffs equal to one on the full supports of those retained cutoffs. For the resulting compact profile , define before summing any current row or label
Arithmetic relations among the norms restrict evaluation points of this identity, not its density. Outer modes stay in the outer weight; for two column coordinates the first test receives and the second receives , whose conjugate supplies . All normalized real inverse-root powers are included in the coupled profile, so the final column tests contain no second copy.
This convention also makes the uniformity quantitative. Write . On a fixed log rectangle, integration by parts with , for , gives
For a fixed radial Schwartz Fourier kernel , every is finite, and
Thus the separating seminorms are uniform for every scalar , with no derivative-order power of . Normalized real powers have bounded Euler derivatives on the fixed boxes, and inherited norm twists have only a fixed polynomial height cost. No sharp cutoff in a column-dependent kernel ratio is put inside such a profile. For the radial Fourier kernels in the Poisson steps, these are the normalized-kernel bounds of Lemma 4.7 and (17.7).
The raw tail estimate we shall use is, for and ,
Indeed, the shell contains lattice points and the kernel is there. Summing the two geometric series proves the display; the same argument applies to the fixed lattice . The proof uses only the large-argument bound for , so it also applies to the reflected kernel on such a tail. Below an actual-ratio inequality is used only to show that the complement of a sector-fixed outer row ball is contained in this tail for each supported raw column pair. That complement is removed before off-coprime extension and before Fourier absolutization. The full smooth kernel is retained inside the ball, whose nonsmooth mask is kept outside Fourier inversion until the relevant weighted Cauchy inequality. The tail orders and the crude raw counts are fixed at the end.
The first Poisson transformation. Expand the square in (A). Put
where , and is the gcd of and . Then , while are squarefree, coprime to one another, and prime to . Let be the fixed centers of , and write , . For , define
and put . Its center is , and . The row character and its remaining zero mask are exactly
Indeed, the exponents at are ; the common off- factor has exponent zero but retains its mask; and the exponent at is . Each nonzero local power is nonprincipal and primitive modulo , with disjoint supports. Thus is primitive unless . Every original column mask and the two factors remain in the expression.
Apply Lemma 17.5 with , and denote its divisor by , with center and . On this genuine coprime expression, the actual conductor length is
The actual kernel argument is , and the Poisson prefactor has exponent . We have not yet truncated or Fourier-separated this kernel.
If , then and for every . The latter condition forces and . Hence and is a square. Even counting all pairs , all equal columns, all labels, and rows, the normalization in (A) gives . If but its fixed annular column window is nonempty, then is bounded by its fixed upper endpoint, so its ideal count is still with a fixed constant. Marks and the retained masks do not increase this bound beyond a small power. When the nonzero principal terms are restored below, they will carry the same outer ball mask as the nonprincipal terms; the last part of Lemma 17.5 bounds them at this same cost.
We next identify its column coefficients. For coprime squarefree primary , CRT and reciprocity give
In the first Poisson root, the factors involving , including the divisor and frequency, are
up to a fixed-ray factor. This follows by writing the CRT factors between and as and using reciprocity. On the conjugated second side is replaced by . The cross factor between is the reciprocity factor , not a quotient of zero-extended symbols.
Put , regarded in the fixed ray group. Equation (4.7) and Equation (4.5) show that the remaining two-column ray factor is
For example, before placing factors inside the conjugated second polynomial, the raw second Gauss-signal factor is . Its corresponding factor written inside that polynomial is . Also . These identities give the displayed quotient. Fix the ray class of and Fourier-expand the displayed function on the finite ray group. Its factors on each side are genuine multiplicative ray characters, denoted by . Their number and coefficient norm depend only on the fixed ray group.
Define
The original fourth power at equals , including zeros. Assign the slots first to . The remaining local factor at on side has exponent
The plus sign belongs to side one. Direct reduction gives the same answer on both sides:
| exponent on both sides | ||||
| 0 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 5 | 0 |
| 0 | 1 | 1 | 0 | 4 |
| 1 | 0 | 0 | 3 | 4 |
| 1 | 1 | 0 | 4 | 4 |
| 1 | 0 | 1 | 2 | 4 |
| 1 | 1 | 1 | 3 | 4 |
Define as the product over of raised to the corresponding exponent in the last column. An exponent zero still denotes the puncture at . The calculation proves that is common to both sides and independent of , , . The nonprincipal coefficient on side , after these assignments, is
It also shows that every character involving the moving is in either or ; their other factors are outer coefficients.
The first transform has produced the inverse-type column coefficient in Equation (C). We next collect its fourth-power factors into one squarefree label before forming the positive row norm for the second transform.
Retaining the fourth-power label from the cubes. Write uniquely with squarefree, and define
Every prime of has positive even valuation in , so . The ideals , are coprime and squarefree; hence is squarefree. Let be the center of , and put
The ideal identity gives exactly
The table above now proves the exact zero-extended identity
Indeed, the primes with exponent four are exactly those of ; every other prime of divides . A prime in both and only repeats the zero already supplied by . We will fix but keep in a later average. The modulus contributes a puncture and is not part of the fixed ray group. For fixed , the choices of , , the factorizations , and the ideals have only divisor multiplicity.
We now localize the genuine first Poisson expression, before extending its coprime support or taking absolute Fourier integrals. The local table gives the exact actual-norm identity
For , the implication and (17.23) give
The second inequality is Equation (17.24). Define the formal center and the enclosing outer row scale by
Relative to , the last actual upper bound has error
whose positive maximum under Equation (17.18) is . Thus the actual-ratio inequality implies for every supported raw column pair.
On that raw expression insert only the outer mask
For each supported pair, its complement is contained in the actual kernel tail ; apply Equation (17.21) to discard that complement, with the raw counts and order fixed below. No indicator of the ratio inequality is inserted. Inside retain the full smooth kernel, including pairs whose ratio is larger than . The mask depends on , , and the fixed sector, but, after the indicated extraction, not on . If , its nonzero ball is empty and the same tail comparison discards every nonzero frequency. Any principal nonzero terms now restored to unify the formula carry this identical mask. Their absolute contribution is bounded by the full principal restoration already estimated.
Remove the condition by
Let be its fixed nonnegative center. This inversion is made after the cross phases have been replaced by the fixed ray functions above. Those functions, the unchanged outer mask , all remaining zero-extended local factors, and the formal product in the smooth kernel define an expression also for noncoprime . It agrees with Poisson summation on the coprime support; the displayed divisor identity then recovers exactly that support. No primitive Poisson formula is asserted for the newly introduced noncoprime pairs. Squarefreeness retains the puncture . Assigned slots at are outer coefficients, while the other slots form the mark on .
Insert dyads of from one fixed partition common to all , not partitions recentered for those labels. The mask implies , so there are only logarithmically many such dyads in the bounded retained scale range. Keep outside every Fourier inversion. Define
The identity on the factorized expression gives . The full fresh -support is included in , so this same bound holds directly on that support after separation, not only on the original product support. The reconstructed formal products used in the current prefactor are also included there.
Separating the first transformed product. We record the actual prefactor before applying Cauchy. It splits exactly over the two column sides as
Equation (17.18) gives on each side
The five error weights are . We now implement this normalization with all real inverse roots in one joint profile. Fix a first dyadic, ray, and slot pattern , and let be the center of its bare- dyad. Use the nine independent normalized coordinates
The exact full root and kernel argument on the formal expression are
Choose fresh cutoffs equal to one on the old -support divided by the individual supports, and retain them in the columns. Retain every current outer dyad cutoff outside inversion. Let be larger cutoffs equal to one on the full supports of these retained cutoffs. With , define the single compact profile
The scalar outside this profile is exactly . In particular, the profile contains each real root once, also when the actual column norms differ. Its transform is defined by Equation (17.19) on the ambient nine-dimensional box before any actual or outer ideal is summed. The norms of , , , , occur only in outer coefficients, characters, masks or individual cutoffs after Equation (C); they require no additional coupled-profile coordinate.
To expose the arithmetic extraction at , put and
Let and . For a fixed first Fourier mode , the remaining polynomials are exactly
Multiplicativity is used on squarefree coprime factors, then through the displayed zero extensions; no character is divided at a zero. The one additional from the mutual-gcd inversion is outer. Apply Equation (17.16) with the ordered list . A surviving prime dividing is already prime to : every prime of is in , and the displayed fourth powers and punctures supply these zeros. Thus has the original individual coefficients and lists, while assigned prime identities and priority masks stay outer.
Here is the full structure of the first separated component. Let consist of and the assigned slot primes, subject to their reconstruction relations and individual supports. In particular , , and , while are derived, not free indices. Let be the product of the assigned original coefficients and priority masks, with conjugation on side two, and let be the product of all retained outer dyad cutoffs. Let be the product obtained in the preceding quotient-free CRT extraction of the old multiplicity , the two original factors, their cube masks including , the extracted zero masks, and the finite Gauss, unit, reciprocity, and first-ray factors at the old outer ideals, excluding the displayed and . It is independent of ; its definition is by that product, not by division by Equation (17.30). Writing , set
For the masked, principal-restored formal first component, Fourier inversion gives the exact identity
Expanding the two polynomials restores the two column modes; the seven outer modes restore the other coordinates of Equation (17.29). Its larger cutoffs are one on the retained supports, and the fresh cutoffs are one wherever the old windows are nonzero. This verifies the identity term by term. The original factors and every outer mask are still in the complete sum.
The first positive majorant. For any finite or absolutely convergent weighted sum we use
Apply this first with on the whole , for each fixed mode. Only now bound the outer factors absolutely. Their pure arithmetic magnitudes are at most a separately allocated times the old multiplicity and the absolute assigned-slot product; the retained support gives . In particular no factorization of has been assumed.
For each fixed old outer reconstruction and nonzero , the relation implies . If its multiplicity is at most , then
The last bound is uniform because stays in a bounded range; is then uniquely determined as an element. This is an old-label fibre bound, not a multiplicity depending on a later new label. The polynomial has no remaining dependence on or on the individual beyond , , the fixed dyadic length , and the fixed ray sector: this is precisely Equations (C) and (17.25), with the norm profiles separated. After the first weighted Cauchy inequality, is simply . At this positive-sum stage, and only now, majorize it by a fixed nonnegative radial Schwartz function which is at least one for arguments at most one. A nonempty ball has , so the second Poisson scale is exactly . The majorant is not substituted as an equality in the original signed expression. More precisely, let consist of
retaining their full individual supports, the source reconstruction relations independent of , the assigned priority masks, and . Let be the product of the absolute original coefficients of its assigned primes, and zero off this set. It is nonnegative and independent of . Each first positive side is at most , times its scalar , times the explicit positive majorant
At this positive step the old cutoff and mode, and the zeros of depending on , may be removed by their upper bounds. The first weighted Cauchy inequality and the old-label fibre bound have therefore removed the old from this positive majorant and every later outer set; their original normalization remains in . After the following count, we apply the second Poisson transformation to its -sum.
Let be the actual log-norm of the even-parity primes with . The table gives , so
Ideal counting with this actual upper bound counts the fixed while retaining . For a diagonal bound which also counts , its full window has exponent at most , giving the combined upper count . The choices of the and of add only divisor factors once are specified.
Combining (17.31), weighted Cauchy, and the old-label fibre bound gives the explicit output of the first transformation:
Each is the positive sum in (17.33): its row polynomial has the Möbius coefficient in (17.30), the cube-derived label is retained, and the old no longer occur among the averaged indices. The following transformation is applied to these positive row norms.
The second Poisson transformation. Fix one of the two positive sums obtained from the first Cauchy inequality. Its polynomial has the form
The coefficient consists of the other factors of Equation (C), with , the puncture at , and the separated weight. It is independent of . In particular is squarefree and
The puncture and the zero of are retained as well. The -sum uses the fixed-shape smooth positive ball at scale .
In its expanded square put
Let be its fixed center. Then are squarefree and coprime, and each is prime to . The row data for Lemma 17.5 are
The common factor is exactly this mask. The character is primitive away from , because its two nonzero local powers have disjoint supports. For , let be its center and write . The actual conductor length is
The last inequality uses the full fresh -support bound for each copy and . For , the implication gives
where
The consists of from the conductor, one from , and two from . Subtracting cancels the same tolerance used in this second Poisson comparison. Thus no separate row clipping or unrecorded boundary error is needed.
Separate the original principal contribution for the direct count below. Before any off-coprime extension or Fourier absolutization, keep on the genuine nonprincipal second Poisson expression only the outer mask
For each supported pair its complement is contained in the actual ratio tail just considered, so Equation (17.21) discards it with the order fixed below. Inside the mask retain the full smooth kernel. The mask depends on and the fixed sector, not on the residual . If , the nonzero ball is empty and the same tail comparison discards every nonzero frequency. In a retained nonempty passage .
The actual second prefactor has the exact side split
For , the same support bounds give
Here . As in the first split, all normalized real inverse roots will remain in the joint smooth profile until Fourier inversion; they are not also appended to the final child tests. All original coefficient masks remain. In particular
on their nonzero support.
The principal case is , equivalently . The nominal identity for its count is
The actual upper count adds from the first prefactor, from the row scale , from the diagonal -window, each from , , and from the combined , count. Their sum is . With the aggregate local loss , this principal contribution is therefore at most . Any nonzero principal frequencies restored to the formal expression carry the same mask; their absolute sum is bounded by the full principal restoration in Lemma 17.5, since .
For the nonprincipal terms, we now identify the new coefficient class. For squarefree , complex conjugation of a primitive Gauss sum and Equation (4.7) give
The raw second factor is ; the corresponding factor written inside the conjugated second polynomial has ray factor . The CRT cross factor of the two primitive roots is . Thus their combined ray factor is
The last equality follows from Equation (4.5) and , first on primes by Equation (4.6) and then multiplicatively. All quotients in this display are in the fixed finite ray group. In particular,
The common multiplicative character also cancels between the two sides.
Insert dyads of from one partition common to all . The mask implies , so their number is logarithmic in the bounded retained range. Let be the center of one such bare-frequency dyad. We now record the exact component to be separated. Fix the first mode and selected side , write
and retain from Equation (17.36). For squarefree arguments put
The old separated test in is denoted by , so . Let denote the retained individual cutoffs on the fixed dyads, evaluated at their normalized norms. For this preliminary pattern , the masked principal-restored nonzero component of Equation (17.33) is exactly
Here brackets denote classes in the fixed finite ray group. Indeed the arithmetic part of factors into and its residual coefficient on . The common row factor is the mask at , whose Poisson expansion gives the one divisor , while the signal calculation above gives the displayed two factors and ray quotient. The restored principal pair agrees by . Its separate cost, and the raw complement removed before this formula, have already been bounded. Thus this is an equality for the specified component of the positive majorant, not for the original signed block.
Define the summand of Equation (17.41) on all individually admissible squarefree by its displayed quotient-free factors, fixed-ray quotient, formal product norms, full kernel, and unchanged . It agrees with the genuine formula on coprime pairs. Insert the complete identity
before any factorwise estimate. Let be the center of the squarefree -dyad and . The are squarefree, with ; they need not be mutually coprime. No primitive Poisson formula is used on this extension. For squarefree put
On squarefree coprime , the exact extraction is
This uses . On an overlap the right side defines the extension to be zero by , without evaluating a nonsquarefree Gauss sum. The two common factors give , including the zero and its fixed-puncture, , and label zeros. They remain in the outer weight through Cauchy. The old gcd also leaves . Since vanishes on , we retain equivalently the explicit outer factor , which repeats that label zero.
Set , and . All moving factors on satisfy the complete zero-extended identity
It uses , also on nonunits. The residual gcd with splits into the repeated zero at and the fixed puncture at . The old punctures at remain. If denotes the fixed group through which factors, put
Then
Thus both new polynomials in a fixed ray summand use the same , and its one bounded coefficient remains outer.
The new canonical data and their admissibility. The second transformation has returned the moving characters to canonical form. We now identify which data will be fixed and which will remain averaged. This distinction also determines the puncture of the child. Put for both sides and define
On the nonzero coefficient support, are squarefree and pairwise coprime: belongs to , forces , , and the retained zero of , together with the old gcd restriction, gives . Thus is squarefree on that support. These common factors remain in the outer weight through Cauchy.
The triple will be fixed before the child row and label sums. Its puncture is therefore independent of those two averaging variables. The ideals remain in the new averaged label; they are not counted as additional fixed labels.
Apply (17.16) on each selected-side copy with the ordered list . Let be the subcollection of the selected side’s slots retained on in copy . Assigned primes and their priority masks remain outer. A surviving prime dividing is already prime to by the fourth-power zero and to by the fixed puncture. These also supply every earlier survival exclusion because . The surviving mark is therefore an original product-form subcollection. An old slot described as assigned to is only a regrouping of an old assignment by this derived support, not a new independent prime choice.
Keep outside the Fourier separation of the full kernel and old windows. Let be the full supports of the current individual dyad cutoffs . Choose fresh cutoffs equal to one on the support of divided by , with fixed full supports in an interval , where . Choose a nonnegative equal to one on , with fixed full support . Include these full supports, and the reconstructed formal product on them, in the finite window family specified above. These full fresh child windows give the formal centers and support bounds
On the factorized expression the bounds follow from the exact products and . The full fresh child cutoff and the full enlarged label window are included in , so the same bounds hold directly on their supports when independent terms are later added by positivity. Those added terms are not asserted to arise from a parent factorization. During the current separation, the reconstructed formal product on the full fresh cutoff is also included in ; thus the bound used in the second prefactor holds on the whole separated side.
Keep the nonnegative label center without rounding it upward. Proceed to a child only if the retained row component is nonzero; then the outer ball has . This gate is separate from any structural outer index set, which may contain zero-weight tuples even when is identically zero. Similarly, if a full fresh child column window contains no squarefree ideal, its polynomial is zero and that component is omitted. If and a child column exists, its norm is at least one, and Equation (17.45) gives . For a retained nonempty child define
This is a bounded change of the test, not a -wide support enlargement. Use the fixed enclosing support interval chosen above. If , nonemptiness gives ; if , then and the same bound follows from . Thus in both cases. The fresh annular cutoffs have support in and uniformly bounded Euler seminorms. Their scale depends only on the fixed sector centers, not on a current row or label. The full union of these clipping supports is included in .
Fix a refinement of by its -dyad, second ray summand and slot branches. Let consist of
with the retained individual supports and slot branches. It contains neither the old nor the current column indices . The identities defining are inherited from , and are the displayed functions of . The set may be taken before imposing and , retaining those masks in the signed outer weight. Let be the product of all newly assigned original slot coefficients and their priority masks, conjugated on side two.
Let be the structural outer set of this transformed component, before adding any independent child rows or labels. It retains , in particular the exact reconstruction , the derived , and the full fixed dyad supports; it also retains the fixed supports, , and its other outer arithmetic and slot conditions. Zero-weight tuples may be retained, and unit Fourier phases are ignored in defining this structural set. Define the set of distinct triples, with no witness multiplicity, by
This projection is taken once over all possible current rows and labels, before fixing any or Fourier mode. Every nonzero transformed term maps into it. Every member has a source witness, which gives , , and . The first of these bounds will be needed for the child puncture; the containing norm balls used for counting do not imply it. The nonempty row and child-column gates stated above remain separate from this structural projection.
Put
Since is an exact definition tied to the fixed parent, substitution in Equations (17.45) and (17.37) gives the exact formal identities
These identities involve the same fixed as Equation (17.9), not an actual parent norm.
For every , choose any source witness. Its actual divisibility and Equation (17.24) give
Consequently the only actual-to-center inequalities needed here are
The first two are not asserted with zero error. In particular the third inequality holds for every fixed triple because of its source witness, even though it need not hold throughout the containing count ball. The new radical in (17.44) has actual logarithmic norm , satisfying
This also holds when its factors share primes with the old puncture, because taking the radical only decreases the norm. The last inequality uses . Use , , and in (17.48). The two child margins satisfy
The nominal cap is unchanged because the surviving mark is a subcollection. Moreover and , whence
For this is at least , hence at least . The same identities give , so . Because its two summands are nonnegative, this bounds the child through the finite depth.
The arithmetic construction has thus produced admissible child ranges with a smaller row length. We next express the transformed sum in their canonical polynomials. The required Fourier density is common to all triples , rows and labels; only after that identity will we apply Cauchy and dominate the reconstruction multiplicities.
A common density for the second transformed sum. Before any actual outer ideal is summed, use the six independent coordinates
Use the fresh cutoffs already chosen. Retain the four current dyad cutoffs and outside inversion, and in the two columns. Let be larger cutoffs equal to one on the full supports of the corresponding four dyad and two column cutoffs. These full supports, , and the formal products on them are the windows already included in .
The exact second root and kernel argument are
Indeed and . Define the one ambient profile
The scalar outside it is exactly . The full denominator and both normalized real column roots are in this profile, and no such root is appended to the final tests.
For , put and define
The polynomial on either new Cauchy side is then exactly
After , , and the finite ray sector are fixed, and are independent of and the new row. The only new characters on are the explicitly displayed row and fourth-power factors; all other phases involving the old , were placed in Equation (17.25) or in the old row . The separated annular weight is also independent of the new row and label. The complete remaining outer weight is
All old pure arithmetic and priority masks are retained in , with their nonnegative old coefficient weight . The displayed two common magnitudes retain every other common coefficient zero, including the one depending on . There is one , one , and one ray coefficient. The label cutoff is inserted as an equality on the original product supports and remains outer.
Let be the fixed -dyad, ray, and slot summand obtained from Equation (17.41) by the complete Möbius and slot expansions above. The exact identity needed for the child is
To check it, expand the two ’s. Since , their modes together with the last factor of Equation (17.56) are exactly . The other four modes are outer. Equation (17.19) restores the full profile, whose larger cutoffs are one on the retained supports. The fresh column cutoffs are one wherever the old factors are nonzero, and on every original label product. The scalar and profile therefore restore the full root, full kernel, and old windows. Equations (17.42), (17.43), and (17.16) restore the arithmetic factors term by term. The fixed-box sums are finite and Equation (17.20) justifies the integral. Extra combinations in the full fresh windows cancel through the old windows in this complex Fourier identity before Cauchy; only later are they kept independently in a positive sum.
The density in Equation (17.57) depends on the fixed sector, , the fixed tests and , not on actual . The coupled kernel uses the bare coordinate, not the derived row; the latter appears only in characters and . The derived label appears only in characters and its outer cutoff. Relations such as restrict evaluation points, not the transform. For every fixed , the Euler calculation in Equation (17.20) gives some fixed with
Indeed the inner weighted integral is polynomial in , because is a fixed cutoff times a unit norm mode; apply the first transform’s bound at that polynomial order plus . The constants are uniform in every actual ideal and every positive kernel scalar, with no height-order power of .
The second Cauchy inequality and the outer counts. Apply Equation (D) to the second transformed sum with on the complete set , for each fixed Fourier mode. In particular , , , and are still in its weight. They retain the squarefreeness of proved above. All other factors in the weight are bounded by a fixed constant, including the bounded number of original assigned slot coefficients, the fixed ray coefficient, the individual cutoffs, and the unit modes. Consequently, only after Cauchy, the absolute weights obey
This is the step which permits the new averaged ideal to remain in the squarefree class.
We first record the exact reconstruction needed to dominate a fibre.
To prove this, a prime of has . The local table shows that it has even parity and equal . If both are one it is in , and if both are zero it is in . Primes of are already in . This proves the implication. Thus also has divisor multiplicity after are specified. Once these factors are fixed, is uniquely determined by the element .
Let bound the original number of slots. At fixed , squarefree , and element , the number of possible with nonzero weight is at most a fixed constant times , where
Here and below denotes the ideal divisor count. For completeness, the ordered allocation of into costs , and splitting costs at most . The choices of with cost at most ; the two choices cost at most . These estimates use and . Equation (17.59) costs at most choices for . Then is fixed, and is the unique element if it is integral. The at most old assigned primes divide , so their choices cost at most . The at most new assigned primes divide , and cost at most . The other first side’s surviving slots disappeared on selecting the first positive side; the selected surviving slots occur twice in its new square, exactly as counted here. Thus the displayed product dominates the fibre even if its actual size depends on . There is no count of the old , no independent count of , and no second frequency count.
Equation (17.34) and the same source witnesses place inside the product of the three norm balls
We use these balls only to bound the number of distinct triples, not as a replacement domain for the child estimate. Ideal counting gives
Here is part of the separately chosen aggregate . In a nonempty sector each upper exponent of these three balls is nonnegative, since it bounds the norm of an existing ideal; the constant term in ideal counting therefore adds no boundary power. In particular is not counted here. The ranges of all three ideals are bounded, so the adjustable divisor bound gives uniformly on the containing balls. Put and introduce the genuinely row- and label-independent measure
The positive canonical children. For a fixed Fourier mode define the positive child sums
The equality is the normalization of (17.3) with this same row ball, the label weight , and the test and puncture in Equations (17.55) and (17.44); if a larger fixed row ball is used there, this equality is instead an inequality in the needed upper-bound direction. The weight depends on alone. After reindexing, is exactly the displayed row ball. Only the now positive outer row and label sums have been enlarged to their full fixed windows. The columns use their full fixed fresh windows, but their puncture, mark, and test have not been deleted or changed. The actual fibre domination just proved gives
Here . The two square roots each supply , hence there is one fixed-count factor. A uniform child bound supplies one total mass , not its square. The child bound will be used only for , using the hypotheses already verified in Equation (17.51).
The energy exponent. The formal centers satisfy the exact identity
This follows by substituting their definitions and ; all extracted lengths cancel and the result is .
We now use the child estimate only for , for which the preceding margins and row decrease have been proved. If it gives uniformly there, with its fixed polynomial height dependence, then Equation (17.63) and the final weighted Cauchy bound above give
The normalized mass is the one in Equation (17.62); witness multiplicity is already in its fibre weights. The common Fourier density is then integrated once using Equation (17.58). It is not part of the discrete measure and is not chosen afresh for any row or label. Thus both the genuine outer count and its normalized mass occur once. The averaged stay inside the positive child sum and are not also counted.
If a child is bounded by , the first prefactor error, the second prefactor error, the fixed count, and the restored normalization give on each positive second-Cauchy side
Both copies of are present: one restores the child column normalization and the other occurs in its asserted exponent. Each of the two weighted Cauchy inequalities takes a geometric mean of its positive sides, so it does not double this loss. The first principal bound is , and the second principal bound above is at most ; both fit the same allowance.
The parameter has an independent quantifier. Let be the maximum number of uses of a free divisor or sieve exponent and of logarithmic dyadic-count factors in one fixed two-Poisson, two-Cauchy factorization tree, maximized over the finitely many assignments with at most the fixed slot bound. Once bounds the log-length of every scale product in such a use, choose each free input exponent at most . For sufficiently large , the product of the at most logarithmic factors is at most . These choices make all non-center, non-frequency local losses at most . They include the retained common frequency dyads and the reconstruction divisor bounds. In particular the distinct allocations and the finite-union dyadic allocation are parts of this single aggregate, not repeated allowances of size . Fixed ray sums and fixed seminorm constants are constants. The same convention defines the aggregate terminal loss . In particular hides no multiple of or .
This proves the conditional reduction estimate (17.17), including its common-measure and finite-order uniformity once the choices below are made. It remains to fix those choices uniformly and apply the reduction through the finite depth.
Order of choices and termination. For the requested canonical exponent , first fix the starting ranges, tests, slot bound, , and then as at the beginning of the proof. Choose
Use this same in both Poisson comparisons. At this point is a target aggregate loss; its subsidiary input exponents are chosen only after the bounded scale range is known.
Choose the individual cutoffs through depth , including every full larger or fresh support and the bounded clipping families described above, and form . Include the product intervals for the active slots and the terminal constants , maximized through the depth. This is finite because there are finitely many factorization types per passage and finitely many passages. Put
These bound all retained scale lengths. Indeed, Equation (17.52) and the bound following it give and . A nonempty column window has , so . The displayed parent products bound every extracted divisor length by . For example gives , and Equation (17.26) then gives . The terminal active conductor is supported on the row, , the puncture, and slots; their total lengths are at most plus the already displayed ratio allowances. Equations (17.11) and (14.11) bound the retained terminal dual lengths by . Under Equation (17.66), all these bounds and the exact conductor product lengths are below . We may now take and choose the subsidiary small exponents that realize and .
Define to be the maximum exponent obtained by replacing every bounded nonfrequency ideal or element sum in either raw Poisson expansion, including both column sums, by its lattice count at length , and every explicit norm factor, including in (17.21), by its absolute upper bound. Replace divisor-bounded coefficients and marks by their trivial polynomial norm bounds as well. Exclude only the frequency kernel itself. The expansions contain a fixed finite number of factors, so this defines a finite uniform number.
For the reflected tail define analogously using its bounded row, local, and active-product counts and with . Do not count discarded dual indices at a retained length. Instead, (5.2) gives on its support
Every other local factor is bounded by the product of over the bounded active primes, independently of after its indicators are dropped. Thus covers all non-kernel coefficients and bounded counts, while the remaining -sum is an unrestricted lattice sum on .
Fix a tail saving . For each Poisson tail, choose a Schwartz order
Equation (17.21) with then makes the discarded raw outer-ball complement , up to finitely many input seminorms and a fixed polynomial in any twist heights. For the reflected whole-dyad tail the actual argument is at least ; use the same lattice-shell bound on and choose
This proves the discarded-tail assertion without presuming any bound on the discarded dual lengths.
Next choose the finitely many Fourier-height and smooth-seminorm orders backwards through depth , above the chosen tail orders and the terminal input orders. Normalized inverse roots are fixed real powers on annuli, and Euler differentiation of a full kernel at a norm monomial introduces no scale power. Equations (17.58) and (17.62) supply the common coefficient measure for each positive indexed Cauchy-side sum. Apply Corollary 17.4 separately to those sums, using the child-profile bounds just proved from Lemma 4.5, and then take the displayed geometric means. The two square roots retain one normalized discrete mass, as already shown, so genuine outer labels are counted only once. Any external height cutoff in a later application is chosen after this internal finite propagation, not inserted into it.
Finally choose large enough for , the thresholds for in Equation (17.11), , , and the fixed -annulus threshold used in the short completion. Impose also the logarithmic bounds defining the aggregate local losses and the thresholds of the input lemmas. All choices precede this final threshold and depend only on the fixed data. Bounded smaller are handled by increasing the final constant.
Now for . Equations (17.51) and (17.52) send every retained nonterminal child to the next depth and its row cap. At depth that cap is negative, whereas every retained row parameter is nonnegative. The terminal bounds are at most ; principals and recursive terms cost at most in exponent. Backward induction gives at depth , and
This proves , with the claimed uniform finite-seminorm and polynomial-height dependence.
Initialization of the marked moment
We now convert the inverse polynomial in Lemma 17.1 to the canonical family. Only one Poisson transformation is required.
Proof of Lemma 17.1. In the product , let be the product of its slot primes and put . Both and are squarefree. Fix the subset of slots occurring in , and write
The product is squarefree. The identities
hold with all zero extensions. The sign is a product of signs on the surviving slots and can be incorporated into their bounded coefficients. The coefficients thus remain of the form in Equation (14.1).
For this fixed assigned subset define from its nominal slot centers:
Then , and is exactly the surviving nominal cap. The normalization satisfies
The actual is the product of the assigned primes, so lies in a fixed product interval. Ideal counting gives at most choices, apart from the separately chosen divisor loss for assignments. Triangle inequality in the row Hilbert space uses to cancel this count. The whole factor is a bounded row scalar, including its zeros, and is a contraction in that space. The residual column is prime to , giving the fixed puncture .
Here is the exact identity underlying this overlap reduction. Let be the surviving subset and put , , and for every slot. On the original support,
For a fixed assigned tuple, its contribution to is exactly
Indeed a squarefree prime to , together with a surviving tuple with , reconstructs uniquely and the prescribed overlap. Squarefreeness of already gives , so no further condition was lost. The sign is a product of the individual prime signs. This also shows that the on both sides of every subsequent square is one fixed ideal: the preceding triangle inequality was taken before that square.
The identity puts in a fixed compact interval. This remains meaningful if is slightly negative in a bounded nonempty window; is not yet a canonical parameter. Choose a fresh individual cutoff equal to one on this full quotient support. For fixed , let be one on the full support of , and let be one on each full surviving individual slot support. The single joint profile
is compactly supported in these independent coordinates. The current cutoff and the individual factors stay outside its transform. Equation (17.19), in dimension , therefore expresses Equation (17.67) exactly as the same assigned scalar and , times
where has the original surviving lists and individual coefficients . Expanding the mark and inverting the joint transform proves this equality term by term. No measure is chosen for an actual surviving tuple. The measure may depend on the already fixed , but Equation (17.20) is uniform for its in the fixed product interval. Minkowski’s inequality is used in the whole row Hilbert space for this one measure. Include the full support of , its larger cutoffs, the surviving slot supports, and the -product interval in the finite collection before the final threshold is chosen. With the same convention as the canonical proof, we then have
on the full supports actually used below, where . For the sign , conjugate the whole residual polynomial, including its finite character, mark, and test; its row norm is unchanged. For the other sign leave it unchanged. It therefore suffices to estimate one polynomial of the exact form
Here is a fixed finite ray character, is the product mark of cap with those individual coefficients or their conjugates, and is or its conjugate. All are independent of the row.
Majorize the original row ball by a fixed nonnegative radial Schwartz function at scale , and expand its square. Let be the gcd of the two columns and write , with squarefree and coprime. Put , so the preceding support bound applies to each . Let be the center of , and write . The row character has primitive modulus and remaining zero mask . Apply Lemma 17.5, with . Let be its center and . Set
where the inequality follows from and the two -ratio bounds. The actual conductor length is
For a positive tolerance , the implication gives
Define the fixed formal and enclosing row scales
The is from the conductor and from the two copies of in the new row bound.
Separate the original principal contribution for the direct count below. On the genuine nonprincipal coprime Poisson expression, before any off-coprime extension or Fourier absolutization, keep only the outer mask
Its complement is contained in the actual ratio tail above for every supported pair. Equation (17.21), with the separate initial raw count and order specified below, discards precisely that complement. Retain the full smooth kernel inside the mask, with no column-dependent ratio selector. The mask depends on , the fixed overlap and sector, but not on the residual columns. If , its nonzero ball is empty and the same tail comparison discards every nonzero frequency; otherwise the retained row parameter is nonnegative.
The actual normalization and Poisson prefactor split over the two sides as
Thus the actual side exponents obey
All normalized real inverse roots will be kept in the single joint profile below, not also in the final child tests. Principal columns have the direct diagonal bound , also for a bounded nonempty negative -window. Any principal nonzero frequencies restored to the formal formula carry the same mask and are bounded by the full principal restoration in Lemma 17.5, since .
Insert frequency dyads of from one partition common to all , not a label-recentered partition. The outer mask implies , so there are only logarithmically many dyads in the bounded retained range. Let be the center of one such bare-frequency dyad, and let be the retained individual cutoffs on the current dyads, evaluated at their normalized norms.
The orientation in (17.68) is now fixed. The calculation in the second canonical Poisson transformation replaces by . On the second side the factor inside conjugation has ray factor ; together with the CRT cross phase the relative ray factor is . Expand it by the fixed group formula above, and in a fixed ray summand put
For a preliminary pattern fixing the overlap, these dyads and the ray summand, and with the earlier mode held fixed, the masked principal-restored nonzero component is exactly
Indeed for the squarefree outside , the common row factor is exactly , and its Poisson expansion contributes the one . The displayed two numerator factors are those of the primitive character and its Fourier transform. The finite ray sum restores the principal pair by . The cost of that restoration and the raw complement removed before this equality were bounded separately above.
Define the summand in (17.71) on all individually squarefree prime to by the displayed separate factors, characters, formal product norms, full kernel, and unchanged outer ball. It agrees on the coprime domain. Insert the complete identity
before any factorwise bound. Let be the center of a squarefree -dyad, , and its retained individual cutoff. The are squarefree and prime to , but need not be mutually coprime. This formal extension does not apply Poisson summation to a noncoprime conductor. For squarefree coprime , CRT and the zero-preserving identity give exactly
The fourth power includes the CRT factor . On an overlap it defines the residual coefficient to be zero, without evaluating on a nonsquarefree ideal. Since outside , the two extracted scalars give
The original residual and overlap exclusions also give . Thus, apart from the assigned coefficients, individual cutoffs, and unit phases, the outer arithmetic weight is precisely
All these factors remain through weighted Cauchy. Set
The factors on in Equation (17.72), together with , supply exactly the original exclusions at and the numerator zeros at . On the nonzero support are pairwise coprime. Apply Equation (17.16) to each mark with this ordered list. Assigned primes and their priority masks stay outer. A surviving prime is already prime to by and to by , so its original individual list and coefficient can be retained. Its mark is an original subcollection of , not a row- or label-dependent residual coefficient.
The substitutions , , and the puncture have therefore supplied the canonical character and coefficient class. We still need a common separated profile, the outer multiplicity bound, and admissibility of the resulting ranges.
Keep outside the common Fourier separation of the full kernel and the old windows. The exact formal child centers and the full fresh-support bounds are
On factorized terms these bounds follow from and . The full fresh column cutoff and enlarged label window are also included in , so the same bounds hold directly for independent terms later added by positivity. The reconstructed formal product on the fresh cutoff is included there as well, so the initial prefactor bound holds on its entire separated side.
Fix a refinement by the -dyad and the slot branches, with the earlier mode held fixed. Before summing any actual outer ideal, use the six independent coordinates
Let be the full supports of the four current individual cutoffs. Choose equal to one on the support of divided by , with fixed full supports in an enclosing interval whose upper endpoint satisfies . Choose a nonnegative equal to one on , with fixed full support . The current four dyad cutoffs and remain outside inversion, and remain in the columns. Let be larger cutoffs equal to one on the full supports of the corresponding four current and two fresh cutoffs. These full supports, , and the formal products on them are the windows already included in . None of these supports depends on a current outer tuple or on a Fourier mode.
Keep . Proceed to a child only if the retained row component is nonzero, which implies . This is a separate gate from the structural outer set below, which may include zero-weight tuples even when the row ball is empty. Independently, if a full fresh child column window contains no squarefree ideal, its polynomial is zero and that component is omitted. For a retained nonempty child define
For a nonempty negative-center window, and Equation (17.74) give , while its upper support endpoint gives . If , then and the latter inequality follows from . Thus in every retained case. The cutoff is supported in and has uniformly bounded Euler seminorms. Its rescaling depends only on fixed centers, not on a current row or label, and its full clipping family is included in .
On the formal factorization , the complete root and kernel argument are exactly
For the first equality use and . Equivalently its root is with . Define the one joint profile
Its outside scalar is exactly . The old -windows are coupled and therefore are in this profile, as are all normalized real inverse roots and the full kernel. No real root is also put in a child test.
For , put , set again , and define
If is the surviving subcollection on side , the precise unnormalized child polynomial is
Its fixed finite character, puncture, product mark, and test are independent of . The two sides can have different tests and subcollections, but both have the same canonical coefficient class.
Let consist of
with the retained individual supports and slot branches. It has no current column index. The functions are the products defined above; the set may be taken before imposing the displayed outer zero masks, which will be in the weight. Let be the product of all assigned coefficients of and their priority masks, conjugated on side two. The complete remaining outer weight is
The cutoff is one on every original label product, so its insertion is an equality before separation. There is one copy of each Möbius factor and one ray coefficient. In particular the common zero at is still present.
Let be the fixed -dyad and slot summand obtained from Equation (17.71) by the complete Möbius and priority expansions. Its exact separated identity is
Indeed . The two column modes, with the last factor of Equation (17.78), are exactly , and the other four modes are outer. Fourier inversion restores the full profile; its larger cutoffs are one on the retained supports, and the fresh column cutoffs are one wherever the old windows are nonzero. Equation (17.75) restores the full prefactor and kernel. Equation (17.72) and the priority expansion restore every arithmetic factor term by term. Extra combinations in the full fresh windows cancel through the old windows in this complex identity before Cauchy.
The transform in Equation (17.79) is chosen from the fixed ambient profile before any actual , and hence before any , is evaluated. It depends on , the fixed tests, and the earlier mode , and may depend on the already frozen , but not on any current outer ideal or reindexed row or label. The bare norm is a coordinate; the derived row and label occur only in the outer masks or in the displayed characters. The relation only restricts evaluation points. By Equation (17.20), for each fixed there are fixed such that
The first bound uses the fixed normalized roots and the uniform Euler bounds of the full kernel for every positive ; has only polynomial -dependence. The second is uniform over the fixed -product interval. Taking larger if needed also controls the earlier row-space Minkowski inequality. No derivative order introduces a power of .
Equation (17.79) now expresses the component in polynomials of canonical shape with one common Fourier density chosen before the current outer ideals are evaluated. It remains to bound the positive fibres and source measure, verify child admissibility from source witnesses, and restore the normalization in Lemma 17.1.
Apply Equation (D) on the whole , including all quotients , before fixing one for the child. Only afterward take absolute weights. The retained and make squarefree, and all other factors of the weight are bounded by a fixed constant. Thus
For fixed , the identities
if this quotient is an element show that the reconstruction has at most choices before slots. Here again denotes the fixed bound for the original number of slots. The at most assigned residual primes divide . Their choices cost at most . The earlier overlap primes were already frozen and counted in the overlap triangle. Hence the fibre, even if its actual size depends on , is bounded by
There is no independent , count and no second frequency count.
Let be the structural outer set just used, before independent positive row or label additions and ignoring unit Fourier phases, and define the set of distinct source quotients
It is projected once over all current rows and labels, not redefined for a fixed . Every member has a source witness on the dyads, and therefore . The containing norm ball bounds its cardinality by ; it is not used as a replacement child domain. In a nonempty sector , since it bounds the norm of an existing ideal. The divisor bound on this bounded range gives the normalized measure
This set and measure ignore the unit Fourier phases and are common to the whole current row and label sum. The nonempty gates remain separate from this structural projection.
For a fixed mode let
This is Equation (17.3) with the same row ball; with a larger fixed canonical ball the equality is replaced by the corresponding upper bound. The fibre estimate and weighted Cauchy give
Here . Only the positive outer sums were enlarged to their full fixed windows; the inner , mark, and fresh test are unchanged. The weight depends on alone. The new outer ball is exactly . Thus use of the uniform child bound introduces the displayed quotient-count exponent once and the normalized mass once.
The fixed puncture is exactly at . For each , its source bound and the fixed overlap bound give
Shared puncture primes only decrease this bound. It continues to hold when positive new labels or rows are added, because those additions do not change or delete their inner puncture.
The fixed formal centers satisfy
Use the marked premises, , , Equations (17.69) and (17.84), and the favorable clipping signs. The actual canonical margins are
The is from the possible negative and from three copies of the row enclosure.
There is also an explicit energy calculation. Apply the canonical bound only for , where the preceding puncture and margin checks hold. Equations (17.82) and (17.83) then bound the unscaled signed outer sum by
The one mass is that of Equation (17.81); the label s remains inside the child average. The common Fourier density is integrated separately, once, with the uniform weighted bounds above.
This counts the distinct frozen quotient once, with its witness multiplicity already in the fibre weights. The formal identity
then gives, after restoring the child normalization and applying the canonical bound with loss , the per-side exponent
Here is the aggregate freely chosen local divisor, dyadic, and separation loss, including the assigned-overlap divisor loss and the distinct allocations , . These are parts of one aggregate, not repeated allowances. The two clipping copies come from the restored normalization and the child exponent. There is no energy factor: the row enlargement occurs inside the canonical child and was accounted for in its margin test. The initial weighted Cauchy takes a geometric mean, and the overlap triangle was already canceled by .
We give the parameter and tail order explicitly. Let , , bound the marked ranges, let bound the number of slots, and put . Set and choose the canonical margin . For , valid a priori starting bounds for that application are
Indeed, gives , and bounds both nonnegative child parameters. Make the choices in Equation (17.66) with , imposing in addition
One may take after imposing both sets of bounds. Equation (17.85) then gives both margins at least , so Lemma 17.2 applies. Equation (17.86) adds at most to its loss.
With these bounded initial ranges fixed, choose the subsidiary input exponents realizing the target , before choosing the initial tail and Fourier-height orders.
For the separate initial raw tail, the supported columns satisfy , while . On the genuine initial expansion put . Since , , and ,
The explicit crude exponent
bounds all raw nonfrequency factors even without cancellation. To verify this, the normalization costs at most , the two column counts cost , the -divisor count at most , and at most . The two residual marks cost at most , using . Even counting overlap pairs and their assigned coefficients without their canceling weights costs at most . The Poisson prefactor costs at most . The sum is at most .
Choose and then
Equation (17.21) makes the raw complement , with fixed seminorm and polynomial-height factors. This order is chosen after the marked ranges and , but before the initial Fourier-height orders and before the final threshold. If , take the maximum of the orders required by this separate crude bound and the canonical tails. The full kernel retained inside the outer ball has the uniform Euler bounds already used in the canonical separation. The final threshold also enforces the full initial support ratios in . The principal count has exponent , and every nonprincipal term has now been bounded by . The argument keeps all element rows and every original mask, applies to subcollections and either common orientation, and preserves arbitrary bounded row-independent prime coefficients. The common separated measures give the stated finite-seminorm and polynomial-height uniformity. This proves Equation (17.1).
Amplification on sixth-power-free rows
We first extract an unmarked consequence on all element rows. In Lemma 17.1, take , , no slots, and . If for a fixed , then ; the second required margin is also positive. For , the direct bound suffices. Otherwise the starting lengths are in a fixed bounded range away from zero. Bounded are handled directly. We obtain, for ,
The fixed arithmetic data and the stated seminorms are included in the dependence of the constant.
Lemma 17.6 (Sixth-power amplification). Let , , and the zero extensions be as in Lemma 17.1, with no prime slots. Let , and sum over elements with such that every prime valuation of the ideal is at most five. For every fixed and , put
Then
The implied constant depends only on , the fixed arithmetic data, and finitely many seminorms of . In particular, for with in a fixed bounded nonnegative range, for every the exponent may be written
Both assertions permit a separate test in each row, with in a fixed compact interval and , at a cost for a fixed .
Proof. First, Equation (17.87) and Lemma 4.5 imply the rowwise scale bound
Indeed, sufficiently small scales have no ideals in the annular support. Differentiation with respect to replaces by . The one-dimensional Sobolev inequality in Lemma 4.5, followed by Equation (17.87) for these two tests, controls the supremum on a unit logarithmic interval. There are such intervals. A fixed enlargement of handles their endpoints, and the direct small-scale bound handles the initial intervals. This proves Equation (17.89).
Ideal counting outside the fixed set gives at least primary ideals with , for a fixed . For bounded this follows after reducing , since the unit ideal is available; for large it follows from the positive-density ideal count with finitely many primes removed.
For squarefree , separate the primes dividing by , where and . With the zero extensions,
This is true also when share primes: both sides vanish at a prime dividing and either or , and otherwise the sixth power is one. The separated column therefore gives the exact identity
The coefficient mass is at most . It follows that
Average this bound over the 's and sum over . The map is injective on these pairs. In fact, at each prime the valuation modulo six recovers the valuation of the sixth-power-free ideal , and its quotient by six recovers the valuation of . The primary generator of then fixes the element , including its unit. This argument does not require . Also . Thus Equation (17.89) gives
after choosing the preliminary and power losses small enough. Since , this is Equation (17.88). For bounded , choose sufficiently small in terms of 's bound and the desired power loss; the stated formula for follows.
Finally, on the fixed annular support, derivatives in of insert bounded powers of . Apply the parameter Sobolev inequality in Lemma 4.5 on a bounded cover in and unit intervals in , summing the row moments before integrating the derivatives. The finite-seminorm bound already proved has fixed polynomial height order. The cover and these derivatives therefore give a factor for a fixed , uniformly for a separate in every row. The same reasoning applies to the marked estimate with any fixed finite number of test parameters, while its prime coefficients remain fixed across rows.
In the later application, the positive exponent in is chosen after the fixed order . It may therefore be chosen small enough to fit the reserved power loss. This use of rowwise test parameters does not permit arbitrary row-dependent prime coefficients.
Fourth moments with short prime factors
The refined row count requires a fourth-moment estimate for two plain character polynomials and a product of short prime polynomials. We prove that estimate here. The two plain polynomials have no length restriction when no prime polynomial is present; otherwise the permitted lengths lie in an affine region. Two finite Fourier transforms return products of the same kind at a smaller effective width. Some transformed rows, however, induce characters in a fixed finite family. Their plain products can have volume-sized main terms. For the longer inputs we therefore subtract a comparison product with the same product of scales. Preserving its common character, mask, and norm power through the transforms makes those main terms cancel. The estimate itself concerns the original, uncentered product.
We use the notation of Section 4 and the coefficient conventions of Section 13. In particular, the rows are elements with , and
The character is fixed within a row sum. The union of the prime supports of all its displayed moving residue-symbol factors, before canceling factors or reducing exponents modulo six, has norm at most . Every displayed factor retains its zero extension, including a canceled or six-divisible factor. A redundant zero may instead be represented by an additional puncture mask only when an exact factorization retains every surviving local and fixed-ray phase. This mask is the indicator of coprimality to one squarefree ideal of norm at most , for a bounded , fixed within the current row sum; the same mask is used in both plain factors and in every prime factor. It may depend on previously frozen labels, but not on the varying row. All ideals in the polynomials are outside the fixed set .
Fix a finite group of finite-order ray characters whose conductor primes belong to . It contains the fixed twists and all characters used to separate the fixed reciprocity phases. Thus it also contains the supplementary character : by (4.6) and the fixed bicharacter table, this character is the diagonal character . Membership of an inducing character in means equality with the primitive inducing character of some member of , not equality of the chosen zero-extended presentations. All zeros of those presentations remain in the polynomials. Let be the rows for which induces a nonprincipal character. For , let be the rows for which the inducing character of does not belong to . Write
Lemma 18.1 (Fourth moment with short prime factors). Let . Let , and let be a finite product of the prime polynomials in Equation (13.1), of lengths and total length . Their underlying prime supports are pairwise disjoint before common masks and row zero extensions are imposed. Their coefficients are fixed finite linear combinations of finite-ray characters. For every positive-length slot the expansion has the form
where the finite list and its coefficients are fixed independently of and of the row. The row and mask hypotheses are those just stated.
For every , there is a slot mesh such that, if for every , then
in either of the following cases:
. There is no restriction on the bounded nonnegative lengths , and no lower bound on the conductor.
and
If , assume in addition that . If , no zero-free hypothesis is required.
For an empty slot list, . If and the list contains zero-length slots, their scales are bounded and absolute counting absorbs them into the constant; the zero-slot assertion therefore has the same strength. All real length parameters range over prescribed bounded sets. The mesh depends only on those sets and , uniformly for . For each fixed -independent arithmetic datum and fixed slot count, the bound uses finitely many smooth seminorms and a fixed polynomial in the separated norm-twist heights. Their orders, and the bound itself, are uniform over all moving moduli, admissible masks, and frozen outer labels in the stated ranges.
The application to the bound sets , so its zero-free hypothesis in this lemma holds by equality. We retain this dynamic value rather than replace it by the value supplied by the bound, since the refined row count uses the resulting affine capacity. The proof below uses the finite Gauss identities of Section 13.3, Lemma 4.5, and Lemma 4.9. Absorb any zero-length slots by absolute counting at their bounded scales; henceforth means that no live slot remains. We first make two reductions that preserve the row family.
The later induction is on the effective width , with all zero-slot bands completed before the positive-slot bands. Within each band the range is proved first. This threshold comes from the transformed rows whose inducing characters lie in : counting their sixth-power form and bounding their plain products by volume leaves an excess , before the common-support savings. Reflection handles some longer inputs; the others are reduced to an equal-product-scale difference, whose cancellation removes that excess.
Fixed masks and reflection
Call a character natural when its zeros consist exactly of its primitive conductor primes, its redundant row and declared moving radical primes, and the fixed primes in . Here a redundant prime is one at which the inducing character is unramified but the displayed zero-extended product still vanishes. A displayed six-divisible power still vanishes on nonunits. If a redundant factor of the fixed twist is not included in the declared moving radical, first factor it exactly into its remaining phase and a coprimality indicator, and put that indicator in a squarefree ideal , with , fixed throughout the row sum. In particular, a cancellation between the fixed twist and the varying factor is not reclassified as a separately chosen extra puncture for each row.
Let be the natural character obtained by deleting these additional punctures, and let denote its centrally normalized plain sum at scale . Write for the sum with the extra mask. Multiplicativity, including zero extensions, gives the exact identities
For example, the first identity follows by inserting and writing . The quotient is unrestricted at primes of ; the original natural zero extension remains on it.
Apply these identities simultaneously to both plain factors and all slots. If the frozen slots form , and the plain divisors are , the scalar depending on the row has modulus at most one. The remaining coefficient has absolute value at most a fixed profile constant times
The resulting natural product has lengths
Its inducing character is unchanged. If , the left side of Equation (18.3) has decreased; if , the zero-slot assertion has no length restriction and .
For every fixed ,
This follows from Lemma 4.10. The corresponding mass for a frozen slot is also : on its annular support, , and the same product bounds the sum over . The number of slots is fixed. Minkowski’s inequality therefore reduces Equation (18.2) to the natural assertion at the same width, with an arbitrarily small power loss. A nonempty annular scale below one is bounded below by a positive profile-dependent constant and may be rescaled to one. After this rescaling its new nonnegative length is , so the asserted nonincrease of the affine expression remains valid.
We next record precisely the reflection used for natural characters. Let be the primitive character inducing , and let be its redundant natural radical. The primes of are disjoint from the primitive conductor. If is that conductor norm, set , the conductor scale in the functional equation. Tameness at primes outside gives
Indeed, each good prime contributes at most once, either to the primitive conductor or to the redundant radical. Their union is contained in the union of the row radical and the declared moving radical, whose norm is at most . By Lemma 4.1, the unit and -supported parts of a row, with valuations reduced modulo six when evaluated on primary elements prime to , range over a fixed finite ray family. Thus all primes in contribute only a fixed factor.
Apply the primitive Hecke functional equation recorded in the proof of Lemma 4.8 to , using the entireness of stated there. Let be its root number, so . Mellin inversion and a contour shift show that the normalized plain sum of at equals the root number times the conjugate character sum at , with transformed profile defined by
The Mellin transform convention is the one in Lemma 4.5. The quotient of gamma functions has poles only at the nonpositive integers and zeros at the positive integers. Shifting the inverse Mellin contour to the left gives an expansion in nonnegative integral powers at zero; shifting it to the right gives arbitrary decay at infinity. Thus and its Euler derivatives are bounded at zero and rapidly decreasing at infinity. The height assertion is also quantitative. For , the exact identity puts all height dependence in a translate of the rapidly decreasing Mellin transform. On each fixed vertical line the gamma quotient and each fixed number of Euler derivatives have polynomial growth in the integration height. Integrating the translated Mellin decay therefore gives a fixed polynomial in , with its degree depending only on the fixed contour and derivative orders. The pointwise Mellin integration-by-parts estimate on a compact real strip in Lemma 4.5 justifies the horizontal joins in these shifts; an integrated Fourier tail is not used to bound a fixed horizontal trace. This proves the required finite-seminorm and polynomial-height bounds for reflection.
Deleting the redundant Euler factors before reflection and restoring them geometrically afterward gives
The geometric series is absolutely bounded by . Consequently its total coefficient mass, together with the sum, is . The scales are
By Equation (18.7), there is a fixed such that
The profile can be partitioned into smooth annuli. Below its main scale, central normalization gives summable coefficients on the annuli of relative scale . Above that scale, rapid decay gives an arbitrary summable power. Fix a small length tolerance . Truncate the upper annuli after an enlargement ; sufficiently many fixed derivatives make the omitted part negligible by absolute counting. A main scale below is likewise negligible. If a retained annular profile has fixed upper support endpoint , a scale that can contain a nonzero integral ideal satisfies . On such a scale,
Thus replacing a retained subunit scale by scale one costs this fixed multiplicative factor. All these assertions are uniform in the moving labels.
The row-dependent choices are handled by their coefficient mass followed by a rowwise supremum in the resulting scales. Lemma 4.5 bounds a supremum over two polynomial-range scales using unit boxes and derivatives of the profiles. The row character and its natural zeros remain unchanged: after reflection, conjugating that whole factor inside its absolute value replaces the conjugate character by the original character and conjugates its profile. This operation is valid because the absolute value of a product is unchanged by conjugating one factor.
Let include , the fixed annular endpoint multipliers, the logarithmic box multipliers for a reflected factor and any paired unreflected factor, and for the retained profile types. This constant is fixed after the data and profile types, independently of and the moving labels. For , every retained scale satisfying the preceding support test, after the permitted clipping and box enlargement, has declared nonnegative length
This is a linear bound also when is slightly negative; if its right side is negative, no such retained scale exists. The smaller upper-annulus range changes only the fixed decay, seminorm, and height orders used for the discarded tail.
For , reflect each original factor whose length exceeds once, and leave the other factor unchanged. Equation (18.9) bounds every retained reflected factor; the fixed box multiplier for an unreflected factor is included in . After the preceding annular truncation and scale-box enlargement, the resulting lengths satisfy
provided . We call this the padded zero-slot core. Here is the positive padding parameter chosen below after the width floor and step. There is no repeated reflection at the boundary . Reflection and scale suprema are taken before centering; on a later centered term whose primitive inducing character lies outside , one first applies the triangle inequality to its two rectangles. No such supremum is applied to a centered difference whose primitive inducing character belongs to .
Prime estimates and the induction order
For , put . Under the hypothesis , the global part of Lemma 4.9 gives, for every fixed ,
for a primitive nonprincipal inducing character . To estimate a prime annulus of scale , apply Mellin inversion to a smooth von Mangoldt sum and move its contour to . There are no poles in the region of the shift, and the Mellin transform has arbitrary decay, so (18.11) bounds the new integral by times a logarithm of the conductor and a fixed polynomial in the height. Prime powers of exponent at least two contribute . For large , dividing the annular weight by replaces the von Mangoldt weight by the prime weight; its smooth seminorms are bounded on the annulus. Bounded are estimated by absolute counting. Expand each positive-length coefficient in the characters from the statement. If the primitive inducing row character made principal, then , a contradiction. Thus every resulting slot character is nonprincipal on .
After extra-mask erasure, fix a positive slot list and put . For normalized twist heights , define
For every , central normalization and multiplication over this fixed list, with and all subsidiary losses sufficiently small, give finite and a constant such that
Here may be rounded up to an integer and . The orders and may depend on the fixed data, slot count, loss, and any fixed requested internal logarithmic or normalized-twist derivatives, but not on , moving labels, rows, or the numerical heights. The exponent is independent of these derivative and height orders. Indeed, translate each pure twist in its Mellin variable before integration by parts. The weighted integral of the untwisted Mellin transform then contributes a finite seminorm and a fixed polynomial in , while the contour displacement contributes exactly to the squared exponent. Logarithmic derivatives remain annular, and normalized-twist derivatives insert only powers of the logarithmic profile variable. The redundant natural radical contains only primes, so deleting it changes a normalized slot by times its fixed profile factor; this is within the stated power loss because . For , absolute prime counting gives (18.12) without a zero-free assumption and with for undifferentiated pure twists, whose modulus is one. For the hypothesis remains . The choice of losses is uniform in , since the length ranges are bounded. In every later use of (18.12), its fixed seminorm and height factor is retained in the weighted Fourier estimates; it is not included in the exponent of .
We now specify the induction, including the estimates at its smallest widths. Choose a width floor , a width step , and then , all small in terms of the final , with . Precise loss choices will be made after the depth is bounded. Divide the bounded range of into consecutive bands of length . Prove all zero-slot bands first, in increasing order of width, and then all positive-slot bands. Within a zero-slot band, first prove the uncentered assertion for , and then the padded core in (18.10). Reflection then supplies all zero-slot lengths in that band. Within a positive-slot band, first prove the uncentered assertion for subject to (18.3), and then the remaining part of that region by centering. A completed earlier band therefore includes the unrestricted zero-slot assertion. Let bound the initial width range, and define
The strict width decrease proved below will show that at most nonterminal calls occur on a branch.
At , the padded zero-slot core follows from absolute counting: there are rows and the squared product is . Its exponent above is at most . For positive slots, combine the completed zero-slot estimate with (18.12). In the region of (18.3), , whence
Thus the extra terminal exponent for positive slots is at most . These terminal exponents can be made smaller than the reserved final loss by choosing , sufficiently small.
For a width above the floor, the two-transform estimate below will first prove the uncentered range . We explain now why the remaining inputs can be compared with that range. Set
For , the comparison lengths , are both at least . In the positive-slot case, , and ; hence . This also shows .
If one original plain length is , reflect the other factor. If both are at least , introduce the comparison with lengths , and the same two profiles; reflect its longer factor only when estimating the comparison separately. In both cases the total length after that reflection is at most
where . (18.9) includes the clipped reflected scale and the paired unreflected box multiplier in this same ; the discarded tails have the stated fixed-order bounds. Thus
For , this gives . For , use , , and to get
Each required boundary has a margin of at least before the term. Choose . After the threshold in (18.9), the unit-box multipliers are already included in , so every retained reflected comparison calls the previously proved uncentered assertion at this same width. This also completes the original case with a factor shorter than .
In the remaining case put , , and . Then , and all four plain lengths are at least . Subtract the unreflected comparison from the original product, leaving the common product of slots; call the result . Multiplicativity and the equal product normalization give the explicit formula
The comparison is bounded on the original permissible rows. The squared norm of the whole is nonnegative, so it can then be enlarged to all rows in the smooth row ball. In the uncentered case, enlarge the squared norm of the original product instead. The Poisson transforms below are therefore never applied to an indicator selecting exceptional or nonexceptional rows.
The centered coefficient and its support
We keep the subtraction as one coefficient while transforming its row norm. For fixed ideals , define
An allocation records prime powers already extracted from the two plain variables. If its conditions are impossible for one rectangle, that rectangle’s profile is zero on the corresponding sum; the formal difference in Equation (18.17) is nevertheless retained.
The reason for retaining these common data is already visible in the exceptional case. For a fixed , a common mask , and a common norm power , the lattice estimate proved below has leading term
where does not depend on or . Here is a fixed measure constant times . The product main term is therefore , which agrees for the two rectangles when agrees. Lemma 18.3 will quantify the remaining error. This cancellation is used only on the transformed rows inducing characters in ; the common coefficient below is retained on all rows until that later division into cases.
For a remaining slot set , write . A coefficient with a common character and mask means a coefficient of the form
Here is one zero-extended product of a fixed finite-ray character and moving residue-symbol factors; is a fixed squarefree extra mask; is a fixed squarefree ideal; and . The condition is omitted when . The slots retain their original disjoint underlying supports. They may share primes with either plain variable.
These common data factor multiplicatively on the full product. For any ideals , even with common primes,
The first identity includes all zeros: a present prime whose total exponent is divisible by six gives the zero-extended principal factor, not the constant one. The same multiplicativity holds for . A fixed-ray character evaluated on a full product also factors with the same character on every variable.
We fix a support convention that will also control the slot-mesh quantifier. Let be the original fixed number of slots, and choose fixed intervals containing the support of each . Put . Choose a fixed number at least , enlarged to include the two plain profile windows, , fixed arithmetic normalizations, the relative dyadic boxes, and the finitely many support enlargements through the operation stages. The number may depend on all the fixed data and on , but not on or any moving label. For every subset of live or frozen slots,
Every residual full product divided by its nominal product scale lies in , after increasing once for the fixed list of operations. Both rectangles use that same box. Extracted plain prime powers use their exact norms, and a frozen slot contributes its ratio just once. If a nonempty plain scale below one is clipped to one, its error is at most the logarithm of that plain window’s fixed endpoint divided by , once for that plain. Thus a whole subset of slots or a whole divisor extraction contributes one aggregate boundary error, not one copy of a preselected tolerance for each slot or prime.
The first Poisson transform and its target bound
We now estimate either the uncentered product or the centered difference selected above. Put and . Choose a fixed nonnegative smooth radial function that majorizes the row ball. The full index product in either rectangle has norm in a fixed multiple of . All comparisons of exponents in this subsection are first made on fixed dyadic norm intervals. Their bounded relative widths change a logarithmic length by ; the final loss discussion includes these changes.
We use the following common localization for both Poisson formulas. Fix a nonnegative smooth dyadic partition for , with each weight supported in for one fixed . A sector fixes dyadic boxes for the finite list of aggregate outer norms, not a separate box for each slot. Let be the supremum in that sector of the nominal frequency scale. Its ratio to the scale at any one set of outer labels is at most a fixed . Retain exactly the whole weights whose support meets
Their union is contained in ; every discarded weight is supported above . The selection depends only on the sector, never on a live column. After and the support data are fixed, take large enough that
One fixed enlargement of covers all the finitely many sector endpoint factors.
Here is a direct tail bound that justifies this operation on the genuine sums. In both applications the kernel argument is at least . On every discarded weight it is therefore at least , by Equation (18.20). Lemma 4.7 gives arbitrary decay . For the first formula use , and for the second use the finite definition . Absolute ideal counting and the divisor bounds for the fixed number of factors bound all raw columns and prefactors in a sector by times a fixed polynomial in the retained heights, where depends only on the bounded total lengths and chosen subsidiary power shares. A lattice norm dyad of scale has frequencies. Summing the radial decay over discarded dyads consequently gives times that height polynomial, for a bounded independent of and , and a convergent geometric sum when . Choose sufficiently large to obtain any prescribed power saving, including the polynomial number of frozen outer labels. This is an absolute bound for the original terms, before any off-coprime extension or Fourier absolutization. It uses neither the later -radical saving nor a factorized off-coprime identity. On the retained weights the full smooth kernel is kept; no sharp condition comparing a row norm with the two live column norms is inserted. A retained range below the first nonzero lattice norm is empty, apart from a bounded boundary dyad covered by the clipping convention below.
At zero frequency in the first row Poisson formula, a character mean can be nonzero only if its exponent at every prime is zero modulo six. In particular, no prime occurs to total multiplicity one in the product of the two full index products. This product is therefore a powerful ideal. There are such products of norm : each powerful ideal is a square times a cube of a squarefree ideal, and summing over the latter gives the usual bound up to norm . Allocations to the fixed number of factors are divisor-bounded. The central factor is , and the row mean has size at most . Thus the zero frequency is .
For the nonzero frequencies write the two full products as , , where contain their complete common prime support and
At each common prime, fix its exact valuation in each plain variable and whether it is supplied by a slot. Dividing out these valuations adds that prime to the mask of every remaining factor on the side. A slot that supplied the prime is frozen and removed. This description is valid even when a slot and one or both plain variables supplied that prime. The allocation is made once for the coefficient, so the same ideals occur in the two terms of . An impossible allocation is a zero term. In particular, a scalar forced to vanish by an old moving zero or a common mask is not replaced by its absolute upper bound before these support conditions have been imposed.
Let be the logarithmic norms of , and let be the logarithmic norm of their common radical. Let be the product of common primes whose net exponents are nonzero modulo six; its logarithmic norm is . The corresponding character is primitive modulo . In the Möbius expansion of the complementary common row mask, write for the selected divisor and for its logarithmic norm. In particular
Let and be the allocated convolution coefficients, with the common character omitted. They include all profiles, live slot coefficients, and fixed masks; in the centered case each contains the entire allocated difference. Set
Residue-class Poisson, with the self-dual lattice measure from Section 4, gives for this allocation the following nonzero-frequency expression, up to a scalar of bounded modulus in the frozen labels:
Here is the normalized primitive Gauss sum and has modulus at most one. To check the normalization, the substitution and Poisson modulo give . The three unnormalized Gauss sums restore . The global squared central normalization is . For the phase, CRT for the pairwise coprime moduli supplies
The substitution supplies , up to a scalar in the frozen labels. Reciprocity changes into ; the remaining factors are precisely . This proves Equation (18.21). Each new character acts on its whole residual product. Its new moving primes belong to the extracted support and puncture every residual factor. Their full displayed union is counted even if the factors at cancel on units.
The new full displayed moving support has logarithmic norm at most , including any canceled factors at . Its nominal frequency scale is exactly
The product support convention gives , so the argument in Equation (18.21) is at least for the supremum of in the outer sector. Apply the preceding whole-dyad localization to this genuine coprime bridge. If is the upper length of a retained dyad, then
The zero frequency already estimated above was the zero term of the original common smooth row ball; it is not restored on a truncated row domain. The later ledgers retain the possible inequality .
For each retained dyad and genuine common-support allocation, define to be the full bridge summand also on noncoprime residual pairs individually disjoint from and allowed by the old masks. Use the fixed bicharacter , the full zero-extended , the displayed whole-product characters, and the same dyad weight, kernel, inverse roots, and formal product norms. CRT identifies this definition with the genuine summand only on . On each finite column shell the exact identity is
The full squarefree Möbius sum annihilates the artificial noncoprime pairs. Insert it before estimating independent factors, and put . Separate the fixed-ray phases and all smooth factors in the normalized row norm and the two whole-product norms. In these variables the kernel is on fixed logarithmic boxes. If its aggregate scale ratio varies over the sector, include that single normalized outer ratio as another coordinate. The cutoffs are chosen on the common product annulus of Equation (18.19), before fixing live slot labels. Thus one Fourier coefficient measure is common to the rows and all live labels. It supplies a row phase and only one norm power on each whole column, together with phases in frozen outer norms. It introduces no separate powers on the two plain variables or the two rectangles. The full kernel and inverse roots are kept until this separation; taking their absolute supremum inside would not preserve the coefficient. Apply Cauchy–Schwarz in only after this separation, and only then use . The resulting positive norm on the side is
and there is an analogous norm. Here includes one separated fixed-ray character. All fixed masks in remain present. Complete extraction and multiplicativity therefore leave the coefficient in Equation (18.18), now multiplied by . In particular the two rectangles retain the same allocated plain powers, character, puncture, and norm power.
The factors outside these two norms have exponent . The absolute number of common-support labels and Möbius labels has exponent . To justify the common-support count uniformly, first count its radical, giving . For a fixed radical of polynomial norm and any fixed , Rankin’s bound gives
for every fixed . Choose small and use the polynomial-size Euler-product estimate. This bounds the choices of the powers in by an arbitrarily small power. Their allocations and the choice of have divisor-bounded multiplicity. Finally there are possible .
The allowance below denotes the error envelope for the current induction depth, together with its local small-power shares. These envelopes will be chosen compatibly when the finite induction is completed, using the same slot mesh throughout. We will prove the following sufficient bound for the squared norm:
The analogous quantity is . The complete exponent ledger for this implication is
The last brace is nonpositive:
Indeed, at a common prime of multiplicities , put . Only the side can have a positive local numerator. Its contribution is at most , whereas the right side contributes . The latter is nonnegative. If the former is positive, six times their difference is , which is nonnegative: for it is at least 2, and for one has , giving at least 0. The positive part of a sum is at most the sum of positive parts. Multiplication by each prime’s logarithmic norm and summation proves Equation (18.24). Thus it remains to establish Equation (18.23).
Enlarging the Gauss-row norm
This subsection describes three possible positive norms to which the second transform will be applied. Let denote a length removed from the column, and let be the additional moving-radical length created by that removal. Put . When a squared extraction coefficient of size has been removed, Equation (18.23) allows the unweighted remaining norm the exponent
This is just .
For the initial norm, with and , the first transform gives the following conditional summand after fixing and omitting its outer scalar:
The slot sums are restored before this polynomial is squared. The same statement with the second rectangle omitted applies to uncentered products. The local calculations below will show that the extracted terms retain this form at their shortened length .
Define
In the zero-slot proof take , and set
The positive norm is at most the corresponding norm over a smooth ball of length . There is no multiplication of rows in this case.
For positive slots, start with . Set , choose the slot mesh , and take the fixed pool
The prime ideal theorem in the fixed field, equivalently its fixed ray-class form [27 Theorem 1.1], gives . Because the live slot lengths are at most and their relative annular supports are fixed, the single inequality makes this pool disjoint from every live slot window. Its exponent gap is at least , independently of ; only the threshold depends on the fixed windows. For a row , omit pool primes dividing , , or any frozen support. Each such integer or ideal has polynomial norm, so primes are omitted. The remaining set has size comparable to , uniformly in the row and frozen labels.
To compare the rows and , write a full modulus as with . CRT and reciprocity give the exact formula
Also , since is a unit modulo and . For , (13.5) shows that replacing by changes only . The factors that occur are a scalar in the row and ; the displayed remaining factor is one fixed-ray character times one residue character on the whole . Since is outside every live slot window, is allocated only to the two plain variables. The residual product is punctured at , and the same allocation updates in both rectangles. Because , the condition remains.
Here is the precise averaging argument. Write the normalized polynomial in as . For each eligible , local Gauss evaluation gives plus the extracted terms with -adic column valuations . There are only boundedly many allocations of each of these valuations to the two plain variables. Jensen’s inequality, first in and then for this fixed finite sum, gives
The are normalized at their shortened column scales. The local identity and allocation just described are applied to the whole centered coefficient, so each error retains (18.18).
On the support of the original row weight, the new row has norm . A fixed output row has only boundedly many representations as with : every such divides that row, and all such primes have norm at least , while the output norm has bounded logarithmic length. Summing the first term over therefore gives the factor times a positive norm on the new rows. For this main term set
Since , a smooth ball of length contains all the new rows.
For the extracted terms put . When , Equation (13.5) gives the following central coefficients. At valuation one, the old Gauss sum has modulus one and the new one is zero, so extraction gives squared coefficient . At valuation six, the new Gauss sum is ; its central factor is , giving . At valuation seven, the new Gauss sum has modulus , and the central factor gives . The row phase is for valuations one and seven, and is one for valuation six. It multiplies both rectangles.
Let . For sufficiently large , . The removal and new moving-radical lengths for the three terms are
The two squared factors give exactly . For the valuation-six term, the exact factor is represented by the already common fixed puncture at , with its fixed-ray phase retained. At valuations one and seven the displayed local factor remains, and its prime is counted in the moving radical. In each error, freeze , retain its common column puncture, and discard its row eligibility restriction only after taking the positive norm. The average remains , so a bound uniform in the frozen introduces no prime-count factor. For each error set
and enlarge its original rows directly to a smooth ball of length . Errors are not amplified again. All three types of norm satisfy
The row zero is added only at the final smooth ball. Put . A nonempty column shell satisfies , and hence . By Equation (13.5), unless is a sixth power, and . There are sixth powers on this support. If , then , so . Including the assigned divisor-bounded convolution loss, the squared contribution after central normalization is
The last inequality follows from and the displayed bound for . Thus Equation (18.25) bounds this added row with the numerical correction included in the stage allowance. Here denotes the common constant for aggregate support errors in one stage, chosen independently of the slot count . The estimates below establish that one such choice covers all operations in a stage. Zero is never multiplied by a pool prime.
The second transform and smaller-width products
Restore all live slot sums before expanding the square. Let denote the full allocated convolution coefficient in one of the preceding Gauss polynomials, including its fixed mask and -divisibility condition. It contains the whole difference when centering is used. Its moduli satisfy . Let be the nonnegative smooth radial function defining the final row ball. Apart from the loss in the prime density, the norm to be bounded is
The Fourier identity in Lemma 13.3 gives its exact expansion
The kernel that occurs here is
Both the displayed inverse square roots and this kernel are retained as functions of full until their whole-product separation below. In particular the formula includes every live prime and every shared-prime multiplicity.
At , Lemma 13.3 leaves only , with . The number of supported moduli divisible by , on a nonempty shell, is at most
because writing gives on that shell. The divisor-bounded coefficients use their separate share. Thus the diagonal exponent is , including when is slightly negative. Subtracting the allowance in (18.25) from its nominal part, without , gives
For the inequality, put . The contribution is at most : it is at most when , and when use . The largest remaining increment is in the amplified main norm; the other norms have increment . Thus the diagonal requires only the displayed terminal loss , plus the already reserved frequency perturbation and numerical support correction , when , and an additional in the padded zero-slot core. The correction is included in the stage allowance.
For , first perform the whole-dyad localization on this genuine full sum, before extracting any common support. The nominal scale is , and the kernel argument is at least for its supremum in the current Gauss sector. The tail estimate above applies using , with the literal conditions still present. Write
This common row weight satisfies . The full kernel in (18.30) remains on every retained term. All subsequent signed Fourier separations are performed one retained at a time, so the normalized row variable stays on a fixed log box; records their sum and common domain. There are relevant retained dyads in the bounded polynomial ranges. The preceding term is exactly the diagonal of the same final ball, including the previously added Gauss row zero; neither zero term is restored on a different domain.
Now write , , extracting the genuine complete common support, so that and . Allocate all extracted powers to the plain variables and slots as at the first transform. Lemma 13.4 applies on this genuine locus and gives
It permits arbitrary prime powers in all four moduli and leaves a row scalar at the common primes. Every extracted prime punctures all remaining factors on its side, and every slot supplying that prime is frozen.
This also explains explicitly the cases where a slot shares a prime with a plain variable. If occurs only on one side, with full multiplicity , its residual factor is . Splitting among the two plain variables and the possible slot gives precisely the same factor by multiplicativity, including when and . For example, a plain and a slot give the zero-extended factor . If occurs on both sides, its full powers are removed. In the unequal case , the local correlation is zero unless and the frequency is with ; when it is nonzero it equals
This is a row scalar, even if the excess valuation on the first side came partly from a live slot. For instance , with a plain and slot leaves the scalar , freezes that slot, and punctures both remaining plain variables at . Equal multiplicities have the scalar factors in Equation (13.8) and the same puncture conclusion. Complete rather than gcd-only extraction is what makes these local factors independent of the residual variables.
Define
Let be the logarithmic norm of their common radical, let , and put . The correlation vanishes unless . At a common prime with equal multiplicity , call the divided frequency a unit or nonunit according as that prime does not or does divide it. Let be the total radical length of these unit primes. Let be the product of these nonunit primes and put .
Equation (13.8) gives the following absolute local bounds:
| common multiplicities and divided frequency | absolute correlation bound |
Every unequal case not in the last line is zero. Fix the indicated unit/nonunit partition and write . The partitioned scalar
is defined to be zero off that partition and has modulus at most one everywhere with this definition. We do not assert the unit bound for the unpartitioned correlation on other rows. Every frozen allocation forced to be zero by the old masks is still discarded before this absolute bound is used.
The complete-support identity leaves the row factor on each whole residual column. To count its fixed moving support, put and . Products of the canonical primary generators of these good ideals are primary, so the exact all-input identity is
with any unit of the original row retained in . All primes in this identity already puncture every residual factor, because they are in the genuine extracted support. The active primes are contained in the unit set counted by and the nonunit set counted by . Equal six-divisible and unequal-minimum-six-divisible primes have and are represented solely by the common puncture in this fixed factor. A nonunit prime can also have , in which case counting it in only enlarges the bound. This factors only : the natural row factor , with all its zeros, and all fixed-ray reciprocity phases remain. It does not reclassify a cancellation with the varying row as an extra puncture. Thus the full new moving support has length at most .
Define the nominal row and total widths by
Here , and the definitions of give . The identities follow by substituting and the definition of preceding Equation (18.22). Put
The sector constants here are those for the second transform. The retained row weight pulls back exactly to . On its support,
Thus it lies in that common enclosing row ball. On a nonempty retained range define the declared nonnegative row length and . Nonemptiness implies , so . Regard the pulled-back weight as zero on the rest of this enclosing ball throughout the signed calculation, and do the same for the partitioned scalar. This is an exact extension by zero. They will be replaced by their absolute bounds only after a nonnegative child norm or an exceptional absolute product has been formed. Complete extraction only shortens a plain variable or freezes an entire slot, so the surviving slot length satisfies .
We record every other exponent in this second transformation. The condition has not been dropped: it implies that every prime of is in the second complete common radical. Thus after the complete extraction there is no remaining -divisibility condition on the residual columns. The number of possible radicals of length , for this fixed , is : write that radical as with , and count the squarefree of the remaining norm. If outside the fixed shell boundary, there are none. The same Rankin argument used for bounds their power and allocation multiplicities. Choosing the unit/nonunit partition costs at most , another divisor-bounded factor included in . The exponents are
| factor | exponent |
| squared central normalization | |
| row Poisson factor and normalized inverse roots | |
| prime density, when present | |
| common-support count with fixed | |
| common correlation | |
| conversion to normalized residual products |
The last line is . Their sum is
Subtracting this sum from the allowance Equation (18.25) leaves the exponent permitted for the inner plain products. This is the bound to be supplied either by smaller-width moments or by the exceptional-row estimate:
The inequality uses , since both multiplicities at each common prime are at least one. We now remove the residual coprimality before forming independent children. For the fixed genuine , define
on all residual pairs individually coprime to and allowed by the old masks. It equals the genuine correlation only when . Define the remaining on all individually allowed residual pairs by the allocated convolution formulas and the old common masks, including . Keep the formal full-product norms , both inverse roots, the full smooth kernel, and the same pulled-back row weight extended by zero on its enclosing ball. For each retained row the exact identity is
This is the full Möbius indicator, not a truncation. The individual column shells and the retained row ball are finite. Its equality therefore follows by interchanging finite sums and using the genuine correlation identity only when . Extra common primes of are not part of the genuine support or of its frequency restrictions. Since the residual masks already exclude that support, every nonzero is disjoint from it and from .
On each retained dyad, separate the full kernel and inverse roots in the normalized norm and the two whole-product norms, as for the first transform. The frozen factor contributes only an outer phase to the row Fourier power. The fixed support boxes are chosen before the current live labels, so the resulting coefficient measure is common to them, to both rectangles, and to the row. Then fix . For each of its primes , use the exact factor-allocation identity
where the factors are the two plain variables and the live slots. For a selected plain variable write , with no restriction on . This extracts only a row scalar and , and replaces both by . It introduces no one-variable puncture. A selected slot is frozen. If two distinct divisor primes select the same prime slot, the term is zero. The quotients and unselected factors may still contain , and may overlap the opposite side; no new coprimality is imposed. Old common masks remain common, and the product of the two new plain scales is equal in the two rectangles. The extracted row scalars, including zero scalars, are retained in the signed identity.
Only now, for a fixed retained dyad and fixed Fourier parameters, is each separated summand a product of two independent residual convolutions, where records the factor allocations. Their row characters are
They are understood with the fixed-factor support representation above. In particular their inducing-character ratio belongs to , including the supplementary factor ; this assertion takes no quotient at a zero. Their natural row zeros are retained. Extracting the selected factors contributes row scalars, not new factors of the residual character and not new support in . These scalars, including zeros, remain in the signed identity.
Lemma 18.2 (Common coefficient under complete extraction). For a centered input, the two transforms and the intervening Gauss-row enlargement just constructed preserve the following coefficient data. Each Gauss polynomial and each amplifier error retains (18.18), multiplied by , apart from bounded frozen scalars and row scalars of modulus at most one. For an uncentered input, omit the second rectangle throughout. After the second transform and the full Möbius factor allocation, each separated child side has that coefficient form without and without . Every surviving slot has the child’s one whole-product character and its original coefficient , with no Gauss coefficient. Within a side the plain variables have the same character, puncture mask, and norm power in both rectangles. The two sides of one squared Gauss norm may have different norm powers; their inducing characters differ by a member of .
If the new inducing character belongs to , fixing the live slot labels leaves the plain coefficient
for one , one squarefree mask of polynomial norm, and one real . The mask may depend on the frozen row, but is common to both variables and both rectangles. All coefficients are understood with their retained frozen scalars, including zeros, and the exact normalizations recorded below.
Proof. The first-transform calculation proved the Gauss coefficient form; the local -power calculation proved it for each amplifier error. The genuine complete-support identity and the full Möbius allocation above proved the child form, preserving one character and norm power on each whole residual product. Thus “common” concerns one separated side; the displayed character ratio is the relation between the two sides. When the inducing character belongs to , it equals some on units. Its redundant natural zeros and the fixed punctures combine into one of polynomial norm. For each fixed , multiplicativity factors its value, mask, and norm power on into a scalar in times the three factors stated in the conclusion. This proves the exceptional assertion. □
We next record the exact normalization of the two residual convolutions. Put
At the entrance to the current two-transform stage, let be its live slot set and let be the formal scales of its first rectangle. Their exact convention is . For side , let be the slots from this entrance set frozen by the first and second genuine common-support extractions, let be the slots still live before the final t-allocation, and let be the product of the exact norms of the plain powers extracted at those steps and at the amplifier. Slots removed in an ancestor stage are not included in . Let be the common formal pre-t product of the two plain scales in its rectangles; for an uncentered input use its one formal plain product. Before using slot ratios, discard a frozen-slot profile-zero term, which is identically zero by its frozen data independently of the row and live labels. Complete extraction gives the exact identities
The amplifier contributes only exact plain powers to this calculation. Each earlier frozen slot occurs once, even if it shared its prime with a plain. The already separated inverse roots, kernel, and fixed normalization constants remain outside .
For side , let be the product of final t-primes selected in plain , and let be the newly frozen slots. Put
The corresponding formal scale is divided by in both rectangles. An assignment selecting one prime slot at two distinct t-primes, or a newly frozen slot with zero profile value, is identically zero from the frozen data and is discarded before these ratio bounds are used. All other extracted zeros remain until the nonnegative or absolute estimate described below.
Use lower-endpoint divisor dyads , , and put . Each dyad contains ideals. The actual selected product on side is divisible by , so
The last inequality uses the disjoint subsets and of the current stage entrance slots. It does not include ancestor slots or fixed separation constants.
Writing , the post formal factor product and the nominal raw child scale are
Define and to be their residual convolutions multiplied by . Relative to the nominal pre-normalizer , the exact extraction coefficient on side is , apart from the frozen slot amplitudes, retained extracted row scalars, and already separated outer factors. These raw children retain the formal signed rectangles and are not moment-lemma invocations; their formal logarithmic lengths may be negative. No clipping has occurred.
The factor assignments are divisor-bounded for fixed ; their total is bounded using for any fixed , not by spending a fixed exponent at each prime. The divisor dyads in the bounded column range use their existing logarithmic share. These discrete losses are separate from the numerical terms.
For precision, the other common row scalar after extracting is
where contains the separated row phases for this dyad and these Fourier parameters. It is zero off the retained partition and enclosing ball, and . The subsequent estimates are made dyad by dyad and then summed with the already allowed mass. Split the already factorized row sum according to membership of the inducing character in . On rows outside , Cauchy–Schwarz yields two nonnegative child norms; on rows in , take a pointwise absolute product. Only at these steps may the absolute values of the common row weight, partition scalar, or extracted row scalars be bounded by one and the rows enlarged to the common ball. This can admit extra exceptional rows that violate a former unit restriction, but the character-only count below includes them. Both sides use the same eligibility class and compare with (18.33).
Consider first rows whose child inducing character is outside . The two sides have the same eligibility condition because their characters differ by a member of . On such rows, first bound a centered child norm by the sum of the norms of its two rectangles; for an uncentered child there is one rectangle. For one fixed side and rectangle , write its pre and post formal plain scales as and . Choose a fixed upper support endpoint for each current plain profile type before the current row, divisor, and live labels. Omit a rectangle only when for some ; then that plain factor is zero on every nonzero integral ideal. Retain equality and every other profile, mask, row-scalar, or arithmetic zero. This test is independent of the row and live labels.
For a retained rectangle put and . The fixed endpoint test and , with enlarged to contain the two positive parts of the upper endpoint logs, give the exact clipped identities
In particular the clipped total decreases by from its own pre-clipped total . Different rectangles can have different clipped totals. A retained subunit scale lies in the fixed interval , so its dilation to scale one preserves finite seminorm bounds. The row character, common mask, and surviving slot weights are unchanged. The exact coefficient from the pre-normalizer to this standard clipped product is
For a fixed pair of retained rectangles, suppress their rectangle indices. Equation (18.34) then bounds the paired divisor count and these coefficients by
There are at most two rectangles per side, hence at most four such pairs; their triangle factor is fixed. No common clipped reduction is used for the signed difference.
On the side, before the last coprimality extraction, the nominal total length is . For the positive-slot parameters,
To prove the inequality, first use . In the amplified main norm, and
For an error, , so the excess is at most . These inequalities use and the 1-Lipschitz property of the positive part. The three choices in Equation (18.28), together with , give . This proves Equation (18.38).
For each retained clipped rectangle, if no slot survives, apply the completed unrestricted zero-slot assertion at the declared width . If slots survive, first apply the algebraic mask deletion in Equations (18.4)–(18.6). It expresses this standard clipped product as natural products and only decreases its nonnegative affine expression. For each actual product, after both frequency enclosures, the -allocation, and mask deletion, let be its declared total and slot lengths and put
The parent satisfies Equation (18.3). Before this mask deletion, let be the surviving slot length of the clipped rectangle. Equations (18.38) and (18.36), together with , give
The same calculation holds on the other side with exchanged. Taking the positive part and then deleting the fixed mask therefore gives
Here . All the displayed ledgers use the fixed list of aggregate lengths
Their affine coefficients and positive-part Lipschitz constants are numerical and independent of . The displayed frequency, raw normalization, and rectangle-clipping bounds are therefore included in , for a fixed independent of , once the aggregate threshold has been imposed. The existence of this fixed error bound uses the single before comparing lengths, not separate copies of . We enlarge below to cover the fixed number of operations in a stage.
If , remove whole slots from this product until the remaining product satisfies Equation (18.3) or until no slot remains. Removal here means applying the pointwise bound Equation (18.12) to the entire selected prime polynomial; no prime label is frozen. A removed slot of length decreases by and contributes to the squared -exponent, with the fixed seminorm and height factor retained separately. Since each slot has length at most , order the positive live lengths and take the first prefix reaching . Its preceding prefix is smaller than that threshold and its final slot has length at most . If no prefix reaches the threshold, remove all slots, whose total is smaller. Thus exactly one slot can cause an overshoot, and the total removed length satisfies
If the slots disappear before the affine boundary is reached, the remaining plain lengths may be arbitrary; this is exactly why the completed smaller-width zero-slot assertion includes all lengths. Otherwise apply the positive-slot induction to the remaining product. Its slots still have their original coefficient class, and its inducing rows remain outside . Cauchy–Schwarz averages the errors of the two separately clipped children, so their possibly different rectangles and slot sets do not double . Combining Equation (18.39) with the paired coefficient bound in Equation (18.37) and , the strict-edge scale cost beyond the child envelope is at most
If no slot survives, the same bound holds without needing a greedy cost. The numerical terms and the two frequency corrections give the single edge loss in the reserve inherited from Equation (18.25) when using Equation (18.33); the existing local small-power and fixed analytic factors remain separate. The pointwise estimate is requested once for the entire removed product; its internal small-power shares may depend on . This one greedy operation occurs only after all boundary defects of the actual child have been included in . The argument for the side is the same with exchanged.
We have now bounded all child rows whose inducing characters lie outside using only smaller widths. For the remaining rows, the next count and volume bound handle the uncentered range; the centered range uses the subtraction retained in the coefficient lemma.
Rows with inducing characters in
For this subsection, call a child row exceptional when its inducing character belongs to . By the coefficient lemma, either both separated sides are exceptional or neither is. Every prime in the existing full displayed moving support is a common column zero, as is every extra common puncture. This is true initially, remains true for in the first transform, and remains true for an amplifier prime. For a nonzero genuine second allocation, the factors and the old common masks therefore force its complete radical to be disjoint from all those supports. This conclusion is made before replacing any frozen scalar by an upper bound. The artificial residual extension keeps and those masks fixed and cannot revive an impossible allocation.
We make explicit the finite-ray reduction for row factors at the fixed primes. As in Equation (4.8), write a nonzero row as , with a unit and the two other factors supported on and its complement. For a primary element prime to , reciprocity gives, with every zero retained,
By Lemma 4.1, the first factor belongs to a finite family of ray characters supported on after the unit and the -valuations modulo six are fixed. The second belongs to the fixed reciprocity family after fixing the good ray sector. We do not absorb any moving good prime into this fixed family. The family supplied by the first factor need not be contained in ; there are simply finitely many such choices. Every remaining displayed good-prime factor has its actual local sextic exponent, with nontrivial exponents ramified at that prime.
Let be the radical length of the primes counted in whose equal multiplicity is one, and put . At such a prime the fixed factor in the row has valuation two. There is no existing moving character at that prime, and every character of is unramified there. Sextic reciprocity therefore shows that exceptional induction requires
More generally, at every prime outside , exceptional induction prescribes a single residue class modulo six for , determined by the frozen moving character and . Outside their supports that residue is zero. For each of the finitely many choices at and of unit and fixed-ray data, the ideal of consequently has a unique form
where is fixed and sixth-power-free. The displayed valuation-four conditions give . Ideal counting up to now gives the stronger bound on every nonempty range, with the usual bounded-scale convention. We use only the weaker bound
If the exponent would describe a scale below one, the forced ideal makes the range empty except at the same bounded-scale boundary. This argument includes the principal character and every other member of . Additional conditions at old moving primes can only reduce the count. It also covers rows admitted when the partition scalar was bounded after positivity. At a unit prime, such an added row can be exceptional even though it was absent from the original partition; no extra forcing saving from the unit set is used.
On exceptional rows take the absolute product for each already allocated pair of children and multiply by Equation (18.41). Let denote its central extraction coefficient and bounded extracted scalars. For an allocation with raw reductions , after taking absolute values. Using absolute volume rather than cancellation, the unnormalized plain difference on side is at every positive formal scale, including subunit scales, and the unnormalized live slots contribute . Equation (18.35) therefore gives the raw normalized volume
up to the fixed seminorm and height factors, where denotes its or side. Thus the exponent for an allocated pair and one lower-endpoint divisor dyad, including its count, is
Here Equation (18.34) gives , and . Consequently
The displayed sum is over a fixed lower-endpoint divisor dyad; its allocations have already been included in . It does not assert an independent product before Möbius allocation. Subtracting the inner allowance from the reference volume and the nominal exceptional count gives the exact algebraic identity
where
The actual excess is bounded by the nominal expression in Equation (18.42) plus . For an explicit check, the left side of Equation (18.42) first equals
Substitution of Equation (18.32) and gives Equations (18.42)–(18.43).
The following lower bounds are the reason complete common supports do not consume the available exponent:
To prove the first, put , initially set and , and recall . When , direct simplification gives
When , use and
Indeed, the left side is at least , which is at least , while . The positive part is 1-Lipschitz, giving the displayed correction. It follows that
The actual choices have and . Equation (18.29) therefore bounds the additional loss from by
For the second inequality in Equation (18.44), compute prime by prime from the definition of . In units of the prime’s logarithmic norm, the contributions are
| common case | ||
| , , unit | ||
| , , nonunit | ||
| , , either | ||
| , , unit |
The extra in the second line is . The first line exceeds . In the second line equality holds at , and for the difference is . In the third line the difference is , because . In the last line it is , because and . Summing proves the claim.
For the uncentered range , Equations (18.42)–(18.44) bound the nominal exceptional excess by . The actual-count and aggregate support corrections recorded above are further terms in the fixed stage allowance. Together with the diagonal estimate and the smaller-width estimates, this proves the uncentered stage at the current width with the reserved terminal loss. The comparisons constructed earlier may consequently use that stage. It remains to estimate the centered exceptional terms when .
For one separated side of a fixed exceptional row, fix the live slot labels. Lemma (18.2) then gives the same character, puncture, and norm power in the two plain variables and in both rectangle terms. The next lemma shows that the coefficient of in each plain sum is independent of , so the two product main terms agree at equal products of scales.
Lemma 18.3 (Masked rectangle cancellation). Let range over a fixed finite set of finite-order ray characters with conductor primes in . Let be squarefree with for a fixed , and let be smooth profiles on fixed annuli. For and , define
Then
Here is fixed, the constants use finitely many seminorms, is independent of , and is a fixed measure constant times . Both estimates are uniform for , for the stated masks, and for the finite character set.
Let be as in Equation (18.17), and put
If for and some , then
Without a nonnegative lower length, the same expression is .
Proof. First omit the mask. The primary generators representing ideals outside , with the fixed character weight , are a finite weighted collection of residue classes in a fixed lattice. Apply Poisson on that lattice to
The Fourier transform is . Because is supported on a fixed annulus, integration by parts for any fixed gives
using finitely many seminorms of . For , the sum over nonzero points of the fixed dual lattice is therefore
after increasing if necessary. For , both the lattice sum and its zero-frequency main term are by absolute counting on the fixed annulus. The zero frequency is , where is the fixed weighted mean of the residue classes. This proves the unmasked version of Equation (18.45).
Now insert the mask by inclusion–exclusion. First remove from its primes in , since every summation ideal already avoids them. Thus all divisors used below are outside . With denoting the unmasked sum, multiplicativity gives
The main coefficient is
The from extraction has canceled the in the main term at . This proves that the coefficient is independent of both and . The errors are multiplied by at most the number of divisors . The coefficient itself is also -bounded by the polynomial-size Euler-product estimate. This proves (18.45).
For (18.46), take absolute values in the original sum. It is empty below a fixed positive scale; whenever it is nonempty, ideal counting on the fixed annulus gives points. This is uniform in and in the mask.
The masked sum in (18.47) is exactly
The two product main terms in (18.45) are both . They cancel. Each cross term with one error is bounded by times one of , and the product of errors has the same bound after reducing the subsidiary power loss. If all four scales are at least , each is at most , and because . The difference is therefore . Division by proves (18.47). When no nonnegative lower length is available, (18.46) bounds each product by , giving the last assertion. □
Apply this lemma to each already allocated exceptional child. The hypotheses on its coefficient and common mask follow from Lemma 18.2; in particular the main terms cancel for the same row, mask, and whole-product norm power before any absolute value. Initially all four plain lengths are at least . Before the selected -factors are removed, the side has lower plain length at least and nominal total length : no one plain loses more than the total extracted by the two genuine common supports and the amplifier. The other side has the analogous bounds with . Put
and call the side with this reference saving the first side, relabeling its associated raw data together. If , each selected plain length satisfies , so all four formal post plain scales have logarithmic length at least . Apply (18.47) on these exact equal-product formal scales. If , including equality, or if , use the all-scale absolute-volume fallback in the same lemma. No formal centered scale is clipped in this branch, and an identically zero rectangle remains in the formal difference. The resulting saving is . With absolute volume on the other side, this gives the aggregate bound on each lower-endpoint divisor dyad,
Here and below a fixed polynomial in the separated heights is understood. To check the bound, the raw coefficients and volumes give the reference exponent and reduction , while the divisor count gives . Equation (18.34) gives the one-line inequality
Adding leaves at most . The divisor-bounded allocations contribute only , proving Equation (18.48). This applies to the artificial terms even when quotients retain -primes, because the coefficient lemma preserves the common mask, equal product scales, and one norm power within each rectangle difference.
The live slots are summed only after the finite transform has removed their Gauss coefficients. Their unnormalized absolute sums contribute . Combining this with the nominal raw normalizer gives the full volume factor in Equation (18.35), as included above; it is not replaced by a factor-product normalizer. The Fourier measure was fixed before their labels, so conditioning on those labels changes neither the common mask nor the centered saving. A zero conditional slot scalar is discarded only in the present absolute bound.
Set . By Equation (18.44), is at least , since . The centered saving in Equation (18.48) now bounds the exceptional deficit, apart from and the recorded frequency and aggregate support perturbations, by
Indeed, for the left side is , which increases with ; for it is , which decreases. Its maximum is attained at and equals . For positive slots, Equation (18.3) implies . For the zero-slot core, Equation (18.10) gives . Thus the centered exceptional terms require only the terminal loss , or in the padded core. The additional , , and terms are included in the same stage allowance. Together with Equation (18.31), this completes the centered stage at the current width.
Completion of the finite induction
We finish by verifying the quantifier order and the finite induction. Every nonterminal call is to a child with nominal width in Equation (18.32), at least below its parent. The declared row width is , and all nonexceptional moment-input lengths are taken after the specified support and clipping operations. Exceptional raw scales remain formal and are not clipped. The two frequency enclosures, the aggregate support errors, and these clippings alter the width comparison by at most . Choose this below . Every nonempty child then has nonnegative width and leaves its band of length . An empty nonzero-frequency range is discarded; a nonempty formal range just below scale one has already been included by its enclosing length and clipping error.
At each smaller width, Equations (18.4)–(18.6) delete the fixed extra masks before the natural positive-slot estimate. The unrestricted zero-slot assertion follows once from the padded core by reflecting at most its two plains. A centered comparison calls only the earlier uncentered stage in its band, using its strict margin. Each Gauss norm has at most one amplification, whose errors go directly to the second transform. Equation (18.39) is invoked once for each actual natural child, after all its boundary defects have been included in . Thus there is no same-band cycle. The integer defined above bounds the strict calls by , because each drops the width by at least from an initial width at most .
Here is why and the mesh can be chosen independently of the fixed slot count. Equation (18.19) bounds the entire logarithmic error of any slot subset by . Each extracted plain power is measured exactly, and each of the two possible plain clippings in one nonexceptional rectangle, after triangle inequality, has one fixed endpoint error. The exceptional calculation uses raw reductions and the disjoint-subset bounds without clipping. The first and second frequency enclosures use only their one aggregate outer scale and one common row dyad. All the local ledgers are affine or positive parts of affine expressions in the fixed list of aggregate lengths displayed above. Their numerical Lipschitz constants do not depend on ; the local inequalities and the radical counts use exact prime norms. In particular the change in the positive-slot affine expression is at most
because . The total change of is aggregated before this inequality is used. These observations give one numerical , enlarged for the fixed number of operations per stage, that covers all frequency, normalization, and boundary errors by . The single greedy prefix contributes at most , not one per removed slot.
The analytic separations introduce no derivative-order multiple of . On a fixed full-product logarithmic box a radial kernel is , where is a fixed linear form in the row and whole-column log norms. Every derivative is a fixed combination of Euler derivatives of . Lemma 4.7 bounds these uniformly for all , with any prescribed radial decay and derivative orders. One does not use the weaker bound for . After its displayed central power has been extracted, an inverse root is on the fixed box; its derivatives cost only fixed constants depending on and their order. Lemma 4.5 uses the full weighted Fourier integral, not a supremum over heights below . A required height degree , which may depend on , raises an input seminorm order and a fixed constant, not a exponent. Reflection similarly acts on at most two plains with fixed gamma shape; larger derivative orders raise finite seminorm and height orders, while the upper-annulus subshare remains fixed. The fixed polynomial height factor in Equation (18.12) is integrated by these weighted Fourier measures at its required finite order, without changing the previously chosen exponent of .
The discrete label counts are also used only once. After extracting the displayed exponent for a family of common supports, divisors, or allocations, divide its absolute weighted counting measure by that total mass before applying a separated tuple seminorm. This leaves a measure of mass at most one; its already extracted exponent is not counted again in the smooth norm. Each Fourier measure is common to the live labels by the whole-product construction.
Choices before specifying the slot count. Choose the parameters in the following order. First, from the bounded real ranges and , choose , with small compared to , so that
This bounds a terminal width-floor, diagonal, or exceptional loss; the displayed frequency and numerical support corrections belong instead to the per-stage allowance. With and as above, choose, still before specifying or its fixed profiles,
These choices make the strict drop at least , preserve the comparison margins and padded core, and are uniform for .
Choices for a fixed slot system. Now fix any -independent , arithmetic data, and profile windows. Form and the finite full support boxes through depth . Their fixed factors belong to the constants. After imposing an eventual threshold , the threshold in Equation (18.9), and Equation (18.20), all occurring column, radical, and mask norms have bounded logarithmic ranges independent of moving labels. In those ranges choose every arbitrarily small power estimate with local shares whose sum in a stage is at most . These shares may depend on . For example, the two divisor masses and the at most frozen-slot masses in mask deletion may each use a share . In the prime estimate, the principal squared exponent is exactly , and the contour displacement cost is , with bounded total , not . Choose for its assigned share; the fixed character expansions and powers of are absorbed after an -dependent threshold. The same reasoning applies as individual approach zero, since . For divisor allocations use the global bounds and with a sufficiently small , not a fixed loss at every prime. Rankin’s fixed-radical bound is treated with the same local shares. The one normalized pool average has only its single density loss in a stage.
The induction is simultaneous for every surviving subset of these original slots, with the same mesh. To make this precise, for , let
be the permitted error when at most strict calls remain. A terminal group, including its bounded reflection or comparison preprocessing, has error at most . A strict edge and its fixed number of same-band operations use the child envelope plus at most , giving . The Gauss allowance in (18.23) denotes this appropriate envelope and the current local shares; it is not a request to reapply the moment lemma with an -dependent loss and a new mesh. Triangle inequalities take the maximum error up to the already counted mass, and Cauchy–Schwarz averages the errors of the two children. Consequently one terminal loss occurs along a branch, not at every ancestor. The largest path error is at most by (18.52).
Finally choose the required finite kernel, reflection, prime, and terminal seminorm and polynomial-height orders backwards through these stages. The full weighted Fourier estimates and uniform Euler-kernel estimates above make every such choice finite. Choose one final lower threshold for the aggregate support inequalities, pool separation and density, the raw frequency tails, and all fixed logarithmic losses. The orders, constants, and threshold may grow with and the fixed data, but , , , in the exponent comparison do not.
Each new extra mask is supported on frozen columns or a frozen amplifier prime, and its logarithmic norm increases by a bounded total length at a stage. It is fixed within every child row sum. The only row-dependent zeros there are the natural zeros of the row; the declared moving zeros remain in the fixed twist and remain counted. Over depth the masks remain of polynomial norm. On an exceptional row, the redundant part of the full moving union and the row radical, together with these extra masks, forms the common polynomial-size ; the lattice cancellation is uniform for it. The fixed-numerator ray lemma controls the finite choices at , without absorbing a moving good prime into a fixed modulus.
When this estimate and the inverse moment are applied together, all internal orders in both arguments, including the reflection-kernel orders, are fixed first. The later external Fourier-tail order in Lemma 4.5 lies outside this internal propagation: it raises only the external input seminorm and does not change a previously fixed internal height order. This proves the asserted finite-order uniformity. The finite induction proves the natural assertion, and the initial mask deletion proves Lemma 18.1 in its full stated form.
For the later physical application, and the row is sixth-power-free. If a prime outside has valuation in , its local character has order , so the inducing character cannot belong to . The exceptional physical rows are therefore supported on ; sixth-power-freeness makes this a finite set, up to the finite unit group. With abstract moving twists, additional exceptional rows can arise by cancellation. They were included in (18.41) and the fixed-character volume argument.
Prime amplitudes and refined row counts
We use the current Part II arithmetic data and the physical slots of (12.5). Instantiate the shared zero detector of Section 8 with these same fixed data. The main and error factors below belong to the retained dynamic decomposition in (16.10); no individual local quotient is asserted outside that region. Every retained external coordinate obeys the single height allocation in (10.14).
Prime amplitudes
For a main physical slot of scale , write its central factor as
The main part in Proposition 16.1 is exactly
As in Section 12, each sum over retains the same allowed set , including its exclusion of . The original zero extension is retained, so a prime dividing does not contribute to this main slot. The real part of is in a fixed bounded range and its imaginary part is one of the external frequencies restricted by the common height allowance.
Lemma 19.1 (Prime bound in a bin). Under the hypotheses of Lemma 8.2, with the prime-annulus Mellin frequency included in its cumulative allowance, for every
The implied is uniform for and the fixed real ranges. It holds for every main slot in the row.
Proof. Expand . Every resulting prime character belongs to . Lemma 4.9, applied to the buffered disks, bounds its logarithmic derivative on by ; the logarithmic derivative of the deleted product has the same bound. Mellin inversion of the corresponding smooth von Mangoldt annulus, shifted only in the retained central range, gives after normalization. The pure twist is translated into the logarithmic-derivative argument before the added Mellin frequency is truncated. The joins have bounded real length. On them the logarithmic derivative is inside its allocated buffer, while on the starting line it is absolutely bounded. Apply the pointwise estimate in (4.11) to the untwisted transform for the joins, and (4.10) for the absolute-line tails. Choosing the external order after their fixed polynomial scale and height bounds gives the asserted estimate.
To pass from von Mangoldt coefficients to primes, divide the annular weight by . On the fixed annulus,
so this preserves every fixed smooth seminorm for sufficiently large , without introducing a power of depending on the derivative order. Bounded are handled by absolute counting. Prime powers contribute after central normalization, since their number in a norm annulus is . The polynomial-size punctures and their zero extensions are already included in the logarithmic derivative. This proves the bound. □
Here is a precise amplitude subdivision. Choose a fixed bin width . First reduce and , after the slot lengths have been fixed, so that the preceding bound is at most for all sufficiently large . This is possible because stays in a fixed bounded range for each fixed mesh. For a main slot with , put
Put if , and also put for an error slot from (16.9). Then, for a main slot,
No lower bound is asserted for a slot with . The finitely many possible vectors , with the possible endpoint value , partition the rows into amplitude bins. Define their length-weighted mean by
This records prime amplitude; it is not the conductor exponent denoted in the auxiliary fourth moment.
Selected prime slots and the row counts
Use and from (12.1):
The parameter remains dynamic; is the fixed slope from sixth-power amplification. Since and , the positive-slot hypothesis of Lemma (18.1) is satisfied by equality. Equation (12.2) gives for the current Part II bins, including the possible endpoint .
Fix a dynamic and amplitude bin and fix the external physical Mellin parameters. Write for the fixed third Mellin parameter, so the physical slots are . All , and hence , are now fixed within its row sum. At base , the length of slot is , and the total available length is . For a requested length , order the positive decreasingly and fill fractionally in that order. The gained exponent is at least : if positive slots suffice to fill , their initial weighted average is at least the average of all slots; otherwise retaining them all gives gain . Removing the one possibly fractional slot loses at most . Thus a fixed subcollection of whole positive slots of length at most satisfies
When a strict moment inequality is needed, we first replace by for a fixed small , or select no slot if . The resulting loss in this display is at most , except in the stated zero-capacity neighborhood, where an unweighted moment will be used. Both losses can be made smaller than any prescribed positive power.
The selected factors have exactly the coefficient class required by the moments. Conjugate both witness factors, including their profiles, if necessary and write their row character as , . Relative to this row, a physical prime has coefficient
This is a fixed finite combination of members of ; it is independent of the moving row in the fixed row sum. There is no requirement that . The factor is part of its smooth profile. Underlying prime supports remain disjoint before masks. The marked moment permits this negative common row orientation. To apply Lemma (18.1), whose row character has positive orientation, conjugate the whole product of both plain witness factors and all selected prime factors. Its absolute square is unchanged, and its common row character becomes . Both witness profiles and every selected slot profile are conjugated, and each selected slot coefficient becomes , again a fixed finite combination of members of . Conjugation retains all zero extensions and underlying prime supports. It also preserves whether the inducing character belongs to , since is a group. The witness and physical heights need not be equal. Apply Lemma 4.5 to the rowwise witness parameters after fixing the physical parameters and selected indices. Derivatives in those parameters insert only logarithmic profile weights. The cost is a fixed power of , uniform over moving rows and outer labels. Every retained large row induces outside , because it ramifies at a prime outside . Thus the family condition of Lemma 18.1 holds.
For an actual plain length , its largest zero-loss capacity from Lemma 18.1, at effective row width one, is
Indeed the moment is applied to two copies of the plain witness, so its condition is . For an inverse witness of length , put . We use this capacity only where the second strict inequality in Lemma 17.1 also has a fixed margin.
Proposition 19.2 (Row counts from the witnesses). Let be a fixed dynamic and amplitude bin of retained sixth-power-free physical rows , with , , and mean amplitude . Put , so , and define
Assume the total available prime length exceeds by a fixed positive amount. For every and every , the capacity decrements and slot mesh can be chosen using only , and the bounded real ranges so that
where is uniform over moving rows and
The estimate is valid for the rowwise witnesses of Proposition 8.3, with its height condition. If no prime slots are selected, then instead gives
without a prime-supply hypothesis. At zero inverse capacity use Lemma 17.6; at zero plain capacity use the zero-slot case of Lemma 18.1.
Proof. Subdivide by the witness presentation and dyadic pair. The number of choices is ; the remaining rowwise smooth parameters are handled by the preceding Sobolev argument. Work in one subdivision, denoting it again by , and let be the actual lengths from Proposition 8.3. Whenever the selected slots satisfy the corresponding moment hypotheses and have total requested capacity , their spike and the individual witness spikes imply, after reducing preliminary losses,
In the second line use two copies of , so the denominator is , not . The effective width is one because the twist is fixed within the row sum and has no moving conductor radical. Each formula includes the arbitrarily small capacity, rounding, moment, and witness losses.
Inverse witnesses without selected primes. Whenever no inverse slot is selected, use instead the sixth-power amplification of Lemma 17.6. It applies to these physical rows because their ideal valuations are at most five and their original zero extensions are unchanged. After the present subdivision, are common, and the inverse base profile is
Its fixed logarithmic seminorms are uniformly bounded: a derivative of the second factor is supported where its scaled argument lies in a fixed compact interval. The remaining rowwise parameters are in a fixed compact interval and the pure twist , of absolute value at most . The rowwise assertion of Lemma 17.6 therefore applies with that height range. Replacing its factor by changes only a fixed constant.
For clarity, this use is uniform even when approaches one with . If , (17.88) with preliminary loss has exponent
For a requested loss , take, for example, and . These are fixed before , and the two extra terms are at most . Thus division by the inverse witness spike gives
In particular this is not an application of the strict marked moment with the shrinking margin .
Cases requiring no selected primes. We first dispose of the cases in which a witness already gives the required count without selecting primes. For , (19.3) uses effective moment exponent . Division by the inverse spike gives . Because and , this is at most
up to . This includes , where the two branches in (19.3) agree. If , the zero-slot case of Lemma 18.1 gives count exponent . Since , this also satisfies the stated bound. We may therefore assume for the remaining argument that
Both capacities and are then positive; when either is too small for the fixed decrement, we will use its unweighted estimate below.
Comparing the positive capacities. For the inverse capacity , the resulting ideal exponent is below. To compare the plain exponent first replace by its value at , namely . Since the actual is at least , the resulting ideal comparison exponent is
Both the actual plain exponent and its baseline version decrease with : their derivatives are respectively
The replacement of is therefore legitimate.
The two affine expressions in Equation (19.5) cross at
Here . Directly,
and
The last expression is increasing in , equals at , and at is . Thus, throughout the stated ranges,
Use the plain count when , and the inverse count when , except within the fixed small zero-capacity neighborhoods. On the inverse side . After decreasing by ,
The second inequality has a margin at least before its positive first term. These are precisely the two strict width conditions of Lemma 17.1 at row width one. The inverse capacity is at most . On the plain side, , so its capacity is at most . At the available length is
The assumed positive supply margin and a sufficiently fine mesh therefore permit every selection just made.
On the plain side, replacing the baseline capacity by the actual capacity in Equation (19.2) raises the count exponent by
For the inequality use , , and the lower bound four for each denominator. The constants in the term are uniform.
The weighted average
is independent of : the -coefficients cancel, and the weights sum to . It is the common value at . Since is increasing in and is decreasing, the chosen short count is at most .
Small capacities and the conclusion. If but , the same no-slot estimate, using , gives
If , then , and its count is at most . Since , choosing within the prescribed preserves the short bound. Finally, and force , so the same unweighted plain estimate applies. No negative capacity is requested. Together with the cases requiring no selected primes, this proves the stated selected count after adding the finitely many subdivisions.
Finally, use no prime slots and take . For the inverse side use (19.3), including for every ; for the plain side use the zero-slot case of Lemma 18.1. The same short calculation with selection gain zero, that is, with in the two comparison lines, gives ; the long bound is . Neither input has a prime-supply hypothesis, proving the final assertion.
Remark 19.3 (Unselected inverse witnesses beyond the Part II bin ceiling). The derivation of (19.3) uses only the inverse spike from Proposition 8.3 and Lemma 17.6. It can therefore be repeated for any instance of the shared detector satisfying those hypotheses, independently of the current Part II bin ceiling. Consequently, for each fixed , the bound in (19.3) holds on each fixed presentation/dyadic subdivision of a fixed dynamic bin of retained rows with actual witnesses from that proposition whenever
and lies in the prescribed bounded nonnegative range. It uses the common inverse profile , rowwise parameter bounds, and witness loss and height hypotheses used in the preceding proof, but requires neither nor a prime-supply hypothesis. This conclusion does not include all rows in the floor bin , which need not have an actual witness.
The formulas in Proposition 19.2 describe the only row exponents needed below. The cardinality factor is kept explicit here. We verify the additional target-dependent height ceiling required by Lemma 11.1. Let be the minimum of the finitely many detector height allowances already chosen with the real losses. For the fixed target, after the internal profile orders are fixed, let dominate their finitely many height orders. Set
For , , and sufficiently large , the inequality gives
Thus this ceiling enforces all the preceding detector height hypotheses. It is fixed before the external tail order and ; increasing that order changes only external test seminorms, not these internal height orders. Lemma 11.1 then makes the final height choice without changing the positive real margins or the slot mesh.
The seven-eighths bound
We complete the contradiction assumed in Part II. Recall from Equations (12.1) and (12.2) that
for every retained bin. The compensated low estimate is Proposition 15.3. For the same physical probe, we first normalize the principal term of its high expansion, then bound the remaining rows and verify the target-independent margins required by Proposition 2.1.
The geometry and Mellin exponent are
These are the values in Equations (12.4) and (12.3). Write for the local variable called in Section 16; the amplitude ratio below is a different real number.
Use Definition 10.1 with
In the shared analytic lemmas take . Section 16 verifies every part of these data: Equation (16.7) is the absolutely convergent high identity for the independently defined finite expression in Equation (12.5), and the full correction is holomorphic in the two required Euler regions and satisfies Equation (10.4). The excluded set, physical row masks, and calibration are unchanged. In particular there is no additional Euler factor outside this full correction. Its scalar denominator is , and its Gaussian is .
In the estimates below, is an admissible detector width. Its final choice, together with the remaining real losses, is made in the concluding order of choices.
The principal normalizer
We verify the two correction hypotheses of Lemma 10.5. First, Equation (16.14) gives
uniformly in all imaginary parts on every fixed real box in the second Euler region. In particular this holds on the entire rectangle in Equation (10.17), with height degree zero. This is a bound for the full tuple correction.
For the residue value, define
Lemma 13.1, including its assertion about deletion of a fixed finite set, gives
Each leading constant is positive. Since the slot count is fixed, all are positive for every sufficiently large , with a common lower threshold allowed to depend on the fixed data. Set
Using and , we obtain
Consequently on that range and
for every . The lower threshold may depend on the target’s finite excluded set; no uniform prime asymptotic in a moving ray conductor is being used.
On the principal second Euler region, Section 16 defines with , and (16.13) gives , uniformly in all imaginary parts and target unit phases. Apply the principal factorization in (16.12) at , , where it remains valid even if the original quotient by was undefined. It gives
where is the function in (10.1) for this same excluded set . By nonnegativity of , its th slot equals
Indeed the sum of the absolute local errors is at most a fixed multiple of . Choose any pretarget number
Since is fixed, satisfies on that entire line. Thus the exact residue correction is
which is (10.18) with and . This factorization is asserted only at the principal residue; it is not the correction used for general contour moves.
Let be the scalar in (10.1), whose positivity is part of Lemma 10.5. For sufficiently large , define the normalized physical probe
This is distinct from , and both its numerator and normalizer are independent of the analysis height . Proposition 15.3 and the subpower bound for give, for every ,
The same scalar is used for the high comparison.
Choose the fixed cutoff as required for (10.2). The associated is holomorphic on , satisfies the contraction there, and uses this same . Let denote the term of (16.7), and set
All hypotheses of Lemma 10.5 have now been verified with . Its remainder estimate is
where the two geometric margins are
Lemma 10.5 includes the residue paths, the scalar Jacobian, and the rightward shift of the main integral. In particular the last term is the error estimated on its original global line; it is not part of . Both this signal and the physical probe are independent of .
The compensated high exponent
The low estimate and the principal-row comparison now concern the functions and required by the continuation criterion. It remains to prove, for a common ,
We estimate these nonprincipal contributions first relative to the raw scale . Division by costs an arbitrarily small power, reserved once in the final choice of margins.
Lemma 20.1 (A high exponent for one row bin). Let , let with , and let be the finite set of retained nonprincipal physical rows in one fixed dynamic bin . Put . Assume the bin and height hypotheses of Lemmas , , and , with , , , and the cumulative allocation in (10.14). The bounded real ranges, the positive losses , , , and the slot system are fixed before the target.
For each retained tuple of external parameters and each subset of error slots, partition pointwise into the amplitude sets of Section 19.1, and into the witness subdivisions of Section 19.2 when a witness count is used. Suppose each such set has main-slot mean , as in (19.1), and
uniformly in the retained tuple and moving labels. The occurring range over a fixed bounded set and may depend on the pointwise set, , , and , but not otherwise on the target. For each occurring pair define
If , let be the supremum of these values over all pointwise sets at all retained tuples.
On the central contours
the contribution of the original fixed dynamic-bin sum is bounded by
where is the amplitude-bin width and is uniform in moving labels. An empty bin contributes zero. The constant in the term depends only on the bounded real ranges and the fixed slot system, not on the target. No separate integral of an individual pointwise set is asserted. After fixing , all discarded external pieces and joins are , for a fixed and every fixed .
Proof. We verify the central hypothesis of Lemma 10.4, which supplies the contour move and its tails for the full correction just specified. Its bin ceiling holds by (12.2). The physical coordinate is included in its height allocation because it enters the prime profiles. The other witness, dyadic, and prime-annulus coordinates are the fixed finite list used in the estimates of Section 19.2. Their complete pointwise bounds include the discarded auxiliary integrals on global or absolute lines. Thus the single cumulative allocation in (10.14) applies, without renewing an allowance at a later estimate. Only on the retained contours, Proposition 16.1 gives the decomposition in (16.10). For , its summand is
The required reflected primitive numerator bound follows from the buffered estimate for the numerator presentation and its conjugate, together with Lemma 4.10, as verified before Proposition 16.1. The retained heights lie in its allowed set. Every retained numerator is nonprincipal. Fix one amplitude set at one retained tuple. For a main slot, and . Assign to an error slot. Equation (16.9) bounds all error slots in jointly with the numerator; its proof uses the actual conductor deficit in Equation (16.11) simultaneously for the distinct strict ramified labels. It is not a separate numerator allowance for each slot. Since , multiplication of these estimates gives, after choosing the preliminary powers,
Here is a fixed height order for the target and slot system, and , including the assigned zeros for the errors. No lower bound on an error slot has been used.
Multiplying by the assumed cardinality proves Equation (10.13) with , after taking to be a fixed sufficiently large multiple of . This multiple depends only on the fixed slot system and the bounded real ranges. There are error subsets. The number of amplitude vectors is fixed, and the witness dyadic choices contribute only a fixed power of . Thus the required pointwise multiplicity bound holds. These sets are formed only after Lemma 10.4 has moved the original dynamic-bin sum using . They are not used for continuation and are not integrated separately.
Apply Lemma 10.4 with and . Its exponent in Equation (10.15) is
Because , this is the first line of Equation (20.4). Substituting the geometry and gives its second line. In particular is a base- exponent, not . The explicit errors in Equation (10.16) are on the bounded -range after the remaining preliminary powers are chosen. Its supremum is exactly the one in the statement. Lemma 10.4 also gives the stated external tails with a scale degree fixed before .
The floor bin has and requires no zero witness. The ideal count , together with , gives
Its frequency slope is positive, so this bounds every . A small extension above will be controlled below.
Small and large row norms
Set . Lemma 16.2 bounds the positive sum of the full selected tuples, with every retained before taking absolute values. On the small-row lines
Equation (16.15) gives
uniformly in all imaginary parts. This is Equation (10.20), with height degree zero. It remains valid at zeros of individual local factors. The data for Lemma 10.6 were already verified above, so it applies to every physical row in these dyads. Its classification includes nontrivial unit numerators and permits a principal denominator; no detector witness or selected moment is used here.
The -independent part of the relative exponent is
The row exponent in Equation (10.21) is . Thus the small dyadic sum in Equation (10.22), measured relative to , has exponent at most
It is negative after the adjustable real losses are made sufficiently small. Write for this fixed error-free saving.
For the large rows, fix . On , the same Equation (16.15) gives
for every physical row and all imaginary parts. This verifies Equation (10.23). Lemma 10.6 therefore gives, with ,
and, for every fixed after choosing ,
Here is the row contribution of Lemma 10.6 for the present physical expression. A fixed sufficiently large makes the last exponent as negative as required. It is chosen after but before the target. These invocations use the quotient-free tuple bounds in Section 16, not the central main/error factorization.
The endpoint inequality
We next bound , first without adjustable losses or height factors. They will be restored with a quantified order of choices. Recall
At the live upper endpoint , take in Proposition 8.3. Then . Apply the no-slot amplified estimate in Equation (19.3) on both sides of . For , its exponent is
For in the stated neighborhood, the same estimate uses , so its exponent is . The fixed amplification margin is independent of this neighborhood.
Thus no selected primes are needed and the ideal row exponent is . Using in (20.4) gives
Now assume . Put , and use from Proposition 19.2. The parameter remains the dynamic value , not the upper bound . Thus the actual plain capacity used in that Proposition is
as in (19.2). The comparison in (19.6) is for this exact capacity and raises the row exponent by at most , apart from requested small losses. Define
The denominator is positive. Indeed
and consequently
Because , one has , so . Furthermore,
Thus and this balances the two counts. The formulas also have the stated closed-endpoint values: at , one has , , and . The corresponding crossing has , so its inverse capacity is zero. The preceding equality argument uses (19.3) at that boundary, not a marked estimate with a vanishing margin.
Lemma 20.2 (Compensated endpoint certificate). For and , define by (20.8) where , and let be with and . Then
In particular the bound is uniform on the range , including the closed endpoint.
Proof. Set and . To verify the calculation, write
Then
From and (20.4),
Multiplying out gives the explicit quadratic
Multiplication by and completion of the square yields
This identity can also be checked by coefficients: expansion of its right side as a polynomial in gives respectively
which are the constant, linear, and quadratic coefficients in the preceding display multiplied by .
Every term on the right of Equation (20.9) is nonnegative: and . The first line is at least , while . Hence
using .
The lower bounds for and bound all derivatives of the crossing and cutoff on the compact parameter ranges. The saturation losses are uniform because , and the inverse selection has the explicit supply and width margins proved in Proposition 19.2. At a zero capacity its unweighted bound differs from by at most a constant times the chosen capacity decrement. Since , these cases obey the same comparison. Thus all detector, bin, and rounding errors have a total with a target-independent constant once their individual requested losses are at most . Let denote the scale exponent relative to after the observed row bound is inserted. For now the explicit height factors remain outside this exponent. The coefficient of in Equation (20.4) is , so at the capacity replacement contributes . Denote by the sum of and all other adjustable real losses; the preceding uniformity makes it arbitrarily small with a target-independent coefficient. The certificate gives the comparison actually needed:
The subtraction of is essential: the certificate is not a claim that for every . When the height factors are converted to a reserved exponent allowance below, that allowance is added to .
Frequency ranges
For , the available length is
Passing from base to base changes a slot length from to , so one mesh chosen with this factor of two satisfies the moment requirement throughout the interval. If
then for the supply remains greater than , whose margin above is .
For , use the ideal row upper exponent . For , use . Both are at least , so
The floor has a positive slope as well. Thus bounds all these exponents for . The cost of extending to is at most : indeed
and . The slopes at and floor cases are smaller than two.
For and , choose and use no selected primes. Proposition 19.2 gives the ideal exponent outside the floor. Use the slightly larger common exponent
At it equals one, so it also covers the floor. Its slope is on this range. Using in (20.4) yields
The middle expression follows by substituting , , and ; the last inequality uses . At , the count used in (20.7) and its positive slope already control every . Together with Section 20.3, these cases cover every physical row norm. Only uses selected physical prime factors in a row moment; every physical slot remains in the high correction in all ranges.
To compare with , subtract from each ideal exponent. In the adaptive range this is precisely the comparison in (20.10); its only positive capacity allowance is . The other endpoint ranges have nonpositive ideal exponents before subtracting . Thus all of them retain the target-independent main high margin
The low exponent has margin . The principal contour and approximation margins were established in Section 20.1; we now choose all losses together.
Order of choices and conclusion
We finish by separating the target-independent real choices from the target-dependent height and external test orders. The numerical choices remain part of this application; the final height selection is supplied by Lemma 11.1.
Proposition 20.3 (Order of choices). Under the contradiction in (12.1), there are numbers
and a fixed geometry, moment losses, capacity decrements, slot system, amplitude width, bin width , and extension , all chosen before the target character, with the following property. For every primitive finite-order target , one can then choose its fixed arithmetic data, a positive height exponent , a finite external tail order , and a lower threshold such that, for ,
The exponents do not depend on . The cutoff occurs only in the estimates, not in either function.
Proof. The ideal margins are
The principal contour margins are in Equation (20.3). Reserve one half of each of . On the compact real parameter ranges, the coefficients multiplying all requested detector, moment, capacity, and rounding losses are bounded independently of the target. Indeed, , , and ; the dyadic lengths are bounded, and Proposition 19.2 gives fixed inverse width and supply margins. The equality uses the separate no-slot bound above. Choose the moment losses and capacity decrement so that their total cost in the high exponent is less than .
Let be the mesh supplied by Lemma 18.1 for these losses and bounded real ranges. Its uniform assertion on applies in particular to the compact closure used here, and the mesh is independent of the number of slots. Only the eventual seminorm and height orders may depend on a fixed slot count. Let be small enough that a squared-spike rounding loss below , after the bounded changes of exponent base, costs less than . Choose a fixed even integer with
These positive lengths sum to and are independent of the target and . Put . For , set
and choose a nonnegative, nonzero . The intervals have positive gaps. Hence their underlying prime windows are disjoint for every , before the ray, excluded-set, or row masks are imposed. Equation (12.5) keeps each window at its original scale in every summand.
For each selected row range, has , so
The second inequality uses . The total available length remains . For it is at least , exceeding by . For with , it exceeds , whose excess over is . Thus every selected inverse capacity and the smaller plain capacity are supplied. The extra bound is below half the latter gap. A zero-capacity neighborhood, including the equality endpoint, uses the no-slot moment. Actual annular ratios change nominal lengths by , absorbed by the fixed strict margins at a sufficiently large threshold.
The internal centered amplifier also stays separated from these windows. Write for the width decrement denoted in the proof of Lemma 18.1. That proof uses the pool exponent and a mesh below . At base , every live physical slot has norm at most , whereas the pool begins at . Their fixed exponent gap makes these sets disjoint for all sufficiently large , uniformly in the selected -range. The marked inverse moment has no mesh condition.
The normalizer in (20.1) is nonzero for this actual choice. Put . The asymptotic already proved in Section 20.1 specializes to
The sign uses even . Any later fixed excluded set affects only the common lower threshold, since its primes eventually leave all these windows. Choose
Thus the principal approximation has a positive margin chosen before the target. The number of subsets, the seminorms of the narrow windows, and their finite height orders may depend on this fixed .
Choose the amplitude width, the remaining power losses, and so that their total high cost is less than , and so that
Here includes the chosen small powers in the principal remainder estimate. Also require and the bounds in Lemma 8.2. The slot lengths have already been fixed, so the small powers needed in the amplitude subdivision can be chosen in terms of their positive minimum. All these choices depend only on and the pretarget slot system.
Choose
The frequency extension then costs at most . Now choose the absolute line in Section 20.3 sufficiently far right that its large-row sum has a saving larger than relative to . Its exponent depends only on these real choices, so also precedes the target. Choose the pretarget cutoff needed for (10.2). Any additional fixed excluded primes required by Proposition 16.1 after the target is fixed may be added to : the same positive product-tail majorant preserves the shared contraction, and neither nor the slot windows change.
For clarity, the nonprincipal real comparison is uniform over all pointwise pairs in Lemma 20.1. Let collect the allocated real, mesh, and moment losses for the relevant range. The endpoint inequality, the intermediate inequality, and the positive slopes give
for every occurring and every moderate , with a fixed fraction of still reserved. Therefore the same inequality holds for , uniformly in . The small and large bounds have their stated separate savings. Apply the subpower normalizer estimate once to the nonprincipal and outer-row contributions, and absorb the remaining finite dyadic multiplicities using a power below . Lemma 10.5 already includes its own normalizer allowance . The four high real allocations above cost less than ; this last allowance leaves more than . The principal inequalities leave more than of each of . Thus one may fix, before the target,
as a common remaining high saving before retained height factors. For the low estimate, apply (20.2) with the pretarget loss , and set . Let be the minimum of the finitely many detector height allowances already chosen with these real losses.
Now fix a primitive target . Choose its admissible fixed arithmetic data and the final excluded set , including its conductor, the common cutoff, and the further fixed exclusions just described. The physical expression, , , and the signal all use this same data. The group and the slot system remain independent of the target. Fix all internal moment, seminorm, and Sobolev orders supplied by the preceding results for this datum. Their uniformity over moving moduli, common masks, and frozen labels gives a finite dominating the product of all retained high factors, including the dyadic, prime, numerator-reflection, and row-count height factors. It is independent of any later external test order. The all-height correction bounds and the direct global or absolute bounds in the shared analytic lemmas likewise give a finite scale degree for all discarded physical pieces, independent of the later order . Normalizing those pieces and summing their finitely many types only enlarges this fixed .
We use the height ceiling verified at the end of Section 19.2. Let dominate the finitely many detector height orders, enlarging if necessary, and put
This number is fixed after the retained orders for the target, but before and . If and , then, for and sufficiently large ,
By the definition of , this proves every literal condition in Lemma 8.2 throughout the moderate range. The first bound also makes the detector’s crude error tend to zero. Every buffered moderate range has ; small and absolute large rows use no buffered cutoff.
The fixed finite list of external coordinates, including the physical coordinate, uses the single allocation in Equation (10.14). Its matrix is fixed by the slot system and the finite retained estimates, and is independent of the external derivative order. For each such , the dyadic, witness, and prime estimates may choose their auxiliary external orders after , as their statements permit, so that their complete pointwise bounds hold. Choose a strict power gap when absorbing their discarded parts; the resulting external seminorm constants are then absorbed by the -dependent lower threshold. For any requested remaining order , these auxiliary orders may be increased further; this changes only external seminorm constants and the lower threshold, not , , or . No internal moment is reapplied to an externally differentiated profile.
Combining Lemma 20.1, all the row ranges, and the principal remainder estimate therefore gives, for every fixed and sufficiently large in this ceiling range,
The lower threshold is allowed to depend on . This is Equation (11.1). Its low hypothesis is Equation (20.2) with , and the two functions do not contain . Apply Lemma 11.1 with , , this , and the verified ceiling . It chooses , then a common dominating external order , and finally the threshold. It gives the asserted high estimate with . Both and were fixed before the target.
Proposition 20.3 and Equation (10.2) verify the hypotheses of Proposition 2.1 with , , and . This contradicts ; hence . Proposition 11.3 at extends the primitive Hecke conclusion to all finite-order Hecke and Dirichlet -functions, with the principal pole allowed, and proves Theorem 1.1.
References
- [1]S. Baier and A. Bansal, The large sieve with power moduli for ℤ[i], International Journal of Number Theory 14 (2018), no. 10, 2737–2756. doi:10.1142/S1793042118501658; arXiv:1802.08964.DOI
- [2]V. Bhargava, G. Ivanyos, R. Mittal, and N. Saxena, Irreducibility and deterministic r-th root finding over finite fields, Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), ACM, 2017, 37–44. doi:10.1145/3087604.3087620; author manuscript.DOI
- [3]K. Billington, M. Cheng, J. Schettler, and A. I. Suriajaya, The average number of Goldbach representations and zero-free regions of the Riemann zeta-function, International Journal of Number Theory 21 (2025), no. 2, 289–316. doi:10.1142/S1793042125500150; arXiv:2306.09102.DOI
- [4]V. Blomer, L. Goldmakher, & B. Louvel. (2014). L-functions with n-th-order twists. In International Mathematics Research Notices (Vol. 2014, Number 7, pp. 1925–1955). https://doi.org/10.1093/imrn/rns257
- [5]Clay Mathematics Institute. (n.d.). Riemann Hypothesis. In Millennium Prize Problems. Retrieved https://www.claymath.org/millennium/riemann-hypothesis/claymath.org/millennium/riemann-hypothesis
- [6]C. David, A. de Faveri, A. Dunn, and J. Stucky, Non-vanishing for cubic Hecke L-functions, preprint, arXiv:2410.03048v2 (2026). arXiv:2410.03048.arxiv.org/abs/2410.03048
- [7]P. G. L. Dirichlet. (1837). Beweis des Satzes, daß jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält. In Abhandlungen der Königlichen Preussischen Akademie der Wissenschaften zu Berlin (pp. 45–81). https://arxiv.org/abs/0808.1408
- [8]A. Dunn and M. Radziwiłł, Bias in cubic Gauss sums: Patterson's conjecture, Annals of Mathematics 200 (2024), no. 3, 967–1057. doi:10.4007/annals.2024.200.3.3; arXiv:2109.07463.DOI
- [9]J. B. Friedlander and D. A. Goldston, Sums of three or more primes, Transactions of the American Mathematical Society 349 (1997), no. 1, 287–310. doi:10.1090/S0002-9947-97-01652-8.DOI
- [10]S. D. Galbraith, Mathematics of Public Key Cryptography, Cambridge University Press, 2012. doi:10.1017/CBO9781139012843. Section and algorithm references use the author's extended and corrected version 2.0, Chapter 2.DOI
- [11]P. Gao and L. Zhao, Moments of quadratic Hecke L-functions of imaginary quadratic number fields, Journal of Number Theory 209 (2020), 359–377. doi:10.1016/j.jnt.2019.09.002; arXiv:1707.00091.DOI
- [12]P. Gao and L. Zhao, Moments and one level density of sextic Hecke L-functions, Functiones et Approximatio Commentarii Mathematici 70 (2024), no. 1, 7–28. doi:10.7169/facm/2057; arXiv:2201.01885.DOI
- [13]L. Goldmakher and B. Louvel, A quadratic large sieve inequality over number fields, Mathematical Proceedings of the Cambridge Philosophical Society 154 (2013), no. 2, 193–212. doi:10.1017/S0305004112000370; arXiv:1112.1642.DOI
- [14]L. Guth and J. Maynard, New large value estimates for Dirichlet polynomials, Annals of Mathematics 203 (2026), no. 2, 623–675. doi:10.4007/annals.2026.203.2.6; arXiv:2405.20552.DOI
- [15]J. Hadamard, Sur la distribution des zéros de la fonction ζ(s) et ses conséquences arithmétiques, Bulletin de la Société Mathématique de France 24 (1896), 199–220. doi:10.24033/bsmf.545.DOI
- [16]D. R. Heath-Brown. (1995). A mean value estimate for real character sums. In Acta Arithmetica (Vol. 72, Number 3, pp. 235–275). https://doi.org/10.4064/aa-72-3-235-275
- [17]D. R. Heath-Brown. (2000). Kummer's conjecture for cubic Gauss sums. In Israel Journal of Mathematics (Vol. 120, Number part A, pp. 97–124). https://doi.org/10.1007/s11856-000-1273-y
- [18]E. Hecke. (1918). Eine neue Art von Zetafunktionen und ihre Beziehungen zur Verteilung der Primzahlen. Erste Mitteilung. In Mathematische Zeitschrift (Vol. 1, pp. 357–376). https://doi.org/10.1007/BF01465095
- [19]M. N. Huxley, The large sieve inequality for algebraic number fields, Mathematika 15 (1968), no. 2, 178–187. doi:10.1112/S0025579300002540.DOI
- [20]T. Kubota. (1969). On automorphic functions and the reciprocity law in a number field. In Lectures in Mathematics, Department of Mathematics, Kyoto University (Number 2). Kinokuniya Book-Store. http://hdl.handle.net/2433/84907hdl.handle.net/2433/84907
- [21]J. Maynard and K. Pratt, Half-isolated zeros and zero-density estimates, International Mathematics Research Notices 2024 (2024), no. 19, 12978–13014. doi:10.1093/imrn/rnae191; arXiv:2206.11729.DOI
- [22]J. S. Milne. (2020). Class Field Theory. https://www.jmilne.org/math/CourseNotes/CFT.pdfjmilne.org/math/CourseNotes/CFT.pdf
- [23]OpenAI. (2026). An unconditional first moment for cubic Gauss sums. In OpenAI Math Release preprint. https://github.com/openai/math/blob/main/preprints/An-unconditional-first-moment-for-cubic-Gauss-sums-September-25-2026/paper.pdfgithub.com/openai/math/blob/main/preprints/An-unconditional-first-moment-for-cubic-Gauss-sums-September-25-2026/paper.pdf
- [24]S. J. Patterson, A cubic analogue of the theta series, Journal für die reine und angewandte Mathematik 296 (1977), 125–161. doi:10.1515/crll.1977.296.125.DOI
- [25]B. Riemann. (1859). Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse. In Monatsberichte der Königlichen Preussischen Akademie der Wissenschaften zu Berlin (pp. 671–680). https://www.claymath.org/library/historical/riemann/r.htmlclaymath.org/library/historical/riemann/r.html
- [26]T. Tao, The Elliott–Halberstam conjecture implies the Vinogradov least quadratic nonresidue conjecture, Algebra & Number Theory 9 (2015), no. 4, 1005–1034. doi:10.2140/ant.2015.9.1005; publisher PDF.DOI
- [27]J. Thorner and A. Zaman, A unified and improved Chebotarev density theorem, Algebra & Number Theory 13 (2019), no. 5, 1039–1068. doi:10.2140/ant.2019.13.1039; arXiv:1803.02823.DOI
- [28]C.-J. de la Vallée Poussin. (1896). Recherches analytiques sur la théorie des nombres premiers. Première partie: La fonction ζ(s) de Riemann et les nombres premiers en général. In Annales de la Société scientifique de Bruxelles (Vol. 20, Number deuxième partie, pp. 183–256). https://books.google.com/books?id=7e0GAAAAYAAJbooks.google.com/books?id=7e0GAAAAYAAJ