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/ChCore.lean
51    have h2 : ∑ u : A0, ψ (0, -(u : H)) = ∑ u : A0, φ u := by52      rw [← Equiv.sum_comp (Equiv.neg A0) φ]53      rfl54    rw [h2, h1, mul_zero]5556lemma sum_Th (A0 : AddSubgroup H) [Fintype A0] (D : ArithData H) (ell : AddChar (E0 × H) ℂ → ℂ) (T2 : Finset H)57    (hT2 : ∀ s ∈ T2, s ∈ A0) (b y : ℝ) (t : H) :58    ∑ u : A0, Th D ell T2 b y u t59      = (((Fintype.card A0 : ℝ) * (b * (delta2 T2 / 2)) : ℝ) : ℂ) * ∑ ψ ∈ PsiA A0, ψ (e1 t) * GPsi D ell ψ y := by60  unfold Th61  rw [← Finset.mul_sum, Finset.sum_comm]62  have hin : ∀ s ∈ T2, ∑ u : A0, ∑ ψ : AddChar (E0 × H) ℂ, ψ (-(e1 (s + (u : H) - t))) * ((b : ℂ) * GPsi D ell ψ y)63      = ((Fintype.card A0 : ℂ) * b) * ∑ ψ ∈ PsiA A0, ψ (e1 t) * GPsi D ell ψ y := by64    intro s hs65    rw [Finset.sum_comm]66    simp_rw [← Finset.sum_mul, sum_A A0 _ s t (hT2 s hs), ite_mul, zero_mul]67    rw [Finset.sum_ite_mem, Finset.univ_inter, Finset.mul_sum]68    exact Finset.sum_congr rfl fun ψ _ => by ring69  rw [Finset.sum_congr rfl hin, Finset.sum_const, nsmul_eq_mul, phiSet_card]70  have hH : (Fintype.card H : ℂ) ≠ 0 := by exact_mod_cast Fintype.card_ne_zero71  unfold delta272  push_cast73  field_simp7475lemma th_le (D : ArithData H) (ell : AddChar (E0 × H) ℂ → ℂ) (T2 : Finset H) (x b b' η X' θ A : ℝ) (u0 t : H) (w : E0 × H → ℝ)76    (hx : 3 ≤ x) (hb : 0 < b) (hη : 0 ≤ η) (hX' : 0 < X') (_hb' : 0 < b') (hbX : b' * X' ≤ x * b) (hθ : 0 ≤ θ)77    (hA : |A / b - x| ≤ 1) (hwpos : ∀ ρ, InPhi ρ → 0 < w ρ)78    (hwthick : ∀ ρ, IsThickAt T2 u0 ρ → b ≤ w ρ ∧ w ρ ≤ b + η + 1)79    (hwthin : ∀ ρ, InPhi ρ → ¬ IsThickAt T2 u0 ρ → w ρ ≤ 2 * b')80    (hThin : ThinScales D ell X' θ) (hLip : LipW D ell) :81    (Th D ell T2 b (A / b) u0 t).re ≤ (De D ell A t w).re + 2 * fPl H * (3 * (x + 1) * (η + 1) + (x + 1) * b * θ) := by82  obtain ⟨h1, h2⟩ := abs_le.1 hA83  have hA1 : (x - 1) * b ≤ A := by84    have : x - 1 ≤ A / b := by linarith85    rwa [le_div_iff₀ hb] at this86  have hA2 : A ≤ (x + 1) * b := by87    have : A / b ≤ x + 1 := by linarith88    rwa [div_le_iff₀ hb] at this89  have hA0 : 0 < A := lt_of_lt_of_le (by nlinarith) hA190  have hTh : Th D ell T2 b (A / b) u0 t = (1 / ((PhiSet (H := H)).card : ℂ)) *91      ∑ g ∈ univ.filter (fun g : E0 × H => ¬ InPhi (g + topPl t)), ∑ ψ : AddChar (E0 × H) ℂ,92        ψ (-g) * (if IsThickAt T2 u0 (cconj + g + topPl t) then (b : ℂ) * GPsi D ell ψ (A / b) else 0) := by93    unfold Th94    congr 195    have : ∀ g : E0 × H, ∑ ψ : AddChar (E0 × H) ℂ,96        ψ (-g) * (if IsThickAt T2 u0 (cconj + g + topPl t) then (b : ℂ) * GPsi D ell ψ (A / b) else 0)97        = if IsThickAt T2 u0 (cconj + g + topPl t) then98          ∑ ψ : AddChar (E0 × H) ℂ, ψ (-g) * ((b : ℂ) * GPsi D ell ψ (A / b)) else 0 := by99      intro g100      split_ifs <;> simp
446 linesLn 59UTF-8Raw