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
Formalism/HermitianCurvature/HermitianCurvatureProofs/CutMainCpt.lean
451      LimEvT p χ (TBBx4.fpm p f (fun _ => ContinuousLinearMap.id ℂ Wq) p₀) Y N := by452  obtain ⟨C1, k1⟩ := h1 hA Cb453  obtain ⟨C2, k2⟩ := h2 Cb454  obtain ⟨C3, k3⟩ := h3 Cb455  obtain ⟨C4, k4⟩ := h4 Cb456  refine ⟨max (max C1 C2) (max C3 C4), ?_⟩457  intro Wp Wq _ _ _ _ _ _ P p f A₀ p₀ χ Y N hH458  have mono : ∀ C, C ≤ max (max C1 C2) (max C3 C4) → NFHyp Cb C p f A₀ p₀ χ N := by459    intro C hC460    unfold NFHyp at hH ⊢461    obtain ⟨a1, a2, a3, a4, a5, a6⟩ := hH462    refine ⟨a1, a2, a3, a4, le_trans ?_ a5, a6⟩463    gcongr464  exact limEvT_of_NF p χ _ Y N (k1 Wp Wq P p f A₀ p₀ χ Y N (mono C1 (by simp))) (k2 Wp Wq P p f A₀ p₀ χ Y N (mono C2 (by simp)))465    (k3 Wp Wq P p f A₀ p₀ χ Y N (mono C3 (by simp))) (k4 Wp Wq P p f A₀ p₀ χ Y N (mono C4 (by simp)))466467end468end Formalism.FourierDecayAlt.P.CutBP469470namespace Formalism.FourierDecayAlt.P.CutBP471open Formalism.FourierDecayAlt Formalism.QuantumDeterminants Filter Topology MeasureTheory472noncomputable section473attribute [local instance] Matrix.normedAddCommGroup Matrix.normedSpace in474475theorem _root_.Formalism.FourierDecayAlt.P.CutBP.thmBpAt_main4Cpt (hA : P5.ThmPActualCpt) (h1 : NFTopFormAllCpt) (h2 : NFTopPtwAll) (h3 : NFTopDomAll)476    (h4 : NFTopIdAll) (Cb C₃ CΛ C₀ : ℝ) (hC₃ : 0 ≤ C₃) (hCΛ : 0 ≤ CΛ) (hC₀ : 1 / 2 ≤ C₀) :477    ∃ C₄ c₃ Cc Cc' Cc'' : ℝ, ∀ (Wp Wq : Type) [NormedAddCommGroup Wp] [InnerProductSpace ℂ Wp] [NormedAddCommGroup Wq]478      [InnerProductSpace ℂ Wq] [FiniteDimensional ℂ Wp] [FiniteDimensional ℂ Wq] (P : M.Par) (p : KB.Pl P Wp Wq)479      (f : B.Mat P.k P.r → (Wq →L[ℂ] Wp)) (b Λ A₀ : ℝ) (p₀ : ℕ) (χ nn : ℝ → ℝ) (Y : Finset ℝ) (K N : ℕ),480      3 ≤ b → 1 ≤ Λ → Λ ≤ b ^ (CΛ * ((2 * P.r + 2 : ℕ) : ℝ)) → 1 ≤ TBB.Tq p →481      (p₀ : ℝ) ≤ C₀ * (3 * ((P.r : ℝ) + 1)) + 1 →482      3 ≤ K → (P.r + 1) * K ≤ N → C6.IsCut0 χ → (∀ y, 0 < nn y) →483      KB.InDDplus2 P p.l0 p.T.base Cb p.Θ → B.CkOn ⊤ (B.GV P.k P.r) f → (∀ m : ℕ, B.InCC A₀ m f) →484      c₃ * ((P.r : ℝ) + 1) ^ 2 * ((P.r : ℝ) * ((2 * P.r + P.k + 1 : ℕ) : ℝ) + 1) ≤485        A₀ - (((2 * P.r + 2) * p₀ : ℕ) : ℝ) →486      Cc * ((P.r : ℝ) + 1) ^ 4 * ((N : ℝ) * (2 * (P.r : ℝ) + P.k + 1) ^ 2 + (2 * (P.r : ℝ) + P.k + 1) ^ 3) ≤487        A₀ - (((2 * P.r + 2) * p₀ : ℕ) : ℝ) →488      Cc' * ((P.r : ℝ) + 1) ^ 4 * ((N : ℝ) * (2 * (P.r : ℝ) + P.k + 1) ^ 2 + (2 * (P.r : ℝ) + P.k + 1) ^ 3) ≤489        A₀ - (((2 * P.r + 2) * p₀ : ℕ) : ℝ) →490      Cc'' * ((P.r : ℝ) + 1) ^ 4 * ((N : ℝ) * (2 * (P.r : ℝ) + P.k + 1) ^ 2 + (2 * (P.r : ℝ) + P.k + 1) ^ 3) ≤491        A₀ - (((2 * P.r + 2) * p₀ : ℕ) : ℝ) →492      N ≤ 2 * p₀ →493      BigCellDerivativeExpansion p f b C₃ (2 * p₀ + 0) →494      TBBx5.WaveGrid p nn Y Λ K N → TBBx5.LiftGrid p nn Y Λ K N →495      (∀ ε : ℝ, 0 < ε → ∀ n : ℕ, TBB.BlockGrowthBound p nn496        (apx (D.cutF p.T.base χ (TBBx4.fpm p f (fun _ => ContinuousLinearMap.id ℂ Wq) p₀) ε) n) Y K N) →497      LimBd p nn (TBBx4.fpm p f (fun _ => ContinuousLinearMap.id ℂ Wq) p₀) Y N →498      TBB.ThmBpAt p f b C₄ 0 p₀ := by499  obtain ⟨C₄, c₃, Cc, Cc', h⟩ := thmBpAt_main2Cpt hA Cb C₃ CΛ C₀ hC₃ hCΛ hC₀500  obtain ⟨Cn, hn⟩ := limEvT_fpm_of_NFCpt hA h1 h2 h3 h4 Cb
945 linesLn 471UTF-8Raw