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
101    simp_rw [this]102    rw [← Finset.sum_filter, Finset.filter_filter, thick_filter,103      Finset.sum_image (fun s _ s' _ h => thick_inj u0 t (Set.mem_univ s) (Set.mem_univ s') h)]104    rfl105  have hn := CR.norm_avg_le (univ.filter (fun g : E0 × H => ¬ InPhi (g + topPl t))) (CR.card_S_le t _ (Finset.Subset.refl _))106    (fun g ψ => ((w (cconj + g + topPl t) : ℝ) : ℂ) * GPsi D ell ψ (A / w (cconj + g + topPl t))107      - (if IsThickAt T2 u0 (cconj + g + topPl t) then (b : ℂ) * GPsi D ell ψ (A / b) else 0))108    (3 * (x + 1) * (η + 1) + (x + 1) * b * θ) (by positivity) (by109      intro g hg ψ110      have hρ := CR.partner_inPhi t (Finset.mem_filter.1 hg).2111      have hw0 := hwpos _ hρ112      have p1 : 0 ≤ 3 * (x + 1) * (η + 1) := by positivity113      have p2 : 0 ≤ (x + 1) * b * θ := by positivity114      by_cases hth : IsThickAt T2 u0 (cconj + g + topPl t)115      · simp only [if_pos hth]116        obtain ⟨k1, k2⟩ := hwthick _ hth117        have hl := hLip ψ A (w (cconj + g + topPl t)) b hA0 hw0 hb118        rw [min_eq_right k1, abs_of_nonneg (by linarith)] at hl119        have e1 : 3 * A / b ≤ 3 * (x + 1) := by120          rw [div_le_iff₀ hb]; nlinarith121        have e2 : 3 * A / b * (w (cconj + g + topPl t) - b) ≤ 3 * (x + 1) * (η + 1) :=122          mul_le_mul e1 (by linarith) (by linarith) (by positivity)123        linarith124      · simp only [if_neg hth, sub_zero]125        have hw2 := hwthin _ hρ hth126        have hy : X' / 3 ≤ A / w (cconj + g + topPl t) := by127          rw [le_div_iff₀ hw0]128          have k1 : X' / 3 * w (cconj + g + topPl t) ≤ X' / 3 * (2 * b') :=129            mul_le_mul_of_nonneg_left hw2 (by positivity)130          nlinarith131        have ht' := hThin ψ _ hy132        rw [norm_mul, Complex.norm_real, Real.norm_eq_abs, abs_of_pos hw0]133        have : w (cconj + g + topPl t) * ‖GPsi D ell ψ (A / w (cconj + g + topPl t))‖ ≤ (x + 1) * b * θ :=134          calc w (cconj + g + topPl t) * ‖GPsi D ell ψ (A / w (cconj + g + topPl t))‖135            ≤ w (cconj + g + topPl t) * (A / w (cconj + g + topPl t) * θ) :=136              mul_le_mul_of_nonneg_left ht' hw0.le137          _ = A * θ := by field_simp138          _ ≤ (x + 1) * b * θ := mul_le_mul_of_nonneg_right hA2 hθ139        linarith)140  have hre := (abs_le.1 (le_trans (Complex.abs_re_le_norm _) hn)).1141  have e : (De D ell A t w).re - (Th D ell T2 b (A / b) u0 t).re = ((1 / ((PhiSet (H := H)).card : ℂ)) *142      ∑ g ∈ univ.filter (fun g : E0 × H => ¬ InPhi (g + topPl t)), ∑ ψ : AddChar (E0 × H) ℂ,143        ψ (-g) * (((w (cconj + g + topPl t) : ℝ) : ℂ) * GPsi D ell ψ (A / w (cconj + g + topPl t))144      - (if IsThickAt T2 u0 (cconj + g + topPl t) then (b : ℂ) * GPsi D ell ψ (A / b) else 0))).re := by145    rw [CR.De_re, hTh]146    unfold balTop147    rw [← Complex.sub_re, ← mul_sub, ← Finset.sum_sub_distrib]148    refine congrArg Complex.re (congrArg _ (Finset.sum_congr rfl fun g _ => ?_))149    rw [← Finset.sum_sub_distrib]150    exact Finset.sum_congr rfl fun ψ _ => by rw [CR.GC_host]; ring
446 linesLn 111UTF-8Raw