Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arb4 Seg certificate definitions

Definition
ArdaRH65K_Turing121_Arb4_Seg

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

arda-rh65k-transfernumber-theoryriemann-zeta

This bundle defines rational enclosure data and validation for a zero-count segment. Let D\mathcal DD be the set of declarations it provides. Among its named definitions are

D⊇{Arb4.EnclQ.L5,  Arb4.EnclQ.H1,  Arb4.EnclQ.L4,  Arb4.EnclQ.L2}.\mathcal D\supseteq\{\mathtt{Arb4.EnclQ.L5},\;\mathtt{Arb4.EnclQ.H1},\;\mathtt{Arb4.EnclQ.L4},\;\mathtt{Arb4.EnclQ.L2}\}.D⊇{Arb4.EnclQ.L5,Arb4.EnclQ.H1,Arb4.EnclQ.L4,Arb4.EnclQ.L2}.

The accompanying theorems establish the mathematical properties of these definitions.

Definition code
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
import Definitions.Def_ArdaRH65K_RSTheta
import Definitions.Def_ArdaRH65K_ThetaConverge
import Definitions.Def_ArdaRH65K_ThetaValue
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Edge
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Gamma
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Line
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Q
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Side
import Definitions.Def_ArdaRH65K_Turing121_Arb4_Slab
import Definitions.Def_ArdaRH65K_Turing121_ArctanTaylor
import Definitions.Def_ArdaRH65K_Turing121_ArgChangeGlue
import Definitions.Def_ArdaRH65K_Turing121_ArgGammaR
import Definitions.Def_ArdaRH65K_Turing121_ArgHoriz
import Definitions.Def_ArdaRH65K_Turing121_ArgZetaTwo
import Definitions.Def_ArdaRH65K_Turing121_BandGlue
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_H1000Line
import Definitions.Def_ArdaRH65K_Turing121_H1000Octant
import Definitions.Def_ArdaRH65K_Turing121_H1000Phase
import Definitions.Def_ArdaRH65K_Turing121_H1000Point
import Definitions.Def_ArdaRH65K_Turing121_HeightFloorCheck
import Definitions.Def_ArdaRH65K_Turing121_KernelGammaEnvelope
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.PSeries
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Analysis.SpecialFunctions.Complex.Arg
import Mathlib.Analysis.SpecialFunctions.Gamma.Beta
import Mathlib.Analysis.SpecialFunctions.Gamma.BohrMollerup
import Mathlib.Analysis.SpecialFunctions.Gamma.Deligne
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_Seg.lean -- lane Arb4: the band-level glue of a COMPACT hypothesis-free ladder segment.

    For a Turing band `d : BandGlue.BandData` of a ladder segment (its edges, count and Blaschke ball
    from the zeta_zero_localization band plan), the certificate route of `BandGlue` needs: the
    decidable side conditions `Valid` for the band with OUR enclosures, the K1 cap geometry, the
    on-line zeros, two zero-free slabs, the K6 side conditions and the two horizontal edges.  Here:

      * `EnclQ`, `withEncl`  -- the five enclosures as rationals, and the band with them swapped in;
      * `validB`, `valid_of_B` -- `Valid` (ball cover of the RvM rectangle, the two pins) from ONE
                               Boolean over the band's rational table values;
      * `k6sideB`, `k6side_of_B` -- `ArgChangeGlue.K6Side` (K6a range, K6b brackets) from ONE Boolean;
      * `boxCert_of_parts`   -- the band's `BandGlue.BoxCert` from the parts (K0 + K1 + K6).

    Trust: every theorem is proved from its stated hypotheses; axioms [propext, Classical.choice,
    Quot.sound] (Arb4_AxiomGuard).  No `sorry`.  conjecture1_proved = False.
-/






open Complex

namespace Arb4

open Q BandGlue BandGlue.BandData

/-- The five RvM enclosures `[L1,H1] … [L5,H5]` as rationals. -/
structure EnclQ where
  L1 : Q
  H1 : Q
  L2 : Q
  H2 : Q
  L3 : Q
  H3 : Q
  L4 : Q
  H4 : Q
  L5 : Q
  H5 : Q

/-- Band `d` with its five enclosures replaced by `E` (same `T0`, `T1`, `n`, ball). -/
noncomputable def withEncl (d : BandData) (E : EnclQ) : BandData :=
  ⟨d.T0, d.T1, d.n, E.L1.val, E.H1.val, E.L2.val, E.H2.val, E.L3.val, E.H3.val, E.L4.val, E.H4.val,
    E.L5.val, E.H5.val, d.c, d.R, d.hs1⟩

/-- `2 L1 + L2 - H3 + L4 + L5`. -/
def pinLQ (E : EnclQ) : Q := add (add (sub (add (mul (ofNat 2) E.L1) E.L2) E.H3) E.L4) E.L5

/-- `2 H1 + H2 - L3 + H4 + H5`. -/
def pinHQ (E : EnclQ) : Q := add (add (sub (add (mul (ofNat 2) E.H1) E.H2) E.L3) E.H4) E.H5





/-- The K6a range of `[L1, H1]` and the K6b comparisons of `[L4, H4]`, `[L5, H5]`. -/
def k6sideB (G0 G1 : GamD) (E : EnclQ) : Bool :=
  le E.L1 (frac (-249) 250) && le (frac 249 250) E.H1 && k6B G0 G1 E.L4 E.H4 E.L5 E.H5





end Arb4


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