Proof AtlasMCP access
ProofsNumber theory

Lean proof review
The Riemann Hypothesis

Unverified claim

A proposed Lean proof that every nontrivial zero of ζ(s) has real part ½.

Lean 4Number theoryƒDirichlet L-functions
Development/AutomorphicArithmetic/DedekindLFunctions/LandauTheorems/mellinGchiModOne.lean
101    rw [add_sub_cancel_right, cpow_add _ _ hyC, cpow_one]102    push_cast103    field_simp104    ring105  have h := integral_Ioi_of_hasDerivAt_of_tendsto' hd106    ((hi.const_mul _).add (integrableOn_Ioi_cpow_of_lt ha zero_lt_one)) ht107  rw [integral_add (hi.const_mul _) (integrableOn_Ioi_cpow_of_lt ha zero_lt_one),108    integral_const_mul, integral_Ioi_cpow_of_lt ha zero_lt_one] at h109  simp only [ofReal_one, one_cpow, Real.log_one, ofReal_zero, zero_mul, sub_zero] at h110  have e2 : (s - 1) ^ 2 = (-s + 1) ^ 2 := by ring111  rw [e2]112  field_simp at h ⊢113  linear_combination h114115theorem mellin_Gchi_modOne (χ : DirichletCharacter ℂ 1) (s : ℂ) (hs : 1 < s.re) :116    ∫ y in Ioi (1 : ℝ), Gchi χ y * (y : ℂ) ^ (-s - 1) =117      -(deriv riemannZeta s / riemannZeta s + 1 / (s - 1) + 1 - (1 + Real.eulerMascheroniConstant) * s) /118        (s * (s - 1)) := by119  have h1 : χ = 1 := DirichletCharacter.level_one χ120  have h2 : ∀ n : ℕ, χ n = 1 := fun n => by121    rw [h1]; exact MulChar.one_apply (isUnit_of_subsingleton _)122  have ha : (-s).re < -1 := by simp; linarith123  have hs0 : s ≠ 0 := by124    rintro rfl125    simp at hs126    linarith127  have hs1 : s - 1 ≠ 0 := by128    intro h129    have := congrArg Complex.re h130    simp at this131    linarith132  let T : ℕ → ℝ → ℂ := fun n y => ((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ) *133      (((max (y / n - 1) 0 : ℝ) : ℂ) * (y : ℂ) ^ (-s - 1))134  let E : ℝ → ℂ := fun y => (1 + Real.eulerMascheroniConstant) * (y : ℂ) ^ (-s) -135    ((Real.log y : ℝ) : ℂ) * (y : ℂ) ^ (-s)136  have hz : ∀ y : ℝ, ∀ n ∉ Finset.range (⌊y⌋₊ + 1), T n y = 0 := by137    intro y n hn138    have hn' : ⌊y⌋₊ + 1 ≤ n := by simpa using hn139    have hpos : (0 : ℝ) < n := by140      have : 0 < n := by omega141      exact_mod_cast this142    have hlt : y < n := by143      have h1 := Nat.lt_floor_add_one y144      have h2 : ((⌊y⌋₊ + 1 : ℕ) : ℝ) ≤ n := by exact_mod_cast hn'145      push_cast at h2146      linarith147    have : max (y / n - 1) 0 = 0 := by148      apply max_eq_right149      have := (div_lt_one hpos).mpr hlt150      linarith
203 linesLn 124UTF-8Raw