A good pair has trivial i-th coordinates
Provedgpy_goodPair_coord_eq_onenumber-theory
If a support pair is good at a coordinate , then . This is forced, not assumed: the -th coordinate modulus divides both the witness shift and the combined modulus , hence divides their gcd, which is by goodness, hence equals , forcing both coordinates to be . This holds unconditionally and is the formal shadow of the classical fact that a prime has no divisor strictly between and itself. Formalization Note: goodness is written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_goodPair_coord_eq_one {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)))) :
d i = 1 ∧ e i = 1 := by sorrySource
GPY first-moment comparison, formalized from Mathlib (compatible pairs, good pairs, and the singular sum)