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/landauWindow.lean
1import Development.AutomorphicArithmetic.DedekindLFunctions.LandauZeroFreeCriterion2import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauCauchy3import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauPoleAsym4import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.landauTails5import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauKernelMax6import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.landauWindowIneq7import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauPoleReLe8import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauCoeff9import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauFinite10import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauNearest11import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauDichotomy12import Development.AutomorphicArithmetic.DedekindLFunctions.LandauTheorems.LandauGrowthContra1314open Complex MeasureTheory Set Filter Topology1516noncomputable section1718namespace Deduction1920theorem landau_window_contra {c d e E M C : ℝ} (hc : 0 < c) (hd : 0 < d) (hde : d < e) (heE : e ≤ E)21    (H : ∀ η : ℝ, 0 < η → ∀ U₀ : ℝ, ∃ U : ℝ, U₀ ≤ U ∧ ∃ k : ℕ, U ≤ k ∧22      c / d ^ k ≤ M / e ^ k + C * Real.exp (η * U) / E ^ k) : False := by23  obtain ⟨η, hη, U₀, hU₀⟩ := landau_growth_contra (C := |M| + |C|) hc hd hde24  obtain ⟨U, hU, k, hk, hle⟩ := H η hη (max U₀ 0)25  have h1 := hU₀ U ((le_max_left _ _).trans hU) k hk26  have hU0 : 0 ≤ U := (le_max_right _ _).trans hU27  have he : 0 < e := hd.trans hde28  have hek : 0 < e ^ k := pow_pos he k29  have hexp : 1 ≤ Real.exp (η * U) := Real.one_le_exp (by positivity)30  have h2 : M / e ^ k ≤ |M| * Real.exp (η * U) / e ^ k := by31    apply div_le_div_of_nonneg_right _ hek.le32    exact (le_abs_self M).trans (le_mul_of_one_le_right (abs_nonneg M) hexp)33  have h3 : C * Real.exp (η * U) / E ^ k ≤ |C| * Real.exp (η * U) / e ^ k := by34    apply div_le_div₀ (by positivity) _ hek (pow_le_pow_left₀ he.le heE k)35    exact mul_le_mul_of_nonneg_right (le_abs_self C) (Real.exp_pos _).le36  have h4 : (|M| + |C|) * Real.exp (η * U) / e ^ k37      = |M| * Real.exp (η * U) / e ^ k + |C| * Real.exp (η * U) / e ^ k := by ring38  linarith3940theorem landau_window_key {g : ℝ → ℝ} {Φ : ℂ → ℂ} {Z : Set ℂ} (hP : PoleData g Φ Z) {θ δ : ℝ}41    (hθ : 0 < θ) (hθ1 : θ < 1) (hδ : 0 < δ) (hW : WindowHypU g θ δ) :42    ∃ σ : ℝ, 2 < σ ∧ ∃ C : ℝ, ∀ η : ℝ, 0 < η → ∀ U₀ : ℝ, ∃ U : ℝ, U₀ ≤ U ∧ ∃ k : ℕ, U ≤ k ∧ ∀ γ : ℝ,43      ‖(-1) ^ k * iteratedDeriv k Φ ((σ : ℂ) + γ * I) / (k.factorial : ℂ)‖ +44        ((-1) ^ k * iteratedDeriv k Φ (σ : ℂ) / (k.factorial : ℂ)).re ≤45        C * Real.exp (η * U) / (σ - θ) ^ k := by46  obtain ⟨σ, hσ, C, hC⟩ := landau_tails hδ47  obtain ⟨C₀, hC₀⟩ := hP.growth48  have hC₀0 : 0 ≤ C₀ := by49    have := hC₀ 0 le_rfl50    simp only [mul_zero, Real.exp_zero, mul_one] at this
170 linesLn 30UTF-8Raw