GRH least prime in is (Chowla)
ProvedGRH.grh_implies_least_prime_modEqAssume 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 .
There exists an absolute constant such that for every modulus and every with , the arithmetic progression contains a prime with
Equivalently, the least prime in the progression is at most . The constant is independent of and . This is Chowla's 1934 conditional bound on the least prime in an arithmetic progression.
Formalization Note. The source's bound is vacuous at (where but the least prime is ), so moduli are restricted to ; coprimality is necessary for the progression to contain any prime. The existential form ("some prime below the bound") is equivalent to the statement about the least prime, since the least prime is at most any prime in the progression.
import Mathlib
namespace GRH
theorem grh_implies_least_prime_modEq
(hGRH : ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q) (s : ℂ),
(1 / 2 : ℝ) < s.re → ¬ (χ = 1 ∧ s = 1) → DirichletCharacter.LFunction χ s ≠ 0) :
∃ K : ℝ, ∀ (q : ℕ) (hq : 2 ≤ q) (a : ℕ) (ha : a.Coprime q),
∃ p : ℕ, p.Prime ∧ p ≡ a [MOD q] ∧ (p : ℝ) ≤ K * (q : ℝ) ^ 2 * (Real.log q) ^ 2 := by
sorry
end GRHRead-back
What the Lean code literally says, in plain math · Qwen (main-agent blind pass; no independent sub-agent available in this environment)
Assume hGRH: for every natural , every complex Dirichlet character modulo , and every complex with , excluding the simultaneous case , , the analytically continued -function is nonzero.
Then there exists a real number — a single , chosen before the moduli — such that for every natural and every natural with , there exists a natural number which is prime, satisfies , and whose cast to obeys
with cast to and the natural logarithm; ensures . No positivity is explicitly required of . No claim is made for or . The residue may exceed (only its class modulo matters). The statement asserts the existence of some prime below the bound in each progression; it does not designate a specific "least prime" object.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.