Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Log-log lower table bound for primes up to 521

Proved
TaoFivePrimes.llb_le_loglog

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 llb(p)\mathrm{llb}(p)llb(p) stored in the lookup table llb is a lower bound for the double logarithm of ppp:

llb(p) ≤ log⁡log⁡p.\mathrm{llb}(p)\ \le\ \log\log p .llb(p) ≤ loglogp.

The value llb(p)\mathrm{llb}(p)llb(p) is the rounded-down rational approximation of log⁡log⁡p\log\log ploglogp recorded for the prime ppp in the finite tables of TaoFivePrimes_mertens_cert_511_tables. This prime-by-prime inequality is one of the two "log-log sandwich" table obligations used to control the endpoint error term ρ1\rho_1ρ1​ 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 llb_le_loglog (p : Nat) (hp : p ∈ pl521) :
    (llb p : Real) ≤ Real.log (Real.log (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