A good pair has no congruent-shift prime
Provedgpy_goodPair_noncongnumber-theory
A pair good at a coordinate i never has a prime p dividing some coordinate modulus lcm(d_j, e_j) with h_i congruent to h_j modulo p: the witness satisfies p dividing w + h_j, the congruence gives p dividing w + h_i, and p dividing the combined modulus, contradicting coprimality. Formalization Note: goodness is written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_goodPair_noncong {k : ℕ} {h d e : Fin k → ℕ} {i : Fin k}
{p : ℕ} (hp : Nat.Prime p)
(hg : ∃ w, (∀ j, Nat.lcm (d j) (e j) ∣ w + h j) ∧
Nat.Coprime (w + h i)
(Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j)))) {j : Fin k}
(hj : p ∣ Nat.lcm (d j) (e j)) : ¬ h i ≡ h j [MOD p] := by sorrySource
GPY defect control: exact characterizations and exact sum identities for the compatible-but-not-good (defect) pairs