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/CharacterBoxes/WinPairs.lean
1import Development.AutomorphicArithmetic.CharacterBoxes.TwistForm23open Formalism.HC UpperTheory.Top45theorem UpperTheory.Top.winPairs :6    ∀ (ψ : PChar) (eps c : ℝ), 0 < eps → eps < 1 / 52 → 1 ≤ c → VWinAt ψ 401 → PairEx →7      ∃ J : ℝ, 1 ≤ J ∧ ∀ y : ℝ, ∃ Z : ℝ, y ≤ Z ∧ ∀ x : ℝ, Z ≤ x → x ≤ Z ^ ((3 : ℝ) / 2) →8        ∃ (Y : ℝ) (q d e : ℕ), WinDatum ψ eps J c x Y q d e := by9  intro ψ eps c heps heps52 hc hV hP10  obtain ⟨e, he⟩ := exists_pageN eps heps11  obtain ⟨J, hJ, X0, hX0⟩ := hV eps heps heps52 e he12  have hN : 0 < ψ.N := Nat.pos_of_ne_zero (NeZero.ne _)13  obtain ⟨Y1, hY1⟩ := hP ψ.N hN eps J heps heps52 hJ14  have ha : 0 < 2 + 8 * eps := by linarith15  have hc0 : 0 ≤ c := by linarith16  obtain ⟨k, hk1, hka⟩ : ∃ k : ℝ, 1 ≤ k ∧ k ^ (2 + 8 * eps) = c := by17    refine ⟨c ^ (1 / (2 + 8 * eps)), Real.one_le_rpow hc (one_div_nonneg.2 ha.le), ?_⟩18    rw [one_div, Real.rpow_inv_rpow hc0 ha.ne']19  have hk0 : 0 ≤ k := by linarith20  refine ⟨J, hJ, fun y => ?_⟩21  have hJ0 : J ≠ 0 := ne_of_gt (by linarith)22  have hJi : 0 ≤ 1 / J := one_div_nonneg.2 (by linarith)23  obtain ⟨M, hM1, hMy, hMY1, hMk3, hMk400⟩ : ∃ M : ℝ, 1 ≤ M ∧ y ≤ M ∧ Y1 ≤ M ∧24      k ^ (3 : ℝ) ≤ M ∧ k ^ (400 : ℝ) ≤ M :=25    ⟨max 1 (max y (max Y1 (max (k ^ (3 : ℝ)) (k ^ (400 : ℝ))))), by simp, by simp, by simp, by simp, by simp⟩26  obtain ⟨X, hXX0, hXM⟩ : ∃ X : ℝ, X0 ≤ X ∧ M ^ J ≤ X := ⟨max X0 (M ^ J), le_max_left _ _, le_max_right _ _⟩27  have hM0 : 0 ≤ M := by linarith28  have hX1 : 1 ≤ X := (Real.one_le_rpow hM1 (by linarith)).trans hXM29  have hX0' : 0 ≤ X := by linarith30  have hY0M : M ≤ X ^ (1 / J) := by31    calc M = (M ^ J) ^ (1 / J) := by rw [one_div, Real.rpow_rpow_inv hM0 hJ0]32      _ ≤ X ^ (1 / J) := Real.rpow_le_rpow (Real.rpow_nonneg hM0 _) hXM hJi33  have hXJ : (X ^ (1 / J)) ^ J = X := by rw [one_div, Real.rpow_inv_rpow hX0' hJ0]34  obtain ⟨q, d, hpg⟩ := hY1 (X ^ (1 / J)) (hMY1.trans hY0M)35  obtain ⟨W, hW0, hW2, hWV⟩ := hX0 X hXX0 q d hpg.pair36  have hWM : M ≤ W := hY0M.trans hW037  have hW1 : 1 ≤ W := hM1.trans hWM38  have hWnn : 0 ≤ W := by linarith39  have hk3 : k ^ (3 : ℝ) ≤ W := hMk3.trans hWM40  have hlem : (k * W) ^ ((3 : ℝ) / 2) ≤ W ^ (2 : ℝ) := by41    have h1 : (k * W) ^ ((3 : ℝ) / 2) = ((k * W) ^ (3 : ℝ)) ^ ((1 : ℝ) / 2) := by42      rw [← Real.rpow_mul (mul_nonneg hk0 hWnn)]43      norm_num44    have h2 : W ^ (2 : ℝ) = (W ^ (4 : ℝ)) ^ ((1 : ℝ) / 2) := by45      rw [← Real.rpow_mul hWnn]46      norm_num47    rw [h1, h2]48    apply Real.rpow_le_rpow (Real.rpow_nonneg (mul_nonneg hk0 hWnn) _) _ (by norm_num)49    rw [Real.mul_rpow hk0 hWnn, show (4 : ℝ) = 1 + 3 by norm_num, Real.rpow_add (by linarith : 0 < W),50      Real.rpow_one]
81 linesLn 4UTF-8Raw