Passing to the supremum of the constant in the -form
ProvedZeta23.Assembly.eps_form_sup_halfanalysiszeta23
An abstract lemma formalizing the common "" step. Let assign a constant to each parameter value , let be a target constant, and let with for all . Say the -form holds with constant if for every there is with for all .
Assume: (i) is approached from below, i.e. for every there exists with ; and (ii) for every the -form holds with constant . Then the -form holds with constant :
Given , one picks with and applies the hypothesis at ; nonnegativity of makes the constants compose. In the project this feeds eps_form_twoThirds, where and , in the Zeta23.Assembly module.
Preamble
import Mathlib.Algebra.BigOperators.Finprod import Mathlib.Algebra.Order.Chebyshev import Mathlib.Algebra.Order.Rearrangement import Mathlib.Analysis.CStarAlgebra.Classes import Mathlib.Analysis.Calculus.ContDiff.Defs import Mathlib.Analysis.Complex.ExponentialBounds import Mathlib.Analysis.Convex.Birkhoff import Mathlib.Analysis.Matrix.Normed import Mathlib.Analysis.Matrix.PosDef import Mathlib.Analysis.Real.Pi.Bounds import Mathlib.Analysis.SpecialFunctions.Gamma.Digamma import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib.Analysis.SpecialFunctions.Pow.Complex import Mathlib.Data.Matrix.Basic import Mathlib.Data.Set.Card import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.MeasureTheory.Integral.Bochner.Basic import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic import Mathlib.MeasureTheory.Measure.Lebesgue.Basic import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Definitions.Def_Zeta23_Assembly import Definitions.Def_Zeta23_Assembly_Inputs import Definitions.Def_Zeta23_Defs import Definitions.Def_Zeta23_Hypotheses import Definitions.Def_Zeta23_LinAlg_HermitianPosPart import Definitions.Def_Zeta23_LinAlg_PosIndex import Definitions.Def_Zeta23_LinAlg_Sylvester import Definitions.Def_Zeta23_LinAlg_VonNeumann import Definitions.Def_Zeta23_PrimeSideTemp import Definitions.Def_Zeta23_TracesBoundsE open Matrix Finset RHLinalg open scoped ComplexOrder open Zeta23 open Assembly open Filter Asymptotics Topology
Formal statement
theorem Zeta23.Assembly.eps_form_sup_half {c : ℝ → ℝ} {C : ℝ}
(hc : ∀ η > (0:ℝ), ∃ lam : ℝ, 1 / 2 ≤ lam ∧ lam < 1 ∧ C - η ≤ c lam)
{N lower : ℝ → ℝ} (hN : ∀ T, 0 ≤ N T)
(h : ∀ lam : ℝ, 1 / 2 ≤ lam → lam < 1 →
∀ ε > 0, ∃ T₀, ∀ T ≥ T₀, (c lam - ε) * N T ≤ lower T) :
∀ ε > 0, ∃ T₀, ∀ T ≥ T₀, (C - ε) * N T ≤ lower T := by sorry
Source