Zero-free cell using a larger error radius
ProvedH1000Oct.cell_zeta_ne_zero_Rarda-rh65k-transfernumber-theoryriemann-zeta
Let be configurations with center given by , . Let , , and let states satisfy the defined off-line invariants after and terms. Suppose succeeds for radius , budget , and order . Let and satisfy
and, using the defined , , , and ,
Then whenever , , and . Real division is totalized as in Lean.
Preamble
import Definitions.Def_ArdaRH65K_Probes_ArbEconomics_Sound
import Definitions.Def_ArdaRH65K_ThetaValue
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
import Theorems.Thm_ArbEcon_Off_cell_zeta_ne_zero
import Theorems.Thm_H1000Oct_corrVar_mono
namespace ArbEcon
end ArbEcon
namespace ArbEcon.Off
end ArbEcon.Off
namespace ZetaReflection
end ZetaReflection
namespace ZetaReflection.EMHigh
end ZetaReflection.EMHigh
/- H1000Octant.lean -- lane h1000-integrate: the kernel-checked OCTANT PIECE, the evaluator side of
brick K6c (`ArgHoriz`) for the horizontal edges `[2, -1] + i T` of the RvM rectangles.
`ArgHoriz.hAH_of_octCert_boxes` reduces `argChangeHoriz ζ T 2 (-1) ∈ [L, H]` to an octant
certificate: breakpoints `2 = p 0 > p 1 > … > p m = -1`, one octant label `k j` per piece, and
the no-crossing facts `0 < octX (k j) ζ(x + i T)` for every `x` of piece `j`, plus two point
enclosures at `x = 2` and `x = -1`. This file proves the no-crossing fact of ONE piece from ONE
run of the off-line evaluator (`EMZetaOfflineEval`, `p + 1` accumulators) at the piece center
`c = σc + i tc` and ONE Boolean check run by `decide +kernel`:
A1. `emCorr_sub_le_norm`, `norm_emCorr_le_norm` -- the correction-factor bounds of
`EMZetaOfflineSlab` with `a ≤ ‖c - 1‖` in place of `a ≤ Im c` (so they hold near `s = 1`
at small heights);
A2. `emFinite_taylor_le_G` -- the Taylor model of the EM finite part for ANY real part of the
center: `‖n^(-c)‖ ≤ G` for `n ≤ N` (`G = 1` for `σc ≥ 0`, `N^(-σc)` for `σc < 0`);
B. `pochNormSq_mono_abs`, `em_remainder_horiz` -- the order-(2K+1) remainder uniformly on a
horizontal segment `xlo ≤ x ≤ xhi` (negative `x` allowed, `x > -2K`);
`natCpow_norm_le_of_pow` -- the `G` certificate `Gd^q N^b ≤ Gn^q N^a`;
C. `octLo`, `octUp`, `sumOct`, `checkOct`, `checkOct_sound` -- the kernel check
`Σ_{k=1}^p |octX (W_k)| r^k/k! + (|α| + |β|) F < octX (W_0)` on the evaluator balls;
D. `piece_octX_pos` -- THE PIECE: for every real `x` with `|x - σc| ≤ r`,
`0 < ArgHoriz.octX kk (ζ(x + i tc))`. Along a horizontal piece `h = x - σc` is REAL, so
the octant projection of the Taylor polynomial is a real polynomial in `h` and only the
projections `octX (W_k)` enter;
E. `abs_sub_le_of_mem_uIcc`, `budget_mono` -- small helpers for the generated certificates.
Trust: every theorem is proved from its stated hypotheses; axioms [propext, Classical.choice,
Quot.sound] (AxiomGuardAllZerosKernel_h1000). No `sorry`.
conjecture1_proved = False. Finite interval arithmetic along finitely many segments; nothing
here bears on the Riemann Hypothesis.
-/
open Complex ZetaReflection ZetaReflection.EMHigh
open scoped Nat Real
section
namespace H1000Oct
end H1000Oct
open H1000Oct
open ArbEcon ArbEcon.Off
/-! ## A1. The correction factor, with `a ≤ ‖c - 1‖`. -/
/-! ## A2. The Taylor model for any real part of the center. -/
/-! ## B. The remainder along a horizontal segment, and the `G` certificate. -/
/-! ## C. The kernel check of a piece. -/
/-! ## D. The piece. -/
/-! ## E. Helpers for the generated certificates. -/
/-! ## F. Closed forms for the generated budgets (K ≤ 6), and the slab-cell wrapper. -/
Formal statement
theorem H1000Oct.cell_zeta_ne_zero_R (c : Cfg) (o : OCfg) (σc tc : ℝ) (hσ : σc = ((o.a : ℝ) - o.b) / o.q)
(ht : tc = (c.tn : ℝ) / 2 ^ c.tq) (K N p : ℕ) (hK : 1 ≤ K) (hN : 2 ≤ N) (s1 s2 : StO)
(h1 : InvO c σc tc (N - 1) s1) (h2 : InvO c σc tc N s2) (rn rd FN FD : ℕ)
(hchk : checkCell c o K N p s1.acc s2.acc rn rd FN FD = true)
(R L a U B Qr : ℝ) (r0 : ℕ) (hrR : (rn : ℝ) / rd ≤ R) (hL : (s2.lhi : ℝ) ≤ L * 2 ^ c.P)
(hRL : R * L ≤ 1) (ha : 0 < a) (hta : a ≤ tc) (hσc : 0 ≤ σc) (hU0 : 0 ≤ U)
(hU : (σc + (2 * K - 1 : ℝ)) ^ 2 + tc ^ 2 ≤ U ^ 2) (hQr0 : 0 ≤ Qr)
(hQ : pochNormSq 1 B (2 * K + 1) ≤ Qr ^ 2) (hr0 : 0 < r0) (hr0N : r0 ^ 2 ≤ N)
(hbudget : Cp p * (R * L) ^ (p + 1) * (((N : ℝ) - 1) + emcB K N a U)
+ 3 * corrVar K N R a U
+ CK K * Qr / ((N : ℝ) ^ (2 * K) * r0) / (((2 * K : ℕ) : ℝ) + 1 / 2) ≤ (FN : ℝ) / FD) :
∀ s : ℂ, ‖s - sOfG σc tc‖ ≤ (rn : ℝ) / rd → a ≤ s.im → s.im ≤ B → 1 / 2 ≤ s.re → s.re ≤ 1 →
riemannZeta s ≠ 0 := by sorry
Source