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

log_ge

PrimeNumberTheoremAnd.IEANTN.SecondaryDefinitions · PrimeNumberTheoremAnd/IEANTN/SecondaryDefinitions.lean:36 to 69

Mathematical statement

Exact Lean statement

@[blueprint
  "log_lower_1"
  (title := "First log lower bound")
  (statement := /--
    For $t \geq 0$, one has
    $t - \frac{t^2}{2} \leq \log(1+t)$. -/)
  (proof := /--
    Use Taylor's theorem with remainder and the fact that
    the second derivative of $\log(1+t)$ is at most $1$
    for $t \geq 0$. -/)
  (latexEnv := "sublemma")
  (discussion := 765)]
theorem log_ge {t : ℝ} (ht : 0 ≤ t) : t - t ^ 2 / 2 ≤ log (1 + t)

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
@[blueprint  "log_lower_1"  (title := "First log lower bound")  (statement := /--    For $t \geq 0$, one has    $t - \frac{t^2}{2} \leq \log(1+t)$. -/)  (proof := /--    Use Taylor's theorem with remainder and the fact that    the second derivative of $\log(1+t)$ is at most $1$    for $t \geq 0$. -/)  (latexEnv := "sublemma")  (discussion := 765)]theorem log_ge {t : } (ht : 0  t) : t - t ^ 2 / 2  log (1 + t) := by  rcases ht.eq_or_lt with rfl | ht  · simp  let f :    := fun s  log (1 + s) - (s - s ^ 2 / 2)  have hf_deriv_pos :  s > 0, 0  deriv f s := by    intro s hs    unfold f    rw [deriv_fun_sub, deriv.log _ (by linarith), deriv_fun_sub, deriv_fun_add]    · simp      ring_nf      nlinarith [inv_mul_cancel₀ (by positivity : (1 + s)  0)]    all_goals fun_prop (disch := linarith)  have h_mvt :  c  Set.Ioo 0 t, deriv f c = (f t - f 0) / (t - 0) := by    refine exists_deriv_eq_slope _ ht ?_ ?_    · intro x hx      exact ContinuousAt.continuousWithinAt (by fun_prop (disch := grind))    · intro x hx      exact DifferentiableAt.differentiableWithinAt (by fun_prop (disch := grind))  norm_num +zetaDelta at h_mvt  obtain c, hc₁, hc₂, hc := h_mvt  nlinarith [hf_deriv_pos c hc₁,    mul_div_cancel₀ (log (1 + t) - (t - t ^ 2 / 2)) (by positivity)]