Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Row 23 RH support: RHLow100ThetaBatch07

Definition
row23_rh_supp_RHLow100ThetaBatch07

by abcdefg · Nov 13, 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_TaoFivePrimes_RH14To100ThetaInterface
set_option autoImplicit false
set_option maxRecDepth 100000
set_option maxHeartbeats 0
noncomputable section
namespace RHLow100Theta
theorem row07point0 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨0, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨0, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨0, by decide⟩) = true := by
  decide +kernel
theorem row07point1 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨1, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨1, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨1, by decide⟩) = true := by
  decide +kernel
theorem row07point2 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨2, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨2, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨2, by decide⟩) = true := by
  decide +kernel
theorem row07point3 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨3, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨3, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨3, by decide⟩) = true := by
  have hn : ¬ CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨3, by decide⟩ := by
    unfold CertifiedThetaPoints.active
    decide +kernel
  exact False.elim (hn ha)
theorem row07point4 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨4, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨4, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨4, by decide⟩) = true := by
  have hn : ¬ CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨4, by decide⟩ := by
    unfold CertifiedThetaPoints.active
    decide +kernel
  exact False.elim (hn ha)
theorem row07point5 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨5, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨5, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨5, by decide⟩) = true := by
  have hn : ¬ CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨5, by decide⟩ := by
    unfold CertifiedThetaPoints.active
    decide +kernel
  exact False.elim (hn ha)
theorem row07point6 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨6, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨6, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨6, by decide⟩) = true := by
  have hn : ¬ CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨6, by decide⟩ := by
    unfold CertifiedThetaPoints.active
    decide +kernel
  exact False.elim (hn ha)
theorem row07point7 (ha : CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨7, by decide⟩) :
    CertifiedJetRecords.checkRecord ⟨7, by decide⟩ ⟨7, by decide⟩
      (CertifiedJetRecords.recordAt ⟨7, by decide⟩ ⟨7, by decide⟩) = true := by
  have hn : ¬ CertifiedThetaPoints.active ⟨7, by decide⟩ ⟨7, by decide⟩ := by
    unfold CertifiedThetaPoints.active
    decide +kernel
  exact False.elim (hn ha)
end RHLow100Theta
#print axioms RHLow100Theta.row07point0
#print axioms RHLow100Theta.row07point1
#print axioms RHLow100Theta.row07point2
#print axioms RHLow100Theta.row07point3
#print axioms RHLow100Theta.row07point4
#print axioms RHLow100Theta.row07point5
#print axioms RHLow100Theta.row07point6
#print axioms RHLow100Theta.row07point7
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