Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Logarithm upper table bound for primes up to 521

Proved
TaoFivePrimes.log_le_lub

by andreaskapfer · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

For each of the 98 primes p≤521p\le 521p≤521, the rational value lub(p)\mathrm{lub}(p)lub(p) stored in the lookup table lub is an upper bound for the natural logarithm of ppp:

log⁡p ≤ lub(p).\log p\ \le\ \mathrm{lub}(p).logp ≤ lub(p).

The value lub(p)\mathrm{lub}(p)lub(p) is the rounded-up rational approximation of log⁡p\log plogp recorded for the prime ppp in the finite tables of TaoFivePrimes_mertens_cert_511_tables. This inequality is the upper half of the "log-log sandwich" used to bound the endpoint error terms in the finite endpoint certificate for the reciprocal-prime estimate.

Formalization Note. The hypothesis hp:p∈pl521hp : p \in \mathrm{pl521}hp:p∈pl521 restricts ppp to the explicit finite set of primes ≤521\le 521≤521; the statement is a finite table verification.

Preamble
import Mathlib
import Definitions.Def_TaoFivePrimes_mertens_cert_511_tables
Formal statement
namespace TaoFivePrimes

theorem log_le_lub (p : Nat) (hp : p ∈ pl521) :
    Real.log (p : Real) ≤ (lub p : Real) := by
  sorry

end TaoFivePrimes

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