Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Absorption of the rounded constant of the finite reciprocal-prime certificate

Proved
TaoFivePrimes.constant_certificate

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

analytic-number-theorynumber-theory

The rounded constant

Mq=32380009125000000M_q=\frac{32380009}{125000000}Mq​=12500000032380009​

of the finite certificate is bounded by the Euler–Mascheroni constant plus the convergent Meissel–Mertens tail:

Mq ≤ γ + ∑p(log⁡(1−1p)+1p).M_q\ \le\ \gamma\ +\ \sum_{p}\Bigl(\log\Bigl(1-\frac1p\Bigr)+\frac1p\Bigr).Mq​ ≤ γ + p∑​(log(1−p1​)+p1​).

The proof decomposes the constant into the table quantities of TaoFivePrimes_mertens_cert_511_tables: first Mq≤M≤glo+tloM_q\le M\le \mathrm{glo}+\mathrm{tlo}Mq​≤M≤glo+tlo by exact rational arithmetic, where

glo=30036740000−10⋅69314718081010−11024,tlo=WLO(512)−12(1512−18192)−18192.\mathrm{glo}=\frac{300367}{40000}-10\cdot\frac{6931471808}{10^{10}}-\frac1{1024},\qquad \mathrm{tlo}=WLO(512)-\frac12\Bigl(\frac1{512}-\frac1{8192}\Bigr)-\frac1{8192}.glo=40000300367​−10⋅10106931471808​−10241​,tlo=WLO(512)−21​(5121​−81921​)−81921​.

The lower bound glo≤γ\mathrm{glo}\le\gammaglo≤γ follows from the Mathlib bound on the Euler–Mascheroni sequence at index 102410241024. The lower bound tlo≤∑p(log⁡(1−1/p)+1/p)\mathrm{tlo}\le\sum_{p}(\log(1-1/p)+1/p)tlo≤∑p​(log(1−1/p)+1/p) is obtained by splitting the tail into three ranges: the finite part over primes ≤512\le 512≤512 is bounded below by the tabulated sum WLO(512)WLO(512)WLO(512), the middle range 512<p≤8192512<p\le 8192512<p≤8192 by the elementary estimate −12(1512−18192)≤∑512<p≤8192(log⁡(1−1/p)+1/p)-\frac12(\frac1{512}-\frac1{8192})\le\sum_{512<p\le 8192}(\log(1-1/p)+1/p)−21​(5121​−81921​)≤∑512<p≤8192​(log(1−1/p)+1/p), and the remaining tail is the platform theorem TaoFivePrimes.mertens_tail_upper_bound.

Together with the endpoint certificate for the table TTT, this constant absorption is what turns the rational constant MqM_qMq​ in the finite certificate into the standard analytic constant γ+∑p(log⁡(1−1/p)+1/p)\gamma+\sum_p(\log(1-1/p)+1/p)γ+∑p​(log(1−1/p)+1/p) of the reciprocal-prime endpoint estimate.

Preamble
import Mathlib
import Definitions.Def_TaoFivePrimes_mertens_cert_511_tables
Formal statement
namespace TaoFivePrimes

theorem constant_certificate :
    (Mq : Real) ≤ Real.eulerMascheroniConstant +
      ∑' p : Nat.Primes, (Real.log (1 - 1 / (p : Real)) + 1 / (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