1. Introduction
The Riemann Hypothesis states that all nontrivial zeros of the Riemann zeta function
lie on the critical line
. Through the completed form
the problem becomes symmetric under
. The function
is entire and satisfies
, its zeros matching those of
on the critical strip [
3,
11]. Studying
removes the singularities of
at
and
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
away from the critical line. These approaches failed because the partial sum over nearby zeros contributes
which can exceed the smooth
-term by orders of magnitude when zeros are dense. The failure shows that
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
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
. The derivative decomposes naturally into a
term, an on-line contribution from zeros on
, and an off-line contribution from zeros with
. The on-line part adds a positive drift proportional to
, the off-line part contributes an error of order
for any
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
increases for
and decreases symmetrically for
, outside a set of ordinates of measure
as
. 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
.
Theorem B extends the same reasoning under a standard zero-density hypothesis, written as
, which bounds
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 reaches its minimum exactly at for all sampled t in the range to . All twenty-four tested 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
where
is the classical gamma function and
is the Riemann zeta function, following the normalization in [
3]. The function
is entire and satisfies the exact symmetry
Throughout the paper,
denotes the logarithmic magnitude of
. From this symmetry it follows that
for all real
t.
Define the total derivative along the horizontal direction
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,
where
and
. Here
denotes the digamma function. The term
G arises from the
-factor, while
and
represent the influence of the zeros of
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,
where
is fixed. The constants
,
C, and
appearing later are chosen so that Choose
so that
for all
(typically
). All constants
,
C, and
depend only on the fixed parameters
and remain uniform for
. 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
Each pair
defines a numerical window centred at the critical line and sampled uniformly in
. For every window the code evaluates
using high-precision finite differences with step size
. Both left and right derivative slices were tested for sign, excluding a guard band around zeros where
to avoid numerical artifacts from the singularity in
.
All twenty-four tested windows passed the sign-symmetric diagnostic. The global minimum of occurred at 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 ranged from approximately 1 to 20 across windows, with typical values around 2–3, corresponding to after normalization by (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 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 to avoid numerical artifacts near zeta zeros. This threshold may be varied without affecting the outcome.
All twenty-four windows passed a sign-symmetric diagnostic at 80-digit precision with a 2 001-point horizontal grid, yielding a midpoint global minimum at 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 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
for fixed constants
,
(Ingham [
5], Huxley [
4]). At the microscopic scale
, this yields only
so any power saving in
requires an additional hypothesis.
(b)
Thin–strip (conditional) form. If, for some
and all
,
then one obtains the pointwise bound
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
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 retains a fixed sign determined by .
Lemma 1.
There exists a constant such that for all and all , writing , one has
Moreover, by Lemma 1’ and Chebyshev’s inequality,
In particular, the lower bound holds for all but values of t provided .
Reproduction note. For numerical reconstruction, one may take (Levinson, 1974), , , , and . Any comparable fixed values yield identical asymptotic inequalities.
Proof. The Poisson kernel expansion
where
and
is the counting measure on critical-line zeros, defines a convolution over
.
By the mean zero spacing
(Riemann-von Mangoldt) and the unconditional positive proportion
of critical-line zeros (Levinson [
8], Conrey [
1]), the averaged zero density on the line is at least
.
Fix
. Then
is nonnegative and supported on scale
. Averaging
over
yields
by positivity of
and averaging the shifted zero counts.
Chebyshev’s inequality gives
so the lower bound holds for all but
values of
t.
All constants are uniform in and depend only on fixed . The sum is taken in symmetric order and converges uniformly on compact horizontal strips, so the convolution is valid. □
Lemma 1’ (Second moment for ). With
and
, one has
Sketch. Write
with
. Expanding the square gives a double sum over critical-line zeros. Counting such zero pairs in short intervals and using the mean spacing
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: for almost all t. (2) The only inputs are positivity of the Poisson kernel, mean spacing , and the unconditional 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 and set , .
(a) (Unconditional average.) There exist constants , , such that
uniformly for .
(b) (Conditional thin–strip saving.) If the hypothesis in Framework (i)(b) holds for some , then
for all and .
Proof. Write each off-line zero as
with
and recall
□
For
and use
short-interval zero-density (Ingham, Huxley): for
,
uniformly for
, some
, and a fixed
[
4,
5]. Split zeros by
vertical distance
and by
horizontal depth For notational clarity, write NS, ND, FS, FD for the four contributions and bound
.
Near-shallow (NS): If
and
, then
so each summand is
. By (
17) with
and
,
Hence
A true
saving requires the thin-strip hypothesis of (b).
Near-deep (ND): If
and
, then
and
, so each term is
. Dyadically
with
. Using (
17) with
and
,
Far-shallow (FS): If
(
) and
, then
Zeros with
and
are counted, for
, by (
17) with
:
Hence the
j–th shell contributes
, and summing
then integrating over
give
Far-deep (FD): Here
and
(
). As before,
Counting zeros in the rectangle
by (
17) with
yields
Combining the four regions,
This completes part (a). For part (b), under the thin-strip hypothesis of Framework (i)(b), the exponential integral yields the power-saving
, and the Chebyshev argument proceeds as before to obtain the pointwise bound.
Explicitly, the Chebyshev inequality gives
Thus
for any fixed
.
Remarks. (1) This is the
only place an exceptional set appears; Lemma 4 is pointwise in
t. (2) The constants
depend only on the zero-density exponent
in (
17); no explicit values are needed. (3) Under the hypothesis
used in Theorem B, the same argument upgrades to a
uniform pointwise bound (no exceptional set), as
suffices to replace the Chebyshev step.
6. Lemma 3: Γ–Term Derivative Bound
Lemma 3.
For and , one has
where is the Γ–term in the decomposition
Proof. Recall
where
is the digamma function. Differentiating with respect to
gives
where
is the trigamma function. For large
, Stirling’s expansion yields
Substituting this asymptotic into the expression for
gives
uniformly for
and all large
t. Integrating over
from
to
yields
proving the claim. □
Remark. Only the variation of G matters for the sign barrier: makes G’s horizontal change across the corridor , negligible against and the Lemma 5 bound for . 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 and . For all outside the exceptional set from Lemma 5 and all with , one has
In particular, for ,
and for (resp. ) one has (resp. ).
Proof. Write
as in (
5). Inside the corridor
Combining Lemmas 4–6:
Hence for
,
By the choice of
(Notation/Preliminaries),
for
; hence
Moreover, differentiating termwise gives
Split into the core
and shells
(
). For the core, each term is
, and the number of critical-line zeros in an interval of length
at height
t is
by the mean spacing
; hence
For shell
k, one has uniformly
and, by the positive proportion
of critical-line zeros together with symmetric ordering, there are
zeros in that range. Thus shell
k contributes
, and summing
yields
Combining the core and shell bounds,
uniformly for
. Together with
(Lemma 6) and
(by the same zero-density decomposition as in Lemma 5), this gives
for all
and
.
Since U is positive at the left endpoint and strictly increasing, it follows that for all .
For the outer region, Stirling’s expansion for
gives
whenever
; hence
By continuity this connects with the bridge region, giving
for all
.
Finally, the functional equation implies . Hence for all . This proves the assertion for all and all 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 above is obtained by averaging over and applying Chebyshev’s inequality, as in Lemma 4. Define as the set of ordinates for which the derivative bound fails. By Chebyshev, . Let be the union of and the exceptional set from Lemma 5. Then , and for all , the derivative estimate holds throughout the corridor.
Remark. Under the stronger hypothesis , Lemma 5 holds uniformly (no exceptional set), and the same argument yields the conclusion for every .
8. Main Results
Theorem A (Unconditional density-one monotonicity)
Theorem 1. Fix any and set where . Then for almost all (outside a set of measure on each dyadic interval ), the modulus attains its global minimum at and is strictly monotone for .
Proof. The decomposition holds pointwise in , and applying the averaged bounds over obtained in Lemmas 4–6. Lemmas 4–6 yield and .
Using the classical zero-density estimate
with
, the dyadic integral of Lemma 5 becomes
so that
, which is negligible compared to
.
Integrating the on-line contribution over
gives
Since
is uniformly
by exponential suppression, a Chebyshev bound implies that
fails only on a set of
t of measure
. Hence, for almost all
,
By symmetry
for
. Lemma 7 then propagates the sign throughout the corridor for all
outside an additional exceptional set
of measure
(constructed by the same Chebyshev argument applied to
). Define the full exceptional set
, where
is the set from Lemma 5. Then
, and for all
one has strict monotonicity of
on both sides of the critical line.
Hence is strictly decreasing for and increasing for , for all . □
Remark. Termwise differentiation in Lemma 7 is legitimate since, under symmetric ordering, the series for
converges uniformly on compact horizontal strips disjoint from poles [
11].
Hypothesis TS (thin-strip zero density). For some
and all
,
uniformly for
,
,
.
Theorem B (Microscopic monotonicity)
Theorem 2. Assume the thin-strip zero-density hypothesis for . Then with , horizontal monotonicity holds for almost all t (outside an exceptional set of measure ).
Proof. Combine Lemmas 4–7. Under the thin-strip bound,
and
Integrating over
gives
. By Chebyshev’s inequality, the exceptional set where
has measure
, yielding the claim. □
Theorem C (Global monotonicity)
Theorem 3. Under the zero-density hypothesis , monotonicity holds for all . By the Sondow-Dumitrescu equivalence, this implies the Riemann Hypothesis.
Proof. Lemma 5(b) becomes pointwise under , so for all . 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 |
|
None |
a.e.
|
|
| Theorem B |
|
Thin-strip bound |
a.e. t
|
|
| Theorem C |
any |
DZ
|
All
|
None |
Closure Target
RH follows if either of the following conditions holds:
Local critical-line density: For , every interval contains critical-line zeros.
Pointwise thin-strip density: For some , 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 .
9. Discussion and Conclusions
The principal result of this paper is an unconditional proof of horizontal monotonicity of within the wider corridor , with the modulus attaining its global minimum at and increasing (resp. decreasing) for (resp. ).
The mechanism responsible for this monotonicity is the persistent sign barrier in the derivative
. The decomposition
shows that the on-line component
from critical-line zeros produces a positive drift proportional to
, the off-line component
remains bounded by
, and the
-term
G varies by at most
across the working corridor.
For all sufficiently large
t, outside an exceptional set of measure
, the inequality
ensures that
U is positive for
; the symmetry
then guarantees negativity for
.
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
displayed strict horizontal monotonicity, with boundary derivatives
to
after normalization by
, consistent with the predicted constant
. No numerical exceptions were observed, suggesting that the exceptional set
is either empty or of negligible density. Theorem B shows that under a standard zero-density condition
, 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
, a well-known conjecture in analytic number theory, together with finite-range verification for
, already achieved by Platt and Trudgian [
9] up to
.
Several directions remain open. Sharper zero-density bounds, such as Huxley’s , would improve the exponent and could further constrain or remove . 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 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 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 , the relative density of exceptions tends to zero as . The 24 numerical windows in therefore have no reason to intersect ; the absence of observed anomalies is consistent with this sparsity and may indicate that is empty in practice.
Note. The restriction arises solely from the unconditional second-moment control of the on-line component (Lemma 1’). Sharper variance or pair-correlation bounds could lower this threshold, potentially extending Theorem A to all .
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
- 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.
- 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.
- Edwards, H. M. (1974). Riemann’s Zeta Function. Academic Press, New York.
- Huxley, M. N. (2005). Exponential sums and the Riemann zeta function. Acta Arithmetica, 126 (1), 1–27.
- 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.
- Ingham, A. E. (1940). The Distribution of Prime Numbers. Cambridge University Press, Cambridge.
- Korobov, N. M. (1958). On trigonometric sums and their applications. Doklady Akademii Nauk SSSR, 118 (1), 23–26.
- Levinson, N. (1974). More than one third of the zeros of the Riemann zeta-function are on the critical line. Mathematika, 20, 175–180.
- 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.
- 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.
- Titchmarsh, E. C. (1986). The Theory of the Riemann Zeta–Function (2nd ed., revised by D. R. Heath–Brown). Clarendon Press, Oxford.
- 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. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).