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
201202lemma one_char (A0 : AddSubgroup H) (Kp : Finset (AddChar (E0 × H) ℂ)) (D : ArithData H) (ell : AddChar (E0 × H) ℂ → ℂ)203    (TT : Finset H) (y : H → ℝ)204    {x Cd c ρ Ko L R : ℝ} (hx : 3 ≤ x) (hCd : 0 ≤ Cd) (hy : ∀ t ∈ TT, |y t - x| ≤ 1) (hDer : DerivInt D ell Cd)205    (hρ : 0 ≤ ρ) (hKo : 0 ≤ Ko) (h0K : 0 ∈ Kp) (hsg : ∀ ψ ∈ Kp, ψ sgc0 = 1)206    (h2 : ∀ ψ ∈ Kp, (¬ ∀ h : H, ψ (0, h) = 1) → ‖(∑ t ∈ TT, ψ (0, t)) - (c : ℂ) * (TT.card : ℂ)‖ ≤ ρ * (TT.card : ℝ))207    (hK : ∀ ψ ∈ Kp, ψ ≠ 0 → ‖ell ψ‖ ≤ Ko)208    (h3 : ∀ ψ ∈ PsiA A0, ψ ∉ Kp → ‖ell ψ‖ ≤ L)209    (r1 : Cd ≤ R) (r2 : Real.log (x + 1) + Cd + Ko + ρ * (x * (Real.log x + Cd + Ko)) ≤ R)210    (r3 : Real.log (x + 1) + Cd + L ≤ R)211    (ψ : AddChar (E0 × H) ℂ) (hψ : ψ ∈ PsiA A0) :212    (TT.card : ℝ) * (vv Kp D ell c x ψ - R) ≤ ∑ t ∈ TT, (ψ (e1 t) * GPsi D ell ψ (y t)).re := by213  classical214  by_cases h0 : ψ = 0215  · subst h0216    have hw : wtA c (0 : AddChar (E0 × H) ℂ) = 1 := by217      unfold wtA218      rw [if_pos (fun _ => AddChar.zero_apply _)]219    unfold vv220    rw [if_pos h0K, hw, one_mul, ← nsmul_eq_mul, ← Finset.sum_const]221    refine Finset.sum_le_sum fun t ht => ?_222    obtain ⟨hy1, hy2⟩ := abs_le.1 (hy t ht)223    have hG := hDer.2 (y t) x (by linarith) (by linarith)224    have hG' := mul_le_mul_of_nonneg_left (hy t ht) hCd225    have := (abs_le.1 (hG.trans hG')).1226    simp [GPsi]227    linarith228  by_cases hX : ψ ∈ Kp229  · unfold vv230    rw [if_pos hX]231    have h2' : ‖(∑ t ∈ TT, ψ (0, t)) - ((wtA c ψ : ℝ) : ℂ) * (TT.card : ℂ)‖ ≤ ρ * (TT.card : ℝ) := by232      unfold wtA233      split_ifs with h234      · simp only [h, Finset.sum_const, nsmul_eq_mul, mul_one, Complex.ofReal_one, one_mul, sub_self, norm_zero]235        positivity236      · exact h2 ψ hX h237    generalize wtA c ψ = c at h2' ⊢238    have hk : ∀ t, ψ (e1 t) = ψ (0, t) := by239      intro t240      have : (e1 t : E0 × H) = sgc0 + (0, t) := by simp [e1, sgc0]241      rw [this, AddChar.map_add_eq_mul, hsg ψ hX, one_mul]242    simp_rw [hk]243    have e : ∑ t ∈ TT, ψ (0, t) * GPsi D ell ψ (y t) - (c : ℂ) * (TT.card : ℂ) * GPsi D ell ψ x244        = ∑ t ∈ TT, ψ (0, t) * (GPsi D ell ψ (y t) - GPsi D ell ψ x)245          + ((∑ t ∈ TT, ψ (0, t)) - (c : ℂ) * (TT.card : ℂ)) * GPsi D ell ψ x := by246      simp_rw [mul_sub]247      rw [Finset.sum_sub_distrib, sub_mul, Finset.sum_mul]248      ring249    have hl := hK ψ hX h0250    have n1 : ‖∑ t ∈ TT, ψ (0, t) * (GPsi D ell ψ (y t) - GPsi D ell ψ x)‖ ≤ (TT.card : ℝ) * (Real.log (x + 1) + Cd + Ko) := by
446 linesLn 206UTF-8Raw