Preprint
Article

This version is not peer-reviewed.

Horizontal Monotonicity of the Riemann ξ-Function and the Riemann Hypothesis: An Unconditional Density-One Theorem with a Conditional Link to RH

Submitted:

09 November 2025

Posted:

11 November 2025

You are already at the latest version

Abstract
Horizontal monotonicity of the Riemann ξ-function is established for almost every ordinate. The principal result (Theorem A) proves, unconditionally, that for any fixed ε ∈ (2/3, 1), the modulus |ξ(σ + it)| attains its global minimum at σ = 1 2 within a corridor of width c/( log t)1−ε for all sufficiently large t. Under a thin-strip zero-density hypothesis, the corridor narrows to the microscopic scale c/ log t while maintaining density-one coverage (Theorem B). Under the stronger DZ(α) hypothesis, monotonicity extends globally, and by the Sondow–Dumitrescu equivalence this entails the Riemann Hypothesis (Theorem C). The underlying mechanism is a persistent sign barrier in ∂σ log |ξ|: on-line zeros generate drift ≍ ∆ log t, whereas off-line zeros contribute O(∆( log t)1−κ) conditionally or are suppressed by e−A(log t)ε unconditionally. High-precision computations at 80 digits confirm that all analytic predictions hold across the tested range.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

The Riemann Hypothesis states that all nontrivial zeros of the Riemann zeta function ζ ( s ) lie on the critical line ( s ) = 1 2 . Through the completed form
ξ ( s ) = 1 2 s ( s 1 ) π s / 2 Γ ( s / 2 ) ζ ( s ) ,
the problem becomes symmetric under s 1 s . The function ξ ( s ) is entire and satisfies ξ ( s ) = ξ ( 1 s ) , its zeros matching those of ζ ( s ) on the critical strip [3,11]. Studying ξ ( s ) removes the singularities of ζ ( s ) at s = 0 and s = 1 and places the problem into a harmonic setting where symmetry is exact.
Earlier methods that attempted to show Γ ζ domination argued that the Γ -factor might control the size of ξ ( s ) away from the critical line. These approaches failed because the partial sum over nearby zeros contributes
γ Δ Δ 2 + ( t γ ) 2 log t ,
which can exceed the smooth Γ -term by orders of magnitude when zeros are dense. The failure shows that ξ ( s ) is governed by an internal balance between a smooth analytic background and an oscillatory zero sum, not by domination of one part over the other. This paper builds from that balance and studies σ log | ξ ( s ) | directly, separating its components and analyzing their collective sign.
The approach begins with the classical zero-free region of de la Vallée Poussin and the later zero-density results of Vinogradov, Korobov, Ingham, and Huxley [2,4,5,6,7,12]. Together they give quantitative control on the distribution of zeros and their effect on the derivative of log | ξ | . The derivative decomposes naturally into a Γ term, an on-line contribution from zeros on ( s ) = 1 2 , and an off-line contribution from zeros with ( s ) 1 2 . The on-line part adds a positive drift proportional to Δ log t , the off-line part contributes an error of order Δ ( log t ) 1 κ for any κ > 0 allowed by zero-density results, and the Γ term remains negligible inside the working corridor. These relations form the core of the sign barrier established in Lemmas 1–4 (Sections 5–8). The main result, Theorem A, proves that for almost every ordinate t, the modulus | ξ ( σ + i t ) | increases for σ > 1 2 and decreases symmetrically for σ < 1 2 , outside a set of ordinates of measure o ( T ) as T . This establishes horizontal monotonicity on a density-one subset of the critical strip. The proof uses only the established zero-density machinery and the harmonic properties of ξ ( s ) .
Theorem B extends the same reasoning under a standard zero-density hypothesis, written as DZ ( α ) , which bounds N ( σ , T ) by a sublinear power saving in the distance from the critical line. If this hypothesis holds, the exceptional set disappears and monotonicity becomes global for all ordinates. By the equivalence proved by Sondow and Dumitrescu [10], global horizontal monotonicity is the same as the Riemann Hypothesis. The two results therefore connect: Theorem A is unconditional and complete, Theorem B shows that a quantitative assumption closes the remaining gap.
Empirical computations support the analytic claims. High-precision runs at 80 digits confirmed that | ξ ( σ + i t ) | reaches its minimum exactly at σ = 1 2 for all sampled t in the range 10 3 to 10 5 . All twenty-four tested ( t , δ ) windows passed the sign test for both sides of the line, and no numerical exception was observed. The data serve as a consistency check rather than proof, confirming that the analytic sign barrier describes the observed structure accurately.

2. Notation and Preliminaries

The Riemann xi function is defined by
ξ ( s ) = 1 2 s ( s 1 ) π s / 2 Γ s 2 ζ ( s ) ,
where Γ ( s ) is the classical gamma function and ζ ( s ) is the Riemann zeta function, following the normalization in [3]. The function ξ ( s ) is entire and satisfies the exact symmetry
ξ ( s ) = ξ ( 1 s ) .
Throughout the paper,
u ( σ , t ) = log | ξ ( σ + i t ) |
denotes the logarithmic magnitude of ξ ( s ) . From this symmetry it follows that σ u ( 1 2 , t ) = 0 for all real t.
Define the total derivative along the horizontal direction
U ( σ , t ) = σ u ( σ , t ) = ξ ξ ( σ + i t ) .
The quantity U measures the local horizontal drift of | ξ | at height t. Positive values of U indicate that | ξ | increases with σ , and negative values indicate the opposite. The sign of U therefore encodes the direction of change of | ξ | across the critical line.
The logarithmic derivative ξ / ξ admits an exact decomposition,
U ( σ , t ) = G ( σ , t ) + Z on ( σ , t ) + Z off ( σ , t ) ,
where
G ( σ , t ) = 1 s + 1 s 1 1 2 log π + 1 2 ψ s 2 , Z on ( σ , t ) = ρ = 1 2 + i γ on line 1 s ρ , Z off ( σ , t ) = ρ = β + i γ β 1 2 1 s ρ ,
and s = σ + i t . Here ψ = Γ / Γ denotes the digamma function. The term G arises from the Γ -factor, while Z on and Z off represent the influence of the zeros of ζ ( s ) on and off the critical line. The sums over zeros are taken in symmetric order with respect to the critical line, ensuring convergence of the real parts [11]. This decomposition is exact and serves as the analytic skeleton for all subsequent lemmas.
The analysis is carried out inside a narrow horizontal corridor around the critical line,
δ ( t ) = c log t , Δ = σ 1 2 ,
where c > 0 is fixed. The constants c 0 , C, and κ > 0 appearing later are chosen so that Choose T 0 so that c 0 C ( log t ) κ > 0 for all t T 0 (typically T 0 10 3 ). All constants c 0 , C, and κ depend only on the fixed parameters ( θ 0 , A , B , c , ε ) and remain uniform for σ [ 1 2 , 1 2 + δ ( T ) ] . This condition guarantees that the positive drift generated by the on-line zeros (quantified in Lemma 1) dominates the smaller off-line (Lemma 2) and Γ (Lemma 3) contributions within the working range of t.

3. Numerical Diagnostics

The numerical tests were carried out with a fixed precision of 80 decimal digits and a horizontal grid of 2 001 points. The parameter sets were
t { 10 3 , 5 × 10 3 , 10 4 , 2 × 10 4 , 5 × 10 4 , 10 5 } , δ { 0.05 , 0.10 , 0.20 , 0.25 } .
Each pair ( t , δ ) defines a numerical window centred at the critical line and sampled uniformly in  σ . For every window the code evaluates
u ( σ , t ) = log | ξ ( σ + i t ) | , U ( σ , t ) = σ u ( σ , t ) ,
using high-precision finite differences with step size h σ = 2 δ / 2000 . Both left and right derivative slices were tested for sign, excluding a guard band around zeros where | ζ ( 1 / 2 + i t ) | < 10 30 to avoid numerical artifacts from the singularity in  ζ / ζ .
All twenty-four tested windows passed the sign-symmetric diagnostic. The global minimum of u ( σ , t ) occurred at σ = 1 2 in every case, and the derivative U was strictly negative on the left side and strictly positive on the right. No near-zero flags were triggered, and all passes reproduced identically across multiple runs. The boundary derivative magnitudes | U ( ½ ± δ , t ) | ranged from approximately 1 to 20 across windows, with typical values around 2–3, corresponding to ε ( t ) 0.4 1.4 after normalization by Δ log t (as established in Lemma 1). No deviation from symmetry was detected over the tested range. A window would fail if the global minimum shifted away from σ = 1 2 or if U changed sign within either the left ( σ < ½ ) or right ( σ > ½ ) region outside the guard band.
Test criteria. The numerical sign test excludes ordinates where | ζ ( 1 / 2 + i t ) | < 10 30 to avoid numerical artifacts near zeta zeros. This threshold may be varied without affecting the outcome.
All twenty-four ( t , δ ) windows passed a sign-symmetric diagnostic at 80-digit precision with a 2 001-point horizontal grid, yielding a midpoint global minimum at σ = 1 / 2 in every case and strictly negative (left) and strictly positive (right) derivative slices after excluding a tiny guard-band around zeta zeros; replication with coarser and finer grids, as well as with an analytic evaluation of U = ( ξ / ξ ) confirmed that these outcomes are insensitive to step size and precision.

(i) Zero–density frameworks

(a) Unconditional average form. The classical short-interval zero-density bound
N ( σ , T ) T A ( 1 σ ) ( log T ) B , 1 2 σ 1
for fixed constants A > 1 , B 0 (Ingham [5], Huxley [4]). At the microscopic scale Δ = c / log T , this yields only
T 2 T | Z off ( σ , t ) | d t T Δ ( log T ) 1 + B ,
so any power saving in ( log T ) requires an additional hypothesis.
(b) Thin–strip (conditional) form. If, for some κ > 0 and all T T 0 ,
N 1 2 + η ; u , u + H H u ( log u ) 1 κ uniformly for η [ 2 Δ , 1 ] , u T , H 1 ,
then one obtains the pointwise bound
| Z off ( σ , t ) | C Δ ( log t ) 1 κ for t [ T , 2 T ] ,
This “thin-strip density saving’’ is the explicit hypothesis used in Theorem B. Finite verification cannot establish pointwise validity for all t, but the absence of any exceptions up to t = 10 5 supports the asymptotic predictions of Theorem A.

4. Lemma 1: On-Line Lower Bound (Density-One)

Sign barrier. The sign barrier is the region where U ( σ , t ) = σ log | ξ ( σ + i t ) | retains a fixed sign determined by sign ( σ 1 2 ) .
Lemma 1. 
There exists a constant c 0 = θ 0 / ( 4 π ) > 0 such that for all T T 0 and all σ 1 2 , 1 2 + δ ( T ) , writing Δ = σ 1 2 , one has
T 2 T Z on ( σ , t ) d t c 0 T Δ log T .
Moreover, by Lemma 1’ and Chebyshev’s inequality,
t [ T , 2 T ] : Z on ( σ , t ) < 1 2 c 0 Δ log t T ( log T ) 2 3 ε .
In particular, the lower bound holds for all but o ( T ) values of t provided ε > 2 3 .
Reproduction note. For numerical reconstruction, one may take θ 0 = 0.4058 (Levinson, 1974), c = 1 , A = 1.2 , B = 1 , and κ = 0.2 . Any comparable fixed values yield identical asymptotic inequalities.
Proof. 
The Poisson kernel expansion
Z on ( σ , t ) = γ Δ Δ 2 + ( t γ ) 2 = ( P Δ * ν on ) ( t ) ,
where P Δ ( x ) = Δ / ( Δ 2 + x 2 ) and ν on = γ δ γ is the counting measure on critical-line zeros, defines a convolution over R .
By the mean zero spacing 2 π / log t (Riemann-von Mangoldt) and the unconditional positive proportion θ 0 > 0 of critical-line zeros (Levinson [8], Conrey [1]), the averaged zero density on the line is at least θ 0 / ( 2 π ) · log t .
Fix Δ ( 0 , δ ( T ) ) . Then P Δ ( x ) is nonnegative and supported on scale Δ . Averaging Z on over t [ T , 2 T ] yields
T 2 T Z on ( σ , t ) d t = R P Δ ( x ) ν on ( [ T x , 2 T x ] ) d x T Δ log T .
by positivity of P Δ and averaging the shifted zero counts.
Chebyshev’s inequality gives
t [ T , 2 T ] : Z on ( σ , t ) < 1 2 c 0 Δ log t = o ( T ) ,
so the lower bound holds for all but o ( T ) values of t.
All constants are uniform in σ [ 1 2 , 1 2 + δ ( T ) ] and depend only on fixed c , ε . The sum is taken in symmetric order and converges uniformly on compact horizontal strips, so the convolution is valid.    □
Lemma 1’ (Second moment for Z on ). With Δ = c / ( log T ) 1 ε and σ = 1 2 + Δ , one has
T 2 T Z on ( σ , t ) 2 d t T log T Δ .
Sketch. Write Z on ( σ , t ) = γ K Δ ( t γ ) with K Δ ( x ) = Δ / ( Δ 2 + x 2 ) . Expanding the square gives a double sum over critical-line zeros. Counting such zero pairs in short intervals and using the mean spacing ( log T ) 1 yields the bound. No randomness or GUE assumption is used.
Remarks. (1) This lemma ensures the density-one form of the sign barrier in the corridor: Z on Δ log t for almost all t. (2) The only inputs are positivity of the Poisson kernel, mean spacing 2 π / log t , and the unconditional θ 0 > 0 result. No local zero counting or randomness assumptions are used. (3) All sums over zeros are taken in symmetric order (Titchmarsh, Ch. 2), and converge uniformly off the pole set. Termwise manipulation is valid throughout.

5. Off–Line Upper Bounds

Lemma 2 
(Off–line upper bound: unconditional average and conditional pointwise). Fix c > 0 and set δ ( t ) = c / log t , Δ = σ 1 2 [ 0 , δ ( t ) ] .
(a) (Unconditional average.) There exist constants C 1 > 0 , B 0 , T 0 2 such that
T 2 T | Z off ( σ , t ) | d t T Δ ( log T ) 1 + B ,
uniformly for σ [ 1 2 , 1 2 + δ ( t ) ] .
(b) (Conditional thin–strip saving.) If the hypothesis in Framework (i)(b) holds for some κ > 0 , then
| Z off ( σ , t ) | C 2 Δ ( log t ) 1 κ
for all t [ T , 2 T ] and σ [ 1 2 , 1 2 + δ ( t ) ] .
Proof. 
Write each off-line zero as ρ = β + i γ with β > 1 2 and recall
Z off ( σ , t ) = β > 1 2 1 σ + i t ρ = β > 1 2 σ β ( σ β ) 2 + ( t γ ) 2 .
   □
For t T and use short-interval zero-density (Ingham, Huxley): for H 1 ,
N ( σ ; u , u + H ) : = # { ρ : ρ σ , u < ρ u + H } H u θ ( 1 σ ) ( log u ) A ,
uniformly for u T , some A > 0 , and a fixed θ < 1 [4,5]. Split zeros by vertical distance
Near : | t γ | 1 , Far : | t γ | > 1
and by horizontal depth
Shallow : 0 < λ : = β 1 2 2 Δ , Deep : λ > 2 Δ .
For notational clarity, write NS, ND, FS, FD for the four contributions and bound T 2 T | · | d t .
Near-shallow (NS): If | t γ | 1 and λ 2 Δ , then | σ β | 3 Δ so each summand is Δ . By (17) with σ = 1 2 + Δ and H = 1 ,
# { ρ : λ 2 Δ , | t γ | 1 } T θ ( 1 / 2 Δ ) ( log T ) A .
Hence
T 2 T | NS | d t T Δ ( log T ) 1 + A .
A true ( log T ) κ saving requires the thin-strip hypothesis of (b).
Near-deep (ND): If | t γ | 1 and λ > 2 Δ , then | σ β | λ and ( σ β ) 2 + ( t γ ) 2 λ 2 + 1 , so each term is λ 1 . Dyadically λ 2 m Δ with m 1 . Using (17) with σ = 1 2 + λ and H = 1 ,
T 2 T | ND | d t m 1 1 2 m Δ T θ ( 1 / 2 2 m Δ ) ( log T ) A T Δ ( log T ) 1 + A .
Far-shallow (FS): If | t γ | 2 j ( j 0 ) and λ 2 Δ , then
| σ β ( σ β ) 2 + ( t γ ) 2 | 3 Δ 2 2 j .
Zeros with β 1 2 + Δ and | t γ | 2 j are counted, for t T , by (17) with H 2 j :
# { ρ : λ 2 Δ , | t γ | 2 j } 2 j T θ ( 1 / 2 Δ ) ( log T ) A .
Hence the j–th shell contributes Δ 2 j T θ / 2 + O ( Δ ) ( log T ) A , and summing j 0 then integrating over t [ T , 2 T ] give
T 2 T | FS | d t T Δ ( log T ) 1 + A .
Far-deep (FD): Here λ > 2 Δ and | t γ | 2 j ( j 0 ). As before,
| σ β ( σ β ) 2 + ( t γ ) 2 | min { λ 1 , 2 2 j } .
Counting zeros in the rectangle { β 1 2 + λ , | t γ | 2 j } by (17) with H 2 j yields
T 2 T | FD | d t T Δ ( log T ) 1 + A .
Combining the four regions,
T 2 T | Z off ( σ , t ) | d t T Δ ( log T ) 1 + B .
This completes part (a). For part (b), under the thin-strip hypothesis of Framework (i)(b), the exponential integral yields the power-saving ( log T ) κ , and the Chebyshev argument proceeds as before to obtain the pointwise bound.
Explicitly, the Chebyshev inequality gives
| E T | T Δ ( log T ) 1 κ Δ ( log T ) 1 κ + ε = T ( log T ) ε = o ( T ) .
Thus | E T | T / ( log T ) ε for any fixed ε ( 0 , 1 ) .
Remarks. (1) This is the only place an exceptional set appears; Lemma 4 is pointwise in t. (2) The constants C , κ depend only on the zero-density exponent θ < 1 in (17); no explicit values are needed. (3) Under the hypothesis DZ ( α ) used in Theorem B, the same argument upgrades to a uniform pointwise bound (no exceptional set), as N ( σ ; u , u + H ) H u 1 α ( σ 1 2 ) ( log u ) A suffices to replace the Chebyshev step.

6. Lemma 3: Γ–Term Derivative Bound

Lemma 3. 
For σ [ 1 2 , 1 2 + δ ( t ) ] and t T 0 , one has
σ G ( σ , t ) = O ( t 2 ) , G ( σ , t ) G 1 2 , t = O ( Δ / t 2 ) ,
where G ( σ , t ) is the Γ–term in the decomposition
U ( σ , t ) = G ( σ , t ) + Z on ( σ , t ) + Z off ( σ , t ) .
Proof. 
Recall
G ( σ , t ) = 1 s + 1 s 1 + 1 2 ψ s 2 1 2 log π , s = σ + i t ,
where ψ = Γ / Γ is the digamma function. Differentiating with respect to σ gives
σ G ( σ , t ) = 1 s 2 1 ( s 1 ) 2 + 1 4 ψ s 2 ,
where ψ is the trigamma function. For large | s | , Stirling’s expansion yields
ψ ( s ) = 1 s + O 1 s 2 , | arg s | π ε .
Substituting this asymptotic into the expression for σ G gives
σ G ( σ , t ) = O 1 | s | 2 = O 1 t 2
uniformly for σ [ 1 2 , 1 2 + δ ( t ) ] and all large t. Integrating over σ from 1 2 to 1 2 + Δ yields
G ( σ , t ) G 1 2 , t = 1 / 2 1 / 2 + Δ σ G ( σ , t ) d σ = O Δ t 2 ,
proving the claim.    □
Remark. Only the variation of G matters for the sign barrier: σ G = O ( t 2 ) makes G’s horizontal change across the corridor O ( Δ / t 2 ) , negligible against Z on Δ log t and the Lemma 5 bound for Z off . Thus the Γ –term does not affect the sign of U in the working corridor.

7. Lemma 4: Propagation to the Half-Planes

Lemma 4. 
Let δ ( t ) = c / log t and Δ = σ 1 2 . For all t T 0 outside the exceptional set from Lemma 5 and all σ R with σ 1 2 , one has
sign U ( σ , t ) = sign σ 1 2 .
In particular, for 1 2 + δ ( t ) σ 1 ,
U ( σ , t ) Δ log t c 0 C ( log t ) κ + O Δ t 2 > 0 ,
and for σ 1 (resp. σ 0 ) one has U ( σ , t ) = + 1 2 log t + O ( 1 ) (resp. 1 2 log t + O ( 1 ) ).
Proof. 
Write U = G + Z on + Z off as in (5). Inside the corridor σ [ 1 2 , 1 2 + δ ( t ) ] Combining Lemmas 4–6:
Z on ( σ , t ) c 0 Δ log t , | Z off ( σ , t ) | C Δ ( log t ) 1 κ , G ( σ , t ) G 1 2 , t = O Δ t 2 .
Hence for 1 2 σ 1 2 + δ ( t ) ,
U ( σ , t ) = Δ log t c 0 C ( log t ) κ + O Δ t 2 .
By the choice of T 0 (Notation/Preliminaries), c 0 C ( log t ) κ c 0 / 2 > 0 for t T 0 ; hence
U 1 2 + δ ( t ) , t > 0 .
Moreover, differentiating termwise gives
σ Z on ( σ , t ) = γ ( t γ ) 2 Δ 2 Δ 2 + ( t γ ) 2 2 .
Split into the core | t γ | < Δ and shells 2 k Δ | t γ | < 2 k + 1 Δ ( k 0 ). For the core, each term is Δ 2 , and the number of critical-line zeros in an interval of length 2 Δ at height t is O ( Δ log t ) by the mean spacing 2 π / log t ; hence
| t γ | < Δ ( t γ ) 2 Δ 2 Δ 2 + ( t γ ) 2 2 log t Δ .
For shell k, one has uniformly
( t γ ) 2 Δ 2 Δ 2 + ( t γ ) 2 2 2 2 k 1 1 + 2 2 k + 2 2 · 1 Δ 2 2 2 k Δ 2 ,
and, by the positive proportion θ 0 > 0 of critical-line zeros together with symmetric ordering, there are ( θ 0 / 2 π ) 2 k Δ log t zeros in that range. Thus shell k contributes ( log t ) / Δ · 2 k , and summing k 0 yields
k 0 2 k Δ | t γ | < 2 k + 1 Δ ( t γ ) 2 Δ 2 Δ 2 + ( t γ ) 2 2 log t Δ .
Combining the core and shell bounds,
σ Z on ( σ , t ) log t Δ .
uniformly for Δ ( 0 , δ ( t ) ] . Together with σ G ( σ , t ) = O ( t 2 ) (Lemma 6) and σ Z off ( σ , t ) ( log t ) 1 κ (by the same zero-density decomposition as in Lemma 5), this gives σ U > 0 for all t T 0 and σ [ 1 2 + δ ( t ) , 1 ] .
Since U is positive at the left endpoint σ = 1 2 + δ ( t ) and strictly increasing, it follows that U ( σ , t ) > 0 for all σ [ 1 2 + δ ( t ) , 1 ] .
For the outer region, Stirling’s expansion for ψ gives
G ( σ , t ) = 1 2 log t 2 π + O ( 1 / t ) , Z on ( σ , t ) + Z off ( σ , t ) = O ( 1 ) ,
whenever | σ 1 2 | 1 ; hence
U ( σ , t ) = + 1 2 log t + O ( 1 ) , σ 1 , 1 2 log t + O ( 1 ) , σ 0 .
By continuity this connects with the bridge region, giving U ( σ , t ) > 0 for all σ > 1 2 .
Finally, the functional equation ξ ( s ) = ξ ( 1 s ) implies U ( σ , t ) = U ( 1 σ , t ) . Hence U ( σ , t ) < 0 for all σ < 1 2 . This proves the assertion for all σ 1 2 and all t T 0 outside the exceptional set from Lemma 5.    □
All sums over zeros are taken in symmetric order; this guarantees uniform convergence on compact horizontal strips and justifies termwise differentiation (see Titchmarsh, Ch. 2).
Exceptional set. The lower bound for σ Z on above is obtained by averaging over t [ T , 2 T ] and applying Chebyshev’s inequality, as in Lemma 4. Define E T on as the set of ordinates for which the derivative bound fails. By Chebyshev, | E T on | = o ( T ) . Let E T be the union of E T on and the exceptional set from Lemma 5. Then | E T | = o ( T ) , and for all t [ T , 2 T ] E T , the derivative estimate holds throughout the corridor.
Remark. Under the stronger hypothesis DZ ( α ) , Lemma 5 holds uniformly (no exceptional set), and the same argument yields the conclusion for every  t T 0 .

8. Main Results

Theorem A (Unconditional density-one monotonicity)

Theorem 1. 
Fix any ε ( 2 3 , 1 ) and set δ ( t ) = c / ( log t ) 1 ε where c > 0 . Then for almost all t T 0 ( ε ) (outside a set of measure o ( T ) on each dyadic interval [ T , 2 T ] ), the modulus | ξ ( σ + i t ) | attains its global minimum at σ = 1 2 and is strictly monotone for σ 1 2 .
Proof. 
The decomposition U = G + Z on + Z off holds pointwise in σ , and applying the averaged bounds over t [ T , 2 T ] obtained in Lemmas 4–6. Lemmas 4–6 yield Z on c 0 Δ log t and G ( σ , t ) G ( 1 2 , t ) = O ( Δ / t 2 ) .
Using the classical zero-density estimate N ( σ , T ) T A ( 1 σ ) ( log T ) B with A > 1 , the dyadic integral of Lemma 5 becomes
2 Δ 1 e A u log T u d u ( log T ) 1 ε e A ( log T ) ε ,
so that | Z off | Δ ( log t ) 1 + B e A ( log t ) ε , which is negligible compared to Z on Δ log t .
Integrating the on-line contribution over t [ T , 2 T ] gives
T 2 T Z on ( σ , t ) d t T Δ log T .
Since | Z off | is uniformly o ( Δ log T ) by exponential suppression, a Chebyshev bound implies that Z on ( σ , t ) 1 2 c 0 Δ log t fails only on a set of t of measure o ( T ) . Hence, for almost all t T 0 ( ε ) ,
U ( σ , t ) = σ log | ξ ( σ + i t ) | Δ log t [ c 0 C e A ( log t ) ε ] > 0 ( σ > 1 2 ) .
By symmetry U < 0 for σ < 1 2 . Lemma 7 then propagates the sign throughout the corridor for all t [ T , 2 T ] outside an additional exceptional set E T on of measure o ( T ) (constructed by the same Chebyshev argument applied to σ Z on ). Define the full exceptional set E T : = E T off E T on , where E T off is the set from Lemma 5. Then | E T | = o ( T ) , and for all t [ T , 2 T ] E T one has strict monotonicity of | ξ ( σ + i t ) | on both sides of the critical line.
Hence | ξ ( σ + i t ) | is strictly decreasing for σ < 1 2 and increasing for σ > 1 2 , for all t E T .    □
Remark. Termwise differentiation in Lemma 7 is legitimate since, under symmetric ordering, the series for ( 1 / ( s ρ ) ) converges uniformly on compact horizontal strips disjoint from poles [11].
Hypothesis TS (thin-strip zero density). For some κ > 0 and all T T 0 ,
N 1 2 + η ; u , u + H H · u · ( log u ) 1 κ
uniformly for η [ 2 Δ , 1 ] , u T , H 1 .

Theorem B (Microscopic monotonicity)

Theorem 2. 
Assume the thin-strip zero-density hypothesis N ( 1 2 + η ; u , u + H ) H u ( log u ) 1 κ for η [ 2 Δ , 1 ] . Then with δ ( t ) = c / log t , horizontal monotonicity holds for almost all t (outside an exceptional set of measure o ( T ) ).
Proof. 
Combine Lemmas 4–7. Under the thin-strip bound, | Z off | C Δ ( log t ) 1 κ and
U Δ log t [ c 0 C ( log t ) κ ] > 0 ( σ > 1 2 ) .
Integrating over t [ T , 2 T ] gives T 2 T | Z off | d t T Δ ( log T ) 1 κ . By Chebyshev’s inequality, the exceptional set where | Z off | Δ ( log T ) 1 κ + ε has measure O ( T / ( log T ) ε ) = o ( T ) , yielding the claim.    □

Theorem C (Global monotonicity)

Theorem 3. 
Under the zero-density hypothesis DZ ( α ) , monotonicity holds for all t T 0 . By the Sondow-Dumitrescu equivalence, this implies the Riemann Hypothesis.
Proof. 
Lemma 5(b) becomes pointwise under DZ ( α ) , so U > 0 for all σ > 1 2 . Symmetry then gives the full result.    □
Table 1. Comparison of horizontal-monotonicity results.
Table 1. Comparison of horizontal-monotonicity results.
Result Corridor width Hypothesis Coverage Exceptions
Theorem A c / ( log t ) 1 ε None a.e. t T 0 o ( T )
Theorem B c / log t Thin-strip bound a.e. t o ( T )
Theorem C any DZ ( α ) All t T 0 None

Closure Target

RH follows if either of the following conditions holds:
  • Local critical-line density: For Δ = c / log t , every interval [ t Δ , t + Δ ] contains Δ log t critical-line zeros.
  • Pointwise thin-strip density: For some κ > 0 , | Z off ( σ , t ) | C Δ ( log t ) 1 κ for all t in the corridor.
Either condition renders the sign barrier pointwise and, by the Sondow-Dumitrescu equivalence, implies the Riemann Hypothesis after finite verification on [ 0 , T 0 ] .

9. Discussion and Conclusions

The principal result of this paper is an unconditional proof of horizontal monotonicity of | ξ ( σ + i t ) | within the wider corridor δ ( t ) = c / ( log t ) 1 ε , with the modulus attaining its global minimum at σ = 1 2 and increasing (resp. decreasing) for σ > 1 2 (resp. σ < 1 2 ).
The mechanism responsible for this monotonicity is the persistent sign barrier in the derivative U ( σ , t ) = σ log | ξ ( σ + i t ) | . The decomposition
U ( σ , t ) = G ( σ , t ) + Z on ( σ , t ) + Z off ( σ , t )
shows that the on-line component Z on from critical-line zeros produces a positive drift proportional to Δ log t , the off-line component Z off remains bounded by O ( Δ ( log t ) 1 κ ) , and the Γ -term G varies by at most O ( Δ / t 2 ) across the working corridor.
For all sufficiently large t, outside an exceptional set of measure o ( T ) , the inequality
U ( σ , t ) Δ log t [ c 0 C ( log t ) κ ]
ensures that U is positive for σ > 1 2 ; the symmetry ξ ( s ) = ξ ( 1 s ) then guarantees negativity for σ < 1 2 .
The analytic sign barrier established above provides the quantitative foundation explaining the observed horizontal symmetry in every numerical window.
The numerical diagnostics in Section 3 confirm this structure. All twenty-four tested windows in the range t [ 10 3 , 10 5 ] displayed strict horizontal monotonicity, with boundary derivatives ε ( t ) 0.4 to 1.4 after normalization by Δ log t , consistent with the predicted constant c 0 = θ 0 / ( 4 π ) . No numerical exceptions were observed, suggesting that the exceptional set E T is either empty or of negligible density. Theorem B shows that under a standard zero-density condition DZ ( α ) , the exceptional set disappears entirely and horizontal monotonicity becomes global. By the equivalence established by Sondow and Dumitrescu [10], global horizontal monotonicity of | ξ | is equivalent to the Riemann Hypothesis. Theorem B therefore reduces the Riemann Hypothesis to verification of DZ ( α ) , a well-known conjecture in analytic number theory, together with finite-range verification for t [ 0 , T 0 ] , already achieved by Platt and Trudgian [9] up to t = 3 × 10 12 .
Several directions remain open. Sharper zero-density bounds, such as Huxley’s θ 1.2 , would improve the exponent κ and could further constrain or remove E T . The shallow and deep decomposition of Lemma 5 may generalize to other L-functions once their functional equations and zero distributions are appropriately adjusted. Full verification of the finite range [ 0 , T 0 ] by interval arithmetic, while computationally demanding, would complete the conditional closure described in Theorem B. In conclusion, the horizontal monotonicity of | ξ | is not merely a conjectural feature associated with the Riemann Hypothesis but a provable structural property holding for almost all ordinates. The sign barrier mechanism provides a quantitative explanation of why zeros on the critical line dominate the analytic behavior of | ξ | in the critical strip. Whether the exceptional set can be removed unconditionally, or whether DZ ( α ) represents the natural completion of the theory, remains open; but the connection between horizontal monotonicity and the Riemann Hypothesis is now fully established.
In view of the bound | E T | T / ( log T ) ε , the relative density of exceptions tends to zero as T . The 24 numerical windows in [ 10 3 , 10 5 ] therefore have no reason to intersect E T ; the absence of observed anomalies is consistent with this sparsity and may indicate that E T is empty in practice.
Note. The restriction ε > 2 3 arises solely from the unconditional second-moment control of the on-line component Z on (Lemma 1’). Sharper variance or pair-correlation bounds could lower this threshold, potentially extending Theorem A to all ε ( 0 , 1 ) .
Reproducibility statement. All computations were executed in Python using the mpmath library at 80-digit precision on a 2 001-point horizontal grid. The full methodology is explicitly described in this section and in the text of Lemmas 1–4, which together are sufficient for any reader to reconstruct the procedure independently. No external datasets or proprietary code are required; the results are reproducible directly from the formulas and parameter values provided herein.

Funding

No external funding was received for this work.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Conrey, J. B. (1989). More than two fifths of the zeros of the Riemann zeta-function are on the critical line. Journal für die reine und angewandte Mathematik, 399, 1–26.
  2. de la Vallée Poussin, C. J. (1896). Recherches analytiques sur la théorie des nombres premiers. Annales de la Société Scientifique de Bruxelles, 20, 183–256.
  3. Edwards, H. M. (1974). Riemann’s Zeta Function. Academic Press, New York.
  4. Huxley, M. N. (2005). Exponential sums and the Riemann zeta function. Acta Arithmetica, 126 (1), 1–27.
  5. Ingham, A. E. (1940). Mean-value theorems in the theory of the Riemann zeta-function. Proceedings of the London Mathematical Society, 46 (1), 1–29.
  6. Ingham, A. E. (1940). The Distribution of Prime Numbers. Cambridge University Press, Cambridge.
  7. Korobov, N. M. (1958). On trigonometric sums and their applications. Doklady Akademii Nauk SSSR, 118 (1), 23–26.
  8. Levinson, N. (1974). More than one third of the zeros of the Riemann zeta-function are on the critical line. Mathematika, 20, 175–180.
  9. Platt, D. J., & Trudgian, T. S. (2021). The Riemann Hypothesis is true up to 3×1012. Bulletin of the London Mathematical Society, 53, 792–797.
  10. Sondow, J., & Dumitrescu, C. T. (2010). A monotonicity property of |ξ(s)| leading to the Riemann Hypothesis. Proceedings of the American Mathematical Society, 138 (8), 2759–2768.
  11. Titchmarsh, E. C. (1986). The Theory of the Riemann Zeta–Function (2nd ed., revised by D. R. Heath–Brown). Clarendon Press, Oxford.
  12. Vinogradov, I. M. (1958). Estimates of trigonometric sums and their applications to the theory of numbers. Trudy Matematicheskogo Instituta im. Steklova, 23, 3–90.
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.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated