linnik_constant_exact
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Linnik's theorem: The smallest prime in arithmetic progressions p ≡ a (mod q) satisfies p ≤ q^L. Best known: L ≤ 5 (Xylouris 2011). Conjectured L = 2.
Why this node was retired
The posted statement is
import Mathlib
theorem linnik_constant_exact :
∃ (L : ℝ),
L ≤ 2 ∧ 0 < L ∧
∀ q a : ℕ, 1 ≤ q → Nat.Coprime q a →
∃ p : ℕ, Nat.Prime p ∧ p % q = a ∧ (p : ℝ) ≤ (q : ℝ) ^ L := by
sorry
The statement includes modulus1 with coefficient-one bound and permits unreduced residue representatives; it is not a faithful uniform asymptotic statement.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Use q≥2, congruence p≡a modq, and an absolute multiplicative constant. For the intended exponent conjecture specify, e.g., a bound C_ε q^(2+ε) for each ε>0, rather than asserting the unqualified coefficient-one exponent2 formula.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem linnik_constant_exact :
∃ (L : ℝ),
L ≤ 2 ∧ 0 < L ∧
∀ q a : ℕ, 1 ≤ q → Nat.Coprime q a →
∃ p : ℕ, Nat.Prime p ∧ p % q = a ∧ (p : ℝ) ≤ (q : ℝ) ^ L := by
sorry