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
801    linarith [Real.pi_gt_three]802  ·803    refine ⟨hs0, Formalism.FourierDecayAlt.P.scale_matching.2.1, ?_, ?_, ?_, ?_, ?_, ?_⟩804    · simp [epsT]805    · intro _ _ x hx806      exact hMU p nn F w c Fi L hV b s hb hs hbs' h hh x hx807    · intro _ _ x hx808      rw [hSU p nn F w c Fi L hV b s hb hs hbs' h hh x hx]809      have := hSS ⟨⟨x⁻¹, inv_ne_zero hx⟩, rfl⟩810      simp only at this811      rwa [hr2] at this812    · intro _ _813      exact hME p nn F w c Fi L hV b s hb hs hbs' h hh814    · intro _ _ K' hK' hK0815      exact hLO p nn F w c Fi L hV b s hb hs hbs' h hh K' hK' hK0816    · intro _ _ K' hK' hK0817      choose Ci hCi using fun i => hTC Wp Wq P p (Fi i) (hFi i) w.length b s hb hs hbs' h hh K' hK' hK0818      refine ⟨∑ i, √(c i) * ‖L i‖ * Ci i, fun x hx => Eventually.of_forall fun D hD => ?_⟩819      have hD0 : D ≠ 0 := fun h0 => hK0 (h0 ▸ hD)820      have heD : epsT s * D ≠ 0 := mul_ne_zero (by simp [epsT]) hD0821      have hroot : ∀ z ∈ G.rootSet s (epsT s * D), z ≠ 0 := by822        intro z hz h0823        unfold G.rootSet at hz824        rw [Multiset.mem_toFinset, Polynomial.mem_nthRoots (by omega)] at hz825        rw [h0, zero_pow hs0] at hz826        exact heD hz.symm827828      have hsum : ut x D - PBK.mainD s U.betaU (epsT s) bt x D =829          ∑ j ∈ Finset.insertNone (G.rootSet s (epsT s * D)), coT s x j • vecT p w.length c Fi L (ptT s h x D j) := by830        rw [Finset.sum_insertNone, sub_eq_add_neg]831        refine congrArg₂ (· + ·) rfl ?_832        · unfold PBK.mainD833          rw [← Finset.sum_neg_distrib]834          refine Finset.sum_congr rfl fun z hzm => ?_835          simp only [hbt, btT, if_neg (hroot z hzm), coT, ptT, smul_smul, neg_smul, neg_mul]836      rw [hsum]837      have hk : ∀ j ∈ Finset.insertNone (G.rootSet s (epsT s * D)), ∀ l ∈ Finset.insertNone (G.rootSet s (epsT s * D)),838          ⟪vecT p w.length c Fi L (ptT s h x D j), vecT p w.length c Fi L (ptT s h x D l)⟫_ℂ =839            ∑ i, (c i : ℂ) * ⟪(omT p w.length (ptT s h x D j) : ℂ) • L i (p.V (Fi i) (ptT s h x D j)),840              (omT p w.length (ptT s h x D l) : ℂ) • L i (p.V (Fi i) (ptT s h x D l))⟫_ℂ :=841        fun j _ l _ => inner_vecT p w.length c hc Fi L _ _842      refine (norm_sum_le_of_gram' (vecT p w.length c Fi L) c hc843        (fun i Q => (omT p w.length Q : ℂ) • L i (p.V (Fi i) Q)) _ (ptT s h x D) hk (coT s x)).trans ?_844      rw [Finset.sum_mul]845      refine Finset.sum_le_sum fun i _ => ?_846      have e : ∑ j ∈ Finset.insertNone (G.rootSet s (epsT s * D)),847          coT s x j • ((omT p w.length (ptT s h x D j) : ℂ) • L i (p.V (Fi i) (ptT s h x D j))) =848          L i (∑ j ∈ Finset.insertNone (G.rootSet s (epsT s * D)),849            (coT s x j * (omT p w.length (ptT s h x D j) : ℂ)) • p.V (Fi i) (ptT s h x D j)) := by850        rw [map_sum]
945 linesLn 837UTF-8Raw