All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257c8e4

Γ₃ increasing

γ₃_increasing

Plain-language statement

Let γ3(n)=Hnlogn12n+112n21120n4,\gamma_3(n)=H_n-\log n-\frac{1}{2n}+\frac{1}{12n^2}-\frac{1}{120n^4}, where HnH_n is the nnth harmonic number. Then γ3(n)<γ3(n+1)\gamma_3(n)<\gamma_3(n+1) for every integer n1n\ge1.

Exact Lean statement

lemma γ₃_increasing (n : ℕ) (hn : 1 ≤ n) :
    γ₃ n < γ₃ (n + 1)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma γ₃_increasing (n : ) (hn : 1  n) :    γ₃ n < γ₃ (n + 1) := by  unfold γ₃  suffices h : 0 < (2 * ↑n + 1) / (2 * ↑n * (↑n + 1))      - Real.log ((↑n + 1 : ) / ↑n)      - (2 * ↑n + 1) / (12 * ↑n ^ 2 * (↑n + 1) ^ 2)      + (4 * ↑n ^ 3 + 6 * ↑n ^ 2 + 4 * ↑n + 1) /        (120 * ↑n ^ 4 * (↑n + 1) ^ 4) by    rw [Real.log_div] at h <;> norm_num at * <;> try positivity    field_simp at *; grind  have hn_pos : (0 : ) < n := by exact_mod_cast (show 0 < n by omega)  have h_log_ineq := log_ineq_9 (1 / (n : )) (by positivity)  rw [show (1 : ) + 1 / (↑n : ) = (↑n + 1) / ↑n by field_simp] at h_log_ineq  rw [Real.log_div (by positivity) (ne_of_gt hn_pos)] at h_log_ineq  rw [Real.log_div (by positivity) (ne_of_gt hn_pos)]  field_simp at *  nlinarith [sq_nonneg ((n : )), sq_nonneg ((n : ) - 1),    pow_pos hn_pos 2, pow_pos hn_pos 3, pow_pos hn_pos 4,    pow_pos hn_pos 5, pow_pos hn_pos 6, pow_pos hn_pos 7, pow_pos hn_pos 8,    pow_pos (show (0 : ) < n + 1 by linarith) 2,    pow_pos (show (0 : ) < n + 1 by linarith) 3,    pow_pos (show (0 : ) < n + 1 by linarith) 4]
Project
Prime Number Theorem and More
License
Apache-2.0
Commit
a93551347dce
Source
PrimeNumberTheoremAnd/EulerMascheroniBounds.lean:433-454

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