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/PrimitiveCosets/GzEq.lean
1import Development.AutomorphicArithmetic.PrimitiveCosets.CoreAtH23open UpperTheory.Comparison₂ Deduction.CH Formalism Formalism.HC Formalism.D5 Formalism.RankGapBounds.WeightedMeanData Formalism.LFunctionChainParameters.WeightedSlopeBounds Formalism.LFunctionChainParameters.characterSumData Formalism.LFunctionChainParameters.ThickSetMeanBounds Formalism.LFunctionChainParameters.LErr4  Formalism.LFunctionChainParameters.LChain Formalism.LFunctionChainParameters.LHost56theorem UpperTheory.Comparison₂.Gz_eq :7    ∀ y : ℝ, Formalism.Gz y = An.G y ∧ An.G y = Deduction.G y := by8  intro y9  have hsum : ∑ n ∈ Finset.Icc 1 ⌊y⌋₊, ArithmeticFunction.vonMangoldt n * (y / (n : ℝ) - 1)10      = ∑ n ∈ Finset.Icc 1 ⌊y⌋₊, An.abelian₂ n * max (y / (n : ℝ) - 1) 0 := by11    apply Finset.sum_congr rfl12    intro n hn13    rw [Finset.mem_Icc] at hn14    have hn1 : (1 : ℝ) ≤ n := by exact_mod_cast hn.115    have hy : (n : ℝ) ≤ y := by16      have hk : 0 < ⌊y⌋₊ := lt_of_lt_of_le Nat.zero_lt_one (le_trans hn.1 hn.2)17      have hy0 : 0 ≤ y := by18        by_contra hneg19        push_neg at hneg20        rw [Nat.floor_eq_zero.2 (lt_trans hneg zero_lt_one)] at hk21        exact lt_irrefl 0 hk22      exact le_trans (by exact_mod_cast hn.2) (Nat.floor_le hy0)23    have hpos : (0 : ℝ) < n := by linarith24    have : 0 ≤ y / (n : ℝ) - 1 := by25      rw [sub_nonneg, le_div_iff₀ hpos, one_mul]26      exact hy27    rw [max_eq_left this]28  have hre : (Deduction.ramp (fun _ => 1) y).re29      = ∑ n ∈ Finset.Icc 1 ⌊y⌋₊, An.abelian₂ n * max (y / (n : ℝ) - 1) 0 := by30    have hsub : Finset.Icc 1 ⌊y⌋₊ ⊆ Finset.range (⌊y⌋₊ + 1) := by31      intro n hn32      rw [Finset.mem_Icc] at hn33      rw [Finset.mem_range]34      omega35    rw [Finset.sum_subset hsub]36    · simp [Deduction.ramp, Complex.re_sum]37    · intro n hn hn'38      have h0 : n = 0 := by39        rw [Finset.mem_range] at hn40        rw [Finset.mem_Icc] at hn'41        omega42      subst h043      simp44  refine ⟨?_, ?_⟩45  · simp only [Formalism.Gz, Formalism.Sz, An.G]46    rw [hsum]47    ring48  · simp only [An.G, Deduction.G]49    rw [hre]50    ring
50 linesLn 42UTF-8Raw