Cofinal fourth-power certificates for primitive character ramps
OpenGRH.primitive_nonprincipal_fourth_power_ramp_window_certificatesdirichlet-charactersfinite-certificatesnumber-theory
Fix a primitive nonprincipal Dirichlet character and an exponent . Define its corrected prime ramp by
There exist and such that for arbitrarily large positive integers , we have whenever and . The final sample supplies the right endpoint of the last interpolation interval.
Preamble
import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.NumberTheory.LSeries.DirichletContinuation import Mathlib.Order.Interval.Finset.Nat open Finset ArithmeticFunction Set
Formal statement
namespace GRH
theorem primitive_nonprincipal_fourth_power_ramp_window_certificates :
∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q), χ.IsPrimitive → χ ≠ 1 →
∀ θ : ℝ, 1/2 < θ → θ ≤ (0.8749570698:ℝ) → ∃ δ C : ℝ, 0 < δ ∧ 0 ≤ C ∧
∀ K₀ : ℕ, ∃ K : ℕ, K₀ ≤ K ∧ 1 ≤ K ∧
∀ j : ℕ, K ≤ j → (j-1)^4 ≤ ⌊((K^4 : ℕ):ℝ)^(1+δ)⌋₊+1 →
let k := j^4
(∑ 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 GRHSource
Sparse sampling of the integer-knot certificates in https://prove2.me/theorems/bcdc1c37-1d9b-4169-9472-b95a87c49451.