Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The good-pair count factors as a product of local counts

Proved
gpy_goodCountAtL_eq_prod_local

by pitimespi · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For squarefree D, E with D at most R and E at most R, the good-pair count at modulus lcm D E equals the product over the prime divisors of lcm D E of the local choice counts. No admissibility hypothesis. Formalization Note: the count, support, goodness, and local choice finsets are written out in Mathlib terms, with no local definitions.

Preamble
import Mathlib
open Classical
Formal statement
theorem gpy_goodCountAtL_eq_prod_local {k : ℕ} {h : Fin k → ℕ} {R : ℕ}
    {i : Fin k} {D E : ℕ} (hsqD : Squarefree D) (hsqE : Squarefree E)
    (hDR : D ≤ R) (hER : E ≤ R) :
    ((((Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
        (fun d => ∏ i, d i ≤ R) ×ˢ
      (Fintype.piFinset (fun _ : Fin k => Finset.Icc 1 R)).filter
        (fun d => ∏ i, d i ≤ R)).filter
      (fun p => ∏ j, p.1 j = D ∧ ∏ j, p.2 j = E ∧
        (∃ w, (∀ j, Nat.lcm (p.1 j) (p.2 j) ∣ w + h j) ∧
          Nat.Coprime (w + h i)
            (Finset.lcm Finset.univ (fun j => Nat.lcm (p.1 j) (p.2 j)))) ∧
        Finset.lcm Finset.univ (fun j => Nat.lcm (p.1 j) (p.2 j)) = Nat.lcm D E))).card
      = ∏ p ∈ (Nat.lcm D E).primeFactors,
          ((Finset.univ : Finset (Option (Fin k) × Option (Fin k))).filter
            (fun ab => (ab.1.isSome ↔ p ∣ D) ∧ (ab.2.isSome ↔ p ∣ E) ∧
              (∀ 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]))).card  := by sorry
Source
GPY good-count product formula via the fiber bijection, formalized from Mathlib (no local definitions in statements)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me