Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help


bibkey: chirrehelfgott2025bounded authors: Andrés Chirre; Harald Andrés Helfgott year: 2025 title: Optimal bounds for sums of bounded arithmetic functions doi: null url: https://arxiv.org/abs/2511.14736 claim: Full residues and published good heights give a critically negligible raw odd-source annulus error without additional simplicity or growing-height hypotheses; effective certification and the signed Robin estimate remain unresolved. strata_touched: [] license: citation-only triage: anchor

Finite spectral data for the actual odd-Möbius source

The primary source is Chirre–Helfgott, arXiv:2511.14736v1, submitted 18 November 2025, with title-page date 19 November. The retrieved PDF has 44 pages and SHA-256 67dbb583b03b42451be44179a85a2bb59590fa6f0922a1f74884401b7f5506ea. The arXiv version record inspected on 10 October 2026 lists only v1 and does not list a journal publication. Corollaries 1.2–1.3, the threshold in Corollary 6.4, Theorem 1.1, the proof of Lemma 6.3, Lemma B.1, and §9.2.2 were read in the original text. The HTML TeX confirms and in the formula and its proof. The complete proof and the authors’ rigorous residue computations were not independently audited or rerun; the applications below are not Lean-verified.

This is a different paper from the nonnegative-coefficient companion, arXiv:2512.15709v1. Its results are reused here, not rederived or presented as new Mertens estimates.

The supplier’s exact signed formula and conditions

Write . For , put and

Corollary 1.2, PDF p.2, at states

All nontrivial zeros through height must be simple. The horizontal bound also excludes zeros at height exactly . The displayed is , not an omitted unit-source correction. No zero in the formula is assumed to have real part .

The restriction is part of the signed formula. It also appears in Corollary 6.4, PDF p.21; the paper’s later extension of an absolute bound to all does not remove it from (CH1).

The general supplier retains arbitrary pole orders

Theorem 1.1, PDF p.2, already uses full residues of a meromorphic Dirichlet series. Apply it with , , and . Retain each distinct nontrivial pole once:

For with , the source’s Lemma B.1 and the proof of Corollary 6.4 supply the contour ladder required by Theorem 1.1: horizontal segments at and vertical lines tending to . Multiplication by preserves boundedness on this ladder, whose real parts are at most one. Nontrivial poles inside the contour need not be simple.

The pole of the weight at zero contributes . The proof of Lemma 6.3 bounds the absolute trivial-pole contribution, after multiplying the theorem’s normalized formula by , by , where

The displayed Lemma 6.3 uses an equality and its proof’s first-term majorant omits the absolute value around . The alternating-series argument and (6.6), using , give the absolute bound above. Set . Theorem 1.1 therefore gives the explicit error envelope

Here the horizontal integral is bounded by . When also , the existing error compression in the proof of Corollary 1.2 gives

That calculation uses , the trivial-pole bound and ; it uses no simplicity of the enclosed nontrivial poles. Explicitly, gives , and , give . The bracket term is at most ; these corrections sum to less than . Finally . This is an application of the general source theorem and its error calculation, not a new explicit-formula theorem.

If a zero has order , write locally, . Its residue in (CH1a) is

For this is the simple residue in ; for larger it retains the corresponding polynomial in . Multiplying a simple-residue term by would not supply this contribution. A numerical certificate for (CH1a) must account for the actual pole orders and their complete Laurent data, or an equivalent certified contour evaluation.

The whole-range absolute estimate is reusable but insufficient alone

Corollary 1.3, PDF p.3, states, unconditionally,

The numerical input includes the authors’ residue computations at height . Reuse the actual dyadic inverse of FIB companion §453.3,

The source already recommends this coprimality transfer in §9.2.3. Here it is specialized to the existing odd filter; no new filtering theorem is supplied.

Summing the two geometric majorants in (CH2) gives

For the actual factorial kernel and , reuse (N2)–(N3) of the complete odd-source application. Inserting the linear part of (CH3) into its infinite Abel integral gives the divergent upper majorant

This prevents that particular absolute estimate from paying the infinite tail by itself. It does not say the actual tail diverges. The existing Vinogradov–Korobov application already pays that tail; it is not repeated.

A lawful finite-annulus interface retains the small arguments

Fix a height with finite horizontal bound and let . Set and define

Every replaced argument satisfies every condition of (CH1c); the others are retained as actual prefixes, not estimated by the signed formula. Thus, for ,

For integers , the existing finite Abel identity is

Replacing by on the right has error at most

Both endpoints are required. Reusing (N2) bounds (CH5), with an absolute implicit constant, by

The linear contribution uses ; the logarithmic contribution uses the existing integrable kernel majorant and . These are parameter applications of the cited estimates and Abel identity, not a new spectral or arithmetic theorem.

A conditional critical-scale annulus use and its remaining duties

Take the already selected sufficient full-source cutoff

Suppose that for every sufficiently large a height is available with and . The horizontal bounds must hold as in (CH1c); for certified evaluation the complete finite residues must also be available. Then eventually and . The signed formula can therefore replace the large dyadic arguments; the smaller arguments remain actual prefixes in .

At these parameters, both terms in (CH6) are : the first has critical normalized order , and the second has order . Both decay since is a fixed power of times a fixed power of . Together with the already paid full odd-source tail beyond , this would give

This conditional application supplies an arithmetic prefix and a signed finite-spectrum annulus, while retaining every small dyadic argument and both endpoints. No growing family of admissible verified heights is supplied here. The source’s fixed finite computations do not establish those unbounded hypotheses. The use of full residues removes the additional global simplicity premise. The signed residue contributions and their actual pole orders are retained; their lower bound against the same actual Robin core remains unproved. This is neither an unconditional critical error bound nor a proof of RH.

Published good heights pay the raw critical annulus

The published Inoue good-height input, Lemma 1 of arXiv:1705.00853v2, supplies, unconditionally, a height

for every sufficiently large real and each fixed . The source attributes this theorem to Ramachandra–Sankaranarayanan. Its extension to all uses the functional equation, as recorded in the linked note. It does not give . The general error formula (CH1b) already accepts the weaker bound in (CH8), so that stronger certificate is unnecessary for the following asymptotic application.

Put and use the strict hybrid

Every small dyadic argument is kept as its actual prefix. For and , (CH1b) has , , and . Consequently it gives

The term retains both and . Define . The existing dyadic inverse and its geometric sum now give

For the same integers , use the error accounting in (CH5) with in place of . Both endpoints and the integral remain. The same kernel bounds and finite Abel identity therefore bound this replacement error by

The implicit constant is absolute. No derivative of the hybrid is used; its switching points introduce no additional endpoint terms. Taking, for example, in (CH8) gives . At the already selected and , the two terms in (CH12), multiplied by , are respectively

They tend to zero since has the fixed logarithmic order already given above. The existing paid tail beyond then yields

This is an unconditional asymptotic paper application of the cited good-height and full-residue theorems and the existing complete-tail bound. It imposes neither RH nor simple zeros nor an extra growing-height existence assumption. It changes the raw error allowance, rather than asserting the identical simplified numerical enclosure (CH1c). The unspecified source constants and thresholds supply no effective numerical starting point or certified growing spectral dataset here. Complete residues, or certified enclosing-contour integrals, must still be evaluated if this representation is to give a numerical certificate. The analytic error does not pay that numerical error. No running-time improvement or new Robin-safe integer range is claimed.

The existing direct residual formula and core application already retain the same and all zero multiplicities. The new parameter application closes only the extra analytic good-height premise of this Möbius representation. It gives no lower bound for the signed expression in (CH13), nor for at the same selected Robin source. Returning to that actual joint signed estimate requires additional information; changing between the two representations alone does not provide it. This application has no Lean verification.

Section 9.2.2 proposes direct continuous-weight analogues with improved terms; it does not provide a theorem for . Such an adaptation could reduce the heights or exact-prefix cost, but needs its own proof. The whole-range absolute estimate, the conditional signed formula, and the pending weighted adaptation have distinct roles.