bibkey: pintz2026mobiusoscillation authors: János Pintz year: 2026 title: Oscillation of partial sums of the Möbius function and zeros of Riemann’s zeta function doi: null url: https://arxiv.org/abs/2608.24878v2 claim: The preprint compares unsigned Möbius averages and interval maxima with a zero-dependent envelope on logarithmic scales. Its maximum upper bound applies to a specified point, but supplies neither a square-root-scale constant nor the signed prime-error tail bound at a selected Robin source. strata_touched: [] license: citation-only triage: anchor
Unsigned Möbius envelopes and the signed source boundary
The primary is arXiv:2608.24878v2,
submitted 1 September 2026, with 23 pages and PDF SHA-256
f2e2d49d3b1c8275bedeed534403fa5524d89171c80d8d015b47b7b43dd335b9.
The arXiv metadata inspected on 7 October 2026 lists this version.
Theorems 2.1–2.2 and Corollaries 2.1–2.2, printed p.8, their definitions
on pp.4–8, and the revised contour estimates in §5 were inspected.
The main theorem statements also occur in v1; updating the cited version
does not assert a strengthened theorem. This is a primary-source scope
check, not an independent complete proof audit or Lean verification.
The quantities and exact precision
Zeros are counted with the source’s conventions. For a positive quantity put . The relevant clauses of Theorems 2.1–2.2 give, for each fixed and ,
The first comparison can be written as . It does not say or supply a relative error estimate. In particular it does not give a specified constant in a square-root-scale bound. With , the paper’s corresponding logarithmic exponent is ; setting it to would assume RH.
The paper also defines and . Corollaries 2.1–2.2 compare these unsigned quantities with the Möbius quantities on the same two logarithmic scales. They do not identify their point values, signs, or oscillation phases.
Only the , and positive-height clauses are used here. Equation (1.26) uses in the two-sided envelope ; its repetition in (2.10) omits those modulus signs in the inspected TeX. That repeated line is not used as a signed zero sum or as a sign supplier.
Boundary of the FIB/Robin interface
For a specified , one does have
Thus the maximum’s upper envelope applies at every specified point in its range, including an authenticated FIB source or a Robin source’s clock. No exceptional-point sampling assumption is needed for this application. Using the asymptotic logarithmic comparison at a fixed still requires its large- premise; the comparison does not certify that this exceeds an effective cutoff. The lower bound on the maximum instead locates some point in the interval; it does not locate that point on a prescribed FIB family or at the selected Robin source. An average magnitude is also not a signed cancellation bound.
For the selected critical source, the effective core application keeps and requires a source-specific lower bound for
The maximum bound above controls , not this signed infinite tail. The prime-error maximum also gives pointwise unsigned envelopes for . Integrating those envelopes yields weaker absolute tail bounds; the required normalized constant and an effective cutoff for that constant are not supplied by the logarithmic comparisons. The paper itself distinguishes the singularities for from the logarithmic-derivative singularities for the prime error, in §2, equations (2.2)–(2.3). Sharing the zero-dependent logarithmic envelope does not transport their coefficients or establish the required source-specific lower bound for the weighted prime-error integral.
These are reusable magnitude estimates and precise source restrictions. The remaining work is a signed, same-source transport or estimate; reproving the envelope comparison would not supply it. This note gives no new oscillation theorem, normalized signed bound, Robin verification range, or RH proof.
Exponential smoothing does not give a positive reconstruction of the Robin cutoff
A related primary is Songlin Han, The Error in a Smooth Weighted Prime
Number Formula and Zero-free Regions for the Riemann Zeta Function,
arXiv:2505.23795v1, submitted
26 May 2025. The inspected PDF has 20 pages and SHA-256
12c69d640afd1742276303b2f59130c3262875dfe5ca990de1f6c75557d64139.
Its definitions and equation (2), printed pp.1–2, use the actual
prime-power coefficients and the exponential error
The cited classical Theorem A, printed p.2, bounds this by under RH. The source’s further zero-free-region implications do not supply an unconditional square-root bound or a signed estimate at the selected Robin clock. The interface below uses its exponential weight, not an assumed converse or an independent certification of its proofs.
Keep the actual coefficients and the complete tail
At the selected critical source, keep , and put
For every real , finite summation gives the exact identity
Indeed, ; interchange only this finite sum with the integral. The lower endpoint for a term is , and . Thus neither the prime powers nor the upper endpoint is discarded.
The existing quantitative PNT supplier ensures convergence of the original improper integral and of the ordered series below. Also . Hence (S1) gives
with . The series is an ordered, potentially conditional series, not a claim of absolute coefficient convergence. This is a finite-summation application to the existing Robin kernel, not a new explicit formula or prime-distribution theorem.
The coefficientwise positive-mixture bridge fails
Suppose a nonnegative measure on positive scales could reconstruct these exact coefficient weights from Han’s exponentials:
with every displayed integral finite. Every such sequence is discretely convex. For every integer , linearity of the three finite integrals gives
But take . The actual Robin weights have and , because is strictly decreasing and . Therefore
Equations (S4)–(S5) exclude (S3), including at this actual source clock. Allowing a nonnegative constant component does not help: its second finite difference is zero. The same local obstruction holds for the finite weights in (S1) when , so it is not produced by dropping the infinite tail. The argument is the usual convexity of positive exponential mixtures applied to the particular cutoff weights; no new general mixture theorem or originality is claimed.
Consequently a pointwise one-sided estimate for cannot be transported to (S2) by an exact coefficientwise nonnegative mixture of these same exponential kernels. This statement concerns that bridge, not every possible relation between the two actual arithmetic sums. It does not exclude signed inversion, an additional correction term with its own bound, Tauberian estimates, or a direct estimate for . Those alternatives must retain and pay the full tail and all reconstruction losses at the same source. The existing FIB dilation filter already gives norm estimates in a different coefficient problem; its invertibility is not a substitute for (S3) or for sign control here. No new signed Robin lower bound, finite verification range, Lean result, or proof of RH is supplied by this obstruction.
Finite weighted variation also excludes an exact signed reconstruction
Allowing both signs does not repair the coefficientwise reconstruction if the representing measure has finite variation after weighting at . More precisely, there is no signed Borel measure on such that
Here a locally finite signed measure is allowed; the displayed weighted
variation makes all the required integrals absolutely defined. This is
an application of classical compact moment uniqueness, not a new moment
theorem. The standard suppliers are polynomial density on and
determination of finite measures by continuous tests. They are already
available at the repository’s Mathlib pin
db584cd6d46c92f209a44c0f1c829460d327499d as
polynomialFunctions_closure_eq_top'
and
Measure.ext_of_integral_eq_on_compactlySupported.
For finite signed measures, apply determination to their Jordan parts.
These are inspected upstream suppliers, not a compiled Lean application
of (S6).
To apply them, put and push the finite signed measure to , extending it by zero at the endpoints. Call the result . It has no atom at , and (S6) says
The uncut weights have a positive finite comparison measure. Define it on , with zero endpoint masses, by
The classical Gamma integral ([DLMF 5.9.1](https://dlmf.nist.gov/5.9.E1), with , and ) and the substitution give . All integrands in this comparison are nonnegative. Tonelli therefore gives
In particular , which verifies the needed finiteness as well as the absence of an atom at .
Let and . For every , the integer is strictly larger than . Equations (S7)–(S9) thus give
Compact moment uniqueness implies . On each the multiplier has a bounded reciprocal, so is zero there. Hence is supported at ; both original measures have zero mass there, and consequently . Their zeroth moments would force , whereas and is strictly decreasing. This excludes (S6).
The full tail moments fix the low moments in this finite-variation measure class. Merely allowing negative weights therefore cannot alter the initial plateau while preserving every later coefficient. This does not rule out conditional or distributional inversion outside this class, approximate reconstruction with bounded losses, or identities specific to the actual arithmetic coefficients .
An explicit correction retains the actual arithmetic question
There is still a finite correction route. With and , define
For every one has exactly
The term is , since ; is never used. Taking the ordered limit justified in (S2) yields
Equation (S12) is finite subtraction followed by the existing ordered limit. It asserts neither absolute convergence of the arithmetic series nor an exchange with an exponential-mixture integral. The complete source dependence now includes the arithmetic signed correction ; bounding the uncut quantity alone does not pay this correction. The remaining Robin obligation is a sufficiently strong joint lower bound at the same , including and . No such bound, new prime estimate, originality claim or RH proof is provided by this classical moment application.
A literal probabilistic Möbius supplier fails actual-source checks
Maxie Dion Schmidt, Picking up the partial sums of the Möbius function
problem with probabilistic number theory,
arXiv:2604.23517v1, submitted
26 April 2026, supplies probabilistic hypotheses alongside identities for
auxiliary arithmetic functions. The inspected PDF has 10 pages and SHA-256
1dfc27758a5c7459f86cc68437b2ebbb4ed8335b8620dd6c91ce9709a720ea57.
Assertion 1.10, printed p.4, Remarks 1.11–1.12 on p.5, and Theorem 2.2,
equations (8a)–(8b), on p.6 are the scope of this paper assessment.
This is neither a complete proof audit nor a Lean result. The identities
and elementary arithmetic facts below are reused, not claimed as new
Möbius theory or a new RH criterion.
The all-order independence statement includes a forbidden fiber
Let be uniform on , , and keep the source’s , which counts prime factors with multiplicity. Its literal (IH-A) asserts independence of squarefreeness and the events throughout the stated range . The fixed choice is included. Every integer with is prime, and every prime is squarefree. The conditional event is nonempty for every . Hence, exactly,
The unconditional squarefree probability instead tends to , as stated in the source’s (IH-C). Thus (IH-A) fails even as an asymptotic equality in that literal full range. A central-range asymptotic independence statement with a different quantified range is not refuted by this fixed-order check. It would need its own theorem and weighted error control before supplying the actual arithmetic sum.
The actual indexed sums must retain their shared sign
The source’s (8a) defines, for ,
Complete multiplicativity of and give the exact same-source identity
The displayed (8b) assigns both indexed sums the same nonzero asymptotic
For the actual sums, their two ratios to add to zero identically; they therefore cannot both tend to one. This tests (8b) as a prediction about the actual arithmetic objects. Because the source’s stated independence premises already fail, it is not a refutation of a logical implication from those inconsistent premises. Restoring the missing factor would remove this particular sign conflict; the source’s cited Walfisz bound already gives , excluding the asserted asymptotic for the actual .
The existing FIB finite-source identity, §455.6, retains the same actual odd Möbius prefix, its exact boundary and complete remaining source tail. Neither a randomized surrogate nor the literal claims tested here replace those quantities. This source does not obtain an unconditional signed estimate from the quoted hypotheses or (8b) for at the selected Robin source . The original unbounded signed target and RH remain unproved; no new Mertens bound, mathematical originality or Lean certification is claimed.
An explicit reverse interface and its shifted-numerator budget
The related Johnston–Trudgian preprint, arXiv:2511.09978v4, A round of Pintz to celebrate oscillations in sums, makes a Landau–Pintz arithmetic-to-zero interface explicit. Theorem 1, printed pp.3–4, starts with a polynomial-growth arithmetic function , its Mellin quotient , stated half-plane analyticity and growth bounds, and a simple zero of with . It gives an unsigned average lower bound. A zero-free conclusion additionally needs an upper bound for that same average; the existing GA2 comparisons have not supplied that input for the selected Robin source.
Its application uses and , equations (21)–(22), printed p.8. The two large- zero-exclusion examples on pp.11–12 assume hypothetical pointwise Mertens upper bounds. Equation (36) instead gives an average lower bound; its numerical constant is not adopted here. The source says its cited actual bound through gives only a simple-zero exclusion above real part and below height , which does not extend the already used verification through . These are source statements, not newly certified computations. Theorem 1’s simplicity condition is retained; the alternative recalled in equation (37), printed p.12, is a different published Pintz bound. It states for and , without a simplicity assumption.
There is also a precise numerator-shift obligation before using the displayed numerical error. Equation (5), printed p.4, assumes
In equation (13), printed p.5, the contour numerator is instead . Its following displayed majorant uses , omitting the height shift. Both forms occur in the official v4 TeX. For the source’s own , , , take its quoted first zero with , , and . At ,
Thus that pointwise substitution does not follow from the stated growth bound. This tests the numerator majorant, rather than refuting the complete integral estimate, Theorem 1, or the paper’s numerical examples.
A sufficient local substitute keeps the shifted factor. The same elementary inequality used for in equation (17), printed p.6, gives
For this absolute numerator estimate, the source’s can therefore be replaced by
In its Mertens example the extra factor is . This pays only the displayed shift step; the rest of the theorem and its numerical consequences are not independently certified here. The unshifted error is not adopted without another valid justification.
The original target remains the same conditional least global Robin maximizer , with , all actual zero real parts and multiplicities, the complete infinite tail and strict core. Neither this unsigned-average interface nor the local shift correction supplies its complete signed lower bound. The five-window additive FIB labels are not substituted for an arithmetic average certificate. No new source proof, general theorem, numerical zero-height improvement, Lean verification or RH proof is claimed.