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
251      refine (norm_sum_le _ _).trans ?_252      rw [← nsmul_eq_mul, ← Finset.sum_const]253      refine Finset.sum_le_sum fun t ht => ?_254      rw [norm_mul, AddChar.norm_apply, one_mul]255      have := move D ell hx hCd (hy t ht) hDer ψ h0256      linarith257    have n2 : ‖((∑ t ∈ TT, ψ (0, t)) - (c : ℂ) * (TT.card : ℂ)) * GPsi D ell ψ x‖258        ≤ ρ * (TT.card : ℝ) * (x * (Real.log x + Cd + Ko)) := by259      rw [norm_mul]260      refine mul_le_mul h2' ((triv D ell hx hCd hDer ψ h0).trans ?_) (norm_nonneg _) (by positivity)261      exact mul_le_mul_of_nonneg_left (by linarith) (by linarith)262    have n3 := (norm_add_le _ _).trans (add_le_add n1 n2)263    rw [← e] at n3264    have n4 := (abs_le.1 ((Complex.abs_re_le_norm _).trans n3)).1265    have e2 : ((c : ℂ) * (TT.card : ℂ) * GPsi D ell ψ x).re = c * TT.card * (GPsi D ell ψ x).re := by266      rw [show (c : ℂ) * (TT.card : ℂ) = ((c * TT.card : ℝ) : ℂ) by push_cast; ring, Complex.re_ofReal_mul]267    rw [Complex.sub_re, e2, Complex.re_sum] at n4268    have n5 := mul_le_mul_of_nonneg_left r2 (Nat.cast_nonneg (α := ℝ) TT.card)269    nlinarith270  · unfold vv271    rw [if_neg hX, ← nsmul_eq_mul, ← Finset.sum_const]272    refine Finset.sum_le_sum fun t ht => ?_273    have k2 := h3 ψ hψ hX274    have k3 := move D ell hx hCd (hy t ht) hDer ψ h0275    have k4 : ‖GPsi D ell ψ (y t)‖ ≤ ‖GPsi D ell ψ x‖ + ‖GPsi D ell ψ (y t) - GPsi D ell ψ x‖ := by276      simpa using norm_add_le (GPsi D ell ψ x) (GPsi D ell ψ (y t) - GPsi D ell ψ x)277    have k5 : ‖ψ (e1 t) * GPsi D ell ψ (y t)‖ ≤ ‖GPsi D ell ψ x‖ + R := by278      rw [norm_mul, AddChar.norm_apply, one_mul]279      linarith280    have := (abs_le.1 ((Complex.abs_re_le_norm _).trans k5)).1281    linarith282283lemma core (A0 : AddSubgroup H) (D : ArithData H) (S : Finset ℕ) (hD : HostFactsS D S) (ell : AddChar (E0 × H) ℂ → ℂ) (N : ℕ) {m : ℕ}284    (TT T2 : Finset H) (a : H → ℝ) (w : H → Fin m → E0 × H → ℝ) {x b b' η X' θ Err Y : ℝ}285    (hx : 3 ≤ x) (hb : 0 < b) (hS : SizesA A0 TT T2 a w N x b b' η X' θ) (hThin : ThinScales D ell X' θ)286    (hC : CostWindows x (fPl H) b η θ) (hT2 : ∀ s ∈ T2, s ∈ A0)287    (hTop : ∀ u0 ∈ A0, gapA D N ell TT a w u0 ≤ Err)288    (hY : (TT.card : ℝ) * Y ≤ ∑ t ∈ TT, (∑ ψ ∈ PsiA A0, ψ (e1 t) * GPsi D ell ψ (a t / b)).re) :289    (TT.card : ℝ) * m * b * (delta2 T2 / 2) * Y ≤ Err + 2 * (TT.card : ℝ) * m * b / x := by290  classical291  obtain ⟨hη, hX', hb', hbX, hθ, ha, hwpos, hwthick, hwthin, hN⟩ := hS292  have hapos : ∀ t ∈ TT, 0 < a t := fun t ht => by293    have h1 : x - 1 ≤ a t / b := by linarith [(abs_le.1 (ha t ht)).1]294    rw [le_div_iff₀ hb] at h1295    nlinarith296  have hK : 2 * fPl H * (3 * (x + 1) * (η + 1) + (x + 1) * b * θ) ≤ 2 * b / x := by297    have h1 := mul_le_mul_of_nonneg_left hC.1 hb.le298    have h2 := hC.2299    have e : 2 * b / x = b * (1 / x) + b / x := by ring300    rw [e]
446 linesLn 286UTF-8Raw