Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two sided bound for the logarithmic remainder

Proved
LL_Decomp1528b.neg_log_one_sub_inv_bounds

by sthubbar · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For real p≥2p\ge 2p≥2, 0≤−log⁡(1−1/p)−1/p0\le -\log(1-1/p)-1/p0≤−log(1−1/p)−1/p and −log⁡(1−1/p)−1/p≤1/(2p(p−1))-\log(1-1/p)-1/p\le 1/(2p(p-1))−log(1−1/p)−1/p≤1/(2p(p−1)).

Preamble
import Mathlib

open Real Finset Filter Topology
Formal statement
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_Decomp1528b
Source
Rosser and Schoenfeld, Illinois J. Math. 6 (1962), proof of Theorem 7, p. 75 style
Read-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 ppp, ranging over the real numbers. Its only hypothesis is 2≤p2 \le p2≤p. No other binders or typeclass assumptions appear. The hypothesis is satisfiable, for example at p=2p = 2p=2.

Symbols. log⁡\loglog is the natural logarithm on the positive reals. The fraction 1p\frac{1}{p}p1​ is real division, so no integer or truncation effects occur. Under the hypothesis p≥2p \ge 2p≥2, the quantity 1−1p1 - \frac{1}{p}1−p1​ satisfies 1−1p≥12>01 - \frac{1}{p} \ge \frac{1}{2} > 01−p1​≥21​>0, so the logarithm is applied only to positive numbers.

Assertion. Under the hypothesis, the statement asserts the conjunction of two non-strict inequalities.

0≤−log⁡(1−1p)−1p0 \le -\log\left(1 - \frac{1}{p}\right) - \frac{1}{p}0≤−log(1−p1​)−p1​ −log⁡(1−1p)−1p≤12p(p−1)-\log\left(1 - \frac{1}{p}\right) - \frac{1}{p} \le \frac{1}{2p(p-1)}−log(1−p1​)−p1​≤2p(p−1)1​

The left-hand side of both inequalities is the same expression, namely −log⁡(1−1p)−1p-\log\left(1 - \frac{1}{p}\right) - \frac{1}{p}−log(1−p1​)−p1​. The first inequality bounds it below by 000. The second bounds it above by 12p(p−1)\frac{1}{2p(p-1)}2p(p−1)1​.

Edge cases. The statement contains no division by zero, since p≥2p \ge 2p≥2 makes ppp and p−1p - 1p−1 nonzero. The bounds are attained only if equality holds in the stated inequalities. Neither bound is strict, so equality is allowed in both.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me