Empirical Investigation of the Riemann Hypothesis Using Machine Learning: A Falsifiability-Oriented Approach

Shianghau Wu ()
Additional contact information
Shianghau Wu: Department of International Business, Chung Yuan Christian University, Taoyuan City 320, Taiwan

Mathematics, 2025, vol. 13, issue 17, 1-14

Abstract: The Riemann Hypothesis (RH) asserts that all non-trivial zeros of the Riemann zeta function lie on the critical line Re(s) = 0.5, yet no general proof exists despite extensive numerical verification. This study introduces a machine learning–based framework that combines classification, explainability, contradiction testing, and generative modeling to provide empirical evidence consistent with RH. First, discriminative models augmented with SHAP analysis reveal that the real and imaginary parts of ζ(s) contribute stable explanatory signals exclusively along the critical line, while off-line regions exhibit negligible attributions. Second, a contradiction-test framework, constructed from systematically sampled off-line points, shows no indication of spurious zero-like behavior. Finally, a mixture-density variational autoencoder (MDN-VAE) trained on 10,000 zero spacings produces synthetic distributions that closely match the empirical spacing law, with a Kolmogorov–Smirnov test (KS = 0.041, p = 0.075) confirming statistical indistinguishability. Together, these findings demonstrate that machine learning and explainable AI not only reproduce the known statistical properties of zeta zeros but also reinforce the absence of contradictions to RH under extended empirical exploration. While this framework does not constitute a formal proof, it offers a falsifiability-oriented, data-driven methodology for exploring deep mathematical conjectures. This empirical evaluation involved a baseline of 12,005 points, including 5 known zeros, and 15 off-line test points. The Random Forest classifier achieved high accuracy in distinguishing critical-line zeros, and consistently rejected off-line points. The generative models further corroborated these findings.

Keywords: Riemann Hypothesis; machine learning; proof by contradiction; Random Forest; Generative Adversarial Network; SHAP (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/17/2824/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/17/2824/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:17:p:2824-:d:1740268

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().