Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arithmetic count budget for the 121-to-65000 band

Proved
H65K.Count121.chk

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

arda-rh65k-transfernumber-theoryriemann-zeta

Let E,G0,G1E,G_0,G_1E,G0​,G1​ be the recorded rational argument-change and gamma enclosures. The finite band and side checks for the count K=85250K=85250K=85250 both hold:

validBS⁡(121,65000,65121/2,4209284657/4,K,E)=true,k6sideB⁡(G0,G1,E)=true.\operatorname{validBS}(121,65000,65121/2,4209284657/4,K,E)=\mathrm{true},\qquad\operatorname{k6sideB}(G_0,G_1,E)=\mathrm{true}.validBS(121,65000,65121/2,4209284657/4,K,E)=true,k6sideB(G0​,G1​,E)=true.

This is the arithmetic budget used by the separate argument-principle proof.

Preamble
import Definitions.Def_ArdaRH65K_Count121Data
set_option maxRecDepth 100000
set_option maxHeartbeats 0
open Arb4 Arb4.Q

Formal statement
theorem H65K.Count121.chk :
    (H11K.validBS (Q.ofNat 121) (Q.ofNat 65000) (Q.frac 65121 2)
      (Q.frac 4209284657 4) 85250 H65K.Count121.E &&
      k6sideB H65K.Count121.G0 H65K.Count121.G1 H65K.Count121.E) = true := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zeta_reflection/lean/H11K_Turing.lean

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