Sharp upper bound for
ProvedReal.log_le_sub_inv_div_twoanalysisinequalities
For every real ,
The right-hand side is the average of Mathlib's two first-order bounds and , and unlike either of them it is second-order accurate at ; it is exactly the statement for .
Proof. Put . Then , and for .
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic
Formal statement
theorem Real.log_le_sub_inv_div_two {t : ℝ} (ht : 1 ≤ t) :
Real.log t ≤ (t - 1 / t) / 2 := by
sorrySource
Standard sharp elementary bounds on the natural logarithm; both are absent from Mathlib. The lower bound is the diagonal Pade approximant of order (1,1) (equivalently 2 artanh((t-1)/(t+1)) >= 2 tanh of half the logarithm), the upper bound is x <= sinh x at x = log t. See e.g. Mitrinovic, Analytic Inequalities (Springer 1970), Chapter III.