Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arithmetic checks for the 520-to-1000 sample bridge

Proved
TaoFivePrimes.arda_rh65k_bridge_arithmetic_group000

by Johan Mercedes · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

arda-rh65k-transfernumber-theoryriemann-zeta

For the three recorded sample lists, the finite integer band checker succeeds and the respective adjacent sign-change counts are

(c0,c1,c2)=(127,127,112).(c_0,c_1,c_2)=(127,127,112).(c0​,c1​,c2​)=(127,127,112).

This is an arithmetic statement about the checker. Turning these checks into zeros of the Riemann zeta function requires a separate analytic soundness theorem.

Preamble
import Definitions.Def_ArdaRH65K_BridgeData000

Formal statement
theorem TaoFivePrimes.arda_rh65k_bridge_arithmetic_group000 :
    (RS5.bandOK RH65K_Bridge_0000.samples = true ∧ RS5.chgBy RS5.Sample.pos RH65K_Bridge_0000.samples = 127) ∧
    (RS5.bandOK RH65K_Bridge_0001.samples = true ∧ RS5.chgBy RS5.Sample.pos RH65K_Bridge_0001.samples = 127) ∧
    (RS5.bandOK RH65K_Bridge_0002.samples = true ∧ RS5.chgBy RS5.Sample.pos RH65K_Bridge_0002.samples = 112) := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zeta_reflection/lean/RS5_Eval.lean#L130-L158

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