Effective PNT for in arithmetic progressions under GRH
ProvedGRH.grh_implies_psiAP_square_rootdirichlet-l-functionsgrhnumber-theory
Assume the generalized Riemann hypothesis in the zero-free form used in this mission: for every modulus , every Dirichlet character and every complex with , the Dirichlet -function does not vanish, apart from the pole of the principal character at . Fix a modulus and an integer with . Then there exists a constant such that for every real ,
where is the Chebyshev function restricted to the residue class . In other words, under GRH the von Mangoldt mass in a reduced residue class equals up to a square-root-scale error times a logarithmic factor; this is the -form of the effective prime number theorem in arithmetic progressions under GRH.
Preamble
import Mathlib import Definitions.Def_ArtinBV
Formal statement
namespace GRH
/-- **Effective prime number theorem for $\psi$ in arithmetic progressions under GRH.**
Assume the generalized Riemann hypothesis in the mission's zero-free form: $L(s,\chi)\ne 0$
whenever $\Re(s)>1/2$, for every modulus $q\ge 1$ and every Dirichlet character $\chi$ modulo $q$,
except the principal-character pole at $s=1$. Fix $q\ge1$, $a$ with $\gcd(a,q)=1$. Then there is a
constant $C\ge0$ such that for every real $x\ge2$,
$$\bigl|\psi(x;q,a)-\tfrac{x}{\varphi(q)}\bigr|\;\le\;C\,\sqrt{x}\,(\log x)^2,$$
where $\psi(x;q,a)=\sum_{n\le x,\ n\equiv a\ (q)}\Lambda(n)$ is `ArtinPrimitiveRoots.psiAP ⌊x⌋₊ q a`.
This is the Chebyshev-function form of the effective Dirichlet prime number theorem under GRH;
partial summation turns it into $\pi(x;q,a)=\mathrm{Li}(x)/\varphi(q)+O(x^{1/2+\varepsilon})$. -/
theorem grh_implies_psiAP_square_root
(hGRH : ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q) (s : ℂ),
(1 / 2 : ℝ) < s.re → ¬ (χ = 1 ∧ s = 1) → DirichletCharacter.LFunction χ s ≠ 0)
(q a : ℕ) (hq : q ≠ 0) (ha : a.Coprime q) :
∃ C : ℝ, 0 ≤ C ∧ ∀ x : ℝ, 2 ≤ x →
|ArtinPrimitiveRoots.psiAP ⌊x⌋₊ q a - x / (q.totient : ℝ)| ≤
C * x ^ ((1 : ℝ) / 2) * (Real.log x) ^ 2 := by sorry
end GRHSource
Decomposition of the prove2.me node GRH.grh_implies_primeCountingAP (GRH mission); effective prime number theorem in arithmetic progressions under the generalized Riemann hypothesis.