Membership in the local choice finset, unfolded
Provedgpy_mem_localGoodChoiceFinsetnumber-theory
A pair of optional coordinates lies in the local choice finset at a prime p exactly when its some-pattern matches the divisibility pattern, all coordinates receiving p have congruent shifts modulo p, and none is congruent to h i modulo p. Formalization Note: the local choice finset is written out in Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_mem_localGoodChoiceFinset {k : ℕ} {h : Fin k → ℕ} {i : Fin k}
{p : ℕ} {hd he : Prop} [Decidable hd] [Decidable he]
{ab : Option (Fin k) × Option (Fin k)} :
ab ∈ (Finset.univ : Finset (Option (Fin k) × Option (Fin k))).filter (fun ab =>
(ab.1.isSome ↔ hd) ∧ (ab.2.isSome ↔ he) ∧
(∀ j j', (ab.1 = some j ∨ ab.2 = some j) →
(ab.1 = some j' ∨ ab.2 = some j') → h j ≡ h j' [MOD p]) ∧
(∀ j, (ab.1 = some j ∨ ab.2 = some j) → ¬ h i ≡ h j [MOD p])) ↔
(ab.1.isSome ↔ hd) ∧ (ab.2.isSome ↔ he) ∧
(∀ j j', (ab.1 = some j ∨ ab.2 = some j) →
(ab.1 = some j' ∨ ab.2 = some j') → h j ≡ h j' [MOD p]) ∧
(∀ j, (ab.1 = some j ∨ ab.2 = some j) → ¬ h i ≡ h j [MOD p]) := by sorrySource
GPY good-count product formula via the fiber bijection, formalized from Mathlib (no local definitions in statements)