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/ShortNorms/supplyOfAdmOf.lean
1import Development.AbelianVarietyTheory.Definitions.GlobalTwisting.ThinScalesIffHostBound2import Development.AutomorphicArithmetic.CharacterBoxes.Imports3import Development.AutomorphicArithmetic.CharacterBoxes.WinPairs4import Development.AutomorphicArithmetic.CharacterBoxes.FieldChi5import Development.AutomorphicArithmetic.CharacterBoxes.IsChiField6import Development.AutomorphicArithmetic.CharacterBoxes.BoundedTw7import Development.AutomorphicArithmetic.CharacterBoxes.PairHyp8import Development.AutomorphicArithmetic.CharacterBoxes.EventuallyRankLeRpowOfLtOneDivFiftytwo9import Development.AutomorphicArithmetic.MeanSquareBounds.pairEx1011open Formalism.BasicNotions Formalism.MainNotions Formalism.MainNotions.Inhab Formalism.HC GlobalTheory.EX UpperTheory.Top HostParam.Seam1213theorem UpperTheory.T3.supplyOfAdmOf :14    (∀ eps C0 : ℝ, 0 < eps → eps < 1 / 52 → 1 ≤ C0 → ∃ CT2 C8 c6 Cb x0 : ℝ, C0 ≤ C8 ∧ 0 < c6 ∧ 0 < Cb ∧15      ∀ (s : Scale) (R : Ranks) (H0 : HostAx R.toFrame) (M : ℕ) (Y : ℝ), s.eps = eps → x0 ≤ s.x → RankVal s R →16        s.J ≤ C0 → (R.o : ℝ) ≤ C0 → (H0.QS : ℝ) ≤ C0 * R.n → 0 < M → (M : ℝ) ≤ C0 → H0.QS ∣ Nat.lcm (2 ^ (R.e + 2)) M →17        PairWin s Y → PairGood M eps Y s.x H0.q H0.d → FieldRows H0.toHostRaw ⌊Y ^ (eps / 5)⌋₊ → admitted R H0 →18        ∃ (H : Host R) (q0 : ℕ), H.toHostAx = H0 ∧ H.CT2 = CT2 ∧ HostGood s C8 4 c6 Cb H q0 ∧19          R.toFrame.Shares H.TT (s.x ^ (-1 + s.eps))) → ∀ ψ : PChar, VWinAt ψ 401 →20      (∀ eps : ℝ, 0 < eps → eps < 1 / 52 → ∃ x0 : ℝ, ∀ (s : Scale) (φ : Frame) (H0 : HostAx φ), s.eps = eps → x0 ≤ s.x →21        s.x ^ (2 + 8 * eps) ≤ (φ.ord : ℝ) → (φ.ord : ℝ) ≤ 2 * s.x ^ (2 + 8 * eps) → φ.o = (Level.cyc ψ).o → KerChi ψ H0.toHostRaw →22        ∃ (R : Ranks) (h : R.toFrame = φ), RankVal s R ∧ admitted R (h ▸ H0)) →23      HostExW (3 / 2) (fun _ s R H _ => EAtH (Level.cyc ψ) H.toHostRaw H.TT s.x s.eps 4 ∧ VVle H.E R.t (Real.sqrt s.b)) := by24  intro hSup ψ hV hAdm eps heps heps'25  haveI := ψ.ne26  have hN0 : 0 < ψ.N := Nat.pos_of_ne_zero (NeZero.ne _)27  have heps0 : eps ≠ 0 := heps.ne'28  obtain ⟨c, e0, hc, hF⟩ := UpperTheory.Top.fieldChi ψ29  obtain ⟨J, hJ, hwin⟩ := UpperTheory.Top.winPairs ψ eps (c : ℝ) heps heps' (by exact_mod_cast hc) hV QH.pairEx30  obtain ⟨C0, hC1, hCJ, hCo, hCN⟩ : ∃ C0 : ℝ, 1 ≤ C0 ∧ J ≤ C0 ∧ ((Level.cyc ψ).o : ℝ) ≤ C0 ∧31      8 * (ψ.N : ℝ) ≤ C0 :=32    by33      have h1 : (0 : ℝ) ≤ ((Level.cyc ψ).o : ℝ) := Nat.cast_nonneg _34      have h2 : (0 : ℝ) ≤ (ψ.N : ℝ) := Nat.cast_nonneg _35      exact ⟨J + ((Level.cyc ψ).o : ℝ) + 8 * (ψ.N : ℝ), by linarith, by linarith, by linarith, by linarith⟩36  obtain ⟨CT2, C8, c6, Cb, x0A, hC8, hc6, hCb, hA⟩ := hSup eps C0 heps heps' hC137  obtain ⟨x0B, hB⟩ := hAdm eps heps heps'38  obtain ⟨x0T, hT⟩ := UpperTheory.Top.eventually_rank_le_rpow_of_lt_one_div_fiftytwo eps heps heps'39  obtain ⟨K, hK5, hK4⟩ : ∃ K : ℝ, 5 ≤ K ∧ 4 * (ψ.N : ℝ) ≤ K :=40    by41      have h2 : (0 : ℝ) ≤ (ψ.N : ℝ) := Nat.cast_nonneg _42      exact ⟨5 + 4 * (ψ.N : ℝ), by linarith, by linarith⟩43  have hK0 : 0 ≤ K := by linarith44  obtain ⟨A, hA0, hAK⟩ : ∃ A : ℝ, 0 ≤ A ∧ A ^ (eps / 5) = K := by45    refine ⟨K ^ (5 / eps), Real.rpow_nonneg hK0 _, ?_⟩46    rw [← Real.rpow_mul hK0, show 5 / eps * (eps / 5) = (1 : ℝ) by field_simp, Real.rpow_one]47  have hc0 : (0 : ℝ) ≤ c := by positivity48  have hAJ0 : 0 ≤ A ^ J := Real.rpow_nonneg hA0 _49  obtain ⟨x1, h1A, h1B, h1T, h1J, h1c⟩ : ∃ x1 : ℝ, x0A ≤ x1 ∧ x0B ≤ x1 ∧ x0T ≤ x1 ∧ A ^ J ≤ x1 ∧50      (c : ℝ) * 2 ^ e0 < x1 := by
135 linesLn 15UTF-8Raw