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
551    intro z _552    show √(TBB.nPt P.k P.r (TBB.TTp p) (h ++ [(m + 2, z)])) / √(TBB.normC nn w) = _553    rw [nPt_long (TBB.TTp p) b m hb hbs h hh.2, Real.sqrt_mul hnH0, Real.sqrt_sq (by positivity), hμ0]554    ring555  have hcs := conjSum_TBB m Mv hM Φ x Dv hx hD0 μ0 (fun j => lam p nn w (PP m h x Dv j)) hl1 hl2556  rw [hcs, norm_smul, Complex.norm_real, Real.norm_eq_abs] at hle557  have hg' := hgerm x⁻¹ Dv (inv_ne_zero hx) hDv558  rw [norm_inv] at hg'559  calc _ ≤ Cp * (|μ0 * Real.pi ^ ((m + 2) * (m + 1) / 2)| *560        ‖U.uD U.betaU m Mv Φ x⁻¹ Dv - U.aD U.betaU m Mv Φ x⁻¹ Dv‖) := hle561    _ ≤ Cp * (|μ0 * Real.pi ^ ((m + 2) * (m + 1) / 2)| * (Cst * ‖x‖⁻¹)) :=562        mul_le_mul_of_nonneg_left (mul_le_mul_of_nonneg_left hg' (abs_nonneg _)) hCp563    _ = _ := by ring564565end566end Formalism.FourierDecayAlt.P.CutBP567568namespace Formalism.FourierDecayAlt.P.CutBP569open Formalism.FourierDecayAlt Formalism.QuantumDeterminants Filter Topology MeasureTheory570open scoped ComplexConjugate InnerProductSpace571noncomputable section572open Classical573574theorem _root_.Formalism.FourierDecayAlt.P.CutBP.germDataLowAll_of_partsCpt (hGr : GLGramCpt) (hFi : GLFibreCpt) (hCo : GLContCpt) (hGe : GLGermCpt) : GermDataLowAllCpt := by575  intro hA Wp Wq _ _ _ _ _ _ P p nn F Y K N Cb hCb hF hnn b s hb hs hbs hlev h hh w hw hN hBdd576  have hi : b + s - 1 ≤ P.r := hlev577  have hN' : w.length ≤ N := by omega578  obtain ⟨H, i1, i2, i3, Vec, hVec⟩ := hGr hA Wp Wq P p nn F Y N Cb hCb hF hnn (b + s - 1) hi w hw hN'579  let _ := i1; let _ := i2; have _ := i3580  have hs0 : s ≠ 0 := by omega581  have hpi : (0 : ℝ) < Real.pi ^ (s - 1) := pow_pos Real.pi_pos _582  set κ : ℝ := (Real.pi ^ (s - 1))⁻¹ with hκ583  have hκκ : Real.pi ^ (2 * (s - 1)) * (κ * κ) = 1 := by584    rw [hκ, pow_mul', sq, ← mul_inv, mul_inv_cancel₀ (by positivity)]585  let ut : ℂ → ℂ → H := fun x D => (((κ * ‖x‖ ^ (s - 1)) : ℝ) : ℂ) • Vec (h ++ [(s - 1, x⁻¹), (1, x ^ (s - 1) * D)])586  let bt : ℂ → H := fun z => if z = 0 then 0 else ((((s : ℝ) * ‖z‖ ^ (s - 1))⁻¹ : ℝ) : ℂ) • Vec (h ++ [(s, z)])587588  have hcv : ∀ x : ℂ, x ≠ 0 → ∀ c : ℂ, PBK.cvec s ut x c = (κ : ℂ) • Vec ((h ++ [(s - 1, x⁻¹)]) ++ [(1, c)]) := by589    intro x hx c590    have ha : x ^ (s - 1) ≠ 0 := pow_ne_zero _ hx591    have hn : (‖x‖ ^ (s - 1) : ℝ) ≠ 0 := pow_ne_zero _ (norm_ne_zero_iff.mpr hx)592    simp only [PBK.cvec, ut, smul_smul, List.append_assoc, List.cons_append, List.nil_append]593    rw [mul_div_cancel₀ c ha, ← Complex.ofReal_mul]594    congr 2595    field_simp596597  have hj : b + s - 2 + 1 = b + s - 1 := by omega598  have hloc : ∀ t : ℂ, t ≠ 0 → D.IsLocPt (h ++ [(s - 1, t)]) (b + s - 2) := by599    intro t ht600    have := gl_isLocPt_snoc hh (by omega : 1 ≤ s - 1) ht
945 linesLn 559UTF-8Raw