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

γ₃_lower_bound

PrimeNumberTheoremAnd.EulerMascheroniBounds · PrimeNumberTheoremAnd/EulerMascheroniBounds.lean:471 to 485

Source documentation

γ₃ n < γ for all n ≥ 1.

Exact Lean statement

lemma γ₃_lower_bound (n : ℕ) (hn : 1 ≤ n) :
    γ₃ n < Real.eulerMascheroniConstant

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma γ₃_lower_bound (n : ) (hn : 1  n) :    γ₃ n < Real.eulerMascheroniConstant := by  have h_strict_mono : StrictMono (fun n :  => γ₃ (n + 1)) :=    strictMono_nat_of_lt_succ (fun k => γ₃_increasing (k + 1) (by omega))  have h_tendsto : Filter.Tendsto (fun n :  => γ₃ (n + 1))      Filter.atTop (nhds eulerMascheroniConstant) :=    γ₃_tendsto.comp (Filter.tendsto_add_atTop_nat 1)  have h_lt :  k : , γ₃ (k + 1) < eulerMascheroniConstant := fun k =>    lt_of_lt_of_le      (h_strict_mono <| Nat.lt_succ_self _)      (ge_of_tendsto h_tendsto <| Filter.eventually_atTop.mpr        k + 1, fun m hm => h_strict_mono.monotone hm)  cases n with  | zero => omega  | succ m => exact h_lt m