Plateau lower bound for :
ProvedZeta23.Taper.one_sub_le_bConstanalysismollifierzeta23
Let be a taper profile and the taper of [eq:phidef], with and . Following [eq:abdef], set
The theorem asserts the lower bound
It follows from on the plateau (of length ) together with .
In the project this shows as the ramps become negligible (), which is how the taper constants enter the final optimization: it is consumed by Zeta23.PrimeSide.localHyps_concrete, Zeta23.Tail.eventually_tailPackage, Zeta23.eventually_blockInputs and Zeta23.eventually_side_conditions — the nodes assembling the asymptotic side conditions as for the matrix-variational bound behind Theorem A.
Preamble
import Mathlib
import Mathlib.Algebra.BigOperators.Finprod
import Mathlib.Analysis.CStarAlgebra.Classes
import Mathlib.Analysis.Calculus.ContDiff.Deriv
import Mathlib.Analysis.Calculus.Deriv.Support
import Mathlib.Analysis.Fourier.FourierTransform
import Mathlib.Analysis.SpecialFunctions.Gamma.Digamma
import Mathlib.Analysis.SpecialFunctions.Pow.Complex
import Mathlib.Analysis.SpecialFunctions.SmoothTransition
import Mathlib.Data.Matrix.Basic
import Mathlib.Data.Set.Card
import Mathlib.MeasureTheory.Integral.Bochner.Basic
import Mathlib.MeasureTheory.Integral.IntegralEqImproper
import Mathlib.MeasureTheory.Measure.Lebesgue.Basic
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Definitions.Def_Zeta23_Defs
import Definitions.Def_Zeta23_Taper_Basic
open Complex MeasureTheory Real Set Filter Topology
open scoped FourierTransform
open Zeta23
open Taper
variable {ϱ : ℝ → ℝ} {L w : ℝ}
Formal statement
theorem Zeta23.Taper.one_sub_le_bConst (hϱ : TaperProfile ϱ) (hw : 0 < w) (hwL : 2 * w ≤ L) :
1 - 2 * w / L ≤ bConst ϱ L w := by sorry
Source