Membership in the finite difference-prime set
Provedgpy_mem_diffPrimeFinsetnumber-theory
A prime belongs to the finite set of prime divisors of the nonzero differences |h_i - h_j| for j different from i exactly when it divides some such difference. The set is fixed by the tuple h and the coordinate i alone. Formalization Note: the set is written out as a biUnion over the filtered index set, in Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_mem_diffPrimeFinset {k : ℕ} {h : Fin k → ℕ} {i : Fin k}
{p : ℕ} :
p ∈ (Finset.univ.filter (fun j : Fin k => j ≠ i)).biUnion
(fun j => (Int.natAbs ((h i : ℤ) - (h j : ℤ))).primeFactors) ↔
∃ j, j ≠ i ∧ p ∈ (Int.natAbs ((h i : ℤ) - (h j : ℤ))).primeFactors := by sorrySource
GPY defect control: exact characterizations and exact sum identities for the compatible-but-not-good (defect) pairs