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
CompanionTheory/AutomorphicTheory/CompactTopologicalForms/FinalS.lean
51theorem nfTopDomAllJ_of_open (hT : NFTieHatS) (hH : NFHatProdKBS) : NFTopDomAllJ :=52  nfTopDomAllJ_of_cut domination_at_zero_holds (nfDomPtwS_of_open leibniz_vector_estimate_holds (nFCoreNS_of_open leibniz_vector_estimate_holds hT hH))53    dominated_L2_operator_bound_holds domination_measurability_holds5455theorem blockGrowthBound_apx_cutF (hA : P5.ThmPActualCpt) {P : M.Par} {Wp Wq : Type} [NormedAddCommGroup Wp] [InnerProductSpace ℂ Wp]56    [NormedAddCommGroup Wq] [InnerProductSpace ℂ Wq] [FiniteDimensional ℂ Wp] [FiniteDimensional ℂ Wq]57    (p : KB.Pl P Wp Wq) (nn χ : ℝ → ℝ) (F : B.Mat P.k P.r → (Wq →L[ℂ] Wp))58    (Y : Finset ℝ) (K N : ℕ) (Cb : ℝ) (hCb : KB.InDDplus2 P p.l0 p.T.base Cb p.Θ) (hχ : C6.IsCut0 χ)59    (hF : B.CkOn ⊤ (B.GV P.k P.r) F) (hnn : ∀ y, 0 < nn y) :60    ∀ ε : ℝ, 0 < ε → ∀ n : ℕ, TBB.BlockGrowthBound p nn (apx (D.cutF p.T.base χ F ε) n) Y K N := fun _ hε n =>61  block_growth_bound_of_compact_coefCpt hA p nn _ Y K N Cb hCb (cptCoef_apx P p.T.base hχ hF hε n) hnn6263attribute [local instance] Matrix.normedAddCommGroup Matrix.normedSpace in6465theorem limEvT_J (hA : P5.ThmPActualCpt) (h3 : NFTopDomAllJ) (Cb : ℝ) : ∃ Cc : ℝ, ∀ (Wp Wq : Type) [NormedAddCommGroup Wp] [InnerProductSpace ℂ Wp] [NormedAddCommGroup Wq]66    [InnerProductSpace ℂ Wq] [FiniteDimensional ℂ Wp] [FiniteDimensional ℂ Wq] (P : M.Par) (p : KB.Pl P Wp Wq)67    (f : B.Mat P.k P.r → (Wq →L[ℂ] Wp)) (A₀ : ℝ) (p₀ : ℕ) (χ : ℝ → ℝ) (Y : Finset ℝ) (N : ℕ),68    NFHyp Cb Cc p f A₀ p₀ χ N → B.JF p.T.base f ∈ FFKB p →69      LimEvT p χ (TBBx4.fpm p f (fun _ => ContinuousLinearMap.id ℂ Wq) p₀) Y N := by70  obtain ⟨C1, H1⟩ := CompanionTheory.NFCpt.top_form_all_compact hA Cb71  obtain ⟨C2, H2⟩ := top_pointwise_all_levels_holds Cb72  obtain ⟨C3, H3⟩ := h3 Cb73  refine ⟨max (max C1 C2) (max C3 100), ?_⟩74  intro Wp Wq _ _ _ _ _ _ P p f A₀ p₀ χ Y N hH hJ w hw hN75  have m1 : C1 ≤ max (max C1 C2) (max C3 100) := le_max_of_le_left (le_max_left _ _)76  have m2 : C2 ≤ max (max C1 C2) (max C3 100) := le_max_of_le_left (le_max_right _ _)77  have m3 : C3 ≤ max (max C1 C2) (max C3 100) := le_max_of_le_right (le_max_left _ _)78  have m4 : 100 ≤ max (max C1 C2) (max C3 100) := le_max_of_le_right (le_max_right _ _)79  have hid : B.CkOn ⊤ (B.GV P.k P.r) (fun _ : B.Mat P.k P.r => ContinuousLinearMap.id ℂ Wq) := fun g₀ _ =>80    ⟨Set.univ, fun _ => ContinuousLinearMap.id ℂ Wq, isOpen_univ, trivial, contDiffOn_const, fun _ _ _ => rfl⟩81  have hL := fun (χ' : ℝ → ℝ) (hχ' : C6.IsCut0 χ') => CompanionTheory.BpCpt.NFId.lim_top p82    (H1 Wp Wq P p f A₀ p₀ χ' Y N (CompanionTheory.BpCpt.NFId.nfHyp_mono hH m1 hχ') w hw hN)83    (H2 Wp Wq P p f A₀ p₀ χ' Y N (CompanionTheory.BpCpt.NFId.nfHyp_mono hH m2 hχ') w hw hN)84    (H3 Wp Wq P p f A₀ p₀ χ' Y N (CompanionTheory.BpCpt.NFId.nfHyp_mono hH m3 hχ') hJ w hw hN)85  have hId := CompanionTheory.BpCpt.NFId.nfTopId_of_lim p hH.1 (ckOn_fpm p p₀ hH.2.2.1 hid) (inCC_fpm_id p p₀ hH.2.2.2.1) hw.186    (CutMP.ER.bound_aux P.r P.k w.length N _ hN (CompanionTheory.BpCpt.NFId.nfHyp_mono hH m4 hH.1).2.2.2.2.1) hL87  unfold NFTopId at hId88  rw [← hId]89  exact hL χ hH.19091attribute [local instance] Matrix.normedAddCommGroup Matrix.normedSpace in9293theorem thmBpAt_J (h3 : NFTopDomAllJ)94    (Cb C₃ CΛ C₀ : ℝ) (hC₃ : 0 ≤ C₃) (hCΛ : 0 ≤ CΛ) (hC₀ : 1 / 2 ≤ C₀) :95    ∃ C₄ c₃ Cc Cc' Cc'' : ℝ, ∀ (Wp Wq : Type) [NormedAddCommGroup Wp] [InnerProductSpace ℂ Wp] [NormedAddCommGroup Wq]96      [InnerProductSpace ℂ Wq] [FiniteDimensional ℂ Wp] [FiniteDimensional ℂ Wq] (P : M.Par) (p : KB.Pl P Wp Wq)97      (f : B.Mat P.k P.r → (Wq →L[ℂ] Wp)) (b Λ A₀ : ℝ) (p₀ : ℕ) (χ nn : ℝ → ℝ) (Y : Finset ℝ) (K N : ℕ),98      3 ≤ b → 1 ≤ Λ → Λ ≤ b ^ (CΛ * ((2 * P.r + 2 : ℕ) : ℝ)) → 1 ≤ TBB.Tq p →99      (p₀ : ℝ) ≤ C₀ * (3 * ((P.r : ℝ) + 1)) + 1 →100      3 ≤ K → (P.r + 1) * K ≤ N → C6.IsCut0 χ → (∀ y, 0 < nn y) →
200 linesLn 65UTF-8Raw