Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arb4 H1000Edges 0 certificate definitions

Definition
ArdaRH65K_Turing121_Arb4_H1000Edges_0

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

arda-rh65k-transfernumber-theoryriemann-zeta

This bundle records the rational horizontal-edge certificate at height 121. Let D\mathcal DD be the set of declarations it provides. Among its named definitions are

D⊇{Arb4.H1000.E_T121}.\mathcal D\supseteq\{\mathtt{Arb4.H1000.E\_T121}\}.D⊇{Arb4.H1000.E_T121}.

The accompanying theorems establish the mathematical properties of these definitions.

Definition code
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
import Definitions.Def_ArdaRH65K_ThetaValue
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Edge
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Q
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Side
import Definitions.Def_ArdaRH65K_Turing121_ArctanTaylor
import Definitions.Def_ArdaRH65K_Turing121_ArgHoriz
import Definitions.Def_ArdaRH65K_Turing121_DiffractionCore
import Definitions.Def_ArdaRH65K_Turing121_DlvpTheta
import Definitions.Def_ArdaRH65K_Turing121_DlvpZetaRateEffective
import Definitions.Def_ArdaRH65K_Turing121_EMZeta
import Definitions.Def_ArdaRH65K_Turing121_EMZetaComplex
import Definitions.Def_ArdaRH65K_Turing121_EMZetaHigh
import Definitions.Def_ArdaRH65K_Turing121_EMZetaHighCheck
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineCheck
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineCore
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineEval
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineSlab
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineSlabCheck
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineSlabClear
import Definitions.Def_ArdaRH65K_Turing121_EMZetaOfflineSound
import Definitions.Def_ArdaRH65K_Turing121_EMZetaTail
import Definitions.Def_ArdaRH65K_Turing121_EdgeClearGlue
import Definitions.Def_ArdaRH65K_Turing121_H1000Octant
import Definitions.Def_ArdaRH65K_Turing121_Probes_ArbEconomics_Zeta
import Definitions.Def_ArdaRH65K_Turing121_RHInBoxAnalytic
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Definitions.Def_ArdaRH65K_Turing121_StripReprR1
import Definitions.Def_ArdaRH65K_Turing121_TuringBand
import Definitions.Def_ArdaRH65K_XiLineZeros
import Definitions.Def_ArdaRS_Arithmetic
import Definitions.Def_ArdaRS_Config64
import Mathlib
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.Analysis.Analytic.Uniqueness
import Mathlib.Analysis.Calculus.Deriv.MeanValue
import Mathlib.Analysis.Complex.Exponential
import Mathlib.Analysis.Complex.ExponentialBounds
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Analysis.SpecialFunctions.Complex.Arg
import Mathlib.Analysis.SpecialFunctions.Gamma.Beta
import Mathlib.Analysis.SpecialFunctions.ImproperIntegrals
import Mathlib.Analysis.SpecialFunctions.Integrals.Basic
import Mathlib.Analysis.SpecialFunctions.Log.Deriv
import Mathlib.Analysis.SpecialFunctions.Pow.Deriv
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Bounds
import Mathlib.MeasureTheory.Function.Floor
import Mathlib.MeasureTheory.Integral.IntegralEqImproper
import Mathlib.MeasureTheory.Integral.IntervalIntegral.IntegrationByParts
import Mathlib.NumberTheory.LSeries.RiemannZeta
import Mathlib.NumberTheory.ZetaValues
import Mathlib.Tactic.IntervalCases
/-  Arb4_H1000Edges_0.lean -- lane Arb4: COMPACT kernel certificates of 5 horizontal argument changes
    (GENERATED by ../Arb4_emit_seg.py; do not edit).  Each edge: the certificate data
    `Arb4.EdgeD` (pieces planned by emit_h1000_offline.plan_edge, unchanged) and ONE
    `decide +kernel` of `Arb4.edgeOK` (every octant piece with its evaluator run, the endpoint
    boxes, the corner slopes and the final pi / arctan inequalities), then `Arb4.edgeOK_sound`.
    Heights: 1, 41, 81, 121, 161.
    conjecture1_proved = False.  Finite verification up to a fixed height only.
-/


open Arb4 Arb4.Q

namespace Arb4.H1000



















/-- The edge `[2, -1] + i 121` (10 pieces, N = 37). -/
noncomputable def E_T121 : EdgeD where
  tn := 121
  tq := 0
  N := 37
  L := (Q.frac 3611 1000)
  m := 10
  x := fun j => [(Q.frac 2 1), (Q.frac 7 4), (Q.frac 5 4), (Q.frac 3 4), (Q.frac 1 4), (Q.frac 0 1), (Q.frac (-1) 4), (Q.frac (-1) 2), (Q.frac (-3) 4), (Q.frac (-7) 8), (Q.frac (-1) 1)].getD j (Q.frac (-1) 1)
  pc := fun j => [{ a := 2, b := 0, q := 1, rn := 1, rd := 4, kk := 0, FN := 118, FD := 3125, aQ := (Q.frac 120753 1000), U := (Q.frac 122 1), ga := 0, gb := 0, gq := 1, Gn := 1, Gd := 1, ea := 28, eb := 0, eqd := 16, Rn := 1890, Rd := 1048576, xhi := (Q.frac 9 4), sigs := (Q.frac 9 4), Qr := 1236000000000000000000000000, E := (Q.frac 2073 1000000000) },
    { a := 3, b := 0, q := 2, rn := 1, rd := 4, kk := (-1), FN := 189, FD := 5000, aQ := (Q.frac 483 4), U := (Q.frac 122 1), ga := 0, gb := 0, gq := 1, Gn := 1, Gd := 1, ea := 20, eb := 0, eqd := 16, Rn := 11491, Rd := 1048576, xhi := (Q.frac 7 4), sigs := (Q.frac 7 4), Qr := 1232000000000000000000000000, E := (Q.frac 163 12500000) },
    { a := 1, b := 0, q := 1, rn := 1, rd := 4, kk := (-1), FN := 473, FD := 12500, aQ := (Q.frac 120749 1000), U := (Q.frac 122 1), ga := 0, gb := 0, gq := 1, Gn := 1, Gd := 1, ea := 12, eb := 0, eqd := 16, Rn := 69896, Rd := 1048576, xhi := (Q.frac 5 4), sigs := (Q.frac 5 4), Qr := 1228000000000000000000000000, E := (Q.frac 8211 100000000) },
    { a := 1, b := 0, q := 2, rn := 1, rd := 4, kk := (-2), FN := 383, FD := 10000, aQ := (Q.frac 483 4), U := (Q.frac 122 1), ga := 0, gb := 0, gq := 1, Gn := 1, Gd := 1, ea := 4, eb := 0, eqd := 16, Rn := 425158, Rd := 1048576, xhi := (Q.frac 3 4), sigs := (Q.frac 3 4), Qr := 1224000000000000000000000000, E := (Q.frac 2591 5000000) },
    { a := 1, b := 0, q := 8, rn := 1, rd := 8, kk := (-3), FN := 219, FD := 50000, aQ := (Q.frac 120877 1000), U := (Q.frac 122 1), ga := 0, gb := 0, gq := 1, Gn := 1, Gd := 1, ea := 0, eb := 0, eqd := 16, Rn := 1048576, Rd := 1048576, xhi := (Q.frac 1 4), sigs := (Q.frac 1 4), Qr := 1221000000000000000000000000, E := (Q.frac 651 500000) },
    { a := 0, b := 1, q := 8, rn := 1, rd := 8, kk := (-4), FN := 203, FD := 25000, aQ := (Q.frac 120879 1000), U := (Q.frac 122 1), ga := 0, gb := 2, gq := 16, Gn := 1646741, Gd := 1048576, ea := 0, eb := 4, eqd := 16, Rn := 2586130, Rd := 1048576, xhi := (Q.frac 0 1), sigs := (Q.frac 1 4), Qr := 1221000000000000000000000000, E := (Q.frac 41 12500) },
    { a := 0, b := 3, q := 8, rn := 1, rd := 8, kk := (-4), FN := 101, FD := 5000, aQ := (Q.frac 120881 1000), U := (Q.frac 122 1), ga := 0, gb := 6, gq := 16, Gn := 4061399, Gd := 1048576, ea := 0, eb := 8, eqd := 16, Rn := 6378239, Rd := 1048576, xhi := (Q.frac (-1) 4), sigs := (Q.frac 1 2), Qr := 1222000000000000000000000000, E := (Q.frac 827 100000) },
    { a := 0, b := 5, q := 8, rn := 1, rd := 8, kk := (-4), FN := 503, FD := 10000, aQ := (Q.frac 30221 250), U := (Q.frac 122 1), ga := 0, gb := 10, gq := 16, Gn := 10016731, Gd := 1048576, ea := 0, eb := 12, eqd := 16, Rn := 15730815, Rd := 1048576, xhi := (Q.frac (-1) 2), sigs := (Q.frac 3 4), Qr := 1224000000000000000000000000, E := (Q.frac 261 12500) },
    { a := 0, b := 13, q := 16, rn := 1, rd := 16, kk := (-4), FN := 23, FD := 400, aQ := (Q.frac 2419 20), U := (Q.frac 122 1), ga := 0, gb := 13, gq := 16, Gn := 19713504, Gd := 1048576, ea := 0, eb := 14, eqd := 16, Rn := 24704521, Rd := 1048576, xhi := (Q.frac (-3) 4), sigs := (Q.frac 7 8), Qr := 1225000000000000000000000000, E := (Q.frac 83 2500) },
    { a := 0, b := 1, q := 1, rn := 1, rd := 8, kk := (-4), FN := 989, FD := 5000, aQ := (Q.frac 12089 100), U := (Q.frac 122 1), ga := 0, gb := 16, gq := 16, Gn := 38797312, Gd := 1048576, ea := 0, eb := 18, eqd := 16, Rn := 60929394, Rd := 1048576, xhi := (Q.frac (-7) 8), sigs := (Q.frac 9 8), Qr := 1227000000000000000000000000, E := (Q.frac 839 10000) }].getD j { a := 0, b := 1, q := 1, rn := 1, rd := 8, kk := (-4), FN := 989, FD := 5000, aQ := (Q.frac 12089 100), U := (Q.frac 122 1), ga := 0, gb := 16, gq := 16, Gn := 38797312, Gd := 1048576, ea := 0, eb := 18, eqd := 16, Rn := 60929394, Rd := 1048576, xhi := (Q.frac (-7) 8), sigs := (Q.frac 9 8), Qr := 1227000000000000000000000000, E := (Q.frac 839 10000) }
  D0 := 1000000000
  reLo0 := 887533939
  reHi0 := 887535585
  imLo0 := (-260353112)
  imHi0 := (-260351467)
  Qp0 := 1233629273254743175689888791
  Rn0 := 3137303
  Rd0 := 4294967296
  qlo0 := (Q.frac (-58669) 200000)
  qhi0 := (Q.frac (-146671) 500000)
  D1 := 1000000000
  reLo1 := (-76527171955)
  reHi1 := (-76422950491)
  imLo1 := 16122207898
  imHi1 := 16226429362
  Qp1 := 1212576639345629690154789716
  Rn1 := 158913789952
  Rd1 := 4294967296
  qlo1 := (Q.frac (-8493) 40000)
  qhi1 := (Q.frac (-13167) 62500)
  Lo := (Q.frac (-3068991) 1000000)
  Hi := (Q.frac (-3055801) 1000000)











end Arb4.H1000


def ArdaRH65K_Turing121_Arb4_H1000Edges_0 : Nat := 0
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zeta_reflection/lean/Arb4_H1000Edges_0.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