A congruent-shift prime kills goodness
Provedgpy_not_goodPair_of_prime_congnumber-theory
Contrapositive of the previous statement: a prime dividing a coordinate modulus with a congruent shift implies the pair is not good at i. Formalization Note: goodness is written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_not_goodPair_of_prime_cong {k : ℕ} {h d e : Fin k → ℕ}
{i : Fin k} {p : ℕ} (hp : Nat.Prime p) {j : Fin k}
(hj : p ∣ Nat.lcm (d j) (e j)) (hcong : h i ≡ h j [MOD p]) :
¬ (∃ 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)))) := by sorrySource
GPY defect control: exact characterizations and exact sum identities for the compatible-but-not-good (defect) pairs