H11K Turing certificate definitions
DefinitionArdaRH65K_Turing121_H11K_Turingarda-rh65k-transfernumber-theoryriemann-zeta
This bundle defines validation conditions for a sharp argument-principle band certificate. Let be the set of declarations it provides. Among its named definitions are
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_Seg
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
/- H11K_Turing.lean -- lane H11K: the Turing band template with SHARP pi pins, for WIDE bands.
`TuringBand.band_count_eq` pins the band count with `3.14 < π < 3.1416`. The upper pin
`2 H1 + H2 - L3 + H4 + H5 < 2 * 3.14 * (N + 1)` then loses `2 (π - 3.14) N ≈ 0.0032 N` radians,
which (with the K6a range `[-249/250, 249/250]` alone costing about 4 radians) caps a band at
roughly 700 zeros. A single band over `[31851/4, 11004]` holds 3541 zeros. This file re-proves
the same template with `3.141592 < π < 3.141593` (`Real.pi_gt_d6`, `Real.pi_lt_d6`); the RvM
edge decomposition (`DiffractionCore.zero_count_band_edge_decomp`), the Blaschke split and the
count-exhaustion core are reused unchanged.
* `band_count_eq_sharp`, `turing_band_on_line_sharp` -- `TuringBand.band_count_eq` /
`turing_band_on_line` with the sharp pins (proofs copied, constants changed);
* `ValidS`, `stmt_of_validS` -- `BandGlue.BandData.Valid` / `stmt_of_valid` with the sharp
pins; the conclusion is the band's canonical statement `d.Stmt σ0 σ1` (the same Prop,
`TuringBand.BandStatement`, whatever the pins), so every other piece of `BandGlue` applies;
* `validBS`, `validS_of_B` -- the decidable side conditions as ONE Boolean (as `Arb4.validB`);
* `boxCert_of_parts_sharp` -- `Arb4.boxCert_of_parts` with `ValidS`.
Trust: every theorem is proved from its stated hypotheses; axioms [propext, Classical.choice,
Quot.sound] (H11K_AxiomGuard). No `sorry`. conjecture1_proved = False.
-/
open Complex
namespace H11K
open BandGlue BandGlue.BandData
/-- `BandGlue.BandData.Valid` with the sharp pins. -/
structure ValidS (σ0 σ1 : ℝ) (d : BandData) : Prop where
hT0 : 0 < d.T0
hT : d.T0 ≤ d.T1
hs0 : (-1 : ℝ) ≤ σ0
hs2 : σ1 ≤ 2
hre_lo : σ0 ≤ 1 / 2
hre_hi : 1 / 2 ≤ σ1
hRpos : 0 < d.R
hN1 : 1 ≤ d.n
hbox_ball : ∀ ρ : ℂ, ((-1 : ℝ) ≤ ρ.re ∧ ρ.re ≤ 2) → (d.T0 ≤ ρ.im ∧ ρ.im ≤ d.T1) →
ρ ∈ Metric.ball d.c d.R
hpinL : 2 * 3.141593 * ((d.n : ℝ) - 1) < 2 * d.L1 + d.L2 - d.H3 + d.L4 + d.L5
hpinH : 2 * d.H1 + d.H2 - d.L3 + d.H4 + d.H5 < 2 * 3.141592 * ((d.n : ℝ) + 1)
open Arb4 Arb4.Q
/-- The decidable side conditions of `ValidS` (as `Arb4.validB`, sharp pins). -/
def validBS (t0 t1 cim q : Q) (n : ℕ) (E : EnclQ) : Bool :=
lt (ofNat 0) t0 && le t0 t1 && lt (ofNat 0) q && le t0 cim && le cim t1 &&
lt (add (frac 9 4) (npow (sub cim t0) 2)) q && lt (add (frac 9 4) (npow (sub t1 cim) 2)) q &&
Nat.ble 1 n &&
lt (mul (mul (ofNat 2) (frac 3141593 1000000)) (sub (ofNat n) (ofNat 1))) (pinLQ E) &&
lt (pinHQ E) (mul (mul (ofNat 2) (frac 3141592 1000000)) (add (ofNat n) (ofNat 1)))
end H11K
def ArdaRH65K_Turing121_H11K_Turing : Nat := 0
Source