All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

Euler Mascheroni Constant lb

eulerMascheroniConstant_lb

Plain-language statement

For every integer n0n\ge0, the corrected harmonic approximation Hn+1log(n+1)12(n+1)H_{n+1}-\log(n+1)-\frac{1}{2(n+1)} is a lower bound for the Euler–Mascheroni constant γ\gamma.

Exact Lean statement

lemma eulerMascheroniConstant_lb (n : ℕ) :
    γ₁ (n + 1) ≤ eulerMascheroniConstant

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma eulerMascheroniConstant_lb (n : ) :    γ₁ (n + 1)  eulerMascheroniConstant := by  have key : γ₁ (n + 1) = eulerMascheroniSeq n + 1 / (2 * ((n : ) + 1)) := by    simp only [γ₁, eulerMascheroniSeq]    rw [harmonic_succ]    push_cast    field_simp    ring  rw [key]  have h_lim : Filter.Tendsto (fun m => eulerMascheroniSeq m - eulerMascheroniSeq n) Filter.atTop (nhds (eulerMascheroniConstant - eulerMascheroniSeq n)) :=    Filter.Tendsto.sub Real.tendsto_eulerMascheroniSeq tendsto_const_nhds  have h_lim_bound : Filter.Tendsto (fun m => 1 / (2 * (n + 1) : ) - 1 / (2 * (m + 1) : )) Filter.atTop (nhds (1 / (2 * (n + 1) : ))) :=    le_trans (tendsto_const_nhds.sub <| tendsto_const_nhds.div_atTop <|      Filter.Tendsto.const_mul_atTop zero_lt_two <|      Filter.tendsto_id.atTop_add tendsto_const_nhds) <| by norm_num  have := h_lim_bound.comp tendsto_natCast_atTop_atTop  exact le_of_tendsto_of_tendsto this h_lim (Filter.eventually_atTop.mpr    n, by intros m hm; simpa using eulerMascheroniSeq_diff_lb n m hm) |>    fun h => by norm_num at *; grind
Project
Prime Number Theorem and More
License
Apache-2.0
Commit
a93551347dce
Source
PrimeNumberTheoremAnd/EulerMascheroniBounds.lean:99-117

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.32.0

Admissible bound mono

admissible_bound.mono

Plain-language statement

For positive parameters A,B,C,RA,B,C,R, the classical error-bound function A(logxR)Bexp ⁣(ClogxR)A\left(\frac{\log x}{R}\right)^B\exp\!\left(-C\sqrt{\frac{\log x}{R}}\right) is nonincreasing once xexp ⁣(R(2B/C)2)x\ge \exp\!\left(R(2B/C)^2\right).

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Analytic On div Removable zero

AnalyticOn_divRemovable_zero

Plain-language statement

Let ff be analytic on an open set ss containing 00, and suppose f(0)=0f(0)=0. Define g(z)=f(z)/zg(z)=f(z)/z for z0z\ne0 and g(0)=f(0)g(0)=f'(0). Then the apparent singularity at 00 is removable and gg is analytic throughout ss.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Analytic On div Removable zero closed Ball

AnalyticOn_divRemovable_zero_closedBall

Plain-language statement

Suppose R>0R>0 and ff is analytic on the closed disc zR|z|\le R with f(0)=0f(0)=0. Define g(z)=f(z)/zg(z)=f(z)/z for z0z\ne0 and g(0)=f(0)g(0)=f'(0). Then gg is analytic on the entire closed disc, including at the removed singularity.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record