Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Row 23 RH support: RH67156EdgeCandidate

Definition
row23_rh_supp_RH67156EdgeCandidate

by abcdefg · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-verificationnumber-theoryriemann-zeta

A Lean-checked supporting component of the finite-height Riemann hypothesis and Chebyshev psi reduction for the b=23 Dusart Table 1 bound. Its declarations and hypotheses are stated exactly in the attached Lean source; this module alone does not assert the complete row estimate.

Definition code
import Definitions.Def_row23_rh_supp_RH65004EdgeTight
set_option autoImplicit false
set_option maxRecDepth 100000
set_option maxHeartbeats 0
noncomputable section
open Arb4 Arb4.Q
namespace RH67156Edge

def octant (j : Nat) : Int := ([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] : List Int).getD j 0

def proposed : EdgeD := { RH65004Edge.tight with
  tn := 67156
  pc := fun j => { RH65004Edge.tight.pc j with kk := octant j, U := Q.ofNat 67157, E := Q.mul (Q.frac 1800 1000) (RH65004Edge.tight.pc j).E, Qr := (RH65004Edge.tight.pc j).Qr * 1800 / 1000, FN := (RH65004Edge.tight.pc j).FN * 220, FD := (RH65004Edge.tight.pc j).FD * 100 } }

theorem proposed_steps :
    (List.range (proposed.m - 1)).all
      (fun j => decide (|(proposed.pc (j + 1)).kk - (proposed.pc j).kk| ≤ 3)) = true := by
  decide +kernel

theorem proposed_cover :
    (List.range proposed.m).all (fun j =>
      Arb4.inRad (proposed.x j) (proposed.pc j) &&
      Arb4.inRad (proposed.x (j + 1)) (proposed.pc j)) = true := by
  decide +kernel

theorem proposed_growth :
    (List.range proposed.m).all (fun j => Arb4.gOK proposed.N (proposed.pc j)) = true := by
  decide +kernel

theorem proposed_remainders :
    (List.range proposed.m).all (fun j => Arb4.remOK proposed.tn proposed.tq proposed.N (proposed.pc j)) = true := by
  decide +kernel

theorem proposed_budgets :
    (List.range proposed.m).all (fun j => Arb4.budgetOK proposed.N proposed.L (proposed.pc j)) = true := by
  decide +kernel
end RH67156Edge
#print axioms RH67156Edge.proposed_steps
#print axioms RH67156Edge.proposed_cover
#print axioms RH67156Edge.proposed_growth
#print axioms RH67156Edge.proposed_remainders
#print axioms RH67156Edge.proposed_budgets











Source
Supporting arithmetic and analytic certificate for P. Dusart, Ramanujan J. 45 (2018), Table 1 and explicit psi bounds, pp. 233–235, DOI 10.1007/s11139-016-9839-4.

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