Checked potential-table certificates, intervals 320–383
ProvedApery.PotentialCertificate.TableBlock320_383.checkedanalysisformalizationirrationalitynumber-theoryzeta5-mo271
Let be the stored rational certificate tree for intervals 320 through 383 of the 684-cell potential table. Every check in its validity predicate succeeds:
This includes the domain and series inequalities for the logarithm and arctangent bounds, the square-root enclosures, the sixteen weighted potential components, the interval-domain conditions, and overlap at every internal join. Each row's rational upper and lower bounds also satisfy
The theorem is an arithmetic certificate; the generic soundness theorem supplies its real-analytic interpretation.
Preamble
import Definitions.Def_Zeta5_PotentialTableBlock320_383Data
Formal statement
theorem Apery.PotentialCertificate.TableBlock320_383.checked : Apery.PotentialCertificate.TableBlock320_383.certificate.Valid := 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.