RDCbum/RH_demo: ERURH v1.0.1-preprint — clean archival release
Abstract
This deposit presents a machine-checked (Lean) conditional reduction of the Riemann Hypothesis. The work formalizes a verified implicationERURH_GlobalAssumptions → RiemannHypothesis,where all logical steps are mechanically checked in Lean. The remaining analytic input is isolated into a finite, explicit set of assumptions (Theorems A, B, C and normalization bridges), each prepared for independent external audit. No unconditional claim of the Riemann Hypothesis is made. The accompanying GitHub repository provides the full Lean formalization together with a deterministic pipeline to regenerate and verify all referenced numerical certificates.
Fields of Study & Subjects
Business Process Modeling and Analysis
Logic
programming
and type systems
Mathematics
Computing
and Information Processing
Publication details
- Journal / source
- HAL (Le Centre pour la Communication Scientifique Directe)
- Publication date
- 5 February 2026
- Language
- EN
- Document type
- Preprint