
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.
Analytic Number Theory, Formalized Mathematics, Conditional Proof, Reproducible Research, Riemann Hypothesis, Formal Verification, Lean proof assistant
Analytic Number Theory, Formalized Mathematics, Conditional Proof, Reproducible Research, Riemann Hypothesis, Formal Verification, Lean proof assistant
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
