Uniform finite arithmetic bound for the square-sampled corrected prime ramp
OpenMasulloRH.finite_square_prime_energy_capexplicit-formulaprime-countingriemann-hypothesis
For every natural N, the sum for k=4,...,N+3 of G(k²)²/[k³(1+log k)²] is at most 81. Here G(x)=Σₙ≤ₓ Λ(n)(x/n−1)₊−x(log x−1−γ). These are explicit finite nonnegative sums. There is no density, asymptotic, zero-location or unknown-constant input in the statement.
Preamble
import Definitions.Def_MasulloRH_RegularizedTrace import Mathlib set_option autoImplicit false
Formal statement
open Finset ArithmeticFunction MeasureTheory Set
namespace MasulloRH
theorem finite_square_prime_energy_cap (N : ℕ) :
let G (x : ℝ) := (∑ n ∈ range (⌊x⌋₊+1),vonMangoldt n*max (x/(n:ℝ)-1) 0) -
x*(Real.log x-1-Real.eulerMascheroniConstant)
(∑ n ∈ range N, let k := (n:ℝ)+4; (G (k^2))^2/(k^3*(1+Real.log k)^2)) ≤ 81 := by sorry
end MasulloRHSource
Open arithmetic criterion for the Masullo RH mission. The proved square-sampling equivalence and the explicit finite-height prime-mass theorem translate this bound into the cofinal_approximate_prime_mass_certificates frontier 1e478002.