dirichlet_theorem_primes_ap
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.
Dirichlet's theorem: Infinitely many primes in any AP a, a+q, a+2q,... with gcd(a,q)=1.
Why this node was retired
The posted statement is
import Mathlib
theorem dirichlet_theorem_primes_ap (a q : ℕ) (hq : 2 ≤ q) (ha : Nat.Coprime a q) :
{p : ℕ | Nat.Prime p ∧ p % q = a}.Infinite := by
sorry
A representative a outside [0,q) is compared directly to a remainder.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Replace p%q=a by p%q=a%q, or impose a<q.
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 dirichlet_theorem_primes_ap (a q : ℕ) (hq : 2 ≤ q) (ha : Nat.Coprime a q) :
{p : ℕ | Nat.Prime p ∧ p % q = a}.Infinite := by
sorry