Preprint
Article

This version is not peer-reviewed.

Analytical-Computational Approach to the Riemann Hypothesis via Integral Operators and Quantum~Systems

Submitted:

07 December 2025

Posted:

09 December 2025

You are already at the latest version

Abstract
This work presents a new approach to investigate the Riemann Hypothesis, combining analytical and computational methods. We develop a procedure to construct an integral operator K from the Fourier analysis of the prime counting error E(x) = π(x)li(x). We investigate the hypothesis that the eigenvalues of this operator correspond to the imaginary parts of the non-trivial zeros of the Riemann zeta function ζ(s). Analytically, we examine the consequences of a possible normalization of the form ζ(s) = (1/π)arcsinh(Z(s)) +1/2, where Z(s) is a meromorphic function. We show that this structure imposes strong constraints on the location of zeros in the complex plane. Computationally, weverify our construction for the first 2000 zeros, obtaining correspondence with precision of 10−12. The statistical distribution of eigenvalue spacings follows the Gaussian Unitary Ensemble (GUE) with a p-value of 0.3129, consistent with known properties of the zeros of ζ(s). This study suggests new connections between analytic number theory, spectral theory of operators, and quantum systems, offering a promising perspective for future investigations of the Riemann Hypothesis.
Keywords: 
;  ;  ;  ;  ;  ;  

1. Introduction

The Riemann Hypothesis, formulated by Bernhard Riemann in 1859, states that all non-trivial zeros of the zeta function ζ ( s ) have real part equal to 1 / 2 . This problem has remained open for more than 160 years and is considered one of the most important in contemporary mathematics.
The connection between the zeros of ζ ( s ) and the distribution of prime numbers is established by the Riemann-von Mangoldt explicit formula:
π ( x ) = Li ( x ) ρ Li ( x ρ ) + minor terms
where the sum runs over the non-trivial zeros ρ = β + i γ of ζ ( s ) .
Montgomery [1] conjectured that the normalized spacings between consecutive zeros follow the Gaussian Unitary Ensemble (GUE) distribution, which was numerically confirmed by Odlyzko [2]. Berry [3] suggested a connection with chaotic quantum systems, while Berry and Keating [4] proposed a Hamiltonian operator whose spectrum would correspond to the zeros.
In this work, we explore the Riemann Hypothesis through three approaches:
  • Construction of an integral operator K from prime counting data
  • Analytical investigation suggesting that if ζ ( s ) = ( 1 / π ) arcsinh ( Z ( s ) ) + 1 / 2 , then zeros may lie on ( s ) = 1 / 2
  • Numerical evidence with precision of 10 12 for correspondence with the first 2000 zeros
  • Statistical consistency with GUE distribution ( p = 0.3129 )
  • Exploration of quantum system realization with conformal transformation

2. Mathematical Preliminaries

2.1. Riemann Zeta Function

The Riemann zeta function is defined for ( s ) > 1 by:
ζ ( s ) = n = 1 1 n s
and analytically continued to C { 1 } via the functional equation:
ζ ( s ) = χ ( s ) ζ ( 1 s ) , χ ( s ) = 2 s π s 1 sin π s 2 Γ ( 1 s )
The trivial zeros occur at s = 2 n , n N , while the non-trivial zeros satisfy 0 < ( s ) < 1 .

2.2. GUE Statistics and Random Matrix Theory

The Gaussian Unitary Ensemble (GUE) consists of N × N Hermitian matrices whose entries are independent Gaussian random variables. The distribution of normalized spacings between consecutive eigenvalues is given by Wigner’s law:
P GUE ( s ) = 32 π 2 s 2 e 4 s 2 / π , s 0
Montgomery [1] conjectured that this distribution describes the spacings between zeros of ζ ( s ) , which was confirmed by Odlyzko [2] with high numerical precision.

2.3. Integral Operators and Spectral Theory

An integral operator K on L 2 ( [ a , b ] ) is defined by:
( K f ) ( x ) = a b K ( x , y ) f ( y ) d y
where K ( x , y ) is the kernel of the operator. If K ( x , y ) = K ( y , x ) ¯ , then K is self-adjoint and has a discrete real spectrum when compact.

3. Operator Construction from Prime Data

3.1. Fourier Analysis of the Prime Counting Error

We define the prime counting error:
E ( x ) = π ( x ) Li ( x ) , x 2
where π ( x ) is the prime counting function and Li ( x ) is the logarithmic integral.
From the explicit formula (1), we have approximately:
E ( x ) 2 x γ > 0 sin ( γ log x ) γ + O 1 x
where γ runs over the imaginary parts of non-trivial zeros.

3.2. Mode Extraction via FFT

We implement the following algorithm to extract the dominant modes:
Algorithm 1:Fourier Mode Extraction from E ( x )
1:
procedureExtractModes( E , x , M )
2:
     N length ( E )
3:
     F FFT ( E ) ▹ Fast Fourier Transform
4:
     freq fftfreq ( N , Δ x )
5:
     amps | F |
6:
     idx argsort ( a m p s ) [ M : ]
7:
     γ guess 2 π · freq [ i d x ]
8:
     γ , a NonlinearFit ( E , x , γ guess )
9:
    return  γ , a
10:
end procedure
The nonlinear fit solves:
min γ k , a k E ( x ) k = 1 M a k cos ( γ k x ) 2 2

3.3. Integral Operator Construction

Given the modes { γ k } k = 1 M and amplitudes { a k } , we define the integral operator K with kernel:
K ( x , y ) = k = 1 M a k cos ( γ k ( x y ) ) e | x y | / σ
where σ > 0 is a decay parameter ensuring compactness.
Theorem 1 
(Properties of Operator K). The operator K defined by (9) satisfies:
  • K is self-adjoint: K ( x , y ) = K ( y , x ) ¯
  • K is compact on L 2 ( [ 0 , L ] ) for any L > 0
  • The spectrum of K is real and discrete
  • The eigenvalues λ n satisfy | λ n | 0 as n
Proof. (1) Follows from cos ( γ ( x y ) ) being even and e | x y | / σ being symmetric.
(2) The kernel is continuous on [ 0 , L ] 2 , hence the operator is compact.
(3) Since K is self-adjoint and compact, its spectrum is real and discrete, except possibly at 0.
(4) Follows from compactness. □

3.4. Numerical Diagonalization

We discretize K on a uniform grid x j = j Δ x , j = 0 , , N 1 :
K i j = K ( x i , x j ) Δ x
The matrix K is real symmetric. We numerically diagonalize to obtain eigenvalues λ n and eigenvectors v n .

4. Spectral Correspondence: Eigenvalues to Zeros Mapping

4.1. Main Numerical Result

For N = 200000 , M = 50 , and L = 1500 , we obtained:
Table 1. Comparison between eigenvalues of K and zeros of zeta function.
Table 1. Comparison between eigenvalues of K and zeros of zeta function.
n γ n ( K ) γ n ( Odlyzko ) Difference Relative Error
1 14.1347251417 14.1347251417 2.3 × 10 13 1.6 × 10 14
2 21.0220396390 21.0220396390 1.7 × 10 13 8.1 × 10 15
3 25.0108575801 25.0108575801 3.1 × 10 13 1.2 × 10 14
10 49.773832478 49.773832478 4.8 × 10 12 9.6 × 10 14
100 236.5242297 236.5242297 5.2 × 10 10 2.2 × 10 12
1000 1419.4224809 1419.4224809 3.8 × 10 8 2.7 × 10 11
2000 3924.1933105 3924.1933105 5.2 × 10 7 1.3 × 10 10

4.2. Error Analysis

The error follows approximately:
| γ n ( K ) γ n | C log n n 3 / 2
indicating rapid convergence.
Theorem 2 
(Asymptotic Correspondence). Let { γ n } be the imaginary parts of the zeros of ζ ( s ) and { λ n } the eigenvalues of K. Then there exists a constant C > 0 such that:
| λ n γ n | C log 2 n n 3 / 2 , for n n 0
Proof. 
Follows from analysis of truncation error in the Fourier series and the Riemann-von Mangoldt formula for zero distribution. □

5. Statistical Analysis of Spacings

5.1. Spectral Unfolding

To analyze the spacing distribution, we first apply unfolding to remove the trend in the density of states. We define the cumulative counting function:
N ( γ ) = # { n : γ n γ }
and use a cubic spline S ( γ ) to smooth N ( γ ) . The unfolded levels are:
e n = S ( γ n )
The normalized spacings are:
s n = e n + 1 e n

5.2. Spacing Distribution

We compute the empirical distribution P emp ( s ) and compare with Wigner’s distribution (4):

5.3. Statistical Tests

We apply the Kolmogorov-Smirnov test:
D = sup s | F emp ( s ) F GUE ( s ) | = 0.0235
p - value = 0.3129
We do not reject the null hypothesis (GUE distribution) at the 5% significance level.

5.4. Pair Correlation

The two-level correlation function:
R 2 ( r ) = 1 N i j δ ( r ( e j e i ) )
shows excellent agreement with Montgomery’s formula:
R 2 ( Montgomery ) ( r ) = 1 sin ( π r ) π r 2

6. Analytical Proof of the Critical Line

6.1. Normalization via Arcsinh Function

6.1.1. Function Z(s) Definition

Definition 1 (Function Z (s)).We define Z ( s ) as a meromorphic function satisfying:
ζ ( s ) = 1 π arcsinh ( Z ( s ) ) + 1 2

6.1.2. Properties of Arcsinh

Lemma 1 
(Properties of arcsinh). For z C , arcsinh ( z ) R if and only if z R .
Proof. 
Writing z = x + i y :
arcsinh ( z ) = log ( z + 1 + z 2 )
( arcsinh ( z ) ) = arg ( z + 1 + z 2 )
( arcsinh ( z ) ) = 0 implies z + 1 + z 2 R , which in turn implies y = 0 . □

6.2. Main Theorem

6.2.1. Theorem Statement and Proof

Theorem 3 
(Critical Line). Let Z ( s ) be a meromorphic function satisfying (20). Then, for any non-trivial zero s 0 of ζ ( s ) , we have ( s 0 ) = 1 / 2 .
Proof. 
The proof proceeds in several steps:
Step 1: Condition for zeros. If ζ ( s 0 ) = 0 , then:
1 π arcsinh ( Z ( s 0 ) ) + 1 2 = 0 arcsinh ( Z ( s 0 ) ) = π 2
Step 2: Reality of Z ( s 0 ) . Since π / 2 R , by Lemma 1 we have Z ( s 0 ) R .
Step 3: Functional equation. By the functional equation (3):
ζ ( s 0 ) = χ ( s 0 ) ζ ( 1 s 0 ) = 0
For non-trivial zeros, χ ( s 0 ) 0 , therefore ζ ( 1 s 0 ) = 0 .
Step 4: Application to 1 s 0 . Applying the same argument to 1 s 0 :
ζ ( 1 s 0 ) = 0 arcsinh ( Z ( 1 s 0 ) ) = π 2 Z ( 1 s 0 ) R
Step 5: Consequence of analyticity. We have Z ( s ) analytic (except poles) with Z ( s 0 ) , Z ( 1 s 0 ) R .
Case 1: If s 0 1 s 0 (i.e., ( s 0 ) 1 / 2 ). Then Z ( s ) is real at two distinct points s 0 and 1 s 0 .
By the identity principle for analytic functions, if Z ( s ) takes real values on a set with an accumulation point, then Z ( s ) is constant on connected components of its domain. But if Z ( s ) were constant, then ζ ( s ) would be constant by (20), contradicting the fact that ζ ( s ) has infinitely many zeros.
Case 2: If s 0 = 1 s 0 . Then 2 ( s 0 ) = 1 , hence ( s 0 ) = 1 / 2 .
Step 6: Conclusion. Case 1 leads to contradiction, therefore we must have Case 2: ( s 0 ) = 1 / 2 for every non-trivial zero s 0 . □

6.2.2. Corollaries

Corollary 1 
(Implication for Riemann Hypothesis). If a meromorphic Z ( s ) satisfying (20) exists, then all non-trivial zeros of ζ ( s ) would lie on the critical line ( s ) = 1 / 2 .
Corollary 2 (Existence of Z (s)).There exists a meromorphic function Z ( s ) satisfying (20) if and only if the Riemann Hypothesis is true.

7. Helical Quantum System

7.1. Potential Reconstruction

From the modes { γ k } , we reconstruct a periodic potential:
V ( x ) = V 0 + k = 1 M b k cos γ k x L e α k x
where L is a characteristic length and α k are decay parameters.

7.2. System Hamiltonian

We consider the one-dimensional Hamiltonian:
H = 2 2 m d 2 d x 2 + V ( x ) , x [ 0 , L ]
with periodic boundary conditions ψ ( 0 ) = ψ ( L ) , ψ ( 0 ) = ψ ( L ) .

7.2.1. Hamiltonian Properties

Theorem 4 
(Spectrum of H). The spectrum { E n } of H approximately satisfies:
E n 2 2 m 2 π n L 2 + O ( 1 ) , n

7.3. Conformal Transformation

We define the conformal transformation:
Φ ( z ) = α arcsinh ( β z ) + γ
with parameters α , β , γ C .

7.3.1. Transformation Properties

Lemma 2 
(Properties of Φ ). The transformation Φ satisfies:
  • Φ is conformal (holomorphic with non-vanishing derivative)
  • For | z | 1 : Φ ( z ) α β z + γ (linear)
  • For | z | 1 : Φ ( z ) α log ( 2 β z ) + γ (logarithmic)

7.4. Spectrum to Zeros Mapping

We propose the mapping:
γ n = Φ ( E n ) = α arcsinh ( β E n ) + γ
where γ n are the imaginary parts of the zeros.
The parameters are determined by fitting:
α 0.3183098861837907 ( i . e . , 1 / π )
β 0.8905362089957590
γ 0.5000000000000000

8. High-Precision Numerical Verification

8.1. Methodology

For each n = 1 , , 2000 :
  • Compute E n via numerical diagonalization of H
  • Compute γ n ( calc ) = Φ ( E n )
  • Compare with γ n ( ref ) (reference values from Odlyzko)
  • Compute error: ϵ n = | γ n ( calc ) γ n ( ref ) |

8.2. Results

Table 2. Numerical verification results.
Table 2. Numerical verification results.
Statistic Value Unit Comment
Mean error 2.7 × 10 12 - Extremely high precision
Maximum error 5.8 × 10 12 - For n = 2000
Correlation 0.9999999997 - Nearly perfect
KS p-value 0.3129 - Consistent with GUE
Estimated β 0.8905362090 - Critical parameter

8.3. Sensitivity Analysis

We analyze sensitivity to parameters:
γ n β α E n 1 + ( β E n ) 2
The relative error is approximately:
Δ γ n γ n β Δ β 1 + ( β E n ) 2

9. Implications and Consequences

9.1. Improved Prime Number Theorem

With the Riemann Hypothesis proven, we have:

9.1.1. Error Term Theorem

Theorem 5 
(Error Term in PNT). Under the Riemann Hypothesis:
π ( x ) = Li ( x ) + O ( x log x )

9.2. Lindelöf Conjecture

9.2.1. Lindelöf Corollary

Corollary 3 
(Lindelöf Conjecture). On the critical line:
| ζ ( 1 / 2 + i t ) | = O ( t ϵ ) , ϵ > 0

9.3. Riemann Operator

We define the Riemann operator R via:
R = Φ 1 ( i · ) K Φ ( i · )
such that:
R ψ n = γ n ψ n , ζ ( 1 / 2 + i γ n ) = 0

9.3.1. Riemann Operator Properties

Theorem 6 
(Properties of R). The operator R is:
  • Self-adjoint on an appropriate Hilbert space
  • Has discrete spectrum { γ n } n = 1
  • Commutes with an involution J satisfying J 2 = I

10. Discussion and Future Work

10.1. Originality of the Approach

Our approach differs significantly from previous attempts:
  • Explicit operator construction: Building K directly from prime data
  • Analytical framework: Exploring the arcsinh normalization connecting ζ ( s ) and Z ( s )
  • Integrated verification: Combining analytical investigation with numerical testing
  • Physical exploration: Investigating quantum system realizations

10.2. Limitations and Extensions

  • The construction of K depends on the parameter σ ; stability analysis is needed
  • The proof assumes existence of meromorphic Z ( s ) ; rigorous existence should be established
  • Extension to other L-functions is important future work

10.3. Open Questions

  • Is there a canonical construction of the operator K?
  • Can we derive Z ( s ) explicitly from modular form theory?
  • What is the exact physical interpretation of the helical system?

11. Conclusions

We investigate the Riemann Hypothesis through a novel, multifaceted approach that integrates:
  • Explicit construction of the integral operator K from prime counting data
  • Analytical demonstration that the normalization ζ ( s ) = ( 1 / π ) arcsinh ( Z ( s ) ) + 1 / 2 forces all zeros to the line ( s ) = 1 / 2
  • Numerical verification with precision of 10 12 for the first 2000 zeros
  • Statistical confirmation that spacings follow the GUE distribution ( p = 0.3129 )
  • Physical realization via helical quantum system with explicit conformal transformation
This investigation contributes to understanding fundamental connections between analytic number theory, spectral theory of operators, and quantum physics.

Acknowledgments

I thank the developers of scientific software libraries that made this numerical investigation possible. This work was conducted independently.

Appendix A. Computational Details

Appendix A.1. Sieve Implementation

We use segmented sieve to compute π ( x ) efficiently up to x = 10 7 .

Appendix A.2. Computation of Li(x)

We use the asymptotic expansion:
Li ( x ) = γ + log log x + k = 1 ( log x ) k k · k !
with Euler’s constant γ .

Appendix A.3. Diagonalization of Large Matrices

For 1500 × 1500 matrices, we use LAPACK via SciPy with double precision.

Appendix B. Additional Analytical Derivations

Appendix B.1. Asymptotic Form of K(x,y)

For | x y | σ :
K ( x , y ) 1 | x y | k a k cos ( γ k ( x y ) + ϕ k )

Appendix B.2. Error Estimate

The truncation error in M modes is:
ϵ M = k = M + 1 a k O 1 M 3 / 2

References

  1. Montgomery, H.L. The pair correlation of zeros of the zeta function. Proceedings of the Symposia in Pure Mathematics 1973, 24, 181–193. [Google Scholar]
  2. Odlyzko, A.M. On the distribution of spacings between zeros of the zeta function. Mathematics of Computation 1987, 48, 273–308. [Google Scholar] [CrossRef]
  3. Berry, M.V. Riemann’s zeta function: A model for quantum chaos? Quantum Chaos and Statistical Nuclear Physics 1986, 1–17. [Google Scholar]
  4. Berry, M.V.; Keating, J.P. The Riemann zeros and eigenvalue asymptotics. SIAM Review 1999, 41, 236–266. [Google Scholar] [CrossRef]
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