Preprint
Article

This version is not peer-reviewed.

Uniform Beta Smoothing ofWidder Sums for the Riemann ξ-Function and a Schur–Triple Application to Simple Critical Zeros

Submitted:

16 September 2026

Posted:

17 September 2026

You are already at the latest version

Abstract
We study normalized integrals of the Widder expressions associated with \(F_\xi = 2G'/G\), where \(G(x) = \xi(1/2 + \sqrt{x})\). Their zero weights are regularized incomplete beta kernels. The principal result is a two-term zero-count asymptotic with error \(O_L(\log x)\), uniform for all integers \(1 \le m \le Lx\) and each fixed \(L > 0\). The proof includes a uniform control of the error made when complex reflected zeros are replaced by their ordinates. Using the Guinand--Weil explicit formula in a fixed Fourier normalization, we also obtain a derivative asymptotic whose prime-side order dependence is essentially \(\exp(m/(4x))\). A sharp saddle estimate for the shifted beta kernel yields pointwise Widder positivity, for every fixed \(\varepsilon > 0\), through the range \(m \le (4-\varepsilon)x\log\log x\) for all sufficiently large \(x\). The integrated sums recover \(N(\sqrt{x})\) to \(O_{a,L}(\log x)\) for \(a\sqrt{x} \le m \le Lx\), and every cumulative lower density of simple critical-line zeros transfers to the corresponding smoothed sums. As logically downstream fixed-height consequences, we prove that an off-critical zero forces infinitely many negative high Widder orders at one point, derive a prime-power root-growth criterion, and obtain two order generating functions. One of these has an explicit meromorphic continuation expressed through two values of \(-\zeta'/\zeta\) on the right semicircle \(|s-1/2| = T\); all branch and continuation conventions are stated explicitly. As a separate application of the same beta family, a compactifying change of variables produces positive polynomial windows on \([-1/2, 1/2]\). Combining an explicit three-beta window with the analytic finite-compression framework of Alpöge–Furman and a self-contained Schur–Horn/rank–trace remainder yields the computer-assisted, method-specific lower bound \[ \liminf_{T\to\infty} \frac{N_0^s(T,2T)}{N(T,2T)} \ge 0.672625773769468\ldots . \] This value is presented only as the output of the three-point beta-window construction developed here, not as a claim to the strongest currently circulating numerical bound. Two algorithmically independent interval-certificate implementations, archived outputs, and a reproducibility manifest are included in the source package. Finally, independently of the asymptotic smoothing theorem, we combine the finite Stieltjes framework of Bondesson–Simon with verified zero information and explicit zero-free regions to obtain a finite global range of Widder positivity. None of the partial positivity results proves the Riemann hypothesis.
Keywords: 
;  ;  ;  ;  

1. Introduction

Let G be the entire function determined by G ( y 2 ) = ξ ( 1 / 2 + y ) , and put F ξ = 2 G ′ / G . For m ≥ 1 define
W m [ F ] ( x ) = ( − 1 ) m − 1 ( x m F ( x ) ) ( 2 m − 1 ) , A m ( x ) = ∫ 0 x u m − 1 W m [ F ξ ] ( u ) d u 2 ( 2 m − 1 ) ! B ( m , m ) .
The pointwise Widder expressions have zero weights concentrated around ordinate x . Their normalized integrals instead have decreasing beta weights and can therefore be compared with cumulative zero counts.
Our main result, Theorem 1, is the uniform formula
A m ( x ) = c m x 2 π log x 2 π − 1 + 1 2 m − 1 + O L ( log x ) , 1 ≤ m ≤ L x ,
where c m = Γ ( m − 1 / 2 ) Γ ( m + 1 / 2 ) / Γ ( m ) 2 . The main term follows by integrating the Riemann–von Mangoldt formula against the real beta kernel. The genuinely uniform step is the replacement of each complex reflected zero by its ordinate: the vertical displacement is only O ( x − 1 / 2 ) , but the derivative of the beta kernel may have size O ( m ) when m grows with x. Lemma 3 proves that the total replacement error is nevertheless only O L ( log x ) . Corollary A5 then gives a direct approximation to the ordinary zero count. Proposition 1 isolates the elementary positive-kernel argument used to transfer cumulative density bounds.

1.0.0.1. Contribution and scope.

The core contribution is the uniform beta-smoothed zero-count asymptotic in the full range m ≤ L x , its explicit-formula derivative refinement, and the resulting count-recovery and density-transfer statements. The derivative theorem is proved from a fully stated Guinand–Weil formula with the Fourier normalization used in this paper. A sharp shifted-kernel saddle estimate gives pointwise Widder positivity, for each fixed ε > 0 , uniformly through m ≤ ( 4 − ε ) x log log x for all sufficiently large x; in particular it covers every fixed linear range m ≤ L x . These results are contained in Section 3 and do not depend on the later RH-equivalent reformulations.
Section 4 gives a separate quantitative application. The logarithmic beta densities compactify to polynomial probability windows on [ − 1 / 2 , 1 / 2 ] . An explicit three-beta mixture is inserted into the general window framework of Alpöge–Furman [11]. Motivated by the Schur–Jensen observation of Shi [12], we reprove the needed spectral rank–trace inequality and strengthened zero-side seam in our own notation, track all fixed-bandwidth mixed, tail, trace, and boundary errors, and then apply the resulting Schur remainder on disjoint triples. Together with two independent interval-arithmetic certificates, this gives
lim inf T → ∞ N 0 s ( T , 2 T ) N ( T , 2 T ) ≥ 0.672625773769468 … .
This improves the Montgomery–Taylor/Lamzouri baseline inside the present three-point beta-window argument. It is a method-specific statement, not a numerical-record claim: recent non-peer-reviewed multi-point preprints report larger constants, and none of those claims is used in our proof.
Appendix A records complementary fixed-height consequences. There a nonreal reflected zero is shown to force infinitely many negative high orders at one fixed point. The same mechanism yields a prime-side root-growth criterion, two order-generating functions, and a semicircular logarithmic-derivative formula. These are downstream deductions from the beta–Widder hierarchy and are separated from the main smoothing theorem so that their logical status is explicit. In particular, the continuation formulas are stated only on domains on which the square-root branches are fixed and the compositions with − ζ ′ / ζ are meromorphic. The verified RH height then gives an unconditional fixed-height transfer for a large range of T.
The finite-height Stieltjes calculation in Appendix B is a separate application of known finite Stieltjes theory, a published rigorous zero verification, and an explicit zero-free region. It is included because it gives a concrete global finite-order consequence, but it is not presented as the source of the paper’s main novelty.
The integrated smoothing theorem uses the critical strip, the genus-zero product, and the classical zero-count remainder. The stronger pointwise derivative estimate additionally uses the Guinand–Weil explicit formula. It does not require a lower bound on the number of critical-line zeros. Such a bound enters only the density applications. Lamzouri [13] gives the Montgomery–Taylor value 3 / 2 − 2 − 1 / 2 cot ( 2 − 1 / 2 ) , while Section 4 derives a slightly larger value from the Alpöge–Furman finite compression combined with a beta-window triple Schur remainder. The literature comparison in this manuscript is frozen at 15 September 2026. In particular, Wang [14] has since developed a short-interval extension of the Lamzouri approach; that work does not enter any proof here and addresses a different interval-length question.
For context, Bondesson–Simon ([1], Definition 1, Theorem 1 and Section 4.1) establish the finite Stieltjes classes, their integral representations, and the quadratic angular threshold used below. Our finite-height application combines these ingredients with the zero verification of Platt–Trudgian [5] and, for the fully published numerical theorem, the zero-free region of Mossinghoff–Trudgian–Yang [3]. The stronger Bellotti–Trudgian–Yang preprint region [2] is used only for the separately labelled enhancement. The contribution here is the height-to-order conversion. The quadratic examples and finite Stieltjes representation are recalled consequences of the existing theory, not separate originality claims.
Section 2 establishes the zero-sum identities. Section 3 contains the uniform smoothing theorem, the exact explicit-formula normalization, and its density consequences. Section 4 develops the compactified beta window and the Schur–triple simple-zero application. Appendix A collects the fixed-height and high-order generating-function consequences. Appendix B treats finite-height positivity. Appendix C explains the relation with existing criteria. The appendices are intentionally separated from the four-section core so that the principal analytic theorem and the simple-zero application can be read and refereed without relying on any of the later RH-equivalent reformulations or finite-height applications. A reader concerned only with the two main theorem chains may therefore stop after Section 4; no result in the appendices is used retroactively in the core. The precise analytic contribution investigated here is the uniform beta-smoothed zero-count statement and its explicit-formula derivative refinement. The sparse RH criterion recorded in Appendix C is an elementary consequence of Widder’s classical criterion and a downward recurrence for the normalized sums. More generally, analytic-continuation, logarithmic-derivative, and prime-side reformulations of RH are classical in broad form; the later sections claim only the explicit formulas and deductions arising from the particular beta–Widder hierarchy developed here. Recent work of Polson [7,8] develops related Thorin/GGC, Stieltjes, zero-measure, reciprocal- ξ , and explicit-formula viewpoints for the Riemann ξ -function. In particular, the public abstract of [8] formulates RH through positivity of a Thorin measure attached to a reciprocal- ξ transform and also discusses finite truncations of derivative-type positivity conditions. We do not use those results, and we do not identify those derivative conditions with the Widder orders studied here without a separate term-by-term comparison. The novelty claims of the present paper are therefore deliberately restricted to the specific beta-regularized sums A m , their joint uniform asymptotics in ( m , x ) , the sharp shifted-kernel factor M σ , and the resulting ( 4 − ε ) x log log x positivity wedge. The separate Section 4 additionally claims the explicit compactified beta-window construction and its three-point Schur bootstrap, with its computer-assisted finite inequality stated transparently. No broad priority claim is made for Stieltjes/GGC formulations, reciprocal- ξ positivity, prime–zero explicit-formula dictionaries, or RH-equivalent reformulations.

1.0.0.2. Logical dependency map.

To reduce the verification burden, the proof architecture is summarized here. The first three rows form the four-section core together with the Introduction; the last row is logically downstream.
Part Principal output External input actually used
Section 2 Exact zero-sum/Widder identities Classical properties and genus-zero product of ξ ; no finite-compression input.
Section 3 Uniform beta smoothing, count recovery, density transfer, and the pointwise positivity wedge Riemann–von Mangoldt and, only for the derivative refinement, the explicitly normalized Guinand–Weil formula.
Section 4 The beta-window Schur–triple simple-zero bound Version-locked analytic estimates from Alpöge–Furman v2. The strengthened Schur seam and triple inequality are proved here; the latter has two independent interval certificates.
Appendices Appendix A–Appendix C Fixed-height, high-order, generating-function, and comparison consequences Not used to prove either the smoothing theorem or the beta–Schur theorem.

2. Zero Sums and Widder Expressions

We use the standard completed zeta function
ξ ( s ) = 1 2 s ( s − 1 ) π − s / 2 Γ s 2 ζ ( s ) ,
which is entire and satisfies
ξ ( s ) = ξ ( 1 − s ) , ξ ( s ) ¯ = ξ ( s ¯ ) .
Put
H ( y ) = ξ 1 2 + y .
Then H is even. Consequently there is an entire function G such that
H ( y ) = G ( y 2 ) , G ( x ) = ξ 1 2 + x .
Since H has order one, G has order 1 / 2 . In particular G has a genus-zero canonical product.
Define, for x > 0 ,
F ξ ( x ) : = 2 G ′ ( x ) G ( x ) = 1 x ξ ′ ξ 1 2 + x .
The function F ξ is positive on ( 0 , ∞ ) . For completeness, we record an explicit form of the classical Riemann kernel. Put
Φ ( u ) = ∑ n = 1 ∞ 4 π 2 n 4 e 9 u / 2 − 6 π n 2 e 5 u / 2 e − π n 2 e 2 u , u ≥ 0 .
Then the standard Fourier representation of the Riemann Ξ -function gives, after the substitution t = − i y ,
H ( y ) = ξ 1 2 + y = 2 ∫ 0 ∞ Φ ( u ) cosh ( y u ) d u , y ∈ R ,
see Titchmarsh ([17], Ch. II). Every summand in (3) is strictly positive for u ≥ 0 , since
4 π 2 n 4 e 9 u / 2 − 6 π n 2 e 5 u / 2 = 2 π n 2 e 5 u / 2 2 π n 2 e 2 u − 3 > 0 .
The series and all differentiated integrands have the standard rapid decay needed for local uniform convergence. Hence differentiation under the integral gives
H ′ ( y ) = 2 ∫ 0 ∞ u Φ ( u ) sinh ( y u ) d u > 0 ( y > 0 ) ,
while H ( y ) > 0 for y ≥ 0 . Since
F ξ ( x ) = H ′ ( x ) x H ( x ) ,
we obtain F ξ ( x ) > 0 for every x > 0 .
Let Z + denote the multiset of nontrivial zeros ρ = β + i γ with γ > 0 , counted with multiplicity. The functional equation pairs the zero ρ with 1 − ρ in the lower half-plane, so the zeros of the genus-zero function G in (1) are precisely
z ρ = ( ρ − 1 / 2 ) 2 , ρ ∈ Z + .
It is convenient to reflect them:
w ρ : = − z ρ = − ( ρ − 1 / 2 ) 2 .
Writing
δ = β − 1 2 ,
we obtain the exact identity
w ρ = − ( δ + i γ ) 2 = ( γ − i δ ) 2 .
Thus
| arg w ρ | = 2 arctan | δ | γ .
For a critical-line zero, δ = 0 and w ρ = γ 2 > 0 .
Since the number of zeta zeros up to height T is O ( T log T ) ,
∑ ρ ∈ Z + 1 | w ρ | < ∞ .
Therefore
G ( x ) = G ( 0 ) ∏ ρ ∈ Z + 1 + x w ρ
and
F ξ ( x ) = 2 ∑ ρ ∈ Z + 1 x + w ρ .
For an off-line zero ρ = 1 / 2 + δ + i γ , the symmetry 1 − ρ ¯ is also an upper-half-plane zero and gives w 1 − ρ ¯ = w ρ ¯ . Hence the nonreal terms in (9) occur in conjugate pairs, as used in the sector argument below.
For m ≥ 1 , define
W m [ F ] ( x ) : = ( − 1 ) m − 1 d 2 m − 1 d x 2 m − 1 x m F ( x ) .
Lemma 1 
(Elementary derivative identity). For m ≥ 1 , w ≠ 0 , and x ≠ − w ,
( − 1 ) m − 1 d 2 m − 1 d x 2 m − 1 x m x + w = ( 2 m − 1 ) ! w m ( x + w ) 2 m .
Proof. 
Divide x m by x + w . The quotient has degree m − 1 , hence its ( 2 m − 1 ) st derivative vanishes. The remainder is ( − w ) m / ( x + w ) . Differentiating the latter 2 m − 1 times gives (11).    □
For a genus-zero product G ( x ) = G ( 0 ) ∏ j ( 1 + x / w j ) with ∑ j | w j | − 1 < ∞ , put F = 2 G ′ / G . It follows that
W m [ F ] ( x ) = 2 ( 2 m − 1 ) ! ∑ j w j m ( x + w j ) 2 m .
For later use we record the convergence explicitly. Fix a compact interval I ⋐ ( 0 , ∞ ) . Under the sector bound | arg w j | ≤ ϑ < π / 2 there is a constant c I > 0 such that | x + w j | ≥ c I ( 1 + | w j | ) for x ∈ I . Hence
w j m ( x + w j ) 2 m ≤ C I , m min { 1 , | w j | − m } .
Only finitely many w j lie in a bounded set, while ∑ j | w j | − 1 < ∞ ; consequently the series in (12) converges absolutely and locally uniformly, for every m ≥ 1 . The same estimates, applied before differentiation to finitely many derivative orders, justify term-by-term differentiation of the logarithmic-derivative series.

3. Uniform Beta Smoothing and Density Transfer

A sector argument for pointwise Widder positivity uses a bound on every reflected zero. A cumulative lower density of critical-line zeros is a different input: it does not directly control the weight
t 2 m ( x + t 2 ) 2 m ,
which increases up to t = x and then decreases. We introduce an integrated Widder expression whose zero weight is decreasing. This permits a rigorous transfer of cumulative density information. The uniformity in the order is recorded explicitly.
For m ≥ 1 put B m = B ( m , m ) = Γ ( m ) 2 / Γ ( 2 m ) and define
A m ( x ) = 1 2 ( 2 m − 1 ) ! B m ∫ 0 x u m − 1 W m [ F ξ ] ( u ) d u .
The expression at zero is understood by analytic continuation of F ξ to a neighborhood of zero. Introduce the rational function
P m ( x , w ) = ∑ j = m 2 m − 1 2 m − 1 j x j w 2 m − 1 − j ( x + w ) 2 m − 1 .
For positive real w, this is the regularized incomplete beta function I x / ( x + w ) ( m , m ) . Formula (14), rather than a choice of branch for the incomplete beta function, defines its complex extension here. Differentiating gives
∂ x P m ( x , w ) = x m − 1 w m B m ( x + w ) 2 m , P m ( 0 , w ) = 0 .
Consequently, by (12) and local uniform convergence,
A m ( x ) = ∑ ρ ∈ Z + P m ( x , w ρ ) .
Indeed, for fixed m and bounded x, the summands are O m ( | w ρ | − m ) . The sum is real by conjugation symmetry. In particular,
A 1 ( x ) = x F ξ ( x ) 2 , P 2 ( x , w ) = x 2 ( x + 3 w ) ( x + w ) 3 .
Let N 0 s ( t ) count simple critical-line zeros with positive ordinate at most t. Define the positive simple-zero contribution
S m ( x ) = ∑ ρ ∈ Z + β = 1 / 2 ρ simple P m ( x , γ 2 ) .
Here and below a simple zero is counted once, whereas N ( t ) and unrestricted zero sums count multiplicities.
Theorem 1 
(Uniform smoothed asymptotic and density transfer). Set
c m = Γ ( m − 1 / 2 ) Γ ( m + 1 / 2 ) Γ ( m ) 2 .
For every fixed L > 0 , as x → ∞ , uniformly over integers 1 ≤ m ≤ L x ,
A m ( x ) = c m x 2 π log x 2 π − 1 + 1 2 m − 1 + O L ( log x ) .
In particular A m ( x ) > 0 throughout this range once x is sufficiently large (depending on L).
Suppose, for some p ∈ [ 0 , 1 ] , that
lim inf t → ∞ N 0 s ( t ) N ( t ) ≥ p .
Then
lim inf x → ∞ inf m ∈ N 1 ≤ m ≤ L x S m ( x ) A m ( x ) ≥ p for every fixed L > 0 .
We give details of the uniform estimates; a fixed-order asymptotic by itself would not establish this theorem. The homogeneity of (14) will be used repeatedly: for T > 0 ,
P m ( T 2 , ( γ − i δ ) 2 ) = P m 1 , γ − i δ T 2 = k m γ − i δ T ,
where on the right k m denotes the rational continuation defined by P m ( 1 , z 2 ) .
Lemma 2 
(Uniform real-kernel estimates). Put
k m ( y ) = P m ( 1 , y 2 ) = I 1 / ( 1 + y 2 ) ( m , m ) , y ≥ 0 .
Then k m ( 0 ) = 1 , k m ( ∞ ) = 0 , and
h m ( y ) : = − k m ′ ( y ) = 2 y 2 m − 1 B m ( 1 + y 2 ) 2 m > 0 ( y > 0 ) .
Uniformly in m ≥ 1 ,
∫ 0 ∞ h m ( y ) d y = 1 , sup y ≥ 0 h m ( y ) ≪ m , ∫ 0 ∞ h m ( y ) log ( 2 + y ) d y ≪ 1 ,
and h m ( y ) ≪ y − 3 for y ≥ 2 . Moreover,
∫ 0 ∞ k m ( y ) d y = c m ,
∫ 0 ∞ k m ( y ) log y d y = c m − 1 + 1 2 m − 1 .
One has 1 ≤ c m ≤ π / 2 and c m = 1 + O ( m − 1 ) .
Proof. 
The derivative follows either from the incomplete beta integral or directly from (14). The beta integral and Stirling’s formula give B m − 1 ≪ 4 m m . The function h m increases to its unique maximum at y 2 = ( 2 m − 1 ) / ( 2 m + 1 ) and decreases thereafter. At that maximum y ≥ 1 / 3 and 4 y 2 / ( 1 + y 2 ) 2 ≤ 1 , which proves the supremum estimate. For y ≥ 2 , set r ( y ) = 4 y 2 / ( 1 + y 2 ) 2 ≤ 16 / 25 . Then
h m ( y ) ≪ m r ( y ) m y ≪ r ( y ) y ≪ y − 3 .
The asserted logarithmic moment of h m follows from this tail bound and its total mass one.
For a in a neighborhood of zero, Tonelli’s theorem applied to the beta integral gives
∫ 0 ∞ y a k m ( y ) d y = B ( m − ( a + 1 ) / 2 , m + ( a + 1 ) / 2 ) ( a + 1 ) B m .
Evaluation and differentiation at a = 0 prove (22), using ψ ( m + 1 / 2 ) − ψ ( m − 1 / 2 ) = 1 / ( m − 1 / 2 ) . Finally c 1 = π / 2 , c m + 1 / c m = 1 − 1 / ( 4 m 2 ) , and c m → 1 by Stirling’s formula. The same recurrence gives
0 ≤ log c m = − ∑ j = m ∞ log 1 − 1 4 j 2 ≪ ∑ j = m ∞ j − 2 ≪ m − 1 ,
which also proves c m = 1 + O ( m − 1 ) .    □
Lemma 3 
(Replacing reflected zeros by their ordinates). For T → ∞ and each fixed L > 0 ,
∑ ρ ∈ Z + P m ( T 2 , ( γ − i δ ) 2 ) − k m ( γ / T ) ≪ L log T ( 1 ≤ m ≤ L T 2 ) .
Proof. 
By (20), the summand is the change of the rational function k m along the vertical segment joining y = γ / T to y − i δ / T . Since | δ | ≤ 1 / 2 , every such segment has length at most 1 / ( 2 T ) . The only poles of the rational continuation of k m are at ± i , and differentiation of (14) gives
k m ′ ( z ) = − 2 z 2 m − 1 B m ( 1 + z 2 ) 2 m .
We first treat y ≥ 1 / 2 . Put z = y − i ϵ , with | ϵ | ≤ 1 / ( 2 T ) . From (25) and (21),
| k m ′ ( z ) | h m ( y ) = | z | y 2 m − 1 1 + y 2 | 1 + z 2 | 2 m .
Now
| z | y = 1 + ϵ 2 y 2 1 / 2 ≤ exp ϵ 2 2 y 2 ,
while, for T ≥ 4 ,
| 1 + z 2 | ≥ ℜ ( 1 + z 2 ) = 1 + y 2 − ϵ 2 > 0 .
Hence
1 + y 2 | 1 + z 2 | ≤ 1 − ϵ 2 1 + y 2 − 1 .
Since y ≥ 1 / 2 and | ϵ | ≤ 1 / 8 , the quantity u = ϵ 2 / ( 1 + y 2 ) satisfies 0 ≤ u ≤ 1 / 80 ; thus − log ( 1 − u ) ≤ ( 80 / 79 ) u . Substituting these two estimates into (26) yields, with room to spare,
| k m ′ ( y − i ϵ ) | ≤ e 8 m ϵ 2 h m ( y ) ≤ e 2 L h m ( y ) , y ≥ 1 2 ,
for 1 ≤ m ≤ L T 2 .
It remains to control the low-y rectangle. If 0 ≤ y < 1 / 2 and | ϵ | ≤ 1 / 8 , a direct calculation gives
r ( z ) : = 4 | z | 2 | 1 + z 2 | 2 ≤ 4352 6241 < 3 4 .
The point that is useful near z = 0 is to factor one power of z before using the beta normalization. From (25),
| k m ′ ( z ) | = 2 | z | B m | 1 + z 2 | 2 | z | 2 | 1 + z 2 | 2 m − 1 ≪ m | z | | 1 + z 2 | 2 r ( z ) m − 1 .
Here we used B m − 1 ≪ 4 m m , absorbing the remaining fixed factor 4. On the closed rectangle 0 ≤ y ≤ 1 / 2 , | ϵ | ≤ 1 / 8 , the factor | z | / | 1 + z 2 | 2 is uniformly bounded. Therefore
| k m ′ ( y − i ϵ ) | ≪ m ( 3 / 4 ) m − 1 ≪ 1 , 0 ≤ y < 1 2 .
This explicit factorization avoids any spurious singular factor 1 / | z | at z = 0 .
Integrating along the vertical segments and splitting at γ = T / 2 now bounds the left side of (24) by
C T N ( T / 2 ) + C L T ∑ γ ≥ T / 2 h m ( γ / T ) .
Write the classical Riemann–von Mangoldt formula as
N ( t ) = M ( t ) + E ( t ) , M ( t ) = t 2 π log t 2 π − t 2 π , E ( t ) = O ( log ( t + 2 ) ) .
Here M ( 0 ) = 0 by continuity; the bound for E extends to all t ≥ 0 by adjusting the constant (see [17], Ch. IX). Let a = T / 2 . For the sum over ordinates γ > a , Stieltjes integration gives
∑ γ > a h m ( γ / T ) = ∫ ( a , ∞ ) h m ( t / T ) d M ( t ) + ∫ ( a , ∞ ) h m ( t / T ) d E ( t ) .
Since M ′ ( t ) = ( 2 π ) − 1 log ( t / ( 2 π ) ) for t > 0 ,
∫ a ∞ h m ( t / T ) d M ( t ) ≪ T ∫ 1 / 2 ∞ h m ( y ) log T + log ( 2 + y ) d y ≪ T log T .
Integration by parts against d E bounds the second contribution by
C h m ( 1 / 2 ) log ( T + 2 ) + C ∫ 1 / 2 ∞ | h m ′ ( y ) | log ( T y + 2 ) d y .
The boundary term at infinity vanishes because h m ( y ) ≪ y − 3 there. On [ 1 / 2 , 2 ] , unimodality gives
∫ 1 / 2 2 | h m ′ ( y ) | d y ≤ 2 sup h m ≪ m .
On [ 2 , ∞ ) , h m is decreasing, and another integration by parts gives
∫ 2 ∞ | h m ′ ( y ) | log ( T y + 2 ) d y = h m ( 2 ) log ( 2 T + 2 ) + ∫ 2 ∞ T h m ( y ) T y + 2 d y ≪ log T + ∫ 2 ∞ y − 4 d y ≪ log T .
Thus (31) is O ( m log T ) . If a itself is a zero ordinate, its multiplicity is O ( log ( T + 2 ) ) , obtained by comparing (30) at a − 1 and a + 1 . Restoring that possible boundary atom therefore costs at most O ( m log T ) . We have proved
∑ γ ≥ T / 2 h m ( γ / T ) ≪ ( T + m ) log T .
Substituting this into (29), using N ( T / 2 ) ≪ T log T and m / T ≤ L , proves (24).    □
Proposition 1 
(Transfer by a decreasing kernel). Let N and Q be nonnegative, nondecreasing counting functions on [ 0 , ∞ ) with N ( 0 ) = Q ( 0 ) = 0 . Suppose
Q ( t ) ≥ q N ( t ) − C ( t ≥ 0 )
for constants q , C ≥ 0 . Let k be an absolutely continuous decreasing function with k ( 0 ) = 1 , k ( ∞ ) = 0 , and h = − k ′ ≥ 0 . For any T > 0 for which the integrals below are finite and the boundary products vanish,
∫ 0 ∞ k ( t / T ) d Q ( t ) ≥ q ∫ 0 ∞ k ( t / T ) d N ( t ) − C .
Proof. 
Integration by parts writes the two integrals as ∫ 0 ∞ Q ( T y ) h ( y ) d y and ∫ 0 ∞ N ( T y ) h ( y ) d y . Integrate the assumed inequality and use ∫ 0 ∞ h ( y ) d y = 1 .    □
Proof 
(Proof of Theorem 1). Write
R m ( T ) = ∑ ρ ∈ Z + k m ( γ / T ) .
Partial summation in (30) gives
R m ( T ) = T 2 π ∫ 0 ∞ k m ( y ) log T y 2 π d y + O ( log T ) ,
uniformly in all m ≥ 1 . More explicitly, R m ( T ) = ∫ 0 ∞ k m ( t / T ) d N ( t ) ; the d M part becomes the displayed integral after t = T y , while integration by parts in the d E part gives an error bounded by a constant multiple of
∫ 0 ∞ h m ( y ) log ( T y + 2 ) d y = O ( log T )
by Lemma 2. The boundary terms vanish: at zero one uses M ( 0 ) = E ( 0 ) = N ( 0 ) = 0 , and at infinity k m ( t / T ) = O m ( t − 2 m ) for each fixed m occurring in the Stieltjes integral. The resulting error bound is uniform because only the normalized mass and logarithmic moment of h m enter the estimate. Lemma 2 evaluates the integral, while Lemma 3 gives
A m ( T 2 ) = R m ( T ) + O L ( log T ) ( 1 ≤ m ≤ L T 2 ) .
This proves (17). Since 1 ≤ c m ≤ π / 2 , the main term is bounded below by a positive constant times T log T for sufficiently large T, uniformly in this range.
For the density assertion, first take p > 0 and fix 0 < ε < p . Assumption (18) implies
N 0 s ( t ) ≥ ( p − ε ) N ( t ) − C ε ( t ≥ 0 )
for some finite C ε . Proposition 1, with q = p − ε , gives
S m ( T 2 ) = ∫ 0 ∞ N 0 s ( T y ) h m ( y ) d y ≥ ( p − ε ) R m ( T ) − C ε .
Combine this with (33) and the uniform lower bound A m ( T 2 ) ≫ T log T . Let T → ∞ and then ε ↓ 0 . If p = 0 , the conclusion follows directly from S m ≥ 0 and eventual positivity of A m .    □
Proposition 2 
(Guinand–Weil formula in our Fourier convention). Let h be even and holomorphic in a strip | ℑ z | ≤ 1 / 2 + ε for some ε > 0 , and suppose that, uniformly in that strip,
| h ( z ) | ≪ ( 1 + | z | ) − 1 − η
for some η > 0 . Define
g ( u ) : = 1 2 π ∫ − ∞ ∞ h ( r ) e − i u r d r .
Then, with the nontrivial zeros of ζ counted with multiplicity and written as ρ = 1 / 2 + i Γ ρ (where Γ ρ need not be real),
∑ ρ h ( Γ ρ ) = 2 h ( i / 2 ) + 1 2 π ∫ − ∞ ∞ h ( r ) ℜ Γ ′ Γ 1 4 + i r 2 − log π d r − 2 ∑ n = 2 ∞ Λ ( n ) n g ( log n ) .
This is the Guinand–Weil explicit formula with the e − i u r / ( 2 π ) Fourier normalization. In the more common convention h ^ ( ξ ) = ∫ h ( r ) e − 2 π i r ξ d r , one has h ^ ( ξ ) = 2 π g ( 2 π ξ ) . Formula (35) is therefore exactly the standard formula; see Conrey ([16], pp. 345–346) and, with the hypotheses stated in this form, Chirre–Gonçalves ([9],Proposition 5). No assumption of RH is involved.
Lemma 4 
(Admissibility of the beta test functions). Fix T ≥ 2 and m ≥ 1 , and set
h m , T ( r ) = p m ( r / T ) , p m ( z ) = z 2 m B m ( 1 + z 2 ) 2 m .
Then h m , T is even, real-valued on R , holomorphic in the closed strip | ℑ r | ≤ 3 / 4 , and satisfies the strip-uniform bound
sup | v | ≤ 3 / 4 | h m , T ( u + i v ) | ≤ C m , T ( 1 + | u | ) − 2 m ( u ∈ R ) .
In particular h m , T satisfies the hypotheses of Proposition 2 (take ε = 1 / 4 ), its Fourier transform is absolutely convergent, and the vertical sides of the rectangular contours used to shift a Fourier line inside this strip tend to zero. For these test functions the zero sum in (35) is absolutely convergent as well.
Proof. 
The only poles of h m , T are at r = ± i T , each of order 2 m , and hence lie outside | ℑ r | ≤ 3 / 4 . Evenness and reality on the real axis are immediate. Write r = u + i v . If | u | ≥ 2 T , then
| 1 + ( r / T ) 2 | = | r − i T | | r + i T | T 2 ≥ u 2 T 2 ,
whereas | r | ≤ ( 1 + 9 / ( 64 T 2 ) ) 1 / 2 | u | ≪ | u | uniformly for | v | ≤ 3 / 4 . Consequently
| h m , T ( u + i v ) | ≤ 1 B m C T | u | 2 m ( | u | ≥ 2 T , | v | ≤ 3 / 4 ) .
On the compact rectangle | u | ≤ 2 T , | v | ≤ 3 / 4 , the denominator is bounded away from zero, so enlarging the constant proves (36). This is stronger than the strip decay required in Proposition 2.
Finally, a nontrivial zero has | ℑ Γ ρ | = | β − 1 / 2 | < 1 / 2 and the classical zero count is N ( R ) = O ( R log R ) . The bound (36) therefore gives absolute convergence of the zero sum already for m = 1 .    □
Lemma 5 
(Sharp shifted L 1 bound for the beta kernel). Let
p m ( z ) = z 2 m B m ( 1 + z 2 ) 2 m , m ≥ 2 .
There is an absolute constant C > 0 such that, uniformly for 0 ≤ σ ≤ 1 / 8 and m ≥ 2 ,
∫ − ∞ ∞ | p m ( y − i σ ) | d y ≤ C M σ m , M σ : = 2 1 + 1 − 4 σ 2 .
Moreover,
log M σ = σ 2 + 3 2 σ 4 + O ( σ 6 ) ( σ → 0 ) ,
and in particular
log M σ ≤ σ 2 + C σ 4 ( 0 ≤ σ ≤ 1 / 8 ) .
Proof. 
Put q = σ 2 and
R σ ( y ) : = 4 ( y 2 + q ) ( 1 + y 2 − q ) 2 + 4 q y 2 .
Then
| p m ( y − i σ ) | = R σ ( y ) m 4 m B m .
Set
r σ : = 1 − 4 q , u : = y 2 + q , y σ 2 : = r σ − q .
Since
( 1 + y 2 − q ) 2 + 4 q y 2 = ( 1 + u ) 2 − 4 q = u 2 + 2 u + r σ 2 ,
differentiation in u shows that the maximum occurs at u = r σ , i.e. at y = ± y σ , and
max y ∈ R R σ ( y ) = M σ = 2 1 + r σ .
More importantly, the same algebra gives the exact identity
R σ ( y ) M σ = 1 + ( u − r σ ) 2 2 u ( 1 + r σ ) − 1 .
This turns the uniform Laplace estimate into a quantitative calculation.
We give the details. Because 0 ≤ q ≤ 1 / 64 , r σ ≥ 15 / 4 and y σ 2 ≥ 15 / 4 − 1 / 64 > ( 15 / 16 ) 2 . For 1 / 2 ≤ y ≤ 3 / 2 , let
X σ ( y ) : = ( u − r σ ) 2 2 u ( 1 + r σ ) .
Using u − r σ = y 2 − y σ 2 , 1 / 4 ≤ u ≤ 145 / 64 , and y σ > 15 / 16 , we obtain
X σ ( y ) ≥ ( y − y σ ) 2 ( y + y σ ) 2 145 / 16 ≥ 1 5 ( y − y σ ) 2 .
On the same interval, | u − r σ | < 4 / 3 and 2 u ( 1 + r σ ) > 31 / 32 , so X σ ( y ) < 2 . Hence log ( 1 + X ) ≥ X / ( 1 + X ) ≥ X / 3 gives
R σ ( y ) M σ m ≤ exp − m 15 ( y − y σ ) 2 , 1 2 ≤ y ≤ 3 2 .
Therefore the contribution of this interval is at most 15 π / m .
The complementary regions have a uniform geometric gap. If 0 ≤ y ≤ 1 / 2 , then u ≤ 17 / 64 while r σ ≥ 15 / 16 , and (41) gives
R σ ( y ) M σ ≤ 5 7 .
If 3 / 2 ≤ y ≤ 3 , then u ≥ 9 / 4 and
X σ ( y ) ≥ ( u − 1 ) 2 4 u ≥ 25 144 , R σ ( y ) M σ ≤ 144 169 < 6 7 .
Finally, for y ≥ 3 we have M σ ≥ 1 and
R σ ( y ) M σ ≤ R σ ( y ) = 4 u u 2 + 2 u + r σ 2 ≤ 4 u ≤ 4 y 2 .
Using evenness, these estimates imply
∫ − ∞ ∞ R σ ( y ) M σ m d y ≤ 2 15 π m + 5 7 m + 3 6 7 m + 6 2 m − 1 4 9 m ≪ m − 1 / 2 ,
uniformly for 0 ≤ σ ≤ 1 / 8 and m ≥ 2 . Equivalently,
∫ − ∞ ∞ R σ ( y ) m d y ≪ M σ m m .
The beta normalization is equally explicit:
1 4 m B m = m 2 2 m m 4 m ≪ m
by the Wallis bound for the central binomial coefficient. Combining this with (40) and (44) proves (37). Thus the m − 1 / 2 saddle width exactly cancels the m beta normalization; no hidden power of m remains.
The expansion (38) follows by Taylor expansion of 2 / ( 1 + 1 − 4 σ 2 ) . Since [ log M σ − σ 2 ] / σ 4 extends continuously to 3 / 2 at σ = 0 , it is bounded on [ 0 , 1 / 8 ] , proving (39) with an absolute constant.    □
Theorem 2 
(Explicit-formula derivative asymptotic with refined order dependence). There is an absolute constant C > 0 such that, as T → ∞ , uniformly for every integer m ≥ 2 , with
λ : = m T 2 ,
one has
A m ′ ( T 2 ) = c m 4 π T log T 2 π + 1 2 m − 1 + O ( 1 + λ ) exp λ / 4 + C λ / T 2 T .
Consequently, for every fixed ε ∈ ( 0 , 4 ) ,
A m ′ ( T 2 ) > 0 2 ≤ m ≤ ( 4 − ε ) T 2 log log T
for all sufficiently large T, uniformly throughout the displayed range. Equivalently, for every fixed ε ∈ ( 0 , 4 ) ,
W m [ F ξ ] ( x ) > 0 2 ≤ m ≤ ( 4 − ε ) x log log x
for all sufficiently large x.
Proof. 
Since the statement is asymptotic as T → ∞ , we may assume T ≥ 6 throughout the proof. For m ≥ 2 put
h m , T ( r ) = p m ( r / T ) , p m ( z ) = z 2 m B m ( 1 + z 2 ) 2 m .
Differentiating (15) term by term gives, for every fixed m,
T 2 A m ′ ( T 2 ) = ∑ ρ ∈ Z + p m γ − i ( β − 1 / 2 ) T .
For later use, the beta integral gives
∫ 0 ∞ p m ( y ) d y = c m 2 ,
∫ 0 ∞ p m ( y ) log y d y = c m 2 ( 2 m − 1 ) .
Indeed, for a near zero,
∫ 0 ∞ y a p m ( y ) d y = B ( m + ( a + 1 ) / 2 , m − ( a + 1 ) / 2 ) 2 B m .
By Lemma 4, the test function h m , T is admissible for the Guinand–Weil explicit formula. Write a nontrivial zero as ρ = 1 / 2 + i Γ ρ , where
Γ ρ = γ − i ( β − 1 / 2 ) .
If
g m , T ( u ) = 1 2 π ∫ − ∞ ∞ h m , T ( r ) e − i u r d r ,
then Proposition 2 gives
∑ ρ h m , T ( Γ ρ ) = 2 h m , T ( i / 2 ) + 1 2 π ∫ − ∞ ∞ h m , T ( r ) ℜ Γ ′ Γ 1 4 + i r 2 − log π d r − 2 ∑ n = 2 ∞ Λ ( n ) n g m , T ( log n ) .
The reflected zero set is symmetric under Γ ↦ − Γ , while h m , T is even. Therefore (48) gives
∑ ρ h m , T ( Γ ρ ) = 2 T 2 A m ′ ( T 2 ) .
We first evaluate the archimedean term. The standard uniform digamma estimate gives
ℜ Γ ′ Γ 1 4 + i r 2 − log π = log | r | 2 π + O 1 | r | ( | r | ≥ 1 ) .
On | r | ≤ 1 the difference between the left side and log ( | r | / ( 2 π ) ) is O ( 1 + | log | r | | ) . This contribution is uniformly O ( 1 ) . Indeed, by the Wallis bound used in Lemma 5,
p m ( y ) ≪ m 4 y 2 ( 1 + y 2 ) 2 m ,
and for T ≥ 6 and | r | ≤ 1 the base is at most 1 / 9 . Hence the product with 1 + | log | r | | is dominated by an integrable function with an absolute bound because sup m ≥ 2 m 9 − m < ∞ . Moreover
∫ − ∞ ∞ p m ( y ) | y | d y = 1 ,
which follows from the beta integral ∫ 0 ∞ p m ( y ) y − 1 d y = 1 / 2 . Thus the O ( 1 / | r | ) error contributes O ( 1 ) . Using (49)–(), now on both halves of the real line, gives
1 2 π ∫ − ∞ ∞ h m , T ( r ) ℜ Γ ′ Γ 1 4 + i r 2 − log π d r = c m T 2 π log T 2 π + 1 2 m − 1 + O ( 1 ) .
The endpoint term is also uniformly bounded, with no hidden dependence on m. Indeed, putting y = 1 / ( 2 T ) ≤ 1 / 4 and again using the Wallis bound,
| h m , T ( i / 2 ) | = y 2 m B m ( 1 − y 2 ) 2 m ≪ m 4 y 2 ( 1 − y 2 ) 2 m ≤ C m 64 225 m = O ( 1 ) .
It remains to control the prime sum. Every contour displacement used below has σ = a / T ≤ 1 / 8 . For u > 0 shift the Fourier contour from ℑ r = 0 to ℑ r = − a , where 1 / 2 < a ≤ 3 / 4 . No pole is crossed, and the strip-uniform decay from Lemma 4 gives
| g m , T ( u ) | ≤ e − a u 2 π ∫ − ∞ ∞ | h m , T ( r − i a ) | d r = T e − a u 2 π ∫ − ∞ ∞ | p m ( y − i a / T ) | d y .
Lemma 5 therefore gives
| g m , T ( u ) | ≪ T e − a u M a / T m .
Let λ = m / T 2 . If 0 < λ ≤ 4 , take a = 3 / 4 . Since log M a / T ≪ a 2 / T 2 , we have M a / T m ≪ 1 , and therefore
∑ n = 2 ∞ Λ ( n ) n | g m , T ( log n ) | ≪ T .
If λ > 4 , choose instead
a = 1 2 + 1 λ ,
so that 1 / 2 < a < 3 / 4 . The absolutely convergent Dirichlet series gives
∑ n = 2 ∞ Λ ( n ) n 1 / 2 + a = − ζ ′ ζ 1 + 1 λ ≪ 1 + λ ,
where the last bound follows from the Laurent expansion at s = 1 (and is uniform for λ ≥ 4 ). By (39),
m log M a / T ≤ λ a 2 + C λ a 4 T 2 = λ 4 + 1 + 1 λ + O λ T 2 .
Together with (56), this yields
∑ n = 2 ∞ Λ ( n ) n | g m , T ( log n ) | ≪ T ( 1 + λ ) exp λ 4 + C λ T 2 .
After enlarging the implied constant, (58) also contains the case 0 < λ ≤ 4 by (57).
Substitution of (54) and (58) into (51)–(52), followed by division by 2 T 2 , proves (45).
Now fix ε ∈ ( 0 , 4 ) and suppose λ ≤ ( 4 − ε ) log log T . Since then λ / T 2 = o ( 1 ) ,
( 1 + λ ) exp λ 4 + C λ T 2 ≪ ( log log T ) ( log T ) 1 − ε / 4 + o ( 1 ) = o ( log T ) .
The main term in (45) is ≍ ( log T ) / T , uniformly in m ≥ 2 because 1 ≤ c m ≤ π / 2 . This proves (46). Finally,
A m ′ ( x ) = x m − 1 2 ( 2 m − 1 ) ! B m W m [ F ξ ] ( x )
has positive prefactor. Since log log x = log log T + log 2 for x = T 2 , write L = log log T . For every fixed ε ∈ ( 0 , 4 ) and all sufficiently large T,
( 4 − ε ) ( L + log 2 ) ≤ ( 4 − ε / 2 ) L .
Applying the T-statement with ε / 2 therefore proves (47).    □
Remark 1 
(Where a hypothetical obstruction can remain). Theorem 2 does not prove RH: it controls a large asymptotic region of the two-parameter Widder family, not every pair ( m , x ) . It shows more precisely that, for every fixed ε > 0 , a sequence of negative Widder values with x → ∞ must eventually escape the region
m ≤ ( 4 − ε ) x log log x .
The constant 4 has a natural origin in the absolute-convergence contour method. If λ = m / T 2 is large, the prime Dirichlet series forces the shift parameter toward a = 1 / 2 , while log M a / T ∼ a 2 / T 2 . Thus the least absolute-value amplification available from this method is asymptotically exp ( λ / 4 ) , and balancing it against the archimedean factor log T gives the transition λ ∼ 4 log log T . Going materially beyond that boundary would therefore require genuine cancellation on the prime side rather than a sharper absolute-value estimate alone.
The quantitative bound (45) also shows that positivity holds whenever
λ 4 + log ( 1 + λ ) + C λ T 2 ≤ log log T − ω ( 1 ) .
For example, it is enough that
λ ≤ 4 log log T − 4 log log log T − ω ( 1 ) .

4. A beta–Widder Schur–triple Application to Simple Critical Zeros

This section is logically separate from the uniform smoothing theorem of Section 3. Its purpose is to record a second use of the same beta family. After a compactifying change of variables, the beta densities become positive polynomial windows on [ − 1 / 2 , 1 / 2 ] . We combine one such window with the analytic finite-compression framework of Alpöge–Furman [11]. The positive Schur–Jensen remainder is motivated by Shi [12], but the rank–trace inequality, the zero-side seam, and its identification with the atoms used below are all reproved here in our own notation. Thus Shi is no longer used as a black-box input. Throughout this section, Alpöge–Furman means arXiv:2608.13637v2, and Shi means the preprint archived at the DOI in the bibliography. The external interface is version-locked: the only analytic inputs in the transfer step are the explicitly cited Poisson–Gabor, trace, tail, reduction, Archimedean, prime-square, and mixed-term estimates of Alpöge–Furman. Their fixed- λ normalization errors are tracked below, and the limit λ ↑ 1 is taken only after T → ∞ .
We make no claim that the numerical constant below is the strongest value obtainable from recent multi-point computations. The point here is that the window is an explicit beta–Widder mixture, the local Schur estimate uses only three consecutive simple critical zeros, and the finite verification is small and reproducible.

4.1. Compactifying the Beta Densities

Recall the beta density
p m ( y ) = y 2 m B ( m , m ) ( 1 + y 2 ) 2 m , y > 0 .
The change of variables
s = y 2 − 1 2 ( y 2 + 1 ) , − 1 2 < s < 1 2 ,
converts the logarithmic beta mass into a compactly supported polynomial probability density.
Lemma 6 
(Beta compactification). For m ≥ 1 define
v m ( s ) : = 4 1 − m B ( m , m ) ( 1 − 4 s 2 ) m − 1 , | s | ≤ 1 2 .
Then
2 p m ( y ) y d y = v m ( s ) d s
under (59), and ∫ − 1 / 2 1 / 2 v m ( s ) d s = 1 .
Proof. 
Since
d s d y = 2 y ( 1 + y 2 ) 2
and
1 − 4 s 2 = 4 y 2 ( 1 + y 2 ) 2 ,
we obtain
2 p m ( y ) y d y d s = 1 B ( m , m ) y 2 ( 1 + y 2 ) 2 m − 1 = 4 1 − m B ( m , m ) ( 1 − 4 s 2 ) m − 1 .
Integrating (61) over y > 0 gives the normalization; equivalently it follows directly from the beta integral.    □
We use the following explicit three-beta mixture:
ψ † ( s ) : = 49621 60000 v 1 ( s ) + 1 6 v 2 ( s ) + 379 60000 v 3 ( s ) .
The coefficients are positive and sum to 1. Since
v 1 ( s ) = 1 , v 2 ( s ) = 3 2 ( 1 − 4 s 2 ) , v 3 ( s ) = 15 8 ( 1 − 4 s 2 ) 2 ,
we have the exact polynomial form
ψ † ( s ) = 379 2000 s 4 − 4379 4000 s 2 + 522653 480000 , | s | ≤ 1 2 .
In particular, ψ † is even, C ∞ and strictly positive on [ − 1 / 2 , 1 / 2 ] , with
∫ − 1 / 2 1 / 2 ψ † ( s ) d s = 1 , ψ † ( ± 1 / 2 ) = 49621 60000 , max | s | ≤ 1 / 2 ψ † ( s ) = ψ † ( 0 ) = 522653 480000 .
To remain literally inside the bounded-window normalization used in ([11], Section 2.2), we feed the compression the scaled window
ψ † AF ( s ) : = c † ψ † ( s ) , c † : = 480000 522653 ,
so that 0 < ψ † AF ≤ 1 . This scaling changes neither R λ , which is homogeneous of degree zero in the window, nor the normalized correlation kernel: dividing the Fourier transform of ψ † AF by its mass c † gives exactly the K † below. We therefore keep the probability-normalized ψ † in all exact rational calculations.
Let
K † ( u ) : = ∫ − 1 / 2 1 / 2 ψ † ( s ) e 2 π i u s d s .
Since the window is even and normalized, K † is real and even on R and K † ( 0 ) = 1 . Writing x = π u , elementary integration gives
K † ( u ) = ( 49621 x 4 + 24315 x 2 + 17055 ) sin x − ( 30000 x 3 + 17055 x ) cos x 60000 x 5 , x = π u ,
with the removable value K † ( 0 ) = 1 .

4.2. The Window Constant

For an even positive window ψ on [ − 1 / 2 , 1 / 2 ] , Alpöge–Furman ([11], Lemma 5.6) define
R ( ψ ) : = ∫ − 1 / 2 1 / 2 ψ ( s ) 2 d s + ∫ − 1 / 2 1 / 2 ∫ − 1 / 2 1 / 2 | s − t | ψ ( s ) ψ ( t ) d s d t ∫ − 1 / 2 1 / 2 ψ ( s ) d s 2 .
Their finite-compression argument gives the baseline proportion 2 − R ( ψ ) for simple zeros on the critical line. Direct rational integration of (63) gives
∫ − 1 / 2 1 / 2 ψ † ( s ) 2 d s = 8451863641 8400000000 ,
∫ − 1 / 2 1 / 2 ∫ − 1 / 2 1 / 2 | s − t | ψ † ( s ) ψ † ( t ) d s d t = 17814265853 55440000000 .
Hence
R ( ψ † ) = 183991414709 138600000000 = 1.327499384624819 … ,
and
p † : = 2 − R ( ψ † ) = 93208585291 138600000000 = 0.672500615375180 … .
This is slightly below the Montgomery–Taylor optimum among certificates of the form 2 − R ( ψ ) , as it must be; see ([11], Theorem A and Section 7.2). The gain below comes instead from retaining a positive Schur remainder.

4.3. A Three-Point Schur Remainder

Following Shi [12], put
g ( t ) : = t 2 − 2 t − ( t − 2 ) + 2 = t 2 − 2 t , 0 ≤ t ≤ 2 , 2 t − 4 , t ≥ 2 .
Let M be a 3 × 3 correlation Gram matrix, so M ⪰ 0 and M j j = 1 . Write
E ( M ) : = | M 12 | 2 + | M 13 | 2 + | M 23 | 2
and
S 3 ( M ) : = tr g ( M ) − 3 g ( 1 ) .
Lemma 7 
(Universal three-point Schur bound). Every 3 × 3 correlation Gram matrix satisfies
S 3 ( M ) ≥ 5 3 E ( M ) .
Moreover, if λ max ( M ) < 2 , then
S 3 ( M ) = 2 E ( M ) .
Proof. 
Let the eigenvalues be λ 1 , λ 2 , λ 3 ≥ 0 . Since ∑ λ j = 3 and tr M 2 = 3 + 2 E ( M ) , formula (72) gives
S 3 ( M ) = 2 E ( M ) − ∑ j = 1 3 ( λ j − 2 ) + 2 .
At most one eigenvalue can exceed 2. If none does, this proves (75). Otherwise write L = λ max ∈ ( 2 , 3 ] . The other two eigenvalues have sum 3 − L , so
E ( M ) = 1 2 ∑ j λ j 2 − 3 ≥ 3 4 ( L − 1 ) 2 .
For 2 ≤ L ≤ 3 ,
3 4 ( L − 1 ) 2 ≥ 3 ( L − 2 ) 2 ,
whence ( L − 2 ) 2 ≤ E ( M ) / 3 . Substitution into (76) proves (74).    □
The block form needed below is a direct extension of the matching argument in ([12], Lemma 2.2).
Lemma 8 
(Disjoint-block Schur–Horn bound). Let v 1 , … , v s be vectors with ∥ v j ∥ ≤ 1 , let P = ∑ j v j v j * , and let M = ( 〈 v i , v j 〉 ) . Define
S ( P ) : = tr g ( P ) − ∑ j = 1 s g ( ∥ v j ∥ 2 ) .
For any partition of a subset of { 1 , … , s } into disjoint blocks B, one has
S ( P ) ≥ ∑ B tr g ( M B ) − ∑ j ∈ B g ( M j j ) ,
where M B is the corresponding principal Gram block.
Proof. 
For each selected block choose a unitary matrix diagonalizing M B , and let U be the direct sum of these block unitaries and the identity on the unselected coordinates. The nonzero eigenvalues of P and M agree, so tr g ( P ) = tr g ( M ) . By Schur–Horn and the convexity of g,
tr g ( M ) ≥ ∑ j g ( ( U * M U ) j j ) .
On each selected block the diagonal entries of U * M U are the eigenvalues of M B , while on all other coordinates the diagonal remains M j j . Subtracting ∑ j g ( M j j ) gives (77).    □

4.4. An Affine Triple-Energy Inequality

For x , y ≥ 0 let
M † ( x , y ) : = 1 K † ( x ) K † ( x + y ) K † ( x ) 1 K † ( y ) K † ( x + y ) K † ( y ) 1
and write S † ( x , y ) : = S 3 ( M † ( x , y ) ) . Because (78) is the Gram matrix of three translates of ψ † , it is positive semidefinite.
Lemma 9 
(Affine triple-energy certificate). For every x , y ≥ 0 ,
S † ( x , y ) + x + y 800 ≥ 171 40000 .
Proof. 
Put
E † ( x , y ) : = K † ( x ) 2 + K † ( y ) 2 + K † ( x + y ) 2 .
If (79) failed, then by Lemma 7,
E † ( x , y ) < 3 5 171 40000 = 0.002565 .
Hence
∥ M † ( x , y ) − I ∥ op ≤ ∥ M † ( x , y ) − I ∥ F = 2 E † ( x , y ) < 0.072 ,
so all eigenvalues of M † ( x , y ) are < 2 . Therefore (75) applies, and it suffices to prove
2 E † ( x , y ) + x + y 800 ≥ 171 40000 .
The remaining statement is a finite interval-arithmetic verification of the explicit function (66). We record the reduction so that the trust base is transparent. Define
q ( u ) : = 2 K † ( u ) 2 + u 1600 .
Then the left side of (80) is q ( x ) + q ( y ) + q ( x + y ) . If x + y ≥ 3.42 , the linear term alone proves (80). For 0 ≤ u ≤ 0.48 , positivity of ψ † and its normalization give
K † ( u ) = ∫ − 1 / 2 1 / 2 ψ † ( s ) cos ( 2 π u s ) d s ≥ cos ( π u ) ,
so again q ( u ) > 171 / 40000 .
On the remaining interval, outward interval arithmetic at 50 decimal digits certifies
q ( u ) ≥ 171 40000
outside
J 1 = [ 1.01 , 1.11 ] , J 2 = [ 1.94 , 2.13 ] , J 3 = [ 2.895 , 3.153 ] .
Thus a counterexample to (80) would have x , y , x + y ∈ J 1 ∪ J 2 ∪ J 3 . Since x + y < 3.42 , the only additive possibilities are, up to exchanging x and y,
( x , y ) ∈ J 1 × J 1 or ( x , y ) ∈ J 1 × J 2 .
The same outward interval calculation certifies (80) on both full rectangles. The supplied script beta_widder_affine_certificate.py performs these checks using mpmath.iv; it closes the four one-dimensional complement intervals with 15 , 39 , 29 , 13 boxes, respectively, and the two rectangles with 5053 and 3333 boxes, with no unresolved boxes. The subdivision endpoints are exact rationals, and the script compares outward interval endpoints directly. As an independent implementation, the supplied standard-library script beta_widder_affine_certificate_decimal.py uses directed decimal rounding, exact rational subdivision, Taylor’s theorem with explicit Lagrange remainders for sine and cosine, and the Fourier-moment bounds | K † | ≤ 1 , | K † ′ | ≤ π , | K † ′ ′ | ≤ π 2 . In separate fresh-process runs it closes the same four one-dimensional regions with 23 , 69 , 99 , 51 boxes and the two rectangles with 2309 and 5351 boxes, respectively; the corresponding output log is included in the source package.    □
Remark 2 
(Computational status). The interval verification in Lemma 9 is small and fully reproducible from the source package. Two algorithmically independent interval implementations are supplied. The first usesmpmath.ivwithmpmath==1.3.0at 50 decimal digits and outward intervals. The second uses only Python’s standard-librarydecimalmodule with directed rounding and rigorous Taylor remainders; it does not importmpmathor any external interval package. Both use exact rational subdivision coordinates and certify the same fixed rational target 171 / 40000 on the same analytic reduction. The exact rational window integrals and bootstrap fixed point are separately checked, using onlyfractions.Fraction, by verifybetaschurrationals.py. The exact commands, expected box counts, software assumptions, and the SHA-256 hashes of the scripts and archived logs are recorded in REPRODUCIBILITY.md and SHA256SUMS.txt. The recorded outputs are betaschurcertificateoutput.txt and betaschurcertificatedecimaloutput.txt. Timing is not part of the certificate. An Arb/FLINT replay would be a useful third archival implementation, but the proof package does not rely on such a replay because the directed-Decimal/Taylor implementation already supplies an independent transcendental enclosure path. These certificates verify only the finite inequality in Lemma 9; they do not certify the external analytic estimates imported from Alpöge–Furman.

4.5. The Fixed-Bandwidth Finite-Compression Interface

Remark 3 
(Version-locked Alpöge–Furman interface). For auditability, the external dependency is frozen at arXiv:2608.13637v2. We use exactly the Fourier convention of that paper, f ^ ( ξ ) = ∫ R f ( u ) e − i u ξ d u . The only change of scale is
ℓ : = log ( T / 2 π ) , L : = λ ℓ , X : = e L = ( T / 2 π ) λ , 0 < λ < 1 ,
with λ fixed while T → ∞ . No assertion at the endpoint λ = 1 is imported.
The following ledger records the exact external formulas used. Equation and proposition numbers in the first column refer to Alpöge–Furman v2.
No rank–trace inequality, Schur remainder, triple packing lemma, or three-point certificate is imported from this list. More importantly, the general-window formula for R λ ( ψ ) isnotquoted from Remark 6.1: Proposition 3 re-derives it from the raw terms in the ledger. Remark 6.1 is used only as a check on the special case ψ = 1 [ − 1 / 2 , 1 / 2 ] .
There is also no hidden use of L = ℓ in this re-scaling. In the cited proofs, the Archimedean density is naturally expressed in ℓ, whereas window support and the prime cutoff are expressed in L = log X ; Proposition 5.4 only requires the same diagonal regime X ≤ T , which is automatic for fixed λ < 1 , and the mixed-term proof changes only by the fixed ratio ℓ / L = 1 / λ . Proposition 5.2 already keeps ℓ and X separate through its quantity B. This is exactly the deformation summarized for the indicator window in their Remark 6.1.   
External item Quantity retained before the specialization L = ℓ
(2.7)–(2.11), Lemma 2.1 The tapered test family, grid spacing 2 π / L , normalized matrix, and the exact Poisson–Gabor identity. These give the atom norm bound and the local Gram limit used below.
Proposition 4.2, proof tr A ^ = N ( I ′ ) + O χ ( X 1 / 2 L 2 ) for the finite zero-side compression.
Proposition 4.3, proof ∥ E ^ ∥ 1 ≪ χ X 1 / 2 / T for the omitted zero-side tail.
(5.7), Proposition 5.2, proof With B 2 ≪ ℓ 2 + X , the two raw reduction errors satisfy | E 1 | ≪ L 3 B 2 log L and | E 2 | ≪ L 3 B 2 ℓ log L .
Proposition 5.3 M [ μ , μ ] = b L T ℓ 1 2 / ( 2 π ) ( 1 + O ( ℓ − 2 ) ) + O ( ℓ 2 log L ) , where b = L − 1 ∫ ϕ 4 and ℓ 1 = ℓ + O ( 1 ) .
Proposition 5.4 M [ P X , P X ] = ( T / π ) ∑ n ≤ X Λ ( n ) 2 n − 1 g ( log n ) + O χ ( L 2 X ) ; the same partial summation as in Theorem 5.7 gives the T L 3 D / ( 2 π ) main term below.
Proposition 5.5 The four mixed terms are O λ , ψ , χ ( L 2 X 1 / 2 ) after fixing λ (the displayed μ –prime term is smaller).
Remark 6.1 Independent consistency check: for the indicator window the fixed- λ constant is R λ = λ − 1 + λ / 3 .
For clarity we now state exactly the part of the recent finite-compression machinery that is used below and record the uniform normalization estimate needed for triples. Put
ℓ : = log ( T / 2 π ) , L : = λ ℓ , 0 < λ < 1
with λ fixed while T → ∞ . Let χ be the fixed endpoint taper used in ([11], Section 2.2), and set
ϕ T ( u ) : = χ L 2 + u χ L 2 − u ψ † AF ( u / L ) 1 / 2 , a T : = 1 L ∫ R ϕ T ( u ) 2 d u .
Since ∫ ψ † AF = c † , one has a T = c † + O ( L − 1 ) . Put
τ k : = T + 2 π k L , d : = L T 2 π .
Put
I : = ( T , 2 T ] , I ′ : = ( T − T 1 / 2 , 2 T + T 1 / 2 ] , I ∘ : = [ T + T 1 / 2 , 2 T − T 1 / 2 ] .
For every simple critical-line zero 1 / 2 + i γ with γ ∈ I ′ , define its normalized finite atom by
v γ : = 1 a T L 2 ϕ T ^ ( γ − τ k ) 0 ≤ k < d .
These are exactly the simple-line vectors entering the positive block of the normalized finite zero-side matrix. The full-lattice Poisson–Gabor identity and truncation immediately give ∥ v γ ∥ 2 ≤ 1 for every γ ∈ I ′ . The stronger normalization ∥ v γ ∥ = 1 + o ( 1 ) is needed only for the selected triples, which will lie in the deep core I ∘ .
Lemma 10 
(Uniform atom normalization and local Gram limit). For every fixed U > 0 there is a quantity η T ( U ) = o ( 1 ) , depending on λ , U and the fixed taper but not on the chosen core zeros, such that
0 ≤ 1 − ∥ v γ ∥ 2 ≤ η T ( U ) ,
〈 v γ , v γ ′ 〉 ∥ v γ ∥ ∥ v γ ′ ∥ − K † L ( γ − γ ′ ) 2 π ≤ η T ( U )
whenever | L ( γ − γ ′ ) / ( 2 π ) | ≤ U . More precisely one may take
η T ( U ) ≪ U L − 1 + ( L T 3 / 2 ) − 1 .
Proof. 
The Poisson–Gabor identity ([11], Lemma 2.1) gives, on the full sampling lattice,
∑ k ∈ Z ϕ T ^ ( γ − τ k ) ϕ T ^ ( γ ′ − τ k ) ¯ = L ϕ T 2 ^ ( γ − γ ′ ) .
At γ ′ = γ the right side is a T L 2 . Two integrations by parts give | ϕ T ^ ( r ) | ≪ | r | − 2 away from r = 0 , uniformly for fixed λ . A core ordinate is at distance T 1 / 2 − O ( L − 1 ) from the omitted part of the lattice, hence comparison with ∫ T 1 / 2 ∞ r − 4 d r gives
∑ k ∉ [ 0 , d ) | ϕ T ^ ( γ − τ k ) | 2 ≪ L T − 3 / 2 .
After division by a T L 2 ≍ L 2 this proves (84), with error O ( ( L T 3 / 2 ) − 1 ) .
Now put u = L ( γ − γ ′ ) / ( 2 π ) . Uniformly for | u | ≤ U , rescaling (82) gives
ϕ T 2 ^ ( 2 π u / L ) a T L = 1 c † ∫ − 1 / 2 1 / 2 ψ † AF ( s ) e 2 π i u s d s + O U ( L − 1 ) = K † ( u ) + O U ( L − 1 ) .
The omitted cross terms satisfy the same O ( L T − 3 / 2 ) estimate by Cauchy–Schwarz. Dividing by a T L 2 and then by the two norms, which are 1 + o ( 1 ) uniformly by the first part, proves ().    □
The preceding lemma lets us keep the original finite atoms in the global Schur remainder; no renormalization of the finite-compression seam is needed. The next elementary stability statement makes this explicit.
Lemma 11 
(Stability of a three-point Schur block). For a positive semidefinite 3 × 3 Gram matrix M with diagonal r 1 , r 2 , r 3 ∈ ( 0 , 1 ] , let
C = D − 1 M D − 1 , D = diag ( r 1 , r 2 , r 3 ) .
Then C is a correlation matrix and, as max j | r j − 1 | → 0 ,
tr g ( M ) − ∑ j = 1 3 g ( r j ) = S 3 ( C ) + O max j | r j − 1 | ,
uniformly over all such Gram matrices. Moreover the left side of (86) is always nonnegative.
Proof. 
All eigenvalues of M and C lie in [ 0 , 3 ] . On this interval the convex function g is 2-Lipschitz. Since M = D C D and D = I + O ( η ) when η = max j | r j − 1 | , one has ∥ M − C ∥ F = O ( η ) . The Hoffman–Wielandt inequality therefore gives
| tr g ( M ) − tr g ( C ) | = O ( η ) , ∑ j g ( r j ) − 3 g ( 1 ) = O ( η ) ,
which proves (86). Finally, the vector of diagonal entries of a Hermitian matrix is majorized by its eigenvalue vector. Convexity of g and Schur–Horn therefore give tr g ( M ) ≥ ∑ j g ( M j j ) .    □

4.6. General-window Scaling of the Prime-Side Second Moment

We next make explicit the fixed- λ scaling and the error bookkeeping needed in the bootstrap. This removes the phrase “by the same estimates” from the transfer argument and makes clear why the ordered limit T → ∞ first, λ ↑ 1 second, is harmless.
Proposition 3 
(Fixed-bandwidth window constant with an explicit error). Let ψ be an even positive C 2 window on [ − 1 / 2 , 1 / 2 ] , and put
J : = ∫ − 1 / 2 1 / 2 ψ ( s ) d s , I 2 : = ∫ − 1 / 2 1 / 2 ψ ( s ) 2 d s , D : = ∫ ∫ [ − 1 / 2 , 1 / 2 ] 2 | s − t | ψ ( s ) ψ ( t ) d s d t .
Use the Alpöge–Furman compression with L = λ ℓ , X = e L = ( T / 2 π ) λ , where 0 < λ < 1 is fixed. Let A ^ denote the normalized finite zero-side block, E ^ the omitted zero-side tail, and put G ^ : = A ^ + E ^ for the full compression evaluated by the explicit formula. Then
∥ G ^ ∥ HS 2 = R λ ( ψ ) + O λ , ψ , χ ( ε λ ( T ) ) N ( T , 2 T ) ,
where
R λ ( ψ ) = λ − 1 I 2 + λ D J 2 , ε λ ( T ) : = 1 ℓ + ℓ log ℓ T + T λ − 1 log ℓ ℓ + T λ / 2 − 1 ℓ .
In particular ε λ ( T ) → 0 for every fixed 0 < λ < 1 .
Proof. 
We spell out the normalization of every term used from ([11], Sections 4–5). For the tapered window built from ψ one has
a T = J + O ψ , χ ( L − 1 ) , b T : = L − 1 ∥ ϕ T ∥ 4 4 = I 2 + O ψ , χ ( L − 1 ) .
The normalization is worth writing before estimating anything. In the notation of the proof of ([11], Proposition 5.2), the exact reduction has the form
( a T L 2 ) 2 ∥ G ^ ∥ HS 2 = L 2 M + E 1 + E 2 ,
up to the harmless notation change from their full compression to G ^ . Thus the main double integral is divided by a T 2 L 2 , while the raw errors are divided by a T 2 L 4 ; these two powers of L should not be conflated. Their proof gives
| E 1 | ≪ ψ , χ L 3 B 2 log L , | E 2 | ≪ ψ , χ L 3 B 2 ℓ log L , B 2 ≪ ℓ 2 + X .
Using L = λ ℓ , a T ≍ ψ 1 , and N ( T , 2 T ) ≍ T ℓ , division of the two errors in (89) by a T 2 L 4 N ( T , 2 T ) gives
O λ , ψ , χ ℓ log ℓ T + T λ − 1 log ℓ ℓ .
The first raw error alone is smaller; the displayed envelope is chosen to cover both and to keep the later bookkeeping one-line. Their Proposition 5.3 gives
M [ μ , μ ] = b T L T ℓ 1 2 2 π 1 + O ( ℓ − 2 ) + O ( ℓ 2 log L ) , ℓ 1 = ℓ + O ( 1 ) .
Since N ( T , 2 T ) ∼ T ℓ / ( 2 π ) and L = λ ℓ , its normalized contribution is
M [ μ , μ ] a T 2 L 2 N ( T , 2 T ) = 1 λ I 2 J 2 + O λ , ψ , χ ( ℓ − 1 ) .
For the prime square, Proposition 5.4 and the partial-summation calculation used in Theorem 5.7 give
M [ P X , P X ] = T L 3 2 π D + O ψ , χ ( T L 2 + L 2 X ) .
Consequently
M [ P X , P X ] a T 2 L 2 N ( T , 2 T ) = λ D J 2 + O λ , ψ , χ 1 ℓ + T λ − 1 ℓ .
The four mixed terms are bounded in Proposition 5.5 by O χ ( L 2 X ) (with the first one in fact smaller). After the same normalization their total contribution is
O λ , ψ , χ X N ( T , 2 T ) = O λ , ψ , χ T λ / 2 − 1 ℓ .
For reference, the normalized contributions per zero are therefore
term contribution after division by N ( T , 2 T ) Archimedean λ − 1 I 2 / J 2 + O ( ℓ − 1 ) prime square λ D / J 2 + O ( ℓ − 1 + T λ − 1 / ℓ ) mixed terms O ( T λ / 2 − 1 / ℓ ) finite / full reduction O ( ℓ log ℓ / T + T λ − 1 log ℓ / ℓ ) .
All implied constants may depend on the fixed λ , window, and taper. Combining (90), (91), (92), and (93) proves (87). For later use in the zero-side seam, we also record that the proof of ([11], Proposition 4.3), with X = e L , gives
∥ E ^ ∥ 1 ≪ ψ , χ X 1 / 2 T ≪ λ , ψ , χ T λ / 2 − 1 .
This estimate is not absorbed into (87); it is kept separately because it is precisely what compares the finite zero-side matrix A ^ with the full explicit-formula matrix G ^ . For ψ = 1 [ − 1 / 2 , 1 / 2 ] the formula reads R λ = λ − 1 + λ / 3 , in agreement with ([11], Remark 6.1). At the level of the main term, R λ ( ψ ) → R ( ψ ) as λ ↑ 1 ; no uniformity at the endpoint is asserted or needed.    □
For the normalized window ψ † we shall therefore use
R λ ( ψ † ) = 1 λ ∫ − 1 / 2 1 / 2 ψ † ( s ) 2 d s + λ ∫ ∫ | s − t | ψ † ( s ) ψ † ( t ) d s d t ,
and in particular R λ ( ψ † ) → R ( ψ † ) as λ ↑ 1 .

4.7. A Self-Contained Strengthened Finite-Compression Seam

We now reproduce the finite-dimensional refinement needed for the Schur remainder. It is the mechanism isolated by Shi [12], but the proof below is included so that the transfer theorem does not require transporting notation or an unstated hypothesis from that preprint.
Lemma 12 
(Spectral rank–trace inequality). Let P , Q be Hermitian d × d matrices, with P ⪰ 0 and n + ( Q ) ≤ b . Then
∥ P + Q ∥ HS 2 ≥ 2 tr P + tr g ( P ) + 4 tr Q − 4 b .
Proof. 
Write Q = Q + − Q − for the positive and negative parts. Since tr ( P Q + ) ≥ 0 and Q + Q − = 0 ,
∥ P + Q ∥ HS 2 ≥ ∥ P − Q − ∥ HS 2 + ∥ Q + ∥ HS 2 .
Let p j , n j ≥ 0 be the eigenvalues of P , Q − in decreasing order. Von Neumann’s trace inequality gives
∥ P − Q − ∥ HS 2 ≥ ∑ j ( p j − n j ) 2 .
For p , n ≥ 0 one has
( p − n ) 2 ≥ 2 p + g ( p ) − 4 n .
Indeed the difference is n ( n + 4 − 2 p ) ≥ 0 when p ≤ 2 and ( p − n − 2 ) 2 ≥ 0 when p ≥ 2 . Thus
∥ P − Q − ∥ HS 2 ≥ 2 tr P + tr g ( P ) − 4 tr Q − .
If q 1 , … , q r are the positive eigenvalues of Q, then r ≤ b and q j 2 ≥ 4 q j − 4 , whence ∥ Q + ∥ HS 2 ≥ 4 tr Q + − 4 b . Adding the last two estimates proves (96).    □
Let A ^ be the normalized finite zero-side matrix associated with I ′ and the same window and sampling grid as above. The simple critical-line zeros in I ′ contribute exactly the atoms (83). Write
A ^ = P 1 + Q ′ , P 1 : = ∑ j = 1 s 1 v j v j * ,
where s 1 is the number of simple critical-line zeros in I ′ . Let s 2 be the number of distinct multiple critical-line zeros in I ′ and let p be the number of off-line functional-equation pairs. The block-structure argument of ([11], Proposition 4.1), or equivalently Sylvester inertia applied pair by pair, gives
n + ( Q ′ ) ≤ s 2 + p , N ( I ′ ) ≥ s 1 + 2 s 2 + 2 p .
Define the global simple-atom Schur remainder
S : = tr g ( P 1 ) − ∑ j = 1 s 1 g ( ∥ v j ∥ 2 ) .
By Schur–Horn and convexity of g, S ≥ 0 .
Proposition 4 
(Self-contained Schur seam). With the notation above,
s 1 ≥ 4 tr A ^ − ∥ A ^ ∥ HS 2 − 2 N ( I ′ ) + S .
Consequently,
N 0 s ( I ) ≥ 4 tr A ^ − ∥ A ^ ∥ HS 2 − 2 N ( I ) − 3 N ( I ′ ∖ I ) + S .
Proof. 
Apply Lemma 12 to P 1 + Q ′ . If x j = ∥ v j ∥ 2 , then by (100),
∥ A ^ ∥ HS 2 ≥ 2 tr P 1 + ∑ j g ( x j ) + S + 4 tr Q ′ − 4 ( s 2 + p ) .
Using A ^ = P 1 + Q ′ this becomes
∥ A ^ ∥ HS 2 ≥ 4 tr A ^ − 2 tr P 1 + ∑ j g ( x j ) + S − 4 ( s 2 + p ) .
Here 0 ≤ x j ≤ 1 , so g ( x j ) = x j 2 − 2 x j ≥ − 1 , while tr P 1 = ∑ j x j ≤ s 1 . Therefore
∥ A ^ ∥ HS 2 ≥ 4 tr A ^ − 3 s 1 + S − 4 ( s 2 + p ) .
From (99), 4 ( s 2 + p ) ≤ 2 N ( I ′ ) − 2 s 1 , and rearrangement proves (101). Finally N 0 s ( I ) ≥ s 1 − N ( I ′ ∖ I ) and N ( I ′ ) ≤ N ( I ) + N ( I ′ ∖ I ) , which gives (102).    □
Corollary 1 
(Analytic insertion into the seam). Fix 0 < λ < 1 . For the beta–Widder shape ψ † , implemented in the compression by the harmless scaling (64),
N 0 s ( T , 2 T ) N ( T , 2 T ) ≥ 2 − R λ ( ψ † ) + S N ( T , 2 T ) − O λ , χ ( δ λ ( T ) ) ,
where, for example, one may take
δ λ ( T ) : = 1 ℓ + ℓ log ℓ T + T λ − 1 log ℓ ℓ + T λ / 2 − 1 ℓ + T − 1 / 2 , δ λ ( T ) ⟶ 0 .
Proof. 
Let G ^ be the normalized full finite-compression matrix and E ^ the omitted zero tail, so that A ^ = G ^ − E ^ . The proof of ([11], Proposition 4.2) gives, before the harmless specialization X ≤ T ,
tr A ^ = N ( I ′ ) + O χ ( X 1 / 2 L 2 ) .
Since G ^ = A ^ + E ^ and (94) gives B 0 : = ∥ E ^ ∥ 1 ≪ X 1 / 2 / T , we also have
tr G ^ = N ( I ′ ) + O χ ( X 1 / 2 L 2 ) ,
with the tail contribution absorbed in the displayed error. Hence
4 tr A ^ − ∥ A ^ ∥ HS 2 ≥ 4 tr G ^ − ∥ G ^ ∥ HS 2
− B 0 4 + 2 ∥ G ^ ∥ HS + B 0 .
Indeed this follows from | tr E ^ | ≤ ∥ E ^ ∥ 1 and Frobenius Cauchy–Schwarz. Proposition 3 implies ∥ G ^ ∥ HS = O ( N ( T , 2 T ) ) , so the last line of (108) is o ( N ( T , 2 T ) ) for every fixed λ < 1 .
Now insert (106), (87), and N ( I ′ ∖ I ) = O ( T 1 / 2 ℓ ) into (102). Dividing by N ( T , 2 T ) ≍ T ℓ gives (103). The normalized trace error is O ( T λ / 2 − 1 ℓ ) , the boundary error is O ( T − 1 / 2 ) , and the Hilbert–Schmidt errors are bounded by (88); these are all dominated by (104). This proves the claimed fixed- λ error with no appeal to an external Schur seam.    □

4.8. Triple Packing and the Transfer Theorem

We now combine Lemma 9 with the self-contained seam of Proposition 4 and the analytic insertion in Corollary 1. The elementary spacing step is stated separately.
Lemma 13 
(Three-offset packing). Let 0 < y 1 < … < y m lie in an interval of length X. Among the three partitions into consecutive triples obtained by the three possible starting offsets, one has
∑ B span ( B ) ≤ 2 X 3 ,
where the sum runs over its complete triple blocks. The number of complete blocks is m / 3 + O ( 1 ) .
Proof. 
Write d j = y j + 1 − y j . In a fixed offset partition a gap contributes to a block span exactly when it lies inside a triple rather than between two triples. Across the three offsets, every gap away from incomplete end blocks is counted exactly twice, while an end gap is counted at most twice. Hence the sum of the three total block-spans is at most 2 ∑ j d j = 2 ( y m − y 1 ) ≤ 2 X . One offset therefore satisfies (109).    □
Let
A * : = 171 40000 , B * : = 1 800 , A * B * = 3.42 .
Proposition 5 
(Rigorous three-point transfer). Fix 0 < λ < 1 . Suppose
lim inf T → ∞ N 0 s ( T , 2 T ) N ( T , 2 T ) ≥ a .
Then the Schur remainder S in the strengthened finite-compression seam satisfies
S N ( T , 2 T ) ≥ A * 3 a − 2 B * 3 λ − o ( 1 ) .
Consequently,
lim inf T → ∞ N 0 s ( T , 2 T ) N ( T , 2 T ) ≥ 2 − R λ ( ψ † ) + A * 3 a − 2 B * 3 λ .
Proof. 
Fix ε > 0 . For all sufficiently large T, after removing the two boundary strips of width T 1 / 2 , the core contains
m ≥ ( a − ε − o ( 1 ) ) N ( T , 2 T )
simple critical-line zeros. Order their ordinates and put y j = L γ j / ( 2 π ) . By Riemann–von Mangoldt,
y m − y 1 ≤ ( λ + o ( 1 ) ) N ( T , 2 T ) .
Choose the offset in Lemma 13. Thus the number of complete blocks is 1 3 ( a − ε − o ( 1 ) ) N ( T , 2 T ) and
∑ B span ( B ) ≤ 2 λ 3 + o ( 1 ) N ( T , 2 T ) .
For a selected block B = ( γ 1 , γ 2 , γ 3 ) let M B be the Gram block of the original normalized finite atoms (83), and write
x = L ( γ 2 − γ 1 ) 2 π , y = L ( γ 3 − γ 2 ) 2 π , s B = x + y = span ( B ) .
If s B ≥ A * / B * = 3.42 , Lemma 11 gives
tr g ( M B ) − ∑ j ∈ B g ( ( M B ) j j ) ≥ 0 ≥ A * − B * s B .
Thus no asymptotic kernel approximation is needed for long blocks.
If s B < 3.42 , then x , y , x + y all belong to the fixed compact interval [ 0 , 3.42 ] . Lemma 10, followed by Lemma 11, gives uniformly over all such blocks
tr g ( M B ) − ∑ j ∈ B g ( ( M B ) j j ) = S † ( x , y ) + o ( 1 ) ≥ A * − B * s B − o ( 1 ) ,
where the last step is Lemma 9. Since there are O ( N ( T , 2 T ) ) blocks and the o ( 1 ) is uniform on the compact span range, the accumulated error is o ( N ( T , 2 T ) ) . Applying Lemma 8 with P = P 1 from (98) and summing over the disjoint blocks therefore yields
S ≥ A * # { B } − B * ∑ B s B − o ( N ) ≥ A * 3 ( a − ε ) − 2 B * 3 λ − o ( 1 ) N .
Letting ε ↓ 0 proves (111).
Corollary 1 applies to this very same S , because the vectors in the selected triple blocks are principal subfamilies of the simple atoms in P 1 from (98). Hence
N 0 s ( T , 2 T ) N ( T , 2 T ) ≥ 2 − R λ ( ψ † ) + S N ( T , 2 T ) − o ( 1 ) .
Insert (111) to obtain (112). This closes the transfer using only the explicitly stated Alpöge–Furman analytic estimates and the finite-dimensional argument proved above.    □
Letting λ ↑ 1 only after T → ∞ in (112) gives the bootstrap map
F ( a ) = p † + 171 120000 a − 1 1200 .
Its slope is 171 / 120000 < 1 . Notice that this order of limits requires no endpoint λ = 1 tail estimate.
Theorem 3 
(Computer-assisted beta–Widder Schur–triple lower bound). Let N 0 s ( T , 2 T ) denote the number of simple zeros of ζ ( s ) on the critical line with ordinates in ( T , 2 T ] , and let N ( T , 2 T ) count all nontrivial zeros there with multiplicity. Then
lim inf T → ∞ N 0 s ( T , 2 T ) N ( T , 2 T ) ≥ 93093085291 138402495000 = 0.672625773769468 … .
The same lower bound holds for the cumulative ratio N 0 s ( 0 , T ) / N ( 0 , T ) .
Proof. 
Alpöge–Furman ([11], Theorem A) supply an unconditional starting value exceeding 2 / 3 , so the bootstrap is applicable. If a lower bound a is known, Proposition 5, followed by λ ↑ 1 , gives the improved lower bound F ( a ) in (115). Iterating the contraction yields the unique fixed point
a * = p † − 1 / 1200 1 − 171 / 120000 = 93093085291 138402495000 .
The cumulative form follows by the standard dyadic summation used in ([11], Theorem A and Remark 6.1); no additional finite-dimensional input is needed.    □
Corollary 2 
(Improved smoothed simple-zero density). In the notation of the smoothing section, for every fixed L > 0 ,
lim inf x → ∞ inf m ∈ N 1 ≤ m ≤ L x S m ( x ) A m ( x ) ≥ 93093085291 138402495000 = 0.672625773769468 … .
Proof. 
Apply Proposition 1 with the cumulative density bound furnished by Theorem 3.    □
Remark 4 
(Relation to the recent literature). The literature status in this remark was checked on 15 September 2026. The Montgomery–Taylor value 3 / 2 − 2 − 1 / 2 cot ( 2 − 1 / 2 ) = 0.672500703679 … appears in Alpöge–Furman [11] and in Lamzouri’s shorter proof [13]. Shi [12] retains a positive Schur remainder and selects a matching of pairs. Wang [14] develops a short-interval extension of the Lamzouri method. The present argument instead uses the Alpöge–Furman finite-compression analytic input, an affine estimate on disjoint triples, and a window chosen from the compactified beta–Widder family. The value in (116) is therefore presented only as the output of this beta–Widder three-point mechanism, not as a record claim. A non-peer-reviewed Zenodo preprint of Devine [15], for example, reports the larger computer-assisted value 0.673399 . We neither use nor validate that separate claim here; it is cited only to delimit the numerical-priority statement.

Data Availability Statement

No new numerical zero computation is performed in this paper. The zero-height input is the published rigorous verification of Platt–Trudgian; its critical-line conclusion is the only part needed for Theorem A8. The published cutoff in Theorem A8 uses the Mossinghoff–Trudgian–Yang zero-free region; the larger cutoff in Corollary A7 additionally uses the 2026 Bellotti–Trudgian–Yang preprint. The source package includes nine supplementary verification scripts. In particular, verify_smoothing.py checks selected beta identities and complex-derivative bounds, verify_sharp_saddle.py checks the exact shifted-kernel saddle identity and representative L 1 normalizations, and verify_cutoff.py uses mpmath interval arithmetic to reproduce the enclosures (A75)–(A77) and the integer in (A78). The script beta_widder_affine_certificate.py supplies the original mpmath.iv outward-interval verification used in Lemma 9. The independent script beta_widder_affine_certificate_decimal.py rechecks the same six certified regions using only Python’s standard-library directed-rounding decimal arithmetic, exact rational subdivisions, and Taylor remainder enclosures for the trigonometric functions. The remaining scripts check algebraic identities used in the prime, generating-function, terminal-collar, and semicircle sections. Except for the explicitly labelled computer-assisted Lemma 9, these finite computations are consistency checks only and are not used as proofs of the uniform analytic theorems.

Acknowledgments

OpenAI ChatGPT was used during mathematical exploration, algebraic checking, literature navigation, and revision of the manuscript. The arguments are presented as explicit proofs or attributed to the stated external sources; the cutoff arithmetic and both affine-triple certificate implementations are reproducible with the supplied scripts. AI assistance is not an independent mathematical validation. Responsibility for the final content and its verification remains with the author.

Conflicts of Interest

The author declares no conflict of interest.

Appendix A. Supplementary Fixed-Height and High-Order Consequences

The results in this section are logically downstream from the smoothing theorem. They are not used in the proof of Theorem 1 or in the density transfer. Their purpose is to describe what the same beta–Widder family sees when the order tends to infinity at a fixed spatial point, and to record the resulting prime-side and generating-function reformulations.

Appendix A.1. Superdiagonal Localization and High-Order Witnesses

The preceding estimate leaves open the regime in which the beta kernel becomes microscopic. In that regime one should not expect a further unconditional positivity theorem: nonreal reflected zeros are exponentially amplified by high Widder orders. The following proposition makes this precise for the genus-zero framework used above.
For a reflected parameter w and x > 0 put
Q w ( x ) : = w ( x + w ) 2 .
If w = r e i ϕ with | ϕ | < π / 2 , then
Q w ( x ) = r x 2 + 2 x r cos ϕ + r 2 .
For a positive real parameter one always has Q w ( x ) ≤ ( 4 x ) − 1 , whereas for a nonreal parameter
Q w ( r ) = 1 2 r ( 1 + cos ϕ ) = 1 4 r cos 2 ( ϕ / 2 ) > 1 4 r .
Theorem A1 
(A nonreal zero forces arbitrarily high negative orders). Let
G ( x ) = G ( 0 ) ∏ j ( 1 + x / w j ) , ∑ j | w j | − 1 < ∞ ,
be a real genus-zero product whose reflected parameters satisfy ℜ w j > 0 and occur in conjugate pairs. Put F = 2 G ′ / G . If at least one w j is nonreal, then there exists x * > 0 and infinitely many integers m → ∞ for which
W m [ F ] ( x * ) < 0 .
More precisely, one can choose x * , a nonreal conjugate pair w * , w * ¯ of multiplicity ν ≥ 1 , a number Q * > 0 , an angle θ * ¬ ≡ 0 ( mod 2 π ) , and 0 < ρ < 1 such that
W m [ F ] ( x * ) 2 ( 2 m − 1 ) ! = 2 ν Q * m cos ( m θ * ) + O ( ( ρ Q * ) m ) .
Proof. 
Choose one nonreal parameter w 0 = r 0 e i ϕ 0 . At x 0 = r 0 , (A2) shows that Q w 0 ( x 0 ) > ( 4 x 0 ) − 1 , while every positive real parameter has Q w ( x 0 ) ≤ ( 4 x 0 ) − 1 . Moreover Q w j ( x 0 ) ≪ x 0 | w j | − 1 as | w j | → ∞ ; hence the maximum of Q w j ( x 0 ) is attained, and every maximizing class is nonreal.
On a sufficiently small compact interval about x 0 , only finitely many conjugate-pair classes can compete with this maximum. Indeed the tail is uniformly small there, by ∑ j | w j | − 1 < ∞ . For two distinct classes the functions Q w ( x ) in (A1) are distinct real-analytic functions: equality identically would force the same r and the same ℜ w , hence the same conjugate pair. Their tie points are therefore discrete. We may consequently choose x * arbitrarily near x 0 so that one nonreal conjugate pair w * , w * ¯ is the unique maximizing class. We also choose x * ≠ | w * | .
Write
w * ( x * + w * ) 2 = Q * e i θ * .
For w * = r e i ϕ with 0 < | ϕ | < π / 2 , the argument is zero exactly when x * = r : indeed arg ( x * + w * ) = ϕ / 2 is equivalent to x * = r . Thus our choice gives θ * ≠ 0 . Uniqueness of the maximizing class and uniform control of the tail give a number ρ < 1 such that the sum of all remaining terms in (12) is O ( ( ρ Q * ) m ) . The dominant conjugate pair contributes 2 ν Q * m cos ( m θ * ) , proving (A4).
Finally, if θ * / ( 2 π ) is irrational, the sequence m θ * ( mod 2 π ) is dense; if it is rational and nonzero, it is periodic and contains an angle with negative cosine. In either case there are infinitely many m for which cos ( m θ * ) ≤ − c for some c > 0 . For all sufficiently large such m, the exponentially smaller remainder in (A4) cannot change the sign. This proves (A3).    □
For the Riemann xi-function all reflected parameters satisfy ℜ w ρ > 0 , since γ > 14 and | β − 1 / 2 | < 1 / 2 . Hence Theorem A1 applies directly.
Corollary A1 
(Eventual-in-order criterion for RH). The following are equivalent:
1.
the Riemann hypothesis holds;
2.
for every x > 0 there exists an integer M x such that
W m [ F ξ ] ( x ) ≥ 0 ( m ≥ M x ) ;
3.
for every x > 0 there exists an integer M x such that
A m ′ ( x ) ≥ 0 ( m ≥ M x ) .
If RH is false, there is in fact a single x * > 0 at which both inequalities fail for infinitely many arbitrarily large orders.
Proof. 
Under RH, F ξ is Stieltjes and every Widder inequality is nonnegative. Conversely, if RH is false then some reflected parameter w ρ is nonreal, so Theorem A1 gives a fixed x * and infinitely many negative Widder orders. The equivalence with the derivative statement uses
A m ′ ( x ) = x m − 1 2 ( 2 m − 1 ) ! B m W m [ F ξ ] ( x ) ,
whose prefactor is positive.    □
Remark A1 
(Interpretation of the superdiagonal barrier). The beta density p m ( y ) concentrates at y = 1 on the scale m − 1 / 2 . Indeed, uniformly for z in compact subsets of C ,
1 m p m 1 + z m ⟶ 1 2 π e − z 2 .
Thus at x = T 2 the ordinate window has width T / m , while a horizontal displacement δ = β − 1 / 2 enters on the amplified scale m δ / T . Theorem 2 controls the broad kernel regime. Theorem A1 shows why the opposite, microscopic regime cannot be made unconditionally positive without resolving RH itself.

Appendix A.2. An Exact Prime-Side High-Order Criterion

The preceding high-order witness theorem can be transported through the Guinand–Weil formula to a criterion involving only prime powers and values of − ζ ′ / ζ in its absolutely convergent half-plane. This also identifies quantitatively the cancellation that is missing from a purely absolute-value estimate on the prime side.
For m ≥ 1 put
Φ m ( v ) : = 1 2 π ∫ − ∞ ∞ p m ( y ) e − i v y d y ( v ∈ R ) .
Since p m is even, Φ m is real and even. For v ≥ 0 , closing the contour in the lower half-plane shows that
Φ m ( v ) = e − v R m ( v ) ,
where R m is the real polynomial of degree 2 m − 1 defined by
R m ( v ) : = − i e v Res z = − i z 2 m e − i v z B m ( 1 + z 2 ) 2 m .
For example,
R 1 ( v ) = 1 − v 4 , R 2 ( v ) = v 3 − 6 v 2 + 3 v + 3 16 .
By scaling,
g m , T ( u ) = T Φ m ( T | u | ) = T e − T | u | R m ( T | u | ) .
For fixed T ≥ 2 define the prime functional
P m ( T ) : = 2 T ∑ n = 2 ∞ Λ ( n ) n T + 1 / 2 R m ( T log n ) .
The sum converges absolutely for each fixed m. If
Q ( s ) : = − ζ ′ ζ ( s ) = ∑ n = 2 ∞ Λ ( n ) n s , ℜ s > 1 ,
and D = − d / d s , then equivalently
P m ( T ) = 2 T R m ( T D ) Q ( s ) s = T + 1 / 2 .
Thus every quantity in P m ( T ) is evaluated strictly inside the ordinary Dirichlet-series half-plane.
Proposition A1 
(Spectral radius of the fixed-T Widder sequence). For fixed T > 0 put
R ( T ) : = 4 T 2 max ρ ∈ Z + w ρ ( T 2 + w ρ ) 2 .
Then the maximum is attained and
lim sup m → ∞ T 2 A m ′ ( T 2 ) 1 / m = R ( T ) .
Under RH, R ( T ) ≤ 1 for every T > 0 . If RH is false, then R ( T ) > 1 on a nonempty open interval of T-values.
Proof. 
Set
q ρ ( T ) : = w ρ ( T 2 + w ρ ) 2 .
For fixed T, one has ∑ ρ | q ρ ( T ) | < ∞ and q ρ ( T ) → 0 , so Q ( T ) : = max ρ | q ρ ( T ) | is attained. Put S m ( T ) = ∑ ρ q ρ ( T ) m . The generating function
∑ m ≥ 1 S m ( T ) z m = ∑ ρ q ρ ( T ) z 1 − q ρ ( T ) z
converges normally for | z | < Q ( T ) − 1 . At a point z = q * − 1 corresponding to a maximizing value q * , the finitely many identical maximizing terms give a genuine pole; all other terms are analytic there after separating the uniformly small tail. Hence the radius of convergence is exactly Q ( T ) − 1 . Cauchy–Hadamard therefore gives
lim sup m → ∞ | S m ( T ) | 1 / m = Q ( T ) .
Since
T 2 A m ′ ( T 2 ) = T 2 m B m S m ( T ) , B m − 1 / m ⟶ 4 ,
we obtain (A12).
Under RH every w ρ > 0 , and 4 T 2 w ρ / ( T 2 + w ρ ) 2 ≤ 1 by the arithmetic–geometric mean inequality. Conversely, if w = r e i ϕ is nonreal, then at T 2 = r , (A2) gives 4 T 2 Q w ( T 2 ) > 1 . Continuity preserves the strict inequality on a neighborhood, proving the last assertion.    □
Lemma A1 
(Fixed-T control of the nonprime explicit-formula terms). Fix T ≥ 2 . Define
H m ( T ) : = 2 h m , T ( i / 2 ) − g m , T ( 0 ) log π + 1 2 π ∫ − ∞ ∞ h m , T ( r ) Γ ′ Γ 1 4 + i r 2 d r .
Then, for every m ≥ 1 ,
2 T 2 A m ′ ( T 2 ) = H m ( T ) − P m ( T ) ,
and
sup m ≥ 1 | H m ( T ) | < ∞ .
Consequently, as m → ∞ ,
4 m B m H m ( T ) = O T ( m − 1 / 2 ) .
Proof. 
Because h m , T is even and real on R , while ψ ( z ¯ ) = ψ ( z ) ¯ for ψ = Γ ′ / Γ , pairing r with − r shows that
∫ − ∞ ∞ h m , T ( r ) Γ ′ Γ 1 4 + i r 2 d r = ∫ − ∞ ∞ h m , T ( r ) ℜ Γ ′ Γ 1 4 + i r 2 d r .
Thus the identity (A14) is exactly (51)–(52), because (A8) identifies the prime term with P m ( T ) .
It remains to prove a bound uniform in the order. First,
g m , T ( 0 ) = T 2 π ∫ − ∞ ∞ p m ( y ) d y = T c m 2 π = O T ( 1 ) ,
since 1 ≤ c m ≤ π / 2 . Next put u = ( 2 T ) − 1 ≤ 1 / 4 . Then
| h m , T ( i / 2 ) | = 1 4 m B m 4 u 2 ( 1 − u 2 ) 2 m .
The quantity in parentheses is strictly less than 1, while ( 4 m B m ) − 1 = O ( m ) by Stirling’s formula. Thus h m , T ( i / 2 ) = O T ( 1 ) (in fact it decays exponentially with m).
For the gamma-factor term we use the standard bound
Γ ′ Γ 1 4 + i r 2 ≪ 1 + log ( 2 + | r | ) , r ∈ R .
After r = T y it is therefore enough to bound
T ∫ − ∞ ∞ p m ( y ) 1 + log ( 2 + T | y | ) d y
uniformly in m. The part | y | ≤ 1 is O T ( 1 ) because ∫ R p m ( y ) d y = c m = O ( 1 ) . For m ≥ 2 and y ≥ 1 , log ( 2 + T y ) ≪ T y , and the beta integral gives
∫ 0 ∞ y p m ( y ) d y = B ( m + 1 , m − 1 ) 2 B ( m , m ) = m 2 ( m − 1 ) ≤ 1 .
The case m = 1 is a single fixed integrable function and is absorbed into the constant. This proves (A15). Finally 4 m B m = 2 π m − 1 / 2 ( 1 + O ( m − 1 ) ) , so (A16) follows.    □
Theorem A2 
(Prime-side root-growth criterion for RH). The Riemann hypothesis is equivalent to
lim sup m → ∞ | P m ( T ) | 1 / m ≤ 1 for every fixed T ≥ 2 .
If RH is false, one may choose a fixed T > 14 and constants R * > 1 , θ * ¬ ≡ 0 ( mod 2 π ) , ν ≥ 1 , and 0 < ρ < 1 such that, along all integers m ≥ 1 ,
P m ( T ) = − 4 ν B m R * 4 m cos ( m θ * ) + O 1 B m ρ R * 4 m + O T ( 1 ) .
In particular
lim sup m → ∞ | P m ( T ) | 1 / m = R * > 1 .
Proof. 
By Lemma A1, the Guinand–Weil formula gives the exact identity
2 T 2 A m ′ ( T 2 ) = H m ( T ) − P m ( T ) , H m ( T ) = O T ( 1 ) ,
with a constant independent of m.
Assume RH. Then every Γ ρ = γ is real and
p m ( γ / T ) = 1 B m 4 m 4 ( γ / T ) 2 ( 1 + ( γ / T ) 2 ) 2 m .
The quantity in parentheses lies in ( 0 , 1 ] , and its sum over positive zero ordinates is finite, since it is O T ( γ − 2 ) . Moreover ( B m 4 m ) − 1 = O ( m ) . Hence
T 2 A m ′ ( T 2 ) = O T ( m ) ,
and (A14) implies P m ( T ) = O T ( m ) . This proves (A17).
Conversely suppose RH is false. In the proof of Theorem A1 choose x * = T 2 sufficiently close to the modulus of the selected nonreal reflected parameter so that, in addition to unique dominance,
R * : = 4 T 2 Q * > 1 .
For the xi-function T may be taken larger than 14. Since
p m ( Γ / T ) = 1 B m T 2 w ( T 2 + w ) 2 m ,
the dominant-pair argument gives
T 2 A m ′ ( T 2 ) = 2 ν B m R * 4 m cos ( m θ * ) + O 1 B m ρ R * 4 m .
Substitution into (A14) proves (A18). Finally B m − 1 = 4 m m ( 2 π ) − 1 ( 1 + O ( m − 1 ) ) , while | cos ( m θ * ) | is bounded below by a positive constant for infinitely many m. This gives (A19) and completes the converse.    □
The next proposition quantifies the horizontal-contour bound obtained without using cancellation between prime powers.
Proposition A2 
(Optimized absolute-convergence bound). For every fixed T ≥ 2 ,
lim sup m → ∞ | P m ( T ) | 1 / m ≤ M ( T ) : = 2 1 + 1 − T − 2 .
In particular
M ( T ) = 1 + 1 4 T 2 + O ( T − 4 ) .
Thus the absolute-value method leaves a strictly positive exponential gap between the unconditional bound and the RH threshold 1.
Proof. 
Fix a > 1 / 2 sufficiently close to 1 / 2 that a / T ≤ 1 / 3 , and put σ = a / T < 1 / 2 . Shifting the Fourier contour to ℑ r = − a as in (55) gives
| g m , T ( u ) | ≤ T e − a u 2 π ∫ − ∞ ∞ | p m ( y − i σ ) | d y .
Set
R σ ( y ) : = 4 ( y 2 + σ 2 ) ( 1 + y 2 − σ 2 ) 2 + 4 y 2 σ 2 .
Then
| p m ( y − i σ ) | = R σ ( y ) m B m 4 m .
For 0 ≤ σ ≤ 1 / 3 a one-variable maximization, with t = y 2 , gives
sup y ∈ R R σ ( y ) = 2 1 + 1 − 4 σ 2 .
Indeed the interior critical point satisfies t + σ 2 = 1 − 4 σ 2 , and substitution yields (A22). Since R σ ( y ) = O σ ( y − 2 ) at infinity, choose a fixed Y so large that the tail is bounded by C σ y − 2 with C σ / Y 2 strictly smaller than the maximum in (A22). Splitting at | y | = Y then shows
∫ − ∞ ∞ R σ ( y ) m d y ≪ σ 2 1 + 1 − 4 σ 2 m .
Together with ( B m 4 m ) − 1 = O ( m ) this yields
| g m , T ( u ) | ≪ T , a T m e − a u 2 1 + 1 − 4 a 2 / T 2 m .
Since a > 1 / 2 ,
∑ n = 2 ∞ Λ ( n ) n 1 / 2 + a < ∞ .
Applying this to (A9) and taking mth roots gives
lim sup m → ∞ | P m ( T ) | 1 / m ≤ 2 1 + 1 − 4 a 2 / T 2 .
Letting a ↓ 1 / 2 proves (A20); the expansion (A21) is immediate.    □
Remark A2 
(What prime cancellation would have to prove). Theorem A2 and Proposition A2 isolate the remaining arithmetic problem sharply. Absolute convergence reaches the boundary M ( T ) > 1 , corresponding to shifting just beyond the line required to sum Λ ( n ) n − 1 / 2 − a absolutely. Proving RH through this route would require cancellation in the oscillatory prime functional strong enough to replace M ( T ) by 1 for every fixed T ≥ 2 . This is not supplied by the present argument and should not be interpreted as a proof of RH.

Appendix A.3. Summing the Widder Order: a Prime Generating-Function Criterion

The preceding root-growth criterion can be packaged into a single generating function. Besides being more economical, this formulation identifies the absolute-convergence barrier geometrically.
Put
q ( y ) : = y 2 ( 1 + y 2 ) 2 .
Since
1 B ( m , m ) = m 2 2 m m ,
the central-binomial generating function gives, for | 4 z q ( y ) | < 1 ,
∑ m ≥ 1 p m ( y ) z m = z q ( y ) 1 − 4 z q ( y ) 3 / 2 .
We denote the right-hand side by
K z ( y ) : = z q ( y ) 1 − 4 z q ( y ) 3 / 2 ,
where the branch is chosen to equal 1 at z = 0 .
For fixed T ≥ 2 define the two Taylor germs
A T ( z ) : = ∑ m ≥ 1 T 2 A m ′ ( T 2 ) z m , P T ( z ) : = ∑ m ≥ 1 P m ( T ) z m .
If
a ρ ( T ) : = T 2 w ρ ( T 2 + w ρ ) 2 ,
then, in the disk of absolute convergence,
A T ( z ) = ∑ ρ ∈ Z + z a ρ ( T ) 1 − 4 z a ρ ( T ) 3 / 2 .
In particular Proposition A1 may be restated as
rad ( A T ) = R ( T ) − 1 .
The same summation can be performed directly on the prime side. For 0 < a ≤ 1 / 3 set
r ( a ) : = 1 + 1 − 4 a 2 2 .
The maximization in (A22) says exactly that, in this range,
sup y ∈ R 4 | q ( y − i a ) | = r ( a ) − 1 .
The restriction a ≤ 1 / 3 is more than sufficient below and keeps us inside the range in which the interior maximizer used in (A22) is valid.
Theorem A3 
(Prime generating germ and the unit-disk RH criterion). Fix T ≥ 2 and put
r abs ( T ) : = 1 + 1 − T − 2 2 = M ( T ) − 1 .
Then the following hold.
(i)The prime Taylor germ P T is holomorphic for | z | < r abs ( T ) . More precisely, if
1 2 T < a ≤ 1 3 , | z | < r ( a ) ,
then
P T ( z ) = T π ∫ − ∞ ∞ K z ( y − i a ) Q 1 2 + a T + i T y d y ,
where Q ( s ) = − ζ ′ ( s ) / ζ ( s ) and the integral is absolutely convergent. Thus the integral representation in (A30) uses Q only in the half-plane ℜ s > 1 .
(ii)RH is equivalent to the assertion that, for every fixed T ≥ 2 , the germ P T extends holomorphically to the full unit disk | z | < 1 . It is already enough to require this for every rational T > 14 .
(iii)If RH is false, one can choose a rational T > 14 for which P T has a pair of conjugate algebraic singularities inside the unit disk. After choosing T so that one nonreal reflected pair is uniquely dominant, these singularities occur at
z * = 1 4 a * ( T ) , z * ¯ , | z * | < 1 ,
and are of local type ( 1 − z / z * ) − 3 / 2 and its conjugate.
Proof. 
The identity (A23) follows from
∑ m ≥ 0 2 m m t m = ( 1 − 4 t ) − 1 / 2
by applying 1 2 t d / d t and then taking t = z q ( y ) . Summing (48) therefore gives (A25) wherever the interchange is absolutely convergent. Equation (A26) also follows directly from Proposition A1 and Cauchy–Hadamard.
For the prime side, let
K ^ z ( v ) : = 1 2 π ∫ − ∞ ∞ K z ( y ) e − i v y d y .
We justify the contour deformation in the full strip, not merely on its terminal line. Let
S a : = { y ∈ C : − a ≤ ℑ y ≤ 0 } .
For 0 ≤ σ ≤ a , formula (A28) gives
sup t ∈ R 4 | q ( t − i σ ) | = r ( σ ) − 1 ≤ r ( a ) − 1 ,
because r ( σ ) is decreasing on [ 0 , 1 / 3 ] . Hence, if | z | < r ( a ) ,
sup y ∈ S a | 4 z q ( y ) | ≤ | z | r ( a ) < 1 .
The poles of q at ± i lie outside S a since a < 1 / 2 . Moreover (A32) places 1 − 4 z q ( y ) in the open disk centered at 1 of radius | z | / r ( a ) < 1 ; thus it never meets the nonpositive real axis or 0. The principal branch of ( 1 − 4 z q ( y ) ) − 3 / 2 is therefore holomorphic throughout the strip and agrees with the branch normalized to 1 at z = 0 . Uniformly for − a ≤ ℑ y ≤ 0 one also has K z ( y ) = O z , a ( | ℜ y | − 2 ) as | ℜ y | → ∞ . The vertical sides of the usual rectangular contour consequently vanish, and for v > 0 Cauchy’s theorem gives the rigorous shift
K ^ z ( v ) = e − a v 2 π ∫ − ∞ ∞ K z ( y − i a ) e − i v y d y .
Using
P m ( T ) = 2 T ∑ n ≥ 2 Λ ( n ) n Φ m ( T log n )
and summing first over m now yields
P T ( z ) = 2 T ∑ n ≥ 2 Λ ( n ) n K ^ z ( T log n ) .
Because a T > 1 / 2 , the Dirichlet series
∑ n ≥ 2 Λ ( n ) n − 1 / 2 − a T − i T y = Q 1 2 + a T + i T y
is absolutely convergent. Fubini’s theorem therefore gives (A30). Given any | z | < r abs ( T ) , one may choose a ∈ ( 1 / ( 2 T ) , 1 / 3 ] sufficiently close to 1 / ( 2 T ) so that | z | < r ( a ) . (The interval is nonempty because T ≥ 2 .) This proves (i).
Assume RH. Theorem A2 gives
lim sup m → ∞ | P m ( T ) | 1 / m ≤ 1 ,
so the Taylor series in (A24) is holomorphic throughout | z | < 1 for every T ≥ 2 .
Conversely, suppose that all the stated prime germs are holomorphic in the unit disk. Their Taylor series at the origin then have radius at least one, so Cauchy–Hadamard gives
lim sup m → ∞ | P m ( T ) | 1 / m ≤ 1 .
Theorem A2 yields RH if this holds for every T ≥ 2 . If RH were false, Proposition A1 and the proof of Theorem A2 give a nonempty open interval of T > 14 on which the prime root growth is larger than one. That interval contains a rational number, proving the countable version of (ii).
Finally suppose RH is false and choose, as in the high-order witness proof, a rational T > 14 at which one nonreal conjugate reflected pair is uniquely dominant. Write a * = a ρ * ( T ) for one member of that pair and let ν ≥ 1 be its multiplicity. Then
z * = ( 4 a * ) − 1 , | z * | = R ( T ) − 1 < 1 .
Because a ρ ( T ) → 0 along the zero set, unique dominance implies that there is η > 0 such that every nonidentical reflected parameter a ρ ( T ) satisfies | 4 a ρ ( T ) z * | ≤ 1 − η . After removing the finitely many terms corresponding to the selected multiplicity, the remaining series in (A25) is normally convergent in a sufficiently small closed disk about z * . Indeed ∑ ρ | a ρ ( T ) | < ∞ , and for the tail the factors ( 1 − 4 z a ρ ( T ) ) − 3 / 2 are uniformly bounded there. Hence the remainder is holomorphic near z * . The singular part is exactly
ν z a * ( 1 − 4 z a * ) 3 / 2 = ν z a * ( 1 − z / z * ) − 3 / 2 .
Since z * a * = 1 / 4 , its analytic numerator is nonzero at z * , so this is a genuine algebraic branch singularity of local type ( 1 − z / z * ) − 3 / 2 . The conjugate argument applies at z * ¯ .
On the other hand Lemma A1 gives
P T ( z ) = H T ( z ) − 2 A T ( z ) , H T ( z ) : = ∑ m ≥ 1 H m ( T ) z m ,
and (A15) makes H T holomorphic in | z | < 1 . A holomorphic function cannot cancel the nonintegral local branch term just displayed. Thus P T has the asserted conjugate branch points. This proves (iii).    □
Remark A3 
(The cancellation annulus). The gap left by absolute convergence is now visible directly in the generating variable. The half-plane representation (A30) reaches only
| z | < r abs ( T ) = 1 − 1 4 T 2 + O ( T − 4 ) ,
whereas RH is equivalent to holomorphy throughout | z | < 1 . Thus this route must continue the prime germ across the thin annulus
r abs ( T ) ≤ | z | < 1 .
The thickness is 1 / ( 4 T 2 ) + O ( T − 4 ) , exactly dual to the exponential gap M ( T ) − 1 in Proposition A2. Crossing that annulus cannot be justified by absolute convergence of the prime Dirichlet series alone; it requires additional cancellation or equivalent information about zeros.

Appendix A.4. Rational Normalization and a Semicircular Formula

There is an even simpler order-generating kernel if the beta normalization is removed coefficient by coefficient. Define
A ˜ T ( z ) : = ∑ m ≥ 1 4 m B m T 2 A m ′ ( T 2 ) z m , P ˜ T ( z ) : = ∑ m ≥ 1 4 m B m P m ( T ) z m .
Then
L z ( y ) : = ∑ m ≥ 1 4 m B m p m ( y ) z m = 4 z q ( y ) 1 − 4 z q ( y ) .
Thus the algebraic 3 / 2 -singularities in (A23) become simple poles after normalization. On the zero side, put
r ρ ( T ) : = 4 T 2 w ρ ( T 2 + w ρ ) 2 .
Then, in the disk of convergence,
A ˜ T ( z ) = ∑ ρ ∈ Z + z r ρ ( T ) 1 − z r ρ ( T ) .
The Fourier transform of (A34) is elementary. For real 0 < z < 1 , write
a = z , b = 1 − z .
Then
L z ( y ) = 4 a 2 y 2 ( y − a ) 2 + b 2 ( y + a ) 2 + b 2 .
Closing in the lower half-plane for v > 0 and taking the residues at a − i b and − a − i b gives
L ^ z ( v ) : = 1 2 π ∫ − ∞ ∞ L z ( y ) e − i v y d y = a b e − b v a cos ( a v ) − b sin ( a v ) .
Definition A1 
(Branch and continuation convention). Let
D : = C ∖ ( − ∞ , 0 ] ∪ [ 1 , ∞ ) .
On D let
a ( z ) = z , b ( z ) = 1 − z
be the branches that are positive for 0 < z < 1 , and put
s ± ( z ) = 1 2 + T b ( z ) ± i T a ( z ) .
Since Q ( s ) = − ζ ′ ( s ) / ζ ( s ) is meromorphic on C , the expression
Q T ( z ) : = T a ( z ) b ( z ) ( a ( z ) − i b ( z ) ) Q ( s + ( z ) ) + ( a ( z ) + i b ( z ) ) Q ( s − ( z ) )
is meromorphic on D , with poles only where one of the composed arguments meets a pole of Q. Whenever we refer below to continuation of the prime generating germ by the semicircular formula, we mean the unique meromorphic continuation obtained from (A38) along a path in D starting in the absolute-convergence region and avoiding its isolated poles. This convention makes no assertion that a pole can be crossed holomorphically.
Theorem A4 
(Semicircular logarithmic-derivative formula). Fix T ≥ 2 and let r abs ( T ) be as in (A29). For real
0 < z < r abs ( T ) ,
the Taylor series defining P ˜ T ( z ) converges absolutely. Let a = a ( z ) = z , b = b ( z ) = 1 − z as in Definition A1, and write
s ± ( z ) : = 1 2 + T b ± i T a .
Then ℜ s ± > 1 and
P ˜ T ( z ) = T a b ( a − i b ) Q ( s + ( z ) ) + ( a + i b ) Q ( s − ( z ) ) .
For real z this is equivalently
P ˜ T ( z ) = 2 T a b ℜ ( a − i b ) Q 1 2 + T b + i T a .
The meromorphic function Q T in (A38) is the continuation of this Taylor germ. On the larger real interval
0 < z < 1 − 1 4 T 2 ,
one still has ℜ s ± > 1 , so Q T ( z ) is represented by the absolutely convergent prime Dirichlet series for Q. Beyond that endpoint the same formula is only a meromorphic continuation and no absolute prime-series claim is made.
As real z increases from 0 to 1, the points s ± ( z ) trace the two halves of the right semicircle
| s − 1 / 2 | = T , ℜ s > 1 / 2 .
Proof. 
Equation (A34) is the geometric series applied to 4 z q ( y ) . Formula (A36) follows by summing (48) after multiplication by 4 m B m z m .
For (A37), the lower-half-plane poles are
y 1 = a − i b , y 2 = − a − i b .
A direct residue calculation gives
L ^ z ( v ) = a 2 b ( a − i b ) e − i v ( a − i b ) − ( − a − i b ) e − i v ( − a − i b ) ,
which simplifies to (A37).
For 0 < z < r abs ( T ) , the root-growth bound (A20) and ( 4 m B m ) 1 / m → 1 show that the Taylor series defining P ˜ T ( z ) converges absolutely. The same shifted-contour majorant used in Proposition A2, now summed in m through the geometric identity (A34), justifies summing the prime-side formula in this range. Thus
P ˜ T ( z ) = 2 T a b ∑ n ≥ 2 Λ ( n ) n 1 / 2 + T b a cos ( T a log n ) − b sin ( T a log n ) = T a b ( a − i b ) Q ( s + ( z ) ) + ( a + i b ) Q ( s − ( z ) ) ,
which proves (A41) on the Taylor-germ interval. Since r abs ( T ) < 1 − 1 / ( 4 T 2 ) , the right-hand side is holomorphic in a complex neighborhood of every real point up to the latter endpoint and is represented there by the absolutely convergent Dirichlet series for Q. The identity theorem therefore identifies (A38) with the meromorphic continuation of the Taylor germ along every admissible path described in Definition A1. Finally a 2 + b 2 = 1 gives the semicircle identity.    □
Corollary A2 
(Real pole detector for an off-critical zero). Suppose RH is false and let
ρ = 1 2 + δ + i γ , δ > 0 ,
be a nontrivial zero. Put
T ρ : = γ 2 + δ 2 , z ρ : = γ 2 γ 2 + δ 2 .
Then 0 < z ρ < 1 ,
s + ( z ρ ) = ρ , r ρ ( T ρ ) = z ρ − 1 > 1 ,
and A ˜ T ρ has a simple pole at the real point z = z ρ . The meromorphic continuation of P ˜ T ρ specified in Definition A1 has a nonremovable simple pole there as well. Equivalently, s + ( z ρ ) = ρ makes the Q ( s + ( z ) ) term in (A38) singular with a nonzero prefactor.
Consequently RH is equivalent to the absence of such interior real poles for every T > 14 . This is only a reformulation of the zero-free condition, not an independent proof of it.
Proof. 
With a = γ / T ρ and b = δ / T ρ , one has a 2 + b 2 = 1 , z ρ = a 2 , and (A40) gives s + ( z ρ ) = ρ . Moreover
w ρ = ( γ − i δ ) 2 = T ρ 2 ( a − i b ) 2
and
T ρ 2 + w ρ = 2 T ρ 2 a ( a − i b ) .
Substitution into (A35) yields
r ρ ( T ρ ) = 1 a 2 = 1 z ρ > 1 .
The corresponding term in (A36) is therefore z / z ρ ( 1 − z / z ρ ) − 1 , giving a simple pole whose residue at z = z ρ is − z ρ . The upper-half-plane partner 1 − ρ ¯ has the conjugate reflected parameter and, at the same ( T ρ , z ρ ) , produces the identical real denominator and the same residue − z ρ (multiplied by the zero multiplicity, if necessary). Hence the paired principal parts add rather than cancel. All other zero summands whose reflected parameters differ from this value are holomorphic at z ρ ; summands with the same parameter merely add another copy of the same-sign principal part. Thus cancellation at the real pole is impossible.
There are two equivalent ways to see the same pole on the prime side. First, multiplying (A14) by 4 m B m z m and summing shows that the difference between P ˜ T and − 2 A ˜ T is holomorphic for | z | < 1 , because 4 m B m H m ( T ) = O T ( m − 1 / 2 ) . Second, in the continuation formula (A38), the map z ↦ s + ( z ) is holomorphic near z ρ with nonzero derivative, while Q has a pole at s = ρ and the coefficient multiplying Q ( s + ( z ) ) is nonzero. Thus the pole is nonremovable. The last assertion follows from the functional equation, which pairs every zero with ℜ ρ < 1 / 2 with one having ℜ ρ > 1 / 2 .    □
Remark A4 
(Where the arithmetic barrier sits on the semicircle). The absolutely convergent prime formula (A41) reaches exactly the portion of the semicircle with ℜ s > 1 . Its real endpoint is
z = 1 − 1 4 T 2 .
On the other hand an off-critical zero in the critical strip has 0 < δ < 1 / 2 and therefore
z ρ = 1 − δ 2 T ρ 2 > 1 − 1 4 T ρ 2 .
Thus every possible off-critical pole occurs precisely in the narrow terminal part of the semicircle that is inaccessible to absolute convergence of the prime Dirichlet series. Reaching that terminal arc is equivalent to obtaining new information about Q ( s ) in 1 / 2 < ℜ s ≤ 1 ; algebraic resummation alone does not cross it.

Appendix A.5. Verified-height Transfer and the Terminal Zero-Free Collar

The semicircular formulation also converts existing zero information into a sharp statement about the order-generating variable. The first observation uses only the rigorous verification of RH through a finite height.
Theorem A5 
(Verified-height transfer to the exact root threshold). Let
H * : = 3 · 10 12 ,
so that every nontrivial zero with 0 < γ ≤ H * is known to lie on the critical line by Platt–Trudgian [5]. Then, for every fixed T with
0 < T ≤ H * − 1 2 ,
one has
R ( T ) ≤ 1 .
Consequently
lim sup m → ∞ | T 2 A m ′ ( T 2 ) | 1 / m ≤ 1 ,
and, for 2 ≤ T ≤ H * − 1 / 2 ,
lim sup m → ∞ | P m ( T ) | 1 / m ≤ 1 .
Equivalently, the normalized zero generating function A ˜ T ( z ) is holomorphic for | z | < 1 throughout the range (A47).
Proof. 
Critical-line zeros have δ = 0 , and hence | r ρ ( T ) | ≤ 1 by the arithmetic–geometric mean inequality. Consider a hypothetical off-critical zero
ρ = 1 2 + δ + i γ , 0 < δ < 1 2 .
By the verified-height input, necessarily γ > H * . A direct calculation from (A35) gives
| T 2 + w ρ | 2 − 4 T 2 | w ρ |
= − T 2 − 2 T δ + δ 2 + γ 2 − T 2 + 2 T δ + δ 2 + γ 2 .
Since γ > T , the inequality | r ρ ( T ) | > 1 would force the first factor in (A51) to be negative, and therefore
γ 2 < T 2 + 2 T δ − δ 2 < ( T + δ ) 2 .
Thus γ < T + δ < T + 1 / 2 ≤ H * , a contradiction. Hence every zero satisfies | r ρ ( T ) | ≤ 1 , proving (A48). Equation (A49) follows from Proposition A1. The exact relation (A14), together with H m ( T ) = O T ( 1 ) , then gives (A50). Finally, ∑ ρ | r ρ ( T ) | < ∞ for fixed T, so (A36) converges normally on every compact subset of | z | < 1 .    □
The next statement quantifies the remaining real-axis collar using any classical zero-free region.
Proposition A3 
(Zero-free penetration of the terminal semicircle). Assume that, for some R > 0 and t 0 ≥ 2 ,
ζ ( σ + i t ) ≠ 0 | t | ≥ t 0 , σ ≥ 1 − 1 R log | t | .
For T > 0 put
z R ( T ) : = 1 − 1 T 2 1 2 − 1 R log T 2 .
If T ≥ t 0 2 + 1 / 4 and 1 / ( R log T ) < 1 / 2 , then the right-hand side of (A41) analytically continues the real generating germ throughout
0 < z < z R ( T ) .
Moreover, if an off-critical zero ρ = 1 / 2 + δ + i γ gives the real pole ( T ρ , z ρ ) of Corollary A2 and γ ≥ t 0 , then
z ρ > z R ( T ρ ) .
Proof. 
Write a = z , b = 1 − z . For z ≤ 1 − 1 / ( 4 T 2 ) one has ℜ s ± ≥ 1 , so continuation from the original Dirichlet-series range is standard. On the remaining interval up to z R ( T ) ,
T b ≥ 1 2 − 1 R log T , ℜ s ± ≥ 1 − 1 R log T .
Also | ℑ s ± | = T a ≤ T . Since the terminal interval begins at z = 1 − 1 / ( 4 T 2 ) , its imaginary ordinate is at least T 2 − 1 / 4 ≥ t 0 . Because t ↦ 1 / ( R log t ) is decreasing,
1 − 1 R log T ≥ 1 − 1 R log | ℑ s ± | ,
so (A53) excludes zeros throughout this part of the arc. Hence Q ( s ± ( z ) ) is analytic there and (A41) provides the claimed continuation.
For an off-critical zero, (A53) gives
δ < 1 2 − 1 R log γ .
Since T ρ = γ 2 + δ 2 > γ , one has 1 / ( R log γ ) > 1 / ( R log T ρ ) . Therefore
δ < 1 2 − 1 R log T ρ ,
and substitution into z ρ = 1 − δ 2 / T ρ 2 proves (A56).    □
Corollary A3 
(Current explicit collar). Using the Bellotti–Trudgian–Yang zero-free region
σ ≥ 1 − 1 4.896 log | t | , | t | ≥ 3 ,
Proposition A3 applies for T ≥ 4 with
z BTY ( T ) = 1 − 1 T 2 1 2 − 1 4.896 log T 2 .
Relative to the absolute-convergence endpoint z abs ( T ) = 1 − 1 / ( 4 T 2 ) , the unconditional gain is
z BTY ( T ) − z abs ( T ) = 1 T 2 1 4.896 log T − 1 4 . 896 2 ( log T ) 2 .
The published Mossinghoff–Trudgian–Yang region gives the same statements with 4.896 replaced by 5.558691 .
Corollary A4 
(Reduction to the unverified terminal collar). With H * = 3 · 10 12 , the prime-side criterion of Theorem A2 may be reduced to
RH ⟺ lim sup m → ∞ | P m ( T ) | 1 / m ≤ 1 for every fixed T > H * − 1 2 .
Likewise, using the Bellotti–Trudgian–Yang region, RH is equivalent to the absence of real poles of A ˜ T in the restricted set
T > H * , z BTY ( T ) < z < 1 .
The same statement with the published constant uses the corresponding z R ( T ) with R = 5.558691 .
Proof. 
Theorem A5 supplies the root-growth bound for every 2 ≤ T ≤ H * − 1 / 2 , so Theorem A2 leaves only the stated range. If RH is false, choose an off-critical zero with δ > 0 . The verified-height result forces γ > H * and hence T ρ = γ 2 + δ 2 > H * . Corollary A3 and Proposition A3 force its real pole to satisfy z ρ > z BTY ( T ρ ) . Conversely every such real pole comes from an off-critical zero by Corollary A2, so its absence is equivalent to RH.    □
Remark A5 
(Quantitative control below the verified height). A recent explicit estimate of Leong ([4], Corollary 3 and Table 2) uses the verified RH height to show, unconditionally, that
ζ ′ ζ ( σ + i t ) ≤ 31447 log t ( σ ≥ 0.51 , 15 ≤ t ≤ H * ) .
Consequently, on the real semicircle and in the same ordinate range, (A42) gives
| P ˜ T ( z ) | ≤ 62894 T z 1 − z log T
whenever z ≤ 1 − 10 − 4 / T 2 and T z ≥ 15 . Thus, for 16 ≤ T ≤ H * , an explicit logarithmic-derivative estimate penetrates 99.96 % of the real z-gap between 1 − 1 / ( 4 T 2 ) and 1; the remaining issue is not absolute convergence but control arbitrarily close to the critical line. This is a quantitative finite-height statement and does not extend RH beyond the verified height.
Corollary A5 
(Recovery of the ordinary zero count). For fixed a , L > 0 , uniformly for integers a x ≤ m ≤ L x as x → ∞ ,
A m ( x ) = N ( x ) + O a , L ( log x ) .
Proof. 
Put T = x . Theorem 1 and c m = 1 + O ( m − 1 ) give
A m ( T 2 ) = M ( T ) + O L log T + T log T m .
If m ≥ a T , the second error is O a ( log T ) . Apply (30) to replace M ( T ) by N ( T ) .    □
Remark A6 
(Meaning of the density ratio). Although S m is a positive sum, individual off-line blocks in A m need not be nonnegative in the range of Theorem 1. The ratio S m / A m is therefore not a probability or a literal partition of positive mass. Nevertheless, 0 ≤ S m ( T 2 ) ≤ R m ( T ) and (33) imply
0 ≤ S m ( T 2 ) A m ( T 2 ) ≤ 1 + O L ( T − 1 )
uniformly for 1 ≤ m ≤ L T 2 , once T is sufficiently large. The density theorem is an asymptotic comparison with an eventually positive normalizing sum.
Corollary A6 
(Application of Lamzouri’s stated proportion theorem). Using Theorem 1.1 of Lamzouri [13], Theorem 1 applies with the Montgomery–Taylor constant
C 0 = 3 2 − 1 2 cot 1 2 = 0.6725007036794116457 … .
Thus for every fixed L > 0 ,
lim inf x → ∞ inf m ∈ N 1 ≤ m ≤ L x S m ( x ) A m ( x ) ≥ C 0 .
The dependence on this external theorem is confined to the numerical value of p; the smoothed asymptotic and the general transfer theorem do not use it.
Remark A7 
(What this extension establishes). The construction links the Widder expressions to cumulative zero counts through an exact beta-kernel identity. The estimates are uniform for m ≤ L x , rather than only for fixed m. The density transfer itself is an Abel-summation consequence of (18); it does not improve C 0 . Positivity of A m ( x ) alone is positivity of an integral of a Widder expression and does not imply pointwise positivity. The derivative refinement in Theorem 2 is what yields pointwise positivity, for every fixed ε > 0 , throughout the asymptotic region m ≤ ( 4 − ε ) x log log x for sufficiently large x. Neither result supplies the full infinite hierarchy required for RH, and no explicit onset x 0 ( ε ) is asserted.

Appendix B. Finite-height Positivity in the Existing Stieltjes Framework

For a nonnegative smooth function f, membership in the finite Stieltjes class S k means W m [ f ] ≥ 0 for 1 ≤ m ≤ k ([1], Definition 1). Consider a real genus-zero product
G ( x ) = G ( 0 ) ∏ j ( 1 + x / w j ) , G ( 0 ) ≠ 0 , ∑ j | w j | − 1 < ∞ .
Nonreal parameters occur in conjugate pairs. With F = 2 G ′ / G , formula (12) applies. The following argument extends the quadratic calculation of Bondesson–Simon ([1], Section 4.1) by summation.
Lemma A2 
(Sector geometry). Let w = r e i ϕ with r > 0 and | ϕ | < π / 2 , and let x ≥ 0 . Then
arg w ( x + w ) 2 ≤ | ϕ | .
If x > 0 and ϕ ≠ 0 , the inequality is strict.
Proof. 
Assume first ϕ ≥ 0 and put ψ = arg ( x + w ) . Adding the nonnegative real number x moves the argument toward the positive real axis, so 0 ≤ ψ ≤ ϕ . Hence
− ϕ ≤ ϕ − 2 ψ ≤ ϕ .
This is (A63). If x > 0 and ϕ > 0 , then 0 < ψ < ϕ , which gives strictness. The case ϕ ≤ 0 follows by conjugation.    □
Theorem A6 
(Sector-to-Widder positivity). Assume in (A62) that
| arg w j | ≤ ϑ < π 2 for every j .
Then for every integer m ≥ 1 satisfying
m ϑ ≤ π 2 ,
one has
W m [ F ] ( x ) > 0 for every x > 0 ,
provided G has at least one zero. More quantitatively,
W m [ F ] ( x ) ≥ 2 ( 2 m − 1 ) ! cos ( m ϑ ) ∑ j | w j | m | x + w j | 2 m .
Proof. 
A positive real w j contributes positively to (12). For a nonreal conjugate pair put q = w / ( x + w ) 2 . Lemma A2 gives | arg q | < | arg w | ≤ ϑ for x > 0 . Hence
q m + q ¯ m = 2 | q | m cos ( m arg q ) > 0
whenever m ϑ ≤ π / 2 , including equality. Also
cos ( m arg q ) ≥ cos ( m ϑ ) ≥ 0 .
Absolute convergence permits summation over the real zeros and conjugate pairs. This proves both conclusions. At m ϑ = π / 2 the displayed lower bound is zero, but the individual blocks still establish strict positivity. If ϑ = 0 , all reflected zeros are positive real and every order is positive.    □

Appendix B.5.5.3. Attribution of the quadratic examples.

Bondesson–Simon ([1], Section 4.1, Proposition 3 and its proof) use f α ( x ) = ( 1 + 2 cos ( π α ) x + x 2 ) − 1 and g α = − ( log f α ) ′ . Their calculation gives the finite threshold 2 α k ≤ 1 . Below F ϕ = 2 g α with ϕ = π α . The examples and threshold are therefore recorded as known building blocks; the extension to products uses dilation, summation and convergence.
Proposition A4 
(Exact universal sector threshold). Let 0 ≤ ϑ < π / 2 and m ≥ 1 . The inequality W m [ 2 G ′ / G ] ( x ) > 0 for all x > 0 holds for every nonconstant real genus-zero product (A62) with | arg w j | ≤ ϑ if and only if m ϑ ≤ π / 2 .
Proof. 
Sufficiency is Theorem A6. If m ϑ > π / 2 , choose
π 2 m < ϕ < min { ϑ , π / m } .
The interval is nonempty. The quadratic
G ϕ ( x ) = ( 1 + x e i ϕ ) ( 1 + x e − i ϕ ) = 1 + 2 x cos ϕ + x 2
has reflected zeros e i ϕ , e − i ϕ in the sector. Its logarithmic derivative F ϕ = 2 G ϕ ′ / G ϕ is positive on ( 0 , ∞ ) . Formula (12), which here extends continuously to x = 0 , gives
W m [ F ϕ ] ( 0 ) = 4 ( 2 m − 1 ) ! cos ( m ϕ ) < 0 .
Continuity gives a negative value for all sufficiently small positive x.    □
Proposition A5 
(Finite positivity with nonreal poles). For every integer N ≥ 1 , there is a positive rational function F ϕ = 2 G ϕ ′ / G ϕ in S N ∖ S N + 1 whose poles are nonreal.
Proof. 
Choose
π 2 ( N + 1 ) < ϕ < π 2 N
and use the preceding quadratic G ϕ . It has nonreal zeros, and
F ϕ ( x ) = 4 ( x + cos ϕ ) x 2 + 2 x cos ϕ + 1 > 0 .
Since N ϕ < π / 2 , Theorem A6 proves all the first N Widder inequalities. On the other hand,
π 2 < ( N + 1 ) ϕ < ( N + 1 ) π 2 N ≤ π ,
so W N + 1 [ F ϕ ] ( 0 ) < 0 and the same holds for small positive x. Thus F ϕ ∉ S N + 1 . Its nonreal poles also exclude an ordinary Stieltjes representation.    □
These examples establish a limitation of the general finite hierarchy. They do not assert the existence of an off-line zero of ξ , or optimality of the numerical cutoff for F ξ itself.

Appendix B.1. Transfer from a Verified Height

We now combine a finite verification of RH with any explicit two-sided zero-free strip above the verified height.
Theorem A7 
(Finite-height transfer principle). Let H > 1 and let d : [ H , ∞ ) → [ 0 , ∞ ) be finite-valued with d ( t ) / t nonincreasing. Assume that every nontrivial zero with 0 < γ ≤ H lies on the critical line, and that every zero with γ > H satisfies
| β − 1 / 2 | ≤ d ( γ ) .
Set b ( t ) = min { d ( t ) , 1 / 2 } and
ϑ H = 2 arctan b ( H ) H , N H = π 2 ϑ H , b ( H ) > 0 , + ∞ , b ( H ) = 0 .
Then W m [ F ξ ] ( x ) > 0 for every x > 0 and every integer 1 ≤ m ≤ N H . When N H = + ∞ , this means all positive integer orders; in that case the assumptions themselves imply RH.
Proof. 
The critical strip and (A68) give | β − 1 / 2 | ≤ b ( γ ) above H. Moreover,
b ( t ) t = min d ( t ) t , 1 2 t
is nonincreasing, since both entries are nonincreasing. For zeros above H,
| arg w ρ | ≤ 2 arctan b ( γ ) γ ≤ 2 arctan b ( H ) H = ϑ H .
Zeros below H give positive real reflected parameters. Since H > 1 and b ( H ) ≤ 1 / 2 , one has 0 ≤ ϑ H < π / 2 . If b ( H ) > 0 , Theorem A6 applies for m ≤ ⌊ π / ( 2 ϑ H ) ⌋ , including a possible integer endpoint. If b ( H ) = 0 , monotonicity and nonnegativity force b ( t ) = 0 for all t ≥ H . All remaining zeros then lie on the critical line, and every Widder order is strictly positive.    □
Even without a zero-free region, the critical strip gives | β − 1 / 2 | < 1 / 2 , so finite verification to height H alone yields the simpler sector
ϑ H ( 0 ) = 2 arctan 1 2 H .
The explicit zero-free region sharpens this slightly but significantly at the trillion-scale order considered here.

Appendix B.2. An Explicit Numerical Application

Platt and Trudgian [5] rigorously verified, using interval arithmetic and Turing’s method, that every nontrivial zero with
0 < γ ≤ H , H = 3 · 10 12 ,
lies on the critical line, and their published result also states that all such zeros are simple. Only the critical-line location is needed for the finite-order positivity theorem below; simplicity is not used in its proof.
Bellotti, Trudgian and Yang ([2], Theorem 1) establish the explicit classical zero-free region
ζ ( σ + i t ) ≠ 0 if t ≥ 3 , σ > 1 − 1 R log t , R = 4.896 .
By conjugation and the functional equation, a nontrivial zero at height t > H obeys
1 R log t ≤ β ≤ 1 − 1 R log t .
Thus
β − 1 2 ≤ d ( t ) : = 1 2 − 1 R log t .
Moreover,
d d t d ( t ) t = 1 t 2 1 R ( log t ) 2 − 1 2 + 1 R log t < 0
for t ≥ H , since log t > 28 and R > 4 . Here 0 < d ( t ) < 1 / 2 , so b = d in Theorem A7. Although (A73) is weak, γ > H and strict decrease of d ( t ) / t give a strict angular bound above H. Consequently all reflected zero parameters lie in the sector
| arg w ρ | < ϑ H , ϑ H = 2 arctan 1 H 1 2 − 1 R log H .

Appendix B.3. Arithmetic Verification

The source package contains the script verify_cutoff.py, which evaluates (A74) using the interval context of mpmath at 80 decimal digits. The endpoints are outward rounded. It gives the enclosures
0.4928906727372165928820573 < d ( H ) < 0.4928906727372165928820574 ,
3.2859378182481106192137157 × 10 − 13 < ϑ H < 3.2859378182481106192137158 × 10 − 13 ,
and
4 , 780 , 359 , 257 , 170.4922923019926 < π 2 ϑ H < 4 , 780 , 359 , 257 , 170.4922923019927 .
The script also checks these displayed enclosures directly, starting from the exact decimal inputs H and R. Therefore
N H = 4 , 780 , 359 , 257 , 170 , N H ϑ H < π 2 < ( N H + 1 ) ϑ H .
For comparison with a fully published zero-free input, let R 0 = 5.558691 , the constant in Mossinghoff–Trudgian–Yang [3], and define
d 0 ( H ) = 1 2 − 1 R 0 log H , ϑ H , 0 = 2 arctan d 0 ( H ) H .
The same interval-arithmetic script gives
4 , 772 , 153 , 270 , 068 < π 2 ϑ H , 0 < 4 , 772 , 153 , 270 , 069 .
Theorem A8 
(Published-input finite-order consequence). Let F ξ be defined by (2). Using only the published Platt–Trudgian zero verification and the published Mossinghoff–Trudgian–Yang zero-free region, one has
( − 1 ) m − 1 d 2 m − 1 d x 2 m − 1 x m 1 x ξ ′ ξ 1 2 + x > 0
for every x > 0 and every integer
1 ≤ m ≤ 4 , 772 , 153 , 270 , 068 .
In particular, F ξ ∈ S 4 , 772 , 153 , 270 , 068 in the sense of Bondesson–Simon. Membership requires nonnegative inequalities; the displayed strict inequalities give a stronger conclusion.
Proof. 
Apply Theorem A7 with the published constant R 0 = 5.558691 and the verified height (A70). The enclosure (A79) and Theorem A6 give the stated range. □
Corollary A7 
(Preprint-enhanced finite-order consequence). If one additionally invokes Theorem 1 of the 2026 Bellotti–Trudgian–Yang preprint [2], with R = 4.896 , then the range in Theorem A8 improves to
1 ≤ m ≤ 4 , 780 , 359 , 257 , 170 .
Proof. 
For the preprint constant, (A77) gives (A78). Apply Theorem A7 with (A70), (A73), and (A74), followed by Theorem A6. □
Remark A8 
(Status of the two numerical cutoffs). The cutoff in Theorem A8 depends only on peer-reviewed published inputs. Corollary A7 records the slightly larger value obtained from the stronger 2026 Bellotti–Trudgian–Yang preprint theorem, which is still a preprint as of 12 September 2026. Neither integer is claimed to be optimal for F ξ .

Appendix B.4. A Prescribed Order and a Positive Margin

The transfer principle can be inverted. If one uses only the critical-strip bound | β − 1 / 2 | < 1 / 2 , a sufficient condition for the mth Widder inequality is
2 m arctan 1 2 H ≤ π 2 .
Equivalently,
H ≥ 1 2 cot π 4 m .
Since
1 2 cot π 4 m = 2 m π + O ( m − 1 ) ,
we obtain the following simple rule.
Corollary A8 
(Linear height-order law). For H > 1 , a rigorous verification of RH through height
H ≥ 1 2 cot π 4 m
is sufficient, even without an additional zero-free region, to prove the mth Widder inequality globally on ( 0 , ∞ ) . Asymptotically, height H certifies all orders
m ≤ π 4 arctan ( 1 / ( 2 H ) ) = π 2 H + π 24 H + O ( H − 3 ) .
Thus a successful verification of RH through the indicated finite height suffices for each prescribed order. This is a sufficient implication, not a guarantee that arbitrarily high successful verifications can be obtained. The zero-free region improves the constant at a fixed verified height by reducing the maximum possible horizontal displacement of all as-yet-unverified zeros.
For comparison, if one ignored the explicit zero-free region and used only | β − 1 / 2 | < 1 / 2 above H = 3 · 10 12 , one would still obtain
1 ≤ m ≤ 4 , 712 , 388 , 980 , 384 .
The 2026 zero-free region increases the certified order by exactly 67 , 970 , 276 , 786 relative to the critical-strip-only cutoff above.
In the range of Theorem A8, retaining the first critical-line zero γ 1 = 14.1347251417 … in (12) gives
W m [ F ξ ] ( x ) ≥ 2 ( 2 m − 1 ) ! γ 1 2 m ( x + γ 1 2 ) 2 m > 0 .
This is a pointwise margin, not a uniform lower bound on the entire half-line. Only the previously published zero verification is computationally substantial; the accompanying script checks the elementary cutoff arithmetic.

Appendix C. Relation with Existing Positivity Hierarchies

The finite Widder inequalities are exactly the defining conditions of the Bondesson–Simon classes S k [1]. There is also a precise algebraic relation with the genus-zero operators studied by Zhang, which is useful for positioning the present result correctly.
For a sufficiently differentiable function h, introduce
Z p , k [ h ] ( x ) : = − 1 x p d k d x k x k + p d p h d x p ( x ) , p , k ∈ N 0 .
Operators of this form occur in Zhang’s complete-monotonicity criteria for genus-zero entire functions ([10], (1.8)). The following elementary identity shows that the Widder family is a diagonal slice.
Lemma A3 
(Widder–Zhang operator identity). For every integer m ≥ 1 and every h ∈ C 2 m − 1 ( 0 , ∞ ) ,
( − 1 ) m − 1 d 2 m − 1 d x 2 m − 1 x m h ( x ) = Z m − 1 , m [ h ] ( x ) .
Consequently, with h = G ′ / G ,
W m [ F ξ ] ( x ) = 2 Z m − 1 , m [ G ′ / G ] ( x ) .
Proof. 
It is enough to prove
d m d x m x 2 m − 1 h ( m − 1 ) ( x ) = x m − 1 d 2 m − 1 d x 2 m − 1 x m h ( x ) .
Expanding both sides by Leibniz’ rule, the coefficient of x m − 1 + j h ( m − 1 + j ) ( x ) , 0 ≤ j ≤ m , is in both cases
m j ( 2 m − 1 ) ! ( m − 1 + j ) ! .
Dividing by x m − 1 and multiplying by ( − 1 ) m − 1 gives (A85). □
The identity is algebraic. It does not identify a finite set of inequalities with complete monotonicity. Zhang’s Theorem 1 assumes positive Taylor coefficients, order less than one, and reflected zeros satisfying ℜ w j ≥ β 0 | w j | > 0 . Under those hypotheses, negative real zeros are characterized by the existence of a fixed p ≥ 0 for which Z p , k [ G ′ / G ] is completely monotone for every k ≥ 0 . Here p = m − 1 varies with the diagonal index m, and only positivity of finitely many functions is concluded.
Related reciprocal and generalized-gamma-convolution formulations are studied by Polson [6]. We use no theorem from that work. The direct identity
L ( θ ) = G ( 0 ) G ( 2 θ ) , − d d θ log L ( θ ) = F ξ ( 2 θ )
explains the relation of notation, but does not identify positivity conditions on L with those on its logarithmic derivative.

Appendix C.1. The Infinite Hierarchy and Finite Representations

Recall that a Stieltjes function has the form
f ( x ) = a + ∫ [ 0 , ∞ ) d μ ( t ) x + t , a ≥ 0 , μ ≥ 0 ,
with ∫ [ 0 , ∞ ) ( 1 + t ) − 1 d μ ( t ) < ∞ . Widder’s real-variable criterion, in the form recalled in ([1], (4)), states that a nonnegative smooth function is Stieltjes if and only if
( − 1 ) m − 1 d 2 m − 1 d x 2 m − 1 x m f ( x ) ≥ 0 ( m ≥ 1 , x > 0 ) .
Bondesson and Simon call a nonnegative function satisfying (A87) for m = 1 , … , k a k-Stieltjes function.
Proposition A6 
(Stieltjes formulation). The Riemann hypothesis is equivalent to F ξ being a Stieltjes function on ( 0 , ∞ ) .
Proof. 
Assume RH. Write the upper-half-plane nontrivial zeros as ρ = 1 / 2 + i γ , γ > 0 , with multiplicity. Since G has order 1 / 2 and genus zero,
G ( x ) = G ( 0 ) ∏ γ > 0 1 + x γ 2 ,
with locally uniform convergence. Hence
F ξ ( x ) = 2 ∑ γ > 0 1 x + γ 2 .
Because ∑ γ > 0 γ − 2 < ∞ , this is a Stieltjes representation with positive discrete measure 2 ∑ γ > 0 δ γ 2 .
Conversely, suppose F ξ is Stieltjes. Its representation extends to a holomorphic function S ( z ) on the slit plane
Ω = C ∖ ( − ∞ , 0 ] .
On ( 0 , ∞ ) it agrees with the meromorphic function M ( z ) = 2 G ′ ( z ) / G ( z ) . Suppose, toward a contradiction, that G has a zero z 0 ∈ Ω . Choose a small disk D centered at z 0 containing no other zero of G, and join a point of ( 0 , ∞ ) to a point of the punctured disk D ∖ { z 0 } by a path in Ω that avoids the discrete zero set of G. Analytic continuation of the identity S = M along this path shows that S = M on D ∖ { z 0 } . But if z 0 has multiplicity r ≥ 1 , then
M ( z ) = 2 r z − z 0 + O ( 1 ) ( z → z 0 ) ,
whereas S is holomorphic at z 0 . This contradiction shows that every zero of G lies on ( − ∞ , 0 ) .
If ρ is a nontrivial zero of ζ , then ( ρ − 1 / 2 ) 2 is a zero of G, so
( ρ − 1 / 2 ) 2 < 0 .
Therefore ρ − 1 / 2 is purely imaginary, and RH follows. □
Thus RH asks for the entire infinite Widder hierarchy (A87). A single finite level does not suffice, as Proposition A5 shows.
Proposition A7 
(Downward propagation of Widder positivity). Put
U m ( x ) = W m [ F ξ ] ( x ) ( 2 m − 1 ) ! .
Then for every m ≥ 1 and x > 0 ,
U m + 1 ( x ) = − U m ′ ( x ) 2 m − x U m ′ ′ ( x ) 2 m ( 2 m + 1 ) ,
and hence
x 2 m + 1 U m ′ ( x ) ′ = − 2 m ( 2 m + 1 ) x 2 m U m + 1 ( x ) .
If U m + 1 ( x ) ≥ 0 for all x > 0 , then U m ( x ) ≥ 0 for all x > 0 . Consequently positivity at one order M implies all lower Widder inequalities 1 ≤ m ≤ M .
Proof. 
From the zero-sum identity one has
U m ( x ) = 2 ∑ ρ ∈ Z + w ρ m ( x + w ρ ) 2 m .
Termwise differentiation on compact subsets of ( 0 , ∞ ) gives (A88); multiplying by 2 m ( 2 m + 1 ) x 2 m yields (A89).
Assume U m + 1 ≥ 0 . Since F ξ is analytic at x = 0 , so is U m , and therefore
lim x ↓ 0 x 2 m + 1 U m ′ ( x ) = 0 .
Equation (A89) shows that x 2 m + 1 U m ′ ( x ) is nonincreasing, hence U m ′ ( x ) ≤ 0 on ( 0 , ∞ ) . For fixed m, the zero sum gives U m ( x ) → 0 as x → ∞ . Indeed, ℜ w ρ > 0 implies | x + w ρ | ≥ | w ρ | , and hence
w ρ m ( x + w ρ ) 2 m ≤ | w ρ | − m .
Since ∑ ρ | w ρ | − 1 < ∞ , dominated convergence applies. Thus U m decreases to zero and must be nonnegative everywhere. Iteration proves the final assertion. □
Corollary A9 
(Sparse Widder criteria for RH). Let 1 ≤ n 1 < n 2 < … be any unbounded sequence of integers. Then
RH ⟺ W n j [ F ξ ] ( x ) ≥ 0 for every x > 0 and every j .
Equivalently, with A m defined by (13),
RH ⟺ A n j is nondecreasing on ( 0 , ∞ ) for every j .
In particular one may take n j = 2 j .
Proof. 
Under RH, Proposition A6 and Widder’s criterion give all the inequalities. Conversely, fix m ≥ 1 and choose j with n j ≥ m . Proposition A7 propagates the n j th inequality down to the mth one. Hence the full Widder hierarchy holds, so F ξ is Stieltjes and Proposition A6 gives RH. Finally,
A m ′ ( x ) = x m − 1 2 ( 2 m − 1 ) ! B m W m [ F ξ ] ( x ) ,
whose prefactor is positive, proving (A91). □
Bondesson and Simon ([1], Theorem 1) define S k by nonnegativity together with the first k Widder conditions. Their Theorem 1 states that, for every k ≥ 2 , f ∈ S k if and only if there exist a k ≥ 0 and a nonnegative measure μ k on [ 0 , ∞ ) , integrating ( 1 + t ) − 1 , such that
f ( x ) = a k + ∫ 0 ∞ Φ k − 1 ( x , t ) d μ k ( t ) .
The kernels Φ k − 1 are their finite-type approximants to the ordinary Stieltjes kernel.
In particular, Theorem A8 yields this representation for F ξ at k = 4 , 772 , 153 , 270 , 068 using published inputs; under the additional preprint input of Corollary A7, the same representation holds at k = 4 , 780 , 359 , 257 , 170 . This is an immediate application of their representation theorem. Its kernel is not the ordinary Stieltjes kernel, so this conclusion does not imply RH.

References

  1. Bondesson, L.; Simon, T. Stieltjes functions of finite order and hyperbolic monotonicity  . Trans. Amer. Math. Soc. 2018, 370, 4201–4222. [Google Scholar] [CrossRef]
  2. Bellotti, C.; Trudgian, T. S.; Yang, A. Zero-free regions inspired by work of Heath-Brown, preprint (2026). arXiv. Available online: https://arxiv.org/abs/2603.21490.
  3. Mossinghoff, M. J.; Trudgian, T. S.; Yang, A. Explicit zero-free regions for the Riemann zeta-function  . Res. Number Theory 2024, 10, 11. [Google Scholar] [CrossRef]
  4. Leong, N. Explicit estimates for the logarithmic derivative and the reciprocal of the Riemann zeta function  . J. Number Theory 2026, 285, 230–261. [Google Scholar] [CrossRef]
  5. Platt, D. J.; Trudgian, T. S. The Riemann hypothesis is true up to 3·1012  . Bull. Lond. Math. Soc. 2021, 53, 792–797. [Google Scholar] [CrossRef]
  6. N. G. Polson, On Hilbert’s 8th Problem, preprint, arXiv:1708.02653v23 (last revised 4 July 2026). https: //arxiv.org/abs/1708.02653.
  7. N. G. Polson, Thorin Positivity, GGC Factorization and the Riemann Xi Function, SSRN preprint, written 13 June 2026, posted July 2026. https://papers.ssrn.com/sol3/papers.cfm?abstract_id=6930178.
  8. N. G. Polson, Thorin Measures and the Reciprocal Xi Function, SSRN preprint, 20 August 2026. https://doi. org/10.2139/ssrn.7320139.
  9. Chirre, A.; Gonçalves, F. Bounding the log-derivative of the zeta-function  . Math. Z. 2022, 300, 1041–1053. [Google Scholar] [CrossRef]
  10. Zhang, R. On certain genus 0 entire functions  . Proc. Amer. Math. Soc. accepted for publication. [CrossRef]
  11. L. Alpöge and R. Furman, More than two thirds of the zeta zeros are simple and on the critical line, preprint (2026), arXiv:2608.13637v2 (19 August 2026). https://arxiv.org/abs/2608.13637v2.
  12. Shi, Y.; Schur, A. A Schur–Jensen gain in the critical-line zero problem, preprint dated 12 August 2026, Zenodo. Zenodo 2026. [Google Scholar] [CrossRef]
  13. Y. Lamzouri, A new proof that more than 2/3 of the zeros of the Riemann zeta function are simple and on the critical line, preprint (2026), arXiv:2609.02882v2. https://arxiv.org/abs/2609.02882.
  14. B. Wang, Simple critical zeros and distinct zeros of the Riemann zeta-function in short intervals, preprint (2026), arXiv:2609.07918v1. https://arxiv.org/abs/2609.07918 .
  15. Devine, M. An unconditional 67.3399% bound and conditional advances beyond 67.92% for simple critical zeros of the Riemann zeta function  . Zenodo Prepr. 2026, Version 1.0.3. [Google Scholar] [CrossRef]
  16. Conrey, J. B. The Riemann hypothesis  . Not. Amer. Math. Soc. 2003, 50, 341–353. [Google Scholar]
  17. Titchmarsh, E. C.; Heath-Brown, D. R. (Eds.) The Theory of the Riemann Zeta-Function, 2nd ed.; Oxford University Press, 1986. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.