Cofinal finite integer-knot certificates for primitive character ramps
OpenGRH.primitive_nonprincipal_integer_ramp_window_certificatesFor every primitive nonprincipal Dirichlet character and exponent between one half and the verified boundary, there are fixed positive window width and nonnegative bound constants such that arbitrarily late integer bands admit all the indicated upper bounds on the corrected prime ramp. Each band requires only finitely many integer-knot inequalities, including one knot beyond the power endpoint. The correction uses the real logarithmic derivative of the character L-function at one.
This is the unresolved arithmetic certificate input. It does not assert that existing finite computations establish the cofinal family. Between successive integer knots the ramp is exactly affine, so a proved interpolation argument transfers these finite inequalities to the continuous windows with a factor of two to the exponent in the bound constant.
import Mathlib open Finset ArithmeticFunction Set
namespace GRH
theorem primitive_nonprincipal_integer_ramp_window_certificates :
∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q), χ.IsPrimitive → χ ≠ 1 →
∀ θ : ℝ, 1/2 < θ → θ ≤ (0.8749570698:ℝ) → ∃ δ C : ℝ, 0 < δ ∧ 0 ≤ C ∧
∀ M₀ : ℕ, ∃ M : ℕ, M₀ ≤ M ∧ 1 ≤ M ∧
∀ k ∈ Finset.Icc M (⌊(M:ℝ)^(1+δ)⌋₊+1),
(∑ n ∈ range (k+1), vonMangoldt n * (χ (n:ZMod q)).re *
max ((k:ℝ)/(n:ℝ)-1) 0) +
(k:ℝ) * (deriv χ.LFunction 1 / χ.LFunction 1).re ≤ C*(k:ℝ)^θ := by sorry
end GRH