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
301    nlinarith302  have hu : ∀ u0 ∈ A0, ∑ t ∈ TT, ∑ _j : Fin m, (Th D ell T2 b (a t / b) u0 t).re ≤ Err + 2 * (TT.card : ℝ) * m * b / x := by303    intro u0 hu0304    have h1 : ∑ t ∈ TT, ∑ _j : Fin m, (Th D ell T2 b (a t / b) u0 t).re305        ≤ ∑ t ∈ TT, ∑ j : Fin m, (ASK D N (a t) t (w u0 j) - (MAIN ell (a t) (w u0 j)).re + 2 * b / x) := by306      refine Finset.sum_le_sum fun t ht => Finset.sum_le_sum fun j _ => ?_307      have k1 := th_le D ell T2 x b b' η X' θ (a t) u0 t (w u0 j) hx hb hη hX' hb' hbX hθ (ha t ht) (hwpos u0 hu0 j)308        (hwthick u0 hu0 j) (hwthin u0 hu0 j) hThin (lipschitz_weight_all H D ell)309      have k2 := congrArg Complex.re (ch_balance D S hD ell (a t) t (w u0 j) (hapos t ht) (hwpos u0 hu0 j) N310        (fun ρ hρ => hN u0 hu0 j t ρ ht hρ))311      rw [Complex.sub_re, Complex.ofReal_re] at k2312      linarith313    simp only [Finset.sum_add_distrib] at h1314    have e : ∑ _t ∈ TT, ∑ _j : Fin m, 2 * b / x = 2 * (TT.card : ℝ) * m * b / x := by315      simp only [Finset.sum_const, nsmul_eq_mul, Finset.card_univ, Fintype.card_fin]316      ring317    rw [e] at h1318    have := hTop u0 hu0319    unfold gapA at this320    linarith321  have hA : (0 : ℝ) < Fintype.card A0 := by exact_mod_cast Fintype.card_pos322  have h1 : ∑ u : A0, ∑ t ∈ TT, ∑ _j : Fin m, (Th D ell T2 b (a t / b) u t).re323      ≤ (Fintype.card A0 : ℝ) * (Err + 2 * (TT.card : ℝ) * m * b / x) := by324    refine (Finset.sum_le_sum fun (u : A0) _ => hu u u.2).trans (le_of_eq ?_)325    rw [Finset.sum_const, nsmul_eq_mul, Finset.card_univ]326  have h2 : ∑ u : A0, ∑ t ∈ TT, ∑ _j : Fin m, (Th D ell T2 b (a t / b) u t).re327      = (Fintype.card A0 : ℝ) * ((m * b * (delta2 T2 / 2)) *328        ∑ t ∈ TT, (∑ ψ ∈ PsiA A0, ψ (e1 t) * GPsi D ell ψ (a t / b)).re) := by329    rw [Finset.sum_comm, Finset.mul_sum, Finset.mul_sum]330    refine Finset.sum_congr rfl fun t _ => ?_331    simp only [Finset.sum_const, nsmul_eq_mul, Finset.card_univ, Fintype.card_fin]332    rw [← Finset.mul_sum, ← Complex.re_sum, sum_Th A0 D ell T2 hT2, Complex.re_ofReal_mul]333    ring334  rw [h2] at h1335  have h3 := le_of_mul_le_mul_left h1 hA336  have h4 : 0 ≤ (m : ℝ) * b * (delta2 T2 / 2) := by unfold delta2; positivity337  have h5 := mul_le_mul_of_nonneg_left hY h4338  nlinarith339340end CharacterBalanceMoves341342set_option maxHeartbeats 1600000 in343theorem ch_core (C ε CE Ko c M : ℝ) (hC : 0 ≤ C) (hε : 0 < ε) (hc : |c| ≤ 1) : ∃ x1 : ℝ, ∀ x ≥ x1,344    ∀ (H : Type) [AddCommGroup H] [Fintype H] [DecidableEq H] (m : ℕ) (D : ArithData H) (S : Finset ℕ)345      (ell : AddChar (E0 × H) ℂ → ℂ) (N : ℕ) (TT T2 : Finset H) (a : H → ℝ) (w : H → Fin m → E0 × H → ℝ)346      (b b' k aE η X' θ : ℝ) (A0 : AddSubgroup H) (Kp : Finset (AddChar (E0 × H) ℂ)),347      HostFactsS D S → 0 < b → 0 ≤ aE → 0 < k → (m : ℝ) ≤ x ^ ((1 : ℝ) / 2 + ε / 2) → x * m ≤ k →348      SizesA A0 TT T2 a w N x b b' η X' θ → ThinScales D ell X' θ → CostWindows x (fPl H) b η θ →349      RestSize ε x (Fintype.card H) TT.card T2.card m b k aE → (∀ s ∈ T2, s ∈ A0) → CharsA ell A0 Kp TT c M Ko CE ε x →350      (∀ u ∈ A0, gapA D N ell TT a w u ≤ x ^ (C * ε) * errorBracketSizeWindows x ε (Fintype.card H) TT.card T2.card m b k aE) →
446 linesLn 315UTF-8Raw