Good pairs factorize prime by prime over the combined modulus
Provedgpy_goodPair_iff_localnumber-theory
For squarefree products, a pair (d, e) is good at a coordinate i — some witness w satisfies lcm (d j) (e j) ∣ w + h j at every coordinate and w + h i is coprime to the combined modulus L — if and only if at every prime p dividing L, all coordinates whose lcm is divisible by p have congruent shifts modulo p, and no such coordinate's shift is congruent to h i modulo p. Admissibility is not a hypothesis. Formalization Note: goodness is written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_goodPair_iff_local {k : ℕ} {h d e : Fin k → ℕ} {i : Fin k}
(hsqd : Squarefree (∏ j, d j)) (hsqe : Squarefree (∏ j, e j)) :
(∃ 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)))) ↔
∀ p, Nat.Prime p →
p ∣ Finset.lcm Finset.univ (fun j => Nat.lcm (d j) (e j)) →
(∀ j, p ∣ Nat.lcm (d j) (e j) → ∀ j', p ∣ Nat.lcm (d j') (e j') →
h j ≡ h j' [MOD p]) ∧
(∀ j, p ∣ Nat.lcm (d j) (e j) → ¬ h i ≡ h j [MOD p]) := by sorrySource
GPY good-count local evaluation, formalized from Mathlib (prime factorization of the good-pair condition)