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/AbelianVarietyTheory/Definitions/GlobalTwisting/PairRowIffQdRows.lean
101      (hc τ).e j = (hc τ).b j + (h0v s ch : ℚ) / 2) ∧102    (∀ τ (t : H.TT), eTau τ = R.tau1 t → b1 τ = bT t + ⌊s.b' / s.x⌋) ∧103    (∀ τ, eTau τ ∈ H.thickPlaces → ⌈s.b⌉ ≤ b1 τ ∧ b1 τ < ⌈s.b⌉ + (NumberField.Units.torsionOrder H.E : ℤ)) ∧104    (∀ τ, H.IsThin (eTau τ) → b1 τ = ⌈s.w'' R.n⌉)) ∧105  ∀ j : Fin R.m, UpperTheory.MUQ (fun τ => H.emb (eTau τ)) (fun τ => (hc τ).e j)106107structure Val (C : FC) (cD ch : ℝ) {D : D7} (L : SizeData₂ D) : Prop where108  ranks : RankVal L.sc D.R109  host : HostVal L.sc C.P.Cpde D.host110  hc : HCVal L.sc cD ch D.host (fun τ => (D.eTau τ : D.R.GG)) D.hc L.bT111  dlog : |L.logDerivativeAtOne| ≤ L.sc.x ^ L.sc.eps112  Del_eq : D.s.Del = (Delv L.sc cD : ℚ)113  eta_eq : L.etaSz = (D.R.m : ℝ) * (h0v L.sc ch : ℝ)114  La_eq : L.LaG = G.La C.GK L.sc115  bT_le : ∀ t, (L.bT t : ℝ) ≤ L.sc.b' + 2 * (D.R.n : ℝ) * L.sc.delta1 * L.sc.x ^ L.sc.eps * L.LaG * L.sc.b' / (D.R.k : ℝ)116  logFiveDepth_eq : L.j0 = ⌈Real.logb 5 ((D.R.n : ℝ) * D.R.N D.R.m / D.R.m)⌉₊117  Ct_eq : L.Ct = C.Ct118  Cc_eq : L.Cc = C.Cc119  CGam_eq : L.CGam = C.CGam120  secondConstant_eq : D.host.CT2 = C.CT2121  words : Fintype.card D.what₂.Word = ⌈3 * GamL L ^ 2 * L.sc.x ^ C.P.CF⌉₊122  etaF_eq : D.div.etaF = 6 * L.sc.x ^ (-C.P.CF)123124def SzRow (P : FC → ∀ D : D7, SizeData₂ D → Prop) : Prop :=125  ∀ eps : ℝ, 0 < eps → eps < 1 / 52 → ∀ C : FC, Std C → ∃ c1 : ℝ, ∀ cD ≥ c1, ∃ c2 : ℝ, ∀ ch ≥ c2, ∃ x0 : ℝ,126    ∀ (D : D7) (L : SizeData₂ D), L.sc.eps = eps → x0 ≤ L.sc.x → Val C cD ch L → P C D L127128theorem pairWin_self (s : Scale) : PairWin s s.x := by129  refine ⟨?_, le_rfl⟩130  have h : 1 / s.J ≤ 1 := (div_le_one (lt_of_lt_of_le one_pos s.one_le_J)).2 s.one_le_J131  simpa using Real.rpow_le_rpow_of_exponent_le s.one_lt_alt.le h132133theorem PairWin.one_lt {s : Scale} {Y : ℝ} (h : PairWin s Y) : 1 < Y :=134  (Real.one_lt_rpow s.one_lt_alt (one_div_pos.2 (lt_of_lt_of_le one_pos s.one_le_J))).trans_le h.1135136theorem PairWin.rpow_ez_le {s : Scale} {Y : ℝ} (h : PairWin s Y) {c : ℝ} (hc : 0 < c) :137    s.x ^ (s.ez / c) ≤ Y ^ (s.eps / c) := by138  have hx : 0 < s.x := lt_trans one_pos s.one_lt_alt139  have e : s.ez / c = 1 / s.J * (s.eps / c) := by unfold Scale.ez; ring140  rw [e, Real.rpow_mul hx.le]141  exact Real.rpow_le_rpow (Real.rpow_nonneg hx.le _) h.1 (div_nonneg s.eps_pos.le hc.le)142143theorem PairWin.rpow_le {s : Scale} {Y : ℝ} (h : PairWin s Y) {a : ℝ} (ha : 0 ≤ a) : Y ^ a ≤ s.x ^ a :=144  Real.rpow_le_rpow (by linarith [h.one_lt]) h.2 ha145146theorem PairWin.log_le {s : Scale} {Y : ℝ} (h : PairWin s Y) : Real.log Y ≤ Real.log s.x :=147  Real.log_le_log (by linarith [h.one_lt]) h.2148149theorem PairWin.log_div_le {s : Scale} {Y : ℝ} (h : PairWin s Y) : Real.log s.x / s.J ≤ Real.log Y := by150  have hx : 0 < s.x := lt_trans one_pos s.one_lt_alt
220 linesLn 107UTF-8Raw