Lemma 10 — infinitely many primes
ProvedRobersonCx.lemma_10graph-immersionsgraph-minorsgraph-theoryhomomorphism-countsp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let admit an integer with and . Then the set
is infinite.
The primes of are the moduli for which Theorem 9 excludes the base graph from and .
Differences from the source:
- encoding: congruences modulo → equalities of casts in
ZMod r; reason: same instances
Preamble
import Mathlib set_option autoImplicit false
Formal statement
namespace RobersonCx
/-- Lemma 10 (Kristjánsson, *Counterexamples to the Strong Roberson Conjecture*, arXiv:2610.03550 (version of 2 November 2026, sha256 1b70a7c6…), §4.2, p.10 (PDF p.12)). Let `r ≥ 2` admit an integer `a` with `gcd(a, r) = 1` and
`a ≢ ±1 (mod r)`. Then the set `P_r := {p : p is prime, gcd(p, r) = 1, p ≢ ±1 (mod r)}` is infinite.
**Formalization Note** Congruences mod `r` are equalities in `ZMod r`. -/
theorem lemma_10 (r : ℕ) (hr : 2 ≤ r)
(ha : ∃ a : ℤ, Int.gcd a r = 1 ∧ (a : ZMod r) ≠ 1 ∧ (a : ZMod r) ≠ -1) :
{p : ℕ | p.Prime ∧ Nat.Coprime p r ∧ (p : ZMod r) ≠ 1 ∧ (p : ZMod r) ≠ -1}.Infinite := by sorry
end RobersonCx
Source
Kristjánsson, Counterexamples to the Strong Roberson Conjecture, arXiv:2610.03550 (version of 2 November 2026, sha256 1b70a7c6…), Lemma 10, p.10 (PDF p.12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.