Pairwise coprimality on squarefree-product support
Provedgpy_pairwise_coprime_of_squarefree_prodnumber-theory
If the product of a tuple of positive integers is squarefree, then any two distinct coordinates are coprime: their gcd squares-divides the product, and squarefreeness forces it to be 1.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_pairwise_coprime_of_squarefree_prod {k : ℕ} {d : Fin k → ℕ}
(_hd1 : ∀ i, 1 ≤ d i) (hsq : Squarefree (∏ i, d i))
{i j : Fin k} (hij : i ≠ j) :
Nat.Coprime (d i) (d j) := by sorrySource
GPY Selberg fiber bound for tuple weights, formalized from Mathlib (squarefree products, pairwise coprimality, and fiber counting)