bibkey: srivastav2025sievevaughan authors: Priyamvad Srivastav year: 2025 title: Log-free bounds on exponential sums over primes doi: null url: https://arxiv.org/abs/2505.07803v2 claim: The sieve-weighted Vaughan identity retains exact von Mangoldt recovery for general normalized sieve weights by preserving extra convolution terms; the stated additive exponential-sum bound supplies no centered signed Robin-tail estimate at zero frequency. strata_touched: [] license: citation-only triage: anchor
Exact recovery with sieve weights and the remaining signed estimate
The inspected primary is arXiv:2505.07803v2, revised 27 January 2026; v1 was submitted 12 May 2025. The locators below refer to v2. This note attributes the source’s results and records their parameter correspondence; it supplies neither an independent proof audit nor Lean certification. The published identities and sieve arguments are reused, not new project mathematics.
The recovery operator includes additional convolutions
Write for Dirichlet convolution and for . Juxtaposition of arithmetic functions means pointwise multiplication. Section 2, Lemma 2.1 and its first Remark allow arbitrary weights with
With the source’s least-common-multiple transform
and , the cited identity is
Here and truncate the complete von Mangoldt function, including prime powers. The source also states the corresponding identity for . Its standard weight choice has , , with supported on and on ; consequently is supported on . The first Remark explicitly permits other normalized weight choices.
This recovery operator differs from requiring for a single coefficient vector . A restriction proved for that simple divisor response would not exclude (SV1). Optimizing sieve weights and retaining exact recovery are compatible in this published formulation, provided all additional terms are kept. Those terms have no favorable sign asserted by Lemma 2.1.
The divisor-to-frequency expansion is already supplied
The weights in equation (2.1) are
Section 5.1, Lemma 5.1 gives, for every integer ,
The paper attributes this Selberg-weight/Ramanujan-sum connection to Kobayashi and Huxley. The cited predecessors are Kobayashi, A note on the Selberg sieve and the large sieve, Proc. Japan Acad. 49 (1973), 1–5, and Huxley, The distribution of prime numbers (1972). Their full texts were not independently inspected here.
Thus an existing source supplies this particular transition from divisor responses to additive frequency channels. It is not a new FIB spectral theorem. Neither (SV1) nor (SV2) identifies these additive frequencies with the nontrivial zeros of the Riemann zeta function or transports the five Zeckendorf occupancy classes to the needed arithmetic amplitudes.
The exponential-sum theorem keeps its original parameters
To distinguish the paper’s small parameter from the Robin excess exponent, write it as . Theorem 1 assumes , sufficiently large , and
It states the uncentered bound
with specified in equation (1.4) and . The theorem also bounds the corresponding Möbius exponential sum. The Remarks explicitly include and . The source calls the result semi-explicit: is effectively computable but is not given as a numerical threshold.
For the Robin Chebyshev sum, the additive frequency is , represented by , , . Here and the two arguments of are zero. The cited theorem bounds the uncentered ; it states no estimate for the centered difference at this frequency. Its nonzero-frequency savings cannot be substituted for the original signed tail merely by changing coordinates.
The same-source transport obligation
Use the existing jointly selected source class, with its same actual integer , clock , own CA price, proper GA1, regularity and comparison against every integer . That source application is not Lean certified. Its fixed excess exponent is independent of the parameter in (SV3).
If (SV1) is used as the recovery supplier, write its entire right-hand side as
For any chosen normalized weights, the unpaid quantitative input is a same-source lower bound of the form
The weight choice may depend on , but all terms in must use that same choice. Equation (SV1) provides the exact full recovery in this expression, not an estimate for (SV4). The subtracted baseline is still and the outer integration still starts at the actual . The inner summatory functions retain terms below and all prime powers; the finite contribution and every convolution crossing a cutoff remain present. The limit in (SV4) is taken for the joint centered expression, without asserting separate convergence of the components.
The original account
keeps its original . Neither the norm estimates used for the type-II sums nor (SV3) supplies a sign or a rate for (SV4) on this selected class. A future estimate must also justify its connection to the actual CA competitors of this . The source contributes an exact alternative recovery mechanism and the existing additive-frequency expansion; it contributes no new signed Robin margin in this application.
A classical mean supplier for one fixed mixed response
For a specific permissible weight choice in (SV1), use the same actual integer source and clock , and put
These are logarithmic Barban–Vehov weights. They satisfy the general identity’s normalization; they are not the optimized weights in (2.1). The source’s quantitative exponential-sum theorems are not asserted for this replacement. For the same LCM transform , define
The finite support lies in . Use the bilinear form , and put and . The relevant existing supplier is Carneiro–Chirre–Helfgott–Mejía-Cordero, Optimality for the two-parameter quadratic sieve, arXiv:2005.03162v6, Theorem 1.1, equations (1.7)–(1.8). Its normalized weights are defined in (1.4)–(1.5). Multiplying the source’s by gives ; multiplying by gives . Thus the published expansions read
Here is the constant in the cited Theorem 1.1, distinct from the small parameter in (SV3), and . Polarization supplies the parameter correspondence
Both leading terms and both second-order constants cancel. The cited classical theorem therefore gives the two-sided envelope
Here is fixed.
This application is not a new mean theorem or Lean certification. It does not determine the sign of . Nor does it estimate all finite negative responses: the exact floor correction remains
with the full support retained even when .
For the unchanged actual integer , write and . The actual next-layer gains and losses are
Own-price global CA optimality and decreasing layer gains supply . The local negative-part candidate asks for an eventual same-source bound
This candidate remains unpaid. A two-sided estimate for , or positivity of that mean alone, does not supply it. A proof of this candidate would control only one local conversion defect; the Euler gain, other recovery convolutions, centered baseline and complete infinite tail in (SV4) would still need estimates with the same source and weight choice. No original Robin-budget improvement is claimed from the classical mean correspondence.
Fixed-truncation Mellin interface and remaining source coupling
The same source’s Theorem 1.2 also applies with the common parameters . The two normalized profiles have derivative supports and , respectively. Their derivative inner product is zero, so this theorem supplies a two-sided error rather than a positive main term for the fixed mixed mean. The following interface uses the published Mellin kernel in section 2.1, equation (2.5). The finite-truncation and local-residue computations are mathematical applications of that kernel; no originality or Lean certification is asserted.
Write
This is the source’s Euler factor in equivalent notation, with
Keeping the actual finite -cutoff, define
Summing the -variable by its Euler product and applying Mellin inversion gives the exact interface
Here and by removable continuation; zero is not an omitted pole. Choose and so that the boundary of the rectangle with vertical sides and horizontal sides meets no zero of . Let run from to , then to and . The full finite-height identity is
Zeros are summed by distinct position; pole orders retain their multiplicities. The finite Euler factors have possible poles on , which this rectangle does not cross. In particular, the auxiliary height neither truncates away the remaining contributions nor replaces the original arithmetic scale . For
the two right-line tails obey
No required fixed-power bound for follows from this identity or its displayed tail estimate.
For a fixed zero with and , put and . In a fixed sufficiently small neighborhood of , the truncated factor has the local expansion
Its contour derivation starts from
with the neighborhood chosen small enough for initial absolute convergence. Move this line to . The only crossed pole is . On the new line, has real-part parameter greater than one, and ensures locally uniform absolute convergence of this Euler product. The usual vertical growth bound for together with gives the stated error. This local argument does not extend the source’s narrower uniform region by assertion. Uniformity on the neighborhood also controls each fixed derivative of the error by Cauchy’s estimate.
The coefficient in (SV6) is nonzero at . Indeed,
For this product is locally absolutely convergent. Its denominators are nonzero. If its numerator vanished and , then , whereas implies . Thus every factor is nonzero. Also since its real-part parameter exceeds one. The first term at has size a nonzero constant times , so for all sufficiently large .
Let be the multiplicity of and define
For this pair alone, the normalized residue contribution is
To obtain the coefficient, insert (SV6) into . The main meromorphic part is $(R^{2w}-R^w)\mathfrak G(-w,w)/ (w^4\zeta(1-w)\zeta(1+w))$. The leading Laurent term of at is . The st derivative of contributes before normalization. Lower derivatives, the term and the error in (SV6) give the displayed local error. Other zero contributions remain outside that local error.
For a rectangle containing this pair, let contain all other residues and , divided by . Then exactly. If a same-source estimate were supplied, (SV7) would require
for a constant independent of . When , the last term tends to zero. Thus an individual zero package cannot be paid by its decay alone at this scale; the full other contributions or the actual source phases must be controlled. Neither an actual negative-phase source subsequence nor that compensating control is supplied here. Local oscillation on continuous clocks does not establish a sign change of the full or a failure on the selected integer family.
The phase in this interface is . Identifying it with FIB composition rotation would require an additional intertwining map preserving these weights and source conditions. This interface constructs no such map. The CA fixed point, all-integer right-tail maximality and source excess remain the joint hypotheses of the original ; their implication of (SV8) is the open coupling obligation. No required same-source one-sided mean bound, negative-part bound or complete original Robin estimate is obtained from this interface.
A classical higher-prime-power budget with the mean unpaid
Keep the same actual , fixed , weights and cutoffs. Write and, for each fixed integer , define
The finite-correlation supplier is Chen An, A Generalization of Graham’s Estimate on the Barban-Vehov Problem, arXiv:2206.10104v1, Theorem 1.3. Its rational-field case, explicitly attributed there to Graham (1978, p. 84), gives
No condition is imposed. For , apply this supplier with and . For , first use the exact truncation relation
then apply the supplier with and . The resulting transition term in is nonnegative. For , the divisor sum of is supported only at , so exactly. For , . Consequently an absolute constant supplies
The full-support floor correction supplies the second envelope
Indeed $\sum_d|h(d)|\le(\sum_d|\lambda(d)|) (\sum_e|\theta’(e)|)\le B_A$; this bounds the entire fractional-part sum, including . Set
For all the two envelopes imply and . No sign of is assumed.
Reuse the existing Dusart prime-power input: and for . For every fixed , classical prime-power counting therefore gives
Here is a fixed constant; the tail after is bounded by for , and the count is zero below . This is an application of the classical counting bound, not a new prime-distribution theorem.
Put and . Enlarging the nonnegative residual sum to all and integrating against its counting measure gives the exact identity
The boundary terms cancel because . The formula includes an atom at in the first term, so it also holds when the real splitting point is a prime power. Since , the uniform application is
All are retained. In particular gives the floor residual . If the separate same-source mean requirement were supplied, this complete higher-power component would be for the original , including the endpoint. That requirement is unpaid; the existing two-sided mean envelope does not have this fixed-power rate. For , the upper envelope alone is insufficient, which does not refute the negative-part candidate.
For any original fixed , take and define the finite low-layer residual on that same actual by
An empty sum is zero. Since and , the same envelopes give
The last term is unconditionally . Conditional on the still-unpaid mean requirement, obtaining is equivalent to . This stronger target is sufficient for the higher-power component of the local candidate, whose original threshold is . For this leaves the square layer only; all residuals already have the required rate. No exponent is lowered.
The actual CA layer weights do not supply another power saving by themselves. The logarithmic series gives , and own-price optimality gives . Thus for all ,
In particular, is between one half and one times . This comparison gives no lower bound for and leaves open improvement through its sampling on the selected sources.
These bounds are paper-level applications of existing suppliers, without Lean certification or a claim of original number theory. The mean requirement, finite low layers when needed, prime layer , other recovery terms and full signed tail in (SV4) remain unpaid. No complete Robin-budget gain follows from (SV9) or (SV10).
A signed lowest-frequency band for these actual coefficients
Keep exactly the logarithmic weights, cutoffs and actual integer source above. The following application uses the existing classical Mertens input, not a new cancellation theorem. Write
All estimates in this section are for sufficiently large , with fixed positive constants. For an interval , the actual LCM decomposition forces
Indeed and this ratio is the positive integer . Consequently
The coprimality condition can be retained uniformly. The classical finite convolution identity and a split at give
Here means that every prime factor of divides . The first term uses ; the second is the usual Rankin bound on the complementary smooth reciprocal sum. The elementary bounds and then yield
The polynomial remainder is since . It and the logarithmic factor are absorbed by decreasing . Abel summation against on the inner interval, followed by , therefore gives the uniform application
To identify its actual finite frequency band, put , and . Reuse the classical Vaaler approximation, as stated in Baker, Banks, Brüdern, Shparlinski and Weingartner, Piatetski-Shapiro sequences, arXiv:1203.5884v1, §2, equation (2.1), PDF p.6, with attribution there to Vaaler (1985). The source statement was inspected; its underlying proof is not independently audited here. Use its polynomial and nonnegative majorant , with and for . At integers the representatives are explicitly , and . Define
The finite positive frequency band forces and . Thus its merged coefficients are exactly , without an infinite Fourier substitution or a missing harmonic cutoff. Abel summation using (SV11) gives, for every interval , and integer ,
In particular the real contribution of this band and its conjugate,
has the same bound. Put and . The exact identity and the positive part’s -Lipschitz property show where this bound is consumed. For a block of actual primes, , and , let . Then
No sign of or replacement of the actual weights is assumed. For a dyadic block with , the existing and give . At , fixed and , the displayed band term is therefore , . For each remaining layer , and , so this upper bound alone does not reach . Other bands, the actual positive part, and the pointwise remainder are still present. This is an application of existing classical inputs, without Lean certification or a claim of original number theory; it gives no complete Robin gain.
A small-truncation boundary for the absolute remainder envelope
Use the classical Fejér-normalized Vaaler majorant
with continuous value at integers. This is the standard Vaaler construction, attributed to Vaaler (1985); the original proof has not been independently inspected. The approximation statement used above is also supplied by the inspected Baker et al. equation (2.1). All estimates below retain the actual coefficients and hold for sufficiently large .
Choose primes in the fixed-ratio ranges
These ranges are disjoint and . The only permitted LCM decomposition at is : the preceding coprimality observation gives , while and . Thus
The second bound directly applies the existing unconditional prime number theorem to the two fixed-ratio intervals; it is not a new prime-counting result. Each pair gives a different product, and their count is .
If , and , then . The elementary bounds for and imply . Together with (SV14), this gives throughout .
For a fixed integer , define the full active-sample cost
The actual own-price comparison already established above gives . Consequently the primes with have weighted mass , by the same prime number theorem. Uniformly for ,
For squares this is , larger than the already available residual upper envelope for . This is a lower bound for the absolute approximation envelope, not for or the signed error.
Both terms of the Fourier upper budget must therefore be retained. Put , and $\mathcal S_{N,k,x}(\alpha)=\sum_{p^k<x/U} w_{N,p,k}e^{2\pi i\alpha x/p^k}$. The Fejér formula gives
At , the first term is , using and . Its ratio to the lower scale in (SV15) is . Hence the second, oscillatory upper-budget term in (SV16) is itself at least a fixed positive multiple of the scale in (SV15) eventually. Paying only the zero-frequency term cannot pay this absolute envelope.
This excludes only the small- sufficient condition that asks the whole absolute envelope to be small. It excludes neither larger nor cancellation in the signed error, and gives no counterexample to the actual-source target or Robin’s inequality. The estimates are attributed paper-level applications, not Lean-certified conclusions or claims of original number theory.
A weaker joint condition remains possible. Write . The elementary positive-part inequality
and the same band removal give
Only the positive signed error exceeding the actual negative margin is charged in this expression. No quantitative joint bound at the original rate has been supplied for it. The remaining bands, mean requirement, low prime-power layers, prime layer , recovery terms and complete signed tail (SV4) remain unpaid; the original source and target are unchanged.
Exact-integer sample corrections are paid by a classical divisor bound
Keep the actual normalized weights, so . For a positive integer , the LCM definition gives the jump coefficient
Here is the ordinary divisor-count function. Put for positive noninteger . Use the symmetric sawtooth representative , with value zero at integers, and define . For , . For , the positive part’s Lipschitz property gives
The same finite Vaaler polynomial approximates with nonnegative majorant : off the integers the original estimate applies; at integers both and are zero and . Thus a midpoint Fourier convention can be used only with the explicit correction (SV18) when returning to the original response.
For every prime-power layer, including , the global own-price comparison gives . Define its full endpoint cost
If is noninteger this cost is zero. If is a positive integer, only contribute. Since and , (SV17) gives
Directly reuse Nicolas’s divisor-count maximizing reference, printed p.117, equations (6)–(8), with fixed exponent . Its reference maximizes over all positive integers, and therefore
The constant is independent of the selected and ; is a fixed divisor-count reference, distinct from the actual CA integer and its varying price . This pays the exact-integer representative correction for all layers in the original local sampling budget. It is a classical application, not a new divisor estimate or a Lean-certified result. It controls neither near-jump errors nor the signed-error/negative-margin coupling, mean, low-layer residuals, general prime-layer cost, recovery terms or complete signed Robin tail.
A common large truncation pays the higher-power approximation error
Keep the original sawtooth representative and actual coefficients. Put and retain every layer in
For each fixed auxiliary , the existing Nicolas reference at exponent gives . The actual weights and the LCM definition therefore give the aggregate mass at any positive integer jump :
Indeed follows by taking absolute values before the LCM sum, using . The divisor-growth input is reused, rather than reproved.
The Fejér formula gives , with its original value at integers. For , assign the summand to . Then , and . Consequently
At the minimum means one. For every real and , : retain the nearest integers, count those within distance , and sum the square-reciprocal tail. Grouping (SV22) by and using (SV21) thus bounds all contributions, uniformly for , by .
For , use . No part of the support is discarded. The existing and give
Together these bounds yield the actual, all-layer sampling estimate
Choose the same for every sample and layer. With , the original fixed is unchanged and
This estimates the full real-variable envelope directly at a larger . It leaves (SV15) intact and does not bound the two Fourier upper-budget terms in (SV16) separately.
To return to the original response, retain all frequency bands jointly: . Then . Let be the residual (SV10) with replaced by , restricted to the same active samples and . Since for , (SV25) and the Lipschitz property give
Likewise the positive signed error exceeding the negative margin is bounded by , so its higher-power sampled cost is paid by (SV25). The remaining polynomial positive part is not bounded by this argument. The constants, drift and lowest frequency band must still be estimated jointly. This is an application of existing Fejér, divisor-growth and prime-power inputs, without a claim of original number theory or Lean certification. The mean, general prime layer, recovery terms and complete signed Robin tail remain open.
A classical high-harmonic supplier on critical rectangular blocks
Directly reuse Liu–Wu–Yang, Proposition 3.1, equation (3.2), retaining all four terms of that published estimate. Write and, for an actual rectangle , , , put and
Here , is fixed, and . Set the source parameters to
Its remaining hypothesis is . The actual prime and active-sample indicators, , and any test values enter ; enters . Normalize the coefficients using , and . The existing Nicolas input absorbs this divisor factor into an arbitrarily small fixed power of . The source theorem is uniform in these coefficients, so choosing as the complex sign of the actual block sum gives
The source , coefficient logarithms and dyadic summation losses are absorbed by choosing smaller auxiliary exponents before the prescribed . No independence of the test values from the actual coefficients is required. The same bound handles conjugate frequencies and actual positive-part indicators.
On , , (SV27) reduces to
For an unpaid fixed layer , choose a fixed small enough that , and set . Taking pays the dyadic blocks in this critical region to . The source condition holds throughout these blocks for large , since and .
This supplies only the indicated high harmonics on critical rectangles. Low harmonics, other rectangles, the joint drifted positive part and the complete original budget remain unestimated. It is a direct application of an existing exponential-sum theorem, not a new prime-distribution result or an identification of its frequencies with FIB composition rotations.
The same approximation budget includes the prime layer at a larger cutoff
Let be the full-support sampling envelope defined above with , retaining the active condition . The grouping in (SV21)–(SV22) applies unchanged: with all layers, , so the mass at each positive integer jump is still at most . For , directly reuse the existing classical bound in place of in (SV23). This bounds the full far support by . Consequently
This is a corollary of the same classical suppliers and jump grouping, with the original coefficients, representative, source and . It pays the prime-layer approximation error as well. The prime-layer polynomial positive part is not bounded by (SV29).
For the higher-power residual, keep . At each actual sample the two polynomial positive parts differ by at most . Summing over the same active samples and using (SV25) and (SV29) gives $|\mathcal R^{\rm poly}{N,\eta,J_1} -\mathcal R^{\rm poly}{N,\eta,J_0}|=o(A^{-\eta}/L)$. Thus the existing high-harmonic supplier remains usable for this residual. No application of Liu–Wu–Yang to the extra harmonics is asserted. The mean, joint polynomial positive parts, other recovery terms and complete signed Robin tail remain unpaid. This application has no Lean certification and makes no claim of original number theory.
Exact local-support recombination pays high harmonics on all rectangles
Keep the original actual source, fixed , integer representative and full mean . The finite floor response gives . Put
where still has its original support . Then
This is exact recombination of the original floor sum: its terms with are zero. Their fractional-part contributions in the earlier full-support expression are combined with its full linear term, rather than discarded. The full remains in (SV30); it is not replaced by the negative part of . The common approximation cost is already paid by (SV25).
Apply the existing four-term supplier (SV27) on dyadic blocks, now keeping inside each block. This moving prefix can be handled by standard finite Fourier completion. For an integer dyadic , write and . On the exact identity is
Finite Fourier orthogonality supplies the identity and the finite geometric-sum bound supplies the displayed majorants. For each , put the normalized in the allowed coefficient , together with the actual test sign, own-price weight and sample flags; put in . Thus (SV27) still applies with only a logarithmic completion cost. No unestimated separation of a joint indicator is assumed.
For a nonempty block, with . Under the original source condition , the four terms in (SV27) give the uniform block cost
Indeed the first term is at most . Splitting at gives , and . These are bounds for the same rectangle. If the source condition fails, use direct absolute values: the cost is , and for . This again costs without using the source theorem outside its range. The term , outside the dyadic denominator blocks, has total cost from and the harmonic coefficient bound, and fits the same budget.
For , define the complete local high-frequency part
Dyadic decomposition includes the block crossing : take and retain both flags and in . Summing (SV32), its condition-failure bound and the contribution, and including conjugate frequencies, yields
Here is fixed. Divisor normalization, completion and all dyadic losses are absorbed by choosing smaller auxiliary exponents before the prescribed . The bound is uniform in the same actual and sample-dependent test signs; no independent source phases are chosen.
For each original unpaid layer , take a common fixed and set . Its exponent lies between zero and . Choose ; then (SV33) is for every such layer. Define
and let be (SV10)’s residual over the same active samples, replacing in each layer by $[c_A(y_p)+g_{{\rm loc},k}^{\rm low}(y_p) -y_p(s_A(y_p)+\sigma_A)]_+$. Equation (SV30), the positive part’s Lipschitz property and (SV33) give
Empty layer sums remain zero. This applies the same published supplier to all rectangles after exact local-support recombination, extending the critical-rectangle scope of (SV28). The low frequencies, moving constant and drift remain jointly inside the same positive part; they have no bound here at the required rate. The separate full-mean requirement, prime layer, other recovery terms and complete signed Robin tail remain unpaid. This is an attributed application of classical inputs without Lean certification, original-number-theory priority or an identification with FIB composition rotation.
Actual deep-layer weights differ only below the residual target scale
Retain the same selected , its actual , original , , active samples and finite layers in . Let be that same supremum with only replaced by . The existing own-price layer comparison gives for . Using the original envelope , the difference between the two nonnegative sums at each is at most
The existing input and Abel summation give ; is already defined in (SV9). Since , the bound is uniformly . Pointwise order and the supremum inequality therefore give, without requiring either supremum to be attained,
Thus the original local requirement is equivalent to the same requirement for along the same selected sources. The actual clock has not been replaced by an arbitrary continuous one. This application first uses the envelope for ; it does not assert that an arbitrary polynomial positive part is bounded by . Transport to a polynomial residual requires the already paid approximation comparison (SV26).
The depth-dependent lowering of these weights changes this residual only below its target scale. This leaves open compensation from the actual selected clock, the joint low response and other terms of the complete recovery identity. It provides neither the separate mean bound nor a complete signed Robin estimate, and has no Lean certification or claim of original number theory.
Rectangle-dependent cutoffs also pay some of the lowest harmonics
The four-term supplier retains more information than the uniform critical cutoff in (SV34). For the same local-support rectangle, put
where and the auxiliary exponents obey the choices in (SV34). Since , (SV27) with the exact prefix completion (SV31) gives the block cost under its size condition. The two terms of are precisely the second and fourth terms of that supplier, before maximizing over rectangles.
Remove from the existing low part only the frequencies . If , include the crossing dyadic block and both exact frequency flags. If , all positive frequencies in that rectangle are removed and . In either case on the removed blocks. The flags are allowed in for each fixed . When the source size condition fails, the already paid direct bound from (SV32) applies instead. Finite dyadic summation, with the same small-exponent slack as before, costs uniformly in .
This deletion includes when . To handle that singleton within the source’s convention , take source , keep only in , and set . The phase is then exactly , the condition holds, and the four cost terms change only by fixed factors. Negative frequencies are conjugates. The entire harmonic contribution is separately paid by the absolute bound already used in (SV32), also when its lowest frequencies are included.
Let be the dyadic scale satisfying for the actual prime . Define the remaining response, depending on and , by
The dyadic denominator sum begins at ; it excludes the separately paid . In the original residual, replace by and call the resulting supremum . The constants, full mean, drift, active samples and own-price weights are unchanged. The positive-part Lipschitz inequality and (SV34) therefore give
For fixed scales , , an entire rectangle, including its first harmonic, is paid if
These sufficient conditions describe a region, rather than a single example; they are not necessary conditions for a useful estimate. The retained rectangles and their joint constant/drift positive part still have no bound here at the required rate. This is another parameter-specific application of the same published four-term supplier, without a new exponential-sum theorem, Lean certification or complete signed Robin gain.
A published moment obstruction applies to the original linear factor
The remaining joint estimate cannot be supplied by assuming that linear smoothing automatically gives uniformly bounded high moments of each factor. Granville–Koukoulopoulos–Maynard, Sieve weights and their smoothings, arXiv:1606.06781v4, definition (1.9) and Theorem 1.3, directly apply to the original . With the source’s moment index and smoothing exponent , their exponent is . Thus
At the unchanged actual clock, . Expanding the sixth power of gives
The expansion error uses only for the actual and $|\lfloor A/[d_1,\ldots,d_6]\rfloor -A/[d_1,\ldots,d_6]|\le1$. This is an application of the published moment theorem, not a new high-moment result or Lean certification.
It rules out a uniformly bounded sixth moment for this single factor under ordinary integer averaging. It does not rule out compensation in the mixed LCM response , in its drifted positive part, or under the actual reciprocal-prime-power sampling: those are different quantities and measures. In particular, (SV38) is neither a lower bound for the unpaid residual nor a counterexample to its required estimate. Replacing the linear weight by a more smoothed one would change the recovery contract and does not inherit the estimates for the current .
The original response envelopes localize the unpaid prime samples
Choose a fixed and retain only the original finite unpaid layers . Put
Let be the original residual with the additional sample condition , intersected with the same active condition . Apply the envelopes to , before any polynomial replacement. At each , the discarded small-prime part in a layer is at most
For the large-prime part, use and the existing input. Abel summation gives, for , . Thus this part is also . Enlarging each discarded nonnegative sum is legitimate, including primes outside the active range. Finite layer summation and the pointwise order therefore imply
without requiring an attained supremum. For each unpaid layer , so . This is an explicit prime window containing the critical scale; its exponent width need not be small. Empty layers and empty intersections still contribute zero.
In this same window, replace the response by the joint adaptive positive part of (SV36)–(SV37), and denote its residual by . The absolute approximation errors only shrink on a sample subset, and the window flags are permitted in the arbitrary arrays used to delete harmonics. Consequently the original sampled argument applies to this subset with the same rate. Together with (SV39), it gives
This conclusion uses that absolute-error argument, not an inference from the difference of the two unrestricted suprema in (SV37). The constants and full drift stay jointly inside each retained positive part. No envelope for an arbitrary polynomial positive part has been assumed. The remaining task is now restricted in prime samples as well as in harmonics and denominators; the separate mean, prime layer, other recovery terms and complete signed tail still need their original estimates. Equations (SV39)–(SV40) are a localization application of the existing envelopes and prime-counting input, without a new prime-distribution theorem or Lean certification.
Shared sampling primes can be removed from the periodic sector
Retain the same actual source, original fixed , support , and full local slope and mean . For each sampling prime , define
The local floor identity in (SV30) gives the same expression for before the condition is inserted. Only its fractional-part sector is removed. In particular, the original still contains the terms with , and still uses the full .
Directly reuse , the Nicolas divisor-growth supplier already used in (SV27), and . For every prescribed , they give
The count is zero when ; is never removed. This is an absolute coefficient-counting bound and requires no independence between the prime and the denominator.
For any fixed , use the original where that weight is defined. The existing input and Abel summation give, with ,
An atom at belongs to the first sum. All summands in this majorant are nonnegative, so the same bound holds on the original active samples, their prime window, or any subset. Choosing a smaller auxiliary divisor exponent first absorbs the logarithm. Thus for every prescribed and fixed ,
For the original finite unpaid layers, choose . Their total is . The fixed-layer estimate also permits , but it is not an estimate for an unbounded sum of layers or a bound for the remaining prime-layer response.
The same deletion applies directly to the already retained adaptive polynomial. Define
and define by inserting in the denominator sum of , with all its original frequency cutoffs intact. Since , removing the common-prime terms from the constant and oscillatory sectors costs at most
The same sampling calculation pays this extra logarithm. In the original window, replace the retained adaptive response by
and call its residual . The positive part’s Lipschitz bound, the sampled absolute bound above, and (SV40) give
The supremum need not be attained. No coprimality indicator is assumed to factor into the independent coefficient arrays of (SV27): this comparison deletes the common-prime sector by absolute counting after the existing harmonic comparisons. Neither nor an arbitrary new polynomial positive part is asserted to inherit the original envelopes or its vanishing below . The original active flags and the full local slope and mean remain explicit.
This is an application of existing divisor-growth and prime-counting inputs to the original response, not a new coprime exponential-sum theorem, original-number-theory claim, or Lean certification. It removes the shared sampling prime from the retained periodic and constant sectors. The coprime low response, its joint full drift, the separate mean estimate, prime layer, other recovery terms and complete signed Robin tail still have no bound here at the original target rate.
The actual response has a quadratic bound just above its cutoff
Keep the original weights, actual source and fixed exponent. Write
The defining finite LCM sum gives . For , . If , every proper divisor of is at most . Only the divisor can differ from the untruncated Möbius response, and
Consequently, uniformly for real ,
There is no rounding of the observation endpoint. For sufficiently large , every satisfies the displayed cutoff conditions. The existing absolute weight bounds give
Here and . The first follows from and the harmonic-sum bound; the second is the same decreasing-logarithm sum used in the original envelope. Using , and the unchanged in gives
This controls the complete original positive part. It does not estimate the mean by a power, remove its compensation, or bound the constant and oscillatory sectors separately.
For the square layer put , , and restrict to any subset of the actual primes satisfying
They lie in , containing at most integers. The endpoint term is retained. Moreover eventually, uniformly in and . Thus every denominator in the moving local support is smaller than , and with the full drift and mean. Equation (SV45) and yield
Only when the original fixed , choose and . The first term is and the other three have strictly larger power exponents. The whole bound is . Restricting to the original prime window preserves this bound. Removing these square samples from the original nonnegative residual therefore changes its supremum by at most that amount; an attained supremum is unnecessary.
For comparison, the old envelope and the same short-interval integer count give only here. With , its first term is , so that upper bound does not pay this wider strip. This is a comparison of sufficient bounds, not a lower bound on the actual response. When , the old envelope and the existing supplier already pay a fixed-width square strip at ; that case is not an additional payment.
The finite onset calculation is an application of the original weight definitions and counting bounds, not a new classical sieve theorem, historical originality claim or Lean certification. It pays the complete response only in the displayed shrinking strip. The critical region , remaining low layers, mean rate, prime layer, other recovery terms and full signed Robin tail retain their original obligations.
A published short-sum bound also pays prime-layer onset samples
The floor-counting error in (SV45) can be avoided in a sufficiently long onset interval by directly reusing Henriot’s corrected 2014 New Theorem 5, erratum printed p.377. Use its single primitive polynomial and the fixed function . Its parameters are
with a fixed divisor-growth constant . The class follows from multiplicativity, and the same classical divisor-growth input already used in (SV27). These constants do not grow with the Robin source. Here is the theorem’s polynomial parameter, not the interval width .
Set the source’s lower endpoint to and its interval length to . Its range is satisfied when and is sufficiently large. For this same single-factor polynomial, the corrected root density recorded in the cited note is
The existing harmonic divisor sum is at most . Rosser–Schoenfeld Theorem 8, (3.28) gives . Thus the corrected theorem supplies
This invokes the existing short-sum theorem; it does not reprove it or extend Shiu’s literal residue statement to . Since gives , substitution into the unchanged (SV44) yields
The positive terms and are retained in the exact response before this upper bound is taken. The theorem includes real endpoints; there is no omitted unit error in the inner short sum.
For , put and , so , . The actual onset primes lie in . Its integer count is , and each prime has for . The unchanged weights and (SV47) give
The outer endpoint term is explicit. For both , eventually throughout this strip. Hence the same estimate applies exactly to with the full local slope and mean. Any original sample or window subset is allowed.
For the original fixed , choose
Its inner length is ; the exponent gap is . Equation (SV48) for becomes , since its second term has exponent . Thus this shrinking part of the original prime layer, including its entire drifted positive part, is paid at without assuming the missing mean rate. The old envelope and the same integer count would give , which does not pay this strip. Again this compares sufficient upper bounds, not actual lower bounds.
When the original , the square width in (SV46) also satisfies the short-sum condition. Equation (SV48) gives the same payment with a simpler two-term bound; it is not a second payment of that square strip. For the existing fixed-width square payment remains the applicable reuse.
The square strip can be deleted from the original nonnegative residual before applying (SV40)–(SV43). Restricting each of their existing sampled absolute-error bounds to the retained samples preserves the adaptive comparison at . This uses the bounds on the original response; it gives no new polynomial positive part the original envelopes or vanishing property. The prime-layer calculation concerns its original response and does not import the higher-layer adaptive cutoffs into .
These are attributed applications of the corrected short-sum and prime-product suppliers, without Lean certification or a historical originality claim. They control onset strips only. The remaining prime and square samples, critical region , other finite low layers, same-source mean rate, remaining recovery convolutions and complete signed Robin tail still require estimates at the original fixed rate.
Reusing short prime intervals enlarges the paid onset range
The outer integer count in (SV48) can be replaced by the existing Nicolas comparison note’s (GS4). That application supplies the uniform short-increment bound from Guth–Maynard Corollary 1.3, including longer intervals and the prime-power correction. Combining the two existing inputs keeps the actual source, its full drifted positive part, and the original fixed exponent.
For , put , , and . In addition to (SV47)’s conditions, suppose throughout this window. Apply (GS4) with its dummy clock , lower endpoint and interval length . For sufficiently large , and ; also . The onset primes lie in , contained in . Hence (GS4) directly gives
The enlarged interval includes the endpoint contribution. The supplier is uniform at these real endpoints, and any subset of the original prime samples is allowed. With the unchanged , equation (SV47) now gives
For and every original fixed , and for only when the original , choose
These widths satisfy all hypotheses uniformly in . Indeed ; the square layer has a larger exponent. At the outer endpoints, because , and because . Both widths tend to zero. Equation (SV50) yields
for the complete original response on these strips. Throughout them , so the coprime response equals the original response, including its mean and drift. Deleting the square samples before (SV40)–(SV43) again uses those equations’ existing sampled absolute-error bounds on the retained subset. No higher-layer adaptive cutoff or envelope for a new polynomial positive part is imported into the prime layer.
This is a logarithmic enlargement at the original target. At (SV51)’s width, the existing integer-count bound (SV48) has first term , which does not establish that target. This comparison concerns sufficient upper bounds, not a lower bound on the actual response. The explicit widths (SV51) are times those in (SV46) and (SV49). When , the previously paid fixed-width square strip is likewise reused without recounting it. The stronger estimates on the narrower old strips remain available. The power exponent has not improved, the prime strip still shrinks, and the remaining samples, mean rate, critical region, other recovery terms and complete signed Robin tail remain unpaid. This is an attributed parameter application of the existing (SV47) and (GS4), without a historical originality or Lean-certification claim.
Signed short-interval inputs control the actual activation response
The actual coefficients permit a further application of published Möbius estimates. Matomäki–Shao–Tao–Teräväinen, Higher uniformity of arithmetic functions in short intervals I. All intervals, arXiv:2204.03754v4, Theorem 3.1(i), supplies arbitrary fixed logarithmic savings for the untwisted Möbius sum at the length threshold. Its starred estimate includes the ordinary interval sum. The theorem’s upper length cutoff is ; longer intervals up to are covered by equal pieces of length comparable to , with all their lower endpoints in . Choose small enough to keep these pieces above the lower cutoff. This yields, for fixed and every fixed ,
For fixed and , the same estimate is already supplied by Matomäki–Pandey–Pliego–Teräväinen–Wang, arXiv:2610.09567v1, Theorem 1.4. Choose its parameter smaller than both and . These inputs hold at every sufficiently large lower endpoint. No exceptional-set avoidance or unrestricted nilsequence testing weight is assumed. The following is a paper-level application, without Lean certification or a historical novelty claim.
Preserve coprimality and all short prefixes
Fix a supplied pair , , and then fix . Suppose
For , define the actual signed prefix . The exact identity gives
Reuse the finite coprime convolution preceding (SV11). Its inner sum is exactly
Here retains all prime powers supported on . Split this same finite sum at . For , and ,
If is below , the integer count is absorbed by using the displayed positive power margin. For , apply the supplied Möbius estimate. Thus every such prefix, including the arbitrarily short ones, satisfies .
Using , the contribution with in (SV52) is at most
The last bound uses . The elementary divisor identity and the convergent product $\sum_q\mu(q)^2/(q\varphi(q)) =\prod_p(1+1/(p(p-1)))$ directly supply it.
For the complementary , put . The same Rankin estimates used for the coprime convolution give
Uniformly for , : enumerate its distinct prime factors and use and in the logarithm of the product. Retain the interval count for each large . Then this part of (SV52) is bounded by
The second term includes every unit endpoint error. Here and . Relative to , the two terms are at most
All parameters here are fixed and . Consequently, with , Abel summation of the original logarithmic weight gives
The complete constant and drift enter before the upper bound; only their already known nonnegativity is used. This is uniform control of the original positive part at every real endpoint, rather than an average taken before applying the positive part.
Wider actual prime and square strips
Return to the same , and actual source. The existing outer prime increment in (SV50), combined with (SV53), gives for its admissible interval lengths
For with the original , and for with the original , every fixed permits
Indeed ; choose and leaving a strict power margin in . Equation (SV54) is then . The outer lengths still exceed by a positive power, as in (SV51), and these strips still shrink because is fixed.
For the additional prime-layer range , the newer supplier applies because . Choose fixed and , and use
Equation (SV54) gives , with the same strict length margin. The original fixed exponent has not been replaced. For , this signed transfer supplies no additional prime strip; the previous unsigned (SV51) remains available. The fixed-width square payment for is reused.
These enlarged strips retain , the full coprime response, and the original subset and square-deletion rules in (SV50)–(SV51). They improve the permitted logarithmic factor in the width; they do not improve its power exponent. Choosing is not allowed. At a fixed width the stated bounds provide only fixed logarithmic savings, insufficient to certify the original power target when . No same-source mean rate, critical response, remaining recovery convolution or complete signed Robin tail has been supplied by this application.
Almost-all short sums transfer to the actual dense inner mesh
The almost-all supplier is already cited in FIB §400: Matomäki–Radziwiłł–Shao–Tao–Teräväinen, Higher uniformity of arithmetic functions in short intervals II. Almost all intervals, arXiv:2411.05770v2, Theorem 1.1(i), with the starred norm defined in equation (1.4). For fixed and every fixed , it bounds the untwisted starred Möbius sum by for real starting points in , outside a set of measure , whenever . Take the testing function identically one and fix the nilsequence complexity parameter. The starred supremum already includes every initial subinterval; no new maximal-prefix theorem is required.
The following application combines this cited supplier with the all-interval supplier used in (SV52)–(SV53). It does not assume that the actual sampled endpoints avoid the exceptional set. It has no Lean certification or historical originality claim.
Fix a supplied pair , , and fix
The all-interval input is for . Keep the actual , , coefficients and signed prefix of (SV52). The conclusion is
The smooth-source tail retains all endpoint errors
Choose fixed and put
with and otherwise. Expanding the product gives , and
The ordinary weighted harmonic sums therefore give
Indeed, after writing , the inner sums are bounded by and , respectively; the remaining factor is . Thus no uniform subexponential bound for is needed here.
Set with fixed . In the exact coprime convolution of (SV52), the terms with , , retain the integer interval bound . The Rankin bounds are
Together with (SV58), their total contribution to is at most
The second term includes every unit endpoint error. Choose . Both terms are then : the second has the strict power margin . These choices are fixed before grows.
Sparse starts use the uniform input; dense starts use an integral
Choose fixed sufficiently small that
and put . For , and , eventually . Thus grows by a positive power of . The same short-prefix argument in (SV52) bounds every inner prefix by , including lengths below . Reuse and the weighted harmonic bound there. This sparse part is .
For the remaining , fix and a dyadic block , padding boundary blocks only in the nonnegative envelope bound. The actual restored weights remain restricted to , so is never used at a negative value. Put and define the common-prefix envelope
The sampled starts lie in , with separation comparable to . Uniformly for these blocks, , , and . Condition (SV56) implies . Choose a fixed sufficiently small . The strict margins in and ensure that the almost-all supplier applies to length , also on a fixed dyadic cover of . On the exceptional set use . For every fixed it follows directly that
Take disjoint cells of length comparable to around the starts . Since , moving the start by changes any fixed-length interval sum by at most . Averaging over each cell therefore gives the deterministic bound
This uses the exceptional-set integral itself, including any sampled points it contains. It is valid for the actual mesh at every sufficiently large .
For an upper bound, drop and only in this nonnegative small- sum. Restore the actual factor from (SV52). Summing (SV60) over the blocks and gives
Here , , , and . Choose . The first term is ; the other two have the positive power margins and . Combining this with the sparse part and (SV59) proves the prefix estimate in (SV57). The existing Abel-summation and full-positive-part argument of (SV53) supplies its second estimate. The constant , full drift and original coefficients are retained.
The mesh application enlarges the signed prime-onset range
Combining (SV57) with the existing prime increment in (SV50) gives exactly the cost bound (SV54), now with condition (SV56). The supplied source and its original fixed are unchanged.
For every original and every pre-fixed , take
Choose sufficiently close to . Since , condition (SV56) holds eventually. The all-interval supplier allows this fixed , and the almost-all supplier allows any fixed . Thus the actual prime-onset cost is . This extends the arbitrary-fixed- range of (SV55), which previously required .
For the additional original range , take fixed and , and set
Choose close enough to leave a strict margin, because . The same cost is . This extends the small-positive-logarithmic-width range of (SV55), which previously stopped at .
The outer prime lengths in both cases still exceed by a positive power, as required in (SV50), and remains true. The actual weights, coprime response, full positive part and existing sampled deletion rules therefore retain their original scope. The square-layer applications of (SV55) are already available and are directly reused.
These are still shrinking strips with the same power exponent in their width. No growing , fixed-width prime payment, same-source mean estimate, critical estimate, remaining recovery convolution or complete signed Robin-tail estimate follows from this application. For , the unsigned strips remain available; no enlarged signed strip is supplied here.
The full complementary hyperbola bounds the actual finite response
The general coprime Mertens estimate preceding (SV11) also applies outside that equation’s highest-support band. Keep all original coefficients and define the continuous complementary ramp
The actual difference weight satisfies . Reuse and the original divisor-product formula for . The classical identity $\mathbf1*\mu= \mathbf1_{{1}}y\ge1$,
This finite sum includes all and the saturated range . It is not restricted to the first activation or to the highest LCM band. The following is an application of the already cited classical Mertens input, without Lean certification or historical originality claim.
For squarefree , let and . Then is equivalent to , and . Writing retains the exact sign identity
In particular the common-factor sign is not assumed positive. Use the existing coprime bound preceding (SV11), with ,
The bounds already used in (SV52)–(SV53), and for , therefore give, uniformly for ,
The remainder divided by is at most , which is absorbed into . For each nonempty inner interval in (SV63), put . Its lower endpoint is . The weight is continuous, nondecreasing, bounded by one, has total variation at most one, and vanishes at . Abel summation thus supplies
All real endpoints and the ramp’s saturation are retained. Expand the actual in (SV63) and only then take absolute values. The common-factor identity gives
For , the classical gcd-divisor identity gives
Reuse the ordinary divisor harmonic bound . For , , so the preceding estimate is . Absorbing these fixed logarithmic factors and using yields a fixed such that
The second bound concerns the complete original positive part: because . It assumes no sign of and takes no average before the positive part. The existing two envelopes can be combined with this bound on its stated range by taking their minimum.
Together with the existing for , this bound covers every actual argument in the local response problem with . The existing exact floor correction at , together with , also gives
This is a two-sided subexponential mean envelope, not the required fixed-power mean estimate. For every fixed , ; the stated error allowance does not pay that original rate. No estimate for the jointly compensated improper tail follows by splitting off this mean.
A critical prime strip is paid at every original fixed exponent
For the same actual source, and , retain only prime-layer samples with . Put . Their primes lie in , which has at most integers. Keep the actual and use (SV64). This gives
The second term includes the outer integer endpoint error. For every original fixed , choose
This tends to zero. The first term in (SV65) is $L A^{-\eta}e^{-c_0\mathcal W(L)/2} =O(A^{-\eta}/L^2)$, and the endpoint term has the additional strict power margin . Thus this actual critical strip costs at the original target scale.
Here . Every nonzero original LCM coefficient uses , ; its support therefore contains no such . The original and coprime responses coincide, and no common sampling-prime contribution has been omitted. The previously paid sampled approximation and deletion rules can still be used on this subset.
The extra width factor in (SV66) exceeds every pre-fixed power of , but the width remains and shrinks. This does not improve its fixed power exponent. At fixed width, (SV65) gives only subexponential decay in , which does not certify the original budget. The remaining critical samples, same-source mean rate, other recovery terms and complete signed Robin tail retain their original obligations; no RH conclusion or estimate for an arbitrary new polynomial positive part is asserted.
The actual type-II coefficients have an infinite negative-part cost
Fix the original actual , its clock , price , and the weights and cutoffs above. The following is an application of the published recovery (SV1), not a new recovery theorem or a Lean-certified result. It tests a coefficientwise payment scheme; the original joint target (SV4) is unchanged.
To distinguish the type-II factor from the existing divisor response , put
The second equality is the divisor-product identity used in the proof of Lemma 2.1: , , and . Reuse that identity directly. For every ordinary prime , let and define the original increment and its complement by
Both arithmetic functions vanish away from prime powers. They retain every actual multiplicity, and . The original CA price gives . Consequently the complete type-II term splits exactly as
Actual rough multiples retain the original gains
Call -rough when every prime factor of exceeds . Since , for such the only divisors in the supports of and are one. Their values at one are both one. Hence
If additionally and has at least two distinct prime factors, every prime-power divisor is proper. All the convolution factors are therefore , and on these primes. The complete layer telescoping gives
The same source’s all-integer right-tail comparison applies to the actual competitor . Multiplicativity, using , gives
Thus (SV68) is on these integers. The comparison is applicable but is not necessary for this asymptotic: the ordinary bound already suffices at fixed . No favorable actual source phase or additional prime-distribution hypothesis has been selected.
The full kernel detects divergence on one arithmetic progression
Set
Choose two distinct primes and put for . Euclid’s theorem supplies these two primes; no enumeration or progression-prime theorem is needed. Each is -rough, coprime to , and has at least the two distinct prime factors . Also , since . Every is an actual integer covered by the original source comparison.
For any fixed real and , (SV68) gives eventually
Retain the complete original kernel, including its logarithmic correction:
Tonelli’s theorem for the nonnegative integrand now gives
The last series is a fixed positive multiple of . Fixing the original precedes taking the infinite integration endpoint; a large fixed modulus cannot make this harmonic series converge.
In particular, no representation with can satisfy when : at each negative coefficient, . This excludes such coefficientwise nonnegative combinations of source comparison defects plus an absolutely integrable error. It asserts nothing for or for a joint signed estimate.
Natural centering retains the coefficientwise obstruction
The divergence in (SV69) also applies after subtracting the actual type-II logarithmic drift and its full constant mean. Keep the same fixed and all the prime powers in (SV67), and put
These names distinguish the constants from the existing harmonic atom and sampled correction . Since , is absolutely convergent. More explicitly, for fixed ,
The ordinary harmonic and square-reciprocal tails supply these bounds; different prime powers have different integer values. There is no cutoff of the infinite gain sum in (SV70).
Sum the complete recovery before centering
Reuse the published PNT consequence , with all prime powers included. A directly recorded supplier is Johnston–Yang, arXiv:2204.01980v2, Theorem 1.1, equation (1.3). Only this asymptotic consequence is used here; its explicit error is not promoted to the original fixed-power Robin allowance.
The finite support of and Stirling’s formula give
The existing full-support floor correction is . Therefore the fixed low convolution and the gain term have the respective sums
For the second line, sum the exact factor for . The preceding harmonic and reciprocal-tail estimates pay both the finite convolution error and the omitted part of .
Now solve (SV1), with (SV67), for the sum of . The finite term is retained and contributes as . This gives
Consequently the actual centered coefficients
satisfy . This is a fixed- asymptotic, with no claimed uniform rate as grows and no claim about its own signed improper integral.
The accepted finite mean envelope after (SV64) already gives along the original large sources. In particular, eventually. Use this existing consequence without reproving that envelope or claiming a fixed-power improvement. Taking and in (SV69) yields, for every sufficiently large original fixed source,
Thus subtraction of the logarithmic drift, constant mean and Euler-gain contribution does not make coefficientwise negative mass integrable under the original kernel.
The complete recovery still cancels on the same integers
On each actual in (SV69), has no divisor in its support other than one, so . No prime power at most divides . Thus the other low terms vanish, while all the high gains satisfy
The original complete recovery therefore gives exactly
Prime powers also retain their full compensation: for and , and , leaving .
The three operations , and are different. Equations (SV69)–(SV71) concern only the first and its stated centering. They supply no lower bound for the original sampled or losses, and do not assert divergence of either of the latter two operations. This rules out the specified coefficientwise payment scheme, while preserving joint arithmetic compensation as the route required by (SV4). The full original signed bound and RH remain unproved; no historical originality or Lean certification is claimed for this application.