Two sided bound for the logarithmic remainder
ProvedLL_Decomp1528b.neg_log_one_sub_inv_boundsFor real , and .
import Mathlib open Real Finset Filter Topology
namespace LL_Decomp1528b
theorem neg_log_one_sub_inv_bounds {p : ℝ} (hp : 2 ≤ p) :
0 ≤ -log (1 - 1 / p) - 1 / p ∧ -log (1 - 1 / p) - 1 / p ≤ 1 / (2 * p * (p - 1)) := by sorry
end LL_Decomp1528bRead-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: neg_log_one_sub_inv_bounds
Variables and hypothesis. The statement has one universally quantified variable , ranging over the real numbers. Its only hypothesis is . No other binders or typeclass assumptions appear. The hypothesis is satisfiable, for example at .
Symbols. is the natural logarithm on the positive reals. The fraction is real division, so no integer or truncation effects occur. Under the hypothesis , the quantity satisfies , so the logarithm is applied only to positive numbers.
Assertion. Under the hypothesis, the statement asserts the conjunction of two non-strict inequalities.
The left-hand side of both inequalities is the same expression, namely . The first inequality bounds it below by . The second bounds it above by .
Edge cases. The statement contains no division by zero, since makes and nonzero. The bounds are attained only if equality holds in the stated inequalities. Neither bound is strict, so equality is allowed in both.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.