GRH one-logarithm Chebyshev lower bound
OpenGRH.grh_implies_thetaAP_square_root_logAssume the generalized Riemann hypothesis in the mission's zero-free form: whenever , for every modulus and every Dirichlet character modulo , except the principal-character pole at .
Then there is an absolute constant such that for every modulus , every coprime to , and every real the prime Chebyshev function in the progression satisfies
where .
This is the one-logarithm (sharp) form of the effective prime number theorem for in arithmetic progressions. The standard consequence of GRH carries two logarithms, (cf. GRH.grh_implies_psiAP_square_root); the extra logarithm is precisely what Chowla's least-prime bound cannot absorb, so this strictly sharper child is the analytic input of the reduction of GRH.grh_implies_least_prime_modEq. The constant is uniform in and — uniformity is what forces the bridge constant to be absolute.
import Mathlib
namespace GRH
/-- **Sharp one-logarithm Chebyshev lower bound in arithmetic progressions under GRH.**
Assume the generalized Riemann hypothesis in the mission's zero-free form: L(s,χ) ≠ 0
whenever Re(s) > 1/2, for every modulus q ≥ 1 and every Dirichlet character χ modulo q,
except the principal-character pole at s = 1. Then there is an *absolute* constant C ≥ 0 such
that for every modulus q ≥ 1, every a with gcd(a, q) = 1, and every real x ≥ 2,
θ(x; q, a) ≥ x / φ(q) - C * sqrt x * log x,
where θ(x; q, a) = ∑_{p ≤ x, p ≡ a (q)} log p is the prime Chebyshev function of the residue
class (the sum is over primes only, written out explicitly).
This is the one-logarithm (sharp) form of the effective prime number theorem for θ in
progressions; the standard consequence of GRH carries two logarithms, C * sqrt x * (log x)^2
(compare `GRH.grh_implies_psiAP_square_root`). The extra logarithm is exactly what Chowla's
least-prime bound K * q^2 * (log q)^2 cannot absorb, which is why this sharper child is needed
for `GRH.grh_implies_least_prime_modEq`. The constant C is uniform in q and a; uniformity is
what makes the balancing constant K of the bridge absolute. -/
theorem grh_implies_thetaAP_square_root_log
(hGRH : ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q) (s : ℂ),
(1 / 2 : ℝ) < s.re → ¬ (χ = 1 ∧ s = 1) → DirichletCharacter.LFunction χ s ≠ 0) :
∃ C : ℝ, 0 ≤ C ∧
∀ (q a : ℕ), q ≠ 0 → a.Coprime q →
∀ x : ℝ, 2 ≤ x →
x / (q.totient : ℝ) - C * Real.sqrt x * Real.log x ≤
∑ n ∈ (Finset.Ioc 0 ⌊x⌋₊).filter (fun n => n ≡ a [MOD q] ∧ n.Prime),
Real.log (n : ℝ) := by sorry
end GRH