Every good pair is compatible
Provedgpy_goodPair_compatiblenumber-theory
A support pair is good at a coordinate when some witness satisfies the joint divisibility system and is coprime to the combined modulus . Such a pair is always compatible: the compatibility congruences are just differences of two divisibilities of the witness, reduced modulo the gcd of the two coordinate moduli. This holds unconditionally, for any tuple and any pair. Formalization Note: goodness and compatibility are both written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_goodPair_compatible {k : ℕ} {h d e : Fin k → ℕ} {i : Fin k}
(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)))) :
∀ i ∈ Finset.univ, ∀ j ∈ Finset.univ,
h i ≡ h j [MOD Nat.gcd (Nat.lcm (d i) (e i)) (Nat.lcm (d j) (e j))] := by sorrySource
GPY first-moment comparison, formalized from Mathlib (compatible pairs, good pairs, and the singular sum)