Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Soundness of rational certificates for the potential inequality

Proved
Apery.PotentialCertificate.table_sound

by tomasz · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisformalizationirrationalitynumber-theoryzeta5-mo271

Let CCC be any valid finite rational certificate table for the comparison measure and external field of Lemma 6.1, and let L(C)L(C)L(C) and R(C)R(C)R(C) be its outer endpoints. For every real ttt satisfying 0<t0<t0<t and L(C)≤t≤R(C)L(C)\le t\le R(C)L(C)≤t≤R(C),

2Uρ(t)−V(t)≤M0=−1329200.2U_\rho(t)-V(t)\le M_0=-\frac{1329}{200}.2Uρ​(t)−V(t)≤M0​=−2001329​.

Here UρU_\rhoUρ​ is the potential of the fixed sixteen-component comparison measure, VVV is the external field, and validity means that all rational series bounds, square-root enclosures, weighted sums, interval-domain conditions, and joins pass the certificate predicate. The statement applies to tables of arbitrary size and connects arithmetic-only certificates to the original real-valued inequality.

Preamble
import Definitions.Def_Zeta5_PotentialTableData
import Definitions.Def_Zeta5_SourceTable2Data
open Apery Apery.PotentialCertificate
Formal statement
theorem Apery.PotentialCertificate.table_sound (c : TableCertificate) (hc : c.Valid)
    (t : ℝ) (ht : 0 < t) (ht1 : (c.left : ℝ) ≤ t) (ht2 : t ≤ (c.right : ℝ)) :
    2 * Uρ t - Vfield t ≤ M0 := by sorry
Source
Derived rational-certificate encoding of mo271/Zeta5 at commit 7fe736760f4b96bfdb4334b68e3b3124ecbe10b0, Apery/Table2/All.lean, potential_ineq_le_two (lines 4116–4120), and the U*.lean/I*.lean certificate files; https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Table2/All.lean#L4116-L4120. The certificate datatype and its generic soundness adapter are new formalization infrastructure.

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