Skip to main content
AlexKontorovich/PrimeNumberTheoremAnd
Source indexedlemma · leanprover/lean4:v4.32.0

Mertens.M_eq_summand_bound

PrimeNumberTheoremAnd.IEANTN.Mertens · PrimeNumberTheoremAnd/IEANTN/Mertens.lean:2287 to 2304

Mathematical statement

Exact Lean statement

lemma M_eq_summand_bound (n : ℕ) :
    |M_eq_summand n| ≤ 2 / n ^ 2

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma M_eq_summand_bound (n : ) :    |M_eq_summand n|  2 / n ^ 2 := by  unfold M_eq_summand  split_ifs with h  · trans 1 / n ^ 2 / (1 - 1 / n)    · convert abs_log_sub_add_sum_range_le (x := 1 / n) _ 1 using 1      · rw [add_comm]        simp      · rw [abs_of_nonneg (by simp)]        ring      · simpa using inv_lt_one_of_one_lt₀ (mod_cast h.one_lt)    rw [(by ring : (2 : ) / n ^ 2 = 1 / n ^ 2 / (1 / 2))]    gcongr    suffices (1 : ) / n  1 / 2 by linarith    gcongr    exact_mod_cast h.two_le  · rw [abs_zero]    positivity