The pi-type choice function agrees with the choice on the finset
Provedgpy_piChoiceFun_applynumber-theory
The plain function underlying a pi-type element agrees with the given choice function at every prime in the finset, and is (none, none) elsewhere. Formalization Note: the function is written out in Mathlib terms.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_piChoiceFun_apply {k : ℕ} {s : Finset ℕ}
{f : ∀ p, p ∈ s → Option (Fin k) × Option (Fin k)} {p : ℕ} (hp : p ∈ s) :
(if hp' : p ∈ s then f p hp' else (none, none)) = f p hp := by sorrySource
GPY good-count product formula via the fiber bijection, formalized from Mathlib (no local definitions in statements)